id
float64
706
1.8k
title
stringlengths
1
343
abstract
stringlengths
6
6.09k
categories
stringlengths
5
125
processed_abstract
stringlengths
2
5.96k
tokenized_abstract
stringlengths
8
8.74k
centroid
stringlengths
2.1k
2.17k
1,803.03367
NeuroStorm: Accelerating Brain Science Discovery in the Cloud
Neuroscientists are now able to acquire data at staggering rates across spatiotemporal scales. However, our ability to capitalize on existing datasets, tools, and intellectual capacities is hampered by technical challenges. The key barriers to accelerating scientific discovery correspond to the FAIR data principles: findability, global access to data, software interoperability, and reproducibility/re-usability. We conducted a hackathon dedicated to making strides in those steps. This manuscript is a technical report summarizing these achievements, and we hope serves as an example of the effectiveness of focused, deliberate hackathons towards the advancement of our quickly-evolving field.
q-bio.OT
neuroscientists are now able to acquire data at staggering rates across spatiotemporal scales however our ability to capitalize on existing datasets tools and intellectual capacities is hampered by technical challenges the key barriers to accelerating scientific discovery correspond to the fair data principles findability global access to data software interoperability and reproducibilityreusability we conducted a hackathon dedicated to making strides in those steps this manuscript is a technical report summarizing these achievements and we hope serves as an example of the effectiveness of focused deliberate hackathons towards the advancement of our quicklyevolving field
[['neuroscientists', 'are', 'now', 'able', 'to', 'acquire', 'data', 'at', 'staggering', 'rates', 'across', 'spatiotemporal', 'scales', 'however', 'our', 'ability', 'to', 'capitalize', 'on', 'existing', 'datasets', 'tools', 'and', 'intellectual', 'capacities', 'is', 'hampered', 'by', 'technical', 'challenges', 'the', 'key', 'barriers', 'to', 'accelerating', 'scientific', 'discovery', 'correspond', 'to', 'the', 'fair', 'data', 'principles', 'findability', 'global', 'access', 'to', 'data', 'software', 'interoperability', 'and', 'reproducibilityreusability', 'we', 'conducted', 'a', 'hackathon', 'dedicated', 'to', 'making', 'strides', 'in', 'those', 'steps', 'this', 'manuscript', 'is', 'a', 'technical', 'report', 'summarizing', 'these', 'achievements', 'and', 'we', 'hope', 'serves', 'as', 'an', 'example', 'of', 'the', 'effectiveness', 'of', 'focused', 'deliberate', 'hackathons', 'towards', 'the', 'advancement', 'of', 'our', 'quicklyevolving', 'field']]
[-0.08808973998312357, 0.024110710029752545, -0.0605469343641384, 0.040947501405633496, -0.15552761107376153, -0.09507159494979123, 0.06817920903091902, 0.40999379385631163, -0.2504934334288259, -0.3601964027774367, 0.12841181358665352, -0.28681988450749724, -0.09889690297435723, 0.23148650813663563, -0.12489377539330254, 0.0892392760372956, 0.09599111710833692, -0.03420566304863154, -0.0005464042884881024, -0.2929013053282768, 0.30055647412990477, 0.1421771836160058, 0.3587915980267328, 0.10711921800623883, 0.06816805896968427, -0.06469310425058171, -0.11365798489538605, -0.05191990665088479, -0.1077420354135089, 0.18929274571077018, 0.36535096350688856, 0.19932779143717919, 0.377679549403243, -0.47971277876378415, -0.1587838458983422, 0.0476899344760638, 0.1386347009626391, 0.11675571569559487, -0.07999038761404885, -0.30308950471609913, 0.047109602295517264, -0.14074151966065823, -0.14492616886887086, -0.1390863469300362, -0.0035765470340745624, 0.01943593582133302, -0.21505334532236334, -0.0190379020686333, 0.015331899624440697, 0.11347278222380268, 0.009813352507170659, -0.12525862103819355, 0.039818272685406955, 0.22434114667863309, 0.09929634431430784, 0.03512351704341779, 0.11718528980586249, -0.14215461348162983, -0.1728333980663792, 0.36421453547510474, -0.0016230894892302517, -0.10887389541040737, 0.2152907772828917, -0.08368627197917673, -0.19138809311930294, 0.08720885321579791, 0.1911969724530866, 0.044487928853953605, -0.17846475693827066, 0.047370008313849285, 0.0792653759593492, 0.1630439913043609, 0.02388583591903795, 0.033968929830774826, 0.22678323230286548, 0.2469473894132854, 0.02466413713889299, 0.08383981268827363, -0.05256262008973223, -0.1041834142294477, -0.24141312021490924, -0.12021939824898165, -0.16054025129159236, 0.018740818490386828, 0.016135677782745755, -0.10409248251836378, 0.38497406301590115, 0.2533561147974579, 0.13010781786563183, 0.03449062313494314, 0.3429117353203205, -0.05697614838660869, 0.12468732979435188, 0.05730616896423501, 0.20112988491962244, 0.042011781707185364, 0.2103012139540534, -0.1454525671510415, 0.09610859324623432, -0.05005813056377919]
1,803.03368
Fundamentals of the orbit and response for TianQin
TianQin is a space-based laser interferometric gravitational wave detector aimed at detecting gravitational waves at low frequencies (0.1 mHz -- 1 Hz). It is formed by three identical drag-free spacecrafts in an equilateral triangular constellation orbiting around the Earth. The distance between each pair of spacecrafts is approximately $1.7 \times 10^{5} ~\rm{km}$. The spacecrafts are interconnected by infrared laser beams forming up to three Michelson-type interferometers. The detailed mission design and the study of science objectives for the TianQin project depend crucially on the orbit and the response of the detector. In this paper, we provide the analytic expressions for the coordinates of the orbit for each spacecraft in the heliocentric-ecliptic coordinate system to the leading orders. This enables a sufficiently accurate study of science objectives and data analysis, and serves as a first step to further orbit design and optimization. We calculate the response of a single Michelson detector to plane gravitational waves in arbitrary waveform which is valid in the full range of the sensitive frequencies. It is then used to generate the more realistic sensitivity curve of TianQin. We apply this model on a reference white-dwarf binary as a proof of principle.
gr-qc astro-ph.IM
tianqin is a spacebased laser interferometric gravitational wave detector aimed at detecting gravitational waves at low frequencies 01 mhz 1 hz it is formed by three identical dragfree spacecrafts in an equilateral triangular constellation orbiting around the earth the distance between each pair of spacecrafts is approximately 17 times 105 rmkm the spacecrafts are interconnected by infrared laser beams forming up to three michelsontype interferometers the detailed mission design and the study of science objectives for the tianqin project depend crucially on the orbit and the response of the detector in this paper we provide the analytic expressions for the coordinates of the orbit for each spacecraft in the heliocentricecliptic coordinate system to the leading orders this enables a sufficiently accurate study of science objectives and data analysis and serves as a first step to further orbit design and optimization we calculate the response of a single michelson detector to plane gravitational waves in arbitrary waveform which is valid in the full range of the sensitive frequencies it is then used to generate the more realistic sensitivity curve of tianqin we apply this model on a reference whitedwarf binary as a proof of principle
[['tianqin', 'is', 'a', 'spacebased', 'laser', 'interferometric', 'gravitational', 'wave', 'detector', 'aimed', 'at', 'detecting', 'gravitational', 'waves', 'at', 'low', 'frequencies', '01', 'mhz', '1', 'hz', 'it', 'is', 'formed', 'by', 'three', 'identical', 'dragfree', 'spacecrafts', 'in', 'an', 'equilateral', 'triangular', 'constellation', 'orbiting', 'around', 'the', 'earth', 'the', 'distance', 'between', 'each', 'pair', 'of', 'spacecrafts', 'is', 'approximately', '17', 'times', '105', 'rmkm', 'the', 'spacecrafts', 'are', 'interconnected', 'by', 'infrared', 'laser', 'beams', 'forming', 'up', 'to', 'three', 'michelsontype', 'interferometers', 'the', 'detailed', 'mission', 'design', 'and', 'the', 'study', 'of', 'science', 'objectives', 'for', 'the', 'tianqin', 'project', 'depend', 'crucially', 'on', 'the', 'orbit', 'and', 'the', 'response', 'of', 'the', 'detector', 'in', 'this', 'paper', 'we', 'provide', 'the', 'analytic', 'expressions', 'for', 'the', 'coordinates', 'of', 'the', 'orbit', 'for', 'each', 'spacecraft', 'in', 'the', 'heliocentricecliptic', 'coordinate', 'system', 'to', 'the', 'leading', 'orders', 'this', 'enables', 'a', 'sufficiently', 'accurate', 'study', 'of', 'science', 'objectives', 'and', 'data', 'analysis', 'and', 'serves', 'as', 'a', 'first', 'step', 'to', 'further', 'orbit', 'design', 'and', 'optimization', 'we', 'calculate', 'the', 'response', 'of', 'a', 'single', 'michelson', 'detector', 'to', 'plane', 'gravitational', 'waves', 'in', 'arbitrary', 'waveform', 'which', 'is', 'valid', 'in', 'the', 'full', 'range', 'of', 'the', 'sensitive', 'frequencies', 'it', 'is', 'then', 'used', 'to', 'generate', 'the', 'more', 'realistic', 'sensitivity', 'curve', 'of', 'tianqin', 'we', 'apply', 'this', 'model', 'on', 'a', 'reference', 'whitedwarf', 'binary', 'as', 'a', 'proof', 'of', 'principle']]
[-0.170691180895529, 0.12748484206670918, -0.07061414553637863, 0.02714363631425628, -0.055740644661902684, -0.08733671136354844, 0.015671103591355134, 0.3564676481535552, -0.18718303678258094, -0.3276369981588361, 0.10314845334475503, -0.28148520667434046, -0.11418116112617255, 0.2538182305864546, -0.014935522147217871, 0.05793630650961878, 0.08292006644410675, -0.005150796741656138, -0.07596072681016564, -0.17647025814772116, 0.25113372881583135, 0.12434919149050286, 0.199807382280422, -0.05602551952675178, 0.13308928532639297, 0.015293145452148325, -0.007850612827378851, -0.05308996916898174, -0.13798129279468055, 0.08757504873301042, 0.27056894927174624, 0.14989232885472747, 0.22973539564370085, -0.39910297848592174, -0.15699240996149777, 0.05629049474976648, 0.07901393401151803, 0.08416228622519001, -0.00924533181210046, -0.30220681536095845, 0.03894674588945438, -0.18342211789456364, -0.16716975282993496, 0.004044748466326783, 0.05497218261912002, 0.038656241388043265, -0.27348810802044954, -0.0008477018174951789, 0.023485816521763108, 0.05419605771089311, -0.0791963993534301, -0.0681349176526253, 0.015102046512916608, 0.10990576296465693, -0.0007410299779673546, 0.08274048989049974, 0.1296986756228644, -0.04679275905548166, -0.06742863242340713, 0.42153318548681207, -0.0669264635348625, -0.13317385636911838, 0.17873042328717487, -0.19989508060844605, -0.08848837975031393, 0.14324821836262014, 0.21867466153660814, 0.12529114663204025, -0.16382591637005847, 0.025286044033788327, 0.038985587853212704, 0.21067035782097843, 0.14528381881916924, 0.038945368720324704, 0.29437602601023727, 0.19030234925062853, 0.11821331743481496, 0.12809026384620006, -0.18256615263945544, -0.01641552169068953, -0.29640089680918447, -0.10961654117996526, -0.1647460940631753, 0.019830938229211267, -0.07693228076555624, -0.10521497981082359, 0.4100361408260434, 0.162663636555403, 0.13146091547403774, 0.009422958648155583, 0.3381011239373622, 0.07571353259619441, 0.05224534610064382, 0.02561203063642992, 0.31873061746802817, 0.09319307620834964, 0.08374010578975313, -0.19970689312110948, -0.005661043997159122, 0.027845017195780582]
1,803.03369
Bounds on the maximal Bochner-Riesz means for elliptic operators
We investigate $L^p$ boundedness of the maximal Bochner-Riesz means for self-adjoint operators of elliptic type. Assuming the finite speed of propagation for the associated wave operator, from the restriction type estimates we establish the sharp $L^p$ boundedness of the maximal Bochner-Riesz means for the elliptic operators. As applications, we obtain the sharp $L^p$ maximal bounds for the Schr\"odinger operators on asymptotically conic manifolds, the harmonic oscillator and its perturbations or elliptic operators on compact manifolds.
math.AP
we investigate lp boundedness of the maximal bochnerriesz means for selfadjoint operators of elliptic type assuming the finite speed of propagation for the associated wave operator from the restriction type estimates we establish the sharp lp boundedness of the maximal bochnerriesz means for the elliptic operators as applications we obtain the sharp lp maximal bounds for the schrodinger operators on asymptotically conic manifolds the harmonic oscillator and its perturbations or elliptic operators on compact manifolds
[['we', 'investigate', 'lp', 'boundedness', 'of', 'the', 'maximal', 'bochnerriesz', 'means', 'for', 'selfadjoint', 'operators', 'of', 'elliptic', 'type', 'assuming', 'the', 'finite', 'speed', 'of', 'propagation', 'for', 'the', 'associated', 'wave', 'operator', 'from', 'the', 'restriction', 'type', 'estimates', 'we', 'establish', 'the', 'sharp', 'lp', 'boundedness', 'of', 'the', 'maximal', 'bochnerriesz', 'means', 'for', 'the', 'elliptic', 'operators', 'as', 'applications', 'we', 'obtain', 'the', 'sharp', 'lp', 'maximal', 'bounds', 'for', 'the', 'schrodinger', 'operators', 'on', 'asymptotically', 'conic', 'manifolds', 'the', 'harmonic', 'oscillator', 'and', 'its', 'perturbations', 'or', 'elliptic', 'operators', 'on', 'compact', 'manifolds']]
[-0.16484793042531237, 0.07426983047276735, -0.039160283555587136, 0.1635354926933845, -0.13212326634675264, -0.1254627399953703, -0.02120814467469851, 0.30661869501074157, -0.30967689377566177, -0.12714287767807642, 0.23140172062441708, -0.349443743104736, -0.08763995252860089, 0.2685698495277514, -0.09182668084899584, 0.1752904665710715, 0.04963975487897793, 0.09809938684105873, -0.18447596625114482, -0.18419237834711868, 0.46846300903707744, -0.06065483556439479, 0.16458541506590943, 0.08412032923971613, 0.061708429902791975, 0.041877547539770604, -0.002835443830117583, -0.11597943707058828, -0.20311636950199802, 0.18856862702096502, 0.2229197651464104, 0.02827223565429449, 0.23956322778016328, -0.4184196263551712, -0.19174085424592097, 0.23680208697294194, 0.1269160587588946, -0.032405603329340615, -0.048788882571582995, -0.3240761561195056, 0.051519580030192934, -0.06382400624454021, -0.26621214210987093, -0.08407489441645642, -0.016312656849622728, 0.10268411751991759, -0.348575950289766, 0.10437620672086875, 0.16747588286797205, 0.07521104698379834, -0.17479271269248178, -0.10590398988376061, -0.02625519510358572, 0.01721247670861582, -0.014205875104914108, -0.03974306537148853, 0.05226985650137067, -0.02893405854701996, -0.11855824649954835, 0.2776447562376658, -0.1267479980116089, -0.2666791468858719, 0.04930607419461012, -0.19117755875107834, -0.047403438221663236, 0.03988419733941555, 0.17200954261546333, 0.22745910341540973, -0.0848789942637086, 0.21461279224526758, -0.03976815419873068, 0.06953633087376754, 0.12426392450928687, 0.1204143400862813, 0.011244444251060486, 0.0481258816520373, 0.28078329561899107, 0.1324841228313744, 0.03107090327811117, -0.04368356448287765, -0.40282381941874823, -0.14019933486978212, -0.13989383247991402, 0.10724412196684474, -0.19115421081252862, -0.20653925130609424, 0.42875924035906793, 0.039362358301877974, 0.14855181644360224, 0.13289907459169625, 0.1697230560456713, 0.22813457400382806, 0.05893996773287654, 0.10556719856336713, 0.22122483626008033, 0.24316662915050982, 0.09939922461907069, -0.23881874229448538, -0.031015403357644876, 0.2877677148828904]
1,803.0337
Expert Finding in Heterogeneous Bibliographic Networks with Locally-trained Embeddings
Expert finding is an important task in both industry and academia. It is challenging to rank candidates with appropriate expertise for various queries. In addition, different types of objects interact with one another, which naturally forms heterogeneous information networks. We study the task of expert finding in heterogeneous bibliographical networks based on two aspects: textual content analysis and authority ranking. Regarding the textual content analysis, we propose a new method for query expansion via locally-trained embedding learning with concept hierarchy as guidance, which is particularly tailored for specific queries with narrow semantic meanings. Compared with global embedding learning, locally-trained embedding learning projects the terms into a latent semantic space constrained on relevant topics, therefore it preserves more precise and subtle information for specific queries. Considering the candidate ranking, the heterogeneous information network structure, while being largely ignored in the previous studies of expert finding, provides additional information. Specifically, different types of interactions among objects play different roles. We propose a ranking algorithm to estimate the authority of objects in the network, treating each strongly-typed edge type individually. To demonstrate the effectiveness of the proposed framework, we apply the proposed method to a large-scale bibliographical dataset with over two million entries and one million researcher candidates. The experiment results show that the proposed framework outperforms existing methods for both general and specific queries.
cs.IR cs.AI cs.CL cs.SI
expert finding is an important task in both industry and academia it is challenging to rank candidates with appropriate expertise for various queries in addition different types of objects interact with one another which naturally forms heterogeneous information networks we study the task of expert finding in heterogeneous bibliographical networks based on two aspects textual content analysis and authority ranking regarding the textual content analysis we propose a new method for query expansion via locallytrained embedding learning with concept hierarchy as guidance which is particularly tailored for specific queries with narrow semantic meanings compared with global embedding learning locallytrained embedding learning projects the terms into a latent semantic space constrained on relevant topics therefore it preserves more precise and subtle information for specific queries considering the candidate ranking the heterogeneous information network structure while being largely ignored in the previous studies of expert finding provides additional information specifically different types of interactions among objects play different roles we propose a ranking algorithm to estimate the authority of objects in the network treating each stronglytyped edge type individually to demonstrate the effectiveness of the proposed framework we apply the proposed method to a largescale bibliographical dataset with over two million entries and one million researcher candidates the experiment results show that the proposed framework outperforms existing methods for both general and specific queries
[['expert', 'finding', 'is', 'an', 'important', 'task', 'in', 'both', 'industry', 'and', 'academia', 'it', 'is', 'challenging', 'to', 'rank', 'candidates', 'with', 'appropriate', 'expertise', 'for', 'various', 'queries', 'in', 'addition', 'different', 'types', 'of', 'objects', 'interact', 'with', 'one', 'another', 'which', 'naturally', 'forms', 'heterogeneous', 'information', 'networks', 'we', 'study', 'the', 'task', 'of', 'expert', 'finding', 'in', 'heterogeneous', 'bibliographical', 'networks', 'based', 'on', 'two', 'aspects', 'textual', 'content', 'analysis', 'and', 'authority', 'ranking', 'regarding', 'the', 'textual', 'content', 'analysis', 'we', 'propose', 'a', 'new', 'method', 'for', 'query', 'expansion', 'via', 'locallytrained', 'embedding', 'learning', 'with', 'concept', 'hierarchy', 'as', 'guidance', 'which', 'is', 'particularly', 'tailored', 'for', 'specific', 'queries', 'with', 'narrow', 'semantic', 'meanings', 'compared', 'with', 'global', 'embedding', 'learning', 'locallytrained', 'embedding', 'learning', 'projects', 'the', 'terms', 'into', 'a', 'latent', 'semantic', 'space', 'constrained', 'on', 'relevant', 'topics', 'therefore', 'it', 'preserves', 'more', 'precise', 'and', 'subtle', 'information', 'for', 'specific', 'queries', 'considering', 'the', 'candidate', 'ranking', 'the', 'heterogeneous', 'information', 'network', 'structure', 'while', 'being', 'largely', 'ignored', 'in', 'the', 'previous', 'studies', 'of', 'expert', 'finding', 'provides', 'additional', 'information', 'specifically', 'different', 'types', 'of', 'interactions', 'among', 'objects', 'play', 'different', 'roles', 'we', 'propose', 'a', 'ranking', 'algorithm', 'to', 'estimate', 'the', 'authority', 'of', 'objects', 'in', 'the', 'network', 'treating', 'each', 'stronglytyped', 'edge', 'type', 'individually', 'to', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'framework', 'we', 'apply', 'the', 'proposed', 'method', 'to', 'a', 'largescale', 'bibliographical', 'dataset', 'with', 'over', 'two', 'million', 'entries', 'and', 'one', 'million', 'researcher', 'candidates', 'the', 'experiment', 'results', 'show', 'that', 'the', 'proposed', 'framework', 'outperforms', 'existing', 'methods', 'for', 'both', 'general', 'and', 'specific', 'queries']]
[-0.0626043674739514, -0.023036868294749747, -0.03155029553795225, 0.09113584408853287, -0.16972408064815156, -0.18221718403888312, 0.06791658708636926, 0.42514494239029615, -0.2525670195505996, -0.3852613904609907, 0.055882218190540164, -0.3124089255047488, -0.1614117209460305, 0.16300237651385768, -0.07623762089595501, 0.03487077505675958, 0.09967997870911416, 0.07050376155346565, -0.042207954344465524, -0.293879027015882, 0.3507712430547218, 0.03270839796997271, 0.34294206451054093, 0.014722002561095062, 0.09250631566192988, 0.014290646259748453, -0.10524558328141391, 0.014356556573860674, -0.07712036406172063, 0.20767322515540226, 0.3592431697823256, 0.2344685417079778, 0.3435636976375119, -0.37505136141637424, -0.21801144561860375, 0.08068350179022313, 0.12351607589936303, 0.08298339043022343, -0.04797631559028502, -0.349190254452395, 0.06833327045404092, -0.16716953559971606, 0.010707336595399422, -0.13425996136874682, 0.010936058372330458, -0.017434420325501764, -0.2806960341412058, 0.025326330857513984, 0.0518447173180411, 0.046562662264248274, -0.07361382847549058, -0.11611127755594196, 0.02592096568729208, 0.1907021286834434, 0.03032862184556654, 0.017002552478188264, 0.14111275602182424, -0.16149500905779662, -0.1606821662018512, 0.37655889284838967, -0.00763757279832839, -0.21724338957888856, 0.19930400126424894, -0.027672476026120486, -0.1897290297574154, 0.07295569404749921, 0.20899284904956952, 0.12690937453956944, -0.19424283550029645, -0.002329433067578, -0.05929676891170308, 0.18621012945879703, 0.04283530514337005, 0.04683650616867896, 0.20158244935042635, 0.2368931412226982, 0.02699416611151694, 0.1264375727634189, -0.05758294405500606, -0.11071004527243408, -0.21282375689495253, -0.1319976929703157, -0.15134648744620988, -0.05292678780516563, -0.14651250441920227, -0.1326418645944245, 0.39521643242731624, 0.20766169038255908, 0.17985552316321782, 0.031000881928841473, 0.3264451966042051, -0.0026259283112521443, 0.09874447395915988, 0.09695370291907189, 0.1336954763832477, 0.0009507628845738935, 0.13243277212615367, -0.1402291665891991, 0.11496173003153573, 0.05613668904606219]
1,803.03371
A volume-averaged nodal projection method for the Reissner-Mindlin plate model
We introduce a novel meshfree Galerkin method for the solution of Reissner-Mindlin plate problems that is written in terms of the primitive variables only (i.e., rotations and transverse displacement) and is devoid of shear-locking. The proposed approach uses linear maximum-entropy approximations and is built variationally on a two-field potential energy functional wherein the shear strain, written in terms of the primitive variables, is computed via a volume-averaged nodal projection operator that is constructed from the Kirchhoff constraint of the three-field mixed weak form. The stability of the method is rendered by adding bubble-like enrichment to the rotation degrees of freedom. Some benchmark problems are presented to demonstrate the accuracy and performance of the proposed method for a wide range of plate thicknesses.
math.NA
we introduce a novel meshfree galerkin method for the solution of reissnermindlin plate problems that is written in terms of the primitive variables only ie rotations and transverse displacement and is devoid of shearlocking the proposed approach uses linear maximumentropy approximations and is built variationally on a twofield potential energy functional wherein the shear strain written in terms of the primitive variables is computed via a volumeaveraged nodal projection operator that is constructed from the kirchhoff constraint of the threefield mixed weak form the stability of the method is rendered by adding bubblelike enrichment to the rotation degrees of freedom some benchmark problems are presented to demonstrate the accuracy and performance of the proposed method for a wide range of plate thicknesses
[['we', 'introduce', 'a', 'novel', 'meshfree', 'galerkin', 'method', 'for', 'the', 'solution', 'of', 'reissnermindlin', 'plate', 'problems', 'that', 'is', 'written', 'in', 'terms', 'of', 'the', 'primitive', 'variables', 'only', 'ie', 'rotations', 'and', 'transverse', 'displacement', 'and', 'is', 'devoid', 'of', 'shearlocking', 'the', 'proposed', 'approach', 'uses', 'linear', 'maximumentropy', 'approximations', 'and', 'is', 'built', 'variationally', 'on', 'a', 'twofield', 'potential', 'energy', 'functional', 'wherein', 'the', 'shear', 'strain', 'written', 'in', 'terms', 'of', 'the', 'primitive', 'variables', 'is', 'computed', 'via', 'a', 'volumeaveraged', 'nodal', 'projection', 'operator', 'that', 'is', 'constructed', 'from', 'the', 'kirchhoff', 'constraint', 'of', 'the', 'threefield', 'mixed', 'weak', 'form', 'the', 'stability', 'of', 'the', 'method', 'is', 'rendered', 'by', 'adding', 'bubblelike', 'enrichment', 'to', 'the', 'rotation', 'degrees', 'of', 'freedom', 'some', 'benchmark', 'problems', 'are', 'presented', 'to', 'demonstrate', 'the', 'accuracy', 'and', 'performance', 'of', 'the', 'proposed', 'method', 'for', 'a', 'wide', 'range', 'of', 'plate', 'thicknesses']]
[-0.12330658766171657, 0.057559980626010206, -0.08141414951225204, 0.0018494173668879123, -0.0654075067059314, -0.09340015736847254, -0.008810052846381363, 0.3200446921949129, -0.30683627910912037, -0.2785848935388706, 0.09291563368756478, -0.22711175493318742, -0.11860384017013567, 0.1894175442674559, -0.053674595329471796, 0.07947768402586053, 0.06782797600377413, -0.0007431858434718995, -0.10160548517034074, -0.22100022284906695, 0.3105508383009429, 0.00041300680657679385, 0.27043006703842526, 0.028171844372510416, 0.18255598207335333, -0.020721363525237305, -0.00401365074082778, 0.07926262825850613, -0.0889759740378748, 0.1250984094395256, 0.2201521574050065, 0.09628523109732812, 0.2683491178861365, -0.39200814310769155, -0.2122592081042576, 0.04267686400764568, 0.0996605470384017, 0.089949136387272, -0.03868355961181685, -0.25846352690661495, 0.08723782119148772, -0.1660364632656382, -0.14611361575051218, -0.11177457960645769, -0.026950545616694226, 0.036479892744105465, -0.3201635699365134, 0.12740898498118478, 0.02457847567813948, 0.059954089018293036, -0.07934302618450001, -0.14263414986015968, -0.032517317005179146, 0.05600218368263161, 0.03266062351494012, 0.020521573132589028, 0.11212984454040685, -0.09458344203443074, -0.06008400523665646, 0.40941696761807134, -0.08889163754618734, -0.2913640730837283, 0.15163617127397952, -0.06326872143463409, -0.07790062455883758, 0.1421651712172349, 0.18174227975185744, 0.16414158645832588, -0.16475880157764355, 0.09873538646146593, -0.017024871777773887, 0.17631434669625784, 0.08648206225465521, -0.021305286879689734, 0.14989410292488053, 0.17072724552501825, 0.06311407292738927, 0.1495649948685376, -0.10079222103804042, -0.10805872372112983, -0.33413173606203606, -0.1546792879023335, -0.21712658811391386, -0.028348285527822894, -0.10954290495229084, -0.22154252806847746, 0.41719832781833127, 0.10882619896053129, 0.11535416000757429, 0.05078645902570368, 0.2860976422651986, 0.13287509112303292, 0.08312300387923875, 0.06898016133538086, 0.24243219769179766, 0.16350483094642232, 0.08428292058712288, -0.23830794543268405, 0.04399149036342817, 0.14308410171758046]
1,803.03372
A cross-disciplinary introduction to quantum annealing-based algorithms
A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science, hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.
quant-ph
a central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems research in quantum computation involves contributions from both physics and computer science hence this article presents a concise introduction to basic concepts from both fields that are used in annealingbased quantum computation an alternative to the more familiar quantum gate model we introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems we introduce the structure of quantum annealingbased algorithms as well as two examples of this kind of algorithms for solving instances of the maxsat and minimum multicut problems an overview of the quantum annealing systems manufactured by dwave systems is also presented
[['a', 'central', 'goal', 'in', 'quantum', 'computing', 'is', 'the', 'development', 'of', 'quantum', 'hardware', 'and', 'quantum', 'algorithms', 'in', 'order', 'to', 'analyse', 'challenging', 'scientific', 'and', 'engineering', 'problems', 'research', 'in', 'quantum', 'computation', 'involves', 'contributions', 'from', 'both', 'physics', 'and', 'computer', 'science', 'hence', 'this', 'article', 'presents', 'a', 'concise', 'introduction', 'to', 'basic', 'concepts', 'from', 'both', 'fields', 'that', 'are', 'used', 'in', 'annealingbased', 'quantum', 'computation', 'an', 'alternative', 'to', 'the', 'more', 'familiar', 'quantum', 'gate', 'model', 'we', 'introduce', 'some', 'concepts', 'from', 'computer', 'science', 'required', 'to', 'define', 'difficult', 'computational', 'problems', 'and', 'to', 'realise', 'the', 'potential', 'relevance', 'of', 'quantum', 'algorithms', 'to', 'find', 'novel', 'solutions', 'to', 'those', 'problems', 'we', 'introduce', 'the', 'structure', 'of', 'quantum', 'annealingbased', 'algorithms', 'as', 'well', 'as', 'two', 'examples', 'of', 'this', 'kind', 'of', 'algorithms', 'for', 'solving', 'instances', 'of', 'the', 'maxsat', 'and', 'minimum', 'multicut', 'problems', 'an', 'overview', 'of', 'the', 'quantum', 'annealing', 'systems', 'manufactured', 'by', 'dwave', 'systems', 'is', 'also', 'presented']]
[-0.08242537243110265, 0.0714946869533485, -0.062233620788902044, 0.07924031231360619, -0.09446304184658562, -0.17674666439758285, 0.009558405023520155, 0.33307280587819954, -0.2984283244004473, -0.3618468046599232, 0.09667995016634985, -0.2406823707963614, -0.22070721246521263, 0.2808164116525886, -0.10670628412994762, 0.14351951079580055, 0.05866096881629132, -0.01279355222975616, -0.09243175240493763, -0.2768715179391781, 0.26653467442135, 0.03288664397191229, 0.26850522608112765, 0.06774914640974362, 0.06537254660061616, -0.01715564916444504, 0.005257293421035523, 0.02172900563763345, -0.14777691930949538, 0.17954654465018607, 0.37149778626147, 0.19490917964139953, 0.32694254217237945, -0.46192991254193816, -0.16311506759409575, 0.07181465204099796, 0.10566986058170989, 0.17333596020740943, -0.06328949632402595, -0.2600879052530645, 0.06303823318397489, -0.14915263983215588, -0.07081778237924856, -0.11930536191485931, -0.0072447885724935025, -0.035150373203899056, -0.2008561078199658, -0.00933541647720952, 0.03409029228222447, 0.06177783857086016, 0.0175417943381249, -0.11572451464941397, 0.1318452583749176, 0.11310696796178543, -0.029550350292565246, 0.008511848713490455, 0.12318895026863388, -0.20296221828047076, -0.27207112724221694, 0.4410715578671764, 0.04101860603601809, -0.16209684590627577, 0.21316027686492922, -0.0078037341008894145, -0.15943378689938553, 0.041975307428990215, 0.20469185710980503, 0.10669964546126293, -0.15007594299737215, 0.12031627654377029, 0.06309339940986212, 0.13275541646597797, -0.004995865935651476, 0.05074075644712567, 0.20121550632585936, 0.1486082145369009, 0.09437486180789112, 0.20491123020645532, -0.006255323433673338, -0.19025303483581144, -0.29812700208961307, -0.18872345599811524, -0.19832139297025553, 0.03955792234046385, -0.01711809343043355, -0.19678024686736, 0.3948819371067015, 0.2150955871637801, 0.12591590658378074, 0.008575574967407566, 0.3268212061426739, 0.08277299300500411, 0.05008816320632297, 0.0833421917324064, 0.15886870358821503, 0.17108213929082816, 0.15540946695460556, -0.18791758004654718, 0.014938506289207213, 0.05067639155587291]
1,803.03373
Accurate and Efficient Estimation of Small P-values with the Cross-Entropy Method: Applications in Genomic Data Analysis
$\textbf{Motivation:}$ Small $p$-values are often required to be accurately estimated in large-scale genomic studies for the adjustment of multiple hypothesis tests and the ranking of genomic features based on their statistical significance. For those complicated test statistics whose cumulative distribution functions are analytically intractable, existing methods usually do not work well with small $p$-values due to lack of accuracy or computational restrictions. We propose a general approach for accurately and efficiently estimating small $p$-values for a broad range of complicated test statistics based on the principle of the cross-entropy method and Markov chain Monte Carlo sampling techniques. $\textbf{Results:}$ We evaluate the performance of the proposed algorithm through simulations and demonstrate its application to three real-world examples in genomic studies. The results show that our approach can accurately evaluate small to extremely small $p$-values (e.g. $10^{-6}$ to $10^{-100}$). The proposed algorithm is helpful for the improvement of some existing test procedures and the development of new test procedures in genomic studies.
stat.AP
textbfmotivation small pvalues are often required to be accurately estimated in largescale genomic studies for the adjustment of multiple hypothesis tests and the ranking of genomic features based on their statistical significance for those complicated test statistics whose cumulative distribution functions are analytically intractable existing methods usually do not work well with small pvalues due to lack of accuracy or computational restrictions we propose a general approach for accurately and efficiently estimating small pvalues for a broad range of complicated test statistics based on the principle of the crossentropy method and markov chain monte carlo sampling techniques textbfresults we evaluate the performance of the proposed algorithm through simulations and demonstrate its application to three realworld examples in genomic studies the results show that our approach can accurately evaluate small to extremely small pvalues eg 106 to 10100 the proposed algorithm is helpful for the improvement of some existing test procedures and the development of new test procedures in genomic studies
[['textbfmotivation', 'small', 'pvalues', 'are', 'often', 'required', 'to', 'be', 'accurately', 'estimated', 'in', 'largescale', 'genomic', 'studies', 'for', 'the', 'adjustment', 'of', 'multiple', 'hypothesis', 'tests', 'and', 'the', 'ranking', 'of', 'genomic', 'features', 'based', 'on', 'their', 'statistical', 'significance', 'for', 'those', 'complicated', 'test', 'statistics', 'whose', 'cumulative', 'distribution', 'functions', 'are', 'analytically', 'intractable', 'existing', 'methods', 'usually', 'do', 'not', 'work', 'well', 'with', 'small', 'pvalues', 'due', 'to', 'lack', 'of', 'accuracy', 'or', 'computational', 'restrictions', 'we', 'propose', 'a', 'general', 'approach', 'for', 'accurately', 'and', 'efficiently', 'estimating', 'small', 'pvalues', 'for', 'a', 'broad', 'range', 'of', 'complicated', 'test', 'statistics', 'based', 'on', 'the', 'principle', 'of', 'the', 'crossentropy', 'method', 'and', 'markov', 'chain', 'monte', 'carlo', 'sampling', 'techniques', 'textbfresults', 'we', 'evaluate', 'the', 'performance', 'of', 'the', 'proposed', 'algorithm', 'through', 'simulations', 'and', 'demonstrate', 'its', 'application', 'to', 'three', 'realworld', 'examples', 'in', 'genomic', 'studies', 'the', 'results', 'show', 'that', 'our', 'approach', 'can', 'accurately', 'evaluate', 'small', 'to', 'extremely', 'small', 'pvalues', 'eg', '106', 'to', '10100', 'the', 'proposed', 'algorithm', 'is', 'helpful', 'for', 'the', 'improvement', 'of', 'some', 'existing', 'test', 'procedures', 'and', 'the', 'development', 'of', 'new', 'test', 'procedures', 'in', 'genomic', 'studies']]
[-0.026669134298023187, 0.020399418464750522, -0.06029336791743273, 0.16879176439603194, -0.0806081301222245, -0.13530269410144888, 0.08742286273902107, 0.41504525777491386, -0.21927393349264632, -0.3767338186069011, 0.1130966112931382, -0.22538237406984968, -0.1531253515247771, 0.27019748977845265, -0.07448867106892215, 0.1551457673641443, 0.13282762250772226, -0.013318183817227118, -0.05187191917273983, -0.2885029052337339, 0.2433391149630243, 0.1036672723807582, 0.34788001136731284, 0.028684739581361977, 0.07621094347534221, -0.023970807656505198, -0.07461878406938235, 0.039030546007631055, -0.1202304475436389, 0.1605153708841722, 0.2852056293320731, 0.21788784519201085, 0.33955649207434, -0.39983323601707116, -0.18962995674601704, 0.12119987255120475, 0.13762713398858714, 0.13250559486401906, -0.020077954103537608, -0.2888593756529333, 0.12211504204230933, -0.15687523902622316, -0.06744631317168849, -0.1545763367921723, -0.05731149900663621, 0.05759757815614202, -0.322492675264161, 0.10681069120999027, -0.0069492227572115995, 0.09442464061046266, -9.945380053359945e-05, -0.14671212282476934, 0.05971112319871596, 0.09659724864074902, 0.11152323228665376, -0.03167376715730899, 0.15984221924471217, -0.08194485328915461, -0.14888240515734744, 0.3512389980104266, -0.018419187101930874, -0.24713441523951743, 0.21873837099381307, -0.1181874169833349, -0.18812835469560804, 0.1378123279332927, 0.21078581225900156, 0.15858792711881065, -0.17295223518432873, 0.03449082308494246, 0.013847687448603365, 0.14481976301388802, 0.005958988788133522, -0.017640121818195045, 0.16470473462059718, 0.16786309293582566, -0.007342148632244588, 0.10829865278854803, -0.14615885634853873, -0.09994443716282177, -0.22983239299843125, -0.1200674375073996, -0.21971855628298326, -0.029761501639087848, -0.14016288921554387, -0.20505275540991025, 0.3607586323336329, 0.2524108860453973, 0.17518930226775273, 0.10455217587310563, 0.335053862441542, 0.05759241201244177, 0.07342533450485822, 0.03104649655632206, 0.1742167612568859, 0.06439618202242649, 0.0064499453735192246, -0.20041363066905793, 0.12995017573542003, -0.008083788209460067]
1,803.03374
A Consistent Spatially Adaptive Smoothed Particle Hydrodynamics Method for Fluid-Structure Interactions
A new consistent, spatially adaptive, smoothed particle hydrodynamics (SPH) method for Fluid-Structure Interactions (FSI) is presented. The method combines several attributes that have not been simultaneously satisfied by other SPH methods. Specifically, it is second-order convergent; it allows for resolutions spatially adapted with moving (translating and rotating) boundaries of arbitrary geometries; and, it accelerates the FSI solution as the adaptive approach leads to fewer degrees of freedom without sacrificing accuracy. The key ingredients in the method are a consistent discretization of differential operators, a \textit{posteriori} error estimator/distance-based criterion of adaptivity, and a particle-shifting technique. The method is applied in simulating six different flows or FSI problems. The new method's convergence, accuracy, and efficiency attributes are assessed by comparing the results it produces with analytical, finite element, and consistent SPH uniform high-resolution solutions as well as experimental data.
physics.flu-dyn physics.comp-ph
a new consistent spatially adaptive smoothed particle hydrodynamics sph method for fluidstructure interactions fsi is presented the method combines several attributes that have not been simultaneously satisfied by other sph methods specifically it is secondorder convergent it allows for resolutions spatially adapted with moving translating and rotating boundaries of arbitrary geometries and it accelerates the fsi solution as the adaptive approach leads to fewer degrees of freedom without sacrificing accuracy the key ingredients in the method are a consistent discretization of differential operators a textitposteriori error estimatordistancebased criterion of adaptivity and a particleshifting technique the method is applied in simulating six different flows or fsi problems the new methods convergence accuracy and efficiency attributes are assessed by comparing the results it produces with analytical finite element and consistent sph uniform highresolution solutions as well as experimental data
[['a', 'new', 'consistent', 'spatially', 'adaptive', 'smoothed', 'particle', 'hydrodynamics', 'sph', 'method', 'for', 'fluidstructure', 'interactions', 'fsi', 'is', 'presented', 'the', 'method', 'combines', 'several', 'attributes', 'that', 'have', 'not', 'been', 'simultaneously', 'satisfied', 'by', 'other', 'sph', 'methods', 'specifically', 'it', 'is', 'secondorder', 'convergent', 'it', 'allows', 'for', 'resolutions', 'spatially', 'adapted', 'with', 'moving', 'translating', 'and', 'rotating', 'boundaries', 'of', 'arbitrary', 'geometries', 'and', 'it', 'accelerates', 'the', 'fsi', 'solution', 'as', 'the', 'adaptive', 'approach', 'leads', 'to', 'fewer', 'degrees', 'of', 'freedom', 'without', 'sacrificing', 'accuracy', 'the', 'key', 'ingredients', 'in', 'the', 'method', 'are', 'a', 'consistent', 'discretization', 'of', 'differential', 'operators', 'a', 'textitposteriori', 'error', 'estimatordistancebased', 'criterion', 'of', 'adaptivity', 'and', 'a', 'particleshifting', 'technique', 'the', 'method', 'is', 'applied', 'in', 'simulating', 'six', 'different', 'flows', 'or', 'fsi', 'problems', 'the', 'new', 'methods', 'convergence', 'accuracy', 'and', 'efficiency', 'attributes', 'are', 'assessed', 'by', 'comparing', 'the', 'results', 'it', 'produces', 'with', 'analytical', 'finite', 'element', 'and', 'consistent', 'sph', 'uniform', 'highresolution', 'solutions', 'as', 'well', 'as', 'experimental', 'data']]
[-0.06407821973188044, 0.03960824082605541, -0.13273843895138324, 0.06763733110526132, -0.06327737539262969, -0.1931003855068737, -0.046517997183889125, 0.4031169218247506, -0.23973347428741296, -0.3342129709007941, 0.08948032387337689, -0.25068110361907703, -0.08321131795901916, 0.2194983197346594, -0.0736426145825257, 0.1451093200107675, 0.14496354725378663, -0.04966271903066993, -0.08106199406789366, -0.2436691149217841, 0.29301799521712, 0.05448960271010648, 0.26912775565522595, 0.00996133646886073, 0.16099211052940843, -0.028505082659200945, -0.09300466263128111, 0.09467732737626214, -0.10384053658589125, 0.0916522729189705, 0.2253066598048517, 0.0940924896007237, 0.2863877784293979, -0.40320295156605207, -0.25127227032390326, 0.0070875023470830115, 0.1820632582321874, 0.15476520798071774, -0.07966189407882517, -0.27592508557926754, 0.08558827972234186, -0.18232848846923505, -0.14031346220133908, -0.146227892356188, -0.06552995935972057, 0.05589033349298997, -0.3257199687858932, 0.1273543924204449, 0.04777221521102031, 0.0571213546487044, -0.07155462126933913, -0.11072508701463855, 0.0017966909122083391, 0.10416526509163929, 0.022399537211436945, 0.02831595131793796, 0.08328996951789108, -0.11239816337205302, -0.10291819475372252, 0.4038023814392179, -0.037885374622419477, -0.30991393302040826, 0.24373602349338913, -0.04674511215190834, -0.05831930821469582, 0.19486766525391322, 0.16236037576706636, 0.20289778702461453, -0.14506760621165385, 0.06117806729205551, -0.009404696162734458, 0.16888887034868127, 0.04387010860520957, -0.024948567732362384, 0.12413970622539854, 0.19024947009730472, 0.07081410754298263, 0.09463254969832904, -0.08908153786810476, -0.14129949020527638, -0.29216211515742896, -0.1300717272844388, -0.16171025443099327, -0.07695881349333031, -0.14664732737746003, -0.13789076751806953, 0.35290265603880605, 0.18440397160471791, 0.1283743059255683, 0.04123906946893948, 0.3600094560394759, 0.0653448012777354, 0.0761639406320764, 0.08105172372923525, 0.21319949430580348, 0.13589536838768634, 0.10164640683666873, -0.25313567875801074, 0.04696521818170449, 0.13198478037574843]
1,803.03375
A systematic study of the condensation of the corona and the application for $\Gamma_{\rm 2-10keV}-L_{\rm bol}/L_{\rm Edd}$ correlation in luminous active galactic nuclei
In this paper, we explained the observed $\Gamma_{\rm 2-10keV}-L_{\rm bol}/L_{\rm Edd}$ correlation in luminous active galactic nuclei within the framework of the condensation of the corona around a supermassive black hole (Liu et al. 2015; Qiao & Liu 2017). Specifically, we systemically test the effects of black hole mass $M$, the viscosity parameter $\alpha$, and the magnetic parameter $\beta$ (with magnetic pressure $p_{\rm m}=B^2/{8\pi}=(1-\beta)p_{\rm tot}$, $p_{\rm tot}=p_{\rm gas}+p_{\rm m}$) on the structure of the accretion disc and the corona, as well as the corresponding emergent spectra. It is found that the hard X-ray photon index $\Gamma_{\rm 2-10keV}$ nearly does not change with changing black hole mass $M$, or changing magnetic parameter $\beta$. Meanwhile, it is found that the geometry of the accretion flow, i.e., the relative configuration of the disc and corona, as well as the emergent spectra can be strongly affected by changing the value of $\alpha$. By comparing with a sample composed of 29 luminous active galactic nuclei with well constrained X-ray spectra and Eddington ratios, it is found that the observed $\Gamma_{\rm 2-10keV}-L_{\rm bol}/L_{\rm Edd}$ correlation can be well matched with a relatively bigger value of $\alpha$, i.e., $\alpha \sim 1$, as previously also suggested by Narayan (1996) for luminous accreting black holes.
astro-ph.HE
in this paper we explained the observed gamma_rm 210kevl_rm boll_rm edd correlation in luminous active galactic nuclei within the framework of the condensation of the corona around a supermassive black hole liu et al 2015 qiao liu 2017 specifically we systemically test the effects of black hole mass m the viscosity parameter alpha and the magnetic parameter beta with magnetic pressure p_rm mb28pi1betap_rm tot p_rm totp_rm gasp_rm m on the structure of the accretion disc and the corona as well as the corresponding emergent spectra it is found that the hard xray photon index gamma_rm 210kev nearly does not change with changing black hole mass m or changing magnetic parameter beta meanwhile it is found that the geometry of the accretion flow ie the relative configuration of the disc and corona as well as the emergent spectra can be strongly affected by changing the value of alpha by comparing with a sample composed of 29 luminous active galactic nuclei with well constrained xray spectra and eddington ratios it is found that the observed gamma_rm 210kevl_rm boll_rm edd correlation can be well matched with a relatively bigger value of alpha ie alpha sim 1 as previously also suggested by narayan 1996 for luminous accreting black holes
[['in', 'this', 'paper', 'we', 'explained', 'the', 'observed', 'gamma_rm', '210kevl_rm', 'boll_rm', 'edd', 'correlation', 'in', 'luminous', 'active', 'galactic', 'nuclei', 'within', 'the', 'framework', 'of', 'the', 'condensation', 'of', 'the', 'corona', 'around', 'a', 'supermassive', 'black', 'hole', 'liu', 'et', 'al', '2015', 'qiao', 'liu', '2017', 'specifically', 'we', 'systemically', 'test', 'the', 'effects', 'of', 'black', 'hole', 'mass', 'm', 'the', 'viscosity', 'parameter', 'alpha', 'and', 'the', 'magnetic', 'parameter', 'beta', 'with', 'magnetic', 'pressure', 'p_rm', 'mb28pi1betap_rm', 'tot', 'p_rm', 'totp_rm', 'gasp_rm', 'm', 'on', 'the', 'structure', 'of', 'the', 'accretion', 'disc', 'and', 'the', 'corona', 'as', 'well', 'as', 'the', 'corresponding', 'emergent', 'spectra', 'it', 'is', 'found', 'that', 'the', 'hard', 'xray', 'photon', 'index', 'gamma_rm', '210kev', 'nearly', 'does', 'not', 'change', 'with', 'changing', 'black', 'hole', 'mass', 'm', 'or', 'changing', 'magnetic', 'parameter', 'beta', 'meanwhile', 'it', 'is', 'found', 'that', 'the', 'geometry', 'of', 'the', 'accretion', 'flow', 'ie', 'the', 'relative', 'configuration', 'of', 'the', 'disc', 'and', 'corona', 'as', 'well', 'as', 'the', 'emergent', 'spectra', 'can', 'be', 'strongly', 'affected', 'by', 'changing', 'the', 'value', 'of', 'alpha', 'by', 'comparing', 'with', 'a', 'sample', 'composed', 'of', '29', 'luminous', 'active', 'galactic', 'nuclei', 'with', 'well', 'constrained', 'xray', 'spectra', 'and', 'eddington', 'ratios', 'it', 'is', 'found', 'that', 'the', 'observed', 'gamma_rm', '210kevl_rm', 'boll_rm', 'edd', 'correlation', 'can', 'be', 'well', 'matched', 'with', 'a', 'relatively', 'bigger', 'value', 'of', 'alpha', 'ie', 'alpha', 'sim', '1', 'as', 'previously', 'also', 'suggested', 'by', 'narayan', '1996', 'for', 'luminous', 'accreting', 'black', 'holes']]
[-0.06658281618497562, 0.18563838232139507, 0.006033619888942337, 0.12503393943449342, -0.055400688981924635, -0.1188612638758982, 0.0380489925340754, 0.36607660586709406, -0.163117274710334, -0.4186782058217187, 0.058439521328661946, -0.31636107774145567, -0.04730853609467361, 0.20141000430159683, -0.02464519714964415, 0.00988800949254884, -0.060008382839405565, -0.044030984689884665, -0.05645535169609484, -0.19991854172077178, 0.305580347475239, 0.150205510330215, 0.16818184804968275, -0.01984121949777971, 0.026233210928033834, -0.030790567977251996, -0.006342126499045992, 0.07939422551996599, -0.17867537897797064, -0.006026606103266353, 0.20228732288096898, 0.07060548812104621, 0.18277266484555504, -0.2844148360912625, -0.20671330492443113, 0.05698706844673302, 0.18690221046852828, -0.04458731350799402, -0.048250302134327294, -0.21736592086106168, 0.059003084299701324, -0.24592133062145677, -0.14555468337740102, 0.03698823391112374, 0.1077797200660504, 0.028367413045718007, -0.26107016516604986, 0.17012134753964003, 0.0710810498690736, -0.02180622873911217, -0.10462666433061292, -0.08599670160913941, -0.11385086305040996, 0.03988726193720095, 0.1153435634694697, 0.09996603526156489, 0.23905123290443672, -0.09821582611172984, -0.06253211317058023, 0.3583334271995286, -0.04230354014675212, -0.02415134596889746, 0.15597175846840092, -0.2481124241701999, -0.13227014303837545, 0.14559299567834802, 0.1255658809787742, 0.18341232949070893, -0.08031004350151709, 0.08323419844124708, -0.05027061128648304, 0.24698959453615235, 0.05898377668710231, 0.013935191929803708, 0.29303812202696333, 0.11140693571135883, -0.010031428665909638, 0.0962259989597867, -0.16256618108229703, -0.007316050545106276, -0.23337646766533307, -0.09857765001601618, -0.15006120177217533, 0.13501487645114696, -0.1353100941128987, -0.13137328135896825, 0.2953485107299552, 0.045492308306975746, 0.27883897996386864, -0.010617022817277938, 0.2579765309686565, 0.13356091397344158, 0.03096234392541558, 0.1893682305432337, 0.3612186368647499, 0.1660126633976878, 0.14255976748411817, -0.2686857339041076, 0.05853037148035266, 0.05474257614899112]
1,803.03376
Learning Approximate Inference Networks for Structured Prediction
Structured prediction energy networks (SPENs; Belanger & McCallum 2016) use neural network architectures to define energy functions that can capture arbitrary dependencies among parts of structured outputs. Prior work used gradient descent for inference, relaxing the structured output to a set of continuous variables and then optimizing the energy with respect to them. We replace this use of gradient descent with a neural network trained to approximate structured argmax inference. This "inference network" outputs continuous values that we treat as the output structure. We develop large-margin training criteria for joint training of the structured energy function and inference network. On multi-label classification we report speed-ups of 10-60x compared to (Belanger et al, 2017) while also improving accuracy. For sequence labeling with simple structured energies, our approach performs comparably to exact inference while being much faster at test time. We then demonstrate improved accuracy by augmenting the energy with a "label language model" that scores entire output label sequences, showing it can improve handling of long-distance dependencies in part-of-speech tagging. Finally, we show how inference networks can replace dynamic programming for test-time inference in conditional random fields, suggestive for their general use for fast inference in structured settings.
cs.CL cs.LG stat.ML
structured prediction energy networks spens belanger mccallum 2016 use neural network architectures to define energy functions that can capture arbitrary dependencies among parts of structured outputs prior work used gradient descent for inference relaxing the structured output to a set of continuous variables and then optimizing the energy with respect to them we replace this use of gradient descent with a neural network trained to approximate structured argmax inference this inference network outputs continuous values that we treat as the output structure we develop largemargin training criteria for joint training of the structured energy function and inference network on multilabel classification we report speedups of 1060x compared to belanger et al 2017 while also improving accuracy for sequence labeling with simple structured energies our approach performs comparably to exact inference while being much faster at test time we then demonstrate improved accuracy by augmenting the energy with a label language model that scores entire output label sequences showing it can improve handling of longdistance dependencies in partofspeech tagging finally we show how inference networks can replace dynamic programming for testtime inference in conditional random fields suggestive for their general use for fast inference in structured settings
[['structured', 'prediction', 'energy', 'networks', 'spens', 'belanger', 'mccallum', '2016', 'use', 'neural', 'network', 'architectures', 'to', 'define', 'energy', 'functions', 'that', 'can', 'capture', 'arbitrary', 'dependencies', 'among', 'parts', 'of', 'structured', 'outputs', 'prior', 'work', 'used', 'gradient', 'descent', 'for', 'inference', 'relaxing', 'the', 'structured', 'output', 'to', 'a', 'set', 'of', 'continuous', 'variables', 'and', 'then', 'optimizing', 'the', 'energy', 'with', 'respect', 'to', 'them', 'we', 'replace', 'this', 'use', 'of', 'gradient', 'descent', 'with', 'a', 'neural', 'network', 'trained', 'to', 'approximate', 'structured', 'argmax', 'inference', 'this', 'inference', 'network', 'outputs', 'continuous', 'values', 'that', 'we', 'treat', 'as', 'the', 'output', 'structure', 'we', 'develop', 'largemargin', 'training', 'criteria', 'for', 'joint', 'training', 'of', 'the', 'structured', 'energy', 'function', 'and', 'inference', 'network', 'on', 'multilabel', 'classification', 'we', 'report', 'speedups', 'of', '1060x', 'compared', 'to', 'belanger', 'et', 'al', '2017', 'while', 'also', 'improving', 'accuracy', 'for', 'sequence', 'labeling', 'with', 'simple', 'structured', 'energies', 'our', 'approach', 'performs', 'comparably', 'to', 'exact', 'inference', 'while', 'being', 'much', 'faster', 'at', 'test', 'time', 'we', 'then', 'demonstrate', 'improved', 'accuracy', 'by', 'augmenting', 'the', 'energy', 'with', 'a', 'label', 'language', 'model', 'that', 'scores', 'entire', 'output', 'label', 'sequences', 'showing', 'it', 'can', 'improve', 'handling', 'of', 'longdistance', 'dependencies', 'in', 'partofspeech', 'tagging', 'finally', 'we', 'show', 'how', 'inference', 'networks', 'can', 'replace', 'dynamic', 'programming', 'for', 'testtime', 'inference', 'in', 'conditional', 'random', 'fields', 'suggestive', 'for', 'their', 'general', 'use', 'for', 'fast', 'inference', 'in', 'structured', 'settings']]
[-0.011188438350860124, 0.00982977072827709, -0.029971797530276654, 0.12149439807742451, -0.12686979603499937, -0.1711215765764698, 0.07071856050453602, 0.48576511558240804, -0.2948856014089707, -0.358378119164039, 0.024798385821617183, -0.2051386131116977, -0.16775635567326577, 0.16716534303119168, -0.11164390579797327, 0.11018620692559172, 0.15821821985718532, 0.021036765072494745, -0.10729915983497332, -0.29295665787843367, 0.2551970574103344, 0.086834012865065, 0.3200617800442836, -0.04460052781512973, 0.1513366790679403, 0.024779877218250663, -0.01071351173435314, 0.00917397558880158, -0.043261608982254236, 0.1866279242369227, 0.3046821746796083, 0.2229200769908344, 0.35032980852426054, -0.4113999126144709, -0.23956458992682972, 0.11611266048887792, 0.11556236402531608, 0.11509952652924814, 0.010212985461410612, -0.2845039434874287, 0.08210093986529571, -0.17288451411773284, 0.032484796261176084, -0.1870246821202529, -0.031493100476188536, 0.03750882019253018, -0.3514945814514365, 0.06552355093985963, 0.07841862631687083, 0.028948185899748635, -0.030621269130362914, -0.13684334353340838, 0.0024139957908445443, 0.11492157167492387, 0.0009163618320599199, 0.07483410670254857, 0.12446252598355596, -0.15406764641833992, -0.15747038535534955, 0.2822664422962146, -0.0668251809081994, -0.23642354825607095, 0.18262724841061312, -0.0013062363562102502, -0.18646233801562817, 0.07717708854768902, 0.27905687295043696, 0.11872103817593783, -0.14773567726459497, 0.03344632103645171, -0.025042217573485313, 0.19913741405635405, 0.07764870266740521, -0.020156122417822, 0.12927848463698935, 0.2337912284506437, 0.053859987968387896, 0.15917325170519642, -0.09996629635749671, -0.07752462714068735, -0.22564685967010564, -0.10566783237617272, -0.19179842018593962, -0.006985175568992511, -0.13396216598443855, -0.16876943775166112, 0.4062268770658053, 0.23473677510777727, 0.2345439013810112, 0.2056211597739886, 0.3321962971944744, 0.06391109968005763, 0.07243188738638986, 0.16277843027208477, 0.15064768366611156, 0.07531840307638049, 0.1148787265452437, -0.15217849182872437, 0.11825747429751433, 0.05184894341450089]
1,803.03377
On the sum of the reciprocals of the differences between consecutive primes
Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log X}~\qquad\quad~ &\alpha=-1,\\ \frac{X}{\log X}\frac{(\log\log X)^{1+\alpha}}{1+\alpha}\qquad &\alpha>-1, \end{cases} \end{align*} and establish asymptotic properties for some series of $d_n$ without the Hardy--Littlewood prime-pair conjecture.
math.NT
let p_n denote the nth prime number and let d_np_n1p_n under the hardylittlewood primepair conjecture we prove beginalign sum_nle xfraclogalphad_nd_n simbegincases fracxlogloglog xlog xqquadquad alpha1 fracxlog xfracloglog x1alpha1alphaqquad alpha1 endcases endalign and establish asymptotic properties for some series of d_n without the hardylittlewood primepair conjecture
[['let', 'p_n', 'denote', 'the', 'nth', 'prime', 'number', 'and', 'let', 'd_np_n1p_n', 'under', 'the', 'hardylittlewood', 'primepair', 'conjecture', 'we', 'prove', 'beginalign', 'sum_nle', 'xfraclogalphad_nd_n', 'simbegincases', 'fracxlogloglog', 'xlog', 'xqquadquad', 'alpha1', 'fracxlog', 'xfracloglog', 'x1alpha1alphaqquad', 'alpha1', 'endcases', 'endalign', 'and', 'establish', 'asymptotic', 'properties', 'for', 'some', 'series', 'of', 'd_n', 'without', 'the', 'hardylittlewood', 'primepair', 'conjecture']]
[-0.3148794941064951, 0.06806280559517051, -0.049563919586178506, 0.02744876125239228, -0.024029477425899944, -0.2698820519849266, -0.0395728814581066, 0.19377008487323397, -0.3012615350614253, -0.10326042060593241, 0.061034162859677485, -0.4271094861906022, -0.05360802280177411, 0.2412277947572109, -0.18332566284133414, -0.015181709411799124, -0.04234805285293413, 0.0985606109484491, 0.013558696979950918, -0.32408045468190194, 0.22877352277895338, -0.21831461684288164, 0.10864748070506673, 0.08340342187684176, 0.04477503314908398, 0.0481420002363034, 0.16396212930742063, -0.2009718768408914, -0.4397564275484336, 0.040536378755381235, 0.23144865517602548, 0.11954630109309954, 0.3937865860368076, -0.33834999731104626, -0.01750382350904769, 0.387773609744679, 0.2642626126639937, -0.31622699797643644, 0.03112366375831985, -0.3057720669986386, 0.21824022867765866, -0.05655375358305479, -0.29523130891060356, -0.07874179937827744, 0.07603628502080315, 0.09477246121356361, -0.5017030755744168, 0.11430620416802795, 0.11878773516142055, 0.0896995717684101, -0.03680685731141191, -0.29499709753221587, -0.004569952866356624, -0.04734161118731687, 0.022169394663682108, 0.06369264287825085, -0.10772860745017074, 0.004313052638041738, -0.05765945831999967, 0.2804535468550105, -0.03785523486103078, -0.19340113599441552, -0.14964212300746063, -0.3456559969896549, -0.25539188449712175, -0.03443579372067593, -0.011706905145394174, 0.19602623626001572, 0.06839757206800737, 0.3105474075173812, -0.21136825423883765, 0.11095733452882421, 0.23895765397403584, 0.029077426285335894, 0.004336428755011998, -0.03608388404705023, 0.09276292970600097, 0.14222828075779895, 0.013764824886732785, 0.12366767325683643, -0.38416389689633723, -0.20661029521081792, -0.23350767217772572, 0.34979826309963274, -0.2401063546628728, -0.09503690731760703, 0.16103640911904604, 0.051472234245585766, 0.08570703266090468, 0.3227393001955199, 0.06640762850446136, 0.11760452987724229, -0.120888189841552, 0.0985793595594403, -0.10408326239236262, 0.30327633807533666, -0.04489181489732705, -0.22925997618585825, 0.07768278330025312, 0.3548668397002314]
1,803.03378
Neural Fine-Grained Entity Type Classification with Hierarchy-Aware Loss
The task of Fine-grained Entity Type Classification (FETC) consists of assigning types from a hierarchy to entity mentions in text. Existing methods rely on distant supervision and are thus susceptible to noisy labels that can be out-of-context or overly-specific for the training sentence. Previous methods that attempt to address these issues do so with heuristics or with the help of hand-crafted features. Instead, we propose an end-to-end solution with a neural network model that uses a variant of cross- entropy loss function to handle out-of-context labels, and hierarchical loss normalization to cope with overly-specific ones. Also, previous work solve FETC a multi-label classification followed by ad-hoc post-processing. In contrast, our solution is more elegant: we use public word embeddings to train a single-label that jointly learns representations for entity mentions and their context. We show experimentally that our approach is robust against noise and consistently outperforms the state-of-the-art on established benchmarks for the task.
cs.CL
the task of finegrained entity type classification fetc consists of assigning types from a hierarchy to entity mentions in text existing methods rely on distant supervision and are thus susceptible to noisy labels that can be outofcontext or overlyspecific for the training sentence previous methods that attempt to address these issues do so with heuristics or with the help of handcrafted features instead we propose an endtoend solution with a neural network model that uses a variant of cross entropy loss function to handle outofcontext labels and hierarchical loss normalization to cope with overlyspecific ones also previous work solve fetc a multilabel classification followed by adhoc postprocessing in contrast our solution is more elegant we use public word embeddings to train a singlelabel that jointly learns representations for entity mentions and their context we show experimentally that our approach is robust against noise and consistently outperforms the stateoftheart on established benchmarks for the task
[['the', 'task', 'of', 'finegrained', 'entity', 'type', 'classification', 'fetc', 'consists', 'of', 'assigning', 'types', 'from', 'a', 'hierarchy', 'to', 'entity', 'mentions', 'in', 'text', 'existing', 'methods', 'rely', 'on', 'distant', 'supervision', 'and', 'are', 'thus', 'susceptible', 'to', 'noisy', 'labels', 'that', 'can', 'be', 'outofcontext', 'or', 'overlyspecific', 'for', 'the', 'training', 'sentence', 'previous', 'methods', 'that', 'attempt', 'to', 'address', 'these', 'issues', 'do', 'so', 'with', 'heuristics', 'or', 'with', 'the', 'help', 'of', 'handcrafted', 'features', 'instead', 'we', 'propose', 'an', 'endtoend', 'solution', 'with', 'a', 'neural', 'network', 'model', 'that', 'uses', 'a', 'variant', 'of', 'cross', 'entropy', 'loss', 'function', 'to', 'handle', 'outofcontext', 'labels', 'and', 'hierarchical', 'loss', 'normalization', 'to', 'cope', 'with', 'overlyspecific', 'ones', 'also', 'previous', 'work', 'solve', 'fetc', 'a', 'multilabel', 'classification', 'followed', 'by', 'adhoc', 'postprocessing', 'in', 'contrast', 'our', 'solution', 'is', 'more', 'elegant', 'we', 'use', 'public', 'word', 'embeddings', 'to', 'train', 'a', 'singlelabel', 'that', 'jointly', 'learns', 'representations', 'for', 'entity', 'mentions', 'and', 'their', 'context', 'we', 'show', 'experimentally', 'that', 'our', 'approach', 'is', 'robust', 'against', 'noise', 'and', 'consistently', 'outperforms', 'the', 'stateoftheart', 'on', 'established', 'benchmarks', 'for', 'the', 'task']]
[-0.013819037153888004, -0.043285719047688825, -0.04674980441096092, 0.10046897659010842, -0.16951585796318555, -0.21513207347169028, 0.06889472217498176, 0.4816565945450413, -0.2568873878917657, -0.3431325827994825, 0.046046239246176186, -0.3170191539806853, -0.16557229237055013, 0.15526646022963655, -0.16847872891536864, 0.0838828725360432, 0.1686765017473494, 0.07000131694918596, -0.07053652559989132, -0.29176280384126585, 0.3758505235662022, 0.02331954134187024, 0.32812261548334437, -0.00025045600915817837, 0.13059924332437253, -0.0360391725292797, -0.06716960929196303, -0.006056041151168756, -0.027390152800762735, 0.1794296063430681, 0.34243641698144767, 0.209565921349598, 0.3086008448628586, -0.386400846396818, -0.24283319388939018, 0.09469970278932076, 0.15087342475185564, 0.14408079590219514, 0.005382150331474565, -0.35232730793895345, 0.11134474866986765, -0.20005017024385252, 0.047313915323588605, -0.16784235952716126, -0.029584706319790138, -0.013013908406719565, -0.2980841328512485, 0.0865493547766834, 0.10862003137912038, 0.013535890611819923, -0.060850320299658436, -0.08574243722557041, 0.053461251547560096, 0.140190695914881, 0.04351779426322441, 0.0694345585401798, 0.09641405937987943, -0.18539863463037795, -0.19124536011459944, 0.34488758594900565, -0.04732440739768974, -0.270020080828353, 0.21886026247337118, 0.049064306049044, -0.16582736493498823, 0.06152009647523396, 0.19018854943447208, 0.13015437638387084, -0.1545280124923202, -0.029732565096836833, -0.045601476198307386, 0.23282268135823725, 0.06711822205014821, -0.00850898518365284, 0.16085429246672184, 0.23655048410383692, 0.02911788836813924, 0.12257104903983418, -0.10599631245407325, -0.03583109956066197, -0.19339697677213208, -0.08521546184936979, -0.17033869371822985, -0.01836235857320533, -0.06874898266878997, -0.14227638014295066, 0.3764707724392218, 0.2487585277719374, 0.24567751903209442, 0.15123695832076728, 0.3473106382267648, -0.0017036885730799679, 0.1252958774156899, 0.10366078011774287, 0.15569443606440664, -0.030051552001264338, 0.10625706562208698, -0.14166539293977334, 0.10997030070345652, 0.11703627629015644]
1,803.03379
A Phase Model Approach for Thermostatically Controlled Load Demand Response
A significant portion of electricity consumed worldwide is used to power thermostatically controlled loads (TCLs) such as air conditioners, refrigerators, and water heaters. Because the short-term timing of operation of such systems is inconsequential as long as their long-run average power consumption is maintained, they are increasingly used in demand response (DR) programs to balance supply and demand on the power grid. Here, we present an \textit{ab initio} phase model for general TCLs, and use the concept to develop a continuous oscillator model of a TCL and compute its phase response to changes in temperature and applied power. This yields a simple control system model that can be used to evaluate control policies for modulating the power consumption of aggregated loads with parameter heterogeneity and stochastic drift. We demonstrate this concept by comparing simulations of ensembles of heterogeneous loads using the continuous state model and an established hybrid state model. The developed phase model approach is a novel means of evaluating DR provision using TCLs, and is instrumental in estimating the capacity of ancillary services or DR on different time scales. We further propose a novel phase response based open-loop control policy that effectively modulates the aggregate power of a heterogeneous TCL population while maintaining load diversity and minimizing power overshoots. This is demonstrated by low-error tracking of a regulation signal by filtering it into frequency bands and using TCL sub-ensembles with duty cycles in corresponding ranges. Control policies that can maintain a uniform distribution of power consumption by aggregated heterogeneous loads will enable distribution system management (DSM) approaches that maintain stability as well as power quality, and further allow more integration of renewable energy sources.
nlin.AO math.OC
a significant portion of electricity consumed worldwide is used to power thermostatically controlled loads tcls such as air conditioners refrigerators and water heaters because the shortterm timing of operation of such systems is inconsequential as long as their longrun average power consumption is maintained they are increasingly used in demand response dr programs to balance supply and demand on the power grid here we present an textitab initio phase model for general tcls and use the concept to develop a continuous oscillator model of a tcl and compute its phase response to changes in temperature and applied power this yields a simple control system model that can be used to evaluate control policies for modulating the power consumption of aggregated loads with parameter heterogeneity and stochastic drift we demonstrate this concept by comparing simulations of ensembles of heterogeneous loads using the continuous state model and an established hybrid state model the developed phase model approach is a novel means of evaluating dr provision using tcls and is instrumental in estimating the capacity of ancillary services or dr on different time scales we further propose a novel phase response based openloop control policy that effectively modulates the aggregate power of a heterogeneous tcl population while maintaining load diversity and minimizing power overshoots this is demonstrated by lowerror tracking of a regulation signal by filtering it into frequency bands and using tcl subensembles with duty cycles in corresponding ranges control policies that can maintain a uniform distribution of power consumption by aggregated heterogeneous loads will enable distribution system management dsm approaches that maintain stability as well as power quality and further allow more integration of renewable energy sources
[['a', 'significant', 'portion', 'of', 'electricity', 'consumed', 'worldwide', 'is', 'used', 'to', 'power', 'thermostatically', 'controlled', 'loads', 'tcls', 'such', 'as', 'air', 'conditioners', 'refrigerators', 'and', 'water', 'heaters', 'because', 'the', 'shortterm', 'timing', 'of', 'operation', 'of', 'such', 'systems', 'is', 'inconsequential', 'as', 'long', 'as', 'their', 'longrun', 'average', 'power', 'consumption', 'is', 'maintained', 'they', 'are', 'increasingly', 'used', 'in', 'demand', 'response', 'dr', 'programs', 'to', 'balance', 'supply', 'and', 'demand', 'on', 'the', 'power', 'grid', 'here', 'we', 'present', 'an', 'textitab', 'initio', 'phase', 'model', 'for', 'general', 'tcls', 'and', 'use', 'the', 'concept', 'to', 'develop', 'a', 'continuous', 'oscillator', 'model', 'of', 'a', 'tcl', 'and', 'compute', 'its', 'phase', 'response', 'to', 'changes', 'in', 'temperature', 'and', 'applied', 'power', 'this', 'yields', 'a', 'simple', 'control', 'system', 'model', 'that', 'can', 'be', 'used', 'to', 'evaluate', 'control', 'policies', 'for', 'modulating', 'the', 'power', 'consumption', 'of', 'aggregated', 'loads', 'with', 'parameter', 'heterogeneity', 'and', 'stochastic', 'drift', 'we', 'demonstrate', 'this', 'concept', 'by', 'comparing', 'simulations', 'of', 'ensembles', 'of', 'heterogeneous', 'loads', 'using', 'the', 'continuous', 'state', 'model', 'and', 'an', 'established', 'hybrid', 'state', 'model', 'the', 'developed', 'phase', 'model', 'approach', 'is', 'a', 'novel', 'means', 'of', 'evaluating', 'dr', 'provision', 'using', 'tcls', 'and', 'is', 'instrumental', 'in', 'estimating', 'the', 'capacity', 'of', 'ancillary', 'services', 'or', 'dr', 'on', 'different', 'time', 'scales', 'we', 'further', 'propose', 'a', 'novel', 'phase', 'response', 'based', 'openloop', 'control', 'policy', 'that', 'effectively', 'modulates', 'the', 'aggregate', 'power', 'of', 'a', 'heterogeneous', 'tcl', 'population', 'while', 'maintaining', 'load', 'diversity', 'and', 'minimizing', 'power', 'overshoots', 'this', 'is', 'demonstrated', 'by', 'lowerror', 'tracking', 'of', 'a', 'regulation', 'signal', 'by', 'filtering', 'it', 'into', 'frequency', 'bands', 'and', 'using', 'tcl', 'subensembles', 'with', 'duty', 'cycles', 'in', 'corresponding', 'ranges', 'control', 'policies', 'that', 'can', 'maintain', 'a', 'uniform', 'distribution', 'of', 'power', 'consumption', 'by', 'aggregated', 'heterogeneous', 'loads', 'will', 'enable', 'distribution', 'system', 'management', 'dsm', 'approaches', 'that', 'maintain', 'stability', 'as', 'well', 'as', 'power', 'quality', 'and', 'further', 'allow', 'more', 'integration', 'of', 'renewable', 'energy', 'sources']]
[-0.13716124246106567, 0.1062665649714409, -0.052719600719696696, 0.01461342736866504, -0.042650147277078984, -0.15203158793113855, 0.1265227491899893, 0.4041795005846391, -0.2899542771063853, -0.3182066723550805, 0.12589234757098788, -0.25325498420684395, -0.11597310445748904, 0.21474122802201367, -0.10822450991659223, 0.0929028207528577, 0.006637175754303166, -0.025212267417953335, 0.024604513563289125, -0.19316145640619073, 0.23368533176350562, 0.14620496415317166, 0.3654250922584164, 0.016320401078121285, 0.13474654396523492, -0.022223668563537354, -0.008729345015034187, 0.04494698381091913, -0.050277388115279355, 0.1158513018371973, 0.2865910197285922, 0.13214414495134563, 0.3204727629807008, -0.4759835783363509, -0.2569774907332022, 0.1094942567621162, 0.09014111071008012, 0.047710950623867036, -0.04075631344771271, -0.1979857718578769, 0.0549257956141525, -0.2599337959402254, -0.08450468410602838, -0.14083952751926795, -0.016652813979316557, 0.1092687439444674, -0.3149342947231228, 0.05368032736452364, 0.006327820362681793, 0.06833432370837292, -0.09919065486199384, -0.0808366141050035, -0.05643489484002888, 0.16448849422875725, -0.004918536566960477, -0.04245526815830617, 0.18936838928873287, -0.1194511442594692, -0.10225428401010003, 0.38148305804698146, -0.05068661095287678, -0.18826571708917111, 0.11569492403583169, -0.052098718158009906, -0.07495482574281134, 0.1143572259242174, 0.2492233992649573, 0.0794525597602183, -0.2083125257458828, -0.0046286330386689205, 0.0667143062586336, 0.23650502346361568, 0.025931406980447904, 0.011825579494631012, 0.193968741619703, 0.2368610912927197, 0.13915510204337214, 0.16921136360463646, -0.07348093648096951, -0.10236380165156005, -0.21330435525463975, -0.09930303240822547, -0.16716100648551693, 0.038634169282411916, -0.07698749994380995, -0.12463205570341981, 0.4230582452660926, 0.1564792284414685, 0.12733201954540782, 0.10649052968432628, 0.3765786943579282, 0.178556099551961, 0.04699974944325758, 0.09637614229332953, 0.16773219298920594, 0.04409250129854469, 0.1666133644951818, -0.2566779640383438, 0.10861321205047189, -0.008388751560984098]
1,803.0338
Modeling of a charged dielectric interface: Comparison of the continuum and discrete lattice representations of surface charges
Two main approaches in particle-based simulations for modeling a charged surface are using explicit, discrete charges and continuum, uniform charges. It is well-known that these two approaches could lead to substantially distinct ionic distributions, whereas a systematic exploration of the origin is still absent. In this short communication, we calculate the electrostatic force of a single point charge above a planar substrate characterized by a surface charge density and dielectric mismatch and compare the differences in the electrostatic forces produced by discrete and continuum representations of surface charges. We demonstrate that while the model of uniform surface charges gives a rather simple picture, the model of discrete surface charges can exhibit different scenarios, depending on the respective values of ion-surface distance versus lattice spacing and a self-image interaction parameter.
cond-mat.soft
two main approaches in particlebased simulations for modeling a charged surface are using explicit discrete charges and continuum uniform charges it is wellknown that these two approaches could lead to substantially distinct ionic distributions whereas a systematic exploration of the origin is still absent in this short communication we calculate the electrostatic force of a single point charge above a planar substrate characterized by a surface charge density and dielectric mismatch and compare the differences in the electrostatic forces produced by discrete and continuum representations of surface charges we demonstrate that while the model of uniform surface charges gives a rather simple picture the model of discrete surface charges can exhibit different scenarios depending on the respective values of ionsurface distance versus lattice spacing and a selfimage interaction parameter
[['two', 'main', 'approaches', 'in', 'particlebased', 'simulations', 'for', 'modeling', 'a', 'charged', 'surface', 'are', 'using', 'explicit', 'discrete', 'charges', 'and', 'continuum', 'uniform', 'charges', 'it', 'is', 'wellknown', 'that', 'these', 'two', 'approaches', 'could', 'lead', 'to', 'substantially', 'distinct', 'ionic', 'distributions', 'whereas', 'a', 'systematic', 'exploration', 'of', 'the', 'origin', 'is', 'still', 'absent', 'in', 'this', 'short', 'communication', 'we', 'calculate', 'the', 'electrostatic', 'force', 'of', 'a', 'single', 'point', 'charge', 'above', 'a', 'planar', 'substrate', 'characterized', 'by', 'a', 'surface', 'charge', 'density', 'and', 'dielectric', 'mismatch', 'and', 'compare', 'the', 'differences', 'in', 'the', 'electrostatic', 'forces', 'produced', 'by', 'discrete', 'and', 'continuum', 'representations', 'of', 'surface', 'charges', 'we', 'demonstrate', 'that', 'while', 'the', 'model', 'of', 'uniform', 'surface', 'charges', 'gives', 'a', 'rather', 'simple', 'picture', 'the', 'model', 'of', 'discrete', 'surface', 'charges', 'can', 'exhibit', 'different', 'scenarios', 'depending', 'on', 'the', 'respective', 'values', 'of', 'ionsurface', 'distance', 'versus', 'lattice', 'spacing', 'and', 'a', 'selfimage', 'interaction', 'parameter']]
[-0.13606786935647963, 0.17905791095176407, -0.09483210534550422, 0.07750090020762887, -0.008259334984098294, -0.142414538413575, 0.05995640565294686, 0.39931457096985146, -0.2343230456070498, -0.3048776253054366, 0.0026144891870821746, -0.2657367677261779, -0.11185490128100496, 0.1512821926843635, -0.027333028412373492, -0.016306294248211055, -0.006564664103040226, -0.026482191810369954, -0.10500045706221993, -0.12534555135129646, 0.27819258550745113, 0.016801780315347074, 0.3079129625544992, 0.11607125924102413, 0.07412125910144993, -0.014475654142858216, -0.013768434986587643, 0.07024979435427245, -0.13302954724259303, 0.10864171619543286, 0.16911353166585125, -0.03573322410572522, 0.20176288360809227, -0.4725167545554943, -0.2379700299713385, 0.0721477361543956, 0.11215973886942794, 0.14455733179519054, -0.07992002568406219, -0.23588479144224364, 0.052356132255621655, -0.14413372134923386, -0.13695252523577028, -0.03681582829720059, 0.03622013213502806, 0.07106719423011451, -0.25354628056980844, 0.11796685490150784, 0.056318794765650444, 0.05134420596467432, -0.10740730098210448, -0.13959203286695676, -0.07821947577149542, 0.12559613368614728, 0.0664096848746805, 0.02689737337821907, 0.18249605257964743, -0.12802137531766075, -0.10196541369416166, 0.3679055360131428, -0.040346804064113735, -0.24184493501778953, 0.24607678216001264, -0.12874552396725314, -0.05435994977506903, 0.17043797601945698, 0.13877397138524308, 0.09602079436890493, -0.15917105509993412, 0.09538171365053949, -0.011285514512113765, 0.1805034359529445, 0.07836514880859055, 0.013448037436347484, 0.2742718445902416, 0.14203664098772428, 0.03346763777929221, 0.13287936328267752, -0.097862431119817, -0.11581210066860383, -0.30156576590406775, -0.11477353172051873, -0.19507458288937288, 0.03063244741074308, -0.1086509320662716, -0.1847245688586272, 0.38794735471254155, 0.11448132124902724, 0.19425516393642092, 0.02422136485634386, 0.2792646971697262, 0.095030702975427, 0.054526567497009105, 0.031787242821612674, 0.22541754896745317, 0.1100940579970822, 0.033975980758970216, -0.22893318819069816, 0.015828187270595352, 0.08146105802170354]
1,803.03381
Electrical valley filtering in transition metal dichalcogenides
This work investigates the feasibility of electrical valley filtering for holes in transition metal dichalcogenides. We look specifically into the scheme that utilizes a potential barrier to produce valley-dependent tunneling rates, and perform the study with both a k.p based analytic method and a recursive Green's function based numerical method. The study yields the transmission coefficient as a function of incident energy and transverse wave vector, for holes going through lateral quantum barriers oriented in either armchair or zigzag directions, in both homogeneous and heterogeneous systems. The main findings are the following: 1) the tunneling current valley polarization increases with increasing barrier width or height, 2) both the valley-orbit interaction and band structure warping contribute to valley-dependent tunneling, with the former contribution being manifest in structures with asymmetric potential barriers, and the latter being orientation-dependent and reaching maximum for transmission in the armchair direction, and 3) for transmission ~ 0.1, a tunneling current valley polarization of the order of 10% can be achieved.
cond-mat.mes-hall cond-mat.mtrl-sci
this work investigates the feasibility of electrical valley filtering for holes in transition metal dichalcogenides we look specifically into the scheme that utilizes a potential barrier to produce valleydependent tunneling rates and perform the study with both a kp based analytic method and a recursive greens function based numerical method the study yields the transmission coefficient as a function of incident energy and transverse wave vector for holes going through lateral quantum barriers oriented in either armchair or zigzag directions in both homogeneous and heterogeneous systems the main findings are the following 1 the tunneling current valley polarization increases with increasing barrier width or height 2 both the valleyorbit interaction and band structure warping contribute to valleydependent tunneling with the former contribution being manifest in structures with asymmetric potential barriers and the latter being orientationdependent and reaching maximum for transmission in the armchair direction and 3 for transmission 01 a tunneling current valley polarization of the order of 10 can be achieved
[['this', 'work', 'investigates', 'the', 'feasibility', 'of', 'electrical', 'valley', 'filtering', 'for', 'holes', 'in', 'transition', 'metal', 'dichalcogenides', 'we', 'look', 'specifically', 'into', 'the', 'scheme', 'that', 'utilizes', 'a', 'potential', 'barrier', 'to', 'produce', 'valleydependent', 'tunneling', 'rates', 'and', 'perform', 'the', 'study', 'with', 'both', 'a', 'kp', 'based', 'analytic', 'method', 'and', 'a', 'recursive', 'greens', 'function', 'based', 'numerical', 'method', 'the', 'study', 'yields', 'the', 'transmission', 'coefficient', 'as', 'a', 'function', 'of', 'incident', 'energy', 'and', 'transverse', 'wave', 'vector', 'for', 'holes', 'going', 'through', 'lateral', 'quantum', 'barriers', 'oriented', 'in', 'either', 'armchair', 'or', 'zigzag', 'directions', 'in', 'both', 'homogeneous', 'and', 'heterogeneous', 'systems', 'the', 'main', 'findings', 'are', 'the', 'following', '1', 'the', 'tunneling', 'current', 'valley', 'polarization', 'increases', 'with', 'increasing', 'barrier', 'width', 'or', 'height', '2', 'both', 'the', 'valleyorbit', 'interaction', 'and', 'band', 'structure', 'warping', 'contribute', 'to', 'valleydependent', 'tunneling', 'with', 'the', 'former', 'contribution', 'being', 'manifest', 'in', 'structures', 'with', 'asymmetric', 'potential', 'barriers', 'and', 'the', 'latter', 'being', 'orientationdependent', 'and', 'reaching', 'maximum', 'for', 'transmission', 'in', 'the', 'armchair', 'direction', 'and', '3', 'for', 'transmission', '01', 'a', 'tunneling', 'current', 'valley', 'polarization', 'of', 'the', 'order', 'of', '10', 'can', 'be', 'achieved']]
[-0.17356110889361137, 0.11840758082186688, -0.02474882163575931, 0.05000765760713774, -0.02761726408016891, -0.17587572038403632, 0.07571334925330715, 0.4506821053815477, -0.2760316241837256, -0.2974154815784897, 0.02404697274395414, -0.2916839969758358, -0.14941428012766497, 0.17559151401467346, 0.06518905338785255, 0.00578515455816631, 0.004837474715321061, -0.06464943995147392, -0.06577046679039658, -0.17643322402332554, 0.3023608505386675, 0.03627043909804298, 0.31339199448947186, 0.1271241858492341, 0.04089847503712884, 0.07672128551833642, 0.03518027972852535, 0.025255378016650124, -0.12246728104124756, 0.09714106249444784, 0.20641659571031787, -0.03076878447016632, 0.22010979320807958, -0.4464259563634793, -0.19326726134498545, 0.02469189418910968, 0.17448689280879787, 0.158389841525436, -0.08346668154254187, -0.240341314837555, 0.06417430932044316, -0.14064300262489943, -0.12479639864084023, -0.01570499074978777, -0.007400826814032539, 0.037413183255135485, -0.25952710510112265, 0.10200764238259491, 0.025520181685778093, 0.028274724311712716, -0.06523043959474129, -0.13286315438188154, -0.08076818698994172, 0.07990905786950693, 0.03236860392994627, 0.04834770991317468, 0.1481289818658735, -0.12961313296554977, -0.1514887492191104, 0.35185619894944037, -0.06933456456955568, -0.167530987377244, 0.12845761911587122, -0.18889786711790496, -0.010164001997722669, 0.15160237983685493, 0.1514704708046967, 0.1171385271353992, -0.11066158768400423, 0.06235628781472275, 0.06577663278262157, 0.10834626228560085, 0.09167785798544409, 0.06051813626955091, 0.24084325827497208, 0.17348929228157633, 0.10147665121253396, 0.10958303868940192, -0.14374916039027827, -0.060456160134003484, -0.23435724261619242, -0.19502962125899317, -0.17254102042657726, 0.07187805661849353, -0.06996463805100778, -0.17506905829312602, 0.4409811665113528, 0.12376761350516276, 0.20157509174393376, 0.03825399672675786, 0.31501473052331774, 0.15754479696337467, 0.06512369669077021, 0.030805283816772753, 0.2369702523459255, 0.15074661188115032, 0.11440197599154932, -0.2423068949992964, 0.040861170230157395, -0.02226357128655101]
1,803.03382
Fast Decoding in Sequence Models using Discrete Latent Variables
Autoregressive sequence models based on deep neural networks, such as RNNs, Wavenet and the Transformer attain state-of-the-art results on many tasks. However, they are difficult to parallelize and are thus slow at processing long sequences. RNNs lack parallelism both during training and decoding, while architectures like WaveNet and Transformer are much more parallelizable during training, yet still operate sequentially during decoding. Inspired by [arxiv:1711.00937], we present a method to extend sequence models using discrete latent variables that makes decoding much more parallelizable. We first auto-encode the target sequence into a shorter sequence of discrete latent variables, which at inference time is generated autoregressively, and finally decode the output sequence from this shorter latent sequence in parallel. To this end, we introduce a novel method for constructing a sequence of discrete latent variables and compare it with previously introduced methods. Finally, we evaluate our model end-to-end on the task of neural machine translation, where it is an order of magnitude faster at decoding than comparable autoregressive models. While lower in BLEU than purely autoregressive models, our model achieves higher scores than previously proposed non-autoregressive translation models.
cs.LG
autoregressive sequence models based on deep neural networks such as rnns wavenet and the transformer attain stateoftheart results on many tasks however they are difficult to parallelize and are thus slow at processing long sequences rnns lack parallelism both during training and decoding while architectures like wavenet and transformer are much more parallelizable during training yet still operate sequentially during decoding inspired by arxiv171100937 we present a method to extend sequence models using discrete latent variables that makes decoding much more parallelizable we first autoencode the target sequence into a shorter sequence of discrete latent variables which at inference time is generated autoregressively and finally decode the output sequence from this shorter latent sequence in parallel to this end we introduce a novel method for constructing a sequence of discrete latent variables and compare it with previously introduced methods finally we evaluate our model endtoend on the task of neural machine translation where it is an order of magnitude faster at decoding than comparable autoregressive models while lower in bleu than purely autoregressive models our model achieves higher scores than previously proposed nonautoregressive translation models
[['autoregressive', 'sequence', 'models', 'based', 'on', 'deep', 'neural', 'networks', 'such', 'as', 'rnns', 'wavenet', 'and', 'the', 'transformer', 'attain', 'stateoftheart', 'results', 'on', 'many', 'tasks', 'however', 'they', 'are', 'difficult', 'to', 'parallelize', 'and', 'are', 'thus', 'slow', 'at', 'processing', 'long', 'sequences', 'rnns', 'lack', 'parallelism', 'both', 'during', 'training', 'and', 'decoding', 'while', 'architectures', 'like', 'wavenet', 'and', 'transformer', 'are', 'much', 'more', 'parallelizable', 'during', 'training', 'yet', 'still', 'operate', 'sequentially', 'during', 'decoding', 'inspired', 'by', 'arxiv171100937', 'we', 'present', 'a', 'method', 'to', 'extend', 'sequence', 'models', 'using', 'discrete', 'latent', 'variables', 'that', 'makes', 'decoding', 'much', 'more', 'parallelizable', 'we', 'first', 'autoencode', 'the', 'target', 'sequence', 'into', 'a', 'shorter', 'sequence', 'of', 'discrete', 'latent', 'variables', 'which', 'at', 'inference', 'time', 'is', 'generated', 'autoregressively', 'and', 'finally', 'decode', 'the', 'output', 'sequence', 'from', 'this', 'shorter', 'latent', 'sequence', 'in', 'parallel', 'to', 'this', 'end', 'we', 'introduce', 'a', 'novel', 'method', 'for', 'constructing', 'a', 'sequence', 'of', 'discrete', 'latent', 'variables', 'and', 'compare', 'it', 'with', 'previously', 'introduced', 'methods', 'finally', 'we', 'evaluate', 'our', 'model', 'endtoend', 'on', 'the', 'task', 'of', 'neural', 'machine', 'translation', 'where', 'it', 'is', 'an', 'order', 'of', 'magnitude', 'faster', 'at', 'decoding', 'than', 'comparable', 'autoregressive', 'models', 'while', 'lower', 'in', 'bleu', 'than', 'purely', 'autoregressive', 'models', 'our', 'model', 'achieves', 'higher', 'scores', 'than', 'previously', 'proposed', 'nonautoregressive', 'translation', 'models']]
[-0.025918956109337875, 0.0677415569131727, -0.06904167022372855, 0.10760169700958608, -0.10876266214273911, -0.22135109212402193, 0.0388484151939775, 0.5188301477601619, -0.2889240659529068, -0.31570212425959243, 0.08545937884186745, -0.20968553567396814, -0.1788665657637824, 0.22589477580396936, -0.1224121945144232, 0.09202712279416193, 0.11631514795653806, 0.056009484708176856, -0.10249285403667069, -0.3257257505332736, 0.23042355186326297, 0.07637528831993555, 0.31076766958694313, -0.1042362129814475, 0.1497764094004947, -0.06311720242479542, -0.03559879304159209, -0.09231048512471016, -0.015049553012083822, 0.14694496838514606, 0.24649626177755427, 0.17345604983914156, 0.33276042372721143, -0.4387233684582463, -0.2629752590376985, 0.10528155345510427, 0.1619693408974655, 0.11020661386994574, 0.0443165898957618, -0.29724373807367244, 0.12859799598262242, -0.16100240881425007, 0.10170558725147828, -0.15798060271807543, -0.022157920883266163, -0.010821727116571872, -0.2863940039110151, 0.044653381714012085, 0.13605012189688498, 0.07631905470774993, -0.05235750170531454, -0.13704305143945447, 0.01143507355355907, 0.09673000905469385, 0.05392146872514299, 0.11106734980111484, 0.06963977366724036, -0.1383748199072106, -0.15509082906742078, 0.31981852850138814, -0.07012738581463174, -0.2227210650930456, 0.2146683551887651, -0.03138929764648563, -0.18676075532833938, 0.12759161941564637, 0.25774498347478, 0.1576486429278459, -0.13928462703371308, -0.04256072339584003, 0.01801678341879545, 0.2151923237541497, 0.07022401805244427, -0.0037193403202694297, 0.16443042157859097, 0.27283071370316986, 0.02073315368383828, 0.1627797053540329, -0.09749739242210613, -0.12497626326767006, -0.2020983852133094, -0.1024281083246123, -0.1922055101276584, -0.027650348275334986, -0.10392698737785673, -0.14127771554341734, 0.3985185118333584, 0.24453780289657942, 0.22258230221147338, 0.22614904883243855, 0.34858095058229815, 0.06774999440807972, 0.1327424298983342, 0.16526293375400847, 0.11020279497345858, 0.05726940080121445, 0.1083986486408152, -0.13071707682811293, 0.1256360374508369, 0.07568816857697452]
1,803.03383
High-Accuracy Low-Precision Training
Low-precision computation is often used to lower the time and energy cost of machine learning, and recently hardware accelerators have been developed to support it. Still, it has been used primarily for inference - not training. Previous low-precision training algorithms suffered from a fundamental tradeoff: as the number of bits of precision is lowered, quantization noise is added to the model, which limits statistical accuracy. To address this issue, we describe a simple low-precision stochastic gradient descent variant called HALP. HALP converges at the same theoretical rate as full-precision algorithms despite the noise introduced by using low precision throughout execution. The key idea is to use SVRG to reduce gradient variance, and to combine this with a novel technique called bit centering to reduce quantization error. We show that on the CPU, HALP can run up to $4 \times$ faster than full-precision SVRG and can match its convergence trajectory. We implemented HALP in TensorQuant, and show that it exceeds the validation performance of plain low-precision SGD on two deep learning tasks.
cs.LG stat.ML
lowprecision computation is often used to lower the time and energy cost of machine learning and recently hardware accelerators have been developed to support it still it has been used primarily for inference not training previous lowprecision training algorithms suffered from a fundamental tradeoff as the number of bits of precision is lowered quantization noise is added to the model which limits statistical accuracy to address this issue we describe a simple lowprecision stochastic gradient descent variant called halp halp converges at the same theoretical rate as fullprecision algorithms despite the noise introduced by using low precision throughout execution the key idea is to use svrg to reduce gradient variance and to combine this with a novel technique called bit centering to reduce quantization error we show that on the cpu halp can run up to 4 times faster than fullprecision svrg and can match its convergence trajectory we implemented halp in tensorquant and show that it exceeds the validation performance of plain lowprecision sgd on two deep learning tasks
[['lowprecision', 'computation', 'is', 'often', 'used', 'to', 'lower', 'the', 'time', 'and', 'energy', 'cost', 'of', 'machine', 'learning', 'and', 'recently', 'hardware', 'accelerators', 'have', 'been', 'developed', 'to', 'support', 'it', 'still', 'it', 'has', 'been', 'used', 'primarily', 'for', 'inference', 'not', 'training', 'previous', 'lowprecision', 'training', 'algorithms', 'suffered', 'from', 'a', 'fundamental', 'tradeoff', 'as', 'the', 'number', 'of', 'bits', 'of', 'precision', 'is', 'lowered', 'quantization', 'noise', 'is', 'added', 'to', 'the', 'model', 'which', 'limits', 'statistical', 'accuracy', 'to', 'address', 'this', 'issue', 'we', 'describe', 'a', 'simple', 'lowprecision', 'stochastic', 'gradient', 'descent', 'variant', 'called', 'halp', 'halp', 'converges', 'at', 'the', 'same', 'theoretical', 'rate', 'as', 'fullprecision', 'algorithms', 'despite', 'the', 'noise', 'introduced', 'by', 'using', 'low', 'precision', 'throughout', 'execution', 'the', 'key', 'idea', 'is', 'to', 'use', 'svrg', 'to', 'reduce', 'gradient', 'variance', 'and', 'to', 'combine', 'this', 'with', 'a', 'novel', 'technique', 'called', 'bit', 'centering', 'to', 'reduce', 'quantization', 'error', 'we', 'show', 'that', 'on', 'the', 'cpu', 'halp', 'can', 'run', 'up', 'to', '4', 'times', 'faster', 'than', 'fullprecision', 'svrg', 'and', 'can', 'match', 'its', 'convergence', 'trajectory', 'we', 'implemented', 'halp', 'in', 'tensorquant', 'and', 'show', 'that', 'it', 'exceeds', 'the', 'validation', 'performance', 'of', 'plain', 'lowprecision', 'sgd', 'on', 'two', 'deep', 'learning', 'tasks']]
[-0.055484811668558155, 0.02836390108363155, -0.07437195091042667, 0.08636950308162554, -0.09345145990442047, -0.19882118110818897, 0.07445985016666408, 0.4289900157984127, -0.29920847772565834, -0.3495415488586706, 0.12494774727520588, -0.2118715127272641, -0.12519441298620007, 0.22191355760373613, -0.19247434078698622, 0.12685136390158305, 0.11076800151837661, 0.035965109326164514, -0.09035160814750912, -0.3517391325905919, 0.18102574474246735, 0.13789186994665, 0.32227749313460663, -0.026455464162042037, 0.1661191166994874, -0.060484433348071485, 0.018261310792363743, -0.018742282587267897, -0.05481015038308482, 0.10940531042938614, 0.2340741667061058, 0.1827009291990715, 0.35332224294645986, -0.42458844703676946, -0.19685194508364315, 0.12459616584374625, 0.17892681353379672, 0.11843635406660136, -0.03170123374336125, -0.22187607814283933, 0.13764521164189586, -0.16670909498489517, -0.016862588515505195, -0.15216237922774298, -0.05389566882787382, 0.01482527049477486, -0.24493425980703357, 0.026474606925073793, 0.051582178841208054, 0.027866060752421616, 0.039069832970990856, -0.16139326249951194, 0.04127140613820623, 0.0938769672449459, 0.05673988531001241, 0.09941490133950377, 0.1443373474128106, -0.11214939571424004, -0.1409013978096054, 0.3318772468222853, -0.07638192107149414, -0.2055666244095739, 0.18469686960417997, -0.026927396855043136, -0.15772637318107574, 0.13223635208765594, 0.23572441585745443, 0.07534992010880481, -0.13403913284213664, 0.062321349359220166, 0.05172134956947583, 0.19415514106478762, 0.06574012469089426, 0.003908243690453031, 0.0876657476169331, 0.23242305170689873, 0.09113899199429024, 0.12622881466522812, -0.12078617740805973, -0.11273384600439493, -0.21085510829682735, -0.13284615840564262, -0.2212683098965927, 0.017992249307323672, -0.07862665985722903, -0.1215120052535306, 0.3331165450570338, 0.22217668696470996, 0.1862601759213516, 0.15935080141883673, 0.39383642075391595, 0.12223707133602789, 0.12895493302220368, 0.16245707735172746, 0.22818025191424085, 0.10228101683040972, 0.12326142200104453, -0.2063447611146223, 0.07768902695782291, 0.07113378321998479]
1,803.03384
Full Stokes imaging polarimetry using dielectric metasurfaces
Polarization is a degree of freedom of light carrying important information that is usually absent in intensity and spectral content. Imaging polarimetry is the process of determining the polarization state of light, either partially or fully, over an extended scene. It has found several applications in various fields, from remote sensing to biology. Among different devices for imaging polarimetry, division of focal plane polarization cameras (DoFP-PCs) are more compact, less complicated, and less expensive. In general, DoFP-PCs are based on an array of polarization filters in the focal plane. Here we demonstrate a new principle and design for DoFP-PCs based on dielectric metasurfaces with the ability to control polarization and phase. Instead of polarization filtering, the method is based on splitting and focusing light in three different polarization bases. Therefore, it enables full-Stokes characterization of the state of polarization, and overcomes the 50% theoretical efficiency limit of the polarization-filter-based DoFP-PCs.
physics.optics
polarization is a degree of freedom of light carrying important information that is usually absent in intensity and spectral content imaging polarimetry is the process of determining the polarization state of light either partially or fully over an extended scene it has found several applications in various fields from remote sensing to biology among different devices for imaging polarimetry division of focal plane polarization cameras dofppcs are more compact less complicated and less expensive in general dofppcs are based on an array of polarization filters in the focal plane here we demonstrate a new principle and design for dofppcs based on dielectric metasurfaces with the ability to control polarization and phase instead of polarization filtering the method is based on splitting and focusing light in three different polarization bases therefore it enables fullstokes characterization of the state of polarization and overcomes the 50 theoretical efficiency limit of the polarizationfilterbased dofppcs
[['polarization', 'is', 'a', 'degree', 'of', 'freedom', 'of', 'light', 'carrying', 'important', 'information', 'that', 'is', 'usually', 'absent', 'in', 'intensity', 'and', 'spectral', 'content', 'imaging', 'polarimetry', 'is', 'the', 'process', 'of', 'determining', 'the', 'polarization', 'state', 'of', 'light', 'either', 'partially', 'or', 'fully', 'over', 'an', 'extended', 'scene', 'it', 'has', 'found', 'several', 'applications', 'in', 'various', 'fields', 'from', 'remote', 'sensing', 'to', 'biology', 'among', 'different', 'devices', 'for', 'imaging', 'polarimetry', 'division', 'of', 'focal', 'plane', 'polarization', 'cameras', 'dofppcs', 'are', 'more', 'compact', 'less', 'complicated', 'and', 'less', 'expensive', 'in', 'general', 'dofppcs', 'are', 'based', 'on', 'an', 'array', 'of', 'polarization', 'filters', 'in', 'the', 'focal', 'plane', 'here', 'we', 'demonstrate', 'a', 'new', 'principle', 'and', 'design', 'for', 'dofppcs', 'based', 'on', 'dielectric', 'metasurfaces', 'with', 'the', 'ability', 'to', 'control', 'polarization', 'and', 'phase', 'instead', 'of', 'polarization', 'filtering', 'the', 'method', 'is', 'based', 'on', 'splitting', 'and', 'focusing', 'light', 'in', 'three', 'different', 'polarization', 'bases', 'therefore', 'it', 'enables', 'fullstokes', 'characterization', 'of', 'the', 'state', 'of', 'polarization', 'and', 'overcomes', 'the', '50', 'theoretical', 'efficiency', 'limit', 'of', 'the', 'polarizationfilterbased', 'dofppcs']]
[-0.12280676886361193, 0.11267879307945884, -0.07033895624288977, -0.008814036265976518, -0.09787691322674087, -0.11973886731887023, 0.005146340774872259, 0.46388859549324785, -0.2460540743019657, -0.3043271076159189, 0.12800850943840364, -0.2603393183464822, -0.13577376153701354, 0.25006904016286385, -0.047082605746718464, 0.030242908956958043, 0.0087842861982834, -0.04679537372626114, -0.03300315002135733, -0.17041098960322146, 0.2877642083913088, 0.05905192394759631, 0.3270071910712993, 0.03278693107688087, 0.11365136275092927, 0.08307535404608203, -0.054418022956874146, 0.006689495157025404, -0.014860820852076687, 0.14544097295862266, 0.2441178115722317, 0.13611863074736708, 0.19491624845279343, -0.40866069515679504, -0.2138007209392502, 0.08093751637240085, 0.12489920400314333, 0.10557938068042566, -0.060538223292698125, -0.24076288239092836, 0.013839639613136098, -0.07426145906810533, -0.11310021943190438, -0.061329637747883, 0.010155145844582143, 0.007920798423681282, -0.24380303747426943, 0.021639018933657533, 0.01438539791867862, 0.10139461319218546, -0.0402420514007138, -0.13048191709153278, -0.03008098019233861, 0.0887401909583042, -0.03278968781377376, 0.020540513180277543, 0.10305709511529179, -0.14827437007537225, -0.11508003934505302, 0.37304925936705513, -0.024062872886963987, -0.1837804288597115, 0.166005090399389, -0.18456668650493926, -0.08807894116230058, 0.1761749219055594, 0.21134132583119325, 0.1773417435005157, -0.1610404792485521, 0.022547047152402716, 0.02376998668449037, 0.2240371532588197, 0.0915518782004689, 0.11797396292255241, 0.24488550443639792, 0.2035739767933952, 0.08182921318412327, 0.13177842406506007, -0.17068147661333166, -0.059483731559308986, -0.23253176173885923, -0.14586025328553537, -0.1975656843841101, 0.0405095071272437, -0.09210620602634235, -0.12424176539475686, 0.41443535901298245, 0.16489424079503465, 0.12314734693254101, -0.03549802556458936, 0.3546061042427467, 0.05460534756221877, 0.08699669014512493, 0.017485397563147164, 0.2884871163905517, 0.16544666624512375, 0.11319166634328688, -0.19960116378372322, 0.03119449207446719, -0.05714814152081041]
1,803.03385
Three-dimensional MHD Simulations of Solar Prominence Oscillations in a Magnetic Flux Rope
Solar prominences are subject to all kinds of perturbations during their lifetime, and frequently demonstrate oscillations. The study of prominence oscillations provides an alternative way to investigate their internal magnetic and thermal structures as the oscillation characteristics depend on their interplay with the solar corona. Prominence oscillations can be classified into longitudinal and transverse types. We perform three-dimensional ideal magnetohydrodynamic simulations of prominence oscillations along a magnetic flux rope, with the aim to compare the oscillation periods with those predicted by various simplified models and to examine the restoring force. We find that the longitudinal oscillation has a period of about 49 minutes, which is in accordance with the pendulum model where the field-ligned component of gravity serves as the restoring force. In contrast, the horizontal transverse oscillation has a period of about 10 minutes and the vertical transverse oscillation has a period of about 14 minutes, and both of them can be nicely fitted with a two-dimensional slab model. We also find that the magnetic tension force dominates most of the time in transverse oscillations, except for the first minute when magnetic pressure overwhelms.
astro-ph.SR
solar prominences are subject to all kinds of perturbations during their lifetime and frequently demonstrate oscillations the study of prominence oscillations provides an alternative way to investigate their internal magnetic and thermal structures as the oscillation characteristics depend on their interplay with the solar corona prominence oscillations can be classified into longitudinal and transverse types we perform threedimensional ideal magnetohydrodynamic simulations of prominence oscillations along a magnetic flux rope with the aim to compare the oscillation periods with those predicted by various simplified models and to examine the restoring force we find that the longitudinal oscillation has a period of about 49 minutes which is in accordance with the pendulum model where the fieldligned component of gravity serves as the restoring force in contrast the horizontal transverse oscillation has a period of about 10 minutes and the vertical transverse oscillation has a period of about 14 minutes and both of them can be nicely fitted with a twodimensional slab model we also find that the magnetic tension force dominates most of the time in transverse oscillations except for the first minute when magnetic pressure overwhelms
[['solar', 'prominences', 'are', 'subject', 'to', 'all', 'kinds', 'of', 'perturbations', 'during', 'their', 'lifetime', 'and', 'frequently', 'demonstrate', 'oscillations', 'the', 'study', 'of', 'prominence', 'oscillations', 'provides', 'an', 'alternative', 'way', 'to', 'investigate', 'their', 'internal', 'magnetic', 'and', 'thermal', 'structures', 'as', 'the', 'oscillation', 'characteristics', 'depend', 'on', 'their', 'interplay', 'with', 'the', 'solar', 'corona', 'prominence', 'oscillations', 'can', 'be', 'classified', 'into', 'longitudinal', 'and', 'transverse', 'types', 'we', 'perform', 'threedimensional', 'ideal', 'magnetohydrodynamic', 'simulations', 'of', 'prominence', 'oscillations', 'along', 'a', 'magnetic', 'flux', 'rope', 'with', 'the', 'aim', 'to', 'compare', 'the', 'oscillation', 'periods', 'with', 'those', 'predicted', 'by', 'various', 'simplified', 'models', 'and', 'to', 'examine', 'the', 'restoring', 'force', 'we', 'find', 'that', 'the', 'longitudinal', 'oscillation', 'has', 'a', 'period', 'of', 'about', '49', 'minutes', 'which', 'is', 'in', 'accordance', 'with', 'the', 'pendulum', 'model', 'where', 'the', 'fieldligned', 'component', 'of', 'gravity', 'serves', 'as', 'the', 'restoring', 'force', 'in', 'contrast', 'the', 'horizontal', 'transverse', 'oscillation', 'has', 'a', 'period', 'of', 'about', '10', 'minutes', 'and', 'the', 'vertical', 'transverse', 'oscillation', 'has', 'a', 'period', 'of', 'about', '14', 'minutes', 'and', 'both', 'of', 'them', 'can', 'be', 'nicely', 'fitted', 'with', 'a', 'twodimensional', 'slab', 'model', 'we', 'also', 'find', 'that', 'the', 'magnetic', 'tension', 'force', 'dominates', 'most', 'of', 'the', 'time', 'in', 'transverse', 'oscillations', 'except', 'for', 'the', 'first', 'minute', 'when', 'magnetic', 'pressure', 'overwhelms']]
[-0.15613196996982087, 0.22789378451639292, -0.030505130452144404, 0.06884840991077236, -0.0811498727163543, -0.07281345986690291, 0.008047329960390925, 0.3721040138144694, -0.23961857072920437, -0.37462543567602075, 0.0920378880900503, -0.25148247980652505, -0.09770149775051876, 0.2404855619280842, 0.011314956719339218, -0.0034806859526408675, 0.07061838839676372, 0.056697012411187526, -0.022137041129020003, -0.168989048192642, 0.2517563461227363, 0.07258553230254304, 0.2567424370866755, -0.008830049252340003, 0.0563731094108611, -0.049851127749602514, -0.019421254998198256, 0.0395524875190028, -0.1312536706709184, 0.0064195617830947686, 0.12936839877497536, 0.021066833014154563, 0.23295346436941106, -0.4902067077042454, -0.22503823693209005, 0.04871618169683801, 0.16348612950684543, 0.10107208631044436, 0.01811364726555716, -0.23268315926923053, 0.048264833634754686, -0.12724410177021206, -0.1459080418015061, -0.05453905141305016, 0.04532614427760406, 0.02985408957212475, -0.23467942855835566, 0.13850720154242363, 0.030232359354040058, 0.11121746221349736, -0.12397495138841054, -0.06239266257161153, -0.06698614389587539, 0.12195227431331422, 0.1384838944498409, 0.05539938390923097, 0.1634774807759601, -0.09175967433586028, -0.10405786284979474, 0.3835238160099834, -0.08847733790120717, -0.11614087145299772, 0.17665886056214652, -0.19366489960963879, -0.059294468925698944, 0.11908390162431676, 0.16204261189103936, 0.030149069561562297, -0.10974646675687995, 0.002007815691404571, -0.03176167741564669, 0.16327381786844775, 0.0879748668724104, -0.006043442155477469, 0.28937154386506375, 0.16786325477827949, 0.018513802430749383, 0.12872794290128892, -0.1868285623395818, -0.05766160902314131, -0.2734871963848886, -0.10482961935770657, -0.06109090097838223, 0.057636674981989454, -0.04612705868788433, -0.18335488099483369, 0.47504496242365113, 0.13307390827282253, 0.2289815613615286, -0.01044662148405737, 0.3078627697642609, 0.09057535138360792, 0.07501552752325116, 0.08263679738308344, 0.30827633300087537, 0.19033129371161087, 0.16518941694116424, -0.2583572186109529, 0.028432466185894675, 0.0026615626234358742]
1,803.03386
Fundamental and Progress of Bi2Te3-based Thermoelectric Materials
Thermoelectric materials, enabling the directing conversion between heat and electricity, are one of the promising candidates for overcoming environmental pollution and the upcoming energy shortage caused by the over-consumption of fossil fuels. Bi2Te3-based alloys are the classical thermoelectric materials working near room temperature. Due to the intensive theoretical investigations and experimental demonstrations, significant progress has been achieved to enhance the thermoelectric performance of Bi2Te3-based thermoelectric materials. In this review, we first explored the fundamentals of thermoelectric effect and derived the equations for thermoelectric properties. On this basis, we studied the effect of material parameters on thermoelectric properties. Then, we analyzed the features of Bi2Te3-based thermoelectric materials, including the lattice defects, anisotropic behavior and the strong bipolar conduction at relatively high temperature. Then we accordingly summarized the strategies for enhancing the thermoelectric performance, including point defect engineering, texture alignment, and band gap enlargement. Moreover, we highlighted the progress in decreasing thermal conductivity using nanostructures fabricated by solution grown method, ball milling, and melt spinning. Lastly, we employed modeling analysis to uncover the principles of anisotropy behavior and the achieved enhancement in Bi2Te3, which will enlighten the enhancement of thermoelectric performance in broader materials.
cond-mat.mtrl-sci
thermoelectric materials enabling the directing conversion between heat and electricity are one of the promising candidates for overcoming environmental pollution and the upcoming energy shortage caused by the overconsumption of fossil fuels bi2te3based alloys are the classical thermoelectric materials working near room temperature due to the intensive theoretical investigations and experimental demonstrations significant progress has been achieved to enhance the thermoelectric performance of bi2te3based thermoelectric materials in this review we first explored the fundamentals of thermoelectric effect and derived the equations for thermoelectric properties on this basis we studied the effect of material parameters on thermoelectric properties then we analyzed the features of bi2te3based thermoelectric materials including the lattice defects anisotropic behavior and the strong bipolar conduction at relatively high temperature then we accordingly summarized the strategies for enhancing the thermoelectric performance including point defect engineering texture alignment and band gap enlargement moreover we highlighted the progress in decreasing thermal conductivity using nanostructures fabricated by solution grown method ball milling and melt spinning lastly we employed modeling analysis to uncover the principles of anisotropy behavior and the achieved enhancement in bi2te3 which will enlighten the enhancement of thermoelectric performance in broader materials
[['thermoelectric', 'materials', 'enabling', 'the', 'directing', 'conversion', 'between', 'heat', 'and', 'electricity', 'are', 'one', 'of', 'the', 'promising', 'candidates', 'for', 'overcoming', 'environmental', 'pollution', 'and', 'the', 'upcoming', 'energy', 'shortage', 'caused', 'by', 'the', 'overconsumption', 'of', 'fossil', 'fuels', 'bi2te3based', 'alloys', 'are', 'the', 'classical', 'thermoelectric', 'materials', 'working', 'near', 'room', 'temperature', 'due', 'to', 'the', 'intensive', 'theoretical', 'investigations', 'and', 'experimental', 'demonstrations', 'significant', 'progress', 'has', 'been', 'achieved', 'to', 'enhance', 'the', 'thermoelectric', 'performance', 'of', 'bi2te3based', 'thermoelectric', 'materials', 'in', 'this', 'review', 'we', 'first', 'explored', 'the', 'fundamentals', 'of', 'thermoelectric', 'effect', 'and', 'derived', 'the', 'equations', 'for', 'thermoelectric', 'properties', 'on', 'this', 'basis', 'we', 'studied', 'the', 'effect', 'of', 'material', 'parameters', 'on', 'thermoelectric', 'properties', 'then', 'we', 'analyzed', 'the', 'features', 'of', 'bi2te3based', 'thermoelectric', 'materials', 'including', 'the', 'lattice', 'defects', 'anisotropic', 'behavior', 'and', 'the', 'strong', 'bipolar', 'conduction', 'at', 'relatively', 'high', 'temperature', 'then', 'we', 'accordingly', 'summarized', 'the', 'strategies', 'for', 'enhancing', 'the', 'thermoelectric', 'performance', 'including', 'point', 'defect', 'engineering', 'texture', 'alignment', 'and', 'band', 'gap', 'enlargement', 'moreover', 'we', 'highlighted', 'the', 'progress', 'in', 'decreasing', 'thermal', 'conductivity', 'using', 'nanostructures', 'fabricated', 'by', 'solution', 'grown', 'method', 'ball', 'milling', 'and', 'melt', 'spinning', 'lastly', 'we', 'employed', 'modeling', 'analysis', 'to', 'uncover', 'the', 'principles', 'of', 'anisotropy', 'behavior', 'and', 'the', 'achieved', 'enhancement', 'in', 'bi2te3', 'which', 'will', 'enlighten', 'the', 'enhancement', 'of', 'thermoelectric', 'performance', 'in', 'broader', 'materials']]
[-0.1148812839819584, 0.10534630041668909, -0.034608529601731185, -0.009879641303086828, -0.0684293463115561, -0.12567322919494472, 0.1016547822218854, 0.4223487820515099, -0.27755638740685146, -0.30471024706882116, 0.06410729006226272, -0.3373683020339134, -0.14911967255951217, 0.2643006456346484, -0.022463184633428075, 0.08791325999482069, 0.006965268971422726, -0.11238950179661818, -0.10959610180968109, -0.2288602212089851, 0.21006437327499347, 0.12501598553111157, 0.3771126354028335, 0.1393011643352414, 0.0529857576645251, -0.04946920021399137, 0.03837830447446322, 0.05024402407798334, -0.16639131436818388, 0.1273222930790515, 0.2858867279998473, -0.06256415754493598, 0.230567699400126, -0.44698413657291286, -0.25449537950286566, 0.029995334459575435, 0.09612157691056684, 0.07737837204270666, -0.16032240885760984, -0.20243300474006296, 0.0811673290396963, -0.16383336749398345, -0.0967099808282607, -0.12082838332658714, -0.011377232927619238, 0.00812924394995207, -0.1917313925854008, 0.04521242417710406, 0.056873519934811156, 0.10365070812076738, -0.0972234462775911, -0.19959484051408558, -0.03579745753328704, 0.07924706523287266, 0.0738275425816634, -0.04851039445929928, 0.2282481415871492, -0.18548734430441982, -0.11512202502247722, 0.4150685374333989, -0.032292321057563335, -0.09234398408201135, 0.1572722463934042, -0.16768747188325506, -0.09822436119429767, 0.11794392025452301, 0.1839968095640264, 0.07996815950536984, -0.17776105670782272, 0.03364001649121443, 0.07010808550694492, 0.10978121284597364, 0.041543687919935714, 0.10863464811427548, 0.25503698201767594, 0.2582540940529725, -0.01277399473474361, 0.1762587227143134, -0.08063310602483398, -0.00015672498557250947, -0.18347352937939831, -0.19429262193564986, -0.1958334114315221, 0.08723383783641718, -0.0832807500501076, -0.1274757866356898, 0.43551022808727186, 0.20626997840796926, 0.09083683515685455, -0.07953748053281136, 0.2539235444613344, 0.10359469700294237, 0.07624810283474896, 0.020687488976060802, 0.28269347594323335, 0.13304064454337095, 0.17145066371449502, -0.2996873004643324, 0.10088524010658755, 0.0034010394980820515]
1,803.03387
Spin exchange-induced spin-orbit coupling in a superuid mixture
We investigate the ground-state properties of a dual-species spin-1/2 Bose-Einstein condensate. One of the species is subjected to a pair of Raman laser beams that induces spin-orbit (SO) coupling, whereas the other species is not coupled to the Raman laser. In certain limits, analytical results can be obtained. It is clearly shown that, through the inter-species spin-exchange interaction, the second species also exhibits SO coupling. This mixture system displays a very rich phase diagram, with many of the phases not present in an SO coupled single-species condensate. Our work provides a new way of creating SO coupling in atomic quantum gases, and opens up a new avenue of research in SO coupled superfluid mixtures. From a practical point of view, the spin exchange-induced SO coupling may overcome the heating issue for certain atomic species when subjected to the Raman beams.
cond-mat.quant-gas
we investigate the groundstate properties of a dualspecies spin12 boseeinstein condensate one of the species is subjected to a pair of raman laser beams that induces spinorbit so coupling whereas the other species is not coupled to the raman laser in certain limits analytical results can be obtained it is clearly shown that through the interspecies spinexchange interaction the second species also exhibits so coupling this mixture system displays a very rich phase diagram with many of the phases not present in an so coupled singlespecies condensate our work provides a new way of creating so coupling in atomic quantum gases and opens up a new avenue of research in so coupled superfluid mixtures from a practical point of view the spin exchangeinduced so coupling may overcome the heating issue for certain atomic species when subjected to the raman beams
[['we', 'investigate', 'the', 'groundstate', 'properties', 'of', 'a', 'dualspecies', 'spin12', 'boseeinstein', 'condensate', 'one', 'of', 'the', 'species', 'is', 'subjected', 'to', 'a', 'pair', 'of', 'raman', 'laser', 'beams', 'that', 'induces', 'spinorbit', 'so', 'coupling', 'whereas', 'the', 'other', 'species', 'is', 'not', 'coupled', 'to', 'the', 'raman', 'laser', 'in', 'certain', 'limits', 'analytical', 'results', 'can', 'be', 'obtained', 'it', 'is', 'clearly', 'shown', 'that', 'through', 'the', 'interspecies', 'spinexchange', 'interaction', 'the', 'second', 'species', 'also', 'exhibits', 'so', 'coupling', 'this', 'mixture', 'system', 'displays', 'a', 'very', 'rich', 'phase', 'diagram', 'with', 'many', 'of', 'the', 'phases', 'not', 'present', 'in', 'an', 'so', 'coupled', 'singlespecies', 'condensate', 'our', 'work', 'provides', 'a', 'new', 'way', 'of', 'creating', 'so', 'coupling', 'in', 'atomic', 'quantum', 'gases', 'and', 'opens', 'up', 'a', 'new', 'avenue', 'of', 'research', 'in', 'so', 'coupled', 'superfluid', 'mixtures', 'from', 'a', 'practical', 'point', 'of', 'view', 'the', 'spin', 'exchangeinduced', 'so', 'coupling', 'may', 'overcome', 'the', 'heating', 'issue', 'for', 'certain', 'atomic', 'species', 'when', 'subjected', 'to', 'the', 'raman', 'beams']]
[-0.1496761879476253, 0.2433189608448759, -0.08010932496482773, -0.025416508907385702, -0.013075507114574845, -0.19651781202160887, 0.06163543015385845, 0.3869604350067675, -0.2705475244371753, -0.2418853782034213, -0.041779332614636844, -0.2757250956924898, -0.11204755576077982, 0.18240940204621958, 0.0547153356052669, 0.017125024859394346, 0.035463907686062154, -0.014383797555430127, -0.01969325316105304, -0.20529585030994246, 0.3076375447745834, 0.026555518000220348, 0.3030386563556801, 0.10407289679361774, 0.08645683182736061, -0.04484425526544718, 0.07814113306147712, -0.022926440349380885, -0.12048123616311517, 0.06765545293954867, 0.24216503050619004, -0.0017244031519762107, 0.23065968937506634, -0.4300589068726237, -0.21751772823543952, 0.09580855052252965, 0.2054015611098813, 0.2237371135885561, -0.0847485402399408, -0.29439696483979266, -0.09231192868069879, -0.17656326545735024, -0.16438861371550176, -0.13565788726388875, -0.023040404385080496, 0.030179339820252997, -0.2801791184049632, 0.03507271639017355, 0.055119658284820613, 0.07313097963675058, -0.04550156221458954, -0.06098252924940815, -0.01732518582970702, 0.0593042264187326, 0.01860060622483226, 0.02963926676062069, 0.1259332360466942, -0.15478872824792883, -0.05932264868170023, 0.429896492883563, -0.1164728439629211, -0.1492713473870286, 0.24043096170893738, -0.13112555931698547, -0.11275718409368503, 0.16252458051562177, 0.10984123607465465, 0.10528902284734483, -0.1774638184842063, 0.050116723851949374, -0.045436533743382565, 0.1992625147696734, 0.07365742228825443, 0.06930822795589588, 0.27413636698786703, 0.20767226781130635, 0.062315901982115715, 0.1962467884524293, -0.0992185648164845, -0.11074402300042234, -0.21111995665289993, -0.14735440355725588, -0.17055482757277787, 0.037943293500367355, -0.012436140541415496, -0.14152349444567724, 0.37324210688737885, 0.1727765793679282, 0.17610732208205654, -0.06681536209569978, 0.27126539890887214, 0.10462188687192144, 0.06633238342723675, -0.024399150049846087, 0.29714317466464957, 0.17463786433550663, 0.07057799111186926, -0.28032130600705774, 0.02450855371342706, 0.010387287787826998]
1,803.03388
Multi-D Simulations of Ultra-Stripped Supernovae to Shock Breakout
The recent discoveries of many double neutron star systems and their detection as LIGO-Virgo merger events call for a detailed understanding of their origin. Explosions of ultra-stripped stars in binary systems have been shown to play a key role in this context and have also generated interest as a potential explanation for rapidly evolving hydrogen-free transients. Here we present the first attempt to model such explosions based on binary evolution calculations that follow the mass transfer to the companion to obtain a consistent core-envelope structure as needed for reliable predictions of the supernova transient. We simulate the explosion in 2D and 3D, and confirm the modest explosion energies ~10^50erg and small kick velocities reported earlier in 2D models based on bare carbon-oxygen cores. The spin-up of the neutron star by asymmetric accretion is small in 3D with no indication of spin-kick alignment. Simulations up to shock breakout show the mixing of sizeable amounts of iron group material into the helium envelope. In view of recent ideas for a mixing-length treatment (MLT) of Rayleigh-Taylor instabilities in supernovae, we perform a detailed analysis of the mixing, which reveals evidence for buoyancy-drag balance, but otherwise does not support the MLT approximation. The mixing may have implications for the spectroscopic signatures of ultra-stripped supernovae that need to be investigated in the future. Our stellar evolution calculation also predicts presupernova mass loss due to an off-centre silicon deflagration flash, which suggests that supernovae from extremely stripped cores may show signs of interactions with circumstellar material.
astro-ph.SR astro-ph.HE
the recent discoveries of many double neutron star systems and their detection as ligovirgo merger events call for a detailed understanding of their origin explosions of ultrastripped stars in binary systems have been shown to play a key role in this context and have also generated interest as a potential explanation for rapidly evolving hydrogenfree transients here we present the first attempt to model such explosions based on binary evolution calculations that follow the mass transfer to the companion to obtain a consistent coreenvelope structure as needed for reliable predictions of the supernova transient we simulate the explosion in 2d and 3d and confirm the modest explosion energies 1050erg and small kick velocities reported earlier in 2d models based on bare carbonoxygen cores the spinup of the neutron star by asymmetric accretion is small in 3d with no indication of spinkick alignment simulations up to shock breakout show the mixing of sizeable amounts of iron group material into the helium envelope in view of recent ideas for a mixinglength treatment mlt of rayleightaylor instabilities in supernovae we perform a detailed analysis of the mixing which reveals evidence for buoyancydrag balance but otherwise does not support the mlt approximation the mixing may have implications for the spectroscopic signatures of ultrastripped supernovae that need to be investigated in the future our stellar evolution calculation also predicts presupernova mass loss due to an offcentre silicon deflagration flash which suggests that supernovae from extremely stripped cores may show signs of interactions with circumstellar material
[['the', 'recent', 'discoveries', 'of', 'many', 'double', 'neutron', 'star', 'systems', 'and', 'their', 'detection', 'as', 'ligovirgo', 'merger', 'events', 'call', 'for', 'a', 'detailed', 'understanding', 'of', 'their', 'origin', 'explosions', 'of', 'ultrastripped', 'stars', 'in', 'binary', 'systems', 'have', 'been', 'shown', 'to', 'play', 'a', 'key', 'role', 'in', 'this', 'context', 'and', 'have', 'also', 'generated', 'interest', 'as', 'a', 'potential', 'explanation', 'for', 'rapidly', 'evolving', 'hydrogenfree', 'transients', 'here', 'we', 'present', 'the', 'first', 'attempt', 'to', 'model', 'such', 'explosions', 'based', 'on', 'binary', 'evolution', 'calculations', 'that', 'follow', 'the', 'mass', 'transfer', 'to', 'the', 'companion', 'to', 'obtain', 'a', 'consistent', 'coreenvelope', 'structure', 'as', 'needed', 'for', 'reliable', 'predictions', 'of', 'the', 'supernova', 'transient', 'we', 'simulate', 'the', 'explosion', 'in', '2d', 'and', '3d', 'and', 'confirm', 'the', 'modest', 'explosion', 'energies', '1050erg', 'and', 'small', 'kick', 'velocities', 'reported', 'earlier', 'in', '2d', 'models', 'based', 'on', 'bare', 'carbonoxygen', 'cores', 'the', 'spinup', 'of', 'the', 'neutron', 'star', 'by', 'asymmetric', 'accretion', 'is', 'small', 'in', '3d', 'with', 'no', 'indication', 'of', 'spinkick', 'alignment', 'simulations', 'up', 'to', 'shock', 'breakout', 'show', 'the', 'mixing', 'of', 'sizeable', 'amounts', 'of', 'iron', 'group', 'material', 'into', 'the', 'helium', 'envelope', 'in', 'view', 'of', 'recent', 'ideas', 'for', 'a', 'mixinglength', 'treatment', 'mlt', 'of', 'rayleightaylor', 'instabilities', 'in', 'supernovae', 'we', 'perform', 'a', 'detailed', 'analysis', 'of', 'the', 'mixing', 'which', 'reveals', 'evidence', 'for', 'buoyancydrag', 'balance', 'but', 'otherwise', 'does', 'not', 'support', 'the', 'mlt', 'approximation', 'the', 'mixing', 'may', 'have', 'implications', 'for', 'the', 'spectroscopic', 'signatures', 'of', 'ultrastripped', 'supernovae', 'that', 'need', 'to', 'be', 'investigated', 'in', 'the', 'future', 'our', 'stellar', 'evolution', 'calculation', 'also', 'predicts', 'presupernova', 'mass', 'loss', 'due', 'to', 'an', 'offcentre', 'silicon', 'deflagration', 'flash', 'which', 'suggests', 'that', 'supernovae', 'from', 'extremely', 'stripped', 'cores', 'may', 'show', 'signs', 'of', 'interactions', 'with', 'circumstellar', 'material']]
[-0.06927639037673361, 0.12735904898826267, -0.06992437171773054, 0.12027375090867282, -0.10636537175253033, -0.06982475117221475, 0.06630156397353858, 0.3834593160822988, -0.18579659222066403, -0.32845480197947474, 0.0710430470071733, -0.2622805126495659, -0.09417492566583678, 0.2110015808250755, -0.014591645561245968, -0.0028940479746088384, 0.16326380931935272, -0.052755415292456746, -0.11453943380620331, -0.21291229312308133, 0.31809868817217646, 0.0971673203362152, 0.1808596315421164, 0.01746494187042117, 0.03472775503247976, -0.09235705928038805, -0.051977823479101064, -0.05504047118127346, -0.15072471679499722, 0.023409209960140287, 0.20291210461455922, 0.12555026893969626, 0.22067225365433843, -0.46805074001848695, -0.3049691065370571, 0.06934163580031599, 0.20791413143090903, 0.13476834909524768, -0.15482409962359817, -0.22335055784042926, 0.06694110209937207, -0.26251356269419196, -0.14204653584770857, -0.016894720643758774, 0.05303827339154668, 0.048604769243393096, -0.2586315770347137, 0.09680114537314512, 0.07237574151158332, 0.028598973064188613, -0.10018173732655122, -0.09045201820880175, -0.05508056571055204, 0.06563573165098205, 0.06232085279840976, 0.028869109354913235, 0.1123008409999311, -0.14485602360218763, -0.04821705900877714, 0.43067253736406563, -0.05810439714789391, -0.03986642555147409, 0.23168844352243467, -0.17581986973248423, -0.1515142338834703, 0.15654998574778436, 0.18618103131139652, 0.10676203368324787, -0.13341549252043478, -0.0505416051663924, 0.0009336523842066526, 0.16047805185057223, 0.024829484787769616, 0.031030604750761994, 0.32925207198783757, 0.20154313053935766, -0.02374237709841691, 0.056418102328199896, -0.15827197559922934, -0.07106803711876274, -0.25085091568902135, -0.11915370887890459, -0.12559081297181546, 0.10188989591010614, -0.07993907853838755, -0.1756025691929972, 0.3110850652095396, 0.14688879269827157, 0.1925494220391847, -0.028094366451725365, 0.25928334283269944, 0.05596627227868885, 0.09732020738720894, 0.08712464148178696, 0.32836369061935694, 0.1936071697929874, 0.11635515705868602, -0.2580775280976668, 0.13513793879840524, 0.035487656557001174]
1,803.03389
Ramsey Interferometry based on stimulated Brillouin scattering
Realizing highly sensitive interferometry is essential to accurate observation of quantum properties. Here we study two kinds of Ramsey interference fringes in a whispering-gallery resonator, where the coherent phonons for free evolution can be achieved by stimulated Brillouin scattering. These two different fringes appear, respectively, in the regimes of rotating wave approximation (RWA) and anti-RWA. Our work shows particularly that the anti-RWA Ramsey interference takes some quantum properties of squeezing, which enhances the strength and visibility of the fringes and shows robustness against the system's decay. In application, our proposal, feasible with current laboratory techniques, provides a practical idea for building better quantum interferometers.
quant-ph physics.optics
realizing highly sensitive interferometry is essential to accurate observation of quantum properties here we study two kinds of ramsey interference fringes in a whisperinggallery resonator where the coherent phonons for free evolution can be achieved by stimulated brillouin scattering these two different fringes appear respectively in the regimes of rotating wave approximation rwa and antirwa our work shows particularly that the antirwa ramsey interference takes some quantum properties of squeezing which enhances the strength and visibility of the fringes and shows robustness against the systems decay in application our proposal feasible with current laboratory techniques provides a practical idea for building better quantum interferometers
[['realizing', 'highly', 'sensitive', 'interferometry', 'is', 'essential', 'to', 'accurate', 'observation', 'of', 'quantum', 'properties', 'here', 'we', 'study', 'two', 'kinds', 'of', 'ramsey', 'interference', 'fringes', 'in', 'a', 'whisperinggallery', 'resonator', 'where', 'the', 'coherent', 'phonons', 'for', 'free', 'evolution', 'can', 'be', 'achieved', 'by', 'stimulated', 'brillouin', 'scattering', 'these', 'two', 'different', 'fringes', 'appear', 'respectively', 'in', 'the', 'regimes', 'of', 'rotating', 'wave', 'approximation', 'rwa', 'and', 'antirwa', 'our', 'work', 'shows', 'particularly', 'that', 'the', 'antirwa', 'ramsey', 'interference', 'takes', 'some', 'quantum', 'properties', 'of', 'squeezing', 'which', 'enhances', 'the', 'strength', 'and', 'visibility', 'of', 'the', 'fringes', 'and', 'shows', 'robustness', 'against', 'the', 'systems', 'decay', 'in', 'application', 'our', 'proposal', 'feasible', 'with', 'current', 'laboratory', 'techniques', 'provides', 'a', 'practical', 'idea', 'for', 'building', 'better', 'quantum', 'interferometers']]
[-0.18543546145352033, 0.1837615049444139, -0.1102819235966308, 0.0447030692739645, -0.030735561525664076, -0.15494949034809208, 0.05347879366196979, 0.38298625473936015, -0.2246898995184053, -0.25771220535254824, 0.011366407206738725, -0.2453834205516614, -0.172947042384364, 0.2686062804871024, -0.02625219340440638, 0.10308966407767282, 0.07930577450875156, -0.04273830323318879, -0.013519511869302593, -0.18952176125290301, 0.286236908814037, 0.04690400313232273, 0.35772802144772586, 0.05175951484572859, 0.03643206395925237, 0.02530391934963588, 0.014541162106280144, -0.019635814080874506, -0.10165945318889359, 0.07718686887080996, 0.28585531542865705, 0.07849818970358823, 0.22994084595344388, -0.4415996745407868, -0.21372434283861927, 0.04019735874429058, 0.17850026448930015, 0.1816117431377419, -0.046777551635526694, -0.3498787615143766, -0.008966892762915589, -0.11637606645504442, -0.12726456418973753, -0.10169865255011246, -0.013231979799456894, 0.00010203200844653811, -0.2571196568807444, 0.04188946443788994, 0.06219961831364064, 0.00890641213537982, 0.03168354424325606, -0.05942349266619063, 0.07152666974490365, 0.09033227665797593, -0.05443962564235195, -0.005949684626942214, 0.1121498761125482, -0.1250667163851456, -0.149795177186696, 0.37586093863221604, -0.08396256488273278, -0.1257263253433988, 0.17476604102054039, -0.16692580295337114, -0.0635755163563702, 0.11337443594283496, 0.10751025427117174, 0.10907092366295938, -0.0694315194772431, 0.009620989801008433, 0.012574346995909135, 0.1666366973793349, 0.14454617586810714, 0.18704581103520468, 0.20757999650175826, 0.18376196627146923, 0.055380181525833905, 0.15300560623402887, -0.12914089663760164, -0.11350981916677064, -0.254099437680382, -0.11614344433963616, -0.18459989768542492, 0.042105781590949985, -0.05164792253862498, -0.12106030167958054, 0.40361534179045033, 0.17908188668381905, 0.1259627527514777, -0.02838779870496812, 0.365575231719189, 0.10241337993871778, 0.03767548391792493, -0.0011101403461697584, 0.31952875088077587, 0.1915682713263847, 0.05758571504758528, -0.29736877246558346, 0.011434123779159004, -0.01790257732724198]
1,803.0339
Phase Transition and Field Effect Topological Quantum Transistor made of monolayer MoS2
We study topological phase transitions and topological quantum field effect transistor in monolayer Molybdenum Disulfide (MoS2) using a two-band Hamiltonian model. Without considering the quadratic (q^2) diagonal term in the Hamiltonian, we show that the phase diagram includes quantum anomalous Hall (QAH), quantum spin Hall (QSH), and spin quantum anomalous Hall effect (SQAH) regions such that the topological Kirchhoff law is satisfied in the plane. By considering the q^2 diagonal term and including one valley, it is shown that MoS2 has a non-trivial topology, and the valley Chern number is non-zero for each spin. We show that the wave function is (is not) localized at the edges when the q^2 diagonal term is added (deleted) to (from) the spin-valley Dirac mass equation. We calculate the quantum conductance of zigzag MoS2 nanoribbons by using the nonequilibrium Green function method and show how this device works as a field effect topological quantum transistor.
cond-mat.mes-hall cond-mat.mtrl-sci
we study topological phase transitions and topological quantum field effect transistor in monolayer molybdenum disulfide mos2 using a twoband hamiltonian model without considering the quadratic q2 diagonal term in the hamiltonian we show that the phase diagram includes quantum anomalous hall qah quantum spin hall qsh and spin quantum anomalous hall effect sqah regions such that the topological kirchhoff law is satisfied in the plane by considering the q2 diagonal term and including one valley it is shown that mos2 has a nontrivial topology and the valley chern number is nonzero for each spin we show that the wave function is is not localized at the edges when the q2 diagonal term is added deleted to from the spinvalley dirac mass equation we calculate the quantum conductance of zigzag mos2 nanoribbons by using the nonequilibrium green function method and show how this device works as a field effect topological quantum transistor
[['we', 'study', 'topological', 'phase', 'transitions', 'and', 'topological', 'quantum', 'field', 'effect', 'transistor', 'in', 'monolayer', 'molybdenum', 'disulfide', 'mos2', 'using', 'a', 'twoband', 'hamiltonian', 'model', 'without', 'considering', 'the', 'quadratic', 'q2', 'diagonal', 'term', 'in', 'the', 'hamiltonian', 'we', 'show', 'that', 'the', 'phase', 'diagram', 'includes', 'quantum', 'anomalous', 'hall', 'qah', 'quantum', 'spin', 'hall', 'qsh', 'and', 'spin', 'quantum', 'anomalous', 'hall', 'effect', 'sqah', 'regions', 'such', 'that', 'the', 'topological', 'kirchhoff', 'law', 'is', 'satisfied', 'in', 'the', 'plane', 'by', 'considering', 'the', 'q2', 'diagonal', 'term', 'and', 'including', 'one', 'valley', 'it', 'is', 'shown', 'that', 'mos2', 'has', 'a', 'nontrivial', 'topology', 'and', 'the', 'valley', 'chern', 'number', 'is', 'nonzero', 'for', 'each', 'spin', 'we', 'show', 'that', 'the', 'wave', 'function', 'is', 'is', 'not', 'localized', 'at', 'the', 'edges', 'when', 'the', 'q2', 'diagonal', 'term', 'is', 'added', 'deleted', 'to', 'from', 'the', 'spinvalley', 'dirac', 'mass', 'equation', 'we', 'calculate', 'the', 'quantum', 'conductance', 'of', 'zigzag', 'mos2', 'nanoribbons', 'by', 'using', 'the', 'nonequilibrium', 'green', 'function', 'method', 'and', 'show', 'how', 'this', 'device', 'works', 'as', 'a', 'field', 'effect', 'topological', 'quantum', 'transistor']]
[-0.22980522157546754, 0.2236010181810707, -0.045198409209648766, 0.02558533844926084, -0.05252445218424934, -0.22003640848211944, 0.06194886074401438, 0.36140006250391404, -0.26299363664661846, -0.2258925626675288, -0.038422334683903804, -0.3157367751933634, -0.2511723777403434, 0.17337141609129805, 0.010648478992904225, 0.07224332938591639, -0.02099543606551985, -0.07224800193682313, -0.08115095269711067, -0.21774512881645933, 0.30321929552281895, -0.05687726958810042, 0.28539523218447965, 0.10177271946022907, 0.0783510076192518, 0.021065272465348242, 0.1300972469880556, 0.04739178093150258, -0.15677173334581312, -0.036325235900779566, 0.23699930316147705, -0.14321685805140685, 0.1667713228861491, -0.422650662312905, -0.18819056418413918, 0.003929151849200328, 0.08864249164393792, 0.19872185116012892, -0.05370350835223993, -0.2985927017778158, 0.09381954381630446, -0.21024914057925342, -0.09856290264520794, -0.07281530554095904, 0.009900372417954106, -0.10596554280724377, -0.19851366875537982, 0.08354031152402361, 0.0661195195807765, 0.04487063113600016, -0.01885697306599468, -0.13162461668563386, -0.13417738907194385, 0.07452489519744025, 0.016724620153351376, 0.05869859726187618, 0.17158719133585693, -0.17102294767120232, -0.18168932486946385, 0.3709302401170135, -0.057565955352038144, -0.1810165818532308, 0.06138974769351383, -0.21181008962914347, -0.06897975523335238, 0.09165075728048881, 0.07071916855250795, 0.07501230495230023, -0.10930587778808937, 0.17800112184408742, -0.039296860794129314, 0.12850989136844873, 0.03064458094847699, 0.1097559045565625, 0.253500893873473, 0.12525909499730914, 0.10497755792399403, 0.18625778909772633, -0.11963285569101573, -0.07330446335331847, -0.25992338090514144, -0.22668778037652373, -0.3083407366935474, 0.17269348468747922, -0.08056213466557285, -0.20401177941569282, 0.4599412554316223, 0.12645903756842017, 0.1468599157904585, -0.02856916221479575, 0.2853230806812644, 0.2081272715353407, 0.09620172946403424, 0.023679513192425172, 0.21521072681372364, 0.19584483512987694, 0.10871402683357398, -0.3146748721025263, 0.046020052454744775, 0.08164441296365112]
1,803.03391
Review of Visual Saliency Detection with Comprehensive Information
Visual saliency detection model simulates the human visual system to perceive the scene, and has been widely used in many vision tasks. With the acquisition technology development, more comprehensive information, such as depth cue, inter-image correspondence, or temporal relationship, is available to extend image saliency detection to RGBD saliency detection, co-saliency detection, or video saliency detection. RGBD saliency detection model focuses on extracting the salient regions from RGBD images by combining the depth information. Co-saliency detection model introduces the inter-image correspondence constraint to discover the common salient object in an image group. The goal of video saliency detection model is to locate the motion-related salient object in video sequences, which considers the motion cue and spatiotemporal constraint jointly. In this paper, we review different types of saliency detection algorithms, summarize the important issues of the existing methods, and discuss the existent problems and future works. Moreover, the evaluation datasets and quantitative measurements are briefly introduced, and the experimental analysis and discission are conducted to provide a holistic overview of different saliency detection methods.
cs.CV
visual saliency detection model simulates the human visual system to perceive the scene and has been widely used in many vision tasks with the acquisition technology development more comprehensive information such as depth cue interimage correspondence or temporal relationship is available to extend image saliency detection to rgbd saliency detection cosaliency detection or video saliency detection rgbd saliency detection model focuses on extracting the salient regions from rgbd images by combining the depth information cosaliency detection model introduces the interimage correspondence constraint to discover the common salient object in an image group the goal of video saliency detection model is to locate the motionrelated salient object in video sequences which considers the motion cue and spatiotemporal constraint jointly in this paper we review different types of saliency detection algorithms summarize the important issues of the existing methods and discuss the existent problems and future works moreover the evaluation datasets and quantitative measurements are briefly introduced and the experimental analysis and discission are conducted to provide a holistic overview of different saliency detection methods
[['visual', 'saliency', 'detection', 'model', 'simulates', 'the', 'human', 'visual', 'system', 'to', 'perceive', 'the', 'scene', 'and', 'has', 'been', 'widely', 'used', 'in', 'many', 'vision', 'tasks', 'with', 'the', 'acquisition', 'technology', 'development', 'more', 'comprehensive', 'information', 'such', 'as', 'depth', 'cue', 'interimage', 'correspondence', 'or', 'temporal', 'relationship', 'is', 'available', 'to', 'extend', 'image', 'saliency', 'detection', 'to', 'rgbd', 'saliency', 'detection', 'cosaliency', 'detection', 'or', 'video', 'saliency', 'detection', 'rgbd', 'saliency', 'detection', 'model', 'focuses', 'on', 'extracting', 'the', 'salient', 'regions', 'from', 'rgbd', 'images', 'by', 'combining', 'the', 'depth', 'information', 'cosaliency', 'detection', 'model', 'introduces', 'the', 'interimage', 'correspondence', 'constraint', 'to', 'discover', 'the', 'common', 'salient', 'object', 'in', 'an', 'image', 'group', 'the', 'goal', 'of', 'video', 'saliency', 'detection', 'model', 'is', 'to', 'locate', 'the', 'motionrelated', 'salient', 'object', 'in', 'video', 'sequences', 'which', 'considers', 'the', 'motion', 'cue', 'and', 'spatiotemporal', 'constraint', 'jointly', 'in', 'this', 'paper', 'we', 'review', 'different', 'types', 'of', 'saliency', 'detection', 'algorithms', 'summarize', 'the', 'important', 'issues', 'of', 'the', 'existing', 'methods', 'and', 'discuss', 'the', 'existent', 'problems', 'and', 'future', 'works', 'moreover', 'the', 'evaluation', 'datasets', 'and', 'quantitative', 'measurements', 'are', 'briefly', 'introduced', 'and', 'the', 'experimental', 'analysis', 'and', 'discission', 'are', 'conducted', 'to', 'provide', 'a', 'holistic', 'overview', 'of', 'different', 'saliency', 'detection', 'methods']]
[-0.04618939778938088, -0.056008263349551356, -0.06951544751402337, 0.040020416898864083, -0.10992499232173053, -0.18774977319895528, -0.066682842359093, 0.46517962802114876, -0.23860673831645832, -0.35419148537276185, 0.09270080864743524, -0.32918880728268346, -0.20159907661294457, 0.138475940427418, -0.20264542158314047, 0.12420452495517079, 0.15143789360191412, 0.08984317042784316, -0.049588647403017896, -0.2208450423468305, 0.27567727449295915, 0.047640361322284955, 0.35171003769650017, 0.07386710190181729, 0.14560518058580021, -0.024738347964621214, -0.170374650663837, -0.038439034630522825, -0.10733528887879423, 0.2047472764935201, 0.3835777483750568, 0.27294071230003175, 0.25350090712958645, -0.3954439329113378, -0.26905034523630555, 0.052056717637623116, 0.13065812072403957, 0.10579501609543006, -0.05851730633891515, -0.46514844319371634, 0.05703063597760521, -0.1234844057728688, 0.07954774059214477, -0.09939290968928659, 0.01352715524533482, -0.07187398635717325, -0.2376725208447423, 0.04906929937749018, 0.05185575377694223, 0.11475614226168715, -0.08264361639970069, -0.06426121866219504, 0.05492705232355484, 0.23918695525309547, 0.032578202002400226, 0.06187594870814707, 0.2011891972939592, -0.2780568326327971, -0.1598713441879142, 0.3825082121292389, -0.04830507616929407, -0.19331885421605305, 0.24023609695046447, -0.023438810503521805, -0.18783413106304875, 0.09154747344206932, 0.21445970927625027, 0.15049285673960058, -0.17578090416256684, -0.03901666785329093, -0.035928315109421696, 0.17381066632955228, 0.05300075873234417, 0.011656330911940786, 0.27365433233032044, 0.28348264061889156, 0.03632080379763867, 0.13221328425069534, -0.23876782530934962, -0.04938884261659845, -0.2072100307749108, -0.07609494517524835, -0.13062936032927314, -0.10879621426317689, -0.09095159825961292, -0.11104922934650541, 0.4403111863188272, 0.3556493072997952, 0.2112138245612123, 0.062055868479060444, 0.44621325281670665, -0.006017470850100264, 0.05874612813390423, -0.0020953701527486016, 0.17379163630810285, -0.01416395570633413, 0.12907944652955805, -0.1524785899274257, 0.08163867162562213, 0.13018251174578963]
1,803.03392
Environmentally controlled curvature of single collagen proteins
The predominant structural protein in vertebrates is collagen, which plays a key role in extracellular matrix and connective tissue mechanics. Despite its prevalence and physical importance in biology, the mechanical properties of molecular collagen are far from established. The flexibility of its triple helix is unresolved, with descriptions from different experimental techniques ranging from flexible to semirigid. Furthermore, it is unknown how collagen type (homo- vs. heterotrimeric) and source (tissue-derived vs. recombinant) influence flexibility. Using SmarTrace, a chain tracing algorithm we devised, we performed statistical analysis of collagen conformations collected with atomic force microscopy (AFM) to determine the protein's mechanical properties. Our results show that types I, II and III collagens - the key fibrillar varieties - exhibit molecular flexibilities that are very similar. However, collagen conformations are strongly modulated by salt, transitioning from compact to extended as KCl concentration increases, in both neutral and acidic pH. While analysis with a standard worm-like chain model suggests that the persistence length of collagen can attain almost any value within the literature range, closer inspection reveals that this modulation of collagen's conformational behavior is not due to changes in flexibility, but rather arises from the induction of curvature (either intrinsic or induced by interactions with the mica surface). By modifying standard polymer theory to include innate curvature, we show that collagen behaves as an equilibrated curved worm-like chain (cWLC) in two dimensions. Analysis within the cWLC model shows that collagen's curvature depends strongly on pH and salt, while its persistence length does not. Thus, we find that triple-helical collagen is well described as semiflexible, irrespective of source, type, pH and salt environment.
physics.bio-ph q-bio.BM
the predominant structural protein in vertebrates is collagen which plays a key role in extracellular matrix and connective tissue mechanics despite its prevalence and physical importance in biology the mechanical properties of molecular collagen are far from established the flexibility of its triple helix is unresolved with descriptions from different experimental techniques ranging from flexible to semirigid furthermore it is unknown how collagen type homo vs heterotrimeric and source tissuederived vs recombinant influence flexibility using smartrace a chain tracing algorithm we devised we performed statistical analysis of collagen conformations collected with atomic force microscopy afm to determine the proteins mechanical properties our results show that types i ii and iii collagens the key fibrillar varieties exhibit molecular flexibilities that are very similar however collagen conformations are strongly modulated by salt transitioning from compact to extended as kcl concentration increases in both neutral and acidic ph while analysis with a standard wormlike chain model suggests that the persistence length of collagen can attain almost any value within the literature range closer inspection reveals that this modulation of collagens conformational behavior is not due to changes in flexibility but rather arises from the induction of curvature either intrinsic or induced by interactions with the mica surface by modifying standard polymer theory to include innate curvature we show that collagen behaves as an equilibrated curved wormlike chain cwlc in two dimensions analysis within the cwlc model shows that collagens curvature depends strongly on ph and salt while its persistence length does not thus we find that triplehelical collagen is well described as semiflexible irrespective of source type ph and salt environment
[['the', 'predominant', 'structural', 'protein', 'in', 'vertebrates', 'is', 'collagen', 'which', 'plays', 'a', 'key', 'role', 'in', 'extracellular', 'matrix', 'and', 'connective', 'tissue', 'mechanics', 'despite', 'its', 'prevalence', 'and', 'physical', 'importance', 'in', 'biology', 'the', 'mechanical', 'properties', 'of', 'molecular', 'collagen', 'are', 'far', 'from', 'established', 'the', 'flexibility', 'of', 'its', 'triple', 'helix', 'is', 'unresolved', 'with', 'descriptions', 'from', 'different', 'experimental', 'techniques', 'ranging', 'from', 'flexible', 'to', 'semirigid', 'furthermore', 'it', 'is', 'unknown', 'how', 'collagen', 'type', 'homo', 'vs', 'heterotrimeric', 'and', 'source', 'tissuederived', 'vs', 'recombinant', 'influence', 'flexibility', 'using', 'smartrace', 'a', 'chain', 'tracing', 'algorithm', 'we', 'devised', 'we', 'performed', 'statistical', 'analysis', 'of', 'collagen', 'conformations', 'collected', 'with', 'atomic', 'force', 'microscopy', 'afm', 'to', 'determine', 'the', 'proteins', 'mechanical', 'properties', 'our', 'results', 'show', 'that', 'types', 'i', 'ii', 'and', 'iii', 'collagens', 'the', 'key', 'fibrillar', 'varieties', 'exhibit', 'molecular', 'flexibilities', 'that', 'are', 'very', 'similar', 'however', 'collagen', 'conformations', 'are', 'strongly', 'modulated', 'by', 'salt', 'transitioning', 'from', 'compact', 'to', 'extended', 'as', 'kcl', 'concentration', 'increases', 'in', 'both', 'neutral', 'and', 'acidic', 'ph', 'while', 'analysis', 'with', 'a', 'standard', 'wormlike', 'chain', 'model', 'suggests', 'that', 'the', 'persistence', 'length', 'of', 'collagen', 'can', 'attain', 'almost', 'any', 'value', 'within', 'the', 'literature', 'range', 'closer', 'inspection', 'reveals', 'that', 'this', 'modulation', 'of', 'collagens', 'conformational', 'behavior', 'is', 'not', 'due', 'to', 'changes', 'in', 'flexibility', 'but', 'rather', 'arises', 'from', 'the', 'induction', 'of', 'curvature', 'either', 'intrinsic', 'or', 'induced', 'by', 'interactions', 'with', 'the', 'mica', 'surface', 'by', 'modifying', 'standard', 'polymer', 'theory', 'to', 'include', 'innate', 'curvature', 'we', 'show', 'that', 'collagen', 'behaves', 'as', 'an', 'equilibrated', 'curved', 'wormlike', 'chain', 'cwlc', 'in', 'two', 'dimensions', 'analysis', 'within', 'the', 'cwlc', 'model', 'shows', 'that', 'collagens', 'curvature', 'depends', 'strongly', 'on', 'ph', 'and', 'salt', 'while', 'its', 'persistence', 'length', 'does', 'not', 'thus', 'we', 'find', 'that', 'triplehelical', 'collagen', 'is', 'well', 'described', 'as', 'semiflexible', 'irrespective', 'of', 'source', 'type', 'ph', 'and', 'salt', 'environment']]
[-0.0853508071297393, 0.1460686038068676, -0.04257222610582896, 0.02316871107564712, -0.02654283687402055, -0.19697154037267814, 0.0012292142652133304, 0.4327170582470607, -0.27925319110377217, -0.2562154894448676, 0.04645215191105205, -0.2390552034460992, -0.21258150457430913, 0.15448824292848343, -0.046564521717856515, -0.03699442829545763, 0.047616362403902525, -0.01007710906395794, -0.0024406306981548387, -0.15033906798981095, 0.23518325185385655, 0.07192376638007052, 0.29610568166552287, 0.07362412643039001, 0.08888195920636754, 0.007439043648751839, 0.03490355936810374, 0.04538028693858442, -0.1696464407486997, 0.14813955940620838, 0.24369607610575292, 0.06687752712025957, 0.20338767657126738, -0.4324721786826146, -0.24011359184734382, 0.08729634621918624, 0.15756776380124238, 0.11287670521425822, -0.012220497370064962, -0.23613191920525903, 0.08959347127567766, -0.11370521373343917, -0.14052791377586613, -0.061882728465639476, 0.01887674067907457, 0.08878889783232842, -0.1766596557273758, 0.14908555388661487, 0.045535022605931, 0.13580203917325598, -0.09861340089130022, -0.1237323174947205, -0.09234572489798631, 0.11813426313060775, 0.0727228615186968, 0.009855339979260878, 0.28157663593631027, -0.12614516564820594, -0.05544296411340529, 0.3849659894540344, -0.03694392501833445, -0.16354021314390987, 0.23437399203484913, -0.08876300105157325, -0.12757854605991972, 0.17611297755765745, 0.07025950302299604, 0.05385647258317133, -0.15896094272370045, 0.05164501272553231, 0.021657354009495873, 0.2507805132447689, 0.07695359708389865, 0.0007772836708990892, 0.19329830667285144, 0.1869502742669352, -0.015908390241411496, 0.14007344369003374, -0.07611728884227012, -0.12355657015083674, -0.2099620674473216, -0.16537956684094168, -0.15136921116994378, 0.0784686191825697, -0.10326399004382283, -0.193922970865695, 0.3411645468491358, 0.07248219823353759, 0.17463078976846036, 0.053466504707576634, 0.21251205069338025, -0.028198465490537995, 0.07505465828421534, -0.007206428948051805, 0.22210792566711118, 0.12164916186242031, 0.10313432580299395, -0.2547980389439167, 0.15154250916093587, 0.025171304403646094]
1,803.03393
New results on $k$-independence of hypergraphs
Let $H=(V,E)$ be an $s$-uniform hypergraph of order $n$ and $k\geq 0$ be an integer. A $k$-independent set $S\subseteq H$ is a set of vertices such that the maximum degree in the hypergraph induced by $S$ is at most $k$. Denoted by $\alpha_k(H)$ the maximum cardinality of the $k$-independent set of $H$. In this paper, we first give a lower bound of $\alpha_k(H)$ by the maximum degree of $H$. Furthermore, we prove that $\alpha_k(H)\geq \frac{s(k+1)n}{2d+s(k+1)}$ where $d$ is average degree of $H$, and $k\geq 0$ is an integer.
math.CO
let hve be an suniform hypergraph of order n and kgeq 0 be an integer a kindependent set ssubseteq h is a set of vertices such that the maximum degree in the hypergraph induced by s is at most k denoted by alpha_kh the maximum cardinality of the kindependent set of h in this paper we first give a lower bound of alpha_kh by the maximum degree of h furthermore we prove that alpha_khgeq fracsk1n2dsk1 where d is average degree of h and kgeq 0 is an integer
[['let', 'hve', 'be', 'an', 'suniform', 'hypergraph', 'of', 'order', 'n', 'and', 'kgeq', '0', 'be', 'an', 'integer', 'a', 'kindependent', 'set', 'ssubseteq', 'h', 'is', 'a', 'set', 'of', 'vertices', 'such', 'that', 'the', 'maximum', 'degree', 'in', 'the', 'hypergraph', 'induced', 'by', 's', 'is', 'at', 'most', 'k', 'denoted', 'by', 'alpha_kh', 'the', 'maximum', 'cardinality', 'of', 'the', 'kindependent', 'set', 'of', 'h', 'in', 'this', 'paper', 'we', 'first', 'give', 'a', 'lower', 'bound', 'of', 'alpha_kh', 'by', 'the', 'maximum', 'degree', 'of', 'h', 'furthermore', 'we', 'prove', 'that', 'alpha_khgeq', 'fracsk1n2dsk1', 'where', 'd', 'is', 'average', 'degree', 'of', 'h', 'and', 'kgeq', '0', 'is', 'an', 'integer']]
[-0.21406051991063924, 0.19253674345669597, -1.1600071697362832e-05, -0.060409119559196936, -0.0520184182373452, -0.1565500297417332, 0.046422736620852015, 0.32465981154902174, -0.3032588201888194, -0.3213128817844249, 0.03160725660633207, -0.3286845103970596, -0.10351158452630486, 0.08672127677016847, -0.03589926311369276, -0.009778356039619428, 0.02818215476526391, 0.16369604439075505, 0.0417578508578507, -0.29746820318645667, 0.2955072650774604, -0.047979530678795915, 0.11043836358225062, 0.10308744552146111, 0.06879860494241473, 0.003708273089224739, 0.07868972824819918, 0.10187509004858189, -0.23981426274379677, 0.08781303367799237, 0.2590395046974577, 0.22124205142470255, 0.3117186381437239, -0.3165890852521573, -0.12748750792040178, 0.2434362705930003, 0.11467227349307255, -0.006169850549971064, 0.04932969385880001, -0.17854145907663874, 0.2302310200785065, -0.11049492396826584, -0.10513273087174942, 0.03535826078483036, 0.17691122919010618, -0.01720196618476794, -0.389807651662046, -0.014414156942317883, 0.1332189603930428, 0.09926493779667431, 0.08976158557093836, -0.22916376526423154, -0.08492160693553853, 0.012986044759773427, -0.11245538624713108, 0.1395588702511131, -0.04361519513518682, -0.10552674136956089, -0.14279726949254318, 0.33455656797048594, -0.1117853572151424, -0.15195431506505147, 0.04258552042301744, -0.13987554336476715, -0.12639920018790735, 0.13077451559227138, 0.14347748329774254, 0.22980325394088313, -0.07128502420770626, 0.1922324362108373, -0.14405655626961517, 0.16831544159712003, 0.10755299759607408, 0.02209768236969553, 0.10564402946537095, 0.10432240387447, 0.2069084900874822, 0.1836852968775756, -0.04863863367409933, 0.1226500606474777, -0.37674850544759203, -0.1519954558884603, -0.2974991429641488, 0.1269755499781154, -0.19357309788652596, -0.1075262375885532, 0.3613101084760967, 0.09265183713952345, 0.22752556218100445, 0.08374990844389513, 0.18593562123853535, 0.15817457586828304, -0.039738240773745236, 0.18417638493701816, 0.07788714132316056, 0.16491524636512622, -0.13549741144691194, -0.20413480925240687, 0.0689129161127355, 0.14167497058709463]
1,803.03394
A study of strategy to the remove and ease TBT for increasing export in GCC6 countries
The last technical barriers to trade(TBT) between countries are Non-Tariff Barriers(NTBs), meaning all trade barriers are possible other than Tariff Barriers. And the most typical examples are (TBT), which refer to measure Technical Regulation, Standards, Procedure for Conformity Assessment, Test & Certification etc. Therefore, in order to eliminate TBT, WTO has made all membership countries automatically enter into an agreement on TBT
econ.EM
the last technical barriers to tradetbt between countries are nontariff barriersntbs meaning all trade barriers are possible other than tariff barriers and the most typical examples are tbt which refer to measure technical regulation standards procedure for conformity assessment test certification etc therefore in order to eliminate tbt wto has made all membership countries automatically enter into an agreement on tbt
[['the', 'last', 'technical', 'barriers', 'to', 'tradetbt', 'between', 'countries', 'are', 'nontariff', 'barriersntbs', 'meaning', 'all', 'trade', 'barriers', 'are', 'possible', 'other', 'than', 'tariff', 'barriers', 'and', 'the', 'most', 'typical', 'examples', 'are', 'tbt', 'which', 'refer', 'to', 'measure', 'technical', 'regulation', 'standards', 'procedure', 'for', 'conformity', 'assessment', 'test', 'certification', 'etc', 'therefore', 'in', 'order', 'to', 'eliminate', 'tbt', 'wto', 'has', 'made', 'all', 'membership', 'countries', 'automatically', 'enter', 'into', 'an', 'agreement', 'on', 'tbt']]
[-0.072080265200729, 0.06872775053413753, -0.03427436600985198, 0.13395430716075774, -0.09533757005079553, -0.17727225803738011, 0.10334854490316377, 0.42090586357717885, -0.2277837657341573, -0.33565539735016126, 0.11854279265891568, -0.34306117088598165, -0.06329070497304201, 0.2274656704594863, -0.13244002578169878, 0.017389435074211836, 0.04257201332727383, -0.018747945685453456, 0.028898463358677087, -0.26653406407748315, 0.2764417659009582, 0.0533027979866441, 0.3220977173026266, 0.054662293457458246, 0.031176488461165594, -0.07296660194044997, -0.07242897448354754, -0.036571585145730785, -0.1192664597384182, 0.0987870132486368, 0.3271467447409342, 0.14013749137039072, 0.32922016353956585, -0.42571501164086933, -0.11387692550839536, 0.10099500122255292, 0.11418664469062512, 0.06667458117289211, 0.018483033441890288, -0.2499868050538774, 0.09531863495217764, -0.2175303565274025, -0.0762496983616388, -0.11889813157954607, 0.037652920289286254, 0.023130883751758213, -0.2216957553193487, 0.014861055135983845, -0.04272467093863364, 0.09319731666594101, -0.03956959067426365, -0.18061653420264864, -0.039621885930155885, 0.24702424184290755, 0.08039392095765677, -0.019800810087151056, 0.17862437588387522, -0.07872602998696525, -0.12152030972506979, 0.367798192298104, 0.07365197531857873, -0.17170528967961154, 0.19445954467137827, -0.08698648464833868, -0.1480326369356621, 0.05961845823210375, 0.17180769066808038, -0.01089839585946375, -0.22180490659806748, 0.007008534132559174, 0.0675126807282454, 0.15088313598193806, 0.17058745904119108, -0.007660941446750979, 0.15410890040019976, 0.14042590754427786, 0.10508167811123462, 0.06127711315739675, -0.013596673636568775, -0.13078926274139466, -0.3128383333056137, -0.1458230672468399, -0.06423588741795513, -0.024214690406646193, -0.03930071978965284, -0.18485057199823446, 0.32396548861188107, 0.16525158918751726, 0.11249475939006641, 0.031786977492096226, 0.29615805866517897, 0.029725039618667858, 0.12053195197448327, 0.050849726309213014, 0.22865903949172334, 0.04772912138462838, 0.09710070872197635, -0.11165716242173622, 0.18985178239707803, -0.016501329373568296]
1,803.03395
Maximum Sum Rate of Slotted Aloha with Successive Interference Cancellation
This is a sequel of our previous work [8] on characterization of maximum sum rate of slotted Aloha networks. By extending the analysis to incorporate the capacity-achieving receiver structure, Successive Interference Cancellation (SIC), this paper aims to identify the rate loss due to random access. Specifically, two representative SIC receivers are considered, i.e, ordered SIC where packets are decoded in a descending order of their received power, and unordered SIC where packets are decoded in a random order. The maximum sum rate and the corresponding optimal parameter setting including the transmission probability and the information encoding rate in both cases are obtained as functions of the mean received signal-to-noise ratio (SNR). The comparison to the capture model shows that the gains are significant only with the ordered SIC at moderate values of the mean received SNR $\rho$. With a large $\rho$, the rate gap diminishes, and they all have the same high-SNR slope of $e^{-1}$, which is far below that of the ergodic sum capacity of fading channels. The effect of multipacket reception (MPR) on the sum rate performance is also studied by comparing the MPR receivers including SIC and the capture model to the classical collision model.
cs.IT math.IT
this is a sequel of our previous work 8 on characterization of maximum sum rate of slotted aloha networks by extending the analysis to incorporate the capacityachieving receiver structure successive interference cancellation sic this paper aims to identify the rate loss due to random access specifically two representative sic receivers are considered ie ordered sic where packets are decoded in a descending order of their received power and unordered sic where packets are decoded in a random order the maximum sum rate and the corresponding optimal parameter setting including the transmission probability and the information encoding rate in both cases are obtained as functions of the mean received signaltonoise ratio snr the comparison to the capture model shows that the gains are significant only with the ordered sic at moderate values of the mean received snr rho with a large rho the rate gap diminishes and they all have the same highsnr slope of e1 which is far below that of the ergodic sum capacity of fading channels the effect of multipacket reception mpr on the sum rate performance is also studied by comparing the mpr receivers including sic and the capture model to the classical collision model
[['this', 'is', 'a', 'sequel', 'of', 'our', 'previous', 'work', '8', 'on', 'characterization', 'of', 'maximum', 'sum', 'rate', 'of', 'slotted', 'aloha', 'networks', 'by', 'extending', 'the', 'analysis', 'to', 'incorporate', 'the', 'capacityachieving', 'receiver', 'structure', 'successive', 'interference', 'cancellation', 'sic', 'this', 'paper', 'aims', 'to', 'identify', 'the', 'rate', 'loss', 'due', 'to', 'random', 'access', 'specifically', 'two', 'representative', 'sic', 'receivers', 'are', 'considered', 'ie', 'ordered', 'sic', 'where', 'packets', 'are', 'decoded', 'in', 'a', 'descending', 'order', 'of', 'their', 'received', 'power', 'and', 'unordered', 'sic', 'where', 'packets', 'are', 'decoded', 'in', 'a', 'random', 'order', 'the', 'maximum', 'sum', 'rate', 'and', 'the', 'corresponding', 'optimal', 'parameter', 'setting', 'including', 'the', 'transmission', 'probability', 'and', 'the', 'information', 'encoding', 'rate', 'in', 'both', 'cases', 'are', 'obtained', 'as', 'functions', 'of', 'the', 'mean', 'received', 'signaltonoise', 'ratio', 'snr', 'the', 'comparison', 'to', 'the', 'capture', 'model', 'shows', 'that', 'the', 'gains', 'are', 'significant', 'only', 'with', 'the', 'ordered', 'sic', 'at', 'moderate', 'values', 'of', 'the', 'mean', 'received', 'snr', 'rho', 'with', 'a', 'large', 'rho', 'the', 'rate', 'gap', 'diminishes', 'and', 'they', 'all', 'have', 'the', 'same', 'highsnr', 'slope', 'of', 'e1', 'which', 'is', 'far', 'below', 'that', 'of', 'the', 'ergodic', 'sum', 'capacity', 'of', 'fading', 'channels', 'the', 'effect', 'of', 'multipacket', 'reception', 'mpr', 'on', 'the', 'sum', 'rate', 'performance', 'is', 'also', 'studied', 'by', 'comparing', 'the', 'mpr', 'receivers', 'including', 'sic', 'and', 'the', 'capture', 'model', 'to', 'the', 'classical', 'collision', 'model']]
[-0.21014546504187764, 0.05768695679925984, -0.020328460684554142, 0.017678831885639353, -0.011117801662873138, -0.18175944553763426, 0.12484627582939492, 0.3843285187777847, -0.26340491249404774, -0.2538446945319366, 0.08096444161698184, -0.28265062358813603, -0.13810674855579633, 0.10176348238666025, -0.06874312109001113, 0.036973224667731716, 0.027034650290986957, 0.09042775395533277, -0.08201775395351396, -0.2950043221735725, 0.2581347463125683, 0.1525577005149439, 0.34589078379889027, 0.03842412043866147, 0.06436014315613188, 0.009622037358114007, -0.03149865677044021, -0.03024090042230216, -0.11091325309098465, 0.05497597806353235, 0.2616680146258494, 0.13358891697252415, 0.22514504850065956, -0.36229261017764325, -0.2707524928922831, 0.09033713851481526, 0.15722735977915087, 0.06689057247936632, -0.008648612570591421, -0.23117779879454486, 0.15661815917084107, -0.20010083539862977, 0.006808929512220801, 0.0517459358076913, -0.0629556510912612, 0.07011023338771227, -0.3404205956233482, 0.06025376131848051, 0.046427069826879434, 0.01953622277689665, -0.040645651395239804, -0.19554250096112039, -0.0049985490722882775, 0.1620534654563255, 0.06389391597659054, -0.0006721084590559129, 0.0786267086096823, -0.08548101089010486, -0.08749604142198075, 0.3598198718297286, -0.03029509640364635, -0.16559473745497838, 0.15485763518290238, -0.1750553483355113, -0.03210087315969621, 0.2281137987620884, 0.2163453601386558, 0.10500883109481873, -0.14145359630264917, 0.035445587918711496, -0.021852270344911953, 0.14669069094404655, 0.13874954546594787, 0.14987076170074592, 0.1440334158251062, 0.11514980687684558, 0.07331047218229453, 0.15497463735083888, -0.14531753975792194, -0.12088211593785525, -0.2608037164171386, -0.10525679008240313, -0.2193464899748432, 0.035191341807167376, -0.11585007801690465, -0.09548586217517202, 0.35035988441997706, 0.09878149280892544, 0.19720050998060315, 0.1279137304477215, 0.3627883913089531, 0.1295807752405491, 0.050208974216895345, 0.09628312123911173, 0.23816139840596176, 0.1698116403840686, 0.07085050078261923, -0.2054848923674794, 0.11321907803519732, 0.0055188614983262135]
1,803.03396
Cross-View Image Synthesis using Conditional GANs
Learning to generate natural scenes has always been a challenging task in computer vision. It is even more painstaking when the generation is conditioned on images with drastically different views. This is mainly because understanding, corresponding, and transforming appearance and semantic information across the views is not trivial. In this paper, we attempt to solve the novel problem of cross-view image synthesis, aerial to street-view and vice versa, using conditional generative adversarial networks (cGAN). Two new architectures called Crossview Fork (X-Fork) and Crossview Sequential (X-Seq) are proposed to generate scenes with resolutions of 64x64 and 256x256 pixels. X-Fork architecture has a single discriminator and a single generator. The generator hallucinates both the image and its semantic segmentation in the target view. X-Seq architecture utilizes two cGANs. The first one generates the target image which is subsequently fed to the second cGAN for generating its corresponding semantic segmentation map. The feedback from the second cGAN helps the first cGAN generate sharper images. Both of our proposed architectures learn to generate natural images as well as their semantic segmentation maps. The proposed methods show that they are able to capture and maintain the true semantics of objects in source and target views better than the traditional image-to-image translation method which considers only the visual appearance of the scene. Extensive qualitative and quantitative evaluations support the effectiveness of our frameworks, compared to two state of the art methods, for natural scene generation across drastically different views.
cs.CV
learning to generate natural scenes has always been a challenging task in computer vision it is even more painstaking when the generation is conditioned on images with drastically different views this is mainly because understanding corresponding and transforming appearance and semantic information across the views is not trivial in this paper we attempt to solve the novel problem of crossview image synthesis aerial to streetview and vice versa using conditional generative adversarial networks cgan two new architectures called crossview fork xfork and crossview sequential xseq are proposed to generate scenes with resolutions of 64x64 and 256x256 pixels xfork architecture has a single discriminator and a single generator the generator hallucinates both the image and its semantic segmentation in the target view xseq architecture utilizes two cgans the first one generates the target image which is subsequently fed to the second cgan for generating its corresponding semantic segmentation map the feedback from the second cgan helps the first cgan generate sharper images both of our proposed architectures learn to generate natural images as well as their semantic segmentation maps the proposed methods show that they are able to capture and maintain the true semantics of objects in source and target views better than the traditional imagetoimage translation method which considers only the visual appearance of the scene extensive qualitative and quantitative evaluations support the effectiveness of our frameworks compared to two state of the art methods for natural scene generation across drastically different views
[['learning', 'to', 'generate', 'natural', 'scenes', 'has', 'always', 'been', 'a', 'challenging', 'task', 'in', 'computer', 'vision', 'it', 'is', 'even', 'more', 'painstaking', 'when', 'the', 'generation', 'is', 'conditioned', 'on', 'images', 'with', 'drastically', 'different', 'views', 'this', 'is', 'mainly', 'because', 'understanding', 'corresponding', 'and', 'transforming', 'appearance', 'and', 'semantic', 'information', 'across', 'the', 'views', 'is', 'not', 'trivial', 'in', 'this', 'paper', 'we', 'attempt', 'to', 'solve', 'the', 'novel', 'problem', 'of', 'crossview', 'image', 'synthesis', 'aerial', 'to', 'streetview', 'and', 'vice', 'versa', 'using', 'conditional', 'generative', 'adversarial', 'networks', 'cgan', 'two', 'new', 'architectures', 'called', 'crossview', 'fork', 'xfork', 'and', 'crossview', 'sequential', 'xseq', 'are', 'proposed', 'to', 'generate', 'scenes', 'with', 'resolutions', 'of', '64x64', 'and', '256x256', 'pixels', 'xfork', 'architecture', 'has', 'a', 'single', 'discriminator', 'and', 'a', 'single', 'generator', 'the', 'generator', 'hallucinates', 'both', 'the', 'image', 'and', 'its', 'semantic', 'segmentation', 'in', 'the', 'target', 'view', 'xseq', 'architecture', 'utilizes', 'two', 'cgans', 'the', 'first', 'one', 'generates', 'the', 'target', 'image', 'which', 'is', 'subsequently', 'fed', 'to', 'the', 'second', 'cgan', 'for', 'generating', 'its', 'corresponding', 'semantic', 'segmentation', 'map', 'the', 'feedback', 'from', 'the', 'second', 'cgan', 'helps', 'the', 'first', 'cgan', 'generate', 'sharper', 'images', 'both', 'of', 'our', 'proposed', 'architectures', 'learn', 'to', 'generate', 'natural', 'images', 'as', 'well', 'as', 'their', 'semantic', 'segmentation', 'maps', 'the', 'proposed', 'methods', 'show', 'that', 'they', 'are', 'able', 'to', 'capture', 'and', 'maintain', 'the', 'true', 'semantics', 'of', 'objects', 'in', 'source', 'and', 'target', 'views', 'better', 'than', 'the', 'traditional', 'imagetoimage', 'translation', 'method', 'which', 'considers', 'only', 'the', 'visual', 'appearance', 'of', 'the', 'scene', 'extensive', 'qualitative', 'and', 'quantitative', 'evaluations', 'support', 'the', 'effectiveness', 'of', 'our', 'frameworks', 'compared', 'to', 'two', 'state', 'of', 'the', 'art', 'methods', 'for', 'natural', 'scene', 'generation', 'across', 'drastically', 'different', 'views']]
[-0.0074933370527573645, -0.011185560769997693, -0.060839681602438876, 0.08589429173094443, -0.13034719230692882, -0.1560906535969213, -0.025636310788761888, 0.46707342020294407, -0.282975963729913, -0.3660558791963625, 0.046158152340159256, -0.2695214647515268, -0.1798877983264407, 0.1725511714985602, -0.18618465688714766, 0.07098291314812961, 0.12160144548105255, 0.06773695340389814, -0.06757400889888748, -0.26162703443955726, 0.30790804588504517, 0.01640086549151081, 0.3792189899929429, -0.013873233407283803, 0.1813129563056026, -0.04436631586059741, -0.04090378606091857, -0.028076449982253504, -0.010276255918386398, 0.19348950557377595, 0.3078325410250761, 0.22847750387264115, 0.27506044629384535, -0.426962759883521, -0.21045147103966685, 0.07873320063014971, 0.1108837880563891, 0.10217020391860673, -0.04462612775052366, -0.38957815710844856, 0.11261353339360848, -0.12334843132270804, 0.07830463655226744, -0.13095535078986106, -0.028599476052553367, -0.0484794179679495, -0.2824515726974538, -0.008221011113952143, 0.11816432393617757, 0.038934587409415876, -0.06769032898226511, -0.07138402533725247, -0.03390944441955802, 0.22278920507263567, 0.013230967790348198, 0.08617257577645744, 0.12743918982063612, -0.23302505465485468, -0.1364501255046124, 0.3879567286492594, -0.0184541521038033, -0.23374534423256518, 0.22564979574631386, -0.05882777711064808, -0.11550614184058938, 0.11844558743701539, 0.19250254110271448, 0.1418714040420778, -0.14791337612980565, -0.02384045901274792, -0.06454888894149613, 0.19003862677586253, 0.07918746684138199, -0.014457390185788462, 0.21032562413716602, 0.24061997604963592, 0.0399763728007304, 0.1725115613747879, -0.1850750419266413, -0.07193451685461734, -0.1969092410509806, -0.1080382638942123, -0.18646802222862777, -0.0689769361233782, -0.07586358054226876, -0.15190705989087322, 0.4372990287988443, 0.26231327437928187, 0.23481035540192136, 0.08800967037166317, 0.40007723406518353, 0.013925562874768631, 0.12181960035209977, 0.04399135744926874, 0.15597139411142183, 0.017233823475751357, 0.14910791964546843, -0.1464988293526129, 0.09151617359958401, 0.07973246207077418]
1,803.03397
Effect of Vacancies on the Mechanical Properties of Phosphorene Nanotubes
Using density functional tight-binding method, we studied the mechanical properties, deformation and failure of armchair (AC) and zigzag (ZZ) phosphorene nanotubes (PNTs) with monovacancies and divacancies subjected to uniaxial tensile strain.
cond-mat.mtrl-sci
using density functional tightbinding method we studied the mechanical properties deformation and failure of armchair ac and zigzag zz phosphorene nanotubes pnts with monovacancies and divacancies subjected to uniaxial tensile strain
[['using', 'density', 'functional', 'tightbinding', 'method', 'we', 'studied', 'the', 'mechanical', 'properties', 'deformation', 'and', 'failure', 'of', 'armchair', 'ac', 'and', 'zigzag', 'zz', 'phosphorene', 'nanotubes', 'pnts', 'with', 'monovacancies', 'and', 'divacancies', 'subjected', 'to', 'uniaxial', 'tensile', 'strain']]
[-0.1921793522854005, 0.1337187001444099, 0.0045351560918554185, -0.12224392923376252, 0.024406339937535625, -0.24433895023239235, 0.07939147453514799, 0.6229784618462285, -0.30033126710763863, -0.19273040337007372, -0.07719252963039663, -0.26470191884906064, -0.22655629770710103, 0.08371534894010232, 0.07849571391219093, 0.16295653752862446, 0.09509186368555791, -0.15116605342876527, -0.09665470813671427, -0.2371088357101525, 0.08033772461837338, 0.030888461177387545, 0.44002943882538426, 0.07124550248526278, -0.11097792896532244, 0.13403529885615553, 0.2409614702356198, 0.13318136755016544, -0.32525220947460304, 0.09138067931898179, 0.18405950918883807, -0.30342302273117727, 0.14889121342510467, -0.570037507241772, -0.15016091533846432, -0.09711647983039579, 0.0563306269506293, 0.18615637803750654, 0.011503758509793589, -0.2995166044922606, 0.1643750364141118, -0.1778617356453211, -0.08961973033635126, -0.11240053149841485, -0.023246157373632153, 0.04003186010184788, -0.19804908227055304, 0.2348201870918274, -0.008578717287990355, 0.14887053828926816, -0.2033737344186633, -0.15951589002243935, -0.2533838599920273, -0.07680053966900995, 0.15568002912726614, -0.02120181131026437, 0.42516930919561174, -0.07029434233423203, -0.08893549436282727, 0.44592851947151846, -0.025903333384062973, -0.10939682871403714, 0.14079077974442514, -0.07523714690919846, -0.12034639277525487, 0.1404165081048925, 0.06670060831933253, 0.033697646516825885, -0.20522765809249494, 0.057805639911337844, 0.15187638632637718, 0.04667280776606452, 0.1892000211763286, 0.007068864415369688, 0.20135664933871839, 0.19537485393905832, 0.029079636603954337, 0.211659861728549, -0.15128779904015602, 0.13960493642896896, -0.16007733591381582, -0.18903859425336123, -0.20281563180258438, 0.1519164577907612, -0.10787108541145214, -0.31019876714074807, 0.4197264820217125, 0.06392494513983688, 0.03525538244585116, -0.043249844933950135, 0.14413502618610377, 0.06331255910317263, 0.06123379919858229, -0.022757615233140606, 0.24136181512186605, 0.35342444305218035, 0.016679712631289038, -0.2914307689474475, 0.026470607191684745, -0.04732110442954206]
1,803.03398
On the Validity of the Assumption of Local Equilibrium in Non-Equilibrium Thermodynamics
The extension of equilibrium thermodynamics to non-equilibrium systems is based on the assumption of "local equilibrium," followed by the assumption that an entropy-density function may be defined, and that this entropy-density would have the same functional dependence on the local densities, (u,v,n), as the total entropy S on the variables (U,V,N). In this article we question the validity of all the assumptions made in the theory of non-equilibrium thermodynamics. We find that the assumption of "local equilibrium" is ill-founded, that it is not clear how to define an entropy-density function, and it is far from clear that such a function, if it exists at all could be integrated to obtain the so-called "entropy production" of the entire system. These findings shed serious doubt on the validity of applying thermodynamic theory to systems far from equilibrium systems.
physics.chem-ph cond-mat.stat-mech
the extension of equilibrium thermodynamics to nonequilibrium systems is based on the assumption of local equilibrium followed by the assumption that an entropydensity function may be defined and that this entropydensity would have the same functional dependence on the local densities uvn as the total entropy s on the variables uvn in this article we question the validity of all the assumptions made in the theory of nonequilibrium thermodynamics we find that the assumption of local equilibrium is illfounded that it is not clear how to define an entropydensity function and it is far from clear that such a function if it exists at all could be integrated to obtain the socalled entropy production of the entire system these findings shed serious doubt on the validity of applying thermodynamic theory to systems far from equilibrium systems
[['the', 'extension', 'of', 'equilibrium', 'thermodynamics', 'to', 'nonequilibrium', 'systems', 'is', 'based', 'on', 'the', 'assumption', 'of', 'local', 'equilibrium', 'followed', 'by', 'the', 'assumption', 'that', 'an', 'entropydensity', 'function', 'may', 'be', 'defined', 'and', 'that', 'this', 'entropydensity', 'would', 'have', 'the', 'same', 'functional', 'dependence', 'on', 'the', 'local', 'densities', 'uvn', 'as', 'the', 'total', 'entropy', 's', 'on', 'the', 'variables', 'uvn', 'in', 'this', 'article', 'we', 'question', 'the', 'validity', 'of', 'all', 'the', 'assumptions', 'made', 'in', 'the', 'theory', 'of', 'nonequilibrium', 'thermodynamics', 'we', 'find', 'that', 'the', 'assumption', 'of', 'local', 'equilibrium', 'is', 'illfounded', 'that', 'it', 'is', 'not', 'clear', 'how', 'to', 'define', 'an', 'entropydensity', 'function', 'and', 'it', 'is', 'far', 'from', 'clear', 'that', 'such', 'a', 'function', 'if', 'it', 'exists', 'at', 'all', 'could', 'be', 'integrated', 'to', 'obtain', 'the', 'socalled', 'entropy', 'production', 'of', 'the', 'entire', 'system', 'these', 'findings', 'shed', 'serious', 'doubt', 'on', 'the', 'validity', 'of', 'applying', 'thermodynamic', 'theory', 'to', 'systems', 'far', 'from', 'equilibrium', 'systems']]
[-0.09614537387867184, 0.0886660187099872, -0.17869596925961292, 0.08676389727556585, -0.026337371091358364, -0.07611650627394043, 0.07747685843359624, 0.30570688719094236, -0.2813788579450749, -0.27042979385484667, 0.09308405766462195, -0.2865545921274187, -0.13294495873303866, 0.16563217215555007, -0.03191015264190569, 0.037289708335746956, 0.0011485038926099043, 0.040384374703588785, -0.06811623524374548, -0.2378097372232279, 0.3452270939768128, 0.05242552144901471, 0.2767973790451994, 0.12317313579157652, 0.07922945140778799, -0.0006540893621550983, 0.034877592306121884, 0.06232000874040429, -0.1530382705725381, 0.06335227028466761, 0.1914601326125729, 0.17017766094410464, 0.2691025557955179, -0.4176718960721594, -0.22700904970577754, 0.1320115989587708, 0.09765944820623297, 0.08131086089141558, -0.00478959214181968, -0.2074556908748277, 0.10570102802012116, -0.1471456185407827, -0.15500279206710676, -0.07538468925528885, 0.035736757953760814, 0.02616351340625175, -0.22693167894955396, 0.08710207312833518, 0.08123371094595366, 0.0529744278464932, -0.0763192378816551, -0.08628155972709305, -0.05510686908040524, 0.10492476325495825, 0.05128936971510377, 0.042869524053565006, 0.17333102410467452, -0.10120782622834668, -0.05918626099831753, 0.3419096909929067, -0.06921525571413119, -0.19805109743859195, 0.20899453771006152, -0.15194601679617978, -0.16740190856131343, 0.07150879609638222, 0.09560282669468399, 0.11697955365867957, -0.18622377598041887, 0.0886216077787514, -0.08632384304313317, 0.19607008410008242, 0.025617236107149544, 0.033428913930787105, 0.22988147098187575, 0.1233903738526244, 0.07564705173546613, 0.1180560663325356, -0.007354162773802219, -0.14104161534787102, -0.3373691326637259, -0.15645649670349324, -0.19642141664243193, 0.11565657768594118, -0.04103214849751299, -0.17284767861094544, 0.3244764524347642, 0.19647617936596576, 0.17927197894930622, 0.027547101409736034, 0.26074338432483596, 0.18010773432958077, 0.050771860118188405, 0.07200254635501872, 0.28676627148696054, 0.11722392913447145, 0.07370748360613909, -0.21554635959225432, 0.10998704045435742, 0.04181542704292737]
1,803.03399
Superconductivity in two-dimensional phosphorus carbide ($\beta_{0}$-PC)
Two-dimensional (2D) boron has been predicted to show superconductivity. However, intrinsic 2D carbon and phosphorus have not been reported to be superconductors, which, inspires us to seek superconductivity in their mixture. Here we perform first-principles calculations of the electronic structure, phonon dispersion, and electron-phonon coupling of the metallic phosphorus carbide monolayer, the $\beta_{0}$-PC. Results show that it is an intrinsic phonon-mediated superconductor, with estimated superconducting temperature $T_{c}$ to be $\sim$13 K. The main contribution to the electron-phonon coupling is from the out-of-plane vibrations of phosphorus. A Kohn anomaly on the first acoustic branch is observed. The superconducting related physical quantities is found tunable by applying strain or carrier doping.
cond-mat.supr-con cond-mat.mes-hall
twodimensional 2d boron has been predicted to show superconductivity however intrinsic 2d carbon and phosphorus have not been reported to be superconductors which inspires us to seek superconductivity in their mixture here we perform firstprinciples calculations of the electronic structure phonon dispersion and electronphonon coupling of the metallic phosphorus carbide monolayer the beta_0pc results show that it is an intrinsic phononmediated superconductor with estimated superconducting temperature t_c to be sim13 k the main contribution to the electronphonon coupling is from the outofplane vibrations of phosphorus a kohn anomaly on the first acoustic branch is observed the superconducting related physical quantities is found tunable by applying strain or carrier doping
[['twodimensional', '2d', 'boron', 'has', 'been', 'predicted', 'to', 'show', 'superconductivity', 'however', 'intrinsic', '2d', 'carbon', 'and', 'phosphorus', 'have', 'not', 'been', 'reported', 'to', 'be', 'superconductors', 'which', 'inspires', 'us', 'to', 'seek', 'superconductivity', 'in', 'their', 'mixture', 'here', 'we', 'perform', 'firstprinciples', 'calculations', 'of', 'the', 'electronic', 'structure', 'phonon', 'dispersion', 'and', 'electronphonon', 'coupling', 'of', 'the', 'metallic', 'phosphorus', 'carbide', 'monolayer', 'the', 'beta_0pc', 'results', 'show', 'that', 'it', 'is', 'an', 'intrinsic', 'phononmediated', 'superconductor', 'with', 'estimated', 'superconducting', 'temperature', 't_c', 'to', 'be', 'sim13', 'k', 'the', 'main', 'contribution', 'to', 'the', 'electronphonon', 'coupling', 'is', 'from', 'the', 'outofplane', 'vibrations', 'of', 'phosphorus', 'a', 'kohn', 'anomaly', 'on', 'the', 'first', 'acoustic', 'branch', 'is', 'observed', 'the', 'superconducting', 'related', 'physical', 'quantities', 'is', 'found', 'tunable', 'by', 'applying', 'strain', 'or', 'carrier', 'doping']]
[-0.13368903174651442, 0.16692795880536088, -0.04332303538588652, -0.01635482574864808, -0.09095487167360261, -0.18010066330208685, 0.1207985844704564, 0.44500970785264615, -0.24789542573907292, -0.2601347122927783, -0.057931977312330636, -0.363928965655052, -0.1610001439133797, 0.1800210416010857, 0.04176939238742408, 0.05318837686792432, -0.06412959369265957, -0.07485412673903974, -0.11182968037125345, -0.22806175463807044, 0.27383403311466314, 0.039957355927779444, 0.37106816576259144, 0.13548279050910086, -0.0045525781698180015, -0.08871920800043477, 0.15611873634366524, 0.020165502642393456, -0.17092236670638764, 0.07228537585965737, 0.29691611554611613, -0.16502481698127533, 0.20529702089563082, -0.4392748519571291, -0.27273269933303473, -0.018115813080738816, 0.13489915118380277, 0.20981866204830887, -0.05914294681429898, -0.2549332013241602, 0.07286700031168207, -0.12675595634478937, -0.08354137009182186, -0.11512657308399125, -0.011869882149363143, -0.06472134144429152, -0.19715657443319085, 0.09486180477499685, 0.012660071909151695, 0.048754699236572684, -0.12765733817704367, -0.1595194200484979, -0.11521522099738596, 0.011018350752743168, 0.0878782919521823, 0.06233323812139807, 0.2006383316280941, -0.04315334563229785, -0.07187958426597847, 0.39097608460320366, -0.036382541638212626, -0.04109204653650522, 0.1668345379940648, -0.1426924206704522, -0.06809947526306603, 0.1594766003674724, 0.07398903570827786, 0.04462459985666943, -0.18712541970685212, 0.08095792263069328, -0.01115396208721601, 0.1996037556996776, 0.0505499659942601, 0.11218189089817719, 0.2683584272895974, 0.24873952224798915, -0.011549971823114902, 0.09348413430982166, -0.12675960393540595, 0.07228796650370997, -0.1377585321423356, -0.1870540965658923, -0.271284884971532, 0.12657219178220624, -0.07248638220604604, -0.2245444037296154, 0.3721960240681828, 0.1892714260611683, 0.1649630678627916, -0.10250598627047751, 0.1973624536379551, 0.1404921016391772, 0.12525410733953188, 0.02847625463079937, 0.33630780241866076, 0.2433779467505196, 0.08015342043385047, -0.34011729797930457, 0.0791195905422447, 0.005850216059048695]
1,803.034
Electronic effect of doped oxygen atoms in Bi2201 superconductors determined by scanning tunneling microscopy
The oxygen dopants are essential in tuning electronic properties of Bi$_2$Sr$_2$Ca$_{n-1}$Cu$_n$O$_{2n+4+\delta}$ superconductors. Here we apply the technique of scanning tunneling microscopy and spectroscopy to study the influence of oxygen dopants in an optimally doped Bi$_2$Sr$_{2-x}$La$_x$CuO$_{6+\delta}$ and an overdoped Bi$_{2-y}$Pb$_y$Sr$_2$CuO$_{6+\delta}$. In both samples, we find that interstitial oxygen atoms on the SrO layers dominate over the other two forms of oxygen dopants, oxygen vacancies on the SrO layers and interstitial oxygen atoms on the BiO layers. The hole doping is estimated from the oxygen concentration, as compared to the result extracted from the measured Fermi surface. The precise spatial location is employed to obtain a negative correlation between the oxygen dopants and the inhomogeneous pseudogap.
cond-mat.supr-con
the oxygen dopants are essential in tuning electronic properties of bi_2sr_2ca_n1cu_no_2n4delta superconductors here we apply the technique of scanning tunneling microscopy and spectroscopy to study the influence of oxygen dopants in an optimally doped bi_2sr_2xla_xcuo_6delta and an overdoped bi_2ypb_ysr_2cuo_6delta in both samples we find that interstitial oxygen atoms on the sro layers dominate over the other two forms of oxygen dopants oxygen vacancies on the sro layers and interstitial oxygen atoms on the bio layers the hole doping is estimated from the oxygen concentration as compared to the result extracted from the measured fermi surface the precise spatial location is employed to obtain a negative correlation between the oxygen dopants and the inhomogeneous pseudogap
[['the', 'oxygen', 'dopants', 'are', 'essential', 'in', 'tuning', 'electronic', 'properties', 'of', 'bi_2sr_2ca_n1cu_no_2n4delta', 'superconductors', 'here', 'we', 'apply', 'the', 'technique', 'of', 'scanning', 'tunneling', 'microscopy', 'and', 'spectroscopy', 'to', 'study', 'the', 'influence', 'of', 'oxygen', 'dopants', 'in', 'an', 'optimally', 'doped', 'bi_2sr_2xla_xcuo_6delta', 'and', 'an', 'overdoped', 'bi_2ypb_ysr_2cuo_6delta', 'in', 'both', 'samples', 'we', 'find', 'that', 'interstitial', 'oxygen', 'atoms', 'on', 'the', 'sro', 'layers', 'dominate', 'over', 'the', 'other', 'two', 'forms', 'of', 'oxygen', 'dopants', 'oxygen', 'vacancies', 'on', 'the', 'sro', 'layers', 'and', 'interstitial', 'oxygen', 'atoms', 'on', 'the', 'bio', 'layers', 'the', 'hole', 'doping', 'is', 'estimated', 'from', 'the', 'oxygen', 'concentration', 'as', 'compared', 'to', 'the', 'result', 'extracted', 'from', 'the', 'measured', 'fermi', 'surface', 'the', 'precise', 'spatial', 'location', 'is', 'employed', 'to', 'obtain', 'a', 'negative', 'correlation', 'between', 'the', 'oxygen', 'dopants', 'and', 'the', 'inhomogeneous', 'pseudogap']]
[-0.06074812864660219, 0.15791776171603747, 0.026965930583953326, 0.04681456306259081, 0.0785775764733054, -0.13932110001249903, 0.1754494751382611, 0.4518607599394662, -0.27597407371753696, -0.301815883202445, -0.0698442182110739, -0.43682241791559917, -0.07980178483973889, 0.12498433508777193, 0.010619053080777771, -0.049493897024928755, -0.059261829301249236, -0.07869786161505285, -0.12988301986687084, -0.27783282606729437, 0.29947337228804827, 0.08806435526016035, 0.3479674189875368, 0.1052134850261999, 0.00315292998233677, 0.002573102463169822, 0.09725629747845232, 0.023451820498199334, -0.18926216781626085, 0.11480314166484666, 0.2986067792410592, -0.11396462863298698, 0.18336369073118217, -0.5150345490713205, -0.2176862999424754, -0.050430228775699755, 0.16759601382571937, 0.18357360182562843, -0.12356390260954088, -0.2555637876336862, -0.017842651860389327, -0.055428073346515054, -0.07813345960520175, -0.057447954979059954, -0.04963458097440058, 0.021819042983614572, -0.24146514179301448, 0.11394663389572608, 0.020756155751379474, 0.10818966935663152, -0.19910806617034332, -0.12632320494906576, -0.16936282246440118, 0.07893865861115046, 0.03775880794689458, 0.017459526132110374, 0.2555753174793998, -0.04961628715058656, -0.01192588948625988, 0.3180017350324696, -0.03025329258525744, -0.07071809791627207, 0.16909323036920146, -0.16588032143044984, -0.07279481886819537, 0.150225420894068, 0.10452670327088397, 0.14981357258095937, -0.15589230944273627, 0.06294085099112376, -0.0015097390860319138, 0.24067121250222304, 0.1089600617290541, 0.10570356919613134, 0.20359862081906094, 0.19483865484445623, 0.10373574468706336, 0.07143493967877086, -0.1982570552645484, 0.04012823951779865, -0.13741067687182554, -0.23580166592728347, -0.2001613938981401, 0.01781170245625877, -0.11324872019083289, -0.21157238293173058, 0.3529685442834826, 0.14467888730411818, 0.21484887289885332, -0.18713405391567253, 0.20824700665298224, 0.04754016104665685, 0.07867589335988409, -0.03362016565266198, 0.22139979458214448, 0.18021516092786832, 0.10302825328523925, -0.3342689475518585, 0.16534332992159761, 0.029271303760262008]
1,803.03401
First-principles study of superconductivity in 2D and 3D forms of PbTiSe$_{2}$: Suppressed charge density wave in 1\emph{T}-TiSe$_{2}$
Layered 1$T$-TiSe$_{2}$ has attracted much interest for the competition of charge density wave (CDW) and superconductivity in its bulk and even monolayer forms. Here we perform first-principles calculations of the electronic structure, phonon dispersion, and electron-phonon coupling of the Pb-intercalated 1$T$-TiSe$_{2}$ in bulk and layered structures. Results show that upon the Pb atom intercalation, the CDW instability in 1$T$-TiSe$_{2}$ can be effectively suppressed, accompanied by the removal of the imaginary phonon modes at \textbf{q}$_{\rm{M}}$. The Pb 6\emph{p} orbitals occupy directly at the Fermi level, which hence intercalates the superconductivity. Both bulk and layered PbTiSe$_{2}$ are phonon-mediated superconductors, with estimated superconducting temperature $T_{c}$ to be $\sim$1.6-3.8 K. The main contribution to the electron-phonon coupling is from the vibrations of Pb and Se atoms. The superconducting related physical quantities are found tunable by varying Pb content.
cond-mat.supr-con
layered 1ttise_2 has attracted much interest for the competition of charge density wave cdw and superconductivity in its bulk and even monolayer forms here we perform firstprinciples calculations of the electronic structure phonon dispersion and electronphonon coupling of the pbintercalated 1ttise_2 in bulk and layered structures results show that upon the pb atom intercalation the cdw instability in 1ttise_2 can be effectively suppressed accompanied by the removal of the imaginary phonon modes at textbfq_rmm the pb 6emphp orbitals occupy directly at the fermi level which hence intercalates the superconductivity both bulk and layered pbtise_2 are phononmediated superconductors with estimated superconducting temperature t_c to be sim1638 k the main contribution to the electronphonon coupling is from the vibrations of pb and se atoms the superconducting related physical quantities are found tunable by varying pb content
[['layered', '1ttise_2', 'has', 'attracted', 'much', 'interest', 'for', 'the', 'competition', 'of', 'charge', 'density', 'wave', 'cdw', 'and', 'superconductivity', 'in', 'its', 'bulk', 'and', 'even', 'monolayer', 'forms', 'here', 'we', 'perform', 'firstprinciples', 'calculations', 'of', 'the', 'electronic', 'structure', 'phonon', 'dispersion', 'and', 'electronphonon', 'coupling', 'of', 'the', 'pbintercalated', '1ttise_2', 'in', 'bulk', 'and', 'layered', 'structures', 'results', 'show', 'that', 'upon', 'the', 'pb', 'atom', 'intercalation', 'the', 'cdw', 'instability', 'in', '1ttise_2', 'can', 'be', 'effectively', 'suppressed', 'accompanied', 'by', 'the', 'removal', 'of', 'the', 'imaginary', 'phonon', 'modes', 'at', 'textbfq_rmm', 'the', 'pb', '6emphp', 'orbitals', 'occupy', 'directly', 'at', 'the', 'fermi', 'level', 'which', 'hence', 'intercalates', 'the', 'superconductivity', 'both', 'bulk', 'and', 'layered', 'pbtise_2', 'are', 'phononmediated', 'superconductors', 'with', 'estimated', 'superconducting', 'temperature', 't_c', 'to', 'be', 'sim1638', 'k', 'the', 'main', 'contribution', 'to', 'the', 'electronphonon', 'coupling', 'is', 'from', 'the', 'vibrations', 'of', 'pb', 'and', 'se', 'atoms', 'the', 'superconducting', 'related', 'physical', 'quantities', 'are', 'found', 'tunable', 'by', 'varying', 'pb', 'content']]
[-0.18121044799800992, 0.2530357394991948, -0.011454114127297734, -0.006409619446634495, -0.039649825196626576, -0.131766195650855, 0.14845193142085805, 0.3606827642855256, -0.28042020604678597, -0.24621357129121474, -0.08449691748372892, -0.39495717120436274, -0.1162283842798409, 0.12239235247911294, 0.10724205328440366, -0.0030611125700890497, -0.06278965321853179, -0.057201864667121294, -0.14558517392869144, -0.225188489669443, 0.30268461116077017, 0.05229479787770168, 0.3654234516669007, 0.1347960965047309, -0.03772370625908176, -0.03066458326742746, 0.15870757796982116, 0.005032899670389502, -0.15880413002443053, 0.08302856799821522, 0.3359652060704927, -0.1446155506482189, 0.1901498246891063, -0.4820747932404742, -0.25719481248718995, -0.07503113833566506, 0.13360746348522198, 0.16476210969041802, -0.05842787333468134, -0.28638499655017213, 0.04919564005622799, -0.1378018457132081, -0.08338422971135077, -0.08275886431206451, -0.036317531006815014, -0.01490887434694685, -0.21557821706523975, 0.12486309423869432, 0.012171105929296608, 0.058881479843784494, -0.110647497636396, -0.16632738526073076, -0.16794635681435466, -0.02724833823307309, 0.06431133273173152, 0.06540482550748451, 0.19272189497110226, -0.0820416952808236, -0.048054875987365325, 0.4103724960050033, -0.038823583589274756, -0.06214162790353677, 0.17061655292677325, -0.1588383267034394, -0.05362874467662254, 0.20746323483988874, 0.10289590578894456, 0.03979462459900005, -0.10806859859902512, 0.09329176154222282, 0.02885655894893124, 0.19504898962882428, 0.08159849590571351, 0.14948197257481227, 0.24592842274280483, 0.2083130414997473, -0.00541262025403422, 0.07381821790522383, -0.11185261400600592, 0.005740077835832571, -0.1984943158043794, -0.17450217153270578, -0.2510193926895889, 0.028749749797568728, -0.06941427742316056, -0.17401213768703588, 0.3738371014104102, 0.14504842742079105, 0.15428908733116795, -0.11573091740521436, 0.18149655092825262, 0.14019552397301652, 0.11097529150054668, 0.029664386276791032, 0.294519818155095, 0.18786558662288527, 0.09804202775405936, -0.3401856003275011, 0.10139860918333884, -0.00022608893670777018]
1,803.03402
Orbital Angular Momentum Generation and Detection by Geometric-Phase Based Metasurfaces
We present a comprehensive review on the geometric-phase based metasurfaces for orbital angular momentum(OAM) generation and detection. These metasurfaces manipulate the electromagnetic (EM) wave by introducing abrupt phase change, which is strongly dependent on the polarization state of incident EM wave and can be interpreted by geometric phase. Hence, the conventional bulk devices that based on the accumulated phase change along the optical path can be avoided.
physics.optics
we present a comprehensive review on the geometricphase based metasurfaces for orbital angular momentumoam generation and detection these metasurfaces manipulate the electromagnetic em wave by introducing abrupt phase change which is strongly dependent on the polarization state of incident em wave and can be interpreted by geometric phase hence the conventional bulk devices that based on the accumulated phase change along the optical path can be avoided
[['we', 'present', 'a', 'comprehensive', 'review', 'on', 'the', 'geometricphase', 'based', 'metasurfaces', 'for', 'orbital', 'angular', 'momentumoam', 'generation', 'and', 'detection', 'these', 'metasurfaces', 'manipulate', 'the', 'electromagnetic', 'em', 'wave', 'by', 'introducing', 'abrupt', 'phase', 'change', 'which', 'is', 'strongly', 'dependent', 'on', 'the', 'polarization', 'state', 'of', 'incident', 'em', 'wave', 'and', 'can', 'be', 'interpreted', 'by', 'geometric', 'phase', 'hence', 'the', 'conventional', 'bulk', 'devices', 'that', 'based', 'on', 'the', 'accumulated', 'phase', 'change', 'along', 'the', 'optical', 'path', 'can', 'be', 'avoided']]
[-0.20329070966968785, 0.23747590844477737, -0.08924260151697629, -0.020058879786893836, -0.1603448690095944, -0.07825010071800494, 0.06644568055409437, 0.4371752957465933, -0.24902125661358682, -0.2967226773278037, 0.08596339315843227, -0.2417254991162179, -0.1797278196196447, 0.1817244935308152, -0.004465666870628275, 0.0496422890243607, 0.02643471950692917, -0.03314003114824864, -0.08919401497079699, -0.11214952085361775, 0.3080049173406033, 0.03596908867414763, 0.3121100722937219, 0.04808749318897808, 0.09871136802318159, 0.09616547759705737, -0.028062497084498154, 0.043276264874348, -0.08782267741871556, 0.1009223534544902, 0.21223415731827713, 0.06105982491732644, 0.15025915836553966, -0.48386122544866, -0.26188171702200796, 0.045065221654723826, 0.13181274239696675, 0.12112666280599617, -0.0695096048119881, -0.3308611610876535, 0.004342343133471128, -0.12542868931013257, -0.09701230019698469, -0.09039892229154262, -0.014575258091981732, 0.04546375120920477, -0.18322787267058643, 0.04085660756412727, 0.01879823384737012, 0.014841848609051597, -0.03774179191152224, -0.0874651167402739, -0.04588226863502789, 0.003824102976394178, -0.026466302896863712, 0.07492767090547774, 0.1466083154629624, -0.08094459203933713, -0.14928083671534906, 0.36643361856243506, -0.06733117780801076, -0.16477633096666924, 0.09869484892879515, -0.11831438274525885, -0.004690751169266096, 0.19022985195754957, 0.1882047617057366, 0.13233569641284812, -0.11233420925798701, -0.0037466447866424473, 0.04668942095977671, 0.18159156515082317, 0.07318820451288971, 0.11759681814113881, 0.31103230634351947, 0.1264382341056506, 0.06146518377684502, 0.12176901515253555, -0.10961609867874032, -0.04706962061906928, -0.28380997278797093, -0.1399592964757067, -0.2476687265851938, 0.04137196212984385, -0.04860457488958578, -0.17622009831577984, 0.4547251811000838, 0.14544404007550052, 0.14980111340992153, -0.04611085633636077, 0.3152066036058006, 0.17651647368251389, 0.04389020686607752, 0.029210169097658858, 0.35227468064916667, 0.07502206243268812, 0.13243582237984486, -0.2735033204514922, 0.11876264130766157, 0.023816616941632618]
1,803.03403
The study of electronic nematicity in an overdoped (Bi, Pb)$_2$Sr$_2$CuO$_{6+\delta}$ superconductor using scanning tunneling spectroscopy
The pseudogap (PG) state and its related intra-unit-cell symmetry breaking remain the focus in the research of cuprate superconductors. Although the nematicity has been studied in Bi$_2$Sr$_2$CaCu$_2$O$_{8+\delta}$, especially underdoped samples, its behavior in other cuprates and different doping regions is still unclear. Here we apply a scanning tunneling microscope to explore an overdoped (Bi, Pb)$_2$Sr$_2$CuO$_{6+\delta}$ with a large Fermi surface (FS). The establishment of a nematic order and its real-space distribution is visualized as the energy scale approaches the PG.
cond-mat.supr-con
the pseudogap pg state and its related intraunitcell symmetry breaking remain the focus in the research of cuprate superconductors although the nematicity has been studied in bi_2sr_2cacu_2o_8delta especially underdoped samples its behavior in other cuprates and different doping regions is still unclear here we apply a scanning tunneling microscope to explore an overdoped bi pb_2sr_2cuo_6delta with a large fermi surface fs the establishment of a nematic order and its realspace distribution is visualized as the energy scale approaches the pg
[['the', 'pseudogap', 'pg', 'state', 'and', 'its', 'related', 'intraunitcell', 'symmetry', 'breaking', 'remain', 'the', 'focus', 'in', 'the', 'research', 'of', 'cuprate', 'superconductors', 'although', 'the', 'nematicity', 'has', 'been', 'studied', 'in', 'bi_2sr_2cacu_2o_8delta', 'especially', 'underdoped', 'samples', 'its', 'behavior', 'in', 'other', 'cuprates', 'and', 'different', 'doping', 'regions', 'is', 'still', 'unclear', 'here', 'we', 'apply', 'a', 'scanning', 'tunneling', 'microscope', 'to', 'explore', 'an', 'overdoped', 'bi', 'pb_2sr_2cuo_6delta', 'with', 'a', 'large', 'fermi', 'surface', 'fs', 'the', 'establishment', 'of', 'a', 'nematic', 'order', 'and', 'its', 'realspace', 'distribution', 'is', 'visualized', 'as', 'the', 'energy', 'scale', 'approaches', 'the', 'pg']]
[-0.1791741207412951, 0.19906667249348703, -0.09420459237704172, 0.0995080725590498, -0.07690085633657873, -0.162075589956197, 0.08348353359777527, 0.3857344402872686, -0.2622218789131958, -0.23813032580810728, 0.02143275203283499, -0.3681465062088793, -0.09370464187917076, 0.1465775755740985, -0.01622477706663216, 0.02972974527193988, -0.12896853479073395, -0.0489617368630782, -0.1635354942571419, -0.25057424972706205, 0.3087898960124843, 0.03737099859657214, 0.4046188017524354, 0.06675164110934999, 0.031109404502601565, -0.033854378071979066, 0.13083966307436365, 0.036017294053601316, -0.20590109409929452, 0.041958281874238175, 0.361229723737917, -0.06723344147122831, 0.23539148952481867, -0.410311803174547, -0.27453146174349646, -0.025121433194726706, 0.17295594188042834, 0.13510772163826454, -0.0729122266904274, -0.2778868769307303, 0.0027833916011113153, -0.12337063759848287, -0.11517141117232474, -0.11995109817885523, -0.039009056012794564, -0.05532354430613827, -0.11895554229805741, 0.11786211176062168, 0.03230082669554726, 0.12733010222687374, -0.1077252983902522, -0.07551947281448336, -0.08037366697349574, 0.032977324550900654, 0.12570478398458962, 0.10332477295511885, 0.11417634363869747, -0.15787280393363554, -0.08835213508787035, 0.35425312194643144, 0.05005684855565004, -0.028609650088709932, 0.14972977609008173, -0.2058299976177042, -0.10926040251373867, 0.12603267846935534, 0.05733007861041947, 0.12368552314848462, -0.12839448871827813, 0.13347479594131648, -0.04825208317252654, 0.21476738510912732, 0.03256353352195288, 0.10679950479188156, 0.2578437828069812, 0.28100771635263877, 0.04473741844154989, 0.0856251083086009, -0.2074204623062588, -0.019106567377531077, -0.1925267098306478, -0.15251205613412247, -0.2519477373814281, 0.013468278663327234, 0.004025686715539439, -0.18411254399467872, 0.4175499549866477, 0.1525987487557474, 0.2661939445600102, -0.13970227811862773, 0.2079710360687179, 0.07638383126092627, 0.05296486858249041, 0.025187708496387247, 0.2141682646661714, 0.11270610854925611, 0.11880703505034311, -0.34966269805673744, 0.12528175366394034, -0.020760571867038932]
1,803.03404
Note: Optical filter method for high-resolution magnetostriction measurement using fiber Bragg grating under millisecond-pulsed high magnetic fields at cryogenic temperatures
High-resolution magnetostriction measurement of $\Delta L/L\sim10^{-6}$ at a speed of 5 MHz is performed, using optical filter method as the detection scheme for the fiber Bragg grating (FBG) based strain monitor is performed under 35-millisecond pulsed high magnetic fields up to 45 T at 2.2 K. The resolution of magnetostriction is about the same order as the conventionally reported value from FBG based magnetostriction measurement systems for millisecond pulsed magnetic fields. The measurement speed is $\sim$100 times the conventional ones. Present system can be a faster alternative for the conventional FBG based magnetostriction measurement system for millisecond pulsed high magnetic fields.
cond-mat.mtrl-sci
highresolution magnetostriction measurement of delta llsim106 at a speed of 5 mhz is performed using optical filter method as the detection scheme for the fiber bragg grating fbg based strain monitor is performed under 35millisecond pulsed high magnetic fields up to 45 t at 22 k the resolution of magnetostriction is about the same order as the conventionally reported value from fbg based magnetostriction measurement systems for millisecond pulsed magnetic fields the measurement speed is sim100 times the conventional ones present system can be a faster alternative for the conventional fbg based magnetostriction measurement system for millisecond pulsed high magnetic fields
[['highresolution', 'magnetostriction', 'measurement', 'of', 'delta', 'llsim106', 'at', 'a', 'speed', 'of', '5', 'mhz', 'is', 'performed', 'using', 'optical', 'filter', 'method', 'as', 'the', 'detection', 'scheme', 'for', 'the', 'fiber', 'bragg', 'grating', 'fbg', 'based', 'strain', 'monitor', 'is', 'performed', 'under', '35millisecond', 'pulsed', 'high', 'magnetic', 'fields', 'up', 'to', '45', 't', 'at', '22', 'k', 'the', 'resolution', 'of', 'magnetostriction', 'is', 'about', 'the', 'same', 'order', 'as', 'the', 'conventionally', 'reported', 'value', 'from', 'fbg', 'based', 'magnetostriction', 'measurement', 'systems', 'for', 'millisecond', 'pulsed', 'magnetic', 'fields', 'the', 'measurement', 'speed', 'is', 'sim100', 'times', 'the', 'conventional', 'ones', 'present', 'system', 'can', 'be', 'a', 'faster', 'alternative', 'for', 'the', 'conventional', 'fbg', 'based', 'magnetostriction', 'measurement', 'system', 'for', 'millisecond', 'pulsed', 'high', 'magnetic', 'fields']]
[-0.16919854820019217, 0.18186855144949274, -0.05732978195554078, -0.05263741330873936, -0.09215216233272745, -0.14023759329428126, 0.06637144733850628, 0.44793942585738017, -0.2396133397893999, -0.33258927958744644, 0.11833957295789561, -0.24424828950202826, 0.0022134603038806507, 0.3268353233897043, 0.03996370520649685, 0.07060178480289801, 0.024561016731001813, 0.025992547919164704, -0.05616420246848856, -0.1793255267307313, 0.18136962558462688, 0.08584856272985537, 0.342902967621657, -0.004397938943425702, 0.17335579775960533, -0.003113119529014585, 0.060356764254545926, -0.01809559164173675, -0.06977767869359766, 0.010893663708967242, 0.21407360880579235, -0.012022952346902604, 0.185503222217614, -0.39412192602387885, -0.21960810218194518, 0.03770990770385422, 0.10077772133823748, 0.0769786599313845, -0.03283064944123981, -0.27281358219081103, 0.10199826343850506, -0.12989824507244382, -0.1199705993634357, -0.08249440467493101, -0.04089388455913374, 0.00947736610065807, -0.3033937756724731, 0.11567194511493047, -0.00762564235606767, 0.1779675855291913, -0.08417515339085249, -0.10758952955207364, 0.06483970442316447, -0.006976301447874067, -0.013720034237132606, 0.11106455912155033, 0.20902347183701667, -0.0793926902209418, -0.12185691041175765, 0.33900616325513283, -0.10904883708207483, -0.04047803556301979, 0.11912517375406818, -0.21415156163651533, -0.05621327483800776, 0.22876903019384529, 0.14514362379306495, 0.13823260603039855, -0.15331693556138568, -0.004003243153971253, 0.05904750635076051, 0.2637243065606765, 0.13215993573381143, 0.06371507833175587, 0.1831985970211187, 0.2262729528839841, 0.04703390684844268, 0.11242505411659791, -0.23462873886837954, 0.0625090448178746, -0.21094644564495543, -0.12532916632151664, -0.19517572192155352, 0.09059567006794039, -0.10908081830770831, -0.08414526789736078, 0.3583251012271582, 0.1529138504358178, 0.12973837278115402, -0.024711413179627724, 0.3705715441916401, 0.12838411322475007, 0.1165466746973871, 0.006108281249650801, 0.3279392480887849, 0.20333683907496508, 0.19726021108076428, -0.24474652374699485, 0.02966780001485739, -0.020011700586312346]
1,803.03405
Bridging the Gap: Capturing the Ly$\alpha$ Counterpart of a Type-II Spicule and its Heating Evolution with VAULT2.0 and IRIS Observations
We present results from an observing campaign in support of the VAULT2.0 sounding rocket launch on September 30, 2014. VAULT2.0 is a Ly$\alpha$ (1216 \AA) spectroheliograph capable of providing spectroheliograms at high cadence. Ly$\alpha$ observations are highly complementary to the IRIS observations of the upper chromosphere and the low transition region (TR) but have previously been unavailable. The VAULT2.0 data provide new constraints on upper-chromospheric conditions for numerical models. The observing campaign was closely coordinated with the IRIS mission. Taking advantage of this simultaneous multi-wavelength coverage of target AR 12172 and by using state-of-the-art radiative-MHD simulations of spicules, we investigate in detail a type-II spicule associated with a fast (300 km s$^{-1}$) network jet recorded in the campaign observations. Our analysis suggests that spicular material exists suspended high in the atmosphere but in lower temperatures (seen in Ly$\alpha$) until it is heated and becomes visible in TR temperatures as a network jet. The heating begins lower in the spicule and propagates upwards as a rapidly propagating thermal front. The front is then observed as fast, plane-of-the-sky motion typical of a network jet, but contained inside the pre-existing spicule. This work supports that the high speeds reported in network jets should not be taken as real mass upflows but only as apparent speeds of a rapidly propagating heating front along the pre-existing spicule.
astro-ph.SR
we present results from an observing campaign in support of the vault20 sounding rocket launch on september 30 2014 vault20 is a lyalpha 1216 aa spectroheliograph capable of providing spectroheliograms at high cadence lyalpha observations are highly complementary to the iris observations of the upper chromosphere and the low transition region tr but have previously been unavailable the vault20 data provide new constraints on upperchromospheric conditions for numerical models the observing campaign was closely coordinated with the iris mission taking advantage of this simultaneous multiwavelength coverage of target ar 12172 and by using stateoftheart radiativemhd simulations of spicules we investigate in detail a typeii spicule associated with a fast 300 km s1 network jet recorded in the campaign observations our analysis suggests that spicular material exists suspended high in the atmosphere but in lower temperatures seen in lyalpha until it is heated and becomes visible in tr temperatures as a network jet the heating begins lower in the spicule and propagates upwards as a rapidly propagating thermal front the front is then observed as fast planeofthesky motion typical of a network jet but contained inside the preexisting spicule this work supports that the high speeds reported in network jets should not be taken as real mass upflows but only as apparent speeds of a rapidly propagating heating front along the preexisting spicule
[['we', 'present', 'results', 'from', 'an', 'observing', 'campaign', 'in', 'support', 'of', 'the', 'vault20', 'sounding', 'rocket', 'launch', 'on', 'september', '30', '2014', 'vault20', 'is', 'a', 'lyalpha', '1216', 'aa', 'spectroheliograph', 'capable', 'of', 'providing', 'spectroheliograms', 'at', 'high', 'cadence', 'lyalpha', 'observations', 'are', 'highly', 'complementary', 'to', 'the', 'iris', 'observations', 'of', 'the', 'upper', 'chromosphere', 'and', 'the', 'low', 'transition', 'region', 'tr', 'but', 'have', 'previously', 'been', 'unavailable', 'the', 'vault20', 'data', 'provide', 'new', 'constraints', 'on', 'upperchromospheric', 'conditions', 'for', 'numerical', 'models', 'the', 'observing', 'campaign', 'was', 'closely', 'coordinated', 'with', 'the', 'iris', 'mission', 'taking', 'advantage', 'of', 'this', 'simultaneous', 'multiwavelength', 'coverage', 'of', 'target', 'ar', '12172', 'and', 'by', 'using', 'stateoftheart', 'radiativemhd', 'simulations', 'of', 'spicules', 'we', 'investigate', 'in', 'detail', 'a', 'typeii', 'spicule', 'associated', 'with', 'a', 'fast', '300', 'km', 's1', 'network', 'jet', 'recorded', 'in', 'the', 'campaign', 'observations', 'our', 'analysis', 'suggests', 'that', 'spicular', 'material', 'exists', 'suspended', 'high', 'in', 'the', 'atmosphere', 'but', 'in', 'lower', 'temperatures', 'seen', 'in', 'lyalpha', 'until', 'it', 'is', 'heated', 'and', 'becomes', 'visible', 'in', 'tr', 'temperatures', 'as', 'a', 'network', 'jet', 'the', 'heating', 'begins', 'lower', 'in', 'the', 'spicule', 'and', 'propagates', 'upwards', 'as', 'a', 'rapidly', 'propagating', 'thermal', 'front', 'the', 'front', 'is', 'then', 'observed', 'as', 'fast', 'planeofthesky', 'motion', 'typical', 'of', 'a', 'network', 'jet', 'but', 'contained', 'inside', 'the', 'preexisting', 'spicule', 'this', 'work', 'supports', 'that', 'the', 'high', 'speeds', 'reported', 'in', 'network', 'jets', 'should', 'not', 'be', 'taken', 'as', 'real', 'mass', 'upflows', 'but', 'only', 'as', 'apparent', 'speeds', 'of', 'a', 'rapidly', 'propagating', 'heating', 'front', 'along', 'the', 'preexisting', 'spicule']]
[-0.10770282582168213, 0.16911831931693913, -0.02563032663039683, 0.05055812145636247, -0.09870442842789502, -0.12214200031898641, 0.029939662146551364, 0.4621208494232798, -0.18666580222568221, -0.3229395229327069, 0.13676268421867546, -0.2688557396642864, -0.051936249768848274, 0.21953020883427762, -0.03481263492841125, -0.0032889810258480297, 0.1111533686264672, -0.04474310918793146, -0.009421669828324495, -0.18010368888128803, 0.2100136346321299, 0.14956429489591921, 0.22801302911036395, 0.022140431831675498, 0.08917111739865505, -0.11011471974832768, -0.05569702776529911, 0.012209290952887386, -0.11035492229890555, 0.021272659808693622, 0.21423642348297356, 0.1580049975939222, 0.24844636096088585, -0.4470021920194003, -0.2572704475718307, -0.031555234760427, 0.19332668419758028, 0.02540648667438125, -0.03355435384834312, -0.29789457306773826, 0.03168766398765993, -0.14256176087219502, -0.13017287474464287, 0.0629115958952091, 0.02051588192963126, -0.015225944105027752, -0.24746615164701574, 0.06654780035182326, 0.014296972139775542, 0.1298508028768331, -0.08578476713631641, -0.04093946612503549, -0.07743361242993904, 0.08702693130365911, 0.05422300445021723, 0.08240199551959945, 0.15110495003067295, -0.12908991172338244, -0.0497824539933142, 0.3543243012888442, -0.07508496416055344, 0.01114951408976181, 0.2133640954874202, -0.22454233189663766, -0.12009533163985577, 0.2446442064744505, 0.1849295167268296, 0.10189785879655656, -0.10638563601850447, -0.018882330039129803, -0.06960640011820943, 0.1651397767106325, 0.06040122532814911, 0.020905901123875414, 0.25707644810053437, 0.1511001701805402, 0.029572062627200715, 0.13750088547438447, -0.23334793986313426, -0.019162092326124282, -0.28300189140506765, -0.1311260430121117, -0.1096191445876188, 0.032669856622140454, -0.06647749972511188, -0.12786801211451265, 0.3702489010354673, 0.15572906324893915, 0.22906100332779303, 0.01650241552746262, 0.3243505781172478, 0.08051881458694962, 0.07359678410311145, 0.16442426571474325, 0.32156661036847667, 0.11920878803463314, 0.21622875880434136, -0.170895862588606, 0.07458200586155396, 0.0017600105461579832]
1,803.03406
Dynamical evolution of an effective two-level system with PT symmetry
We investigate the dynamics of parity- and time-reversal (PT ) symmetric two-energy-level atoms in the presence of two optical and a radio-frequency (rf) fields. The strength and relative phase of fields can drive the system from unbroken to broken PT symmetric regions. Compared with the Hermitian model, Rabi-type oscillation is still observed, and the oscillation characteristics are also adjusted by the strength and relative phase in the region of unbroken PT symmetry. At exception point (EP), the oscillation breaks down. To better understand the underlying properties we study the effective Bloch dynamics and find the emergence of the z components of the fixed points is the feature of the PT symmetry breaking and the projections in x-y plane can be controlled with high flexibility compared with the standard two-level system with PT symmetry. It helps to study the dynamic behavior of the complex PT symmetric model.
cond-mat.quant-gas
we investigate the dynamics of parity and timereversal pt symmetric twoenergylevel atoms in the presence of two optical and a radiofrequency rf fields the strength and relative phase of fields can drive the system from unbroken to broken pt symmetric regions compared with the hermitian model rabitype oscillation is still observed and the oscillation characteristics are also adjusted by the strength and relative phase in the region of unbroken pt symmetry at exception point ep the oscillation breaks down to better understand the underlying properties we study the effective bloch dynamics and find the emergence of the z components of the fixed points is the feature of the pt symmetry breaking and the projections in xy plane can be controlled with high flexibility compared with the standard twolevel system with pt symmetry it helps to study the dynamic behavior of the complex pt symmetric model
[['we', 'investigate', 'the', 'dynamics', 'of', 'parity', 'and', 'timereversal', 'pt', 'symmetric', 'twoenergylevel', 'atoms', 'in', 'the', 'presence', 'of', 'two', 'optical', 'and', 'a', 'radiofrequency', 'rf', 'fields', 'the', 'strength', 'and', 'relative', 'phase', 'of', 'fields', 'can', 'drive', 'the', 'system', 'from', 'unbroken', 'to', 'broken', 'pt', 'symmetric', 'regions', 'compared', 'with', 'the', 'hermitian', 'model', 'rabitype', 'oscillation', 'is', 'still', 'observed', 'and', 'the', 'oscillation', 'characteristics', 'are', 'also', 'adjusted', 'by', 'the', 'strength', 'and', 'relative', 'phase', 'in', 'the', 'region', 'of', 'unbroken', 'pt', 'symmetry', 'at', 'exception', 'point', 'ep', 'the', 'oscillation', 'breaks', 'down', 'to', 'better', 'understand', 'the', 'underlying', 'properties', 'we', 'study', 'the', 'effective', 'bloch', 'dynamics', 'and', 'find', 'the', 'emergence', 'of', 'the', 'z', 'components', 'of', 'the', 'fixed', 'points', 'is', 'the', 'feature', 'of', 'the', 'pt', 'symmetry', 'breaking', 'and', 'the', 'projections', 'in', 'xy', 'plane', 'can', 'be', 'controlled', 'with', 'high', 'flexibility', 'compared', 'with', 'the', 'standard', 'twolevel', 'system', 'with', 'pt', 'symmetry', 'it', 'helps', 'to', 'study', 'the', 'dynamic', 'behavior', 'of', 'the', 'complex', 'pt', 'symmetric', 'model']]
[-0.157233685196843, 0.17591358079678482, -0.0389059970038943, 0.03898100308692341, -0.029038934077511333, -0.14613664924723302, 0.02594811747904815, 0.38815737502752906, -0.26362725455934805, -0.2875828701330142, 0.06868834294679498, -0.27420388537252116, -0.10662586657175173, 0.08937704407597064, 0.03583234907819133, 0.02666829764429066, -0.053132543372662946, 0.0211635842861142, -0.1287458586003696, -0.1545829556675421, 0.29248910362366587, 0.03968380348588754, 0.33041479777441257, 0.007246001067364382, 0.04647138346060981, 0.010294875058914639, 0.0508231682340718, -0.018089965862196147, -0.06413706287276, 0.0575834336102869, 0.18062178900193734, -0.0026629558415152133, 0.14492705698487246, -0.4032271484611556, -0.17694606949306843, 0.12757094151553852, 0.12036196665091363, 0.11618081628370823, -0.0455176230882191, -0.3085222717685004, 0.06310594302981877, -0.1419623195154903, -0.1952262496148857, -0.07058707377129597, -0.020908901684581198, 0.01908252107629475, -0.27782254993346417, 0.06961224234975008, 0.08462004088475321, 0.10585449445837487, -0.028997335899879947, -0.04708020428046843, -0.11653684199376989, 0.08955736716678883, 0.076194596019276, 0.015072558582889743, 0.1317302794349315, -0.12662617027914772, -0.09659865232404424, 0.4251414949281348, -0.043125386256886285, -0.16567951654885998, 0.1890999678095492, -0.1931094282287328, -0.06524500944134262, 0.15171737591218618, 0.16130996514564483, 0.07377640837674132, -0.08249915952971303, 0.11648602035105189, 0.017552997677638713, 0.17930579873811642, 0.03474859180278145, 0.03402222416803448, 0.21712425474025723, 0.1318294822704047, 0.05132412793879363, 0.15998365272712867, -0.08987121703103185, -0.14718965417382102, -0.2996140627203406, -0.11727866350055491, -0.14381527714188755, 0.031296931346231655, -0.08303207498192933, -0.09669793585392956, 0.46820717372207177, 0.11227752634375873, 0.23384261263223985, -0.03134282563405577, 0.25495716243070393, 0.1273712273396086, 0.08230738284894162, 0.031043748251654, 0.2764263715168151, 0.16635136995076513, 0.10625038857243554, -0.3037540890751795, 0.021566628016039938, 0.01484988909214735]
1,803.03407
Institutional Metaphors for Designing Large-Scale Distributed AI versus AI Techniques for Running Institutions
Artificial Intelligence (AI) started out with an ambition to reproduce the human mind, but, as the sheer scale of that ambition became manifest, it quickly retreated into either studying specialized intelligent behaviours, or proposing over-arching architectural concepts for interfacing specialized intelligent behaviour components, conceived of as agents in a kind of organization. This agent-based modeling paradigm, in turn, proves to have interesting applications in understanding, simulating, and predicting the behaviour of social and legal structures on an aggregate level. For these reasons, this chapter examines a number of relevant cross-cutting concerns, conceptualizations, modeling problems and design challenges in large-scale distributed Artificial Intelligence, as well as in institutional systems, and identifies potential grounds for novel advances.
cs.AI
artificial intelligence ai started out with an ambition to reproduce the human mind but as the sheer scale of that ambition became manifest it quickly retreated into either studying specialized intelligent behaviours or proposing overarching architectural concepts for interfacing specialized intelligent behaviour components conceived of as agents in a kind of organization this agentbased modeling paradigm in turn proves to have interesting applications in understanding simulating and predicting the behaviour of social and legal structures on an aggregate level for these reasons this chapter examines a number of relevant crosscutting concerns conceptualizations modeling problems and design challenges in largescale distributed artificial intelligence as well as in institutional systems and identifies potential grounds for novel advances
[['artificial', 'intelligence', 'ai', 'started', 'out', 'with', 'an', 'ambition', 'to', 'reproduce', 'the', 'human', 'mind', 'but', 'as', 'the', 'sheer', 'scale', 'of', 'that', 'ambition', 'became', 'manifest', 'it', 'quickly', 'retreated', 'into', 'either', 'studying', 'specialized', 'intelligent', 'behaviours', 'or', 'proposing', 'overarching', 'architectural', 'concepts', 'for', 'interfacing', 'specialized', 'intelligent', 'behaviour', 'components', 'conceived', 'of', 'as', 'agents', 'in', 'a', 'kind', 'of', 'organization', 'this', 'agentbased', 'modeling', 'paradigm', 'in', 'turn', 'proves', 'to', 'have', 'interesting', 'applications', 'in', 'understanding', 'simulating', 'and', 'predicting', 'the', 'behaviour', 'of', 'social', 'and', 'legal', 'structures', 'on', 'an', 'aggregate', 'level', 'for', 'these', 'reasons', 'this', 'chapter', 'examines', 'a', 'number', 'of', 'relevant', 'crosscutting', 'concerns', 'conceptualizations', 'modeling', 'problems', 'and', 'design', 'challenges', 'in', 'largescale', 'distributed', 'artificial', 'intelligence', 'as', 'well', 'as', 'in', 'institutional', 'systems', 'and', 'identifies', 'potential', 'grounds', 'for', 'novel', 'advances']]
[-0.10954335871071595, 0.06596556928681979, -0.05508950415836728, 0.1014273770669799, -0.14120128636612841, -0.16869535644781655, 0.005578236225182595, 0.34393446947569434, -0.26024423699178123, -0.36999467254170904, 0.09558016210490757, -0.2487840800500556, -0.25978079571713864, 0.1855514679777274, -0.12017095042392612, 0.044215301055152416, 0.03630435242439094, -0.00042556772899368536, 0.06052674605187191, -0.20454436129202014, 0.2846606641410567, 0.08495085842745459, 0.3174201515786674, 0.0495104180244, 0.07762608254814278, -0.0074243800269196865, -0.055346390657612814, 0.011835475148552137, -0.057794390135234644, 0.18816071737395682, 0.39947545994883, 0.22754209629138528, 0.39689181133213897, -0.4930115104045557, -0.22378364983546223, 0.06825147185312665, 0.173061099389325, 0.06777549922547263, -0.03515168131308873, -0.2945576704390671, 0.028465673375024418, -0.18526446583235393, -0.19275061667127455, -0.1345019316624688, 0.052679853781085945, 0.005417409042179909, -0.17327910539916838, -0.05346019415427809, 0.07867846740915885, 0.17293245136818808, -0.042612436298361936, -0.14476160948043285, 0.06618831243730433, 0.18260667695177962, 0.06821909133830796, -0.024225673436582006, 0.16723309320033244, -0.2149982788519043, -0.17452424934295857, 0.41539263548734395, 0.049990107123132635, -0.14045323991095243, 0.231499017327619, -0.0033542152939607267, -0.22429295471343008, 0.012433447360830463, 0.25117340682722306, 0.02498025526684891, -0.18426746186678825, 0.03444819768850246, 0.046337966106670056, 0.16497224174115968, 0.030267747705701092, 0.01864069501613773, 0.2940737628742405, 0.2750007050273859, 0.04109892401301413, 0.09738060761567043, 0.0445641096904064, -0.16787377197254935, -0.21476954775862395, -0.16730613545464026, -0.12024100299155259, 0.0600673921396146, -0.02370821127779377, -0.1744733714458087, 0.34677938323306, 0.22156629106434791, 0.14553342085817586, 0.0003320967353394498, 0.3176202805712819, 0.008713665726068227, 0.08418256369945795, 0.03647540838498136, 0.17487151572561782, 0.00696290236816782, 0.2036722244694829, -0.13978964058155924, 0.12813248650940215, -0.002693515536172882]
1,803.03408
On Scott-Blair model with time-varying viscosity in linear viscoelasticity
In a recent paper, Zhou et al. studied the time-dependent properties of Glass Fiber Reinforced Polymers (GFRP) composites by using a new rheological model with a time-variable viscosity coefficient. This rheology is essentially based on a generalized Scott-Blair model with time-varying viscosity coefficient involving Riemann-Liouville fractional derivatives. Motivated by this study, in this note we suggest a different generalization of the Scott-Blair model based on the application of Caputo fractional derivatives of a function with respect to another function. This new mathematical approach can be useful in viscoelasticity and diffusion processes in order to consider time-dependent coefficients. We are able to find the exact analytic solution of the creep experiment based on our new approach and we can compare it with the results obtained by Zhou et al.
cond-mat.soft
in a recent paper zhou et al studied the timedependent properties of glass fiber reinforced polymers gfrp composites by using a new rheological model with a timevariable viscosity coefficient this rheology is essentially based on a generalized scottblair model with timevarying viscosity coefficient involving riemannliouville fractional derivatives motivated by this study in this note we suggest a different generalization of the scottblair model based on the application of caputo fractional derivatives of a function with respect to another function this new mathematical approach can be useful in viscoelasticity and diffusion processes in order to consider timedependent coefficients we are able to find the exact analytic solution of the creep experiment based on our new approach and we can compare it with the results obtained by zhou et al
[['in', 'a', 'recent', 'paper', 'zhou', 'et', 'al', 'studied', 'the', 'timedependent', 'properties', 'of', 'glass', 'fiber', 'reinforced', 'polymers', 'gfrp', 'composites', 'by', 'using', 'a', 'new', 'rheological', 'model', 'with', 'a', 'timevariable', 'viscosity', 'coefficient', 'this', 'rheology', 'is', 'essentially', 'based', 'on', 'a', 'generalized', 'scottblair', 'model', 'with', 'timevarying', 'viscosity', 'coefficient', 'involving', 'riemannliouville', 'fractional', 'derivatives', 'motivated', 'by', 'this', 'study', 'in', 'this', 'note', 'we', 'suggest', 'a', 'different', 'generalization', 'of', 'the', 'scottblair', 'model', 'based', 'on', 'the', 'application', 'of', 'caputo', 'fractional', 'derivatives', 'of', 'a', 'function', 'with', 'respect', 'to', 'another', 'function', 'this', 'new', 'mathematical', 'approach', 'can', 'be', 'useful', 'in', 'viscoelasticity', 'and', 'diffusion', 'processes', 'in', 'order', 'to', 'consider', 'timedependent', 'coefficients', 'we', 'are', 'able', 'to', 'find', 'the', 'exact', 'analytic', 'solution', 'of', 'the', 'creep', 'experiment', 'based', 'on', 'our', 'new', 'approach', 'and', 'we', 'can', 'compare', 'it', 'with', 'the', 'results', 'obtained', 'by', 'zhou', 'et', 'al']]
[-0.06133352986580576, 0.06364070598283433, -0.10303517052670941, -0.03003114472176094, -0.1228582405456109, -0.10768397118226858, 0.012327464189183956, 0.3460151550316368, -0.2671337863721419, -0.26875665236593704, 0.08168121885682922, -0.24841244968774845, -0.2485596339975018, 0.19170303845930903, -0.11261416418346926, 0.10359541465732036, -0.006030514025951561, -0.05566654329231824, -0.052093663849518634, -0.23085098541196203, 0.29254315511388995, 0.04683480295625486, 0.23001723206107272, 0.04515339462159318, 0.1096971691440558, 0.001376471707771998, -0.07128652265964774, 0.06411944534920622, -0.2225914326008933, 0.12256793662891141, 0.18235544161689177, -0.012812712138838833, 0.25750554121077585, -0.4243236422043992, -0.26853085061884485, 0.04880587666775682, 0.0685451147146523, 0.0739223681812291, -0.03164707530140731, -0.2862472007618635, 0.049617638556355814, -0.19312611719215056, -0.13577093566345866, -0.08587262032961007, 0.04087331029950292, 0.08332176145086123, -0.31319741043262184, 0.15736869027023204, 0.033703835092183, 0.024479591870317563, -0.0808700905108708, -0.1299878506688401, 0.036227754926585476, -0.009757270749105373, 0.0367292234859633, 0.009475578319324995, 0.08503029346684343, -0.11340941101298085, -0.13198362988623558, 0.34260227600316284, -0.1275976412516684, -0.2500951632973738, 0.18941000228187477, -0.11405758668479393, -0.1285425371445399, 0.07168998782799463, 0.16410480187551002, 0.18151247237983625, -0.1874309355243895, 0.06237797505946219, -0.07260953323566355, 0.15056027890386758, 0.05470525379132596, -0.044648887116636615, 0.12562103513664624, 0.1951150807653903, 0.017102614488976542, 0.17034767804670992, -0.013416612522632931, -0.09826934127795539, -0.2848251767863985, -0.18979174991818581, -0.18470445250568446, 0.0499675428673072, -0.0936840985688363, -0.14203465356513334, 0.38041351123047207, 0.16240248615213204, 0.20442597059445689, 0.06492320944380481, 0.23085992210508266, 0.15551691507880605, -0.0016149458278960083, 0.032958895710180514, 0.24037165623303736, 0.15854372474859701, 0.15637836434143537, -0.2191405109124389, 0.09039671724622167, 0.13996057903204928]
1,803.03409
Real-time and Seamless Monitoring of Ground-level PM2.5 Using Satellite Remote Sensing
Satellite remote sensing has been reported to be a promising approach for the monitoring of atmospheric PM2.5. However, the satellite-based monitoring of ground-level PM2.5 is still challenging. First, the previously used polar-orbiting satellite observations, which can be usually acquired only once per day, are hard to monitor PM2.5 in real time. Second, many data gaps exist in satellite-derived PM2.5 due to the cloud contamination. In this paper, the hourly geostationary satellite (i.e., Himawari-8) observations were adopted for the real-time monitoring of PM2.5 in a deep learning architecture. On this basis, the satellite-derived PM2.5 in conjunction with ground PM2.5 measurements are incorporated into a spatio-temporal fusion model to fill the data gaps. Using Wuhan Urban Agglomeration as an example, we have successfully derived the real-time and seamless PM2.5 distributions. The results demonstrate that Himawari-8 satellite-based deep learning model achieves a satisfactory performance (out-of-sample cross-validation R2=0.80, RMSE=17.49 ug/m3) for the estimation of PM2.5. The missing data in satellite-derive PM2.5 are accurately recovered, with R2 between recoveries and ground measurements of 0.75. Overall, this study has inherently provided an effective strategy for the real-time and seamless monitoring of ground-level PM2.5.
physics.ao-ph
satellite remote sensing has been reported to be a promising approach for the monitoring of atmospheric pm25 however the satellitebased monitoring of groundlevel pm25 is still challenging first the previously used polarorbiting satellite observations which can be usually acquired only once per day are hard to monitor pm25 in real time second many data gaps exist in satellitederived pm25 due to the cloud contamination in this paper the hourly geostationary satellite ie himawari8 observations were adopted for the realtime monitoring of pm25 in a deep learning architecture on this basis the satellitederived pm25 in conjunction with ground pm25 measurements are incorporated into a spatiotemporal fusion model to fill the data gaps using wuhan urban agglomeration as an example we have successfully derived the realtime and seamless pm25 distributions the results demonstrate that himawari8 satellitebased deep learning model achieves a satisfactory performance outofsample crossvalidation r2080 rmse1749 ugm3 for the estimation of pm25 the missing data in satellitederive pm25 are accurately recovered with r2 between recoveries and ground measurements of 075 overall this study has inherently provided an effective strategy for the realtime and seamless monitoring of groundlevel pm25
[['satellite', 'remote', 'sensing', 'has', 'been', 'reported', 'to', 'be', 'a', 'promising', 'approach', 'for', 'the', 'monitoring', 'of', 'atmospheric', 'pm25', 'however', 'the', 'satellitebased', 'monitoring', 'of', 'groundlevel', 'pm25', 'is', 'still', 'challenging', 'first', 'the', 'previously', 'used', 'polarorbiting', 'satellite', 'observations', 'which', 'can', 'be', 'usually', 'acquired', 'only', 'once', 'per', 'day', 'are', 'hard', 'to', 'monitor', 'pm25', 'in', 'real', 'time', 'second', 'many', 'data', 'gaps', 'exist', 'in', 'satellitederived', 'pm25', 'due', 'to', 'the', 'cloud', 'contamination', 'in', 'this', 'paper', 'the', 'hourly', 'geostationary', 'satellite', 'ie', 'himawari8', 'observations', 'were', 'adopted', 'for', 'the', 'realtime', 'monitoring', 'of', 'pm25', 'in', 'a', 'deep', 'learning', 'architecture', 'on', 'this', 'basis', 'the', 'satellitederived', 'pm25', 'in', 'conjunction', 'with', 'ground', 'pm25', 'measurements', 'are', 'incorporated', 'into', 'a', 'spatiotemporal', 'fusion', 'model', 'to', 'fill', 'the', 'data', 'gaps', 'using', 'wuhan', 'urban', 'agglomeration', 'as', 'an', 'example', 'we', 'have', 'successfully', 'derived', 'the', 'realtime', 'and', 'seamless', 'pm25', 'distributions', 'the', 'results', 'demonstrate', 'that', 'himawari8', 'satellitebased', 'deep', 'learning', 'model', 'achieves', 'a', 'satisfactory', 'performance', 'outofsample', 'crossvalidation', 'r2080', 'rmse1749', 'ugm3', 'for', 'the', 'estimation', 'of', 'pm25', 'the', 'missing', 'data', 'in', 'satellitederive', 'pm25', 'are', 'accurately', 'recovered', 'with', 'r2', 'between', 'recoveries', 'and', 'ground', 'measurements', 'of', '075', 'overall', 'this', 'study', 'has', 'inherently', 'provided', 'an', 'effective', 'strategy', 'for', 'the', 'realtime', 'and', 'seamless', 'monitoring', 'of', 'groundlevel', 'pm25']]
[-0.05138842712008077, 0.07056645087780723, -0.07540243975677435, 0.08899131543572307, -0.004697286656924656, -0.11323514233783379, 0.03663539297042087, 0.427709195675881, -0.21384360364914595, -0.3946545060703551, 0.15490407896468641, -0.3055132533894381, -0.10907785067524106, 0.21515493874264124, -0.15097049821186095, 0.10834022293860031, 0.11264329906207622, -0.017546600416548305, -0.0412594655817784, -0.22517032573091705, 0.18493357893581, 0.10411578904969136, 0.3199238247279037, 0.05600482332494601, 0.10755486299915772, -0.001587745449556918, -0.08480268920474983, -0.020253588400709514, -0.05622994513744213, 0.14904630058451432, 0.3563421060712394, 0.1342654899363969, 0.25649069254491275, -0.43328613782772324, -0.27611363541647016, 0.12517260829150512, 0.09460873851823814, 0.02833688401317756, -0.04776284371721456, -0.35030194184906616, 0.04527947544836654, -0.19278302445373202, -0.06611372701885117, -0.07785702207391816, -0.00037243541657597153, -0.024813849352950047, -0.31470114297673596, 0.09996334399185579, -0.08138909453915043, 0.12990517803764606, -0.15839091008836095, -0.09286166384949215, -0.026602330487119137, 0.22366569672741896, 0.047855895943939686, 0.03200609239514221, 0.12146929440671926, -0.1018305843411996, -0.05677494037657168, 0.36352052463341383, -0.07475632635856068, -0.11466196201905444, 0.18063122885951588, -0.11193195859016339, -0.16190933863693788, 0.13203207799489355, 0.23851488946148983, 0.05592806833913898, -0.22614382814800182, -0.019018628561273114, -0.04940369737508533, 0.21254064847848245, 0.01663794192731135, -0.006698139165694427, 0.18043343065265607, 0.22417773622801979, 0.08001362667821993, 0.05823681531518769, -0.24174506830148768, -0.051816331317960436, -0.1672181337910313, -0.13318235128810937, -0.17564447127681757, -0.036598105710204484, -0.06171387636877026, -0.10536113094057438, 0.37615455368503026, 0.1933825107836318, 0.1830086756809768, 0.023918047261419245, 0.36784166545903946, 0.05001765191567816, 0.08639751834498084, 0.06397459238695984, 0.24344372503960934, 0.016283566446253353, 0.1777509115537204, -0.15029028586510462, 0.12604128891105795, -0.039340494137902096]
1,803.0341
Spectroscopic and physical parameters of Galactic O-type stars. III. Mass discrepancy and rotational mixing
Massive stars play a key role in the evolution of the Universe. Our goal is to compare observed and predicted properties of single Galactic O stars to identify and constrain uncertain physical parameters and processes in stellar evolution and atmosphere models. We used a sample of 53 objects with spectral types from O3 to O9.7. For 30 of these, we determined the main photospheric and wind parameters, using optical spectroscopy and applying the FASTWIND code. For the remaining objects, literature data, obtained by means of the CMFGEN code, were used instead. The properties of our sample were compared to published predictions based on two grids evolution models that include rotationally induced mixing. Within each luminosity class, we find a close correlation of N surface abundance and luminosity, and a stronger N enrichment in more massive and evolved O stars. Additionally, a correlation of the surface nitrogen and helium abundances is observed. The large number of nitrogen-enriched stars above ~30 solar masses argues for rotationally induced mixing as the most likely explanation. However, none of the considered models can match the observed trends correctly, especially in the high mass regime. We confirm mass discrepancy for objects in the low mass O-star regime. We conclude that the rotationally induced mixing of helium to the stellar surface is too strong in some of the models. We also suggest that present inadequacies of the models to represent the N enrichment in more massive stars with relatively slow rotation might be related to problematic efficiencies of rotational mixing. We are left with a picture in which invoking binarity and magnetic fields is required to achieve a more complete agreement of the observed surface properties of a population of massive main- sequence stars with corresponding evolutionary models.
astro-ph.SR
massive stars play a key role in the evolution of the universe our goal is to compare observed and predicted properties of single galactic o stars to identify and constrain uncertain physical parameters and processes in stellar evolution and atmosphere models we used a sample of 53 objects with spectral types from o3 to o97 for 30 of these we determined the main photospheric and wind parameters using optical spectroscopy and applying the fastwind code for the remaining objects literature data obtained by means of the cmfgen code were used instead the properties of our sample were compared to published predictions based on two grids evolution models that include rotationally induced mixing within each luminosity class we find a close correlation of n surface abundance and luminosity and a stronger n enrichment in more massive and evolved o stars additionally a correlation of the surface nitrogen and helium abundances is observed the large number of nitrogenenriched stars above 30 solar masses argues for rotationally induced mixing as the most likely explanation however none of the considered models can match the observed trends correctly especially in the high mass regime we confirm mass discrepancy for objects in the low mass ostar regime we conclude that the rotationally induced mixing of helium to the stellar surface is too strong in some of the models we also suggest that present inadequacies of the models to represent the n enrichment in more massive stars with relatively slow rotation might be related to problematic efficiencies of rotational mixing we are left with a picture in which invoking binarity and magnetic fields is required to achieve a more complete agreement of the observed surface properties of a population of massive main sequence stars with corresponding evolutionary models
[['massive', 'stars', 'play', 'a', 'key', 'role', 'in', 'the', 'evolution', 'of', 'the', 'universe', 'our', 'goal', 'is', 'to', 'compare', 'observed', 'and', 'predicted', 'properties', 'of', 'single', 'galactic', 'o', 'stars', 'to', 'identify', 'and', 'constrain', 'uncertain', 'physical', 'parameters', 'and', 'processes', 'in', 'stellar', 'evolution', 'and', 'atmosphere', 'models', 'we', 'used', 'a', 'sample', 'of', '53', 'objects', 'with', 'spectral', 'types', 'from', 'o3', 'to', 'o97', 'for', '30', 'of', 'these', 'we', 'determined', 'the', 'main', 'photospheric', 'and', 'wind', 'parameters', 'using', 'optical', 'spectroscopy', 'and', 'applying', 'the', 'fastwind', 'code', 'for', 'the', 'remaining', 'objects', 'literature', 'data', 'obtained', 'by', 'means', 'of', 'the', 'cmfgen', 'code', 'were', 'used', 'instead', 'the', 'properties', 'of', 'our', 'sample', 'were', 'compared', 'to', 'published', 'predictions', 'based', 'on', 'two', 'grids', 'evolution', 'models', 'that', 'include', 'rotationally', 'induced', 'mixing', 'within', 'each', 'luminosity', 'class', 'we', 'find', 'a', 'close', 'correlation', 'of', 'n', 'surface', 'abundance', 'and', 'luminosity', 'and', 'a', 'stronger', 'n', 'enrichment', 'in', 'more', 'massive', 'and', 'evolved', 'o', 'stars', 'additionally', 'a', 'correlation', 'of', 'the', 'surface', 'nitrogen', 'and', 'helium', 'abundances', 'is', 'observed', 'the', 'large', 'number', 'of', 'nitrogenenriched', 'stars', 'above', '30', 'solar', 'masses', 'argues', 'for', 'rotationally', 'induced', 'mixing', 'as', 'the', 'most', 'likely', 'explanation', 'however', 'none', 'of', 'the', 'considered', 'models', 'can', 'match', 'the', 'observed', 'trends', 'correctly', 'especially', 'in', 'the', 'high', 'mass', 'regime', 'we', 'confirm', 'mass', 'discrepancy', 'for', 'objects', 'in', 'the', 'low', 'mass', 'ostar', 'regime', 'we', 'conclude', 'that', 'the', 'rotationally', 'induced', 'mixing', 'of', 'helium', 'to', 'the', 'stellar', 'surface', 'is', 'too', 'strong', 'in', 'some', 'of', 'the', 'models', 'we', 'also', 'suggest', 'that', 'present', 'inadequacies', 'of', 'the', 'models', 'to', 'represent', 'the', 'n', 'enrichment', 'in', 'more', 'massive', 'stars', 'with', 'relatively', 'slow', 'rotation', 'might', 'be', 'related', 'to', 'problematic', 'efficiencies', 'of', 'rotational', 'mixing', 'we', 'are', 'left', 'with', 'a', 'picture', 'in', 'which', 'invoking', 'binarity', 'and', 'magnetic', 'fields', 'is', 'required', 'to', 'achieve', 'a', 'more', 'complete', 'agreement', 'of', 'the', 'observed', 'surface', 'properties', 'of', 'a', 'population', 'of', 'massive', 'main', 'sequence', 'stars', 'with', 'corresponding', 'evolutionary', 'models']]
[-0.06100905728392396, 0.1484740363554773, -0.03599424922800402, 0.13221569667583094, -0.04341052371498095, -0.07931348349246167, 0.054942758786700074, 0.39796626882762026, -0.1755500983185202, -0.38853381400050985, 0.04374167881866027, -0.26162121994612914, -0.058325723128047645, 0.20046258292119323, -0.045897099396687555, 0.00712815150890589, 0.07642484695172175, -0.030229441347912823, -0.05647265479685515, -0.2405003678186435, 0.33725329657178055, 0.05575758124992917, 0.1690357150573962, -0.0324108884545824, 0.016135098473840998, -0.11674432474415737, -0.07278982043919183, -0.0015901277542651928, -0.12596903201406146, 0.09019164394753701, 0.20138448974874437, 0.13143226455519444, 0.18452652040676973, -0.3910642915604459, -0.22461557220603592, 0.07632515289023825, 0.17354180866850802, 0.09538919389323104, -0.09730708146185968, -0.20591888765090777, 0.08128709681600146, -0.15458222252158352, -0.1680772249760703, -0.0007700975472267551, 0.04245079900506129, 0.024532124698978187, -0.27217039334286913, 0.0913558876128104, 0.0419789128471766, 0.07820840558530026, -0.10869819040832676, -0.13595699269056105, -0.10798419132841514, 0.11424338926650789, 0.04232519792706491, 0.01934327804755509, 0.11743340372264743, -0.1328913585380475, -0.03310108852542335, 0.4150103940612467, -0.12140824455452628, -0.08498077954378065, 0.24402894733611277, -0.19312638388882644, -0.1704622267127754, 0.1209033304702209, 0.1683846476756826, 0.14912509725707554, -0.16415524279900356, 0.006040333686104441, -0.0005188025094095067, 0.18966122901929652, 0.03393679885657767, 0.04938416908347809, 0.2840865717839155, 0.15827502279391967, -0.026881292030692127, 0.06734544750826299, -0.16030735509946967, -0.07137170252214182, -0.24030718631335116, -0.12073713115494877, -0.10998110135671557, 0.058735374274965266, -0.10277897926813345, -0.13104579745571024, 0.34281483181525035, 0.15808628793026536, 0.2254617420124983, 0.02573351717443618, 0.25544681899846433, 0.09104473285874691, 0.09679047019249692, 0.11773902039392452, 0.28137159590816196, 0.21588449932145165, 0.0662010463916367, -0.2629546828190332, 0.10240899659117166, 0.0019297051788355732]
1,803.03411
Criterions for retrograde rotation of accreting black holes
Rotating supermassive black holes produce jets and their origin is connected to magnetic field that is generated by accreting matter flow. There is a point of view that electromagnetic fields around rotating black holes are brought to the hole by accretion. In this situation the prograde accreting disks produce weaker large-scale black hole threading magnetic fields, implying weaker jets that in retrograde regimes. The basic goal of this paper is to find the best candidates for retrograde accreting systems in observed active galactic nuclei. We show that active galactic nuclei with low Eddington ratio are really the best candidates for retrograde systems. This conclusion is obtained for kinetically dominated FRII radio galaxies, flat spectrum radio loud narrow line Seyfert I galaxies and a number of nearby galaxies. Our conclusion is that the best candidates for retrograde systems are the noticeable population of active galactic nuclei in the Universe. This result corresponds to the conclusion that in the merging process the interaction of merging black holes with a retrograde circumbinary disk is considerably more effective for shrinking the binary system.
astro-ph.GA astro-ph.HE
rotating supermassive black holes produce jets and their origin is connected to magnetic field that is generated by accreting matter flow there is a point of view that electromagnetic fields around rotating black holes are brought to the hole by accretion in this situation the prograde accreting disks produce weaker largescale black hole threading magnetic fields implying weaker jets that in retrograde regimes the basic goal of this paper is to find the best candidates for retrograde accreting systems in observed active galactic nuclei we show that active galactic nuclei with low eddington ratio are really the best candidates for retrograde systems this conclusion is obtained for kinetically dominated frii radio galaxies flat spectrum radio loud narrow line seyfert i galaxies and a number of nearby galaxies our conclusion is that the best candidates for retrograde systems are the noticeable population of active galactic nuclei in the universe this result corresponds to the conclusion that in the merging process the interaction of merging black holes with a retrograde circumbinary disk is considerably more effective for shrinking the binary system
[['rotating', 'supermassive', 'black', 'holes', 'produce', 'jets', 'and', 'their', 'origin', 'is', 'connected', 'to', 'magnetic', 'field', 'that', 'is', 'generated', 'by', 'accreting', 'matter', 'flow', 'there', 'is', 'a', 'point', 'of', 'view', 'that', 'electromagnetic', 'fields', 'around', 'rotating', 'black', 'holes', 'are', 'brought', 'to', 'the', 'hole', 'by', 'accretion', 'in', 'this', 'situation', 'the', 'prograde', 'accreting', 'disks', 'produce', 'weaker', 'largescale', 'black', 'hole', 'threading', 'magnetic', 'fields', 'implying', 'weaker', 'jets', 'that', 'in', 'retrograde', 'regimes', 'the', 'basic', 'goal', 'of', 'this', 'paper', 'is', 'to', 'find', 'the', 'best', 'candidates', 'for', 'retrograde', 'accreting', 'systems', 'in', 'observed', 'active', 'galactic', 'nuclei', 'we', 'show', 'that', 'active', 'galactic', 'nuclei', 'with', 'low', 'eddington', 'ratio', 'are', 'really', 'the', 'best', 'candidates', 'for', 'retrograde', 'systems', 'this', 'conclusion', 'is', 'obtained', 'for', 'kinetically', 'dominated', 'frii', 'radio', 'galaxies', 'flat', 'spectrum', 'radio', 'loud', 'narrow', 'line', 'seyfert', 'i', 'galaxies', 'and', 'a', 'number', 'of', 'nearby', 'galaxies', 'our', 'conclusion', 'is', 'that', 'the', 'best', 'candidates', 'for', 'retrograde', 'systems', 'are', 'the', 'noticeable', 'population', 'of', 'active', 'galactic', 'nuclei', 'in', 'the', 'universe', 'this', 'result', 'corresponds', 'to', 'the', 'conclusion', 'that', 'in', 'the', 'merging', 'process', 'the', 'interaction', 'of', 'merging', 'black', 'holes', 'with', 'a', 'retrograde', 'circumbinary', 'disk', 'is', 'considerably', 'more', 'effective', 'for', 'shrinking', 'the', 'binary', 'system']]
[-0.1535019280214003, 0.1364597659480014, -0.024080369897270002, 0.15900708650544362, -0.12246288808827502, -0.11515514708420667, 0.023933500879412966, 0.39761519195595185, -0.11807887527998016, -0.3191172698500967, 0.012697651903613279, -0.29750077365656963, -0.04493800434674131, 0.22928970120326933, -0.03390268748756186, -0.051222568887738545, 0.01818209340244365, -0.07395575366336749, -0.0035617758010061426, -0.2331975220329279, 0.34446885362891844, 0.10440652970973839, 0.15494232514727466, -0.12223931502904639, 0.04803591478595187, -0.0911031913248999, 0.019000194745668986, 0.0006942487433656801, -0.10349827558288348, 0.026877925653197913, 0.27914622025180597, 0.11041041246521698, 0.2178048590910634, -0.36525519376402127, -0.20481566504923907, 0.09633460270491943, 0.21992798053006532, 0.09128657364278027, -0.1617438234614017, -0.24510841777446737, 0.12358957531880821, -0.21894523162165833, -0.18661413349565015, 0.044776554037322544, 0.09412566731441974, 0.012347573232342745, -0.19523086617362564, 0.13461358681520808, 0.14507881910852338, -0.009780355427393366, -0.14844069512321628, -0.034834997334996204, -0.07201059457752333, 0.05225540788105413, 0.14513728779453822, 0.09156027342083567, 0.2746663796351234, -0.131391027966028, -0.09691885305963997, 0.3855657143148921, -0.008681005646094846, -0.05181243989418922, 0.2472563734975274, -0.27978348274267795, -0.16220454499385625, 0.17898884548431043, 0.1745942744215711, 0.17881491433766633, -0.12254174879372286, 0.0007083238404590179, -0.06718288936493554, 0.19603179917132935, 0.02372043033900499, 0.04727378986286801, 0.4412319413776504, 0.12970603415326282, 0.037514673460758804, 0.12228061667742343, -0.14607491587189822, -0.0664544878917741, -0.19658700153803943, -0.0791526090759555, -0.13365948914261483, 0.10584351795402944, -0.13153436512326336, -0.12377022237480519, 0.2898391181897039, 0.07339342924969157, 0.21066681801747303, -0.006894202832673681, 0.31019917681782594, 0.04183454163354306, 0.05409390232577795, 0.20686639666293263, 0.43008162170731823, 0.1631277231941801, 0.10237630050988379, -0.21746639694300526, 0.016721143280598205, 0.024595695802702586]
1,803.03412
Structure Stability and Electronic Property for Alkaline-Earth Metals Induced Si(111)-3x2 Surfaces
Structural stability and electronic properties of alkaline-earth metals (Ca, Sr, Ba) induced Si(111)-3x2 surfaces have been comprehensively studied by means of ab initio calculations. Adsorption energy and charge density difference calculations show the high structural stability due to the strong chemical bonding. Analysis of electronic band structures and band-decomposed charge density distributions indicates that the third valence band is deriving from top Si and metal atoms, while the top most two valence bands are deriving from the bulk silicon. These results suggest a larger surface band gap of 1.65-1.68 eV, which is good consistent with the recent experimental finding for Sr/Si(111)-3x2 surface. These results reveal a natural explanation for the relevant experimental observation and stimulate further experimental and theoretical exploration on the surface science.
cond-mat.mtrl-sci
structural stability and electronic properties of alkalineearth metals ca sr ba induced si1113x2 surfaces have been comprehensively studied by means of ab initio calculations adsorption energy and charge density difference calculations show the high structural stability due to the strong chemical bonding analysis of electronic band structures and banddecomposed charge density distributions indicates that the third valence band is deriving from top si and metal atoms while the top most two valence bands are deriving from the bulk silicon these results suggest a larger surface band gap of 165168 ev which is good consistent with the recent experimental finding for srsi1113x2 surface these results reveal a natural explanation for the relevant experimental observation and stimulate further experimental and theoretical exploration on the surface science
[['structural', 'stability', 'and', 'electronic', 'properties', 'of', 'alkalineearth', 'metals', 'ca', 'sr', 'ba', 'induced', 'si1113x2', 'surfaces', 'have', 'been', 'comprehensively', 'studied', 'by', 'means', 'of', 'ab', 'initio', 'calculations', 'adsorption', 'energy', 'and', 'charge', 'density', 'difference', 'calculations', 'show', 'the', 'high', 'structural', 'stability', 'due', 'to', 'the', 'strong', 'chemical', 'bonding', 'analysis', 'of', 'electronic', 'band', 'structures', 'and', 'banddecomposed', 'charge', 'density', 'distributions', 'indicates', 'that', 'the', 'third', 'valence', 'band', 'is', 'deriving', 'from', 'top', 'si', 'and', 'metal', 'atoms', 'while', 'the', 'top', 'most', 'two', 'valence', 'bands', 'are', 'deriving', 'from', 'the', 'bulk', 'silicon', 'these', 'results', 'suggest', 'a', 'larger', 'surface', 'band', 'gap', 'of', '165168', 'ev', 'which', 'is', 'good', 'consistent', 'with', 'the', 'recent', 'experimental', 'finding', 'for', 'srsi1113x2', 'surface', 'these', 'results', 'reveal', 'a', 'natural', 'explanation', 'for', 'the', 'relevant', 'experimental', 'observation', 'and', 'stimulate', 'further', 'experimental', 'and', 'theoretical', 'exploration', 'on', 'the', 'surface', 'science']]
[-0.07530249140230201, 0.13609538547073802, -0.0353827814416339, 0.040361836321729544, -0.0028020306800802548, -0.11804969871494299, 0.13688500470792253, 0.4273616414827605, -0.2410649828738921, -0.3512630986981094, -0.015627430860574047, -0.3463133583776653, -0.15251534165387662, 0.15359044931052873, 0.062179659974450865, 0.035551592619352354, 0.07166403701218466, -0.09294637940862836, -0.1304194244303896, -0.1604888018853065, 0.27478730872486873, 0.08666283419976632, 0.32881642136101924, 0.16382428801152854, -0.05733265921783944, -0.03449691403269147, 0.004699138086289167, 0.041100885913086437, -0.16797955267666112, 0.18169697216556718, 0.25147059103279995, -0.04348296974688613, 0.18844450933393092, -0.47378734361069896, -0.25486203191491463, -0.0290890568944936, 0.04403495872781302, 0.1340494955171986, -0.128845194002497, -0.27405434075820573, 0.0888452388632383, -0.11008199551918854, -0.09166692293947562, -0.11525017958386646, 0.010715175967197866, 0.0334733557261643, -0.20693079790022845, 0.07440830779960379, 0.013579557828294734, 0.11395845018450927, -0.14299000921697977, -0.23643621536126982, -0.1457532545357632, 0.052227941590050855, 0.03866524629217262, 0.006592676309325422, 0.16604407595392937, -0.07649661907926202, -0.07704208334519838, 0.4105129721496875, -0.04261362172740822, -0.054315583089676996, 0.2206116614145382, -0.1714255420685125, -0.10005680948476463, 0.16595926566127067, 0.07950777668350686, 0.07962359168935412, -0.11342597145897647, 0.09297508629679214, 0.003962921964315077, 0.19204653942336639, 0.04443811745926117, 0.09994576219469309, 0.2562800690531731, 0.20404508633849522, 0.03833713973290287, 0.0446647491112041, -0.12569992559438106, -0.07107828998268814, -0.22016916149295868, -0.19570964034889282, -0.2051732466245691, 0.013786904827187148, -0.060192472610166685, -0.15780616174452006, 0.41136530741350724, 0.09609974018336895, 0.17767027686350048, -0.06585165328870062, 0.21658625462829756, 0.08272766949473104, 0.020870907736631732, 0.026103267240493246, 0.28848439058832204, 0.17538035016429301, 0.04600113382912241, -0.26855668471155997, 0.09204338128426268, 0.006399617999947319]
1,803.03413
Nonlocal time porous medium equation with fractional time derivative
We consider nonlinear nonlocal diffusive evolution equations, governed by fractional Laplace-type operators, fractional time derivative and involving porous medium type nonlinearities. Existence and uniqueness of weak solutions are established using approximating solutions and the theory of maximal monotone operators. Using the De Giorgi-Nash-Moser technique, we prove that the solutions are bounded and H\"{o}lder continuous for all positive time.
math.AP
we consider nonlinear nonlocal diffusive evolution equations governed by fractional laplacetype operators fractional time derivative and involving porous medium type nonlinearities existence and uniqueness of weak solutions are established using approximating solutions and the theory of maximal monotone operators using the de giorginashmoser technique we prove that the solutions are bounded and holder continuous for all positive time
[['we', 'consider', 'nonlinear', 'nonlocal', 'diffusive', 'evolution', 'equations', 'governed', 'by', 'fractional', 'laplacetype', 'operators', 'fractional', 'time', 'derivative', 'and', 'involving', 'porous', 'medium', 'type', 'nonlinearities', 'existence', 'and', 'uniqueness', 'of', 'weak', 'solutions', 'are', 'established', 'using', 'approximating', 'solutions', 'and', 'the', 'theory', 'of', 'maximal', 'monotone', 'operators', 'using', 'the', 'de', 'giorginashmoser', 'technique', 'we', 'prove', 'that', 'the', 'solutions', 'are', 'bounded', 'and', 'holder', 'continuous', 'for', 'all', 'positive', 'time']]
[-0.16462903605485013, 0.08962708604843195, -0.021444875455927104, 0.09082919136412314, -0.10848763600345059, -0.1646419590146377, -0.05950921684993302, 0.28687667069507056, -0.3244558559923336, -0.17740598662981186, 0.19400723158092847, -0.32035189378878165, -0.15765348863627376, 0.18421127123693967, -0.0016874645270632002, 0.1598469156667526, -0.014843233957372862, -0.07096290806757993, -0.08212281937373737, -0.18280181578151752, 0.4308581762096106, -0.1451043550663724, 0.18685105272793565, 0.02746782503251372, 0.1725366330416552, -0.01723732572081017, -0.08314535191186287, 0.050305388129219926, -0.2070501354922679, 0.08034102466551522, 0.21892218339128483, 0.03627580174260998, 0.32172444077401324, -0.4790061053274007, -0.24444996438727812, 0.18361034550993094, 0.09604625672037745, 0.04481676413581289, -0.07682275152684928, -0.3358666292102686, 0.06645166385388965, -0.08115721795836399, -0.24625277036704638, -0.11056949416625089, 0.025440873357403124, 0.1522534750080828, -0.31306122574184475, 0.21032852701971244, 0.08084704156900788, -0.022729987969043953, -0.18528737664094258, -0.054100210152181055, -0.04557131266157175, 0.032220622580819605, 0.003390923786731758, -0.06434494905888327, 0.01949363477239064, -0.10197577002490389, -0.12638700307057849, 0.27054872211261555, -0.18291642906240604, -0.29145565172978516, 0.15153803684395448, -0.1634668918599471, -0.07497831024550672, 0.09521066585458701, 0.1364983855104395, 0.24061889586777524, -0.1705773468932201, 0.19656772069745407, -0.022849868107908244, 0.1175342276050099, 0.1458978397322112, 0.08147226281239298, 0.019931783337659877, 0.10055788779823945, 0.1759227365094783, 0.09774330653378675, 0.07526019961444726, -0.16305682520735368, -0.365922498548853, -0.13475000326409295, -0.12768575947547076, 0.1143647625817564, -0.14918531836231302, -0.2040085468826623, 0.349954335725513, 0.07020272203753221, 0.058168049965953005, 0.1402611116525428, 0.1564977945567205, 0.27798265670747335, -0.040453934287331225, 0.08911875104692218, 0.18223435907415916, 0.18445717248310944, 0.19055397931390025, -0.2459043893031776, 0.048696307921059556, 0.2477292252535398]
1,803.03414
Noisy quantum state redistribution with promise and the Alpha-bit
We consider a variation of the well-studied quantum state redistribution task, in which the starting state is known only to the receiver Bob and not to the sender Alice. We refer to this as quantum state redistribution with a one-sided promise. In addition, we consider communication from Alice to Bob over a noisy channel $\mathcal{N}$, instead of the noiseless channel, as is usually considered in state redistribution. We take a natural approach towards the solution of this problem where we "embed" the promise as part of the state and then invoke known protocols for quantum state redistribution composed with known protocols for transfer of quantum information over noisy channels. Using our approach, we are able to reproduce the Alpha-bit capacities with or without entanglement assistance in Ref. [ArXiv:1706.09434], using known protocols for quantum state redistribution and quantum communication over noisy channels. Furthermore, we generalize the entanglement assisted classical Alpha-bit capacity, showing that any quantum state redistribution protocol can be used as a black box to simulate classical communication.
quant-ph
we consider a variation of the wellstudied quantum state redistribution task in which the starting state is known only to the receiver bob and not to the sender alice we refer to this as quantum state redistribution with a onesided promise in addition we consider communication from alice to bob over a noisy channel mathcaln instead of the noiseless channel as is usually considered in state redistribution we take a natural approach towards the solution of this problem where we embed the promise as part of the state and then invoke known protocols for quantum state redistribution composed with known protocols for transfer of quantum information over noisy channels using our approach we are able to reproduce the alphabit capacities with or without entanglement assistance in ref arxiv170609434 using known protocols for quantum state redistribution and quantum communication over noisy channels furthermore we generalize the entanglement assisted classical alphabit capacity showing that any quantum state redistribution protocol can be used as a black box to simulate classical communication
[['we', 'consider', 'a', 'variation', 'of', 'the', 'wellstudied', 'quantum', 'state', 'redistribution', 'task', 'in', 'which', 'the', 'starting', 'state', 'is', 'known', 'only', 'to', 'the', 'receiver', 'bob', 'and', 'not', 'to', 'the', 'sender', 'alice', 'we', 'refer', 'to', 'this', 'as', 'quantum', 'state', 'redistribution', 'with', 'a', 'onesided', 'promise', 'in', 'addition', 'we', 'consider', 'communication', 'from', 'alice', 'to', 'bob', 'over', 'a', 'noisy', 'channel', 'mathcaln', 'instead', 'of', 'the', 'noiseless', 'channel', 'as', 'is', 'usually', 'considered', 'in', 'state', 'redistribution', 'we', 'take', 'a', 'natural', 'approach', 'towards', 'the', 'solution', 'of', 'this', 'problem', 'where', 'we', 'embed', 'the', 'promise', 'as', 'part', 'of', 'the', 'state', 'and', 'then', 'invoke', 'known', 'protocols', 'for', 'quantum', 'state', 'redistribution', 'composed', 'with', 'known', 'protocols', 'for', 'transfer', 'of', 'quantum', 'information', 'over', 'noisy', 'channels', 'using', 'our', 'approach', 'we', 'are', 'able', 'to', 'reproduce', 'the', 'alphabit', 'capacities', 'with', 'or', 'without', 'entanglement', 'assistance', 'in', 'ref', 'arxiv170609434', 'using', 'known', 'protocols', 'for', 'quantum', 'state', 'redistribution', 'and', 'quantum', 'communication', 'over', 'noisy', 'channels', 'furthermore', 'we', 'generalize', 'the', 'entanglement', 'assisted', 'classical', 'alphabit', 'capacity', 'showing', 'that', 'any', 'quantum', 'state', 'redistribution', 'protocol', 'can', 'be', 'used', 'as', 'a', 'black', 'box', 'to', 'simulate', 'classical', 'communication']]
[-0.12825100826138552, 0.11405134742415907, -0.07283627941736026, 0.03516798902548359, -0.02035004723416976, -0.25372010483657437, 0.09268152437306673, 0.35786781716578736, -0.2945621534066643, -0.27199893294203425, 0.08311481980891329, -0.26378636812640655, -0.10036847092794891, 0.18044528757880057, -0.10714411502944741, 0.09524787101102714, 0.07208167144772179, 0.07874411904994777, -0.021128316455894334, -0.24068225331152762, 0.3257559837416528, 0.0321304731253635, 0.2595689584846848, 0.02424967183151511, 0.08974689212530115, 0.06700249283412794, 0.04152874857282077, -0.025797942664451942, -0.10611912380496331, 0.05342049144897164, 0.2978733763360826, 0.14134054621235428, 0.2439658055583874, -0.4350713244722989, -0.287353765526173, 0.12748943201494878, 0.12711958972246437, 0.1912654018396244, -0.05010359810977549, -0.2949002448380172, 0.05277717387802832, -0.23649751611923922, -0.03312800526842029, -0.04849261455907079, -0.04618581146710067, -0.04380153431863842, -0.289644879913571, 0.0772112713747485, 0.055851465448023316, -0.007546387997617621, -0.030691748838049142, -0.03972411560575048, 0.03499485684062416, 0.21931008370537422, -0.08683683871274847, 0.02295015686230656, 0.10241168242193267, -0.13608661859190305, -0.1845047674560083, 0.3477871514477594, -0.037939371315979895, -0.21067415952437116, 0.18177663119479143, -0.09235455708377464, -0.0803601744383975, 0.056149892341680156, 0.15367752027246143, 0.10555807481001238, -0.11671739796031556, 0.030680836676438703, -0.03216941025621163, 0.20028905168978753, 0.03313045509153988, 0.1466112659636238, 0.15102933513413289, 0.0749296391393967, 0.09730996029774942, 0.20927238931062403, -0.07966569956659736, -0.2166773968872553, -0.2951676155033404, -0.208381129333939, -0.24961031487624266, 0.13000271995253876, 0.015766556342923597, -0.0932146399602584, 0.3291358184376118, 0.15118750284529084, 0.17864523744099065, 0.04648686673361139, 0.3373343913319582, 0.07078002000152284, 0.041923007793992224, 0.13769136772603968, 0.21556727783154964, 0.1506012267848577, 0.12440149946776805, -0.21417913519816395, 0.09233504341647564, -0.010841687182020285]
1,803.03415
Fusing Hierarchical Convolutional Features for Human Body Segmentation and Clothing Fashion Classification
The clothing fashion reflects the common aesthetics that people share with each other in dressing. To recognize the fashion time of a clothing is meaningful for both an individual and the industry. In this paper, under the assumption that the clothing fashion changes year by year, the fashion-time recognition problem is mapped into a clothing-fashion classification problem. Specifically, a novel deep neural network is proposed which achieves accurate human body segmentation by fusing multi-scale convolutional features in a fully convolutional network, and then feature learning and fashion classification are performed on the segmented parts avoiding the influence of image background. In the experiments, 9,339 fashion images from 8 continuous years are collected for performance evaluation. The results demonstrate the effectiveness of the proposed body segmentation and fashion classification methods.
cs.CV
the clothing fashion reflects the common aesthetics that people share with each other in dressing to recognize the fashion time of a clothing is meaningful for both an individual and the industry in this paper under the assumption that the clothing fashion changes year by year the fashiontime recognition problem is mapped into a clothingfashion classification problem specifically a novel deep neural network is proposed which achieves accurate human body segmentation by fusing multiscale convolutional features in a fully convolutional network and then feature learning and fashion classification are performed on the segmented parts avoiding the influence of image background in the experiments 9339 fashion images from 8 continuous years are collected for performance evaluation the results demonstrate the effectiveness of the proposed body segmentation and fashion classification methods
[['the', 'clothing', 'fashion', 'reflects', 'the', 'common', 'aesthetics', 'that', 'people', 'share', 'with', 'each', 'other', 'in', 'dressing', 'to', 'recognize', 'the', 'fashion', 'time', 'of', 'a', 'clothing', 'is', 'meaningful', 'for', 'both', 'an', 'individual', 'and', 'the', 'industry', 'in', 'this', 'paper', 'under', 'the', 'assumption', 'that', 'the', 'clothing', 'fashion', 'changes', 'year', 'by', 'year', 'the', 'fashiontime', 'recognition', 'problem', 'is', 'mapped', 'into', 'a', 'clothingfashion', 'classification', 'problem', 'specifically', 'a', 'novel', 'deep', 'neural', 'network', 'is', 'proposed', 'which', 'achieves', 'accurate', 'human', 'body', 'segmentation', 'by', 'fusing', 'multiscale', 'convolutional', 'features', 'in', 'a', 'fully', 'convolutional', 'network', 'and', 'then', 'feature', 'learning', 'and', 'fashion', 'classification', 'are', 'performed', 'on', 'the', 'segmented', 'parts', 'avoiding', 'the', 'influence', 'of', 'image', 'background', 'in', 'the', 'experiments', '9339', 'fashion', 'images', 'from', '8', 'continuous', 'years', 'are', 'collected', 'for', 'performance', 'evaluation', 'the', 'results', 'demonstrate', 'the', 'effectiveness', 'of', 'the', 'proposed', 'body', 'segmentation', 'and', 'fashion', 'classification', 'methods']]
[-0.03868238224822562, -0.006282408487891189, -0.08405219443011447, -0.014082869323829073, -0.07594294091541087, -0.1493170003814157, -0.01856935317209718, 0.47046991894603707, -0.2493595006671967, -0.33281856405665167, 0.07257632237815415, -0.3151883031678153, -0.22508480616670568, 0.1673513796813495, -0.16282748800585978, 0.06654318377331947, 0.18146517298009712, 0.07488200580610282, -0.06337993983470369, -0.3038786286406321, 0.30040866166928026, 0.016542355098636108, 0.3726469091780018, -0.007911769791917322, 0.13807613123572082, -0.015056453862484886, -0.06654674406308914, -0.0054139599542395445, -0.00534332058361997, 0.20015666450632352, 0.3191931935289176, 0.17577737472493027, 0.3239706577260222, -0.41735595870704856, -0.22171060266919085, 0.051425586847472005, 0.1374865118159505, 0.07450817473272764, -0.058810881234421686, -0.38621589934336953, 0.08296032089310756, -0.15423493168964342, 0.03884290343921748, -0.11085908768563968, 0.00946687028499582, -0.07927739959632163, -0.270390936622789, 0.050365998131383094, 0.07398806513992895, 0.07601081280154176, -0.09147268772812822, -0.0625564345427847, 0.023186015598184895, 0.22841892748692771, 0.035326161229022546, 0.058888953342830064, 0.17835023181760334, -0.2054496219043358, -0.13087801938763732, 0.3696451758441981, -0.01755866951589269, -0.20628732731711352, 0.18261078757495852, -0.03527008392120479, -0.12883018690990866, 0.11217194845812628, 0.23828784974739392, 0.11362883343463182, -0.20323321218893398, -0.021050082536021364, -0.09664766470086761, 0.18713553615748424, 0.08991450213034113, -0.044639157960773446, 0.2033790006516938, 0.2798144470943953, 0.018905270268987806, 0.14964099645339957, -0.14775219051625754, -0.03938669365743408, -0.20832325094670523, -0.07611105727926315, -0.15739864387796842, -0.06219549864908913, -0.08652134913745613, -0.11967042931792093, 0.45513377123279497, 0.1853740590668167, 0.22655687299993588, 0.1058646378451158, 0.3528588896697329, 0.014366164899911382, 0.12269350098176801, 0.07151929975952953, 0.1742633315107014, -0.038079480673332, 0.14850056244677035, -0.16264216740000847, 0.09244775745901279, 0.0927557923259883]
1,803.03416
Spin transport across antiferromagnets induced by the spin Seebeck effect
For prospective spintronics devices based on the propagation of pure spin currents, antiferromagnets are an interesting class of materials that potentially entail a number of advantages as compared to ferromagnets. Here, we present a detailed theoretical study of magnonic spin current transport in ferromagnetic-antiferromagnetic multilayers by using atomistic spin dynamics simulations. The relevant length scales of magnonic spin transport in antiferromagnets are determined. We demonstrate the transfer of angular momentum from a ferromagnet into an antiferromagnet due to the excitation of only one magnon branch in the antiferromagnet. As an experimental system, we ascertain the transport across an antiferromagnet in YIG$|$Ir$_{20}$Mn$_{80}|$Pt heterostructures. We determine the spin transport signals for spin currents generated in the YIG by the spin Seebeck effect and compare to measurements of the spin Hall magnetoresistance in the heterostructure stack. By means of temperature-dependent and thickness-dependent measurements, we deduce conclusions on the spin transport mechanism across IrMn and furthermore correlate it to its paramagnetic-antiferromagnetic phase transition.
cond-mat.mtrl-sci
for prospective spintronics devices based on the propagation of pure spin currents antiferromagnets are an interesting class of materials that potentially entail a number of advantages as compared to ferromagnets here we present a detailed theoretical study of magnonic spin current transport in ferromagneticantiferromagnetic multilayers by using atomistic spin dynamics simulations the relevant length scales of magnonic spin transport in antiferromagnets are determined we demonstrate the transfer of angular momentum from a ferromagnet into an antiferromagnet due to the excitation of only one magnon branch in the antiferromagnet as an experimental system we ascertain the transport across an antiferromagnet in yigir_20mn_80pt heterostructures we determine the spin transport signals for spin currents generated in the yig by the spin seebeck effect and compare to measurements of the spin hall magnetoresistance in the heterostructure stack by means of temperaturedependent and thicknessdependent measurements we deduce conclusions on the spin transport mechanism across irmn and furthermore correlate it to its paramagneticantiferromagnetic phase transition
[['for', 'prospective', 'spintronics', 'devices', 'based', 'on', 'the', 'propagation', 'of', 'pure', 'spin', 'currents', 'antiferromagnets', 'are', 'an', 'interesting', 'class', 'of', 'materials', 'that', 'potentially', 'entail', 'a', 'number', 'of', 'advantages', 'as', 'compared', 'to', 'ferromagnets', 'here', 'we', 'present', 'a', 'detailed', 'theoretical', 'study', 'of', 'magnonic', 'spin', 'current', 'transport', 'in', 'ferromagneticantiferromagnetic', 'multilayers', 'by', 'using', 'atomistic', 'spin', 'dynamics', 'simulations', 'the', 'relevant', 'length', 'scales', 'of', 'magnonic', 'spin', 'transport', 'in', 'antiferromagnets', 'are', 'determined', 'we', 'demonstrate', 'the', 'transfer', 'of', 'angular', 'momentum', 'from', 'a', 'ferromagnet', 'into', 'an', 'antiferromagnet', 'due', 'to', 'the', 'excitation', 'of', 'only', 'one', 'magnon', 'branch', 'in', 'the', 'antiferromagnet', 'as', 'an', 'experimental', 'system', 'we', 'ascertain', 'the', 'transport', 'across', 'an', 'antiferromagnet', 'in', 'yigir_20mn_80pt', 'heterostructures', 'we', 'determine', 'the', 'spin', 'transport', 'signals', 'for', 'spin', 'currents', 'generated', 'in', 'the', 'yig', 'by', 'the', 'spin', 'seebeck', 'effect', 'and', 'compare', 'to', 'measurements', 'of', 'the', 'spin', 'hall', 'magnetoresistance', 'in', 'the', 'heterostructure', 'stack', 'by', 'means', 'of', 'temperaturedependent', 'and', 'thicknessdependent', 'measurements', 'we', 'deduce', 'conclusions', 'on', 'the', 'spin', 'transport', 'mechanism', 'across', 'irmn', 'and', 'furthermore', 'correlate', 'it', 'to', 'its', 'paramagneticantiferromagnetic', 'phase', 'transition']]
[-0.19018293937440564, 0.19324459119849677, -0.026447904990262287, -0.002091733749161006, -0.06524504603711283, -0.10163573045164916, 0.04304073734511473, 0.4254763627092645, -0.2911295055120347, -0.26667007946877913, 0.028148340294137597, -0.3370346560433602, -0.10609976111490066, 0.2797535169323918, 0.0911030860552505, 0.024476621412319148, -0.0386157014724579, -0.06269509219386538, -0.08673832107448037, -0.15465809391354726, 0.25921328654690723, -0.004774385478917011, 0.3129066022893022, 0.09755665663285715, 0.09646278023823597, 0.023663677643705753, 0.11896708096336027, 0.012041302919862377, -0.17743362046083602, 0.04197313220115604, 0.2344383464334236, -0.1318148926173331, 0.11496541163569708, -0.5032027485738894, -0.2098695778548955, -0.02481317259134001, 0.14237181539795582, 0.20006539275318053, -0.06408030743459328, -0.25763492309933256, 0.0461373434099517, -0.19645003841857717, -0.07670485699439204, -0.14432327437457765, -0.02274735893010144, -0.02650711251864696, -0.21860742635408026, 0.09924277560607453, 0.09555450652482783, 0.11647460877800443, -0.08322265251158888, -0.15431901721423194, -0.10366658358033864, 0.07186187272906232, 0.06351716996164648, 0.011810833708365347, 0.16859349216020125, -0.14858344346462826, -0.2276757362500355, 0.3186419737246481, -0.048583820893037706, -0.1541601157290075, 0.12099395725864229, -0.2077529859426209, -0.048565335533949455, 0.09455735504532316, 0.16840130413043058, 0.12158209533922991, -0.157725473646383, 0.0408313061680888, -0.016687601767658333, 0.14148715595198666, -0.021026187926341013, 0.11063998755235166, 0.3174756759670889, 0.22824434155693193, 0.0377397119293025, 0.16556800951718526, -0.14980700253479326, -0.05704459893238393, -0.19525489280746278, -0.19663262349452562, -0.28489410279134797, 0.12400622434831064, -0.06080168475158539, -0.16511918803688827, 0.43508858153015184, 0.24997035056578032, 0.15384976875487785, -0.04158503570553852, 0.258393658387362, 0.09307899396083537, 0.0701505109685574, 0.02602853237467397, 0.2358476747491747, 0.23280017250766208, 0.1418137228780776, -0.3502454044442671, 0.08509925336081677, -0.02348672393946701]
1,803.03417
Clocked Definitions in HOL
Many potentially non-terminating functions cannot be directly defined in a logic of total functions, such as HOL. A well-known solution to this is to define non-terminating functions using a clock that forces termination at a certain depth of evaluation. Such clocked definitions are often frowned upon and avoided, since the clock is perceived as extra clutter. In this short paper, we explain that there are different ways to add a clock, some less intrusive than others. Our contribution is a technique by which termination proofs are kept simple even when minimising the use of the clock mechanism. Our examples are definitions of semantic interpreters for programming languages, so called functional big-step semantics.
cs.LO
many potentially nonterminating functions cannot be directly defined in a logic of total functions such as hol a wellknown solution to this is to define nonterminating functions using a clock that forces termination at a certain depth of evaluation such clocked definitions are often frowned upon and avoided since the clock is perceived as extra clutter in this short paper we explain that there are different ways to add a clock some less intrusive than others our contribution is a technique by which termination proofs are kept simple even when minimising the use of the clock mechanism our examples are definitions of semantic interpreters for programming languages so called functional bigstep semantics
[['many', 'potentially', 'nonterminating', 'functions', 'can', 'not', 'be', 'directly', 'defined', 'in', 'a', 'logic', 'of', 'total', 'functions', 'such', 'as', 'hol', 'a', 'wellknown', 'solution', 'to', 'this', 'is', 'to', 'define', 'nonterminating', 'functions', 'using', 'a', 'clock', 'that', 'forces', 'termination', 'at', 'a', 'certain', 'depth', 'of', 'evaluation', 'such', 'clocked', 'definitions', 'are', 'often', 'frowned', 'upon', 'and', 'avoided', 'since', 'the', 'clock', 'is', 'perceived', 'as', 'extra', 'clutter', 'in', 'this', 'short', 'paper', 'we', 'explain', 'that', 'there', 'are', 'different', 'ways', 'to', 'add', 'a', 'clock', 'some', 'less', 'intrusive', 'than', 'others', 'our', 'contribution', 'is', 'a', 'technique', 'by', 'which', 'termination', 'proofs', 'are', 'kept', 'simple', 'even', 'when', 'minimising', 'the', 'use', 'of', 'the', 'clock', 'mechanism', 'our', 'examples', 'are', 'definitions', 'of', 'semantic', 'interpreters', 'for', 'programming', 'languages', 'so', 'called', 'functional', 'bigstep', 'semantics']]
[-0.10971079509545234, 0.11597644955950923, -0.08935194118696797, 0.12557226352613984, -0.12793663021044008, -0.1800023535449457, 0.08186134272857869, 0.3875644886450443, -0.3170826852853809, -0.30511213719312635, 0.10425307061814237, -0.2506140600889921, -0.14841317007085308, 0.20985276666137256, -0.1479250315127761, 0.018371041634444345, 0.033885472936422696, 0.040668383103496, -0.05266640456102323, -0.2238483681503567, 0.28087492326241253, 0.019314144991637607, 0.19117111069083745, 0.04878495880984701, 0.08535831488552503, -0.02795416162033299, -0.004013711782006014, 0.03928683365146363, -0.041356704524072745, 0.10976065862009168, 0.31171901242799194, 0.21795163238753698, 0.3184901632568134, -0.4464096213591152, -0.1700681536375279, 0.0918364475697412, 0.09552878705185971, 0.13097761125624988, 0.005798026191769168, -0.2604182743151406, 0.09391249120900673, -0.2007698266721231, -0.06369253712390284, -0.11831378472769367, 0.023071634233929217, 0.04168702589127601, -0.2193225031660404, -0.036991665576351807, 0.1189582652545401, 0.09120921292508553, -0.016185337561182678, -0.08773535634307857, 0.01808077485683108, 0.08802389422453416, 0.026381893966962316, 0.05039084993560599, 0.1261016225325875, -0.08338796105817892, -0.15174614397359878, 0.3770985915242428, -0.03602600029742981, -0.25027144176419824, 0.22777581844534975, -0.03781927070771677, -0.15825941106803448, 0.07880605057081473, 0.09822202131285199, 0.12836169474446382, -0.17474819567477035, 0.04786782060598073, -0.009151857587442334, 0.21123987877009703, 0.14984105080865057, 0.0770522308386197, 0.1910764257190749, 0.12727965061744076, 0.06535174207809698, 0.13917825866935477, 0.04071201731234656, -0.08097771451243066, -0.33538901412040495, -0.15260000931032533, -0.13747441229809607, -0.007771090294487034, -0.07181195395436848, -0.2052613994393531, 0.3596828780802233, 0.18158263888991705, 0.1571367108845152, 0.12391735296789973, 0.36001599416444413, 0.14071514540981817, 0.1404758874518198, 0.05136750492342149, 0.16602779579495422, 0.04109302142751403, 0.08475658809766173, -0.12851317131571705, 0.15610956772746118, 0.09409674740787263]
1,803.03418
Crossed modules of monoids I. Relative categories
This is the first part of a series of three strongly related papers in which three equivalent structures are studied: - internal categories in categories of monoids; defined in terms of pullbacks relative to a chosen class of spans - crossed modules of monoids relative to this class of spans - simplicial monoids of so-called Moore length 1 relative to this class of spans. The most important examples of monoids that are covered are small categories (treated as monoids in categories of spans) and bimonoids in symmetric monoidal categories (regarded as monoids in categories of comonoids). In this first part the theory of relative pullbacks is worked out leading to the definition of a relative category.
math.CT math.QA
this is the first part of a series of three strongly related papers in which three equivalent structures are studied internal categories in categories of monoids defined in terms of pullbacks relative to a chosen class of spans crossed modules of monoids relative to this class of spans simplicial monoids of socalled moore length 1 relative to this class of spans the most important examples of monoids that are covered are small categories treated as monoids in categories of spans and bimonoids in symmetric monoidal categories regarded as monoids in categories of comonoids in this first part the theory of relative pullbacks is worked out leading to the definition of a relative category
[['this', 'is', 'the', 'first', 'part', 'of', 'a', 'series', 'of', 'three', 'strongly', 'related', 'papers', 'in', 'which', 'three', 'equivalent', 'structures', 'are', 'studied', 'internal', 'categories', 'in', 'categories', 'of', 'monoids', 'defined', 'in', 'terms', 'of', 'pullbacks', 'relative', 'to', 'a', 'chosen', 'class', 'of', 'spans', 'crossed', 'modules', 'of', 'monoids', 'relative', 'to', 'this', 'class', 'of', 'spans', 'simplicial', 'monoids', 'of', 'socalled', 'moore', 'length', '1', 'relative', 'to', 'this', 'class', 'of', 'spans', 'the', 'most', 'important', 'examples', 'of', 'monoids', 'that', 'are', 'covered', 'are', 'small', 'categories', 'treated', 'as', 'monoids', 'in', 'categories', 'of', 'spans', 'and', 'bimonoids', 'in', 'symmetric', 'monoidal', 'categories', 'regarded', 'as', 'monoids', 'in', 'categories', 'of', 'comonoids', 'in', 'this', 'first', 'part', 'the', 'theory', 'of', 'relative', 'pullbacks', 'is', 'worked', 'out', 'leading', 'to', 'the', 'definition', 'of', 'a', 'relative', 'category']]
[-0.13303572352794288, 0.060591623780474196, 0.008550727525643544, 0.09698561527683869, -0.036627083637677464, -0.05541430823340089, -0.06419677616290716, 0.3823882961827042, -0.3913590110873441, -0.23066166957708456, 0.051903627556336596, -0.24158658962531954, -0.07285438217552362, 0.19393830898061262, -0.1836933102046626, -0.11146433679778459, 0.03503959852196606, 0.0828874956412587, -0.08094044715223785, -0.2724273611453518, 0.4628308204464219, -0.018058180289788055, 0.24453276287830245, -0.0029340445278294848, 0.07925851649266824, -0.067594995002048, -0.10589105608271418, 0.08960864090039271, -0.10574851795935444, 0.15341969988251156, 0.39357594624821063, 0.049559601755664415, 0.24729616940124538, -0.3172539103677315, -0.08327588167832753, 0.11465152090959317, 0.09781541614545987, 0.02042056677298439, 0.05078289159202734, -0.28862404694319166, 0.09434338092424832, -0.28445004121260303, -0.04390695953197711, -0.015704413768794157, 0.13465176857348565, 0.06369437451837008, -0.20436291866400072, -0.031357718170084786, 0.11478901220094341, 0.1181631399631764, -0.08198254499625646, -0.11723621162190308, -0.05458059991437909, 0.15947491858995197, 0.009616456081085236, -0.06328187281661461, 0.13164961076366294, -0.1441085946661692, -0.12742914794326093, 0.4257865697804806, -0.047609504850053816, -0.17058195390499534, 0.18165173969824955, -0.12835297323104028, -0.15835149741558507, 0.1754159672490725, 0.05629444737152188, 0.21213946376867443, -0.06497468071602351, 0.12398157327433851, -0.15791373749354246, 0.06626756581069852, 0.1477541895706899, 0.05997408010411711, 0.15783518914594852, 0.15325793328868076, 0.01481574109499961, 0.19425899662753254, 0.052429424681230984, -0.08297398557837031, -0.3731979430710847, -0.16413503634306578, -0.05953304632772914, 0.08240684743278322, -0.006716441750331716, -0.22633861670831004, 0.4127432894686946, 0.12893872835005807, 0.16752851961811066, 0.0924577162965753, 0.17612792508660163, -0.017652964903519745, 0.11977638562613752, -0.03824219201584306, 0.16396657926384853, 0.2662582295231801, 0.01435641216246032, -0.02355985033564863, 0.0015302261139834876, 0.1960265505069916]
1,803.03419
Artificial Nonlinearity Generated from Electromagnetic Coupling Meta-molecule
A purely artificial mechanism for optical nonlinearity is proposed based on a metamaterial route. The mechanism is derived from classical electromagnetic interaction in a meta-molecule consisting of a cut-wire meta-atom nested within a split-ring meta-atom. Induced by the localized magnetic field in the split-ring meta-atom, the magnetic force drives an anharmonic oscillation of free electrons in the cut-wire meta-atom, generating an intrinsically nonlinear electromagnetic response. An explicit physical process of a second-order nonlinear behavior is adequately described, which is perfectly demonstrated with a series of numerical simulations. Instead of "borrowing" from natural nonlinear materials, this novel mechanism of optical nonlinearity is artificially dominated by the meta-molecule geometry and possesses unprecedented design freedom, offering fascinating possibilities to the research and application of nonlinear optics.
physics.optics cond-mat.mtrl-sci
a purely artificial mechanism for optical nonlinearity is proposed based on a metamaterial route the mechanism is derived from classical electromagnetic interaction in a metamolecule consisting of a cutwire metaatom nested within a splitring metaatom induced by the localized magnetic field in the splitring metaatom the magnetic force drives an anharmonic oscillation of free electrons in the cutwire metaatom generating an intrinsically nonlinear electromagnetic response an explicit physical process of a secondorder nonlinear behavior is adequately described which is perfectly demonstrated with a series of numerical simulations instead of borrowing from natural nonlinear materials this novel mechanism of optical nonlinearity is artificially dominated by the metamolecule geometry and possesses unprecedented design freedom offering fascinating possibilities to the research and application of nonlinear optics
[['a', 'purely', 'artificial', 'mechanism', 'for', 'optical', 'nonlinearity', 'is', 'proposed', 'based', 'on', 'a', 'metamaterial', 'route', 'the', 'mechanism', 'is', 'derived', 'from', 'classical', 'electromagnetic', 'interaction', 'in', 'a', 'metamolecule', 'consisting', 'of', 'a', 'cutwire', 'metaatom', 'nested', 'within', 'a', 'splitring', 'metaatom', 'induced', 'by', 'the', 'localized', 'magnetic', 'field', 'in', 'the', 'splitring', 'metaatom', 'the', 'magnetic', 'force', 'drives', 'an', 'anharmonic', 'oscillation', 'of', 'free', 'electrons', 'in', 'the', 'cutwire', 'metaatom', 'generating', 'an', 'intrinsically', 'nonlinear', 'electromagnetic', 'response', 'an', 'explicit', 'physical', 'process', 'of', 'a', 'secondorder', 'nonlinear', 'behavior', 'is', 'adequately', 'described', 'which', 'is', 'perfectly', 'demonstrated', 'with', 'a', 'series', 'of', 'numerical', 'simulations', 'instead', 'of', 'borrowing', 'from', 'natural', 'nonlinear', 'materials', 'this', 'novel', 'mechanism', 'of', 'optical', 'nonlinearity', 'is', 'artificially', 'dominated', 'by', 'the', 'metamolecule', 'geometry', 'and', 'possesses', 'unprecedented', 'design', 'freedom', 'offering', 'fascinating', 'possibilities', 'to', 'the', 'research', 'and', 'application', 'of', 'nonlinear', 'optics']]
[-0.18776460331145342, 0.16281491466095138, -0.04127723459775249, -0.025006313414931768, -0.1451841459980583, -0.156512542790544, -0.008248680708475592, 0.3886266622116895, -0.2928985780619872, -0.27506448904703545, 0.0019025098441577538, -0.273065422619958, -0.2262674050814495, 0.23992884309008355, 0.02972968494920893, 0.033170252326663915, -0.03134294799756168, -0.045450310256877326, 0.02496675080884763, -0.11527183542891246, 0.29102723124792906, 0.07810239088948726, 0.32184716073675007, -0.0020224199047296997, 0.16473300075461347, -0.006854937355056769, 0.051605270567872535, 0.0049811087632021765, -0.06531916636731325, 0.1344959903054121, 0.19181061627738918, -0.027962942861353722, 0.2887951647257054, -0.4858967663826254, -0.2434243279238557, -0.0019461137765064472, 0.14205622645019272, 0.13082226973341218, -0.10759543318952608, -0.275523204273143, -0.010123633196562285, -0.12922751271294627, -0.16637247036413735, -0.0650885385589871, -0.02834589087226375, 0.029310902823387396, -0.3175868589532319, 0.02677201183429518, 0.07520855719988363, 0.08760419905155413, -0.07590317174156265, -0.00846401171955636, 0.004831343995240646, 0.01969528623110789, -0.038837486569726146, -0.010425011207145162, 0.13571447564470696, -0.157562908237588, -0.12569812365724303, 0.39512504758389017, -0.05392375717041787, -0.1735366131368328, 0.13226123460818354, -0.08469278235139886, 0.013265527826468877, 0.19739440746408532, 0.1782642524856014, 0.08390460669903493, -0.1846056889749238, 0.0798039130395779, -0.00959356962438158, 0.20427328212625853, 0.04556221735277554, 0.07041271554109285, 0.27916277536357625, 0.24509959905673334, -0.004927677060742446, 0.19566788099709959, -0.020425802456381602, -0.056657224825424395, -0.2720044855997572, -0.08494192560968118, -0.2087005622480519, 0.08206898171257804, -0.08077045636605547, -0.2294020375570025, 0.4328651906850528, 0.09606617236012079, 0.12462363003306394, -0.09262036900433553, 0.31774171011719277, 0.1350964345265089, 0.07389027867617647, -0.005817681153463881, 0.31196995945723077, 0.1646598454577114, 0.08641255554947548, -0.27259471689964215, -0.016085678397306825, 0.030959410782206834]
1,803.0342
Robust Landmark Detection for Alignment of Mouse Brain Section Images
Brightfield and fluorescent imaging of whole brain sections are funda- mental tools of research in mouse brain study. As sectioning and imaging become more efficient, there is an increasing need to automate the post-processing of sec- tions for alignment and three dimensional visualization. There is a further need to facilitate the development of a digital atlas, i.e. a brain-wide map annotated with cell type and tract tracing data, which would allow the automatic registra- tion of images stacks to a common coordinate system. Currently, registration of slices requires manual identification of landmarks. In this work we describe the first steps in developing a semi-automated system to construct a histology at- las of mouse brainstem that combines atlas-guided annotation, landmark-based registration and atlas generation in an iterative framework. We describe an unsu- pervised approach for identifying and matching region and boundary landmarks, based on modelling texture. Experiments show that the detected landmarks corre- spond well with brain structures, and matching is robust under distortion. These results will serve as the basis for registration and atlas building.
cs.CV
brightfield and fluorescent imaging of whole brain sections are funda mental tools of research in mouse brain study as sectioning and imaging become more efficient there is an increasing need to automate the postprocessing of sec tions for alignment and three dimensional visualization there is a further need to facilitate the development of a digital atlas ie a brainwide map annotated with cell type and tract tracing data which would allow the automatic registra tion of images stacks to a common coordinate system currently registration of slices requires manual identification of landmarks in this work we describe the first steps in developing a semiautomated system to construct a histology at las of mouse brainstem that combines atlasguided annotation landmarkbased registration and atlas generation in an iterative framework we describe an unsu pervised approach for identifying and matching region and boundary landmarks based on modelling texture experiments show that the detected landmarks corre spond well with brain structures and matching is robust under distortion these results will serve as the basis for registration and atlas building
[['brightfield', 'and', 'fluorescent', 'imaging', 'of', 'whole', 'brain', 'sections', 'are', 'funda', 'mental', 'tools', 'of', 'research', 'in', 'mouse', 'brain', 'study', 'as', 'sectioning', 'and', 'imaging', 'become', 'more', 'efficient', 'there', 'is', 'an', 'increasing', 'need', 'to', 'automate', 'the', 'postprocessing', 'of', 'sec', 'tions', 'for', 'alignment', 'and', 'three', 'dimensional', 'visualization', 'there', 'is', 'a', 'further', 'need', 'to', 'facilitate', 'the', 'development', 'of', 'a', 'digital', 'atlas', 'ie', 'a', 'brainwide', 'map', 'annotated', 'with', 'cell', 'type', 'and', 'tract', 'tracing', 'data', 'which', 'would', 'allow', 'the', 'automatic', 'registra', 'tion', 'of', 'images', 'stacks', 'to', 'a', 'common', 'coordinate', 'system', 'currently', 'registration', 'of', 'slices', 'requires', 'manual', 'identification', 'of', 'landmarks', 'in', 'this', 'work', 'we', 'describe', 'the', 'first', 'steps', 'in', 'developing', 'a', 'semiautomated', 'system', 'to', 'construct', 'a', 'histology', 'at', 'las', 'of', 'mouse', 'brainstem', 'that', 'combines', 'atlasguided', 'annotation', 'landmarkbased', 'registration', 'and', 'atlas', 'generation', 'in', 'an', 'iterative', 'framework', 'we', 'describe', 'an', 'unsu', 'pervised', 'approach', 'for', 'identifying', 'and', 'matching', 'region', 'and', 'boundary', 'landmarks', 'based', 'on', 'modelling', 'texture', 'experiments', 'show', 'that', 'the', 'detected', 'landmarks', 'corre', 'spond', 'well', 'with', 'brain', 'structures', 'and', 'matching', 'is', 'robust', 'under', 'distortion', 'these', 'results', 'will', 'serve', 'as', 'the', 'basis', 'for', 'registration', 'and', 'atlas', 'building']]
[-0.04712572644077523, -0.0028246135081517847, -0.0609050385185604, 0.04733312616076017, -0.07058769522328201, -0.12929527088187548, -0.023326402638367442, 0.4304930620371949, -0.20596677423109636, -0.325808830959939, 0.12622051338697676, -0.27434011208445785, -0.183493504676356, 0.205045509920997, -0.11726002485933308, 0.07561157047911006, 0.12224010392200461, -0.019510482474457646, -0.03453365898268774, -0.17301031424620644, 0.24924449264180176, 0.04698817618461976, 0.32174061351932237, 0.011570758615054601, 0.12253745812665519, 0.026535253453360826, -0.09333812519312339, -0.013090853395243717, -0.09544620507095228, 0.18774232613924502, 0.3488814131205165, 0.21994769542618806, 0.26919795839159294, -0.45224845694746213, -0.1804566678082094, 0.08847912372736975, 0.1832414600093914, 0.10779074960331389, -0.08938108879484326, -0.3358728726797867, 0.09053224816019538, -0.09543416290652267, -0.05659028974383376, -0.11295112953683752, -0.005361663870009875, -0.03198713134719752, -0.2935814476344561, 0.046514441386449994, 0.005554406946324635, 0.15632259236042237, -0.08113410380712255, -0.04654291040821781, -0.02185321248577756, 0.20764510423692248, -0.021177659418331028, 0.08378045929752853, 0.16048129246709597, -0.17248670083828857, -0.1289822903873269, 0.3136065954472436, 0.02771486329634912, -0.1926485771681507, 0.20564862377508436, -0.07528958508614884, -0.15230549307442595, 0.13795251485913299, 0.17697062857955326, 0.11120313815407043, -0.18836453794650626, 0.002688156286197671, 0.019436622404650418, 0.21624394305061204, 0.08645908238209221, -0.03375740444996979, 0.17765608588270815, 0.26062919447458416, 0.045599160347740315, 0.11274439434190606, -0.1777770014420195, -0.007856615970309195, -0.2834837802003549, -0.20350188685738113, -0.1301650035433298, -0.03330589585624863, -0.03779706405670325, -0.19275938641810572, 0.3787367483059507, 0.1657225291855866, 0.20657862561245904, 0.044706853334710736, 0.33266410994652096, -0.007037970222543578, 0.13404738936616584, 0.01128330694912218, 0.16218842385163487, 0.010418986747322907, 0.11017731688429364, -0.16612916455744917, 0.05395487183740929, 0.08085321392160082]
1,803.03421
Laboratory experiments on dynamo action and magnetically triggered flow instabilities
Magnetic fields of planets, stars and galaxies are generated by self-excitation in moving electrically conducting fluids. Once produced, magnetic fields can play an active role in cosmic structure formation by destabilizing rotational flows that would be otherwise hydrodynamically stable. For a long time, both hydromagnetic dynamo action as well as magnetically triggered flow instabilities had been the subject of purely theoretical research. Meanwhile, however, the dynamo effect has been observed in large-scale liquid sodium experiments in Riga, Karlsruhe and Cadarache. In this paper, we summarize the results of liquid metal experiments devoted to the dynamo effect and various magnetic instabilities such as the helical and the azimuthal magnetorotational instability and the Tayler instability. We discuss in detail our plans for a precession-driven dynamo experiment and a large-scale Tayler-Couette experiment using liquid sodium, and on the prospects to observe magnetically triggered instabilities of flows with positive shear.
physics.flu-dyn
magnetic fields of planets stars and galaxies are generated by selfexcitation in moving electrically conducting fluids once produced magnetic fields can play an active role in cosmic structure formation by destabilizing rotational flows that would be otherwise hydrodynamically stable for a long time both hydromagnetic dynamo action as well as magnetically triggered flow instabilities had been the subject of purely theoretical research meanwhile however the dynamo effect has been observed in largescale liquid sodium experiments in riga karlsruhe and cadarache in this paper we summarize the results of liquid metal experiments devoted to the dynamo effect and various magnetic instabilities such as the helical and the azimuthal magnetorotational instability and the tayler instability we discuss in detail our plans for a precessiondriven dynamo experiment and a largescale taylercouette experiment using liquid sodium and on the prospects to observe magnetically triggered instabilities of flows with positive shear
[['magnetic', 'fields', 'of', 'planets', 'stars', 'and', 'galaxies', 'are', 'generated', 'by', 'selfexcitation', 'in', 'moving', 'electrically', 'conducting', 'fluids', 'once', 'produced', 'magnetic', 'fields', 'can', 'play', 'an', 'active', 'role', 'in', 'cosmic', 'structure', 'formation', 'by', 'destabilizing', 'rotational', 'flows', 'that', 'would', 'be', 'otherwise', 'hydrodynamically', 'stable', 'for', 'a', 'long', 'time', 'both', 'hydromagnetic', 'dynamo', 'action', 'as', 'well', 'as', 'magnetically', 'triggered', 'flow', 'instabilities', 'had', 'been', 'the', 'subject', 'of', 'purely', 'theoretical', 'research', 'meanwhile', 'however', 'the', 'dynamo', 'effect', 'has', 'been', 'observed', 'in', 'largescale', 'liquid', 'sodium', 'experiments', 'in', 'riga', 'karlsruhe', 'and', 'cadarache', 'in', 'this', 'paper', 'we', 'summarize', 'the', 'results', 'of', 'liquid', 'metal', 'experiments', 'devoted', 'to', 'the', 'dynamo', 'effect', 'and', 'various', 'magnetic', 'instabilities', 'such', 'as', 'the', 'helical', 'and', 'the', 'azimuthal', 'magnetorotational', 'instability', 'and', 'the', 'tayler', 'instability', 'we', 'discuss', 'in', 'detail', 'our', 'plans', 'for', 'a', 'precessiondriven', 'dynamo', 'experiment', 'and', 'a', 'largescale', 'taylercouette', 'experiment', 'using', 'liquid', 'sodium', 'and', 'on', 'the', 'prospects', 'to', 'observe', 'magnetically', 'triggered', 'instabilities', 'of', 'flows', 'with', 'positive', 'shear']]
[-0.16778557844243128, 0.25572284383227656, -0.047352353179881554, 0.07546910970895998, -0.055766129938005275, -0.039327741192322074, -0.038715767888041305, 0.3404219372657268, -0.21874950907818258, -0.31670016056717665, 0.10940128272679979, -0.23841483616158493, -0.13199087796247985, 0.21732129007960632, 0.02292223428838491, 0.04104194009982764, 0.03230877721455739, -0.05293961372928158, 0.030667506986016994, -0.19178346543387853, 0.2791615306361489, 0.13125420222058892, 0.27020898990792364, 0.02867158602967807, 0.052029929583101237, -0.12349558548925266, -0.008643890724657741, 0.0713910663513186, -0.17427633915995352, -0.051968668002239746, 0.2389032151884948, 0.00413800690686713, 0.2564837323798326, -0.5328755769113155, -0.24875501194356442, 0.05379512672127569, 0.18115513099912453, 0.12500095187546048, -0.16274662474441431, -0.2765818199952937, 0.05948387108398729, -0.17093077186042163, -0.13488540337229632, -0.08666588910791563, 0.020158659269688777, 0.01818843475684096, -0.2892246966761352, 0.084776853900945, 0.09396650801111357, 0.14861146469874792, -0.12043041763954783, -0.05435052723623812, -0.06120503006569965, 0.07778549640063094, 0.14770934664427418, 0.07749265178875385, 0.2105357224848887, -0.1846443955580806, -0.12455641741749562, 0.37886877973525696, -0.08546446023942673, -0.11899960513435198, 0.2210432060560441, -0.20173083647307366, -0.0985263737519782, 0.1453546316790305, 0.2077886136631443, 0.11718106782701734, -0.08855094268243466, -0.01742876395989809, -0.05994527713612539, 0.09141315341439124, 0.05420003397619887, -0.028264026725282, 0.33313587973889425, 0.2476356536539093, 0.005137583773506627, 0.11886071347175421, -0.13366442482140273, -0.041306559650278456, -0.2268338575448892, -0.10877389706629775, -0.07245540466440255, 0.02539859450847223, 0.017444523645318528, -0.14844449296233256, 0.35240192947373405, 0.13041070669136737, 0.11053102574078366, -0.10306044649619814, 0.2884773783424027, 0.009966040950281264, 0.05034421960510671, 0.11067243500561645, 0.3447072064657121, 0.18843561903037742, 0.15013648767649412, -0.30120117875607044, 0.07472536805219795, 0.04081695755841593]
1,803.03422
MOSQUITO: Covert Ultrasonic Transmissions between Two Air-Gapped Computers using Speaker-to-Speaker Communication
In this paper we show how two (or more) airgapped computers in the same room, equipped with passive speakers, headphones, or earphones can covertly exchange data via ultrasonic waves. Microphones are not required. Our method is based on the capability of a malware to exploit a specific audio chip feature in order to reverse the connected speakers from output devices into input devices - unobtrusively rendering them microphones. We discuss the attack model and provide technical background and implementation details. We show that although the reversed speakers/headphones/earphones were not originally designed to perform as microphones, they still respond well to the near-ultrasonic range (18kHz to 24kHz). We evaluate the communication channel with different equipment, and at various distances and transmission speeds, and also discuss some practical considerations. Our results show that the speaker-to-speaker communication can be used to covertly transmit data between two air-gapped computers positioned a maximum of nine meters away from one another. Moreover, we show that two (microphone-less) headphones can exchange data from a distance of three meters apart. This enables 'headphones-to-headphones' covert communication, which is discussed for the first time in this paper.
cs.CR
in this paper we show how two or more airgapped computers in the same room equipped with passive speakers headphones or earphones can covertly exchange data via ultrasonic waves microphones are not required our method is based on the capability of a malware to exploit a specific audio chip feature in order to reverse the connected speakers from output devices into input devices unobtrusively rendering them microphones we discuss the attack model and provide technical background and implementation details we show that although the reversed speakersheadphonesearphones were not originally designed to perform as microphones they still respond well to the nearultrasonic range 18khz to 24khz we evaluate the communication channel with different equipment and at various distances and transmission speeds and also discuss some practical considerations our results show that the speakertospeaker communication can be used to covertly transmit data between two airgapped computers positioned a maximum of nine meters away from one another moreover we show that two microphoneless headphones can exchange data from a distance of three meters apart this enables headphonestoheadphones covert communication which is discussed for the first time in this paper
[['in', 'this', 'paper', 'we', 'show', 'how', 'two', 'or', 'more', 'airgapped', 'computers', 'in', 'the', 'same', 'room', 'equipped', 'with', 'passive', 'speakers', 'headphones', 'or', 'earphones', 'can', 'covertly', 'exchange', 'data', 'via', 'ultrasonic', 'waves', 'microphones', 'are', 'not', 'required', 'our', 'method', 'is', 'based', 'on', 'the', 'capability', 'of', 'a', 'malware', 'to', 'exploit', 'a', 'specific', 'audio', 'chip', 'feature', 'in', 'order', 'to', 'reverse', 'the', 'connected', 'speakers', 'from', 'output', 'devices', 'into', 'input', 'devices', 'unobtrusively', 'rendering', 'them', 'microphones', 'we', 'discuss', 'the', 'attack', 'model', 'and', 'provide', 'technical', 'background', 'and', 'implementation', 'details', 'we', 'show', 'that', 'although', 'the', 'reversed', 'speakersheadphonesearphones', 'were', 'not', 'originally', 'designed', 'to', 'perform', 'as', 'microphones', 'they', 'still', 'respond', 'well', 'to', 'the', 'nearultrasonic', 'range', '18khz', 'to', '24khz', 'we', 'evaluate', 'the', 'communication', 'channel', 'with', 'different', 'equipment', 'and', 'at', 'various', 'distances', 'and', 'transmission', 'speeds', 'and', 'also', 'discuss', 'some', 'practical', 'considerations', 'our', 'results', 'show', 'that', 'the', 'speakertospeaker', 'communication', 'can', 'be', 'used', 'to', 'covertly', 'transmit', 'data', 'between', 'two', 'airgapped', 'computers', 'positioned', 'a', 'maximum', 'of', 'nine', 'meters', 'away', 'from', 'one', 'another', 'moreover', 'we', 'show', 'that', 'two', 'microphoneless', 'headphones', 'can', 'exchange', 'data', 'from', 'a', 'distance', 'of', 'three', 'meters', 'apart', 'this', 'enables', 'headphonestoheadphones', 'covert', 'communication', 'which', 'is', 'discussed', 'for', 'the', 'first', 'time', 'in', 'this', 'paper']]
[-0.15010676184713362, 0.09833183233605375, -0.055935747513037655, 0.03995338626278762, -0.10332698083363015, -0.2224255634387877, 0.06568923790278382, 0.4232672380710114, -0.28559138506420695, -0.33755837372041114, 0.12451781940909216, -0.31664372237617744, -0.1502715090833417, 0.24005183701757238, -0.09883058028472536, 0.018750369221013686, 0.047378048955010216, 0.04772236890321488, -0.021102544857454407, -0.2453469516782288, 0.27338468493092494, 0.034828588949235455, 0.29840092929132156, 0.051486451327072344, 0.09805493475544115, -0.015087486236933723, -0.013023638058526639, -0.03011087308554551, -0.053766870056238356, 0.11492753661317001, 0.3137078843230392, 0.1634808529568992, 0.24348670917214546, -0.48325847848916853, -0.1863160390932342, 0.08104634826597056, 0.14798531940989926, 0.1371214949654665, -0.04962048678655326, -0.3150098422521403, 0.12402367739360676, -0.18500801214074206, -0.0535918640689183, -0.03938261299477318, -0.06434014751497844, 0.04345264223739228, -0.22643213417360236, -0.016251222359428868, 0.00622264145517087, 0.04361535702941304, -0.004478611897022916, -0.05990347781286226, 0.021554336959220387, 0.20217174698869234, 0.02076109321384727, -0.019197824897567155, 0.14474606383383773, -0.07950199338669763, -0.11861752564931644, 0.3599523307011572, -0.030105027097651952, -0.18940972257665664, 0.21398560059362212, -0.09304082058578231, -0.06989233671068396, 0.07835018929411454, 0.2322815711370685, 0.06996785266996054, -0.1947856051151448, -0.03462759877962201, 0.024048870623205376, 0.23486939691236067, 0.09719689540284056, 0.0496189185839625, 0.17008766093338168, 0.1408553801349484, 0.057146291097940866, 0.15114457094742703, -0.12665098062040045, -0.023207664806473814, -0.26054679145568244, -0.13909811909731956, -0.20796801654528307, 0.024606863570863943, -0.043390775366940575, -0.07461632803550242, 0.36658954404440175, 0.23637540301956125, 0.16956253552174602, 0.07827591395276136, 0.3877337649880841, 0.004613986373462782, 0.1174611658724181, 0.11574338396293157, 0.22279331236690747, 0.040071830227606874, 0.137045870480445, -0.14088158056597802, 0.055684549044609566, -0.05041248814395353]
1,803.03423
A simple embedded discrete fracture-matrix model for a coupled flow and transport problem in porous media
Accurate simulation of fluid flow and transport in fractured porous media is a key challenge in subsurface reservoir engineering. Due to the high ratio between its length and width, fractures can be modeled as lower dimensional interfaces embedded in the porous rock. We apply a recently developed embedded finite element method (EFEM) for the Darcy problem. This method allows for general fracture geometry, and the fractures may cut the finite element mesh arbitrarily. We present here a velocity model for EFEM and couple the Darcy problem to a transport problem for a passive solute. The main novelties of this work is a locally conservative velocity approximation derived from the EFEM solution, and the development of a lowest order upwind finite volume method for the transport problem. This numerical model is compatible with EFEM in the sense that the same computational mesh may be applied, so that we retain the same flexibility with respect to fracture geometry and meshing. Hence, our coupled solution strategy represents a simple approach in terms of formulation, implementation and meshing. We demonstrate our model by some numerical examples on both synthetic and realistic problems, including a benchmark study for single-phase flow. Despite the simplicity of the method, the results are promising.
math.NA
accurate simulation of fluid flow and transport in fractured porous media is a key challenge in subsurface reservoir engineering due to the high ratio between its length and width fractures can be modeled as lower dimensional interfaces embedded in the porous rock we apply a recently developed embedded finite element method efem for the darcy problem this method allows for general fracture geometry and the fractures may cut the finite element mesh arbitrarily we present here a velocity model for efem and couple the darcy problem to a transport problem for a passive solute the main novelties of this work is a locally conservative velocity approximation derived from the efem solution and the development of a lowest order upwind finite volume method for the transport problem this numerical model is compatible with efem in the sense that the same computational mesh may be applied so that we retain the same flexibility with respect to fracture geometry and meshing hence our coupled solution strategy represents a simple approach in terms of formulation implementation and meshing we demonstrate our model by some numerical examples on both synthetic and realistic problems including a benchmark study for singlephase flow despite the simplicity of the method the results are promising
[['accurate', 'simulation', 'of', 'fluid', 'flow', 'and', 'transport', 'in', 'fractured', 'porous', 'media', 'is', 'a', 'key', 'challenge', 'in', 'subsurface', 'reservoir', 'engineering', 'due', 'to', 'the', 'high', 'ratio', 'between', 'its', 'length', 'and', 'width', 'fractures', 'can', 'be', 'modeled', 'as', 'lower', 'dimensional', 'interfaces', 'embedded', 'in', 'the', 'porous', 'rock', 'we', 'apply', 'a', 'recently', 'developed', 'embedded', 'finite', 'element', 'method', 'efem', 'for', 'the', 'darcy', 'problem', 'this', 'method', 'allows', 'for', 'general', 'fracture', 'geometry', 'and', 'the', 'fractures', 'may', 'cut', 'the', 'finite', 'element', 'mesh', 'arbitrarily', 'we', 'present', 'here', 'a', 'velocity', 'model', 'for', 'efem', 'and', 'couple', 'the', 'darcy', 'problem', 'to', 'a', 'transport', 'problem', 'for', 'a', 'passive', 'solute', 'the', 'main', 'novelties', 'of', 'this', 'work', 'is', 'a', 'locally', 'conservative', 'velocity', 'approximation', 'derived', 'from', 'the', 'efem', 'solution', 'and', 'the', 'development', 'of', 'a', 'lowest', 'order', 'upwind', 'finite', 'volume', 'method', 'for', 'the', 'transport', 'problem', 'this', 'numerical', 'model', 'is', 'compatible', 'with', 'efem', 'in', 'the', 'sense', 'that', 'the', 'same', 'computational', 'mesh', 'may', 'be', 'applied', 'so', 'that', 'we', 'retain', 'the', 'same', 'flexibility', 'with', 'respect', 'to', 'fracture', 'geometry', 'and', 'meshing', 'hence', 'our', 'coupled', 'solution', 'strategy', 'represents', 'a', 'simple', 'approach', 'in', 'terms', 'of', 'formulation', 'implementation', 'and', 'meshing', 'we', 'demonstrate', 'our', 'model', 'by', 'some', 'numerical', 'examples', 'on', 'both', 'synthetic', 'and', 'realistic', 'problems', 'including', 'a', 'benchmark', 'study', 'for', 'singlephase', 'flow', 'despite', 'the', 'simplicity', 'of', 'the', 'method', 'the', 'results', 'are', 'promising']]
[-0.06167257541347659, 0.06034452363439813, -0.07987827005478122, 0.001588023538848885, -0.06392608090508275, -0.12201127239571112, -0.0029149085976092554, 0.36965018994651916, -0.2979522983816157, -0.2890616652956119, 0.11725661103761323, -0.24043932515430752, -0.14578594471577827, 0.2039602833379787, -0.07304365079333187, 0.0940590416782581, 0.09058832959953422, -0.04459933805074997, -0.03419174732776677, -0.19640160133017273, 0.26894178010449493, 0.021803525217422626, 0.3126143489657651, 0.09392314084192238, 0.1337213452303464, -0.06179710685661653, -0.019549245243074328, 0.10897872119051655, -0.13207082119351538, 0.14133976089836256, 0.24344399834687752, 0.030410184563001298, 0.2773312643193072, -0.4501378990846073, -0.2775477474055639, 0.041742759030993754, 0.1427493777421371, 0.13904410878014636, -0.08980306787387946, -0.21738195246448969, 0.09611050925649157, -0.15762395486689923, -0.15048912264088668, -0.0620009293816643, -0.017857166402405356, 0.012330994893876245, -0.2727958963616047, 0.09379484495034487, 0.030603558784805057, 0.029725913916964355, -0.0807120825013532, -0.0954679796466513, -0.008776364259694408, 0.11175066661089658, -0.006165158800871634, -0.01095695559321562, 0.09799136625511981, -0.10139757914659596, -0.04387787512401346, 0.4514358448636968, -0.048710511515212315, -0.27744431943155645, 0.21236036573139178, -0.066487688102714, -0.06620047349573635, 0.13607203121319777, 0.22707460686655306, 0.15357052921431094, -0.13084817938279453, 0.08170107808191239, -0.05480947027880153, 0.14902488096140143, 0.019229566433080814, -0.06613382053442254, 0.13897025741909336, 0.23681706926989846, 0.08728124945674365, 0.13266792364600227, -0.07538674175739288, -0.11371243041940034, -0.3177436472984349, -0.20494540551153478, -0.17117561467457562, -0.010486695423108957, -0.14152367917718592, -0.20135012980232514, 0.3620887806593645, 0.15398674402584708, 0.12821434549078708, 0.0433256484318252, 0.3298767188427652, 0.09355694658475042, 0.038175733466973394, 0.11163951857696947, 0.20110803779467326, 0.1628909679510199, 0.1188157491965174, -0.23913750759689364, 0.07806527939307072, 0.11394239059626693]
1,803.03424
Gravitational lensing by eigenvalue distributions of random matrix models
We propose to use eigenvalue densities of unitary random matrix ensembles as mass distributions in gravitational lensing. The corresponding lens equations reduce to algebraic equations in the complex plane which can be treated analytically. We prove that these models can be applied to describe lensing by systems of edge-on galaxies. We illustrate our analysis with the Gaussian and the quartic unitary matrix ensembles.
math-ph math.MP
we propose to use eigenvalue densities of unitary random matrix ensembles as mass distributions in gravitational lensing the corresponding lens equations reduce to algebraic equations in the complex plane which can be treated analytically we prove that these models can be applied to describe lensing by systems of edgeon galaxies we illustrate our analysis with the gaussian and the quartic unitary matrix ensembles
[['we', 'propose', 'to', 'use', 'eigenvalue', 'densities', 'of', 'unitary', 'random', 'matrix', 'ensembles', 'as', 'mass', 'distributions', 'in', 'gravitational', 'lensing', 'the', 'corresponding', 'lens', 'equations', 'reduce', 'to', 'algebraic', 'equations', 'in', 'the', 'complex', 'plane', 'which', 'can', 'be', 'treated', 'analytically', 'we', 'prove', 'that', 'these', 'models', 'can', 'be', 'applied', 'to', 'describe', 'lensing', 'by', 'systems', 'of', 'edgeon', 'galaxies', 'we', 'illustrate', 'our', 'analysis', 'with', 'the', 'gaussian', 'and', 'the', 'quartic', 'unitary', 'matrix', 'ensembles']]
[-0.08205293426437983, 0.09720457910508332, -0.1068984196476993, 0.10581150109924022, -0.04975228322788127, -0.10405046788472978, -0.05827828125643825, 0.3795290697543394, -0.2421610885787578, -0.2541718034310237, 0.06183445023831039, -0.25589105123764877, -0.20102997283850396, 0.15140714342631992, -0.02939601745160799, 0.11500370783346986, 0.07083142426840607, -0.045411238358134313, -0.14239013815549986, -0.3044182238065534, 0.3552588198688768, 0.008917939627454394, 0.19356820324347132, -0.04375681310655579, 0.103454563389754, 0.026200842962319417, -0.021888852474235353, 0.0027133292548121913, -0.09963565745951315, 0.06600030487965024, 0.3066968538469588, 0.11416812251055879, 0.15980965502944494, -0.39530423295403283, -0.21960654403896085, 0.1579195529163357, 0.19235488966048236, 0.1512616366898227, 0.008421922002785973, -0.34382270130195786, 0.09794867124467616, -0.1697894675391061, -0.2015282067411121, -0.11728547220044429, -0.05989431325227968, 0.07131691396399031, -0.26686115829007967, 0.12373659703584891, 0.023222987968770283, 0.011042536428523443, -0.013787966849844135, -0.09104286233103642, 0.012827437574280396, 0.0737697387720266, -0.007517391946806576, -0.02526383183246094, 0.17661036063163055, -0.08460633075308233, -0.05988524948793744, 0.41309543344236554, -0.09800276316938893, -0.2640839900289263, 0.13541582919332007, -0.153489730668269, -0.1516496856061239, 0.05759386304352018, 0.256574891005007, 0.08912204624345851, -0.17264376796545491, 0.10443664214939677, -0.039607913107685154, 0.16655955876090697, 0.06646719191681653, -0.04699510197702145, 0.2271207819012777, 0.02162635228818371, 0.07700808109006002, 0.15780401525146787, -0.06433529353567533, -0.1033867761965782, -0.2651954031889401, -0.08411968526770434, -0.18619851449260577, 0.154769780544845, -0.1583756547315427, -0.15727371684763403, 0.36398624954006026, 0.16884556757507935, 0.21668558915160477, 0.10326139223650985, 0.27091052429011414, 0.18709099097066514, 0.07158522724750496, 0.0504926922805016, 0.25072573997553377, 0.2599472652507266, -0.002065083747434001, -0.2099779968903888, -0.026356892187207465, 0.08135070054540558]
1,803.03425
Role of hydrodynamic flows in chemically driven droplet division
We study the hydrodynamics and shape changes of chemically active droplets. In non-spherical droplets, surface tension generates hydrodynamic flows that drive liquid droplets into a spherical shape. Here we show that spherical droplets that are maintained away from thermodynamic equilibrium by chemical reactions may not remain spherical but can undergo a shape instability which can lead to spontaneous droplet division. In this case chemical activity acts against surface tension and tension-induced hydrodynamic flows. By combining low Reynolds-number hydrodynamics with phase separation dynamics and chemical reaction kinetics we determine stability diagrams of spherical droplets as a function of dimensionless viscosity and reaction parameters. We determine concentration and flow fields inside and outside the droplets during shape changes and division. Our work shows that hydrodynamic flows tends to stabilize spherical shapes but that droplet division occurs for sufficiently strong chemical driving, sufficiently large droplet viscosity or sufficiently small surface tension. Active droplets could provide simple models for prebiotic protocells that are able to proliferate. Our work captures the key hydrodynamics of droplet division that could be observable in chemically active colloidal droplets.
physics.bio-ph cond-mat.soft q-bio.CB
we study the hydrodynamics and shape changes of chemically active droplets in nonspherical droplets surface tension generates hydrodynamic flows that drive liquid droplets into a spherical shape here we show that spherical droplets that are maintained away from thermodynamic equilibrium by chemical reactions may not remain spherical but can undergo a shape instability which can lead to spontaneous droplet division in this case chemical activity acts against surface tension and tensioninduced hydrodynamic flows by combining low reynoldsnumber hydrodynamics with phase separation dynamics and chemical reaction kinetics we determine stability diagrams of spherical droplets as a function of dimensionless viscosity and reaction parameters we determine concentration and flow fields inside and outside the droplets during shape changes and division our work shows that hydrodynamic flows tends to stabilize spherical shapes but that droplet division occurs for sufficiently strong chemical driving sufficiently large droplet viscosity or sufficiently small surface tension active droplets could provide simple models for prebiotic protocells that are able to proliferate our work captures the key hydrodynamics of droplet division that could be observable in chemically active colloidal droplets
[['we', 'study', 'the', 'hydrodynamics', 'and', 'shape', 'changes', 'of', 'chemically', 'active', 'droplets', 'in', 'nonspherical', 'droplets', 'surface', 'tension', 'generates', 'hydrodynamic', 'flows', 'that', 'drive', 'liquid', 'droplets', 'into', 'a', 'spherical', 'shape', 'here', 'we', 'show', 'that', 'spherical', 'droplets', 'that', 'are', 'maintained', 'away', 'from', 'thermodynamic', 'equilibrium', 'by', 'chemical', 'reactions', 'may', 'not', 'remain', 'spherical', 'but', 'can', 'undergo', 'a', 'shape', 'instability', 'which', 'can', 'lead', 'to', 'spontaneous', 'droplet', 'division', 'in', 'this', 'case', 'chemical', 'activity', 'acts', 'against', 'surface', 'tension', 'and', 'tensioninduced', 'hydrodynamic', 'flows', 'by', 'combining', 'low', 'reynoldsnumber', 'hydrodynamics', 'with', 'phase', 'separation', 'dynamics', 'and', 'chemical', 'reaction', 'kinetics', 'we', 'determine', 'stability', 'diagrams', 'of', 'spherical', 'droplets', 'as', 'a', 'function', 'of', 'dimensionless', 'viscosity', 'and', 'reaction', 'parameters', 'we', 'determine', 'concentration', 'and', 'flow', 'fields', 'inside', 'and', 'outside', 'the', 'droplets', 'during', 'shape', 'changes', 'and', 'division', 'our', 'work', 'shows', 'that', 'hydrodynamic', 'flows', 'tends', 'to', 'stabilize', 'spherical', 'shapes', 'but', 'that', 'droplet', 'division', 'occurs', 'for', 'sufficiently', 'strong', 'chemical', 'driving', 'sufficiently', 'large', 'droplet', 'viscosity', 'or', 'sufficiently', 'small', 'surface', 'tension', 'active', 'droplets', 'could', 'provide', 'simple', 'models', 'for', 'prebiotic', 'protocells', 'that', 'are', 'able', 'to', 'proliferate', 'our', 'work', 'captures', 'the', 'key', 'hydrodynamics', 'of', 'droplet', 'division', 'that', 'could', 'be', 'observable', 'in', 'chemically', 'active', 'colloidal', 'droplets']]
[-0.1184302559432884, 0.28500960504429207, -0.16515230422147498, 0.013876862287805934, -0.03281359344125829, -0.15626789568147312, 0.00040642456474920943, 0.34264867734681403, -0.27362818548248874, -0.26383783928791266, 0.0418767667213817, -0.22244518822214257, -0.1403480769510174, 0.14360436586171596, -0.05462385698564402, -0.00626816625913812, 0.03566614532416376, -0.08807213859254262, -4.954601528071281e-05, -0.16070597186141336, 0.28105701480267775, 0.048176802989716334, 0.2682758919092723, 0.09174264662692116, 0.06517062785569579, -0.08928403325844556, 0.04331609816290438, 0.08229973393026739, -0.23431439671625817, -0.015117803497883466, 0.21997173256590435, 0.006159260196404325, 0.1639721549529996, -0.5203847464536213, -0.30009724683720074, 0.1063216770429992, 0.20095781193037207, 0.18497893736219137, -0.13037115675138516, -0.17644431948687675, 0.03962242925125692, -0.17483840817326887, -0.20106616523504878, -0.10077388764216771, 0.07167373459928462, 0.07509647877353322, -0.24926199253596779, 0.1271138554231988, 0.0775510526941313, 0.042926092425154314, -0.10366116776907196, -0.05608733876401351, -0.10808351290826168, 0.14567978934565973, 0.04888997609183813, -0.002274646025034599, 0.33095280673199645, -0.13220471701869327, 0.01942375665013161, 0.41454810691842187, -0.04539517763639904, -0.20010916506871582, 0.26297508135386227, -0.17999400704736926, -0.0604388634648381, 0.22802321774781578, 0.21931816367432475, 0.10777539962695705, -0.08941418855085632, -0.02322074287237936, -0.0030067067412245605, 0.2112016728138163, 0.12101569645003313, -0.09658388716634363, 0.28928971812129023, 0.20096913382617965, 0.011917402253796656, 0.1365910735311142, -0.10803618513875538, -0.146391297556046, -0.2543653290770534, -0.1264631381465329, -0.14449348667403683, 0.030235868388505574, -0.11115113943758641, -0.17403614404728512, 0.2980444273057704, 0.0532374408257763, 0.16867003975381117, 0.011299036762082122, 0.24076586846624398, -0.031775885369602797, 0.0567305705186704, 0.046107393466970986, 0.2664100744192385, 0.11552907900833008, 0.1120002166264587, -0.28914263312278005, 0.09364190569483778, 0.07223923710019638]
1,803.03426
Velocity and absorption coefficient of sound waves in classical gases
Velocity and absorption coefficient of the plane sound waves in classical gases are obtained by solving the Boltzmann kinetic equation. This is done within the linear response theory as a reaction of the single-particle distribution function to a periodic external field. The nonperturbative dispersion equation is derived in the relaxation time approximation and solved numerically. The obtained theoretical results demonstrate an universal dependence of the sound velocity and scaled absorption coefficient on variable $\omega\tau$, where $\omega$ is the sound frequency and $\tau^{-1}$ is the particle collision frequency. In the region of $\omega\tau\sim 1$ a transition the frequent- to rare-collision regimes takes place. The sound velocity increases sharply, and the scaled absorption coefficient has a maximum -- both theoretical findings are in agreement with the data.
physics.flu-dyn cond-mat.stat-mech
velocity and absorption coefficient of the plane sound waves in classical gases are obtained by solving the boltzmann kinetic equation this is done within the linear response theory as a reaction of the singleparticle distribution function to a periodic external field the nonperturbative dispersion equation is derived in the relaxation time approximation and solved numerically the obtained theoretical results demonstrate an universal dependence of the sound velocity and scaled absorption coefficient on variable omegatau where omega is the sound frequency and tau1 is the particle collision frequency in the region of omegatausim 1 a transition the frequent to rarecollision regimes takes place the sound velocity increases sharply and the scaled absorption coefficient has a maximum both theoretical findings are in agreement with the data
[['velocity', 'and', 'absorption', 'coefficient', 'of', 'the', 'plane', 'sound', 'waves', 'in', 'classical', 'gases', 'are', 'obtained', 'by', 'solving', 'the', 'boltzmann', 'kinetic', 'equation', 'this', 'is', 'done', 'within', 'the', 'linear', 'response', 'theory', 'as', 'a', 'reaction', 'of', 'the', 'singleparticle', 'distribution', 'function', 'to', 'a', 'periodic', 'external', 'field', 'the', 'nonperturbative', 'dispersion', 'equation', 'is', 'derived', 'in', 'the', 'relaxation', 'time', 'approximation', 'and', 'solved', 'numerically', 'the', 'obtained', 'theoretical', 'results', 'demonstrate', 'an', 'universal', 'dependence', 'of', 'the', 'sound', 'velocity', 'and', 'scaled', 'absorption', 'coefficient', 'on', 'variable', 'omegatau', 'where', 'omega', 'is', 'the', 'sound', 'frequency', 'and', 'tau1', 'is', 'the', 'particle', 'collision', 'frequency', 'in', 'the', 'region', 'of', 'omegatausim', '1', 'a', 'transition', 'the', 'frequent', 'to', 'rarecollision', 'regimes', 'takes', 'place', 'the', 'sound', 'velocity', 'increases', 'sharply', 'and', 'the', 'scaled', 'absorption', 'coefficient', 'has', 'a', 'maximum', 'both', 'theoretical', 'findings', 'are', 'in', 'agreement', 'with', 'the', 'data']]
[-0.14967494898256126, 0.1551524225587633, -0.1027540074364657, 0.027468877006890026, -0.07107537831520526, -0.09405949832947273, 0.026250798956536484, 0.34516550068236224, -0.2864384803678689, -0.24410539536880768, 0.03992111901885156, -0.3118906367449014, -0.06352050807629901, 0.20604273912731588, 0.05069628564950374, 0.08685616146000784, 0.004676104994581603, 0.05475510141198955, -0.03949424835694272, -0.16514558298134707, 0.26141368800289627, 0.05697695803412092, 0.2907382678089103, 0.07052819344131805, 0.10994509078005738, -0.000836955821633763, -0.006239400669266053, 0.0556819943590014, -0.1610154216972793, 0.045236842048059146, 0.23452763475205113, 0.03745214288251671, 0.24499290013246663, -0.3733422171752294, -0.2504362549852368, -0.004010770191642933, 0.15962558682549866, 0.1095123144956987, -0.019889282343750137, -0.25404233702390294, -0.00014382709817188543, -0.11343691483276283, -0.1687510057221871, -0.007819029881157041, 0.06470542593870493, 0.04410080760158977, -0.2819727045461172, 0.17138256889586223, 0.039196738026793895, 0.05133973770752186, -0.09468458725775523, -0.09699269478035168, -0.016591988587221964, 0.05020874511919976, 0.03280208468043465, 0.037570120222777566, 0.14133204436838265, -0.14083068193754228, -0.02908858029186968, 0.4033153417512653, -0.13457102018098036, -0.1826538292963694, 0.14241891635801432, -0.18584789254331613, -0.030696181553213412, 0.1761781884720776, 0.1566643975762654, 0.11199702161962424, -0.12395947429396939, 0.0828300534148428, -0.023314301889934917, 0.17522100384945308, 0.0821237428534049, -0.014218668408497384, 0.14369142291938689, 0.14151072740834963, -0.0035031374290252363, 0.09991652674299127, -0.10965813481158054, -0.10184554658769591, -0.2973976115264544, -0.09747911212829555, -0.20555837651264164, -0.007137047414614902, -0.13470511449578054, -0.13797442719238107, 0.36883350612020227, 0.1217790739549271, 0.22430023832655535, 0.07526618392184013, 0.2981581719728505, 0.2801128365847138, 0.0011346233891308065, 0.08827569497734065, 0.2896894634558395, 0.17905593546470855, 0.1286068647774315, -0.28667798258243055, 0.06267495427235234, 0.04537211927941175]
1,803.03427
Effects of low-dimensional material channels on energy consumption of Nano-devices
It is commonly believed that the significant energy saving advantages are belonged to the logic circuits which operate at low temperature as less enegy is needed for cooling them to the treshold temperature after operation. Also, nanoscale thermal management, efficient energy usage in nanoscale and especially thermal optimization are the most challenging issues, while dealing with the new generation of transistors as the miniaturizing unlimitedly the silicon channels of the transistors has resulted in an increase in the energy consumption of computers and the leakage currents. In this paper, the non-Fourier thermal attitudes of well-known two-dimensional crystalline materials of graphene, blue phosphorene, germanene, silicene and MoS$_2$ as the silicon channels replacements are studied by using the phonon Monte-Carlo method. We show that graphene and blue phosphorene have the least maximum temperature, representer of the reliability of the transistors, among the all five investigated nano-channels during the Monte-Cralo simulation. The established hotspots of these two materials are always cooler, not reaching the temperature threshold level, and they lose the heat much faster as the heat generation zone is switched off. The obtained results considered along with the electrical disadvantages of the graphene layer, suggests the blue phosphorene as the more thermally appropriate and optimal choice for the silicon channel replacement in new designed field effect transistors. That is to say that the limit of the energy and economic cost of the producing the advanced blue phosphorene chips meets the value of the product for the computing enterprise.
cond-mat.mes-hall
it is commonly believed that the significant energy saving advantages are belonged to the logic circuits which operate at low temperature as less enegy is needed for cooling them to the treshold temperature after operation also nanoscale thermal management efficient energy usage in nanoscale and especially thermal optimization are the most challenging issues while dealing with the new generation of transistors as the miniaturizing unlimitedly the silicon channels of the transistors has resulted in an increase in the energy consumption of computers and the leakage currents in this paper the nonfourier thermal attitudes of wellknown twodimensional crystalline materials of graphene blue phosphorene germanene silicene and mos_2 as the silicon channels replacements are studied by using the phonon montecarlo method we show that graphene and blue phosphorene have the least maximum temperature representer of the reliability of the transistors among the all five investigated nanochannels during the montecralo simulation the established hotspots of these two materials are always cooler not reaching the temperature threshold level and they lose the heat much faster as the heat generation zone is switched off the obtained results considered along with the electrical disadvantages of the graphene layer suggests the blue phosphorene as the more thermally appropriate and optimal choice for the silicon channel replacement in new designed field effect transistors that is to say that the limit of the energy and economic cost of the producing the advanced blue phosphorene chips meets the value of the product for the computing enterprise
[['it', 'is', 'commonly', 'believed', 'that', 'the', 'significant', 'energy', 'saving', 'advantages', 'are', 'belonged', 'to', 'the', 'logic', 'circuits', 'which', 'operate', 'at', 'low', 'temperature', 'as', 'less', 'enegy', 'is', 'needed', 'for', 'cooling', 'them', 'to', 'the', 'treshold', 'temperature', 'after', 'operation', 'also', 'nanoscale', 'thermal', 'management', 'efficient', 'energy', 'usage', 'in', 'nanoscale', 'and', 'especially', 'thermal', 'optimization', 'are', 'the', 'most', 'challenging', 'issues', 'while', 'dealing', 'with', 'the', 'new', 'generation', 'of', 'transistors', 'as', 'the', 'miniaturizing', 'unlimitedly', 'the', 'silicon', 'channels', 'of', 'the', 'transistors', 'has', 'resulted', 'in', 'an', 'increase', 'in', 'the', 'energy', 'consumption', 'of', 'computers', 'and', 'the', 'leakage', 'currents', 'in', 'this', 'paper', 'the', 'nonfourier', 'thermal', 'attitudes', 'of', 'wellknown', 'twodimensional', 'crystalline', 'materials', 'of', 'graphene', 'blue', 'phosphorene', 'germanene', 'silicene', 'and', 'mos_2', 'as', 'the', 'silicon', 'channels', 'replacements', 'are', 'studied', 'by', 'using', 'the', 'phonon', 'montecarlo', 'method', 'we', 'show', 'that', 'graphene', 'and', 'blue', 'phosphorene', 'have', 'the', 'least', 'maximum', 'temperature', 'representer', 'of', 'the', 'reliability', 'of', 'the', 'transistors', 'among', 'the', 'all', 'five', 'investigated', 'nanochannels', 'during', 'the', 'montecralo', 'simulation', 'the', 'established', 'hotspots', 'of', 'these', 'two', 'materials', 'are', 'always', 'cooler', 'not', 'reaching', 'the', 'temperature', 'threshold', 'level', 'and', 'they', 'lose', 'the', 'heat', 'much', 'faster', 'as', 'the', 'heat', 'generation', 'zone', 'is', 'switched', 'off', 'the', 'obtained', 'results', 'considered', 'along', 'with', 'the', 'electrical', 'disadvantages', 'of', 'the', 'graphene', 'layer', 'suggests', 'the', 'blue', 'phosphorene', 'as', 'the', 'more', 'thermally', 'appropriate', 'and', 'optimal', 'choice', 'for', 'the', 'silicon', 'channel', 'replacement', 'in', 'new', 'designed', 'field', 'effect', 'transistors', 'that', 'is', 'to', 'say', 'that', 'the', 'limit', 'of', 'the', 'energy', 'and', 'economic', 'cost', 'of', 'the', 'producing', 'the', 'advanced', 'blue', 'phosphorene', 'chips', 'meets', 'the', 'value', 'of', 'the', 'product', 'for', 'the', 'computing', 'enterprise']]
[-0.13047660199345604, 0.14213336562810286, -0.016278103519497173, 0.010161865754908293, -0.015659857612567697, -0.1664338940146322, 0.07789330941634443, 0.4217001966143749, -0.24095109677731003, -0.2952582514867405, 0.08663105245499055, -0.3081382496244445, -0.10931028049268132, 0.24349181241907028, -0.036317978025775174, 0.04327423806368772, 0.037724413426250825, -0.02508027570426692, -0.03483928301613968, -0.2334628496661174, 0.229970734023337, 0.11704684417238649, 0.34354935227418126, 0.09187581597504263, 0.05736666538809635, -0.04254887107075477, 0.05198558017288392, 0.0009760707094124993, -0.09576604374154585, 0.08734106141836287, 0.2651597764352527, -0.0033455019911789166, 0.2836854988404987, -0.48046578158225334, -0.22592588081879883, 0.05579282851344478, 0.11449368284891683, 0.08388729667604654, -0.08132556733248841, -0.19202006385490603, 0.1004369615501135, -0.15399924888969305, -0.09529405591108989, -0.02382292304739204, -0.0015525362563642616, 0.0075868733700041715, -0.18091671458607045, 0.03925161035814589, 0.04307673418780371, 0.015277998966678065, -0.05608910334555489, -0.18788536158675442, -0.11190986372150329, 0.08678491792762746, 0.02762589416447647, -0.01780145428635237, 0.24080543009782857, -0.16145025295661572, -0.10220875050207334, 0.3747025253963942, -0.016965734257305763, -0.10297849220295, 0.17157613733350965, -0.11773102763013876, -0.07611423753610604, 0.13528358734649967, 0.11386396115009045, 0.10391148482164254, -0.1756663970601726, 0.027973237702960375, 0.04853112037146312, 0.13296204892946978, 0.09978536580670244, 0.12093879129566557, 0.22191300286189178, 0.2202716459710227, 0.07363951349635703, 0.1503476313529156, -0.1111699143064693, -0.0526181782196675, -0.212898066419899, -0.21036292159910866, -0.18526390890296243, 0.05934243511024872, -0.09923741222146604, -0.18944554456832763, 0.38844454443576387, 0.16703543558868827, 0.11280573689549857, 0.0038916431562214786, 0.34000677685348357, 0.1468106355380305, 0.13674021509799117, 0.0749865743227075, 0.2661315684648687, 0.1437460175591844, 0.1533181372887398, -0.24469054013547697, 0.06546197939160452, -0.04155148026552431]
1,803.03428
A Bias Aware News Recommendation System
In this era of fake news and political polarization, it is desirable to have a system to enable users to access balanced news content. Current solutions focus on top down, server based approaches to decide whether a news article is fake or biased, and display only trusted news to the end users. In this paper, we follow a different approach to help the users make informed choices about which news they want to read, making users aware in real time of the bias in news articles they were browsing and recommending news articles from other sources on the same topic with different levels of bias. We use a recent Pew research report to collect news sources that readers with varying political inclinations prefer to read. We then scrape news articles on a variety of topics from these varied news sources. After this, we perform clustering to find similar topics of the articles, as well as calculate a bias score for each article. For a news article the user is currently reading, we display the bias score and also display other articles on the same topic, out of the previously collected articles, from different news sources. This we present to the user. This approach, we hope, would make it possible for users to access more balanced articles on given news topics. We present the implementation details of the system along with some preliminary results on news articles.
cs.IR cs.HC
in this era of fake news and political polarization it is desirable to have a system to enable users to access balanced news content current solutions focus on top down server based approaches to decide whether a news article is fake or biased and display only trusted news to the end users in this paper we follow a different approach to help the users make informed choices about which news they want to read making users aware in real time of the bias in news articles they were browsing and recommending news articles from other sources on the same topic with different levels of bias we use a recent pew research report to collect news sources that readers with varying political inclinations prefer to read we then scrape news articles on a variety of topics from these varied news sources after this we perform clustering to find similar topics of the articles as well as calculate a bias score for each article for a news article the user is currently reading we display the bias score and also display other articles on the same topic out of the previously collected articles from different news sources this we present to the user this approach we hope would make it possible for users to access more balanced articles on given news topics we present the implementation details of the system along with some preliminary results on news articles
[['in', 'this', 'era', 'of', 'fake', 'news', 'and', 'political', 'polarization', 'it', 'is', 'desirable', 'to', 'have', 'a', 'system', 'to', 'enable', 'users', 'to', 'access', 'balanced', 'news', 'content', 'current', 'solutions', 'focus', 'on', 'top', 'down', 'server', 'based', 'approaches', 'to', 'decide', 'whether', 'a', 'news', 'article', 'is', 'fake', 'or', 'biased', 'and', 'display', 'only', 'trusted', 'news', 'to', 'the', 'end', 'users', 'in', 'this', 'paper', 'we', 'follow', 'a', 'different', 'approach', 'to', 'help', 'the', 'users', 'make', 'informed', 'choices', 'about', 'which', 'news', 'they', 'want', 'to', 'read', 'making', 'users', 'aware', 'in', 'real', 'time', 'of', 'the', 'bias', 'in', 'news', 'articles', 'they', 'were', 'browsing', 'and', 'recommending', 'news', 'articles', 'from', 'other', 'sources', 'on', 'the', 'same', 'topic', 'with', 'different', 'levels', 'of', 'bias', 'we', 'use', 'a', 'recent', 'pew', 'research', 'report', 'to', 'collect', 'news', 'sources', 'that', 'readers', 'with', 'varying', 'political', 'inclinations', 'prefer', 'to', 'read', 'we', 'then', 'scrape', 'news', 'articles', 'on', 'a', 'variety', 'of', 'topics', 'from', 'these', 'varied', 'news', 'sources', 'after', 'this', 'we', 'perform', 'clustering', 'to', 'find', 'similar', 'topics', 'of', 'the', 'articles', 'as', 'well', 'as', 'calculate', 'a', 'bias', 'score', 'for', 'each', 'article', 'for', 'a', 'news', 'article', 'the', 'user', 'is', 'currently', 'reading', 'we', 'display', 'the', 'bias', 'score', 'and', 'also', 'display', 'other', 'articles', 'on', 'the', 'same', 'topic', 'out', 'of', 'the', 'previously', 'collected', 'articles', 'from', 'different', 'news', 'sources', 'this', 'we', 'present', 'to', 'the', 'user', 'this', 'approach', 'we', 'hope', 'would', 'make', 'it', 'possible', 'for', 'users', 'to', 'access', 'more', 'balanced', 'articles', 'on', 'given', 'news', 'topics', 'we', 'present', 'the', 'implementation', 'details', 'of', 'the', 'system', 'along', 'with', 'some', 'preliminary', 'results', 'on', 'news', 'articles']]
[-0.07628544975196454, 0.03332160758367598, -0.06579621308542377, 0.09615009702185674, -0.22440928969753243, -0.15522043632172736, 0.14887100843548917, 0.46182274387486405, -0.2017118327042889, -0.32300425682343165, 0.05312088074091569, -0.40876647414860584, -0.12805133001480284, 0.19353934811424242, -0.09266378980896275, -0.03758073400832334, 0.07012528643185684, 0.07414669057914704, -0.026186971171705795, -0.38722282827247756, 0.3300086059212937, 0.0786514223170451, 0.3359817697398238, 0.06813731940534218, 0.0632347360182301, -0.02484977891534504, -0.18055221260430576, -0.006602474689578353, -0.12609818056576627, 0.10902579630511987, 0.3810744896004276, 0.19507732560810775, 0.3303132074711434, -0.3752644839933363, -0.12675939029145797, 0.06265763944543709, 0.10324699321161893, 0.13700131644145586, -0.028234188664239393, -0.35530897497073194, 0.09258688161528464, -0.23157191988064954, -0.03970793359794544, -0.05564455937108782, 0.02412089586684133, 0.053860956829459024, -0.20224627758469038, 0.0351308596751335, -7.811404115488848e-05, 0.07169289577168302, 0.033786948146772085, -0.08678019825286248, 0.042414280402442536, 0.19751855482098693, 0.14774205444096508, 0.011360930217729912, 0.17992264749600662, -0.15298411976427662, -0.14432004825567227, 0.38559321577313466, -0.018269823842891098, -0.18239294214596405, 0.17721989540969244, -0.0643433914401458, -0.16778526304810606, 0.05768052279609808, 0.2688946792741417, 0.09136746895807338, -0.18450824053705497, -0.07008029924228618, -0.057607957663140814, 0.23161473871855917, 0.1152731577818424, -0.0012747196725301317, 0.23605816438794136, 0.13915346146332322, 0.05821316566819451, 0.08878657643257057, -0.015818494231976822, -0.04661453585658357, -0.22286914718254486, -0.12286388537436092, -0.1274145656537612, 0.08067137399053012, -0.025020065387637923, -0.13867774490149637, 0.43892783980216765, 0.23702146903753785, 0.16315583492060964, 0.010250522731902014, 0.274111188956047, -0.023125005196345874, 0.043264887160503196, 0.08428782595112383, 0.12499053329804032, -0.047164108334858984, 0.26006502894511035, -0.05719712915558021, 0.08747198169220287, -0.03755292441731445]
1,803.03429
Enskog kinetic theory for a model of a confined quasi-two-dimensional granular fluid
The Navier-Stokes transport coefficients for a model of a confined quasi-two-dimensional granular gas of smooth inelastic hard spheres are derived from the Enskog kinetic equation. A normal solution to this kinetic equation is obtained via the Chapman-Enskog method for states close to the local homogeneous state. The analysis is performed to first order in spatial gradients, allowing the identification of the Navier-Stokes transport coefficients associated with the heat and momentum fluxes. The transport coefficients are determined from the solution to a set of coupled linear integral equations analogous to those for elastic collisions. These integral equations are solved by using the leading terms in a Sonine polynomial expansion. The results are particularized to the relevant state with stationary temperature, where explicit expressions for the Navier-Stokes transport coefficients are given in terms of the coefficient of restitution and the solid volume fraction. The present work extends to moderate densities previous results [Brey \emph{et al.} Phys. Rev. E \textbf{91}, 052201 (2015)] derived for low-density granular gases.
cond-mat.stat-mech
the navierstokes transport coefficients for a model of a confined quasitwodimensional granular gas of smooth inelastic hard spheres are derived from the enskog kinetic equation a normal solution to this kinetic equation is obtained via the chapmanenskog method for states close to the local homogeneous state the analysis is performed to first order in spatial gradients allowing the identification of the navierstokes transport coefficients associated with the heat and momentum fluxes the transport coefficients are determined from the solution to a set of coupled linear integral equations analogous to those for elastic collisions these integral equations are solved by using the leading terms in a sonine polynomial expansion the results are particularized to the relevant state with stationary temperature where explicit expressions for the navierstokes transport coefficients are given in terms of the coefficient of restitution and the solid volume fraction the present work extends to moderate densities previous results brey emphet al phys rev e textbf91 052201 2015 derived for lowdensity granular gases
[['the', 'navierstokes', 'transport', 'coefficients', 'for', 'a', 'model', 'of', 'a', 'confined', 'quasitwodimensional', 'granular', 'gas', 'of', 'smooth', 'inelastic', 'hard', 'spheres', 'are', 'derived', 'from', 'the', 'enskog', 'kinetic', 'equation', 'a', 'normal', 'solution', 'to', 'this', 'kinetic', 'equation', 'is', 'obtained', 'via', 'the', 'chapmanenskog', 'method', 'for', 'states', 'close', 'to', 'the', 'local', 'homogeneous', 'state', 'the', 'analysis', 'is', 'performed', 'to', 'first', 'order', 'in', 'spatial', 'gradients', 'allowing', 'the', 'identification', 'of', 'the', 'navierstokes', 'transport', 'coefficients', 'associated', 'with', 'the', 'heat', 'and', 'momentum', 'fluxes', 'the', 'transport', 'coefficients', 'are', 'determined', 'from', 'the', 'solution', 'to', 'a', 'set', 'of', 'coupled', 'linear', 'integral', 'equations', 'analogous', 'to', 'those', 'for', 'elastic', 'collisions', 'these', 'integral', 'equations', 'are', 'solved', 'by', 'using', 'the', 'leading', 'terms', 'in', 'a', 'sonine', 'polynomial', 'expansion', 'the', 'results', 'are', 'particularized', 'to', 'the', 'relevant', 'state', 'with', 'stationary', 'temperature', 'where', 'explicit', 'expressions', 'for', 'the', 'navierstokes', 'transport', 'coefficients', 'are', 'given', 'in', 'terms', 'of', 'the', 'coefficient', 'of', 'restitution', 'and', 'the', 'solid', 'volume', 'fraction', 'the', 'present', 'work', 'extends', 'to', 'moderate', 'densities', 'previous', 'results', 'brey', 'emphet', 'al', 'phys', 'rev', 'e', 'textbf91', '052201', '2015', 'derived', 'for', 'lowdensity', 'granular', 'gases']]
[-0.1247026674778692, 0.10868635654243772, -0.07147460595984584, -0.021820996850129056, -0.04765400006235834, -0.08133292441814138, -0.014784110540044179, 0.27897120455702756, -0.2707967239352046, -0.2573289978203644, 0.0412262021856771, -0.306378015439866, -0.06693387638343258, 0.19751027626259698, 0.014655843765640551, 0.1302878418726635, 0.03754631558467457, -0.013851862152227046, -0.07837265488074556, -0.24143564051439975, 0.282985602491221, 0.059904031964030366, 0.255844816731209, 0.03274561231670204, 0.12882055378193322, -0.024871889350398736, -0.03338901762653462, 0.04364812562093596, -0.2160584622039888, 0.09406488623303659, 0.2608262224999925, -0.061128239790863285, 0.18177125596104224, -0.4508819577885517, -0.2464431646662804, 0.03803719019665857, 0.10569420910263262, 0.0988203007013657, -0.004162330761768975, -0.2692193792950065, 0.019848999103097006, -0.17541078801489682, -0.16757913935426738, -0.11878563353700415, 0.026671693606039316, 0.0794001878182078, -0.31736345602873645, 0.20599989496754265, 0.032976491913839355, 0.021170858011660996, -0.12785790246151432, -0.12934349593277905, -0.01753202564957226, 0.04046893636931728, 0.00892807376939529, 0.01546349070474871, 0.10175001085146639, -0.1460431936647646, -0.032647238752913255, 0.3851335727798244, -0.08545002206785753, -0.25250016960677507, 0.21336466952746996, -0.14823899102437257, -0.05490162098020361, 0.1990616697063841, 0.1603887966016959, 0.14253304783859078, -0.20855597604317533, 0.0894065954732463, -0.08992721459687619, 0.10501790769466776, 0.08433784877001507, -0.04491928783659623, 0.13447686313920043, 0.10256948239781374, -0.012431943554865436, 0.12552273663387925, -0.06632450819079781, -0.1457784466229042, -0.31727694343501256, -0.17006410393389684, -0.1919161920304313, 0.06669155196672408, -0.07275548139340644, -0.14172885618872505, 0.3070245187735311, 0.10117965304732689, 0.20474249030251992, 0.041054008117208454, 0.25628538830834297, 0.1993892632834249, -0.028549585872804, 0.13865583542265866, 0.23453162839647634, 0.21336492431418616, 0.1606583594183146, -0.264362866186074, 0.04863998977727388, 0.16778460485243632]
1,803.0343
VR Content Capture using Aligned Smartphones
There are a number of dedicated 3D capture devices in the market, but generally they are unaffordable and do not make use of existing smartphone cameras, which are generally of decent quality. Due to this, while there are several means to consume 3D or VR content, there is currently lack of means to capture 3D content, resulting in very few 3D videos being publicly available. Some mobile applications such as Camerada enable 3D or VR content capture by combining the output of two existing smartphones, but users would have to hold the cameras in their hand, making it difficult to align properly. In this paper we present the design of a system to enable 3D content capture using one or more smartphones, taking care of alignment issues so as to get optimal alignment of the smartphone cameras. We aim to keep the distance between the cameras constant and equal to the inter-pupillary distance of about 6.5 cm. Our solution is applicable for one, two and three smartphones. We have a mobile app to generate a template given the dimensions of the smartphones, camera positions and other specifications. The template can be printed by the user and cut out on 2D cardboard, similar to Google cardboard. Alternatively, it can be printed using a 3D printer. During video capture, with the smartphones aligned using our printed template, we capture videos which are then combined to get the optimal 3D content. We present the details of a small proof of concept implementation. Our solution would make it easier for people to use existing smartphones to generate 3D content.
cs.HC
there are a number of dedicated 3d capture devices in the market but generally they are unaffordable and do not make use of existing smartphone cameras which are generally of decent quality due to this while there are several means to consume 3d or vr content there is currently lack of means to capture 3d content resulting in very few 3d videos being publicly available some mobile applications such as camerada enable 3d or vr content capture by combining the output of two existing smartphones but users would have to hold the cameras in their hand making it difficult to align properly in this paper we present the design of a system to enable 3d content capture using one or more smartphones taking care of alignment issues so as to get optimal alignment of the smartphone cameras we aim to keep the distance between the cameras constant and equal to the interpupillary distance of about 65 cm our solution is applicable for one two and three smartphones we have a mobile app to generate a template given the dimensions of the smartphones camera positions and other specifications the template can be printed by the user and cut out on 2d cardboard similar to google cardboard alternatively it can be printed using a 3d printer during video capture with the smartphones aligned using our printed template we capture videos which are then combined to get the optimal 3d content we present the details of a small proof of concept implementation our solution would make it easier for people to use existing smartphones to generate 3d content
[['there', 'are', 'a', 'number', 'of', 'dedicated', '3d', 'capture', 'devices', 'in', 'the', 'market', 'but', 'generally', 'they', 'are', 'unaffordable', 'and', 'do', 'not', 'make', 'use', 'of', 'existing', 'smartphone', 'cameras', 'which', 'are', 'generally', 'of', 'decent', 'quality', 'due', 'to', 'this', 'while', 'there', 'are', 'several', 'means', 'to', 'consume', '3d', 'or', 'vr', 'content', 'there', 'is', 'currently', 'lack', 'of', 'means', 'to', 'capture', '3d', 'content', 'resulting', 'in', 'very', 'few', '3d', 'videos', 'being', 'publicly', 'available', 'some', 'mobile', 'applications', 'such', 'as', 'camerada', 'enable', '3d', 'or', 'vr', 'content', 'capture', 'by', 'combining', 'the', 'output', 'of', 'two', 'existing', 'smartphones', 'but', 'users', 'would', 'have', 'to', 'hold', 'the', 'cameras', 'in', 'their', 'hand', 'making', 'it', 'difficult', 'to', 'align', 'properly', 'in', 'this', 'paper', 'we', 'present', 'the', 'design', 'of', 'a', 'system', 'to', 'enable', '3d', 'content', 'capture', 'using', 'one', 'or', 'more', 'smartphones', 'taking', 'care', 'of', 'alignment', 'issues', 'so', 'as', 'to', 'get', 'optimal', 'alignment', 'of', 'the', 'smartphone', 'cameras', 'we', 'aim', 'to', 'keep', 'the', 'distance', 'between', 'the', 'cameras', 'constant', 'and', 'equal', 'to', 'the', 'interpupillary', 'distance', 'of', 'about', '65', 'cm', 'our', 'solution', 'is', 'applicable', 'for', 'one', 'two', 'and', 'three', 'smartphones', 'we', 'have', 'a', 'mobile', 'app', 'to', 'generate', 'a', 'template', 'given', 'the', 'dimensions', 'of', 'the', 'smartphones', 'camera', 'positions', 'and', 'other', 'specifications', 'the', 'template', 'can', 'be', 'printed', 'by', 'the', 'user', 'and', 'cut', 'out', 'on', '2d', 'cardboard', 'similar', 'to', 'google', 'cardboard', 'alternatively', 'it', 'can', 'be', 'printed', 'using', 'a', '3d', 'printer', 'during', 'video', 'capture', 'with', 'the', 'smartphones', 'aligned', 'using', 'our', 'printed', 'template', 'we', 'capture', 'videos', 'which', 'are', 'then', 'combined', 'to', 'get', 'the', 'optimal', '3d', 'content', 'we', 'present', 'the', 'details', 'of', 'a', 'small', 'proof', 'of', 'concept', 'implementation', 'our', 'solution', 'would', 'make', 'it', 'easier', 'for', 'people', 'to', 'use', 'existing', 'smartphones', 'to', 'generate', '3d', 'content']]
[-0.07184296932329066, 0.02260379252703896, -0.06682584881995, 0.04997488140472044, -0.13850427241358523, -0.1973772583493499, 0.006526805609623997, 0.46738551863019456, -0.2537971230634548, -0.3774957833209645, 0.11875223018540629, -0.33202104369610436, -0.11860354056408338, 0.20075312013137633, -0.14205009711396388, 0.04108342985549991, 0.07393875898007204, 0.045278712964577764, -0.044461491334025424, -0.2751605628773627, 0.26615830237389376, 0.03000118106447812, 0.2890520087113965, 0.025075078538190503, 0.068677706102143, -0.011442403063822552, -0.05286245474776877, 0.02851250908468556, -0.06896621143417044, 0.18259907167355313, 0.2850931220406404, 0.1749771317810585, 0.23265021677507874, -0.4978366672581933, -0.17686861352251396, 0.061432358929214594, 0.15686145740558533, 0.10201553367751123, -0.08221936940390151, -0.3023351956855598, 0.14064616629917584, -0.19939810059390992, -0.07749523827534996, -0.08927633049995232, 0.011326808894067265, 0.035215051133038196, -0.2443124979288236, -0.03470676940044268, -0.014733617828748128, 0.061956923692257006, -0.017754301152419133, -0.05280692686066527, -0.01054263122232822, 0.25706932738603944, 0.04656041979244397, 0.010864581675498884, 0.1454751390982384, -0.14808192124418532, -0.04933535152720465, 0.43705389925770943, 0.016111718002926316, -0.22621135384255148, 0.22912701701647123, -0.07913716329959267, -0.0742090901425427, 0.13423440196044997, 0.2073989372820852, 0.11858276867359954, -0.16559386124813172, -0.000887668269514655, -0.011037609477513276, 0.22424693014906513, 0.06355401520270273, 0.04191369369994325, 0.2264024370027699, 0.17361309516735857, 0.05822783442145079, 0.08098033909396421, -0.11177836360129663, -0.041530315245027184, -0.18581887620865073, -0.17585400355618602, -0.1870879763170737, 0.037913752294877215, -0.046551905739457104, -0.16446710882744728, 0.35329628139539504, 0.2495694130565263, 0.17762234395178667, 0.04571961650063599, 0.37709454167988365, 0.020733690282822136, 0.15458640404056206, 0.0586792154896282, 0.19999846659776463, -0.028915979714800574, 0.17720991272050818, -0.09465273748994751, 0.05739336136459398, 0.026984818808259904]
1,803.03431
Interference-Aware Flexible TDD Design for Massive MIMO 5G Systems
Both the use of very large arrays of antennas and flexible time division duplexing (TDD) designs have become prominent features of next generation 5G cellular systems. However, both enabling technologies suffer from severe interference effects, respectively known as pilot contamination and base-station-to-base-station (B2B) interference. In this paper, a practical novel TDD design principle is proposed for massive multiple-input multiple-output (MIMO) heterogeneous networks (HetNets) that leverages the inherent features of a flexible TDD design to mitigate both the beamformed interference caused by the pilot contamination effect and B2B interference. The design is based on the key observation that the transmission path chosen for training by the non-massive MIMO base stations plays an important role in the interference behavior of the network, and the data slots need to be configured accordingly. We propose TDFLEX, a low-complexity heuristic solution that follows these design guidelines. Performance evaluation results show significant gains when our design is compared to the standard TD-LTE.
cs.IT math.IT
both the use of very large arrays of antennas and flexible time division duplexing tdd designs have become prominent features of next generation 5g cellular systems however both enabling technologies suffer from severe interference effects respectively known as pilot contamination and basestationtobasestation b2b interference in this paper a practical novel tdd design principle is proposed for massive multipleinput multipleoutput mimo heterogeneous networks hetnets that leverages the inherent features of a flexible tdd design to mitigate both the beamformed interference caused by the pilot contamination effect and b2b interference the design is based on the key observation that the transmission path chosen for training by the nonmassive mimo base stations plays an important role in the interference behavior of the network and the data slots need to be configured accordingly we propose tdflex a lowcomplexity heuristic solution that follows these design guidelines performance evaluation results show significant gains when our design is compared to the standard tdlte
[['both', 'the', 'use', 'of', 'very', 'large', 'arrays', 'of', 'antennas', 'and', 'flexible', 'time', 'division', 'duplexing', 'tdd', 'designs', 'have', 'become', 'prominent', 'features', 'of', 'next', 'generation', '5g', 'cellular', 'systems', 'however', 'both', 'enabling', 'technologies', 'suffer', 'from', 'severe', 'interference', 'effects', 'respectively', 'known', 'as', 'pilot', 'contamination', 'and', 'basestationtobasestation', 'b2b', 'interference', 'in', 'this', 'paper', 'a', 'practical', 'novel', 'tdd', 'design', 'principle', 'is', 'proposed', 'for', 'massive', 'multipleinput', 'multipleoutput', 'mimo', 'heterogeneous', 'networks', 'hetnets', 'that', 'leverages', 'the', 'inherent', 'features', 'of', 'a', 'flexible', 'tdd', 'design', 'to', 'mitigate', 'both', 'the', 'beamformed', 'interference', 'caused', 'by', 'the', 'pilot', 'contamination', 'effect', 'and', 'b2b', 'interference', 'the', 'design', 'is', 'based', 'on', 'the', 'key', 'observation', 'that', 'the', 'transmission', 'path', 'chosen', 'for', 'training', 'by', 'the', 'nonmassive', 'mimo', 'base', 'stations', 'plays', 'an', 'important', 'role', 'in', 'the', 'interference', 'behavior', 'of', 'the', 'network', 'and', 'the', 'data', 'slots', 'need', 'to', 'be', 'configured', 'accordingly', 'we', 'propose', 'tdflex', 'a', 'lowcomplexity', 'heuristic', 'solution', 'that', 'follows', 'these', 'design', 'guidelines', 'performance', 'evaluation', 'results', 'show', 'significant', 'gains', 'when', 'our', 'design', 'is', 'compared', 'to', 'the', 'standard', 'tdlte']]
[-0.26136028157700575, 0.027488402714714703, -0.0022048345047303223, 0.021260510411948062, -0.11012886652674575, -0.22107725124806166, 0.07233361771871492, 0.3795993965566642, -0.23553710735657, -0.2568358699441923, 0.08904043981932443, -0.22358922013263036, -0.2605746871362404, 0.15132690282453867, -0.12558248299234487, 0.0423928815913054, 0.08145468961749855, -0.06965457619010627, -0.008042527981066182, -0.22126775245823257, 0.30540215950262695, 0.16230549842917494, 0.4455846952177681, 0.0006908943767768223, 0.05675869123698756, 0.022851490046732224, -0.052910386545390084, -0.04748796629409499, -0.035529757728117936, 0.06976533321325075, 0.3667364147092615, 0.21310169207666965, 0.32941048686670793, -0.42798135193766323, -0.2630009718674731, 0.06866830989473512, 0.203869864758854, 0.056889655582558415, -0.10493260129149277, -0.27870235887852, 0.11663465970498207, -0.2299335828147732, -0.04709911383930352, 0.00341271880017019, -0.09435455759007533, 0.02198370571577825, -0.36180136460423856, -0.018691936589463, 0.017723338518219143, 0.020641022658144884, 0.006654464598902344, -0.16755212833439664, 0.07334098411427642, 0.16288484400988695, 0.013567996932520204, -0.033180553916624035, 0.08468989493253916, -0.08737903203537034, -0.13851719623576705, 0.40588793085355845, 0.01640807302946878, -0.22261257735746248, 0.15317257936188178, -0.06476709676011429, -0.10787227409045128, 0.15853535728952425, 0.2919777888175729, 0.03798850910895347, -0.19822191167896835, -0.006406879921854994, 0.04871437628148728, 0.18710515596420058, 0.09172069270302868, 0.16827178322453076, 0.18367586080605722, 0.2699525273063329, 0.09874666260416293, 0.11354895958498532, -0.16807131699207783, -0.1055858912938214, -0.1978713666911346, -0.10699038033550545, -0.18369454965781565, 0.012610358385635274, -0.0907636135268515, -0.09318857199766419, 0.3216948714470128, 0.1794489793516862, 0.05628950064155189, 0.11123655315385769, 0.42971058226154224, 0.0778344954952126, 0.14682973286306317, 0.07019472410206913, 0.21159773339916552, 0.06933014595717821, 0.16709926202530404, -0.25457453489297543, 0.05568307527498185, -0.1062242910205447]
1,803.03432
Bayesian Optimization for Dynamic Problems
We propose practical extensions to Bayesian optimization for solving dynamic problems. We model dynamic objective functions using spatiotemporal Gaussian process priors which capture all the instances of the functions over time. Our extensions to Bayesian optimization use the information learnt from this model to guide the tracking of a temporally evolving minimum. By exploiting temporal correlations, the proposed method also determines when to make evaluations, how fast to make those evaluations, and it induces an appropriate budget of steps based on the available information. Lastly, we evaluate our technique on synthetic and real-world problems.
stat.ML
we propose practical extensions to bayesian optimization for solving dynamic problems we model dynamic objective functions using spatiotemporal gaussian process priors which capture all the instances of the functions over time our extensions to bayesian optimization use the information learnt from this model to guide the tracking of a temporally evolving minimum by exploiting temporal correlations the proposed method also determines when to make evaluations how fast to make those evaluations and it induces an appropriate budget of steps based on the available information lastly we evaluate our technique on synthetic and realworld problems
[['we', 'propose', 'practical', 'extensions', 'to', 'bayesian', 'optimization', 'for', 'solving', 'dynamic', 'problems', 'we', 'model', 'dynamic', 'objective', 'functions', 'using', 'spatiotemporal', 'gaussian', 'process', 'priors', 'which', 'capture', 'all', 'the', 'instances', 'of', 'the', 'functions', 'over', 'time', 'our', 'extensions', 'to', 'bayesian', 'optimization', 'use', 'the', 'information', 'learnt', 'from', 'this', 'model', 'to', 'guide', 'the', 'tracking', 'of', 'a', 'temporally', 'evolving', 'minimum', 'by', 'exploiting', 'temporal', 'correlations', 'the', 'proposed', 'method', 'also', 'determines', 'when', 'to', 'make', 'evaluations', 'how', 'fast', 'to', 'make', 'those', 'evaluations', 'and', 'it', 'induces', 'an', 'appropriate', 'budget', 'of', 'steps', 'based', 'on', 'the', 'available', 'information', 'lastly', 'we', 'evaluate', 'our', 'technique', 'on', 'synthetic', 'and', 'realworld', 'problems']]
[-0.02511615414008934, -0.013645639161156995, -0.10540895282905152, 0.09189519859510836, -0.13151993517803542, -0.1327302769926238, 0.06473322439582106, 0.4579568552026684, -0.3266488951729967, -0.3345257271715301, 0.10305101188652693, -0.23557211965956587, -0.20828875138280675, 0.20582687667511562, -0.06449710318144966, 0.10976617312940591, 0.1025940046962747, -0.0023059088617880296, -0.089699040979464, -0.27721028634287576, 0.30034652094915104, 0.07418583966098091, 0.2882201972397718, 0.03534945895637762, 0.1540100544113963, 0.05337896734040151, -0.06593539691629245, 0.010922953962940386, -0.1274210723721363, 0.16597912172747262, 0.26286072829896784, 0.24866107017535002, 0.3385046510759028, -0.4323549227432368, -0.2373298574387631, 0.11331076021157602, 0.10857140949550778, 0.0937331030033826, -0.008208230754578525, -0.30202013583100856, 0.06227013470723908, -0.11782577050294965, -0.028964313415889727, -0.15142520814341434, -0.049138263539173346, 0.037540720676646586, -0.35637602913490635, 0.023394928969866398, 0.013102545640728575, 0.010342088671638928, -0.06771153282928974, -0.09085933812101313, 0.04896811196243668, 0.1356563767126608, 0.0317233584377236, -0.011501083554244264, 0.13719382677772182, -0.12317878657763395, -0.16197048089258928, 0.34684259557422803, -0.03676563146662839, -0.260296930796764, 0.16951479060832966, -0.026775460219644803, -0.13623451853190807, 0.1004473618826175, 0.2494080680065808, 0.17671349604534817, -0.17433678473923678, 0.02485807821962071, -0.04182636829964975, 0.18959243702603149, 0.00010250118422381421, -0.008268548646307688, 0.15370715873692423, 0.20298004337398218, 0.08420589856526002, 0.17828436029401232, -0.10014737125714013, -0.15206535517713649, -0.26814844365172247, -0.06748644264038414, -0.1692749222485408, -0.03869555645097206, -0.11990518595477159, -0.16589681746715562, 0.42553200929405843, 0.27971729948284463, 0.2008521910360519, 0.11057469555043041, 0.3601925991317059, 0.09588541781797291, 0.06679205485480896, 0.08747932979678537, 0.13238133485627143, 0.07577615997387453, 0.10453740733631074, -0.19635144641692254, 0.08325635520444113, 0.017345173602695874]
1,803.03433
Wall slip of complex fluids: interfacial friction or slip length?
Using a dynamic Surface Force Apparatus, we demonstrate that the notion of slip length used to describe the boundary flow of simple liquids, is not appropriate for viscoelastic liquids. Rather, the appropriate description lies in the original Navier's partial slip boundary condition, formulated in terms of an interfacial friction coefficient. We establish an exact analytical expression to extract the interfacial friction coefficient from oscillatory drainage forces between a sphere and a plane, suitable for dynamic SFA or Atomic Force Microscopy non-contact measurements. We use this model to investigate the boundary friction of viscoelastic polymer solutions over 5 decades of film thicknesses and one decade in frequency. The proper use of the original Navier's condition describes accurately the complex hydrodynamic force up to scales of tens of micrometers, with a simple "Newtonian-like" friction coefficient, not frequency dependent, and reflecting closely the dynamics of an interfacial depletion layer at the solution/solid interface.
cond-mat.soft physics.flu-dyn
using a dynamic surface force apparatus we demonstrate that the notion of slip length used to describe the boundary flow of simple liquids is not appropriate for viscoelastic liquids rather the appropriate description lies in the original naviers partial slip boundary condition formulated in terms of an interfacial friction coefficient we establish an exact analytical expression to extract the interfacial friction coefficient from oscillatory drainage forces between a sphere and a plane suitable for dynamic sfa or atomic force microscopy noncontact measurements we use this model to investigate the boundary friction of viscoelastic polymer solutions over 5 decades of film thicknesses and one decade in frequency the proper use of the original naviers condition describes accurately the complex hydrodynamic force up to scales of tens of micrometers with a simple newtonianlike friction coefficient not frequency dependent and reflecting closely the dynamics of an interfacial depletion layer at the solutionsolid interface
[['using', 'a', 'dynamic', 'surface', 'force', 'apparatus', 'we', 'demonstrate', 'that', 'the', 'notion', 'of', 'slip', 'length', 'used', 'to', 'describe', 'the', 'boundary', 'flow', 'of', 'simple', 'liquids', 'is', 'not', 'appropriate', 'for', 'viscoelastic', 'liquids', 'rather', 'the', 'appropriate', 'description', 'lies', 'in', 'the', 'original', 'naviers', 'partial', 'slip', 'boundary', 'condition', 'formulated', 'in', 'terms', 'of', 'an', 'interfacial', 'friction', 'coefficient', 'we', 'establish', 'an', 'exact', 'analytical', 'expression', 'to', 'extract', 'the', 'interfacial', 'friction', 'coefficient', 'from', 'oscillatory', 'drainage', 'forces', 'between', 'a', 'sphere', 'and', 'a', 'plane', 'suitable', 'for', 'dynamic', 'sfa', 'or', 'atomic', 'force', 'microscopy', 'noncontact', 'measurements', 'we', 'use', 'this', 'model', 'to', 'investigate', 'the', 'boundary', 'friction', 'of', 'viscoelastic', 'polymer', 'solutions', 'over', '5', 'decades', 'of', 'film', 'thicknesses', 'and', 'one', 'decade', 'in', 'frequency', 'the', 'proper', 'use', 'of', 'the', 'original', 'naviers', 'condition', 'describes', 'accurately', 'the', 'complex', 'hydrodynamic', 'force', 'up', 'to', 'scales', 'of', 'tens', 'of', 'micrometers', 'with', 'a', 'simple', 'newtonianlike', 'friction', 'coefficient', 'not', 'frequency', 'dependent', 'and', 'reflecting', 'closely', 'the', 'dynamics', 'of', 'an', 'interfacial', 'depletion', 'layer', 'at', 'the', 'solutionsolid', 'interface']]
[-0.1761137696620602, 0.14450839699209658, -0.11739656341411783, -0.010143233069387459, -0.09172716638660872, -0.15192841484692673, -0.019758482292160116, 0.3395563213329687, -0.3267913772787074, -0.2606379992184823, 0.04883871145387049, -0.22167945321924334, -0.16106179671755824, 0.1891381801918599, -0.02595295899566388, 0.09472731648375524, 0.009969275416618826, -0.007898597271750437, -0.040176235094053936, -0.1495350579881178, 0.2783072432846881, 0.030419008787596385, 0.28321582480840035, 0.12972027998911403, 0.15661496899071956, 0.025173896195479488, 0.02372906094529485, 0.06090178393844094, -0.25189875209284673, 0.06972450443899772, 0.2141372193379215, -0.07776005283910656, 0.22367430864302004, -0.5117068369841615, -0.23421711910941057, 0.0022751638250137936, 0.0849831568158463, 0.12378787191197176, 0.025871237280509815, -0.221601808414757, 0.00987078893879716, -0.1462634272698388, -0.17418742514896712, -0.039646305587617746, 0.06102859876399872, 0.020055544156356145, -0.25955113946716457, 0.17489723394931161, 0.03339080297506895, 0.11127943056733222, -0.13717347901117607, -0.03346777366296132, 0.008947039590273428, 0.12142068472801826, 0.05693432683634553, 0.014248876116744824, 0.22549168734058062, -0.14079993119582085, -0.01744072538356753, 0.38345249724768155, -0.0621009344022546, -0.23692530065449893, 0.22566444526782772, -0.1289387021226271, -0.00526495961997433, 0.17583920109717038, 0.14418822676630927, 0.10800469132693447, -0.18696279389839995, 0.012144545804562309, -0.019054595481810602, 0.20925612453427542, 0.14349015488526815, -0.05050777164819156, 0.17898148910186235, 0.18926397750026003, 0.06742260040990358, 0.15205602388166442, -0.09757740011644993, -0.07710092355678445, -0.28342468842814034, -0.1674005164469486, -0.18391577820778018, 0.043192106777459896, -0.1373745971663047, -0.20324621898131506, 0.33831333017114223, 0.13345283641161135, 0.1763461690721096, 0.05297091917678614, 0.29029714333318524, 0.08671615886480091, 0.075520670456318, 0.024864653066025685, 0.257000988958741, 0.16262446141773648, 0.12404957220377089, -0.2777323034426335, 0.07889285665818009, 0.10056706907340145]
1,803.03434
Solving Fourier ptychographic imaging problems via neural network modeling and TensorFlow
Fourier ptychography is a recently developed imaging approach for large field-of-view and high-resolution microscopy. Here we model the Fourier ptychographic forward imaging process using a convolution neural network (CNN) and recover the complex object information in the network training process. In this approach, the input of the network is the point spread function in the spatial domain or the coherent transfer function in the Fourier domain. The object is treated as 2D learnable weights of a convolution or a multiplication layer. The output of the network is modeled as the loss function we aim to minimize. The batch size of the network corresponds to the number of captured low-resolution images in one forward / backward pass. We use a popular open-source machine learning library, TensorFlow, for setting up the network and conducting the optimization process. We analyze the performance of different learning rates, different solvers, and different batch sizes. It is shown that a large batch size with the Adam optimizer achieves the best performance in general. To accelerate the phase retrieval process, we also discuss a strategy to implement Fourier-magnitude projection using a multiplication neural network model. Since convolution and multiplication are the two most-common operations in imaging modeling, the reported approach may provide a new perspective to examine many coherent and incoherent systems. As a demonstration, we discuss the extensions of the reported networks for modeling single-pixel imaging and structured illumination microscopy (SIM). 4-frame resolution doubling is demonstrated using a neural network for SIM. We have made our implementation code open-source for the broad research community.
cs.CV physics.optics
fourier ptychography is a recently developed imaging approach for large fieldofview and highresolution microscopy here we model the fourier ptychographic forward imaging process using a convolution neural network cnn and recover the complex object information in the network training process in this approach the input of the network is the point spread function in the spatial domain or the coherent transfer function in the fourier domain the object is treated as 2d learnable weights of a convolution or a multiplication layer the output of the network is modeled as the loss function we aim to minimize the batch size of the network corresponds to the number of captured lowresolution images in one forward backward pass we use a popular opensource machine learning library tensorflow for setting up the network and conducting the optimization process we analyze the performance of different learning rates different solvers and different batch sizes it is shown that a large batch size with the adam optimizer achieves the best performance in general to accelerate the phase retrieval process we also discuss a strategy to implement fouriermagnitude projection using a multiplication neural network model since convolution and multiplication are the two mostcommon operations in imaging modeling the reported approach may provide a new perspective to examine many coherent and incoherent systems as a demonstration we discuss the extensions of the reported networks for modeling singlepixel imaging and structured illumination microscopy sim 4frame resolution doubling is demonstrated using a neural network for sim we have made our implementation code opensource for the broad research community
[['fourier', 'ptychography', 'is', 'a', 'recently', 'developed', 'imaging', 'approach', 'for', 'large', 'fieldofview', 'and', 'highresolution', 'microscopy', 'here', 'we', 'model', 'the', 'fourier', 'ptychographic', 'forward', 'imaging', 'process', 'using', 'a', 'convolution', 'neural', 'network', 'cnn', 'and', 'recover', 'the', 'complex', 'object', 'information', 'in', 'the', 'network', 'training', 'process', 'in', 'this', 'approach', 'the', 'input', 'of', 'the', 'network', 'is', 'the', 'point', 'spread', 'function', 'in', 'the', 'spatial', 'domain', 'or', 'the', 'coherent', 'transfer', 'function', 'in', 'the', 'fourier', 'domain', 'the', 'object', 'is', 'treated', 'as', '2d', 'learnable', 'weights', 'of', 'a', 'convolution', 'or', 'a', 'multiplication', 'layer', 'the', 'output', 'of', 'the', 'network', 'is', 'modeled', 'as', 'the', 'loss', 'function', 'we', 'aim', 'to', 'minimize', 'the', 'batch', 'size', 'of', 'the', 'network', 'corresponds', 'to', 'the', 'number', 'of', 'captured', 'lowresolution', 'images', 'in', 'one', 'forward', 'backward', 'pass', 'we', 'use', 'a', 'popular', 'opensource', 'machine', 'learning', 'library', 'tensorflow', 'for', 'setting', 'up', 'the', 'network', 'and', 'conducting', 'the', 'optimization', 'process', 'we', 'analyze', 'the', 'performance', 'of', 'different', 'learning', 'rates', 'different', 'solvers', 'and', 'different', 'batch', 'sizes', 'it', 'is', 'shown', 'that', 'a', 'large', 'batch', 'size', 'with', 'the', 'adam', 'optimizer', 'achieves', 'the', 'best', 'performance', 'in', 'general', 'to', 'accelerate', 'the', 'phase', 'retrieval', 'process', 'we', 'also', 'discuss', 'a', 'strategy', 'to', 'implement', 'fouriermagnitude', 'projection', 'using', 'a', 'multiplication', 'neural', 'network', 'model', 'since', 'convolution', 'and', 'multiplication', 'are', 'the', 'two', 'mostcommon', 'operations', 'in', 'imaging', 'modeling', 'the', 'reported', 'approach', 'may', 'provide', 'a', 'new', 'perspective', 'to', 'examine', 'many', 'coherent', 'and', 'incoherent', 'systems', 'as', 'a', 'demonstration', 'we', 'discuss', 'the', 'extensions', 'of', 'the', 'reported', 'networks', 'for', 'modeling', 'singlepixel', 'imaging', 'and', 'structured', 'illumination', 'microscopy', 'sim', '4frame', 'resolution', 'doubling', 'is', 'demonstrated', 'using', 'a', 'neural', 'network', 'for', 'sim', 'we', 'have', 'made', 'our', 'implementation', 'code', 'opensource', 'for', 'the', 'broad', 'research', 'community']]
[-0.06480759091891741, 0.008948538572894904, -0.07552614988162532, 0.07563162258216494, -0.07157273435086609, -0.1630368308196921, 0.015284131946827983, 0.46569773474766407, -0.33796678004728165, -0.2978329713369021, 0.09778896829766381, -0.23675984920265591, -0.1819022652471176, 0.2040870981199987, -0.08507066081256198, 0.12037989745772393, 0.11102408669239594, -0.012984614846232034, -0.059999796713782416, -0.2241590892735985, 0.28847518976181163, 0.06923491072666366, 0.3192221286390122, -0.015807366055014427, 0.14253645264932402, 0.014920725516276434, -0.05055108684791776, -0.033517974953610974, -0.05920682629326279, 0.14126766022855008, 0.25329173179875397, 0.17791943085785533, 0.31561818598856917, -0.42207091019372456, -0.23456153207996522, 0.05834263702854514, 0.14301820674654664, 0.09019437288043264, -0.04789289204290981, -0.27131095208733313, 0.07708842132933569, -0.1739084604951131, -0.03331345981814593, -0.10343871371787827, -0.03156271781426767, 0.0022628895258094417, -0.3047556626761434, -0.0003429246786481599, 0.04363074215461893, 0.05764359479326231, -0.041241978709877, -0.10586416773139717, 0.04622498037042533, 0.13495768841539757, -0.02485123105373077, 0.0724807545616386, 0.15053106661980564, -0.16864439511755336, -0.11260066328395624, 0.3211584676064376, -0.0629144810473008, -0.18263841700536432, 0.17813699084763357, -0.08734481735928057, -0.11107686830109742, 0.11480529074469814, 0.23342554127748372, 0.13709605405529146, -0.15852921575333312, 0.05153565184252784, -0.0472783247641928, 0.1877658592603666, 0.07241569827237981, 0.013249821849285581, 0.12380223628042586, 0.2708879628589784, 0.04168493876454704, 0.17906199427307, -0.180387522698652, -0.06427946106077798, -0.2224384188593831, -0.15767524734837934, -0.21883079446797638, 0.0005654196522755228, -0.08957054276953613, -0.15023175951171197, 0.40679517375974683, 0.1784766040859722, 0.2064483816120628, 0.077564223644913, 0.36664436204955564, 0.0808274778755731, 0.14952535578595416, 0.0809017224848958, 0.1786543202829307, 0.09367004449063643, 0.16813597554278203, -0.16662904860459093, 0.03627708903513849, 0.04759714594763409]
1,803.03435
Deep Visuo-Tactile Learning: Estimation of Tactile Properties from Images
Estimation of tactile properties from vision, such as slipperiness or roughness, is important to effectively interact with the environment. These tactile properties help us decide which actions we should choose and how to perform them. E.g., we can drive slower if we see that we have bad traction or grasp tighter if an item looks slippery. We believe that this ability also helps robots to enhance their understanding of the environment, and thus enables them to tailor their actions to the situation at hand. We therefore propose a model to estimate the degree of tactile properties from visual perception alone (e.g., the level of slipperiness or roughness). Our method extends a encoder-decoder network, in which the latent variables are visual and tactile features. In contrast to previous works, our method does not require manual labeling, but only RGB images and the corresponding tactile sensor data. All our data is collected with a webcam and uSkin tactile sensor mounted on the end-effector of a Sawyer robot, which strokes the surfaces of 25 different materials. We show that our model generalizes to materials not included in the training data by evaluating the feature space, indicating that it has learned to associate important tactile properties with images.
cs.RO
estimation of tactile properties from vision such as slipperiness or roughness is important to effectively interact with the environment these tactile properties help us decide which actions we should choose and how to perform them eg we can drive slower if we see that we have bad traction or grasp tighter if an item looks slippery we believe that this ability also helps robots to enhance their understanding of the environment and thus enables them to tailor their actions to the situation at hand we therefore propose a model to estimate the degree of tactile properties from visual perception alone eg the level of slipperiness or roughness our method extends a encoderdecoder network in which the latent variables are visual and tactile features in contrast to previous works our method does not require manual labeling but only rgb images and the corresponding tactile sensor data all our data is collected with a webcam and uskin tactile sensor mounted on the endeffector of a sawyer robot which strokes the surfaces of 25 different materials we show that our model generalizes to materials not included in the training data by evaluating the feature space indicating that it has learned to associate important tactile properties with images
[['estimation', 'of', 'tactile', 'properties', 'from', 'vision', 'such', 'as', 'slipperiness', 'or', 'roughness', 'is', 'important', 'to', 'effectively', 'interact', 'with', 'the', 'environment', 'these', 'tactile', 'properties', 'help', 'us', 'decide', 'which', 'actions', 'we', 'should', 'choose', 'and', 'how', 'to', 'perform', 'them', 'eg', 'we', 'can', 'drive', 'slower', 'if', 'we', 'see', 'that', 'we', 'have', 'bad', 'traction', 'or', 'grasp', 'tighter', 'if', 'an', 'item', 'looks', 'slippery', 'we', 'believe', 'that', 'this', 'ability', 'also', 'helps', 'robots', 'to', 'enhance', 'their', 'understanding', 'of', 'the', 'environment', 'and', 'thus', 'enables', 'them', 'to', 'tailor', 'their', 'actions', 'to', 'the', 'situation', 'at', 'hand', 'we', 'therefore', 'propose', 'a', 'model', 'to', 'estimate', 'the', 'degree', 'of', 'tactile', 'properties', 'from', 'visual', 'perception', 'alone', 'eg', 'the', 'level', 'of', 'slipperiness', 'or', 'roughness', 'our', 'method', 'extends', 'a', 'encoderdecoder', 'network', 'in', 'which', 'the', 'latent', 'variables', 'are', 'visual', 'and', 'tactile', 'features', 'in', 'contrast', 'to', 'previous', 'works', 'our', 'method', 'does', 'not', 'require', 'manual', 'labeling', 'but', 'only', 'rgb', 'images', 'and', 'the', 'corresponding', 'tactile', 'sensor', 'data', 'all', 'our', 'data', 'is', 'collected', 'with', 'a', 'webcam', 'and', 'uskin', 'tactile', 'sensor', 'mounted', 'on', 'the', 'endeffector', 'of', 'a', 'sawyer', 'robot', 'which', 'strokes', 'the', 'surfaces', 'of', '25', 'different', 'materials', 'we', 'show', 'that', 'our', 'model', 'generalizes', 'to', 'materials', 'not', 'included', 'in', 'the', 'training', 'data', 'by', 'evaluating', 'the', 'feature', 'space', 'indicating', 'that', 'it', 'has', 'learned', 'to', 'associate', 'important', 'tactile', 'properties', 'with', 'images']]
[-0.03541934941872367, 0.06621442498472058, -0.1147295695114789, 0.005330358085961178, -0.18595734706809147, -0.2052266995693222, 0.03577122083071418, 0.45920111605980124, -0.25761822492499, -0.3577813507095576, 0.07279300940314579, -0.29261324991325255, -0.2087401831961292, 0.1896623091725174, -0.18019823421003855, 0.03694038819338154, 0.10110544731950598, 0.07531484502500721, -0.02121120627299685, -0.2562367468063027, 0.2926281548536433, 0.0353051611621465, 0.27712777323029897, 0.028310646956758986, 0.12270874265762588, 0.0031831044923936206, -0.012225215389792408, 0.0009159379599448477, -0.08998581490280413, 0.15680320733834718, 0.284570114443932, 0.1551292737409142, 0.2617137355298685, -0.4558007312488967, -0.22079353786063302, 0.10654424693839157, 0.13065198569009745, 0.08825462952249322, -0.006968892785592069, -0.3414806667577677, 0.09407238969166437, -0.12865192081219817, -0.07406763206671906, -0.10402218559028563, -0.014275456736268007, -0.003997120790623972, -0.27166027709809615, -0.0036665598549042813, 0.07883539036996755, 0.06878616428002715, -0.08794588977677445, -0.05631364568187098, -0.02081252189050314, 0.22636297639353853, 0.029094545830160454, 0.03350192807678459, 0.21464965222724552, -0.1819928230114483, -0.0703807031217357, 0.37776661773437054, 0.014116362604344714, -0.2103938586101523, 0.2590155608612549, -0.11491659561887824, -0.09413773886024437, 0.08273652098210428, 0.21461120924770172, 0.0948525022582284, -0.14009706166868494, -0.0207579317322033, -0.01286294799885286, 0.20872956630429756, 0.03829995442062543, 0.0029944119094113997, 0.18229258567865553, 0.16460346259874076, 0.05913956089546271, 0.114830591812216, -0.11589188971172495, 0.01123063066822885, -0.22015794256949806, -0.15093282758363802, -0.17267621748190684, 0.014127007782088795, -0.08198389260227656, -0.13441167358857273, 0.373465383019335, 0.27088280428393646, 0.22476041114205503, 0.04673680777287597, 0.3288795170076008, 0.0007620931487172622, 0.1420160311760537, 0.049604385919189954, 0.21056705394649666, 0.005429589674748444, 0.1289363838141564, -0.17334778359494737, 0.10878017979210673, 0.025349144358187914]
1,803.03436
Recurrence and transience of continuous-time open quantum walks
This paper is devoted to the study of continuous-time processes known as continuous-time open quantum walks (CTOQWs). A CTOQW represents the evolution of a quantum particle constrained to move on a discrete graph, but also has internal degrees of freedom modeled by a state (in the quantum mechanical sense), and contain as a special case continuous-time Markov chains on graphs. Recurrence and transience of a vertex are an important notion in the study of Markov chains, and it is known that all vertices must be of the same nature if the Markov chain is irreducible. In the present paper we address the corresponding results in the context of irreducible CTOQWs. Because of the "quantum" internal degrees of freedom, CTOQWs exhibit non standard behavior, and the classification of recurrence and transience properties obeys a "trichotomy" rather than the classical dichotomy. Essential tools in this paper are the so-called "quantum trajectories" which are jump stochastic differential equations which can be associated with CTOQWs.
math.PR math-ph math.MP quant-ph
this paper is devoted to the study of continuoustime processes known as continuoustime open quantum walks ctoqws a ctoqw represents the evolution of a quantum particle constrained to move on a discrete graph but also has internal degrees of freedom modeled by a state in the quantum mechanical sense and contain as a special case continuoustime markov chains on graphs recurrence and transience of a vertex are an important notion in the study of markov chains and it is known that all vertices must be of the same nature if the markov chain is irreducible in the present paper we address the corresponding results in the context of irreducible ctoqws because of the quantum internal degrees of freedom ctoqws exhibit non standard behavior and the classification of recurrence and transience properties obeys a trichotomy rather than the classical dichotomy essential tools in this paper are the socalled quantum trajectories which are jump stochastic differential equations which can be associated with ctoqws
[['this', 'paper', 'is', 'devoted', 'to', 'the', 'study', 'of', 'continuoustime', 'processes', 'known', 'as', 'continuoustime', 'open', 'quantum', 'walks', 'ctoqws', 'a', 'ctoqw', 'represents', 'the', 'evolution', 'of', 'a', 'quantum', 'particle', 'constrained', 'to', 'move', 'on', 'a', 'discrete', 'graph', 'but', 'also', 'has', 'internal', 'degrees', 'of', 'freedom', 'modeled', 'by', 'a', 'state', 'in', 'the', 'quantum', 'mechanical', 'sense', 'and', 'contain', 'as', 'a', 'special', 'case', 'continuoustime', 'markov', 'chains', 'on', 'graphs', 'recurrence', 'and', 'transience', 'of', 'a', 'vertex', 'are', 'an', 'important', 'notion', 'in', 'the', 'study', 'of', 'markov', 'chains', 'and', 'it', 'is', 'known', 'that', 'all', 'vertices', 'must', 'be', 'of', 'the', 'same', 'nature', 'if', 'the', 'markov', 'chain', 'is', 'irreducible', 'in', 'the', 'present', 'paper', 'we', 'address', 'the', 'corresponding', 'results', 'in', 'the', 'context', 'of', 'irreducible', 'ctoqws', 'because', 'of', 'the', 'quantum', 'internal', 'degrees', 'of', 'freedom', 'ctoqws', 'exhibit', 'non', 'standard', 'behavior', 'and', 'the', 'classification', 'of', 'recurrence', 'and', 'transience', 'properties', 'obeys', 'a', 'trichotomy', 'rather', 'than', 'the', 'classical', 'dichotomy', 'essential', 'tools', 'in', 'this', 'paper', 'are', 'the', 'socalled', 'quantum', 'trajectories', 'which', 'are', 'jump', 'stochastic', 'differential', 'equations', 'which', 'can', 'be', 'associated', 'with', 'ctoqws']]
[-0.1465929791328399, 0.1741202723608903, -0.0825426705667506, 0.07073862160923342, -0.06874053400033009, -0.1468380848206117, 0.007227711289143479, 0.3346876439563236, -0.29980591257097, -0.23998449519508003, 0.13307391553654435, -0.261349672788569, -0.1603453116179068, 0.15622351788669847, -0.07468751878680094, 0.04868671384217761, 0.06839479760538718, 0.08513845142370426, -0.020882353784591655, -0.22462316861420273, 0.2947953336218499, 0.027553685048164116, 0.21317706962249108, -0.001898629505545919, 0.14206437869011918, 0.03583774590858993, -0.005832454585904105, 0.015913540948621976, -0.1357013656491047, 0.09021584171026667, 0.24024474235563914, 0.07288120439426499, 0.2554372330398663, -0.39424272733653737, -0.2010187725138833, 0.16333793802476076, 0.1499303093891206, 0.11737803039893, 0.017730096700711188, -0.28652600827048424, 0.04488492001322393, -0.13117346043339845, -0.14292878334508827, -0.032319494170246654, 0.005543255923975328, 0.043595027191541305, -0.20727761858576757, 0.06646119457686187, 0.15337738275718846, 0.07421735656210539, 0.017938031017981318, -0.06208496838113906, -0.021863614421580798, 0.11537009014267914, -0.0066763076140192446, -0.013926229562598818, 0.08553330977129177, -0.12989415639363552, -0.1984742178035009, 0.3900379552824064, -0.021592926413781785, -0.22913769038787446, 0.19989168167877827, -0.11767183880029558, -0.19734923743139604, 0.10386255494772995, 0.1714977361008768, 0.1226036431707488, -0.19892436698634433, 0.13861466543814052, -0.05664637979258847, 0.11721654253308979, 0.025764479657623525, 0.08315377632410538, 0.18060892438284637, 0.1530337331191816, 0.08636815996944719, 0.19534240614460863, 0.011470760608175827, -0.20386631800995572, -0.30544035817403925, -0.18527086394309697, -0.1659622979039465, 0.11584016202908495, -0.08517607180530029, -0.21109269833574013, 0.396229456708136, 0.11920793694375874, 0.16978123179934804, 0.08900626884883281, 0.20446302759119814, 0.14743092600169436, -0.0035004781454986665, 0.08671178648202038, 0.15852928354537912, 0.20888415824835946, 0.051410064423711314, -0.19690585689422507, 0.11410795674393219, 0.09580592001984994]
1,803.03437
A space-time finite element method for fractional wave problems
This paper analyzes a space-time finite element method for fractional wave problems. The method uses a Petrov-Galerkin type time-stepping scheme to discretize the time fractional derivative of order $ \gamma $ ($1<\gamma<2$). We establish the stability of this method, and derive the optimal convergence in the $ H^1(0,T;L^2(\Omega)) $-norm and suboptimal convergence in the discrete $ L^\infty(0,T;H_0^1(\Omega)) $-norm. Furthermore, we discuss the performance of this method in the case that the solution has singularity at $ t= 0 $, and show that optimal convergence rate with respect to the $ H^1(0,T;L^2(\Omega)) $-norm can still be achieved by using graded grids in the time discretization. Finally, numerical experiments are performed to verify the theoretical results.
math.NA
this paper analyzes a spacetime finite element method for fractional wave problems the method uses a petrovgalerkin type timestepping scheme to discretize the time fractional derivative of order gamma 1gamma2 we establish the stability of this method and derive the optimal convergence in the h10tl2omega norm and suboptimal convergence in the discrete linfty0th_01omega norm furthermore we discuss the performance of this method in the case that the solution has singularity at t 0 and show that optimal convergence rate with respect to the h10tl2omega norm can still be achieved by using graded grids in the time discretization finally numerical experiments are performed to verify the theoretical results
[['this', 'paper', 'analyzes', 'a', 'spacetime', 'finite', 'element', 'method', 'for', 'fractional', 'wave', 'problems', 'the', 'method', 'uses', 'a', 'petrovgalerkin', 'type', 'timestepping', 'scheme', 'to', 'discretize', 'the', 'time', 'fractional', 'derivative', 'of', 'order', 'gamma', '1gamma2', 'we', 'establish', 'the', 'stability', 'of', 'this', 'method', 'and', 'derive', 'the', 'optimal', 'convergence', 'in', 'the', 'h10tl2omega', 'norm', 'and', 'suboptimal', 'convergence', 'in', 'the', 'discrete', 'linfty0th_01omega', 'norm', 'furthermore', 'we', 'discuss', 'the', 'performance', 'of', 'this', 'method', 'in', 'the', 'case', 'that', 'the', 'solution', 'has', 'singularity', 'at', 't', '0', 'and', 'show', 'that', 'optimal', 'convergence', 'rate', 'with', 'respect', 'to', 'the', 'h10tl2omega', 'norm', 'can', 'still', 'be', 'achieved', 'by', 'using', 'graded', 'grids', 'in', 'the', 'time', 'discretization', 'finally', 'numerical', 'experiments', 'are', 'performed', 'to', 'verify', 'the', 'theoretical', 'results']]
[-0.09659027384343342, 0.00021924602781207516, -0.12107884159167252, 0.044512125485478185, -0.03188609565572383, -0.10928514637411214, 0.04991783518590427, 0.40063973870844793, -0.32480858914473526, -0.23722104516715403, 0.16349597268988594, -0.22650465060276195, -0.12443738392231843, 0.183176537010765, -0.10184217502515261, 0.10952001621570581, 0.07573827519081533, 0.02918846028534552, -0.13527477205766794, -0.2679519609798892, 0.30231546055158387, 0.033497841867546625, 0.2705206009738434, 0.04512739818220815, 0.12943320974367312, -0.0975996509570485, -0.035365606031308956, 0.010589247605261894, -0.16358761810946676, 0.10120738507528305, 0.2472906540967345, 0.0650492372447983, 0.33150962219000435, -0.39668276691092896, -0.18345750317586443, 0.11323494400186554, 0.15363525749237922, 0.07776346871665177, -0.07073310187731224, -0.25992746351850937, 0.1495730598869089, -0.14440370499729538, -0.17095491284719452, -0.12071348838687229, -0.045412320988431856, 0.0581082882955133, -0.33542079947745573, 0.11195751604436037, 0.04054967157739716, 0.00963777181907342, -0.08765267825667532, -0.08900999587450105, 0.04651075371881374, 0.05211848233011551, 0.062452326636188306, 0.014777117337171849, 0.01872894063574047, -0.0362047621993742, -0.13544281955714374, 0.35610467627143055, -0.09654828132289157, -0.28315918034730625, 0.12190880436593524, -0.16310243745101616, -0.10324889021173406, 0.13000176545733666, 0.18205778467325637, 0.19458989285004252, -0.0856403543954142, 0.1304270659753596, -0.011504527539448016, 0.15428106726791996, 0.056011966960236, 0.012449096274884561, 0.023563555121654645, 0.18083385831246582, 0.15602267912786025, 0.12660743792366702, -0.07694205684842578, -0.09349990775808692, -0.35839991357464057, -0.17202977026821686, -0.19596703429348195, -0.017419104557960124, -0.13603525856790208, -0.12370282725896686, 0.37754182674140024, 0.1771209794589175, 0.11534979441365487, 0.10810478073052274, 0.3000974335994285, 0.17362199644020831, -0.022336433191622537, 0.09773014994481435, 0.2194633573257866, 0.12423480015534621, 0.12123647323236443, -0.30355364193495077, 0.03134338910995911, 0.192629803939221]
1,803.03438
Numerical optimization of the extraction efficiency of a quantum-dot based single-photon emitter into a single-mode fiber
We present a numerical method for the accurate and efficient simulation of strongly localized light sources, such as quantum dots, embedded in dielectric micro-optical structures. We apply the method in order to optimize the photon extraction efficiency of a single-photon emitter consisting of a quantum dot embedded into a multi-layer stack with further lateral structures. Furthermore, we present methods to study the robustness of the extraction efficiency with respect to fabrication errors and defects.
physics.comp-ph cond-mat.mes-hall quant-ph
we present a numerical method for the accurate and efficient simulation of strongly localized light sources such as quantum dots embedded in dielectric microoptical structures we apply the method in order to optimize the photon extraction efficiency of a singlephoton emitter consisting of a quantum dot embedded into a multilayer stack with further lateral structures furthermore we present methods to study the robustness of the extraction efficiency with respect to fabrication errors and defects
[['we', 'present', 'a', 'numerical', 'method', 'for', 'the', 'accurate', 'and', 'efficient', 'simulation', 'of', 'strongly', 'localized', 'light', 'sources', 'such', 'as', 'quantum', 'dots', 'embedded', 'in', 'dielectric', 'microoptical', 'structures', 'we', 'apply', 'the', 'method', 'in', 'order', 'to', 'optimize', 'the', 'photon', 'extraction', 'efficiency', 'of', 'a', 'singlephoton', 'emitter', 'consisting', 'of', 'a', 'quantum', 'dot', 'embedded', 'into', 'a', 'multilayer', 'stack', 'with', 'further', 'lateral', 'structures', 'furthermore', 'we', 'present', 'methods', 'to', 'study', 'the', 'robustness', 'of', 'the', 'extraction', 'efficiency', 'with', 'respect', 'to', 'fabrication', 'errors', 'and', 'defects']]
[-0.10189188301336725, 0.05520320343910842, -0.033282811124179815, -0.005849040339927416, 0.007107992807554232, -0.14098003697959152, 0.05891905694797232, 0.4845844698516098, -0.22063653125754884, -0.3027276941740294, 0.05341270157589099, -0.27750299404677303, -0.13731268715314768, 0.24369156641281536, -0.028061884096697777, 0.0986536919466547, 0.0807799353088076, -0.06906892108806484, -0.07300654866707486, -0.18257594000346758, 0.28738312080905243, 0.05713890768222611, 0.3080467802245875, 0.060066584195639636, 0.10121363176133584, -0.0010026807053568395, 0.03144640345252245, 0.02930360899080296, -0.1096668279654271, 0.21315285582976365, 0.2349918232979001, 0.020520556919478083, 0.2399021149298327, -0.4456645268443468, -0.21380863087000074, 0.03395682728748668, 0.17213063148429264, 0.13603381391274869, -0.09867449406836484, -0.27918482179174553, 0.12134960271116044, -0.1392897755108975, -0.11216249213730162, -0.08813043877583097, -0.05313713340139067, 0.034886254151855166, -0.23726509911058521, 0.04099360848399433, 0.034664515456235084, -0.023729527180359977, -0.0059183003582261706, -0.03325769287609571, 0.023641349697435223, 0.09789153018563583, -0.08672470501246485, -0.0070306710817070826, 0.18822129591166772, -0.12022872558618719, -0.17243162056783568, 0.36283483776591113, -0.06458485602696955, -0.21929142551144232, 0.16954093023417266, -0.08975412930689149, -0.07775270225278832, 0.12431711364990554, 0.24026322811590256, 0.15369931188714062, -0.1000036933464061, 0.02992491650778951, 0.06826306761217278, 0.23105247505009174, 0.028787265267424488, 0.10947420206424352, 0.20087964369638547, 0.24762270446690554, 0.03451282850693207, 0.23064466865380873, -0.14361752329293537, -0.050540769120325915, -0.2831642451897465, -0.23080619788438403, -0.16327749273261508, 0.08361033523908339, -0.0867599150464033, -0.23276336514312346, 0.4268865951815167, 0.17928842529402794, 0.16700334125827695, -0.012220345928358871, 0.34192360167366426, 0.09199991004031806, 0.052251351078519144, 0.03287596265923836, 0.20799207979360143, 0.1652833027513446, 0.05077691787753154, -0.24524925100440914, -0.011383365081447, -0.014401929188721083]
1,803.03439
Strong anomalous Nernst effect in collinear magnetic Weyl semimetals without net magnetic moments
We predict a large anomalous Nernst effect in the inverse Heusler compensated ferrimagnets Ti$_2$Mn$X$ ($X$=Al,Ga,In) with vanishing net magnetic moments. Though the net magnetic moment is zero, the Weyl points in these systems lead to a large anomalous Nernst conductivity (ANC) due to the lack of a magnetic sublattice that inverses the sign of the Berry curvature. In comparison to the noncollinear antiferromagnets Mn$_3$Sn and Mn$_3$Ge, the high ANC stems almost entirely from the Weyl points in this class of compounds, and thus, it is topologically protected. This work shows for the first time a large ANC with zero net magnetic moments in collinear systems, which is helpful for comprehensive understanding of the thermoelectric effect in zero-moment magnetic materials and its further applications.
cond-mat.mtrl-sci
we predict a large anomalous nernst effect in the inverse heusler compensated ferrimagnets ti_2mnx xalgain with vanishing net magnetic moments though the net magnetic moment is zero the weyl points in these systems lead to a large anomalous nernst conductivity anc due to the lack of a magnetic sublattice that inverses the sign of the berry curvature in comparison to the noncollinear antiferromagnets mn_3sn and mn_3ge the high anc stems almost entirely from the weyl points in this class of compounds and thus it is topologically protected this work shows for the first time a large anc with zero net magnetic moments in collinear systems which is helpful for comprehensive understanding of the thermoelectric effect in zeromoment magnetic materials and its further applications
[['we', 'predict', 'a', 'large', 'anomalous', 'nernst', 'effect', 'in', 'the', 'inverse', 'heusler', 'compensated', 'ferrimagnets', 'ti_2mnx', 'xalgain', 'with', 'vanishing', 'net', 'magnetic', 'moments', 'though', 'the', 'net', 'magnetic', 'moment', 'is', 'zero', 'the', 'weyl', 'points', 'in', 'these', 'systems', 'lead', 'to', 'a', 'large', 'anomalous', 'nernst', 'conductivity', 'anc', 'due', 'to', 'the', 'lack', 'of', 'a', 'magnetic', 'sublattice', 'that', 'inverses', 'the', 'sign', 'of', 'the', 'berry', 'curvature', 'in', 'comparison', 'to', 'the', 'noncollinear', 'antiferromagnets', 'mn_3sn', 'and', 'mn_3ge', 'the', 'high', 'anc', 'stems', 'almost', 'entirely', 'from', 'the', 'weyl', 'points', 'in', 'this', 'class', 'of', 'compounds', 'and', 'thus', 'it', 'is', 'topologically', 'protected', 'this', 'work', 'shows', 'for', 'the', 'first', 'time', 'a', 'large', 'anc', 'with', 'zero', 'net', 'magnetic', 'moments', 'in', 'collinear', 'systems', 'which', 'is', 'helpful', 'for', 'comprehensive', 'understanding', 'of', 'the', 'thermoelectric', 'effect', 'in', 'zeromoment', 'magnetic', 'materials', 'and', 'its', 'further', 'applications']]
[-0.23091269736293674, 0.16665609911361262, -0.017109977878045197, 0.037752919565801596, -0.1003954521695937, -0.08659490897928264, 0.08126628342563717, 0.33151910986658956, -0.29731118523184796, -0.2659789973423501, 0.025562826095703095, -0.3318469527423813, -0.1675952303854456, 0.16824828092901667, -0.0015819928847438049, 0.027727876632562876, -0.038497576226426425, 0.00702320213221814, -0.10653459689626085, -0.21559989391941548, 0.29182815401283796, 0.018313532368056783, 0.361350438328583, 0.11073598311829173, 0.06363852164700382, -0.046881572706605625, 0.10987243635872425, 0.06774155981838703, -0.0627952061061606, 0.06111298523042813, 0.23831103227971015, -0.14138589356641076, 0.1546981897867046, -0.4064922821477117, -0.16495348219875217, 0.0904260210977667, 0.10461429965466815, 0.15193611666971957, -0.07935127568977678, -0.2621841886935155, 0.12713143335797725, -0.14692721199744557, -0.12566177891798255, -0.16335662551347382, 0.01511466998822433, -0.0362494505445419, -0.2670037043319384, 0.11098603617779003, 0.13638826960713163, 0.1309589035424196, -0.10174066553850589, -0.18918913248098987, -0.04081442031224281, 0.07967579657258081, 0.1353876663368072, 0.036045479111003975, 0.07299998225567263, -0.14718561099307256, -0.14470396829722834, 0.35968464425156926, -0.05111301831962649, -0.13077739738543664, 0.10989172285622802, -0.2406686717829059, -0.1069513460474997, 0.16042110146877686, 0.15792918714794738, 0.11199329485770407, -0.13712621718060133, 0.10584342182461896, 0.008204003064777733, 0.10794105728287712, -0.025055240501057018, 0.051037757114838225, 0.27986046329356173, 0.1223946199617695, 0.0836782177894815, 0.15014341515142562, -0.12457999160651825, -0.022536095968747803, -0.2378017338346844, -0.20245691944560237, -0.2737504410507419, 0.10961665902748581, -0.09506877655250479, -0.2364138163056625, 0.3851077639120669, 0.1861139723823275, 0.18091903613834096, -0.06552386267999695, 0.29156975484691744, 0.1251998726001456, 0.12350029306301524, 0.05774015761346148, 0.27551009463654325, 0.19654763480148102, 0.1764346970830205, -0.2900020381154816, 0.10321869760028217, 0.03550277147172712]
1,803.0344
Boundary flow of viscoelastic polyelectrolyte solutions
We report an investigation of the equilibrium and dynamic properties of polyelectrolyte solutions confined between platinum surfaces with a dynamic Surface Force Apparatus. The polyelectrolyte adsorbs on the surfaces in a dense compact layer bearing a surface charge in good agreement with the theoretical predictions. The flow of the solution on this charged adsorbed layer is probed over four decades of spatial scales and one decade of frequency by dynamic measurements. At distances larger than the hundredth of nanometers, the flow of the viscoelastic solution is well described by a partial slip boundary condition. We show that the wall slip is quantitatively described by an interfacial friction coefficient, according to the original Navier's formulation, and not by a slip length. At smaller distance the partial slip model overestimates the solution mobility, and we observe the presence of a low viscosity layer coating the surfaces. The viscosity and thickness of this boundary layer are directly resolved, and found to be independent on shear-rate, frequency, and confinement. We discuss the thickness of the low viscosity layer in terms of the structural length of the semi-dilute solution and the Debye length screening the adsorbed layer charge.
cond-mat.soft physics.flu-dyn
we report an investigation of the equilibrium and dynamic properties of polyelectrolyte solutions confined between platinum surfaces with a dynamic surface force apparatus the polyelectrolyte adsorbs on the surfaces in a dense compact layer bearing a surface charge in good agreement with the theoretical predictions the flow of the solution on this charged adsorbed layer is probed over four decades of spatial scales and one decade of frequency by dynamic measurements at distances larger than the hundredth of nanometers the flow of the viscoelastic solution is well described by a partial slip boundary condition we show that the wall slip is quantitatively described by an interfacial friction coefficient according to the original naviers formulation and not by a slip length at smaller distance the partial slip model overestimates the solution mobility and we observe the presence of a low viscosity layer coating the surfaces the viscosity and thickness of this boundary layer are directly resolved and found to be independent on shearrate frequency and confinement we discuss the thickness of the low viscosity layer in terms of the structural length of the semidilute solution and the debye length screening the adsorbed layer charge
[['we', 'report', 'an', 'investigation', 'of', 'the', 'equilibrium', 'and', 'dynamic', 'properties', 'of', 'polyelectrolyte', 'solutions', 'confined', 'between', 'platinum', 'surfaces', 'with', 'a', 'dynamic', 'surface', 'force', 'apparatus', 'the', 'polyelectrolyte', 'adsorbs', 'on', 'the', 'surfaces', 'in', 'a', 'dense', 'compact', 'layer', 'bearing', 'a', 'surface', 'charge', 'in', 'good', 'agreement', 'with', 'the', 'theoretical', 'predictions', 'the', 'flow', 'of', 'the', 'solution', 'on', 'this', 'charged', 'adsorbed', 'layer', 'is', 'probed', 'over', 'four', 'decades', 'of', 'spatial', 'scales', 'and', 'one', 'decade', 'of', 'frequency', 'by', 'dynamic', 'measurements', 'at', 'distances', 'larger', 'than', 'the', 'hundredth', 'of', 'nanometers', 'the', 'flow', 'of', 'the', 'viscoelastic', 'solution', 'is', 'well', 'described', 'by', 'a', 'partial', 'slip', 'boundary', 'condition', 'we', 'show', 'that', 'the', 'wall', 'slip', 'is', 'quantitatively', 'described', 'by', 'an', 'interfacial', 'friction', 'coefficient', 'according', 'to', 'the', 'original', 'naviers', 'formulation', 'and', 'not', 'by', 'a', 'slip', 'length', 'at', 'smaller', 'distance', 'the', 'partial', 'slip', 'model', 'overestimates', 'the', 'solution', 'mobility', 'and', 'we', 'observe', 'the', 'presence', 'of', 'a', 'low', 'viscosity', 'layer', 'coating', 'the', 'surfaces', 'the', 'viscosity', 'and', 'thickness', 'of', 'this', 'boundary', 'layer', 'are', 'directly', 'resolved', 'and', 'found', 'to', 'be', 'independent', 'on', 'shearrate', 'frequency', 'and', 'confinement', 'we', 'discuss', 'the', 'thickness', 'of', 'the', 'low', 'viscosity', 'layer', 'in', 'terms', 'of', 'the', 'structural', 'length', 'of', 'the', 'semidilute', 'solution', 'and', 'the', 'debye', 'length', 'screening', 'the', 'adsorbed', 'layer', 'charge']]
[-0.15526321729997394, 0.15944265911172847, -0.06399691237107769, -0.039225652535841676, -0.021257338758287808, -0.1357222705563154, 0.014511701645488836, 0.35331596670566134, -0.29261019004634314, -0.2759062286027239, 0.0736094953406631, -0.2862205106736079, -0.09494930499660363, 0.13996499228934212, -0.011621748063462386, 0.06578694640717908, 0.027647051825115718, -0.004759645352497156, -0.06428555315095025, -0.18398762073300276, 0.2938299763687148, 0.049976847833022475, 0.30480452124125906, 0.15441652652421492, 0.09403822087885455, -0.023120042250293835, 0.030538621720486353, 0.10019773763203794, -0.22994163653764596, 0.0796267258804388, 0.19374949780505132, -0.07522475224871512, 0.20237577387609476, -0.48035458821822635, -0.2592278415273267, -0.021046704617497834, 0.09100695789690308, 0.10426264646863613, -0.017012428568912562, -0.2344335611919279, 0.0684433276837431, -0.12408481810695535, -0.14770472910100776, 0.00956126017172681, 0.039959264868493986, 0.020878785547083775, -0.22487788063285805, 0.1554938690529393, 0.04112078851737912, 0.07076579537676947, -0.12617917598461625, -0.0982496413484293, -0.06349306532973183, 0.09499062843128575, 0.09568029063104753, 0.019321224735772306, 0.21424096092157105, -0.1554063680564256, -0.01235858597696175, 0.3565882908112799, -0.08550410241365416, -0.21830247806317601, 0.2210067973756883, -0.1625401972662754, 0.013420723197701837, 0.18591605827038615, 0.14751850637737565, 0.16158422594166172, -0.14383746675756118, 0.029381934027781668, -0.04549143382545966, 0.2343037058146902, 0.1251953647211387, -0.009391536010006127, 0.20933731455944593, 0.24408200080235068, 0.07417218686790818, 0.13979055088705872, -0.12482942774568545, -0.07186220298458489, -0.2794762007467487, -0.19057480326414572, -0.18661382654199252, 0.020528460774462732, -0.14199049962887184, -0.19024040413009477, 0.36237622538359515, 0.10214958725970026, 0.20915320489333625, 0.04035796377315654, 0.258932373222866, 0.07985798935490357, 0.09365524943776844, 0.05003853048284784, 0.26590977822686185, 0.15260159978437976, 0.1217985517192159, -0.2778522917057431, 0.10665118713245529, 0.08912862669387012]
1,803.03441
One- and two-dimensional modes in the complex Ginzburg-Landau equation with a trapping potential
We propose a new mechanism for stabilization of confined modes in lasers and semiconductor microcavities holding exciton-polariton condensates, with spatially uniform linear gain, cubic loss, and cubic self-focusing or defocusing nonlinearity. We demonstrated that the commonly known background instability driven by the linear gain can be suppressed by a combination of a harmonic-oscillator trapping potential and effective diffusion. Systematic numerical analysis of one- and two-dimensional (1D and 2D) versions of the model reveals a variety of stable modes, including stationary ones, breathers, and quasi-regular patterns filling the trapping area in the 1D case. In 2D, the analysis produces stationary modes, breathers, axisymmetric and rotating crescent-shaped vortices, stably rotating complexes built of up to $8$ individual vortices, and, in addition, patterns featuring vortex turbulence. Existence boundaries for both 1D and 2D stationary modes are found in an exact analytical form, and an analytical approximation is developed for the full stationary states.
nlin.PS
we propose a new mechanism for stabilization of confined modes in lasers and semiconductor microcavities holding excitonpolariton condensates with spatially uniform linear gain cubic loss and cubic selffocusing or defocusing nonlinearity we demonstrated that the commonly known background instability driven by the linear gain can be suppressed by a combination of a harmonicoscillator trapping potential and effective diffusion systematic numerical analysis of one and twodimensional 1d and 2d versions of the model reveals a variety of stable modes including stationary ones breathers and quasiregular patterns filling the trapping area in the 1d case in 2d the analysis produces stationary modes breathers axisymmetric and rotating crescentshaped vortices stably rotating complexes built of up to 8 individual vortices and in addition patterns featuring vortex turbulence existence boundaries for both 1d and 2d stationary modes are found in an exact analytical form and an analytical approximation is developed for the full stationary states
[['we', 'propose', 'a', 'new', 'mechanism', 'for', 'stabilization', 'of', 'confined', 'modes', 'in', 'lasers', 'and', 'semiconductor', 'microcavities', 'holding', 'excitonpolariton', 'condensates', 'with', 'spatially', 'uniform', 'linear', 'gain', 'cubic', 'loss', 'and', 'cubic', 'selffocusing', 'or', 'defocusing', 'nonlinearity', 'we', 'demonstrated', 'that', 'the', 'commonly', 'known', 'background', 'instability', 'driven', 'by', 'the', 'linear', 'gain', 'can', 'be', 'suppressed', 'by', 'a', 'combination', 'of', 'a', 'harmonicoscillator', 'trapping', 'potential', 'and', 'effective', 'diffusion', 'systematic', 'numerical', 'analysis', 'of', 'one', 'and', 'twodimensional', '1d', 'and', '2d', 'versions', 'of', 'the', 'model', 'reveals', 'a', 'variety', 'of', 'stable', 'modes', 'including', 'stationary', 'ones', 'breathers', 'and', 'quasiregular', 'patterns', 'filling', 'the', 'trapping', 'area', 'in', 'the', '1d', 'case', 'in', '2d', 'the', 'analysis', 'produces', 'stationary', 'modes', 'breathers', 'axisymmetric', 'and', 'rotating', 'crescentshaped', 'vortices', 'stably', 'rotating', 'complexes', 'built', 'of', 'up', 'to', '8', 'individual', 'vortices', 'and', 'in', 'addition', 'patterns', 'featuring', 'vortex', 'turbulence', 'existence', 'boundaries', 'for', 'both', '1d', 'and', '2d', 'stationary', 'modes', 'are', 'found', 'in', 'an', 'exact', 'analytical', 'form', 'and', 'an', 'analytical', 'approximation', 'is', 'developed', 'for', 'the', 'full', 'stationary', 'states']]
[-0.15616251870407724, 0.14942270197459342, -0.03260191662237048, 0.060475378505361735, -0.018608080879397068, -0.1768850701674819, -0.004544730246222268, 0.37632776485135155, -0.21877219136804343, -0.21707487672412148, 0.07999175779133415, -0.27555082658926644, -0.13358160850436737, 0.1912526023387909, 0.03803508758544922, 0.08494750631352266, 0.019062207926375172, -0.0665921081819882, -0.03096579732839018, -0.17951822933818523, 0.2980382939074965, 0.002757718478872751, 0.32341227668647965, -0.01503647545663019, 0.05624658905590574, -0.02761732435785234, 0.03495099562841157, 0.015204881615936756, -0.17081994604188366, 0.07304688657750376, 0.18967034134082497, -0.04884095512951414, 0.22987792586286862, -0.4906010354682803, -0.265985173402975, 0.05651764906399573, 0.2283551622814654, 0.19012902305771906, -0.12290141454897821, -0.2935820192362492, 0.01523867573744307, -0.11925626411510165, -0.21529187278201184, -0.11122639104316477, 0.03212048374737302, 0.0743970291192333, -0.3034336660336703, 0.11616112924704794, 0.11434619386369983, 0.05376320825579266, -0.10996800067213675, -0.030353302688648304, -0.07565623088584592, 0.03729811796763291, -0.01890745355359589, -0.022773921051993967, 0.0858998541906476, -0.13928719919834595, -0.115449145679983, 0.3739165438649555, -0.10416518439073115, -0.22549650709455213, 0.20803480414751296, -0.14388518285316726, 0.0039632814253369964, 0.20144401794920366, 0.1870959303403894, 0.09887100003349285, -0.0958080268278718, 0.04206709363497794, -0.032057483810931445, 0.16788335080103328, 0.13924601558906335, 0.03271265271740655, 0.24758152033823233, 0.20056488974640765, 0.03812846994648377, 0.17940236769538995, -0.099676580450808, -0.134856376722455, -0.24261448436106245, -0.09538795688713435, -0.13584302143349003, 0.028840682089018323, -0.08013555270522678, -0.21696901798403512, 0.40766555551905187, 0.02405691044094662, 0.11430221758918681, -0.006385257965885103, 0.2616934424297263, 0.13264729971686998, 0.02652992504959305, 0.09140296887295941, 0.2600767201992373, 0.1552872678047667, 0.09372649917379022, -0.23192979898226138, -0.08695500164913635, 0.05422680133022368]
1,803.03442
Flux flow spin Hall effect in type-II superconductors with spin-splitting field
We predict the very large spin Hall effect in type-II superconductors which mechanism is drastically different from the previously known ones. We find that in the flux-flow regime the spin is transported by the spin-polarized Abrikosov vortices moving under the action of the Lorenz force in the direction perpendicular to the applied electric current. Due to the large vortex velocities the spin Hall angle can be of the order of unity in realistic systems based on the high-field superconductors or the recently developed superconductor/ferromagnetic insulator proximity structures. We propose the realization of high-frequency pure spin current generator based on the periodic structure of moving vortex lattices. We find the patterns of charge imbalance and spin accumulation generated by moving vortices, which can be used for the electrical detection of individual vortex motion. The new mechanism of inverse flux-flow spin Hall effect is found based on the driving force acting on the vortices in the presence of injected spin current which results in the generation of transverse voltage.
cond-mat.supr-con cond-mat.mes-hall
we predict the very large spin hall effect in typeii superconductors which mechanism is drastically different from the previously known ones we find that in the fluxflow regime the spin is transported by the spinpolarized abrikosov vortices moving under the action of the lorenz force in the direction perpendicular to the applied electric current due to the large vortex velocities the spin hall angle can be of the order of unity in realistic systems based on the highfield superconductors or the recently developed superconductorferromagnetic insulator proximity structures we propose the realization of highfrequency pure spin current generator based on the periodic structure of moving vortex lattices we find the patterns of charge imbalance and spin accumulation generated by moving vortices which can be used for the electrical detection of individual vortex motion the new mechanism of inverse fluxflow spin hall effect is found based on the driving force acting on the vortices in the presence of injected spin current which results in the generation of transverse voltage
[['we', 'predict', 'the', 'very', 'large', 'spin', 'hall', 'effect', 'in', 'typeii', 'superconductors', 'which', 'mechanism', 'is', 'drastically', 'different', 'from', 'the', 'previously', 'known', 'ones', 'we', 'find', 'that', 'in', 'the', 'fluxflow', 'regime', 'the', 'spin', 'is', 'transported', 'by', 'the', 'spinpolarized', 'abrikosov', 'vortices', 'moving', 'under', 'the', 'action', 'of', 'the', 'lorenz', 'force', 'in', 'the', 'direction', 'perpendicular', 'to', 'the', 'applied', 'electric', 'current', 'due', 'to', 'the', 'large', 'vortex', 'velocities', 'the', 'spin', 'hall', 'angle', 'can', 'be', 'of', 'the', 'order', 'of', 'unity', 'in', 'realistic', 'systems', 'based', 'on', 'the', 'highfield', 'superconductors', 'or', 'the', 'recently', 'developed', 'superconductorferromagnetic', 'insulator', 'proximity', 'structures', 'we', 'propose', 'the', 'realization', 'of', 'highfrequency', 'pure', 'spin', 'current', 'generator', 'based', 'on', 'the', 'periodic', 'structure', 'of', 'moving', 'vortex', 'lattices', 'we', 'find', 'the', 'patterns', 'of', 'charge', 'imbalance', 'and', 'spin', 'accumulation', 'generated', 'by', 'moving', 'vortices', 'which', 'can', 'be', 'used', 'for', 'the', 'electrical', 'detection', 'of', 'individual', 'vortex', 'motion', 'the', 'new', 'mechanism', 'of', 'inverse', 'fluxflow', 'spin', 'hall', 'effect', 'is', 'found', 'based', 'on', 'the', 'driving', 'force', 'acting', 'on', 'the', 'vortices', 'in', 'the', 'presence', 'of', 'injected', 'spin', 'current', 'which', 'results', 'in', 'the', 'generation', 'of', 'transverse', 'voltage']]
[-0.2056762405676756, 0.23457397456130313, -0.041120634667999194, 0.005202369532313666, -0.08308433172499348, -0.10165822643139762, 0.019948247979251488, 0.3396639186822012, -0.2792774818971485, -0.2771161298607727, 0.04134305706526526, -0.24300236741225875, -0.11045175009340182, 0.23092912600799548, 0.01728253111920827, 0.025223081990028033, -0.04293659572562058, 0.02070648609353843, -0.04785457858397531, -0.19405736218340428, 0.31877830346856645, -0.006076113527228018, 0.3863724837592708, 0.03716901119367615, 0.08687536803096488, -0.0034947541743115393, 0.05596420954924054, 0.052574941063087854, -0.10325558638796356, 0.05428239842876792, 0.16703337450472716, -0.11667670307034057, 0.15812870856056627, -0.4947183408891548, -0.17714961784930822, 0.040052296692076064, 0.1275418028068132, 0.19147847116643193, -0.08452719982997876, -0.31864976416715607, 0.0461855742698368, -0.17473203844591573, -0.1316155635801975, -0.06510091641594372, 0.03219993562771504, 0.030144131591844703, -0.2478879049387593, 0.10526146242551193, 0.08973554787044775, 0.05793335902766732, -0.07745154897687946, -0.099036746074914, -0.06461073604306418, 0.07093282010908863, 0.05831473829464507, 0.0561387045782974, 0.19818083567420736, -0.1876119519583881, -0.1757552201809462, 0.3504669903247745, -0.060015490058318764, -0.18444447937717942, 0.15584735871671873, -0.200819998633808, -0.02629830182981705, 0.1372419355833111, 0.16640417714474978, 0.11309595522645047, -0.0993599502908618, 0.01968207885615784, -0.05893893000073062, 0.11595366449335111, 0.02986457512273403, 0.02922676465736178, 0.30761488404928033, 0.18519144642486063, 0.06763815370661591, 0.1581554188766701, -0.21973358495941686, -0.0707934013690554, -0.2304936161259636, -0.12659019170451663, -0.2135050939270546, 0.08430209332062098, -0.010897355315621948, -0.15853240646346622, 0.41805424523946944, 0.2075285666404727, 0.16528289995248943, -0.07789933152739405, 0.2864492795218206, 0.15977154175951674, 0.12622111459669774, 0.057514218099047235, 0.26560793808956973, 0.14845688762226905, 0.13280907640279643, -0.3464416760496773, 0.05512730059183264, 0.05554451501278575]
1,803.03443
Fake news propagate differently from real news even at early stages of spreading
Social media can be a double-edged sword for society, either as a convenient channel exchanging ideas or as an unexpected conduit circulating fake news through a large population. While existing studies of fake news focus on theoretical modeling of propagation or identification methods based on machine learning, it is important to understand the realistic mechanisms between theoretical models and black-box methods. Here we track large databases of fake news and real news in both, Weibo in China and Twitter in Japan from different culture, which include their complete traces of re-postings. We find in both online social networks that fake news spreads distinctively from real news even at early stages of propagation, e.g. five hours after the first re-postings. Our finding demonstrates collective structural signals that help to understand the different propagation evolution of fake news and real news. Different from earlier studies, identifying the topological properties of the information propagation at early stages may offer novel features for early detection of fake news in social media.
physics.soc-ph cs.SI
social media can be a doubleedged sword for society either as a convenient channel exchanging ideas or as an unexpected conduit circulating fake news through a large population while existing studies of fake news focus on theoretical modeling of propagation or identification methods based on machine learning it is important to understand the realistic mechanisms between theoretical models and blackbox methods here we track large databases of fake news and real news in both weibo in china and twitter in japan from different culture which include their complete traces of repostings we find in both online social networks that fake news spreads distinctively from real news even at early stages of propagation eg five hours after the first repostings our finding demonstrates collective structural signals that help to understand the different propagation evolution of fake news and real news different from earlier studies identifying the topological properties of the information propagation at early stages may offer novel features for early detection of fake news in social media
[['social', 'media', 'can', 'be', 'a', 'doubleedged', 'sword', 'for', 'society', 'either', 'as', 'a', 'convenient', 'channel', 'exchanging', 'ideas', 'or', 'as', 'an', 'unexpected', 'conduit', 'circulating', 'fake', 'news', 'through', 'a', 'large', 'population', 'while', 'existing', 'studies', 'of', 'fake', 'news', 'focus', 'on', 'theoretical', 'modeling', 'of', 'propagation', 'or', 'identification', 'methods', 'based', 'on', 'machine', 'learning', 'it', 'is', 'important', 'to', 'understand', 'the', 'realistic', 'mechanisms', 'between', 'theoretical', 'models', 'and', 'blackbox', 'methods', 'here', 'we', 'track', 'large', 'databases', 'of', 'fake', 'news', 'and', 'real', 'news', 'in', 'both', 'weibo', 'in', 'china', 'and', 'twitter', 'in', 'japan', 'from', 'different', 'culture', 'which', 'include', 'their', 'complete', 'traces', 'of', 'repostings', 'we', 'find', 'in', 'both', 'online', 'social', 'networks', 'that', 'fake', 'news', 'spreads', 'distinctively', 'from', 'real', 'news', 'even', 'at', 'early', 'stages', 'of', 'propagation', 'eg', 'five', 'hours', 'after', 'the', 'first', 'repostings', 'our', 'finding', 'demonstrates', 'collective', 'structural', 'signals', 'that', 'help', 'to', 'understand', 'the', 'different', 'propagation', 'evolution', 'of', 'fake', 'news', 'and', 'real', 'news', 'different', 'from', 'earlier', 'studies', 'identifying', 'the', 'topological', 'properties', 'of', 'the', 'information', 'propagation', 'at', 'early', 'stages', 'may', 'offer', 'novel', 'features', 'for', 'early', 'detection', 'of', 'fake', 'news', 'in', 'social', 'media']]
[-0.08700942457512473, 0.07420442468622544, -0.07731497446357301, 0.11581284445534093, -0.1553649387153035, -0.12614836638906238, 0.05489142456966819, 0.42446520231438406, -0.22096538341914615, -0.313731708292934, 0.09744245791454997, -0.37823985355595746, -0.21238455138818332, 0.21244543909631444, -0.0192230271373057, -0.025831574849981928, 0.06322993311015042, 0.04399046921312357, 0.003458609117307898, -0.30435897861466266, 0.3183047453675306, 0.056292766332626344, 0.37941397368964375, 0.06917383914926287, 0.06942881861645164, 0.011630015516526659, -0.15609061219870593, -0.045016020519489594, -0.049213971807639055, 0.09963084455635964, 0.3602439473647047, 0.22848951646098584, 0.32676339523133, -0.45180340033363214, -0.25131532106774324, 0.1119062070036307, 0.13038674781661636, 0.14960682463592315, -0.08036578676776227, -0.37164752482239044, 0.07070090471710445, -0.18488955808746996, -0.05955201141310461, -0.06544706445525993, 0.0138711405410008, 0.030308526051301285, -0.19090168806371477, 0.08154914816841483, 0.013526476905540083, 0.1078724509189752, 0.010013077010146596, -0.06872253923140692, -0.024573926987465133, 0.20150897262730832, 0.11919143835477757, -0.04563977515226174, 0.16036513899029656, -0.20448199620075297, -0.18514475817509898, 0.39866132444956087, -0.04897161496831386, -0.10848749978750041, 0.22255273993500987, -0.0475390626816079, -0.11625273380936547, 0.11727589551415858, 0.3213883411167472, 0.10182711018503389, -0.17381166943320722, -0.08384736646531206, -0.03755602203309536, 0.16354008015160534, 0.061787067365014194, -0.02015633951152929, 0.22898460835161985, 0.1892942507440845, 0.005193857532559019, 0.05553583365258281, -0.030562669527011387, -0.10069904359071656, -0.21625132441739411, -0.12721903374362173, -0.1112676598300988, 0.06580979040485214, -0.13406383706729463, -0.13436972741037606, 0.4271498374245835, 0.1718420175503883, 0.18614650145031963, -0.03295003491044609, 0.2968599441298989, -0.07172391537760356, 0.03645438858251454, 0.06720802364306468, 0.17600851674338408, -0.04212547551388993, 0.21643185723206085, -0.12485183440572159, 0.14628293391204242, -0.03246922909536145]
1,803.03444
An Adaptive Nature-inspired Fog Architecture
During the last decade, Cloud computing has efficiently exploited the economy of scale by providing low cost computational and storage resources over the Internet, eventually leading to consolidation of computing resources into large data centers. However, the nascent of the highly decentralized Internet of Things (IoT) technologies that cannot effectively utilize the centralized Cloud infrastructures pushes computing towards resource dispersion. Fog computing extends the Cloud paradigm by enabling dispersion of the computational and storage resources at the edge of the network in a close proximity to where the data is generated. In its essence, Fog computing facilitates the operation of the limited compute, storage and networking resources physically located close to the edge devices. However, the shared complexity of the Fog and the influence of the recent IoT trends moving towards deploying and interconnecting extremely large sets of pervasive devices and sensors, requires exploration of adaptive Fog architectural approaches capable of adapting and scaling in response to the unpredictable load patterns of the distributed IoT applications. In this paper we introduce a promising new nature-inspired Fog architecture, named SmartFog, capable of providing low decision making latency and adaptive resource management. By utilizing novel algorithms and techniques from the fields of multi-criteria decision making, graph theory and machine learning we model the Fog as a distributed intelligent processing system, therefore emulating the function of the human brain.
cs.DC
during the last decade cloud computing has efficiently exploited the economy of scale by providing low cost computational and storage resources over the internet eventually leading to consolidation of computing resources into large data centers however the nascent of the highly decentralized internet of things iot technologies that cannot effectively utilize the centralized cloud infrastructures pushes computing towards resource dispersion fog computing extends the cloud paradigm by enabling dispersion of the computational and storage resources at the edge of the network in a close proximity to where the data is generated in its essence fog computing facilitates the operation of the limited compute storage and networking resources physically located close to the edge devices however the shared complexity of the fog and the influence of the recent iot trends moving towards deploying and interconnecting extremely large sets of pervasive devices and sensors requires exploration of adaptive fog architectural approaches capable of adapting and scaling in response to the unpredictable load patterns of the distributed iot applications in this paper we introduce a promising new natureinspired fog architecture named smartfog capable of providing low decision making latency and adaptive resource management by utilizing novel algorithms and techniques from the fields of multicriteria decision making graph theory and machine learning we model the fog as a distributed intelligent processing system therefore emulating the function of the human brain
[['during', 'the', 'last', 'decade', 'cloud', 'computing', 'has', 'efficiently', 'exploited', 'the', 'economy', 'of', 'scale', 'by', 'providing', 'low', 'cost', 'computational', 'and', 'storage', 'resources', 'over', 'the', 'internet', 'eventually', 'leading', 'to', 'consolidation', 'of', 'computing', 'resources', 'into', 'large', 'data', 'centers', 'however', 'the', 'nascent', 'of', 'the', 'highly', 'decentralized', 'internet', 'of', 'things', 'iot', 'technologies', 'that', 'can', 'not', 'effectively', 'utilize', 'the', 'centralized', 'cloud', 'infrastructures', 'pushes', 'computing', 'towards', 'resource', 'dispersion', 'fog', 'computing', 'extends', 'the', 'cloud', 'paradigm', 'by', 'enabling', 'dispersion', 'of', 'the', 'computational', 'and', 'storage', 'resources', 'at', 'the', 'edge', 'of', 'the', 'network', 'in', 'a', 'close', 'proximity', 'to', 'where', 'the', 'data', 'is', 'generated', 'in', 'its', 'essence', 'fog', 'computing', 'facilitates', 'the', 'operation', 'of', 'the', 'limited', 'compute', 'storage', 'and', 'networking', 'resources', 'physically', 'located', 'close', 'to', 'the', 'edge', 'devices', 'however', 'the', 'shared', 'complexity', 'of', 'the', 'fog', 'and', 'the', 'influence', 'of', 'the', 'recent', 'iot', 'trends', 'moving', 'towards', 'deploying', 'and', 'interconnecting', 'extremely', 'large', 'sets', 'of', 'pervasive', 'devices', 'and', 'sensors', 'requires', 'exploration', 'of', 'adaptive', 'fog', 'architectural', 'approaches', 'capable', 'of', 'adapting', 'and', 'scaling', 'in', 'response', 'to', 'the', 'unpredictable', 'load', 'patterns', 'of', 'the', 'distributed', 'iot', 'applications', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'promising', 'new', 'natureinspired', 'fog', 'architecture', 'named', 'smartfog', 'capable', 'of', 'providing', 'low', 'decision', 'making', 'latency', 'and', 'adaptive', 'resource', 'management', 'by', 'utilizing', 'novel', 'algorithms', 'and', 'techniques', 'from', 'the', 'fields', 'of', 'multicriteria', 'decision', 'making', 'graph', 'theory', 'and', 'machine', 'learning', 'we', 'model', 'the', 'fog', 'as', 'a', 'distributed', 'intelligent', 'processing', 'system', 'therefore', 'emulating', 'the', 'function', 'of', 'the', 'human', 'brain']]
[-0.20722289289557994, 0.06023333943448961, -0.039850368051155084, -0.013878708531455739, -0.09472540183099959, -0.16095790459539544, 0.11743236587017639, 0.35471688288437053, -0.3322298118113942, -0.33921854234500415, 0.09800372735918624, -0.23692810157544714, -0.16121950104783198, 0.19013777390777636, -0.1343679986435198, 0.10104970838354316, 0.041741686272774865, -0.020534743949465983, 0.015488212087255515, -0.2279613031445543, 0.2954218674691155, 0.12960982010741018, 0.38841522176465665, 0.058818428554372304, 0.06735327582295357, -0.008960896072727917, -0.06889341670434625, -0.019237143793699653, -0.0354572585507348, 0.23138798623494145, 0.34793904838224343, 0.23024821333974535, 0.3766408544116184, -0.5112369693568455, -0.196496594816743, 0.0900471175436664, 0.18512307023382293, 0.037456261487554064, -0.07596802572870165, -0.29026441378271683, 0.08897748528140086, -0.2254383970686622, -0.10778623148971506, -0.06464936147522247, 0.039120007662794894, 0.022851110517409984, -0.22697510897589898, -0.018292506704461323, -0.05194282566662878, 0.04173463528184632, -0.036100856584947, -0.06646984147548725, 0.016156473477263893, 0.17710253382225283, -0.03462153389396772, 0.0009512379621279187, 0.21301760276021287, -0.20233669868398424, -0.13308487178559983, 0.4070834573399506, 0.05825299796322773, -0.09374598388568359, 0.1935942903721491, -0.019547392044987, -0.15438004810902892, 0.0846620944258551, 0.23420972893590444, 0.02232846623622458, -0.18218571430204056, 0.08321591836799026, 0.06877763420590653, 0.10538475018868272, 0.026102672096144044, 0.09885196269910156, 0.2307293281841001, 0.2729956256225705, 0.14366343789074604, 0.1430837599420508, -0.08071483054767008, -0.12414494170848511, -0.16573389396133248, -0.1621100824198529, -0.23273153663448065, -0.02585303710444688, -0.1253352124514151, -0.15302119759298796, 0.3506762714215876, 0.2139049585521287, 0.13958989208836142, 0.07892477901372234, 0.42916145511136383, 0.062238206180323545, 0.18732910253832827, 0.19603407847699172, 0.1362706975062559, 0.018502351354016403, 0.236815847023246, -0.199621001932259, 0.09883916287000942, -0.029599389600138946]
1,803.03445
Coalitions & Voting Power in the Greek Parliament of 2012: A Case-Study
We revisit the May and June 2012 Greek Parliamentary elections and the December 2014 Presidential election that was held by the June-elected Parliament. The three voting instances provide a political field experiment for the application of power indices and their interpretation in context. We model the Greek Parliament as a weighted majority game and assess voting power with the Shapley-Shubik, Holler and when relevant, Coleman's indices. Also, based on the actual events, we establish connections between parties and evaluate the Myerson index. We focus on the influence of institutional rules on the distribution of power among the elected political parties and add an alternative input to the ongoing political debate about the reform of both the Parliamentary and Presidential electoral system in Greece. Additionally, our findings contribute to the understanding of the coalition formation process in the particular context and provide empirical evidence on the performance of non-selective indices in parliamentary multi-party settings which can be used for comparison by similar case-studies in the future.
cs.GT
we revisit the may and june 2012 greek parliamentary elections and the december 2014 presidential election that was held by the juneelected parliament the three voting instances provide a political field experiment for the application of power indices and their interpretation in context we model the greek parliament as a weighted majority game and assess voting power with the shapleyshubik holler and when relevant colemans indices also based on the actual events we establish connections between parties and evaluate the myerson index we focus on the influence of institutional rules on the distribution of power among the elected political parties and add an alternative input to the ongoing political debate about the reform of both the parliamentary and presidential electoral system in greece additionally our findings contribute to the understanding of the coalition formation process in the particular context and provide empirical evidence on the performance of nonselective indices in parliamentary multiparty settings which can be used for comparison by similar casestudies in the future
[['we', 'revisit', 'the', 'may', 'and', 'june', '2012', 'greek', 'parliamentary', 'elections', 'and', 'the', 'december', '2014', 'presidential', 'election', 'that', 'was', 'held', 'by', 'the', 'juneelected', 'parliament', 'the', 'three', 'voting', 'instances', 'provide', 'a', 'political', 'field', 'experiment', 'for', 'the', 'application', 'of', 'power', 'indices', 'and', 'their', 'interpretation', 'in', 'context', 'we', 'model', 'the', 'greek', 'parliament', 'as', 'a', 'weighted', 'majority', 'game', 'and', 'assess', 'voting', 'power', 'with', 'the', 'shapleyshubik', 'holler', 'and', 'when', 'relevant', 'colemans', 'indices', 'also', 'based', 'on', 'the', 'actual', 'events', 'we', 'establish', 'connections', 'between', 'parties', 'and', 'evaluate', 'the', 'myerson', 'index', 'we', 'focus', 'on', 'the', 'influence', 'of', 'institutional', 'rules', 'on', 'the', 'distribution', 'of', 'power', 'among', 'the', 'elected', 'political', 'parties', 'and', 'add', 'an', 'alternative', 'input', 'to', 'the', 'ongoing', 'political', 'debate', 'about', 'the', 'reform', 'of', 'both', 'the', 'parliamentary', 'and', 'presidential', 'electoral', 'system', 'in', 'greece', 'additionally', 'our', 'findings', 'contribute', 'to', 'the', 'understanding', 'of', 'the', 'coalition', 'formation', 'process', 'in', 'the', 'particular', 'context', 'and', 'provide', 'empirical', 'evidence', 'on', 'the', 'performance', 'of', 'nonselective', 'indices', 'in', 'parliamentary', 'multiparty', 'settings', 'which', 'can', 'be', 'used', 'for', 'comparison', 'by', 'similar', 'casestudies', 'in', 'the', 'future']]
[-0.07785620418570299, 0.041545762438500985, -0.11066081941343571, 0.11469917873489799, -0.09129505780264281, -0.10926002483153376, 0.16251444215062869, 0.346749121766174, -0.1786471500157992, -0.36631403875639434, 0.12454544260697553, -0.32892976670594115, -0.1658043338826335, 0.16366002848780026, -0.128339496580316, -0.0001236131581053331, 0.03628527193909466, 0.03814019654521139, 0.06374471323854267, -0.3501012203533475, 0.2967433527498165, 0.08230943348906117, 0.33529365593113186, 0.04601344669860803, 0.033713261594019106, 0.037122012363397516, -0.09155865624637866, -0.023722521020894553, -0.11694881652142723, 0.12760783920189503, 0.29535480233181904, 0.2004233925325069, 0.34918347682247347, -0.4171934153475776, -0.11111579168014364, 0.10551744007658805, 0.02989524871497074, 0.013553624463738964, -0.0005969129213154679, -0.3344400776550174, 0.0010276795545927954, -0.25987615018356136, -0.05835656349500357, -0.04948048515205567, 0.04937849800661774, 0.044188289372491786, -0.23898802626105706, 0.058581041866202166, 0.020116716251345125, 0.10899346383152211, -0.07119916480179399, -0.11422108878522101, -0.0047732167891453865, 0.20890745949855488, 0.06873956163929883, -0.042081516139527285, 0.11940536027058686, -0.12987968036098366, -0.2335646365507983, 0.3818341485826617, 0.010987306080429202, -0.07176221816845965, 0.13704359640577446, -0.12486422990687282, -0.17587884891460218, -0.050779420286189855, 0.22444206330266486, 0.05202890650607736, -0.11063959877045397, -0.005689970307796058, -0.10118302081359505, 0.19234577491709098, 0.10382244938689215, -0.020503794726143342, 0.22485971076147085, 0.12502379097021754, 0.036527606789249836, 0.12346448416739315, -0.062615377091655, -0.1660910452284464, -0.2520368208131957, -0.14765872477224415, -0.1107274328398223, 0.014307708077689224, -0.09382572233676556, -0.08814024902516748, 0.4251356596445165, 0.14960188601271068, 0.12984518011731647, 0.016096643615860447, 0.23646391149491025, 0.023865834080114414, -0.006961564744947615, 0.07457195416592606, 0.25961562269935157, 0.04675407072588824, 0.17205761643921638, -0.17955183638572103, 0.16241572451175804, 1.9001058961560088e-05]
1,803.03446
Spectral gaps and abelian covers of convex co-compact surfaces
Given a convex co-compact hyperbolic surface $X=\Gamma\backslash \mathbb{H}^2$, we investigate the resonance spectrum $\mathcal{R}_j$ of the laplacian $\Delta_j$ on large finite abelian covers $X=\Gamma_j\backslash \mathbb{H}^2$, where $\Gamma_j$ is a finite index normal subgroup of $\Gamma$. Let $\delta$ be the Hausdorff dimension of the limit set of $\Gamma$. We show that there exists an $\varepsilon>0$, such that for all $j$, resonances $\mathcal{R}_j$ in $\{ \delta-\varepsilon< \mathrm{Re}(s) \leq \delta \}$ are all real and satisfy a Weyl law given by the degree of the cover i.e. $\vert \Gamma/ \Gamma_j\vert$. In particular, we prove that for large imaginary parts, there is a uniform resonance gap, obtained through uniform Dolgopyat estimates for transfer operators. One of the new ingredients of the proof is the decay of oscillatory integrals with respect to Patterson-Sulivan measures, obtained recently by Bourgain-Dyatlov arXiv:1704.02909 .
math.SP
given a convex cocompact hyperbolic surface xgammabackslash mathbbh2 we investigate the resonance spectrum mathcalr_j of the laplacian delta_j on large finite abelian covers xgamma_jbackslash mathbbh2 where gamma_j is a finite index normal subgroup of gamma let delta be the hausdorff dimension of the limit set of gamma we show that there exists an varepsilon0 such that for all j resonances mathcalr_j in deltavarepsilon mathrmres leq delta are all real and satisfy a weyl law given by the degree of the cover ie vert gamma gamma_jvert in particular we prove that for large imaginary parts there is a uniform resonance gap obtained through uniform dolgopyat estimates for transfer operators one of the new ingredients of the proof is the decay of oscillatory integrals with respect to pattersonsulivan measures obtained recently by bourgaindyatlov arxiv170402909
[['given', 'a', 'convex', 'cocompact', 'hyperbolic', 'surface', 'xgammabackslash', 'mathbbh2', 'we', 'investigate', 'the', 'resonance', 'spectrum', 'mathcalr_j', 'of', 'the', 'laplacian', 'delta_j', 'on', 'large', 'finite', 'abelian', 'covers', 'xgamma_jbackslash', 'mathbbh2', 'where', 'gamma_j', 'is', 'a', 'finite', 'index', 'normal', 'subgroup', 'of', 'gamma', 'let', 'delta', 'be', 'the', 'hausdorff', 'dimension', 'of', 'the', 'limit', 'set', 'of', 'gamma', 'we', 'show', 'that', 'there', 'exists', 'an', 'varepsilon0', 'such', 'that', 'for', 'all', 'j', 'resonances', 'mathcalr_j', 'in', 'deltavarepsilon', 'mathrmres', 'leq', 'delta', 'are', 'all', 'real', 'and', 'satisfy', 'a', 'weyl', 'law', 'given', 'by', 'the', 'degree', 'of', 'the', 'cover', 'ie', 'vert', 'gamma', 'gamma_jvert', 'in', 'particular', 'we', 'prove', 'that', 'for', 'large', 'imaginary', 'parts', 'there', 'is', 'a', 'uniform', 'resonance', 'gap', 'obtained', 'through', 'uniform', 'dolgopyat', 'estimates', 'for', 'transfer', 'operators', 'one', 'of', 'the', 'new', 'ingredients', 'of', 'the', 'proof', 'is', 'the', 'decay', 'of', 'oscillatory', 'integrals', 'with', 'respect', 'to', 'pattersonsulivan', 'measures', 'obtained', 'recently', 'by', 'bourgaindyatlov', 'arxiv170402909']]
[-0.1799118293365609, 0.16760874588919705, -0.04967470151314046, 0.04072978957901796, -0.06900292571845057, -0.12842541740246816, 0.02763269277784275, 0.32879533283994533, -0.26431492550364055, -0.18995640622824794, 0.07777863713999977, -0.3269669608998811, -0.08945387586572906, 0.2233587405862636, -0.07248621198868932, 0.02333957104565343, 0.04608147337421542, 0.08055496027009212, -0.040484641532657406, -0.17316988018137636, 0.3615811487652536, -0.09979644699342316, 0.18859297870153569, 0.0861569377957494, 0.09475797535924357, 0.013336003543372499, 0.00744488911004737, -0.0032721997504268074, -0.2209204889431362, 0.08758079346443992, 0.2321117258106824, 0.05539627070174902, 0.227071903349497, -0.31129678126490035, -0.1721555801705108, 0.20278442555718357, 0.1363002469552157, -0.048784860417072196, -0.020682085806583927, -0.2637931197095895, 0.1409655668285268, -0.12153778324420728, -0.183423151695024, -0.05600993262123666, 0.09846022605779581, 0.022697237647662405, -0.3128596107890189, 0.06775424585794099, 0.09526440358604304, 0.08729365853287163, -0.03665263910806971, -0.15147152319332235, -0.02269644108855573, 0.09348196417613508, 0.021305446158294217, 0.057436602077359566, 0.041026285180805644, -0.05799587829824304, -0.07694803141930606, 0.3622989882824186, -0.0960471479820626, -0.22261344293656293, 0.09886186105359229, -0.2295093723860191, -0.13696102246831288, 0.13867570200545742, 0.10911012806900544, 0.14192427773133431, -0.05251271835004445, 0.22753840322502583, -0.09786093942966545, 0.12417934502263961, 0.10107877921473118, -0.009665027038863627, 0.09037485094449949, 0.09131590113065613, 0.13632101944313035, 0.1131164625285237, -0.042096330683307315, -0.009485946015502122, -0.3810202303575352, -0.15961237783631077, -0.22956616351075354, 0.1269010353498743, -0.13929144629935308, -0.1967655284970533, 0.3495336314013002, 0.01104464306445152, 0.20211780986574013, 0.09661079537727346, 0.19039682118909695, 0.1457143429812504, 0.04659213623017422, 0.11908755843614927, 0.15815227030907408, 0.15797609340734198, -0.016014928862205124, -0.19167804478274775, -0.019767957361182198, 0.1204628323957877]
1,803.03447
Probability of radiation of twisted photons in the infrared domain
The infrared asymptotics of probability of radiation of twisted photons in an arbitrary scattering process of quantum electrodynamics (QED) in a vacuum is investigated. This asymptotics is universal and corresponds to the radiation produced by a classical current. Such a radiation is known as the edge radiation. We represent it in terms of the twisted photons: the exact analytical formulas for the average number of radiated twisted photons are derived. We find the average projection of the total angular momentum of the edge radiation and the angular momentum per photon. It is shown that the edge radiation can be used as a source of twisted photons with large angular momentum. Moreover, this radiation can be employed as a superradiant coherent source of twisted photons in the infrared domain, in particular, in the THz part of the electromagnetic spectrum. Several general selection rules for the radiation and absorbtion of twisted photons are proved. These selection rules allow one, in particular, to modulate the one-particle radiation probability by means of scattering of charged particles on symmetrically arranged crystals.
physics.acc-ph physics.optics
the infrared asymptotics of probability of radiation of twisted photons in an arbitrary scattering process of quantum electrodynamics qed in a vacuum is investigated this asymptotics is universal and corresponds to the radiation produced by a classical current such a radiation is known as the edge radiation we represent it in terms of the twisted photons the exact analytical formulas for the average number of radiated twisted photons are derived we find the average projection of the total angular momentum of the edge radiation and the angular momentum per photon it is shown that the edge radiation can be used as a source of twisted photons with large angular momentum moreover this radiation can be employed as a superradiant coherent source of twisted photons in the infrared domain in particular in the thz part of the electromagnetic spectrum several general selection rules for the radiation and absorbtion of twisted photons are proved these selection rules allow one in particular to modulate the oneparticle radiation probability by means of scattering of charged particles on symmetrically arranged crystals
[['the', 'infrared', 'asymptotics', 'of', 'probability', 'of', 'radiation', 'of', 'twisted', 'photons', 'in', 'an', 'arbitrary', 'scattering', 'process', 'of', 'quantum', 'electrodynamics', 'qed', 'in', 'a', 'vacuum', 'is', 'investigated', 'this', 'asymptotics', 'is', 'universal', 'and', 'corresponds', 'to', 'the', 'radiation', 'produced', 'by', 'a', 'classical', 'current', 'such', 'a', 'radiation', 'is', 'known', 'as', 'the', 'edge', 'radiation', 'we', 'represent', 'it', 'in', 'terms', 'of', 'the', 'twisted', 'photons', 'the', 'exact', 'analytical', 'formulas', 'for', 'the', 'average', 'number', 'of', 'radiated', 'twisted', 'photons', 'are', 'derived', 'we', 'find', 'the', 'average', 'projection', 'of', 'the', 'total', 'angular', 'momentum', 'of', 'the', 'edge', 'radiation', 'and', 'the', 'angular', 'momentum', 'per', 'photon', 'it', 'is', 'shown', 'that', 'the', 'edge', 'radiation', 'can', 'be', 'used', 'as', 'a', 'source', 'of', 'twisted', 'photons', 'with', 'large', 'angular', 'momentum', 'moreover', 'this', 'radiation', 'can', 'be', 'employed', 'as', 'a', 'superradiant', 'coherent', 'source', 'of', 'twisted', 'photons', 'in', 'the', 'infrared', 'domain', 'in', 'particular', 'in', 'the', 'thz', 'part', 'of', 'the', 'electromagnetic', 'spectrum', 'several', 'general', 'selection', 'rules', 'for', 'the', 'radiation', 'and', 'absorbtion', 'of', 'twisted', 'photons', 'are', 'proved', 'these', 'selection', 'rules', 'allow', 'one', 'in', 'particular', 'to', 'modulate', 'the', 'oneparticle', 'radiation', 'probability', 'by', 'means', 'of', 'scattering', 'of', 'charged', 'particles', 'on', 'symmetrically', 'arranged', 'crystals']]
[-0.1297639173441315, 0.22262150075477455, -0.07259089699734679, 0.0868735601732479, -0.03808424932834565, -0.06008325980193066, 0.005818533162131313, 0.3888893541668288, -0.22252037534913557, -0.29333225679213437, 0.021116118839762003, -0.2922776304608719, -0.045166717276019466, 0.20146374363949607, -0.005898245187877778, 0.06374887725211341, 0.020789305270723576, 0.027261296305699612, -0.005502399696111256, -0.15313232121777468, 0.33886232165439817, 0.10093313621671934, 0.2738027734158095, 0.07358609710618938, 0.11255170354376208, 0.04611872276820412, -0.051121636513430116, -0.018508498563526453, -0.06761199641538372, 0.08893723104847595, 0.22117422309979287, 0.04944941055642134, 0.17768340810620098, -0.4270791076970371, -0.2000560179453301, 0.10126793787044748, 0.16229822099310034, 0.11249888124769893, -0.0385030164192854, -0.22809830668318848, 0.01414981452928094, -0.1871750307132474, -0.1542102682658217, 0.005460806148634715, 0.005570548351070928, 0.03501801507875577, -0.2796163557478311, 0.04353807619323065, 0.023149144736883252, -0.03568885545246303, -0.05072951895735142, -0.0581207516654765, -0.05223028556396126, 0.09750315316275439, 0.03740429385040691, 0.03067269613066773, 0.16455014161659742, -0.17840983381822959, -0.13095408963536928, 0.37533486794828524, -0.06462710801993539, -0.2023779545230685, 0.1131686485274589, -0.19246695416619664, -0.0590162605744395, 0.21270620738174661, 0.12716613661111545, 0.1682547003729269, -0.12559248736281667, 0.06470471709094867, -0.051646910374984145, 0.13252286971758373, 0.1286444919109768, 0.12990320488362075, 0.2651561194956726, 0.07483822770220948, -0.007809411766092208, 0.21260393629861277, -0.10631452552942475, -0.05196306376125325, -0.338483950631185, -0.16990826307168885, -0.2112245229231617, 0.11863217059594304, -0.08478128899712994, -0.16697627879644147, 0.37256285618588497, 0.11643120559826704, 0.15299137192546783, -0.010553333807778969, 0.3129457915625112, 0.19936546144956743, 0.06157770842731803, 0.06710745625902993, 0.30529192081038753, 0.1458745653402399, 0.09029618852549572, -0.2512198816984892, -0.04098135293778879, 0.021879881657448343]
1,803.03448
A Family of Droids -- Android Malware Detection via Behavioral Modeling: Static vs Dynamic Analysis
Following the increasing popularity of mobile ecosystems, cybercriminals have increasingly targeted them, designing and distributing malicious apps that steal information or cause harm to the device's owner. Aiming to counter them, detection techniques based on either static or dynamic analysis that model Android malware, have been proposed. While the pros and cons of these analysis techniques are known, they are usually compared in the context of their limitations e.g., static analysis is not able to capture runtime behaviors, full code coverage is usually not achieved during dynamic analysis, etc. Whereas, in this paper, we analyze the performance of static and dynamic analysis methods in the detection of Android malware and attempt to compare them in terms of their detection performance, using the same modeling approach. To this end, we build on MaMaDroid, a state-of-the-art detection system that relies on static analysis to create a behavioral model from the sequences of abstracted API calls. Then, aiming to apply the same technique in a dynamic analysis setting, we modify CHIMP, a platform recently proposed to crowdsource human inputs for app testing, in order to extract API calls' sequences from the traces produced while executing the app on a CHIMP virtual device. We call this system AuntieDroid and instantiate it by using both automated (Monkey) and user-generated inputs. We find that combining both static and dynamic analysis yields the best performance, with F-measure reaching 0.92. We also show that static analysis is at least as effective as dynamic analysis, depending on how apps are stimulated during execution, and, finally, investigate the reasons for inconsistent misclassifications across methods.
cs.CR
following the increasing popularity of mobile ecosystems cybercriminals have increasingly targeted them designing and distributing malicious apps that steal information or cause harm to the devices owner aiming to counter them detection techniques based on either static or dynamic analysis that model android malware have been proposed while the pros and cons of these analysis techniques are known they are usually compared in the context of their limitations eg static analysis is not able to capture runtime behaviors full code coverage is usually not achieved during dynamic analysis etc whereas in this paper we analyze the performance of static and dynamic analysis methods in the detection of android malware and attempt to compare them in terms of their detection performance using the same modeling approach to this end we build on mamadroid a stateoftheart detection system that relies on static analysis to create a behavioral model from the sequences of abstracted api calls then aiming to apply the same technique in a dynamic analysis setting we modify chimp a platform recently proposed to crowdsource human inputs for app testing in order to extract api calls sequences from the traces produced while executing the app on a chimp virtual device we call this system auntiedroid and instantiate it by using both automated monkey and usergenerated inputs we find that combining both static and dynamic analysis yields the best performance with fmeasure reaching 092 we also show that static analysis is at least as effective as dynamic analysis depending on how apps are stimulated during execution and finally investigate the reasons for inconsistent misclassifications across methods
[['following', 'the', 'increasing', 'popularity', 'of', 'mobile', 'ecosystems', 'cybercriminals', 'have', 'increasingly', 'targeted', 'them', 'designing', 'and', 'distributing', 'malicious', 'apps', 'that', 'steal', 'information', 'or', 'cause', 'harm', 'to', 'the', 'devices', 'owner', 'aiming', 'to', 'counter', 'them', 'detection', 'techniques', 'based', 'on', 'either', 'static', 'or', 'dynamic', 'analysis', 'that', 'model', 'android', 'malware', 'have', 'been', 'proposed', 'while', 'the', 'pros', 'and', 'cons', 'of', 'these', 'analysis', 'techniques', 'are', 'known', 'they', 'are', 'usually', 'compared', 'in', 'the', 'context', 'of', 'their', 'limitations', 'eg', 'static', 'analysis', 'is', 'not', 'able', 'to', 'capture', 'runtime', 'behaviors', 'full', 'code', 'coverage', 'is', 'usually', 'not', 'achieved', 'during', 'dynamic', 'analysis', 'etc', 'whereas', 'in', 'this', 'paper', 'we', 'analyze', 'the', 'performance', 'of', 'static', 'and', 'dynamic', 'analysis', 'methods', 'in', 'the', 'detection', 'of', 'android', 'malware', 'and', 'attempt', 'to', 'compare', 'them', 'in', 'terms', 'of', 'their', 'detection', 'performance', 'using', 'the', 'same', 'modeling', 'approach', 'to', 'this', 'end', 'we', 'build', 'on', 'mamadroid', 'a', 'stateoftheart', 'detection', 'system', 'that', 'relies', 'on', 'static', 'analysis', 'to', 'create', 'a', 'behavioral', 'model', 'from', 'the', 'sequences', 'of', 'abstracted', 'api', 'calls', 'then', 'aiming', 'to', 'apply', 'the', 'same', 'technique', 'in', 'a', 'dynamic', 'analysis', 'setting', 'we', 'modify', 'chimp', 'a', 'platform', 'recently', 'proposed', 'to', 'crowdsource', 'human', 'inputs', 'for', 'app', 'testing', 'in', 'order', 'to', 'extract', 'api', 'calls', 'sequences', 'from', 'the', 'traces', 'produced', 'while', 'executing', 'the', 'app', 'on', 'a', 'chimp', 'virtual', 'device', 'we', 'call', 'this', 'system', 'auntiedroid', 'and', 'instantiate', 'it', 'by', 'using', 'both', 'automated', 'monkey', 'and', 'usergenerated', 'inputs', 'we', 'find', 'that', 'combining', 'both', 'static', 'and', 'dynamic', 'analysis', 'yields', 'the', 'best', 'performance', 'with', 'fmeasure', 'reaching', '092', 'we', 'also', 'show', 'that', 'static', 'analysis', 'is', 'at', 'least', 'as', 'effective', 'as', 'dynamic', 'analysis', 'depending', 'on', 'how', 'apps', 'are', 'stimulated', 'during', 'execution', 'and', 'finally', 'investigate', 'the', 'reasons', 'for', 'inconsistent', 'misclassifications', 'across', 'methods']]
[-0.08154160726263042, -0.011796009330213523, -0.0945299713635116, 0.0804487666648108, -0.10460417278592578, -0.19308552504322374, 0.09980808419021406, 0.4110339004900519, -0.21788951751737087, -0.35520054918922794, 0.1433297285505574, -0.31759028569812897, -0.17332103129249676, 0.21292474899664982, -0.09074168249932844, 0.07469018211565245, 0.06773687932797895, 0.04043058810061545, -0.04403571042758076, -0.24394322604210092, 0.2839694047256412, 0.05675882375321064, 0.33380591035391177, 0.054750930746316116, 0.04839380800492969, 0.025140958846132395, -0.07710165916959766, 0.02453988158239668, -0.05432446486520348, 0.13088661667575685, 0.2974053789903994, 0.22060439441824056, 0.3041499432002835, -0.43077090869130064, -0.18467005565337583, 0.06963052181770472, 0.1544077756131106, 0.1093834363536718, -0.04512422094732424, -0.3235278042336968, 0.16873310329286317, -0.21346749350899555, -0.048497931062305405, -0.12907421466019783, -0.003850426138006859, 0.030164411498194724, -0.22625140726261775, -0.011753395757285574, 0.037980414766547385, 0.0901822739178067, -0.05570465099315926, -0.07504402425320741, 0.004144615302492684, 0.1986107912406807, 0.06946282720497805, -0.03434092169246874, 0.18326568918323902, -0.12220206748102809, -0.16315244796540687, 0.35180820104180915, -0.03922445143678335, -0.15598878656698129, 0.23081278581944198, -0.02328429612492215, -0.13884266855960053, 0.09174311697127177, 0.2507076232486932, 0.12473605701959022, -0.18750828131502176, 0.007734593193439816, 0.022731741282118648, 0.23146941879177255, 0.06401374858552625, 0.010655133735774503, 0.18573582606450317, 0.20911077428396663, 0.02400366635771801, 0.14013427551596747, -0.07335245377105704, -0.07863049333766386, -0.18855681084760398, -0.12204673374425833, -0.12468774325458666, -0.00586869839759023, -0.05975434887701001, -0.1598426106442545, 0.3916522932500922, 0.26950355051545705, 0.14347872939828374, 0.07017641382886383, 0.38485333711588793, 0.03191146825881987, 0.09199851315146305, 0.11020246321094637, 0.18169744482561379, -0.0204765044113784, 0.15825489997693795, -0.18596415400784816, 0.13195503229884423, 0.011112196021270672]
1,803.03449
The many faces of mobility: Using bibliometric data to measure the movement of scientists
This paper presents a methodological framework for developing scientific mobility indicators based on bibliometric data. We identify nearly 16 million individual authors from publications covered in the Web of Science for the 2008-2015 period. Based on the information provided across individuals' publication records, we propose a general classification for analyzing scientific mobility using institutional affiliation changes. We distinguish between migrants--authors who have ruptures with their country of origin--and travelers--authors who gain additional affiliations while maintaining affiliation with their country of origin. We find that 3.7 percent of researchers who have published at least one paper over the period are mobile. Travelers represent 72.7 percent of all mobile scholars, but migrants have higher scientific impact. We apply this classification at the country level, expanding the classification to incorporate the directionality of scientists' mobility (i.e., incoming and outgoing). We provide a brief analysis to highlight the utility of the proposed taxonomy to study scholarly mobility and discuss the implications for science policy.
cs.DL
this paper presents a methodological framework for developing scientific mobility indicators based on bibliometric data we identify nearly 16 million individual authors from publications covered in the web of science for the 20082015 period based on the information provided across individuals publication records we propose a general classification for analyzing scientific mobility using institutional affiliation changes we distinguish between migrantsauthors who have ruptures with their country of originand travelersauthors who gain additional affiliations while maintaining affiliation with their country of origin we find that 37 percent of researchers who have published at least one paper over the period are mobile travelers represent 727 percent of all mobile scholars but migrants have higher scientific impact we apply this classification at the country level expanding the classification to incorporate the directionality of scientists mobility ie incoming and outgoing we provide a brief analysis to highlight the utility of the proposed taxonomy to study scholarly mobility and discuss the implications for science policy
[['this', 'paper', 'presents', 'a', 'methodological', 'framework', 'for', 'developing', 'scientific', 'mobility', 'indicators', 'based', 'on', 'bibliometric', 'data', 'we', 'identify', 'nearly', '16', 'million', 'individual', 'authors', 'from', 'publications', 'covered', 'in', 'the', 'web', 'of', 'science', 'for', 'the', '20082015', 'period', 'based', 'on', 'the', 'information', 'provided', 'across', 'individuals', 'publication', 'records', 'we', 'propose', 'a', 'general', 'classification', 'for', 'analyzing', 'scientific', 'mobility', 'using', 'institutional', 'affiliation', 'changes', 'we', 'distinguish', 'between', 'migrantsauthors', 'who', 'have', 'ruptures', 'with', 'their', 'country', 'of', 'originand', 'travelersauthors', 'who', 'gain', 'additional', 'affiliations', 'while', 'maintaining', 'affiliation', 'with', 'their', 'country', 'of', 'origin', 'we', 'find', 'that', '37', 'percent', 'of', 'researchers', 'who', 'have', 'published', 'at', 'least', 'one', 'paper', 'over', 'the', 'period', 'are', 'mobile', 'travelers', 'represent', '727', 'percent', 'of', 'all', 'mobile', 'scholars', 'but', 'migrants', 'have', 'higher', 'scientific', 'impact', 'we', 'apply', 'this', 'classification', 'at', 'the', 'country', 'level', 'expanding', 'the', 'classification', 'to', 'incorporate', 'the', 'directionality', 'of', 'scientists', 'mobility', 'ie', 'incoming', 'and', 'outgoing', 'we', 'provide', 'a', 'brief', 'analysis', 'to', 'highlight', 'the', 'utility', 'of', 'the', 'proposed', 'taxonomy', 'to', 'study', 'scholarly', 'mobility', 'and', 'discuss', 'the', 'implications', 'for', 'science', 'policy']]
[-0.09212250989019444, 0.0287779871148953, -0.055074917093204084, 0.04184565014520269, -0.1241985685547968, -0.12658256195948286, 0.14114858959890475, 0.4004180871875613, -0.18669980479950074, -0.4034857886285776, 0.05387815269775048, -0.3596741996207245, -0.13822251767703111, 0.17686249089433223, -0.11434386552468678, -0.03696830293377209, 0.07894279652387853, 0.04977387606161113, 0.012138329115607272, -0.34800466704686545, 0.2976346786614436, 0.07414335963185759, 0.3389781197521147, 0.08390451980173398, 0.04545039336039881, -0.004086801163840351, -0.16217030203273924, 0.0003909252311108978, -0.1454383429590035, 0.20383615857017098, 0.3472793146383587, 0.20543235358277892, 0.3982111824450979, -0.3869391704915435, -0.19650460789602986, 0.04906876170177274, 0.11064474762174165, 0.06854137524661748, -0.025925259611563414, -0.3185569835696251, 0.07476666618797002, -0.2516858351482138, -0.10524581714420561, -0.05254598770507131, 0.05298409807928808, 0.019055808619610894, -0.15779129585405444, 0.07033909507878837, -0.03218111389162387, 0.19102472057091488, -0.054314949385121845, -0.1466379502875683, -0.018144115799693925, 0.25154778466909933, 0.10636875174634135, -0.03202680911654517, 0.13433353306879853, -0.11721282315612504, -0.15509573195817744, 0.35223521871171937, 0.0071485088411481325, -0.11014561466264663, 0.17193834129557797, -0.1509914522498229, -0.16714261451463222, 0.043836298291897696, 0.2677461572471935, 0.02820753850707203, -0.18164435419651448, -0.009343822867087546, -0.01577661368865401, 0.14706808473962318, 0.1291108075573827, 0.013671561679283786, 0.23197965177404842, 0.17970797029223032, 0.06476517245143794, 0.06740974796310091, -0.06858256574020169, -0.0768406281253667, -0.21847052614139334, -0.13655137605253298, -0.10971388778857631, 0.062333029155785535, -0.05097378497912881, -0.13125741331924085, 0.4711673393798102, 0.20389802127210482, 0.11306594289352845, 0.038328164967279706, 0.24490990454129352, 0.013217482677287166, 0.05858019915217338, 0.13789605835132349, 0.20090724912228858, -0.0038222769908547688, 0.20070892141962862, -0.1037790818632266, 0.12689107929053864, -0.019723372628829283]
1,803.0345
On frequentist coverage errors of Bayesian credible sets in moderately high dimensions
In this paper, we study frequentist coverage errors of Bayesian credible sets for an approximately linear regression model with (moderately) high dimensional regressors, where the dimension of the regressors may increase with but is smaller than the sample size. Specifically, we consider quasi-Bayesian inference on the slope vector under the quasi-likelihood with Gaussian error distribution. Under this setup, we derive finite sample bounds on frequentist coverage errors of Bayesian credible rectangles. Derivation of those bounds builds on a novel Berry--Esseen type bound on quasi-posterior distributions and recent results on high-dimensional CLT on hyperrectangles. We use this general result to quantify coverage errors of Castillo--Nickl and $L^{\infty}$-credible bands for Gaussian white noise models, linear inverse problems, and (possibly non-Gaussian) nonparametric regression models. In particular, we show that Bayesian credible bands for those nonparametric models have coverage errors decaying polynomially fast in the sample size, implying advantages of Bayesian credible bands over confidence bands based on extreme value theory.
math.ST stat.TH
in this paper we study frequentist coverage errors of bayesian credible sets for an approximately linear regression model with moderately high dimensional regressors where the dimension of the regressors may increase with but is smaller than the sample size specifically we consider quasibayesian inference on the slope vector under the quasilikelihood with gaussian error distribution under this setup we derive finite sample bounds on frequentist coverage errors of bayesian credible rectangles derivation of those bounds builds on a novel berryesseen type bound on quasiposterior distributions and recent results on highdimensional clt on hyperrectangles we use this general result to quantify coverage errors of castillonickl and linftycredible bands for gaussian white noise models linear inverse problems and possibly nongaussian nonparametric regression models in particular we show that bayesian credible bands for those nonparametric models have coverage errors decaying polynomially fast in the sample size implying advantages of bayesian credible bands over confidence bands based on extreme value theory
[['in', 'this', 'paper', 'we', 'study', 'frequentist', 'coverage', 'errors', 'of', 'bayesian', 'credible', 'sets', 'for', 'an', 'approximately', 'linear', 'regression', 'model', 'with', 'moderately', 'high', 'dimensional', 'regressors', 'where', 'the', 'dimension', 'of', 'the', 'regressors', 'may', 'increase', 'with', 'but', 'is', 'smaller', 'than', 'the', 'sample', 'size', 'specifically', 'we', 'consider', 'quasibayesian', 'inference', 'on', 'the', 'slope', 'vector', 'under', 'the', 'quasilikelihood', 'with', 'gaussian', 'error', 'distribution', 'under', 'this', 'setup', 'we', 'derive', 'finite', 'sample', 'bounds', 'on', 'frequentist', 'coverage', 'errors', 'of', 'bayesian', 'credible', 'rectangles', 'derivation', 'of', 'those', 'bounds', 'builds', 'on', 'a', 'novel', 'berryesseen', 'type', 'bound', 'on', 'quasiposterior', 'distributions', 'and', 'recent', 'results', 'on', 'highdimensional', 'clt', 'on', 'hyperrectangles', 'we', 'use', 'this', 'general', 'result', 'to', 'quantify', 'coverage', 'errors', 'of', 'castillonickl', 'and', 'linftycredible', 'bands', 'for', 'gaussian', 'white', 'noise', 'models', 'linear', 'inverse', 'problems', 'and', 'possibly', 'nongaussian', 'nonparametric', 'regression', 'models', 'in', 'particular', 'we', 'show', 'that', 'bayesian', 'credible', 'bands', 'for', 'those', 'nonparametric', 'models', 'have', 'coverage', 'errors', 'decaying', 'polynomially', 'fast', 'in', 'the', 'sample', 'size', 'implying', 'advantages', 'of', 'bayesian', 'credible', 'bands', 'over', 'confidence', 'bands', 'based', 'on', 'extreme', 'value', 'theory']]
[-0.03142398503916939, 0.023045752727099876, -0.06782844524770494, 0.13085452452031596, -0.06349048202917461, -0.15522435203855556, 0.13083536490843062, 0.41170625651195164, -0.21004439713583598, -0.286490672646511, 0.11986447807942187, -0.267883794511398, -0.07494957141818538, 0.19694156375743688, -0.15719957055463907, 0.11060471639277474, 0.08349761678236386, -0.05271887317517652, -0.09776159933347615, -0.29657027454175533, 0.295835062544868, 0.07967257349481506, 0.32466852291216775, -0.06804021375832117, 0.07112658101945155, 0.045248967472223504, -0.05199139617203224, 0.0006771753106506602, -0.21455126498669064, 0.13685575131657382, 0.2534420210989934, 0.13258772761440807, 0.3389799750950788, -0.32613488851465294, -0.25155893685521497, 0.1323925992744344, 0.14184872836715753, 0.07007003326209323, 0.024682136793290416, -0.29077246256713424, 0.03652847909608916, -0.1660994239887523, -0.06216845107114603, -0.07740512228300495, -0.012656403164709768, 0.00409736470920184, -0.3631785055201861, 0.1726776176102219, 0.0692201535938488, 0.08504009175625059, -0.042459628869959666, -0.20986612888819148, 0.04228197302549116, -0.005650261199973043, 0.05907226109937314, -0.04893107052381721, 0.09207982604181575, -0.09408624428685852, -0.09429105246334427, 0.257738902960949, -0.0838749378308421, -0.24521723740899395, 0.17061611901698334, -0.1641675518224797, -0.18404905723648207, 0.114995485321889, 0.2949495861306787, 0.095084076428846, -0.1415592466210646, 0.10981546668523562, -0.03226386600083882, 0.16994061058447246, 0.03177255287526115, 0.03155094402158753, 0.1673883873037994, 0.17209136021143245, 0.13261848908188123, 0.11367470273117145, -0.2006760588862122, -0.10084025206404829, -0.3121100297438041, -0.05641483417148852, -0.1963107605494799, -0.008134768777076275, -0.19035108438139076, -0.25347114896191464, 0.3594182417277367, 0.18174061031989572, 0.18674610126763583, 0.2190540459089642, 0.2707102726183591, 0.15657504771445546, -0.004160468286323932, 0.10757600673504414, 0.2003516517136426, 0.13976567578652213, -0.04593410872358589, -0.08066016675664052, 0.09572695727805577, -0.008274697991568715]
1,803.03451
Comparative Statics via Stochastic Orderings in a Two-Echelon Market with Upstream Demand Uncertainty
We revisit the classic Cournot model and extend it to a two-echelon supply chain with an upstream supplier who operates under demand uncertainty and multiple downstream retailers who compete over quantity. The supplier's belief about retail demand is modeled via a continuous probability distribution function F. If F has the decreasing generalized mean residual life (DGMRL) property, then the supplier's optimal pricing policy exists and is the unique fixed point of the mean residual life (MRL) function. This closed form representation of the supplier's equilibrium strategy facilitates a transparent comparative statics and sensitivity analysis. We utilize the theory of stochastic orderings to study the response of the equilibrium fundamentals - wholesale price, retail price and quantity - to different demand distribution parameters. We examine supply chain performance, in terms of the distribution of profits, supply chain efficiency, in terms of the Price of Anarchy, and complement our findings with numerical results.
cs.GT
we revisit the classic cournot model and extend it to a twoechelon supply chain with an upstream supplier who operates under demand uncertainty and multiple downstream retailers who compete over quantity the suppliers belief about retail demand is modeled via a continuous probability distribution function f if f has the decreasing generalized mean residual life dgmrl property then the suppliers optimal pricing policy exists and is the unique fixed point of the mean residual life mrl function this closed form representation of the suppliers equilibrium strategy facilitates a transparent comparative statics and sensitivity analysis we utilize the theory of stochastic orderings to study the response of the equilibrium fundamentals wholesale price retail price and quantity to different demand distribution parameters we examine supply chain performance in terms of the distribution of profits supply chain efficiency in terms of the price of anarchy and complement our findings with numerical results
[['we', 'revisit', 'the', 'classic', 'cournot', 'model', 'and', 'extend', 'it', 'to', 'a', 'twoechelon', 'supply', 'chain', 'with', 'an', 'upstream', 'supplier', 'who', 'operates', 'under', 'demand', 'uncertainty', 'and', 'multiple', 'downstream', 'retailers', 'who', 'compete', 'over', 'quantity', 'the', 'suppliers', 'belief', 'about', 'retail', 'demand', 'is', 'modeled', 'via', 'a', 'continuous', 'probability', 'distribution', 'function', 'f', 'if', 'f', 'has', 'the', 'decreasing', 'generalized', 'mean', 'residual', 'life', 'dgmrl', 'property', 'then', 'the', 'suppliers', 'optimal', 'pricing', 'policy', 'exists', 'and', 'is', 'the', 'unique', 'fixed', 'point', 'of', 'the', 'mean', 'residual', 'life', 'mrl', 'function', 'this', 'closed', 'form', 'representation', 'of', 'the', 'suppliers', 'equilibrium', 'strategy', 'facilitates', 'a', 'transparent', 'comparative', 'statics', 'and', 'sensitivity', 'analysis', 'we', 'utilize', 'the', 'theory', 'of', 'stochastic', 'orderings', 'to', 'study', 'the', 'response', 'of', 'the', 'equilibrium', 'fundamentals', 'wholesale', 'price', 'retail', 'price', 'and', 'quantity', 'to', 'different', 'demand', 'distribution', 'parameters', 'we', 'examine', 'supply', 'chain', 'performance', 'in', 'terms', 'of', 'the', 'distribution', 'of', 'profits', 'supply', 'chain', 'efficiency', 'in', 'terms', 'of', 'the', 'price', 'of', 'anarchy', 'and', 'complement', 'our', 'findings', 'with', 'numerical', 'results']]
[-0.1375226774426001, 0.07207283599396956, -0.09107761114294566, 0.0769211350727002, -0.0769330445170478, -0.11643887365022926, 0.15613143819595082, 0.39559089710835266, -0.32174528027079197, -0.25683363073983706, 0.09820854099981827, -0.3135982775569868, -0.11140197938358462, 0.12192967791594816, -0.10143634387468164, 0.030449925862076517, 0.04457199308200035, 0.043265390602362064, 0.017299502232187503, -0.2565720654596147, 0.25223843265337414, 0.10152640456303866, 0.3540234854381934, 0.06418408596269924, 0.11225031659076293, 0.02483859110137977, -0.0011574400217599563, -0.009212980779970216, -0.17384526788294818, 0.1187857828776327, 0.258287100664126, 0.16347969459948708, 0.36307513752851533, -0.43630924370341206, -0.19045719515054008, 0.16896782942883973, 0.04159528933873721, -0.02492545940283988, -0.014600148235724584, -0.19128461214839607, 0.03882236106988244, -0.2597561764996499, -0.15060590360804485, -0.04550422018872121, -0.033801697571942825, 0.09157589816911511, -0.3252498176880181, 0.027077236087722202, 0.02519219947626462, 0.07098643648016544, -0.0632459858457583, -0.1374180156334832, -0.07391953017606677, 0.1692586563798171, 0.10550715172005742, -0.023150941245320782, 0.17683538935159812, -0.1488182961081809, -0.13660680916792764, 0.3412610159831348, -0.08680716696874918, -0.20327482148816153, 0.11080547523798069, -0.11684467137250043, -0.08534036324409819, 0.10092301442873085, 0.1772581260066127, 0.07029276005168622, -0.17847509753915505, 0.06162838821969549, -0.05800995131879038, 0.16003716836240603, 0.04658353021148139, -0.013703747532909384, 0.1963982278106709, 0.17871722764008352, 0.1624473459653657, 0.16741780467753023, -0.0016130430976281295, -0.20390692301648292, -0.24385256724191415, -0.14951828301796136, -0.14437181114634448, 0.07276895640314103, -0.11201360912594749, -0.1407316237455234, 0.3741955136159762, 0.14255799941198913, 0.1089987790375646, 0.12251590540305383, 0.30769899977934295, 0.14801717529819045, -0.03722405055462307, 0.10960958688834531, 0.1358792293467559, 0.03883567198834105, 0.12146238426322344, -0.20352369586613053, 0.16070106962689426, 0.028325394673801556]
1,803.03452
Long-lived quantum speedup based on plasmonic hot spot systems
Long-lived quantum speedup serves as a fundamental component for quantum algorithms. The quantum walk is identified as an ideal scheme to realize the long-lived quantum speedup. However, one finds that the duration of quantum speedup is very short in real systems implementing quantum walk. The speedup can last only dozens of femtoseconds in the photosynthetic light-harvesting system, which was regarded as the best candidate for quantum information processing. Here, we construct one plasmonic system with two-level molecules embodied in the hot spots of one-dimensional nanoparticle chains to realize the long-lived quantum speedup. The coherent and incoherent coupling parameters in the system are obtained by means of Green's tensor technique. Our results reveal that the duration of quantum speedup in our scheme can exceed 500 fs under strong coherent coupling conditions, which is several times larger than that in the photosynthetic light-harvesting system. Our proposal presents a competitive scheme to realize the long-lived quantum speedup, which is very beneficial for quantum algorithms.
physics.optics
longlived quantum speedup serves as a fundamental component for quantum algorithms the quantum walk is identified as an ideal scheme to realize the longlived quantum speedup however one finds that the duration of quantum speedup is very short in real systems implementing quantum walk the speedup can last only dozens of femtoseconds in the photosynthetic lightharvesting system which was regarded as the best candidate for quantum information processing here we construct one plasmonic system with twolevel molecules embodied in the hot spots of onedimensional nanoparticle chains to realize the longlived quantum speedup the coherent and incoherent coupling parameters in the system are obtained by means of greens tensor technique our results reveal that the duration of quantum speedup in our scheme can exceed 500 fs under strong coherent coupling conditions which is several times larger than that in the photosynthetic lightharvesting system our proposal presents a competitive scheme to realize the longlived quantum speedup which is very beneficial for quantum algorithms
[['longlived', 'quantum', 'speedup', 'serves', 'as', 'a', 'fundamental', 'component', 'for', 'quantum', 'algorithms', 'the', 'quantum', 'walk', 'is', 'identified', 'as', 'an', 'ideal', 'scheme', 'to', 'realize', 'the', 'longlived', 'quantum', 'speedup', 'however', 'one', 'finds', 'that', 'the', 'duration', 'of', 'quantum', 'speedup', 'is', 'very', 'short', 'in', 'real', 'systems', 'implementing', 'quantum', 'walk', 'the', 'speedup', 'can', 'last', 'only', 'dozens', 'of', 'femtoseconds', 'in', 'the', 'photosynthetic', 'lightharvesting', 'system', 'which', 'was', 'regarded', 'as', 'the', 'best', 'candidate', 'for', 'quantum', 'information', 'processing', 'here', 'we', 'construct', 'one', 'plasmonic', 'system', 'with', 'twolevel', 'molecules', 'embodied', 'in', 'the', 'hot', 'spots', 'of', 'onedimensional', 'nanoparticle', 'chains', 'to', 'realize', 'the', 'longlived', 'quantum', 'speedup', 'the', 'coherent', 'and', 'incoherent', 'coupling', 'parameters', 'in', 'the', 'system', 'are', 'obtained', 'by', 'means', 'of', 'greens', 'tensor', 'technique', 'our', 'results', 'reveal', 'that', 'the', 'duration', 'of', 'quantum', 'speedup', 'in', 'our', 'scheme', 'can', 'exceed', '500', 'fs', 'under', 'strong', 'coherent', 'coupling', 'conditions', 'which', 'is', 'several', 'times', 'larger', 'than', 'that', 'in', 'the', 'photosynthetic', 'lightharvesting', 'system', 'our', 'proposal', 'presents', 'a', 'competitive', 'scheme', 'to', 'realize', 'the', 'longlived', 'quantum', 'speedup', 'which', 'is', 'very', 'beneficial', 'for', 'quantum', 'algorithms']]
[-0.1646605871253725, 0.15924673216203764, -0.06573200681368294, 0.048205215810734475, -0.0015488287755027876, -0.2000352977601499, 0.006455796037551872, 0.4000088418168681, -0.25647807870384143, -0.2967888103184863, 0.03357494110386148, -0.2224390801643918, -0.1383907786680397, 0.31730169244110584, -0.017665458105573927, 0.08240220643455591, 0.10560334144414675, 0.017993352073678595, -0.012858634214466496, -0.27380161848357953, 0.20842116631521201, 0.07098467580855518, 0.26063236725800065, 0.045405181393429334, 0.11387659603822398, -0.039231331373987176, 0.12092394819078238, -0.06933580126081194, -0.05575121086815145, 0.10309636920418659, 0.2783485737857727, 0.07314268545889706, 0.2750859112183777, -0.44229724202652154, -0.22097211542122808, 0.09046069803931144, 0.15195699763572515, 0.17968709214506612, -0.046253731589972605, -0.2924443547908934, 0.08412736662018536, -0.163668771823926, -0.09387725988773178, -0.11090967609252063, -0.0015325985258873205, -0.033128376576546235, -0.23996251735905683, 0.0702088884879135, 0.04891425446948464, 0.02122880335064223, 0.02573509270438103, -0.04799149390194357, 0.08172540582560281, 0.10401200370064803, -0.05086268017195767, 0.014928624200958597, 0.18544429877298588, -0.1117756445096771, -0.24011963022068744, 0.42139640477086815, -0.10318296174535033, -0.11931698316901991, 0.1836430111795849, -0.07467598146874665, -0.09702971044013867, 0.15705011356390597, 0.12989455917980292, 0.12843286495956574, -0.13426762122244384, 0.036753041310718874, -0.02838874296776904, 0.20265260999223292, 0.038766326483986945, 0.16599766934660742, 0.20325209948332598, 0.21688814895655611, 0.0774002681509447, 0.16783163957630418, -0.06700059167335029, -0.2268647763658292, -0.2485861251338946, -0.2199546465171524, -0.24486104737076422, 0.10458448769196417, -0.07852635491610091, -0.13448006685198463, 0.3749810701696593, 0.15999567763220449, 0.15277146175539885, 0.0061500132675369424, 0.2932152748802064, 0.11062992975312452, 0.09629514378420315, 0.06639428197851648, 0.2226724206146015, 0.1330496371038235, 0.06804901101591748, -0.2742972834316308, 0.020842592824852058, -0.014376272632514838]
1,803.03453
The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities
Biological evolution provides a creative fount of complex and subtle adaptations, often surprising the scientists who discover them. However, because evolution is an algorithmic process that transcends the substrate in which it occurs, evolution's creativity is not limited to nature. Indeed, many researchers in the field of digital evolution have observed their evolving algorithms and organisms subverting their intentions, exposing unrecognized bugs in their code, producing unexpected adaptations, or exhibiting outcomes uncannily convergent with ones in nature. Such stories routinely reveal creativity by evolution in these digital worlds, but they rarely fit into the standard scientific narrative. Instead they are often treated as mere obstacles to be overcome, rather than results that warrant study in their own right. The stories themselves are traded among researchers through oral tradition, but that mode of information transmission is inefficient and prone to error and outright loss. Moreover, the fact that these stories tend to be shared only among practitioners means that many natural scientists do not realize how interesting and lifelike digital organisms are and how natural their evolution can be. To our knowledge, no collection of such anecdotes has been published before. This paper is the crowd-sourced product of researchers in the fields of artificial life and evolutionary computation who have provided first-hand accounts of such cases. It thus serves as a written, fact-checked collection of scientifically important and even entertaining stories. In doing so we also present here substantial evidence that the existence and importance of evolutionary surprises extends beyond the natural world, and may indeed be a universal property of all complex evolving systems.
cs.NE
biological evolution provides a creative fount of complex and subtle adaptations often surprising the scientists who discover them however because evolution is an algorithmic process that transcends the substrate in which it occurs evolutions creativity is not limited to nature indeed many researchers in the field of digital evolution have observed their evolving algorithms and organisms subverting their intentions exposing unrecognized bugs in their code producing unexpected adaptations or exhibiting outcomes uncannily convergent with ones in nature such stories routinely reveal creativity by evolution in these digital worlds but they rarely fit into the standard scientific narrative instead they are often treated as mere obstacles to be overcome rather than results that warrant study in their own right the stories themselves are traded among researchers through oral tradition but that mode of information transmission is inefficient and prone to error and outright loss moreover the fact that these stories tend to be shared only among practitioners means that many natural scientists do not realize how interesting and lifelike digital organisms are and how natural their evolution can be to our knowledge no collection of such anecdotes has been published before this paper is the crowdsourced product of researchers in the fields of artificial life and evolutionary computation who have provided firsthand accounts of such cases it thus serves as a written factchecked collection of scientifically important and even entertaining stories in doing so we also present here substantial evidence that the existence and importance of evolutionary surprises extends beyond the natural world and may indeed be a universal property of all complex evolving systems
[['biological', 'evolution', 'provides', 'a', 'creative', 'fount', 'of', 'complex', 'and', 'subtle', 'adaptations', 'often', 'surprising', 'the', 'scientists', 'who', 'discover', 'them', 'however', 'because', 'evolution', 'is', 'an', 'algorithmic', 'process', 'that', 'transcends', 'the', 'substrate', 'in', 'which', 'it', 'occurs', 'evolutions', 'creativity', 'is', 'not', 'limited', 'to', 'nature', 'indeed', 'many', 'researchers', 'in', 'the', 'field', 'of', 'digital', 'evolution', 'have', 'observed', 'their', 'evolving', 'algorithms', 'and', 'organisms', 'subverting', 'their', 'intentions', 'exposing', 'unrecognized', 'bugs', 'in', 'their', 'code', 'producing', 'unexpected', 'adaptations', 'or', 'exhibiting', 'outcomes', 'uncannily', 'convergent', 'with', 'ones', 'in', 'nature', 'such', 'stories', 'routinely', 'reveal', 'creativity', 'by', 'evolution', 'in', 'these', 'digital', 'worlds', 'but', 'they', 'rarely', 'fit', 'into', 'the', 'standard', 'scientific', 'narrative', 'instead', 'they', 'are', 'often', 'treated', 'as', 'mere', 'obstacles', 'to', 'be', 'overcome', 'rather', 'than', 'results', 'that', 'warrant', 'study', 'in', 'their', 'own', 'right', 'the', 'stories', 'themselves', 'are', 'traded', 'among', 'researchers', 'through', 'oral', 'tradition', 'but', 'that', 'mode', 'of', 'information', 'transmission', 'is', 'inefficient', 'and', 'prone', 'to', 'error', 'and', 'outright', 'loss', 'moreover', 'the', 'fact', 'that', 'these', 'stories', 'tend', 'to', 'be', 'shared', 'only', 'among', 'practitioners', 'means', 'that', 'many', 'natural', 'scientists', 'do', 'not', 'realize', 'how', 'interesting', 'and', 'lifelike', 'digital', 'organisms', 'are', 'and', 'how', 'natural', 'their', 'evolution', 'can', 'be', 'to', 'our', 'knowledge', 'no', 'collection', 'of', 'such', 'anecdotes', 'has', 'been', 'published', 'before', 'this', 'paper', 'is', 'the', 'crowdsourced', 'product', 'of', 'researchers', 'in', 'the', 'fields', 'of', 'artificial', 'life', 'and', 'evolutionary', 'computation', 'who', 'have', 'provided', 'firsthand', 'accounts', 'of', 'such', 'cases', 'it', 'thus', 'serves', 'as', 'a', 'written', 'factchecked', 'collection', 'of', 'scientifically', 'important', 'and', 'even', 'entertaining', 'stories', 'in', 'doing', 'so', 'we', 'also', 'present', 'here', 'substantial', 'evidence', 'that', 'the', 'existence', 'and', 'importance', 'of', 'evolutionary', 'surprises', 'extends', 'beyond', 'the', 'natural', 'world', 'and', 'may', 'indeed', 'be', 'a', 'universal', 'property', 'of', 'all', 'complex', 'evolving', 'systems']]
[-0.06405511316685593, 0.11680215993547992, -0.10547225196604057, 0.13616081611643363, -0.1632099733243604, -0.13823174593707135, 0.06374162025756348, 0.42651619820478764, -0.2608495958572438, -0.35539462761811286, 0.11196012272168918, -0.27924084082558637, -0.22021844035337984, 0.206606764482105, -0.1215374102185699, -0.008967494559189916, 0.0711093985632005, 0.00867660801199208, 0.022871220801185588, -0.304139491085916, 0.26793869937521686, 0.06393581776229224, 0.25678979183675166, 0.0214629081532871, 0.05391790668741366, -0.04837953151765329, -0.06828485865133481, 0.0008309010304783302, -0.06900226223749732, 0.1148060786543158, 0.35214896469807094, 0.229632111645716, 0.3459070782258908, -0.4594691441508138, -0.20085640543918942, 0.12557843188445958, 0.19061464855166593, 0.10662294499876461, -0.0568613687028952, -0.2837660318535561, 0.05779136315264512, -0.15581890917516433, -0.10342765690310936, -0.13300502130171668, 0.03384719043592425, 0.010089346286547477, -0.16723573633526514, 0.02956830349274047, 0.09003505616614112, 0.10497254845935083, -0.006146834767334704, -0.09169893228592892, -0.02531788542152219, 0.21070456198498408, 0.10423544496140098, -0.009853494310047733, 0.14287994532198964, -0.15523727799904397, -0.12381863987956637, 0.3955477343353208, 0.0340231071238629, -0.1727381473983005, 0.25921759799919053, -0.11519347848583951, -0.13298885102911662, 0.1046380085029945, 0.15225635218689082, 0.07055899191835277, -0.18451123825409485, 0.02637287837902852, -0.009384623256588412, 0.15386795659481994, 0.08792456748578982, 0.061722835750092006, 0.2550480529410011, 0.13163792512438238, -0.011445917784527854, 0.03872624351083166, 0.04709050768552231, -0.13900308373458825, -0.20544891818675376, -0.16695125944883996, -0.14491135614578887, 0.07379417571447788, -0.025026642685317974, -0.17371401990335505, 0.3390133357535735, 0.1888886407388282, 0.14247484731786522, 0.004291124201561004, 0.2794915881462907, 0.023188710519741824, 0.11085957184501476, 0.06889757359827396, 0.2082398904323976, 0.02783593831438116, 0.1462118564198462, -0.12831159557912583, 0.16784015565267266, -0.06552382412487427]
1,803.03454
Alternative Theory of Nucleation in Super-Cooled Liquids
Having discovered a dimension mistake in two key formulas of the Classical Nucleation Theory (CNT) but wishing to remain in the style of this theory, we propose to approach nucleation on the basis of the Zeldovich unsteady rate formula, with the dimensionally correct expressions for the nucleation rate and time constant. Beforehand, the problematic status - physical size or simple parameter - of interfacial tension in CNT was audited. The results of numerical simulations on nucleation in various attraction but fixed repulsion conditions of the interaction potential have led us to motivate, then establish, a thermal evolution law for interfacial tension. Taking into account a scale dependance in the vicinity of absolute zero in temperature, this law is of stretched Arrhenius type. It works with the Zeldovich formula, notably for the determination of adjusting parameters. A remarkably accurate adjusting of this law to the numerical simulations has been obtained and led us to exhibit melting crystal volume as a measure of potential attractivity. It should allow accurate forecasts of instantaneous nucleation rate and average nucleation duration in physical or numerical super-cooled monoatomic liquids.
cond-mat.stat-mech cond-mat.soft
having discovered a dimension mistake in two key formulas of the classical nucleation theory cnt but wishing to remain in the style of this theory we propose to approach nucleation on the basis of the zeldovich unsteady rate formula with the dimensionally correct expressions for the nucleation rate and time constant beforehand the problematic status physical size or simple parameter of interfacial tension in cnt was audited the results of numerical simulations on nucleation in various attraction but fixed repulsion conditions of the interaction potential have led us to motivate then establish a thermal evolution law for interfacial tension taking into account a scale dependance in the vicinity of absolute zero in temperature this law is of stretched arrhenius type it works with the zeldovich formula notably for the determination of adjusting parameters a remarkably accurate adjusting of this law to the numerical simulations has been obtained and led us to exhibit melting crystal volume as a measure of potential attractivity it should allow accurate forecasts of instantaneous nucleation rate and average nucleation duration in physical or numerical supercooled monoatomic liquids
[['having', 'discovered', 'a', 'dimension', 'mistake', 'in', 'two', 'key', 'formulas', 'of', 'the', 'classical', 'nucleation', 'theory', 'cnt', 'but', 'wishing', 'to', 'remain', 'in', 'the', 'style', 'of', 'this', 'theory', 'we', 'propose', 'to', 'approach', 'nucleation', 'on', 'the', 'basis', 'of', 'the', 'zeldovich', 'unsteady', 'rate', 'formula', 'with', 'the', 'dimensionally', 'correct', 'expressions', 'for', 'the', 'nucleation', 'rate', 'and', 'time', 'constant', 'beforehand', 'the', 'problematic', 'status', 'physical', 'size', 'or', 'simple', 'parameter', 'of', 'interfacial', 'tension', 'in', 'cnt', 'was', 'audited', 'the', 'results', 'of', 'numerical', 'simulations', 'on', 'nucleation', 'in', 'various', 'attraction', 'but', 'fixed', 'repulsion', 'conditions', 'of', 'the', 'interaction', 'potential', 'have', 'led', 'us', 'to', 'motivate', 'then', 'establish', 'a', 'thermal', 'evolution', 'law', 'for', 'interfacial', 'tension', 'taking', 'into', 'account', 'a', 'scale', 'dependance', 'in', 'the', 'vicinity', 'of', 'absolute', 'zero', 'in', 'temperature', 'this', 'law', 'is', 'of', 'stretched', 'arrhenius', 'type', 'it', 'works', 'with', 'the', 'zeldovich', 'formula', 'notably', 'for', 'the', 'determination', 'of', 'adjusting', 'parameters', 'a', 'remarkably', 'accurate', 'adjusting', 'of', 'this', 'law', 'to', 'the', 'numerical', 'simulations', 'has', 'been', 'obtained', 'and', 'led', 'us', 'to', 'exhibit', 'melting', 'crystal', 'volume', 'as', 'a', 'measure', 'of', 'potential', 'attractivity', 'it', 'should', 'allow', 'accurate', 'forecasts', 'of', 'instantaneous', 'nucleation', 'rate', 'and', 'average', 'nucleation', 'duration', 'in', 'physical', 'or', 'numerical', 'supercooled', 'monoatomic', 'liquids']]
[-0.09355107695121545, 0.12812425556093537, -0.15074465856295677, 0.04616858877720136, -0.0697782795377158, -0.15093422392306036, 0.10924918824184213, 0.32624897044100565, -0.23131027194614734, -0.3124771446493861, 0.07090695333173139, -0.23328550491168148, -0.10725532895345138, 0.18611464870435016, -0.024379080477494167, 0.05387282199920953, -0.003003817717982096, 0.01693322059173569, -0.044322915259460555, -0.2507365718483925, 0.2530377179741839, 0.09540972855065574, 0.3196735019224454, 0.11283231418559235, 0.07145299350595853, -0.03207223751525606, -0.018728670886671427, 0.04273375885777216, -0.24373858109070246, 0.059808274932998076, 0.2159431288253583, 0.019472298153176987, 0.25092950119580354, -0.4694276868741321, -0.2295432574185157, 0.08548519889520512, 0.14639547199926736, 0.15668594218193663, -0.04194124691955004, -0.21375658986601176, 0.024915317158363964, -0.1638069486075714, -0.19633845768486072, -0.06416633222715219, 0.05890447240662427, 0.03060864918294121, -0.2522026406246037, 0.14661943389216017, 0.02542134332493107, 0.03829017527741046, -0.12507463418955797, -0.0912520251434955, -0.0026783298228954824, 0.11188427261938727, 0.08339177330220067, 0.005060797613834479, 0.17732685319281785, -0.13154930411580723, -0.0603793795678497, 0.37745059920907104, -0.04239794829067934, -0.17007873684826477, 0.16826915789076555, -0.16347154410226652, -0.08533804716017529, 0.1711399828814464, 0.12371287557639912, 0.0729822461095427, -0.13372068413795687, 0.06097357593205351, 0.03376853937612466, 0.14238791695978617, 0.11310358792903591, -0.029598170577533008, 0.2159963791960984, 0.20189132375735275, 0.012972517207892642, 0.11730354248696567, -0.07245720567140543, -0.13554273690843122, -0.28756316307705737, -0.16021558214657558, -0.18087805143572924, 0.08088918472640216, -0.1505896110195848, -0.1844366528299632, 0.3363828573270459, 0.14363668580219222, 0.15246962226839808, 0.0809356145411524, 0.25884836972099395, 0.09779023334257901, 0.058913053745964734, -0.0019245274205439986, 0.25389221436163995, 0.14026109576199552, 0.10375089507076622, -0.2564152568084759, 0.12176490923935208, 0.08998492131143479]
1,803.03455
Exploring the Numerics of Branch-and-Cut for Mixed Integer Linear Optimization
We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the numerical conditioning of the LP relaxations resulting from the branching and cutting operations can be effectively predicted and whether such predictions can be used to make better algorithmic choices. In a first step towards this goal, we discuss here the numerical behavior of an existing solver in order to determine whether our intuitive understanding of this behavior is correct.
math.OC
we investigate how the numerical properties of the lp relaxations evolve throughout the solution procedure in a solver employing the branchandcut algorithm the longterm goal of this work is to determine whether the effect on the numerical conditioning of the lp relaxations resulting from the branching and cutting operations can be effectively predicted and whether such predictions can be used to make better algorithmic choices in a first step towards this goal we discuss here the numerical behavior of an existing solver in order to determine whether our intuitive understanding of this behavior is correct
[['we', 'investigate', 'how', 'the', 'numerical', 'properties', 'of', 'the', 'lp', 'relaxations', 'evolve', 'throughout', 'the', 'solution', 'procedure', 'in', 'a', 'solver', 'employing', 'the', 'branchandcut', 'algorithm', 'the', 'longterm', 'goal', 'of', 'this', 'work', 'is', 'to', 'determine', 'whether', 'the', 'effect', 'on', 'the', 'numerical', 'conditioning', 'of', 'the', 'lp', 'relaxations', 'resulting', 'from', 'the', 'branching', 'and', 'cutting', 'operations', 'can', 'be', 'effectively', 'predicted', 'and', 'whether', 'such', 'predictions', 'can', 'be', 'used', 'to', 'make', 'better', 'algorithmic', 'choices', 'in', 'a', 'first', 'step', 'towards', 'this', 'goal', 'we', 'discuss', 'here', 'the', 'numerical', 'behavior', 'of', 'an', 'existing', 'solver', 'in', 'order', 'to', 'determine', 'whether', 'our', 'intuitive', 'understanding', 'of', 'this', 'behavior', 'is', 'correct']]
[-0.048470902803819625, 0.034776238250503265, -0.1642052948536155, 0.07624096628646121, -0.10359018317570812, -0.07971677441934222, 0.08905526641756296, 0.38544953081168626, -0.34570680918956276, -0.32192655948824006, 0.13270265688065833, -0.22759859257524734, -0.17778038767068402, 0.17626130143425575, -0.04778001946575195, 0.08550562005686133, 0.0494966878702766, -0.0076330994500925665, -0.09680590323221526, -0.26140739264848983, 0.2635779651764192, 0.09753454416794212, 0.24289538514751352, 0.059153858542834455, 0.02343987649502723, -0.034772239958769394, -0.019809433837470254, 0.0317185878998747, -0.1573133539543242, 0.1145461581843464, 0.2639567217740573, 0.16345464699460488, 0.2924986987129638, -0.45927135595365576, -0.13714095745235683, 0.09079628531870089, 0.15347879425818592, 0.12876493701907366, -0.009479880152809384, -0.21908175166892377, 0.11964301790453885, -0.11624006401551397, -0.13891242972918247, -0.10740445584646965, -0.028119702465636165, -0.0013394813678276381, -0.2788400047703793, -0.006254081344722133, 0.09232313309453036, -0.010958286678712618, -0.06606938264969932, -0.08644863555305883, 0.047405281263452614, 0.15174518513836358, 0.04974177042022347, 0.018205369763860578, 0.09317449419269044, -0.10368456042763827, -0.1510000030019958, 0.3947852689968912, -0.035061390968774885, -0.24323871896455163, 0.18252150180112375, -0.1035840347997452, -0.14215679710338774, 0.08119180653440325, 0.21597194608889128, 0.16807037526251453, -0.13780443479159946, 0.03719095266056492, -0.021750419930015738, 0.18827020232320615, 0.004105573333799839, -0.018347005526486194, 0.19680767019990048, 0.2371373930970501, 0.08831594980959045, 0.16497978295297608, -0.030751027821220064, -0.09130229568108916, -0.2792730888449832, -0.1535319511043398, -0.15429074446621693, 0.04770791244349982, -0.06534407298589175, -0.12731032675426257, 0.4291031649924423, 0.2523037960973421, 0.18742160089313983, 0.06421271546890861, 0.3201108314930216, 0.13832113884609976, 0.014504969222961288, 0.07013466512588294, 0.24619639900169873, 0.09427884488464579, 0.06808547880010385, -0.30085363743679694, 0.12908529519152484, 0.0917661277381213]
1,803.03456
A user-friendly condition for exponential ergodicity in randomly switched environments
We consider random switching between finitely many vector fields leaving positively invariant a compact set. Recently, Li, Liu and Cui showed that if one the vector fields has a globally asymptotically stable (G.A.S.) equilibrium from which one can reach a point satisfying a weak H\"ormander-bracket condition, then the process converges in total variation to a unique invariant probability measure. In this note, adapting the proof of Li, Liu and Cui and using results of Bena\"im, Le Borgne, Malrieu and Zitt, the assumption of a G.A.S. equilibrium is weakened to the existence of an accessible point at which a barycentric combination of the vector fields vanishes. Some examples are given which demonstrate the usefulness of this condition.
math.PR math.DS
we consider random switching between finitely many vector fields leaving positively invariant a compact set recently li liu and cui showed that if one the vector fields has a globally asymptotically stable gas equilibrium from which one can reach a point satisfying a weak hormanderbracket condition then the process converges in total variation to a unique invariant probability measure in this note adapting the proof of li liu and cui and using results of benaim le borgne malrieu and zitt the assumption of a gas equilibrium is weakened to the existence of an accessible point at which a barycentric combination of the vector fields vanishes some examples are given which demonstrate the usefulness of this condition
[['we', 'consider', 'random', 'switching', 'between', 'finitely', 'many', 'vector', 'fields', 'leaving', 'positively', 'invariant', 'a', 'compact', 'set', 'recently', 'li', 'liu', 'and', 'cui', 'showed', 'that', 'if', 'one', 'the', 'vector', 'fields', 'has', 'a', 'globally', 'asymptotically', 'stable', 'gas', 'equilibrium', 'from', 'which', 'one', 'can', 'reach', 'a', 'point', 'satisfying', 'a', 'weak', 'hormanderbracket', 'condition', 'then', 'the', 'process', 'converges', 'in', 'total', 'variation', 'to', 'a', 'unique', 'invariant', 'probability', 'measure', 'in', 'this', 'note', 'adapting', 'the', 'proof', 'of', 'li', 'liu', 'and', 'cui', 'and', 'using', 'results', 'of', 'benaim', 'le', 'borgne', 'malrieu', 'and', 'zitt', 'the', 'assumption', 'of', 'a', 'gas', 'equilibrium', 'is', 'weakened', 'to', 'the', 'existence', 'of', 'an', 'accessible', 'point', 'at', 'which', 'a', 'barycentric', 'combination', 'of', 'the', 'vector', 'fields', 'vanishes', 'some', 'examples', 'are', 'given', 'which', 'demonstrate', 'the', 'usefulness', 'of', 'this', 'condition']]
[-0.12896649663933837, 0.1412803634162233, -0.08685905908882294, 0.04131709517180001, -0.036723850116781566, -0.15046722806747193, 0.07054975735752479, 0.32206638628697914, -0.27404919989083126, -0.2381865665235597, 0.10319070302344778, -0.255675986846504, -0.1303035903884017, 0.1588971940152671, -0.07931229996940364, 0.01715588751046554, 0.03784939638217506, 0.04553034393035847, -0.05385657516308129, -0.2801564642774832, 0.33580410951829476, 0.03582506860484896, 0.2534979855155815, 0.05422370229321329, 0.14751422235175318, 0.0006408816729874715, -0.00451834371070499, 0.03690626479624568, -0.14696734598464506, 0.09007431446048228, 0.1804443938900595, 0.11416561765515286, 0.28965092583195023, -0.3049637382931035, -0.19447172625881173, 0.1582148910905032, 0.08555455725721044, 0.07829569087910425, -0.07161688952524539, -0.27608434450205255, 0.1579256536985707, -0.12329854480112376, -0.17449161326512694, -0.07421260986315167, 0.05409028338592337, 0.05002570610250468, -0.3148383644288001, 0.038337507961398884, 0.13490858842396056, 0.05979776894673705, -0.062393138569314034, -0.07811931705345278, -0.07095547990832964, 0.05661156721332151, 0.0265643196876424, 0.08943071920100762, 0.11296850817035074, -0.0741003945996256, -0.08527118856006342, 0.3175425458537496, -0.10177026498131454, -0.21109230025145023, 0.21225731658303867, -0.13557956649962327, -0.1448701706836405, 0.12586030155501288, 0.09725315543701467, 0.14857937781869068, -0.1359479702523221, 0.15289317055443383, -0.11158616163808366, 0.10874850394700289, 0.1260250880382955, -0.014035722641679255, 0.17601290693425614, 0.07540347147732973, 0.11624866970915995, 0.10397315091129554, -0.03953041612960236, -0.08029359246239715, -0.29666965440239595, -0.1824643047906094, -0.1659231441864825, 0.1029365377318438, -0.05141978516476229, -0.16227373327735972, 0.3455458871534337, 0.10127178769477684, 0.22685684061852163, 0.045314587157665065, 0.23118931585011762, 0.12290559017577755, -0.03379085288565282, 0.12591872046013242, 0.20439677013453786, 0.1879019164763715, 0.07327436719737623, -0.14519127944848784, 0.0536954550811535, 0.08908933617336595]
1,803.03457
Maximal commutative subalgebras of a Grassmann algebra
We investigate the structure of maximal commutative subalgebras of the finite dimensional Grassmann algebra over a field of characteristic different from two.
math.RA math.CO
we investigate the structure of maximal commutative subalgebras of the finite dimensional grassmann algebra over a field of characteristic different from two
[['we', 'investigate', 'the', 'structure', 'of', 'maximal', 'commutative', 'subalgebras', 'of', 'the', 'finite', 'dimensional', 'grassmann', 'algebra', 'over', 'a', 'field', 'of', 'characteristic', 'different', 'from', 'two']]
[-0.21047024196013808, 0.10379185988991098, -0.04770778991620649, 0.011181538522412831, -0.08150193476202813, -0.08832870205779644, -0.0901735962622545, 0.34049661813134496, -0.4156201874667948, -0.1428467482328415, 0.10377404328689656, -0.1787704855880954, -0.07645151823420417, 0.20346845220774412, -0.0716996567577801, -0.07783985760232265, -0.003353733315386555, 0.19090076330625874, -0.20595881207422775, -0.25322065797676757, 0.5029954402284189, -0.07569481821900065, 0.27753761469979177, -0.030640090223063122, 0.18314704942432317, 0.034053087615492666, -0.05381139215420593, 0.0945393636145375, -0.1433751293119382, 0.10087409977462482, 0.28472696405581455, 0.07182031683623791, 0.23061550096397035, -0.3748901618475264, -0.13634712680835614, 0.1935469009913504, 0.19384100516750055, 0.04745592583309521, 0.03860810957849026, -0.22719236404042353, 0.08764243896373293, -0.2717145898125388, -0.09315981638660147, -0.028790196573192425, 0.02268526489867575, -0.034536539746279064, -0.20956517911823044, 0.00255765054713596, 0.06395635491406376, 0.2698543758808889, -0.1352710761976513, -0.12379992397671397, -0.05845858969471671, 0.08149854637767104, -0.07052712493830106, -0.06208531080152501, 0.0659566978204318, -0.08688792624856102, -0.18837251057001678, 0.3214468293484639, -0.0355967196889899, -0.19891197623854334, 0.17483468040485273, -0.2791968140412461, -0.07862729725258594, 0.10583048760467632, 0.15026444653895768, 0.16392775337127122, -0.04562454344969327, 0.26188822175291454, -0.1798586008900946, 0.017675531858747654, 0.072793439919637, 0.042106832546943966, 0.1742032470012253, 0.09828744481571695, 0.04021342505108227, 0.1791668487712741, 0.009950130606408824, -0.09094443314031443, -0.34820543737574056, -0.1894439122724262, -0.103087788363072, 0.21100716936317357, -0.1960766487543217, -0.19336388298225674, 0.5406387814066627, 0.14560425699296917, 0.20346026749096133, 0.023881976450370115, 0.20361165748909116, 0.04546845560385422, 0.13579269642518324, 0.027486524650488387, 0.07557276026769118, 0.31906768395988777, -0.08170059630753133, -0.23458680920091204, -0.1542100777891888, 0.19494646878659047]
1,803.03458
Completely Baire spaces, Menger spaces, and projective sets
W. Hurewicz proved that analytic Menger sets of reals are $\sigma$-compact and that co-analytic completely Baire sets of reals are completely metrizable. It is natural to try to generalize these theorems to projective sets. This has previously been accomplished by $V = L$ for projective counterexamples, and the Axiom of Projective Determinacy for positive results. For the first problem, the first author, S. Todorcevic, and S. Tokg\"oz have produced a finer analysis with much weaker axioms. We produce a similar analysis for the second problem, showing the two problems are essentially equivalent. We also construct in ZFC a separable metrizable space with $\omega$-th power completely Baire, yet lacking a dense completely metrizable subspace. This answers a question of Eagle and Tall in Abstract Model Theory.
math.GN math.LO
w hurewicz proved that analytic menger sets of reals are sigmacompact and that coanalytic completely baire sets of reals are completely metrizable it is natural to try to generalize these theorems to projective sets this has previously been accomplished by v l for projective counterexamples and the axiom of projective determinacy for positive results for the first problem the first author s todorcevic and s tokgoz have produced a finer analysis with much weaker axioms we produce a similar analysis for the second problem showing the two problems are essentially equivalent we also construct in zfc a separable metrizable space with omegath power completely baire yet lacking a dense completely metrizable subspace this answers a question of eagle and tall in abstract model theory
[['w', 'hurewicz', 'proved', 'that', 'analytic', 'menger', 'sets', 'of', 'reals', 'are', 'sigmacompact', 'and', 'that', 'coanalytic', 'completely', 'baire', 'sets', 'of', 'reals', 'are', 'completely', 'metrizable', 'it', 'is', 'natural', 'to', 'try', 'to', 'generalize', 'these', 'theorems', 'to', 'projective', 'sets', 'this', 'has', 'previously', 'been', 'accomplished', 'by', 'v', 'l', 'for', 'projective', 'counterexamples', 'and', 'the', 'axiom', 'of', 'projective', 'determinacy', 'for', 'positive', 'results', 'for', 'the', 'first', 'problem', 'the', 'first', 'author', 's', 'todorcevic', 'and', 's', 'tokgoz', 'have', 'produced', 'a', 'finer', 'analysis', 'with', 'much', 'weaker', 'axioms', 'we', 'produce', 'a', 'similar', 'analysis', 'for', 'the', 'second', 'problem', 'showing', 'the', 'two', 'problems', 'are', 'essentially', 'equivalent', 'we', 'also', 'construct', 'in', 'zfc', 'a', 'separable', 'metrizable', 'space', 'with', 'omegath', 'power', 'completely', 'baire', 'yet', 'lacking', 'a', 'dense', 'completely', 'metrizable', 'subspace', 'this', 'answers', 'a', 'question', 'of', 'eagle', 'and', 'tall', 'in', 'abstract', 'model', 'theory']]
[-0.10104181847678936, 0.10944313185319789, -0.08735258008042972, 0.15059497461340018, -0.11697139857503457, -0.18180809423660602, 0.04155050476585189, 0.38609645184038616, -0.3315204965268693, -0.1653239612914319, 0.0968339356832297, -0.27224462377891795, -0.08810255407522304, 0.20408019778882797, -0.1669291999130472, 0.047901235081679455, 0.05346813092454965, 0.017079473510990296, -0.051170923440467295, -0.3590265182566231, 0.425483922705024, -0.08079049899432111, 0.19011313251287834, 0.05635098081150251, 0.11158002214884855, -0.0505338439100793, -0.041326455347906285, 0.08255825307181415, -0.17809468006009588, 0.1104475281440759, 0.34512708543958825, 0.1928962370895637, 0.28270809499289445, -0.32635850175397424, -0.1946005222133959, 0.1961616366056771, 0.07465643106725037, -0.0027379069961910325, 0.005725580487188285, -0.3154034579733038, 0.13619952473214003, -0.14244993234704423, -0.1017567737830606, -0.12515487779609527, 0.09884231662514006, -0.051765283221394065, -0.2293986593925856, -0.0014081247876364192, 0.19699810090809833, 0.1028992607792067, -0.07212575594705295, -0.06807318339654343, -0.03437336399413956, 0.044578613187148564, -0.03629350603361258, 0.0979574740560521, 0.019436112393026915, 0.005362927016415974, -0.1325237295567626, 0.35519222802732414, -0.02137885593271595, -0.21957619222471628, 0.18279245560155893, -0.18344632937474464, -0.19595948552118417, 0.13301417873453017, 0.02505588728359075, 0.13919780909167073, -0.08521737542942287, 0.21039681126575585, -0.20388616043014254, 0.15965398070894607, 0.12108456160555162, 0.03949043578922567, 0.10075576236183809, 0.10093895614249404, 0.11769517945084054, 0.14241374421645167, 0.08321698713002772, -0.010281260129124895, -0.30654719506004235, -0.12162039337331444, -0.15413350432475165, 0.1259741660092041, -0.03761477030887518, -0.17846231903441676, 0.3245156918533101, 0.11413209315775553, 0.14910177107355216, 0.12978481167806236, 0.27281984420326666, 0.009933825862419799, -0.011525957898153522, 0.08042441484600218, 0.15818222533018003, 0.19286735055445717, 0.010673484183863048, -0.04220523044483062, 0.03749113037758242, 0.1957191748343923]
1,803.03459
Two-dimensional Boron Monosulfides: Semiconducting and Metallic Polymorphs
The typical two-dimensional semiconductors, group \uppercase\expandafter{\romannumeral3A} chalcogenides, have garnered tremendous interest for their outstanding electronic, mechanical, and chemical properties. However, so far, there have been almost no reports on boron monosulfides (BS) binary material. Here, four two-dimensional BS sheets, namely the $\alpha$-, $\beta$-, $\gamma$-, and $\delta$-BS sheets, are proposed and discussed from $\emph{ab initio}$ calculations. State-of-the-art first-principles calculations reveal all these structures are thermally and dynamically stable, indicating the potential for successful experimental synthesis. Especially, for $\alpha$-BS, it has a calculated exfoliation energy of 0.96 J m$^{-2}$, suggesting the preparation of $\alpha$-BS is feasible by the exfoliation of bulk rhombohedral-BS. Our results show that $\alpha$-, $\beta$-, $\gamma$-BS are semiconductors, whereas $\delta$-BS is a metallic system. Remarkably, our calculations indicate that $\delta$-BS is a superconductor with a large electron-phonon coupling ($\lambda$ = 1.51) leading a high superconducting critical temperature ($T_c$ $\approx $ 21.56 K), which is the first report of intrinsic superconducting property among all two-dimensional group \uppercase\expandafter{\romannumeral3A} chalcogenides. The desired mechanical and electronic properties render the BS sheets as the promising two-dimensional materials for future applications in nanoelectronics.
cond-mat.mtrl-sci
the typical twodimensional semiconductors group uppercaseexpandafterromannumeral3a chalcogenides have garnered tremendous interest for their outstanding electronic mechanical and chemical properties however so far there have been almost no reports on boron monosulfides bs binary material here four twodimensional bs sheets namely the alpha beta gamma and deltabs sheets are proposed and discussed from emphab initio calculations stateoftheart firstprinciples calculations reveal all these structures are thermally and dynamically stable indicating the potential for successful experimental synthesis especially for alphabs it has a calculated exfoliation energy of 096 j m2 suggesting the preparation of alphabs is feasible by the exfoliation of bulk rhombohedralbs our results show that alpha beta gammabs are semiconductors whereas deltabs is a metallic system remarkably our calculations indicate that deltabs is a superconductor with a large electronphonon coupling lambda 151 leading a high superconducting critical temperature t_c approx 2156 k which is the first report of intrinsic superconducting property among all twodimensional group uppercaseexpandafterromannumeral3a chalcogenides the desired mechanical and electronic properties render the bs sheets as the promising twodimensional materials for future applications in nanoelectronics
[['the', 'typical', 'twodimensional', 'semiconductors', 'group', 'uppercaseexpandafterromannumeral3a', 'chalcogenides', 'have', 'garnered', 'tremendous', 'interest', 'for', 'their', 'outstanding', 'electronic', 'mechanical', 'and', 'chemical', 'properties', 'however', 'so', 'far', 'there', 'have', 'been', 'almost', 'no', 'reports', 'on', 'boron', 'monosulfides', 'bs', 'binary', 'material', 'here', 'four', 'twodimensional', 'bs', 'sheets', 'namely', 'the', 'alpha', 'beta', 'gamma', 'and', 'deltabs', 'sheets', 'are', 'proposed', 'and', 'discussed', 'from', 'emphab', 'initio', 'calculations', 'stateoftheart', 'firstprinciples', 'calculations', 'reveal', 'all', 'these', 'structures', 'are', 'thermally', 'and', 'dynamically', 'stable', 'indicating', 'the', 'potential', 'for', 'successful', 'experimental', 'synthesis', 'especially', 'for', 'alphabs', 'it', 'has', 'a', 'calculated', 'exfoliation', 'energy', 'of', '096', 'j', 'm2', 'suggesting', 'the', 'preparation', 'of', 'alphabs', 'is', 'feasible', 'by', 'the', 'exfoliation', 'of', 'bulk', 'rhombohedralbs', 'our', 'results', 'show', 'that', 'alpha', 'beta', 'gammabs', 'are', 'semiconductors', 'whereas', 'deltabs', 'is', 'a', 'metallic', 'system', 'remarkably', 'our', 'calculations', 'indicate', 'that', 'deltabs', 'is', 'a', 'superconductor', 'with', 'a', 'large', 'electronphonon', 'coupling', 'lambda', '151', 'leading', 'a', 'high', 'superconducting', 'critical', 'temperature', 't_c', 'approx', '2156', 'k', 'which', 'is', 'the', 'first', 'report', 'of', 'intrinsic', 'superconducting', 'property', 'among', 'all', 'twodimensional', 'group', 'uppercaseexpandafterromannumeral3a', 'chalcogenides', 'the', 'desired', 'mechanical', 'and', 'electronic', 'properties', 'render', 'the', 'bs', 'sheets', 'as', 'the', 'promising', 'twodimensional', 'materials', 'for', 'future', 'applications', 'in', 'nanoelectronics']]
[-0.15602975887766876, 0.16232189500279834, -0.02233052592834129, -0.024746163469150335, -0.03352858020430979, -0.18516005074112293, 0.09329822745502872, 0.41999552885946984, -0.21012957385905526, -0.2920707360046971, 0.023019640525008607, -0.35078977772363407, -0.16361631944036, 0.22906449992784902, 0.07077416356598192, 0.08482452261125539, 0.04098046138225233, -0.049980034895569965, -0.1066589205964085, -0.18451816328772966, 0.24312758550513536, 0.047432156576884585, 0.32347253304306994, 0.08109338758239414, 0.007832345633548411, -0.06544744660983698, 0.08590878675253515, 0.020283703889478654, -0.17840943925710984, 0.06950621545239462, 0.29354448155773916, -0.07794307581943405, 0.2361722374745809, -0.4239566053948639, -0.2590980511391535, 0.013251642307595296, 0.11115493406130768, 0.09422281785142224, -0.13249473168911852, -0.2253641372471226, 0.1305689519391094, -0.15946197671377482, -0.08723946627082221, -0.1282867322610828, 0.05152676215340548, 0.019373666987453093, -0.21440228223252822, 0.05546814039870001, -0.01505489706143956, 0.04530156838304452, -0.1121529698591022, -0.2262888423187713, -0.0772974609534311, 0.04932008888298536, 0.03809965892749674, 0.033895878889597955, 0.18423375818768845, -0.11112235175336109, -0.08875919239225742, 0.42660954141003243, -0.005884991152047673, -0.05859938231022919, 0.18151500693056732, -0.15567520651966332, -0.1428085450466503, 0.16801060473217683, 0.06045476284480709, 0.09819232540116098, -0.1392508096390349, 0.12011475124334751, -0.015068126118721386, 0.17194919037933953, 0.027925933220916813, 0.09936650125515263, 0.24445182783529162, 0.22903354108771856, -0.0024241337580058506, 0.05545290132286027, -0.07902208434089142, -0.014082830781391, -0.1825995794387863, -0.20805949333178647, -0.21969483518589508, 0.09649407823898774, -0.08675221521638485, -0.20253577206886428, 0.3593262943329618, 0.1132915482548175, 0.13315290712806233, -0.046918065286744796, 0.21753243790282045, 0.0729444876922678, 0.06967804479714045, 0.04362896619063309, 0.31118902831983764, 0.1558521748328691, 0.06983685114366167, -0.24307041958809886, 0.07113190289340256, -0.02681659633595058]
1,803.0346
Torsion of $\Q$-curves over quadratic fields
We find all the possible torsion groups of $\Q$-curves over quadratic fields and determine which groups appear finitely and which appear infinitely often.
math.NT
we find all the possible torsion groups of qcurves over quadratic fields and determine which groups appear finitely and which appear infinitely often
[['we', 'find', 'all', 'the', 'possible', 'torsion', 'groups', 'of', 'qcurves', 'over', 'quadratic', 'fields', 'and', 'determine', 'which', 'groups', 'appear', 'finitely', 'and', 'which', 'appear', 'infinitely', 'often']]
[-0.22333101632640415, 0.17633637704926988, -0.09299690802784069, 0.09663571186525666, -0.06424985581037143, -0.13887170961369638, -0.05314273257618365, 0.35874252021312714, -0.33948651085729187, -0.33060349556414975, 0.09023203334325682, -0.19851215847808382, -0.16571471880635488, 0.25938603443943936, -0.025803066547150196, -0.06851563076286213, -0.02452135928299116, 0.1672097138007698, -0.003382374008651823, -0.4071069311188615, 0.34300769638756046, -0.13666687500865562, 0.18476683053228518, 0.008968999082951443, 0.11723135784268379, -0.0009609381668269634, -0.10170047090429327, 0.02053902820562539, -0.12125217035898696, 0.07186266391173653, 0.3738490189223186, -0.043563962509126766, 0.1998376255126103, -0.3780297462059104, -0.16706861417902552, 0.27057934777163295, 0.1582796264277852, 0.039169134815102036, -0.023453902939091557, -0.2153249738494987, 0.07174834668251645, -0.1803439977052419, -0.10341697558760643, -0.10949274286141862, 0.05700200911530334, 0.07827304902931918, -0.19537374255773815, 0.042289505986010896, 0.08271529825667487, 0.08687746549106162, -0.07611233886817227, -0.12592516126840012, -0.06486747592039731, 0.12171299492373415, 0.1257635548953777, -0.0614798866495814, 0.09906263137236238, -0.07832018126045233, -0.11147978909961555, 0.4073787467635196, 0.015932547009509544, -0.15073686036402764, 0.2555473462233077, -0.19225562169500018, -0.18312957769502763, 0.18657640837456868, 0.12105566489955653, 0.17264602268519608, -0.05060060055035612, 0.19743628540258532, -0.11465950034882712, 0.05905105878153573, 0.17069504495062257, 0.013300895609933397, 0.207623357196217, -0.12419306794586389, 0.09132164226763922, 0.06292654053591516, 0.051482914339589035, -0.0285028638950873, -0.36423291650641226, -0.14268979903958415, -0.024942527489696185, 0.09707849792144059, -0.05576538859294606, -0.26848865116177045, 0.40058454061331955, 0.08976743655765186, 0.13950696895303932, 0.10403729964088163, 0.13601628464201224, 0.02293489306517269, 0.16335101036921792, 0.11989815533161163, 0.1442739697902099, 0.16792392941272777, -0.12539619363783655, -0.10060702742117902, -0.05849600525107235, 0.01567669164227403]
1,803.03461
Some preliminary results on relation between triplet composition and tissue source in larch total transcriptome
We studied the structuredness ensemble of transcriptome of Siberian larch. The clusters in 64-dimensional space were identified with $K$-means technique, where the objects to be clusterized are the different fragments of the genome. A tetrahedron like structure in distribution of these fragments was found. Chargaff's discrepancy measure was determined for each class, as well as that latter between the classes. It reveals a relative similitude of the classes. The results have been compared to those obtained for specific transcriptome of each tissue. Also, a surrogate transcriptome has been developed comprising the contigs assembled for specific tissues; that latter has been compared with the real total transcriptome, and significant difference has been observed.
q-bio.OT
we studied the structuredness ensemble of transcriptome of siberian larch the clusters in 64dimensional space were identified with kmeans technique where the objects to be clusterized are the different fragments of the genome a tetrahedron like structure in distribution of these fragments was found chargaffs discrepancy measure was determined for each class as well as that latter between the classes it reveals a relative similitude of the classes the results have been compared to those obtained for specific transcriptome of each tissue also a surrogate transcriptome has been developed comprising the contigs assembled for specific tissues that latter has been compared with the real total transcriptome and significant difference has been observed
[['we', 'studied', 'the', 'structuredness', 'ensemble', 'of', 'transcriptome', 'of', 'siberian', 'larch', 'the', 'clusters', 'in', '64dimensional', 'space', 'were', 'identified', 'with', 'kmeans', 'technique', 'where', 'the', 'objects', 'to', 'be', 'clusterized', 'are', 'the', 'different', 'fragments', 'of', 'the', 'genome', 'a', 'tetrahedron', 'like', 'structure', 'in', 'distribution', 'of', 'these', 'fragments', 'was', 'found', 'chargaffs', 'discrepancy', 'measure', 'was', 'determined', 'for', 'each', 'class', 'as', 'well', 'as', 'that', 'latter', 'between', 'the', 'classes', 'it', 'reveals', 'a', 'relative', 'similitude', 'of', 'the', 'classes', 'the', 'results', 'have', 'been', 'compared', 'to', 'those', 'obtained', 'for', 'specific', 'transcriptome', 'of', 'each', 'tissue', 'also', 'a', 'surrogate', 'transcriptome', 'has', 'been', 'developed', 'comprising', 'the', 'contigs', 'assembled', 'for', 'specific', 'tissues', 'that', 'latter', 'has', 'been', 'compared', 'with', 'the', 'real', 'total', 'transcriptome', 'and', 'significant', 'difference', 'has', 'been', 'observed']]
[-0.02606982665851579, 0.08781277859816328, -0.09393121107547943, 0.0926301742022458, -0.02152513787275114, -0.07768251078336366, -0.03606370252756668, 0.4070309131472771, -0.21382097113278828, -0.33659851770478, 0.06731003181110802, -0.2964622853240663, -0.12437628518923052, 0.18713463633321226, -0.04949067009978795, 0.06892067086716581, 0.06194754771422595, 0.07252215432734894, -0.015961194564754675, -0.25531059940736406, 0.30681635532112395, 0.04983939721049475, 0.27881157467865186, -0.0423379468640113, 0.11004723825525227, -0.059049552535205815, -0.0462835925552229, 0.08241203209945525, -0.11679232302685705, 0.13227314233258117, 0.27448412984709386, 0.15316016038663552, 0.2556924461574194, -0.35444581173942424, -0.2373083521794927, 0.13662564268867886, 0.15398240181301454, 0.10198012123250269, -0.041621339954352674, -0.2799534144744809, 0.11768093583564873, -0.15855243229972465, -0.0522891950677149, -0.053703847158301087, 0.0702421028722061, 0.06673914813187107, -0.18254171954478288, 0.08101583250364845, -0.009705221588839257, 0.09383319963983792, -0.07617949324542549, -0.19290068947676836, -0.06332602384126014, 0.20826727851609966, 0.06381476900008108, 0.05077940699577864, 0.12297764623820383, -0.057509435852158015, -0.1093919344628895, 0.36230402980332393, 0.004556137445823489, -0.15511295670954237, 0.1884728395671118, -0.15532296446950308, -0.1740845241916499, 0.14872978248708282, 0.11323882795737258, 0.10869093777520382, -0.19761303749952017, 0.062225834823558604, -0.07462501008246493, 0.16819536393242224, 0.13956065676757134, -0.012223042780533433, 0.15522945512618339, 0.20126567660814285, -0.026322837887814136, 0.1866981167414841, -0.12217296312779322, -0.07554875628557056, -0.17556579777945963, -0.17885312809396833, -0.16629222999992116, -0.024548063578549773, -0.04558831900262054, -0.1589043871499598, 0.3862417066328427, 0.025413689499016203, 0.21150073622162122, 0.04514378975103942, 0.2111728465284354, 0.05051315938596547, 0.1915342070663298, -0.03203415648645854, 0.21860193932661787, 0.11821441133880788, 0.0613597355134386, -0.2022791624684552, 0.1335927973518015, 0.02828039634083065]
1,803.03462
Solving linear equations with messenger-field and conjugate gradients techniques - an application to CMB data analysis
We discuss linear system solvers invoking a messenger-field and compare them with (preconditioned) conjugate gradients approaches. We show that the messenger-field techniques correspond to fixed point iterations of an appropriately preconditioned initial system of linear equations. We then argue that a conjugate gradient solver applied to the same preconditioned system, or equivalently a preconditioned conjugate gradient solver using the same preconditioner and applied to the original system, will in general ensure at least a comparable and typically better performance in terms of the number of iterations to convergence and time-to-solution. We illustrate our conclusions on two common examples drawn from the Cosmic Microwave Background data analysis: Wiener filtering and map-making. In addition, and contrary to the standard lore in the CMB field, we show that the performance of the preconditioned conjugate gradient solver can depend importantly on the starting vector. This observation seems of particular importance in the cases of map-making of high signal-to-noise sky maps and therefore should be of relevance for the next generation of CMB experiments.
astro-ph.CO math.NA
we discuss linear system solvers invoking a messengerfield and compare them with preconditioned conjugate gradients approaches we show that the messengerfield techniques correspond to fixed point iterations of an appropriately preconditioned initial system of linear equations we then argue that a conjugate gradient solver applied to the same preconditioned system or equivalently a preconditioned conjugate gradient solver using the same preconditioner and applied to the original system will in general ensure at least a comparable and typically better performance in terms of the number of iterations to convergence and timetosolution we illustrate our conclusions on two common examples drawn from the cosmic microwave background data analysis wiener filtering and mapmaking in addition and contrary to the standard lore in the cmb field we show that the performance of the preconditioned conjugate gradient solver can depend importantly on the starting vector this observation seems of particular importance in the cases of mapmaking of high signaltonoise sky maps and therefore should be of relevance for the next generation of cmb experiments
[['we', 'discuss', 'linear', 'system', 'solvers', 'invoking', 'a', 'messengerfield', 'and', 'compare', 'them', 'with', 'preconditioned', 'conjugate', 'gradients', 'approaches', 'we', 'show', 'that', 'the', 'messengerfield', 'techniques', 'correspond', 'to', 'fixed', 'point', 'iterations', 'of', 'an', 'appropriately', 'preconditioned', 'initial', 'system', 'of', 'linear', 'equations', 'we', 'then', 'argue', 'that', 'a', 'conjugate', 'gradient', 'solver', 'applied', 'to', 'the', 'same', 'preconditioned', 'system', 'or', 'equivalently', 'a', 'preconditioned', 'conjugate', 'gradient', 'solver', 'using', 'the', 'same', 'preconditioner', 'and', 'applied', 'to', 'the', 'original', 'system', 'will', 'in', 'general', 'ensure', 'at', 'least', 'a', 'comparable', 'and', 'typically', 'better', 'performance', 'in', 'terms', 'of', 'the', 'number', 'of', 'iterations', 'to', 'convergence', 'and', 'timetosolution', 'we', 'illustrate', 'our', 'conclusions', 'on', 'two', 'common', 'examples', 'drawn', 'from', 'the', 'cosmic', 'microwave', 'background', 'data', 'analysis', 'wiener', 'filtering', 'and', 'mapmaking', 'in', 'addition', 'and', 'contrary', 'to', 'the', 'standard', 'lore', 'in', 'the', 'cmb', 'field', 'we', 'show', 'that', 'the', 'performance', 'of', 'the', 'preconditioned', 'conjugate', 'gradient', 'solver', 'can', 'depend', 'importantly', 'on', 'the', 'starting', 'vector', 'this', 'observation', 'seems', 'of', 'particular', 'importance', 'in', 'the', 'cases', 'of', 'mapmaking', 'of', 'high', 'signaltonoise', 'sky', 'maps', 'and', 'therefore', 'should', 'be', 'of', 'relevance', 'for', 'the', 'next', 'generation', 'of', 'cmb', 'experiments']]
[-0.07856461376197145, 0.03754080362239097, -0.09757704452003636, 0.046077349727198166, -0.06690510301739201, -0.12654690513621547, 0.01820542761487161, 0.3702707449253091, -0.2967521621773164, -0.2951554607343442, 0.13350895680919356, -0.2985157401741533, -0.1308344958062858, 0.22094200695948507, -0.06258446207370408, 0.07632381233113433, 0.1179628701501353, 0.025136173803158506, -0.1455025438255558, -0.2942504099295558, 0.28607447037381306, 0.10123859803209048, 0.2760349764561136, -0.023922449240633872, 0.14549934101488976, -0.06797455530334821, -0.04230179326625507, 0.04622040265651716, -0.041953770652185765, 0.07821154084564103, 0.22905720574195737, 0.14681583849788493, 0.27958515437018727, -0.4060595651898912, -0.17069434393531904, 0.12409267988903615, 0.18279697850463678, 0.11273232636928647, -0.05563784125651383, -0.226777677195604, 0.10916638735704079, -0.10888067957203457, -0.10437145686435129, -0.10665747278347656, -0.09518641594081192, 0.07532885652397965, -0.2916692109655834, 0.04694292047353807, 0.06060426705098616, 0.03816859393441927, -0.040384795951718344, -0.16319630693987258, -0.005410202875075315, 0.031997029868952795, 0.048509306047100596, 0.02883572794195867, 0.1459098387747295, -0.09184851466600008, -0.08233766198370182, 0.36933879997625857, -0.12806114877858563, -0.24740579282909542, 0.19237325479371284, -0.09364389313641422, -0.15725271354435, 0.07234333403419681, 0.21672866397821708, 0.1265534789686253, -0.09657190002439667, 0.09124693915862757, 0.012421898189709037, 0.1781828112262064, 0.06525976354155891, -0.04059738735912345, 0.15743493605237788, 0.11018384504506663, 0.15254438640884385, 0.13256077534968067, -0.08202511531842488, -0.07849967933377017, -0.3066940442909916, -0.1343788686671997, -0.19437764056339235, 0.004140588589442035, -0.13245262900685603, -0.16386126875208168, 0.3906332622477394, 0.247556855525643, 0.16947486370099252, 0.04571520783213486, 0.3535970648204138, 0.13811310594636544, 0.045375378970767814, 0.1142804938602724, 0.24047890064950675, 0.14318057057631764, 0.09978101614717684, -0.2632698874961038, 0.009774739069105712, 0.08099825090790044]
1,803.03463
Vibration decoupling system for massive bolometers in dry cryostats
Pulse-tube based dilution refrigerators are massively employed in low temperature physics. They allow to reduce the running costs and to be operated with unprecedented easiness. However, the main drawback of this technology is the mechanical vibrations induced by the pulse-tube cryocooler. These perturbations can cause extra-noises drastically affecting the detector performance. In this paper, we propose a solution to mitigate the impact of these vibrations by mounting the detectors in an elastic-pendulum based suspended tower. Based on vibration modeling and experimental tests, we show that the vibration levels are attenuated by up to two orders of magnitude at most frequencies, especially above $\sim20$ Hz, for both vertical and radial directions. Thanks to this passive isolation solution, vibration levels, both along vertical and radial directions, below 1 $\mu\textrm{g/}\sqrt{\text{Hz}}$ in the frequency range [1-1000] Hz are obtained. This provides a convenient environment to test the ultimate performance of low temperature detectors. As a result, we report an improvement by one to two orders of magnitude on the noise levels of massive cryogenic bolometers, leading to thermal energy resolutions improved by a factor 5 to 40. Finally, we conclude that the energy resolution of our cryogenic bolometers are no longer limited from any residual vibrations, hence allowing the perspective of further improving our bolometer performance in the context of low-mass dark matter searches and neutrino physics applications.
physics.ins-det
pulsetube based dilution refrigerators are massively employed in low temperature physics they allow to reduce the running costs and to be operated with unprecedented easiness however the main drawback of this technology is the mechanical vibrations induced by the pulsetube cryocooler these perturbations can cause extranoises drastically affecting the detector performance in this paper we propose a solution to mitigate the impact of these vibrations by mounting the detectors in an elasticpendulum based suspended tower based on vibration modeling and experimental tests we show that the vibration levels are attenuated by up to two orders of magnitude at most frequencies especially above sim20 hz for both vertical and radial directions thanks to this passive isolation solution vibration levels both along vertical and radial directions below 1 mutextrmgsqrttexthz in the frequency range 11000 hz are obtained this provides a convenient environment to test the ultimate performance of low temperature detectors as a result we report an improvement by one to two orders of magnitude on the noise levels of massive cryogenic bolometers leading to thermal energy resolutions improved by a factor 5 to 40 finally we conclude that the energy resolution of our cryogenic bolometers are no longer limited from any residual vibrations hence allowing the perspective of further improving our bolometer performance in the context of lowmass dark matter searches and neutrino physics applications
[['pulsetube', 'based', 'dilution', 'refrigerators', 'are', 'massively', 'employed', 'in', 'low', 'temperature', 'physics', 'they', 'allow', 'to', 'reduce', 'the', 'running', 'costs', 'and', 'to', 'be', 'operated', 'with', 'unprecedented', 'easiness', 'however', 'the', 'main', 'drawback', 'of', 'this', 'technology', 'is', 'the', 'mechanical', 'vibrations', 'induced', 'by', 'the', 'pulsetube', 'cryocooler', 'these', 'perturbations', 'can', 'cause', 'extranoises', 'drastically', 'affecting', 'the', 'detector', 'performance', 'in', 'this', 'paper', 'we', 'propose', 'a', 'solution', 'to', 'mitigate', 'the', 'impact', 'of', 'these', 'vibrations', 'by', 'mounting', 'the', 'detectors', 'in', 'an', 'elasticpendulum', 'based', 'suspended', 'tower', 'based', 'on', 'vibration', 'modeling', 'and', 'experimental', 'tests', 'we', 'show', 'that', 'the', 'vibration', 'levels', 'are', 'attenuated', 'by', 'up', 'to', 'two', 'orders', 'of', 'magnitude', 'at', 'most', 'frequencies', 'especially', 'above', 'sim20', 'hz', 'for', 'both', 'vertical', 'and', 'radial', 'directions', 'thanks', 'to', 'this', 'passive', 'isolation', 'solution', 'vibration', 'levels', 'both', 'along', 'vertical', 'and', 'radial', 'directions', 'below', '1', 'mutextrmgsqrttexthz', 'in', 'the', 'frequency', 'range', '11000', 'hz', 'are', 'obtained', 'this', 'provides', 'a', 'convenient', 'environment', 'to', 'test', 'the', 'ultimate', 'performance', 'of', 'low', 'temperature', 'detectors', 'as', 'a', 'result', 'we', 'report', 'an', 'improvement', 'by', 'one', 'to', 'two', 'orders', 'of', 'magnitude', 'on', 'the', 'noise', 'levels', 'of', 'massive', 'cryogenic', 'bolometers', 'leading', 'to', 'thermal', 'energy', 'resolutions', 'improved', 'by', 'a', 'factor', '5', 'to', '40', 'finally', 'we', 'conclude', 'that', 'the', 'energy', 'resolution', 'of', 'our', 'cryogenic', 'bolometers', 'are', 'no', 'longer', 'limited', 'from', 'any', 'residual', 'vibrations', 'hence', 'allowing', 'the', 'perspective', 'of', 'further', 'improving', 'our', 'bolometer', 'performance', 'in', 'the', 'context', 'of', 'lowmass', 'dark', 'matter', 'searches', 'and', 'neutrino', 'physics', 'applications']]
[-0.11539854349808691, 0.17595411007984213, -0.029398699522827546, -0.008614755539029701, -0.04712002496214002, -0.09727429644556555, 0.05705861421565344, 0.3812593817626594, -0.21956018236311936, -0.36763233758880004, 0.11054301960235756, -0.26753546702528025, -0.055201873295978386, 0.25382791070833305, -0.06226340334807687, 0.03634379307762614, 0.06030603165409582, -0.021286401890294113, -0.04748665963192112, -0.22258517616828777, 0.2391180902565682, 0.15623752854667536, 0.3141294139820863, 0.05886985983581564, 0.10987940651250842, -0.06670500407399972, -0.016472220302841782, -0.01204021019482884, -0.1068915241902691, 0.08574754236965562, 0.2763342730159322, 0.05369583248662261, 0.25685457328684225, -0.4493271785522748, -0.1910487283526907, 0.09493088856870435, 0.11226212171251923, 0.0859454214199956, -0.05146509829731616, -0.2560243767004553, 0.0970810924533426, -0.16889208571445954, -0.13336267743517258, -0.05701660121921703, -0.04212764062922937, 0.006394541044340246, -0.20851943441729875, 0.058168796436835875, 0.03407174194172632, 0.057647422158340525, -0.058352964248600925, -0.15613270975434437, 0.03328580983463523, 0.08489201508454, 0.03516567039105418, -0.003956493337921023, 0.20032061421211253, -0.12744524971027837, -0.0967119905204255, 0.36869770870860075, -0.11237630324608887, -0.1462570073175754, 0.22584014238760178, -0.1517025015772688, -0.08459915754246226, 0.15947048693086227, 0.16209006466880668, 0.055731095891705044, -0.16003359344680435, 0.016559585063966892, 0.10555912123158641, 0.21255769213446632, 0.12062069187488626, 0.07104895798498934, 0.22552333326643645, 0.21972044354449005, 0.08334361281186949, 0.12818306236690105, -0.14749732150009315, 0.00892418412580176, -0.2555449047121662, -0.12652711239664466, -0.1204575246802586, 0.04023918647074659, -0.07771147082724905, -0.10291652059460657, 0.397524491530881, 0.2032901232248821, 0.15656032969746358, 0.020584048492606408, 0.36527530662083313, 0.10137773412058543, 0.0935378955883644, 0.04460200309391003, 0.30028065078474614, 0.1007166493703017, 0.0988271501994106, -0.2321669682070225, 0.002189411204392554, -0.03414761548866076]
1,803.03464
A Class of Solvable Stationary Singular Stochastic Control Problems
We consider the determination of the optimal stationary singular stochastic control of a linear diffusion for a class of average cumulative cost minimization problems arising in various financial and economic applications of stochastic control theory. We present a set of conditions under which the optimal policy is of the standard local time reflection type and state the first order conditions from which the boundaries can be determined. Since the conditions do not require symmetry or convexity of the costs, our results cover also the cases where costs are asymmetric and non-convex. We also investigate the comparative static properties of the optimal policy and delineate circumstances under which higher volatility expands the continuation region where utilizing the control is suboptimal.
math.OC
we consider the determination of the optimal stationary singular stochastic control of a linear diffusion for a class of average cumulative cost minimization problems arising in various financial and economic applications of stochastic control theory we present a set of conditions under which the optimal policy is of the standard local time reflection type and state the first order conditions from which the boundaries can be determined since the conditions do not require symmetry or convexity of the costs our results cover also the cases where costs are asymmetric and nonconvex we also investigate the comparative static properties of the optimal policy and delineate circumstances under which higher volatility expands the continuation region where utilizing the control is suboptimal
[['we', 'consider', 'the', 'determination', 'of', 'the', 'optimal', 'stationary', 'singular', 'stochastic', 'control', 'of', 'a', 'linear', 'diffusion', 'for', 'a', 'class', 'of', 'average', 'cumulative', 'cost', 'minimization', 'problems', 'arising', 'in', 'various', 'financial', 'and', 'economic', 'applications', 'of', 'stochastic', 'control', 'theory', 'we', 'present', 'a', 'set', 'of', 'conditions', 'under', 'which', 'the', 'optimal', 'policy', 'is', 'of', 'the', 'standard', 'local', 'time', 'reflection', 'type', 'and', 'state', 'the', 'first', 'order', 'conditions', 'from', 'which', 'the', 'boundaries', 'can', 'be', 'determined', 'since', 'the', 'conditions', 'do', 'not', 'require', 'symmetry', 'or', 'convexity', 'of', 'the', 'costs', 'our', 'results', 'cover', 'also', 'the', 'cases', 'where', 'costs', 'are', 'asymmetric', 'and', 'nonconvex', 'we', 'also', 'investigate', 'the', 'comparative', 'static', 'properties', 'of', 'the', 'optimal', 'policy', 'and', 'delineate', 'circumstances', 'under', 'which', 'higher', 'volatility', 'expands', 'the', 'continuation', 'region', 'where', 'utilizing', 'the', 'control', 'is', 'suboptimal']]
[-0.11866680157816961, 0.048750375988384505, -0.07768109096840274, 0.06781114735630803, -0.08709174622546788, -0.11111370563710563, 0.08622268254050844, 0.36733806000224184, -0.3194317242185421, -0.2521756549772783, 0.19831635866474612, -0.2046142270545937, -0.15352890355817722, 0.1866886012848983, -0.10083615709660661, 0.08517326772244287, 0.01475418103123162, 0.027246277806732583, -0.09939926571042489, -0.244729163455816, 0.31743043839262347, 0.02302351302052496, 0.2964269365927502, 0.04447678476865521, 0.11402648327746938, 0.0023347174067895452, 0.001031735012926036, 0.04648527595276116, -0.15356508160338683, 0.11228823330558586, 0.25928280008722004, 0.12634326257750766, 0.3247038016525345, -0.4468042015747613, -0.20795742511170126, 0.14283181529711275, 0.07204868805011687, 0.07750047840463671, -0.02792695357010332, -0.23616324963063753, 0.06549688695710809, -0.14314571768045425, -0.1148234657168451, -0.05108039903047518, -0.04069042081373329, 0.06206518535877915, -0.3519951712355769, 0.0842929798713494, 0.03848342103061869, 0.028752206746702074, -0.11560249479659715, -0.09945764760056339, -0.016609750469919575, 0.12488776073422275, 0.07036186719387613, -0.060458104699427466, 0.15429108053496687, -0.14787840130817176, -0.12602133180226097, 0.37869299852148386, -0.022598266989939667, -0.2173230909424963, 0.16584656536266082, -0.11917577847885359, -0.1300517009031184, 0.13683006209477844, 0.2138400977098837, 0.16417419198243058, -0.1725953759453377, 0.10899609350208037, -0.04661864453159711, 0.11948931412066982, 0.05122934358914485, 0.04152689816258034, 0.11133838874706607, 0.13979452419947802, 0.19615587141040025, 0.16175075846297682, -0.06223341544792682, -0.16686428929561703, -0.338268942739658, -0.1141549245133495, -0.12388754479524468, 0.03716686250802869, -0.11941374995219403, -0.16384296472176535, 0.39693470432290007, 0.13358411161197709, 0.15891956034832547, 0.08422701925082336, 0.2542277615587814, 0.16300142622572866, -0.002505793744901649, 0.10211608204755838, 0.22542908936425918, 0.04884338235686056, 0.10365659930594578, -0.2602540418298273, 0.12828304285199202, 0.03256134662049345]
1,803.03465
Malytics: A Malware Detection Scheme
An important problem of cyber-security is malware analysis. Besides good precision and recognition rate, a malware detection scheme needs to be able to generalize well for novel malware families (a.k.a zero-day attacks). It is important that the system does not require excessive computation particularly for deployment on the mobile devices. In this paper, we propose a novel scheme to detect malware which we call Malytics. It is not dependent on any particular tool or operating system. It extracts static features of any given binary file to distinguish malware from benign. Malytics consists of three stages: feature extraction, similarity measurement and classification. The three phases are implemented by a neural network with two hidden layers and an output layer. We show feature extraction, which is performed by tf -simhashing, is equivalent to the first layer of a particular neural network. We evaluate Malytics performance on both Android and Windows platforms. Malytics outperforms a wide range of learning-based techniques and also individual state-of-the-art models on both platforms. We also show Malytics is resilient and robust in addressing zero-day malware samples. The F1-score of Malytics is 97.21% and 99.45% on Android dex file and Windows PE files respectively, in the applied datasets. The speed and efficiency of Malytics are also evaluated.
cs.CR
an important problem of cybersecurity is malware analysis besides good precision and recognition rate a malware detection scheme needs to be able to generalize well for novel malware families aka zeroday attacks it is important that the system does not require excessive computation particularly for deployment on the mobile devices in this paper we propose a novel scheme to detect malware which we call malytics it is not dependent on any particular tool or operating system it extracts static features of any given binary file to distinguish malware from benign malytics consists of three stages feature extraction similarity measurement and classification the three phases are implemented by a neural network with two hidden layers and an output layer we show feature extraction which is performed by tf simhashing is equivalent to the first layer of a particular neural network we evaluate malytics performance on both android and windows platforms malytics outperforms a wide range of learningbased techniques and also individual stateoftheart models on both platforms we also show malytics is resilient and robust in addressing zeroday malware samples the f1score of malytics is 9721 and 9945 on android dex file and windows pe files respectively in the applied datasets the speed and efficiency of malytics are also evaluated
[['an', 'important', 'problem', 'of', 'cybersecurity', 'is', 'malware', 'analysis', 'besides', 'good', 'precision', 'and', 'recognition', 'rate', 'a', 'malware', 'detection', 'scheme', 'needs', 'to', 'be', 'able', 'to', 'generalize', 'well', 'for', 'novel', 'malware', 'families', 'aka', 'zeroday', 'attacks', 'it', 'is', 'important', 'that', 'the', 'system', 'does', 'not', 'require', 'excessive', 'computation', 'particularly', 'for', 'deployment', 'on', 'the', 'mobile', 'devices', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'scheme', 'to', 'detect', 'malware', 'which', 'we', 'call', 'malytics', 'it', 'is', 'not', 'dependent', 'on', 'any', 'particular', 'tool', 'or', 'operating', 'system', 'it', 'extracts', 'static', 'features', 'of', 'any', 'given', 'binary', 'file', 'to', 'distinguish', 'malware', 'from', 'benign', 'malytics', 'consists', 'of', 'three', 'stages', 'feature', 'extraction', 'similarity', 'measurement', 'and', 'classification', 'the', 'three', 'phases', 'are', 'implemented', 'by', 'a', 'neural', 'network', 'with', 'two', 'hidden', 'layers', 'and', 'an', 'output', 'layer', 'we', 'show', 'feature', 'extraction', 'which', 'is', 'performed', 'by', 'tf', 'simhashing', 'is', 'equivalent', 'to', 'the', 'first', 'layer', 'of', 'a', 'particular', 'neural', 'network', 'we', 'evaluate', 'malytics', 'performance', 'on', 'both', 'android', 'and', 'windows', 'platforms', 'malytics', 'outperforms', 'a', 'wide', 'range', 'of', 'learningbased', 'techniques', 'and', 'also', 'individual', 'stateoftheart', 'models', 'on', 'both', 'platforms', 'we', 'also', 'show', 'malytics', 'is', 'resilient', 'and', 'robust', 'in', 'addressing', 'zeroday', 'malware', 'samples', 'the', 'f1score', 'of', 'malytics', 'is', '9721', 'and', '9945', 'on', 'android', 'dex', 'file', 'and', 'windows', 'pe', 'files', 'respectively', 'in', 'the', 'applied', 'datasets', 'the', 'speed', 'and', 'efficiency', 'of', 'malytics', 'are', 'also', 'evaluated']]
[-0.11753937137633189, 0.0094682481714945, -0.054153317414620074, 0.045882872817587954, -0.06733152090576319, -0.23144161292455262, 0.04893650099520396, 0.40773688237619216, -0.2312417000932574, -0.31815484081786394, 0.11359892637583603, -0.3083668402193681, -0.1621109160233586, 0.2503458942581364, -0.11969193609210366, 0.09205571579710908, 0.08411824212978697, 0.03936144056086595, -0.036653216571827164, -0.2864875754905001, 0.3206547749528812, 0.03272123346785713, 0.35969603736547456, 0.07515282886989126, 0.11025962429031154, -0.015898712191973693, -0.021229599238652287, -0.027059755802091554, -0.04480457770349801, 0.09883101298563758, 0.31681615943933067, 0.2075223368457586, 0.26989290914565756, -0.3688243357239714, -0.1970603772448061, 0.08911535733577386, 0.15703924895367688, 0.11013694650079922, -0.05085738981198879, -0.32039306146274926, 0.17331452656015395, -0.22151699358516413, -0.008357805315703761, -0.13289786245817867, -0.009975216153487202, 0.0005823315806227965, -0.25429630163013217, 0.004837386495268404, 0.06047905832928367, 0.05386685365406067, -0.02566461565271346, -0.09125387880800445, 0.024337804023680337, 0.16040016478911753, 0.016447786880929276, 0.0065813882963659896, 0.17919483299677572, -0.1254305537811642, -0.134976746165756, 0.3419324874468508, -0.05372641681679997, -0.1626960317140832, 0.21764005919294724, 0.026873138923226667, -0.14540022981447587, 0.09748237663604419, 0.24895975039934443, 0.15483648929708965, -0.17191572876530137, -0.00015088530501422746, 0.00807398139692591, 0.2686493942010158, 0.04267653328218106, 0.005002525671056792, 0.1657415683603967, 0.24788704235331663, 0.043508672904547144, 0.14346669009573992, -0.14952014752420156, -0.030776063463389694, -0.18663072678741913, -0.1451550840460898, -0.15110749357485703, -0.0346331613048054, -0.08274051189530306, -0.1710253539900093, 0.41965950502583654, 0.22691367937933546, 0.15844016331630412, 0.07016403782001476, 0.3468554653587261, 0.016943895302016676, 0.13240958917222395, 0.12158247370695795, 0.16787906808459205, -0.015921276082973116, 0.1092008212648764, -0.15703991388031485, 0.12140837689082179, 0.01151051996320774]
1,803.03466
A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization
In this work, we present a globalized stochastic semismooth Newton method for solving stochastic optimization problems involving smooth nonconvex and nonsmooth convex terms in the objective function. We assume that only noisy gradient and Hessian information of the smooth part of the objective function is available via calling stochastic first and second order oracles. The proposed method can be seen as a hybrid approach combining stochastic semismooth Newton steps and stochastic proximal gradient steps. Two inexact growth conditions are incorporated to monitor the convergence and the acceptance of the semismooth Newton steps and it is shown that the algorithm converges globally to stationary points in expectation. Moreover, under standard assumptions and utilizing random matrix concentration inequalities, we prove that the proposed approach locally turns into a pure stochastic semismooth Newton method and converges r-superlinearly with high probability. We present numerical results and comparisons on $\ell_1$-regularized logistic regression and nonconvex binary classification that demonstrate the efficiency of our algorithm.
math.OC stat.ML
in this work we present a globalized stochastic semismooth newton method for solving stochastic optimization problems involving smooth nonconvex and nonsmooth convex terms in the objective function we assume that only noisy gradient and hessian information of the smooth part of the objective function is available via calling stochastic first and second order oracles the proposed method can be seen as a hybrid approach combining stochastic semismooth newton steps and stochastic proximal gradient steps two inexact growth conditions are incorporated to monitor the convergence and the acceptance of the semismooth newton steps and it is shown that the algorithm converges globally to stationary points in expectation moreover under standard assumptions and utilizing random matrix concentration inequalities we prove that the proposed approach locally turns into a pure stochastic semismooth newton method and converges rsuperlinearly with high probability we present numerical results and comparisons on ell_1regularized logistic regression and nonconvex binary classification that demonstrate the efficiency of our algorithm
[['in', 'this', 'work', 'we', 'present', 'a', 'globalized', 'stochastic', 'semismooth', 'newton', 'method', 'for', 'solving', 'stochastic', 'optimization', 'problems', 'involving', 'smooth', 'nonconvex', 'and', 'nonsmooth', 'convex', 'terms', 'in', 'the', 'objective', 'function', 'we', 'assume', 'that', 'only', 'noisy', 'gradient', 'and', 'hessian', 'information', 'of', 'the', 'smooth', 'part', 'of', 'the', 'objective', 'function', 'is', 'available', 'via', 'calling', 'stochastic', 'first', 'and', 'second', 'order', 'oracles', 'the', 'proposed', 'method', 'can', 'be', 'seen', 'as', 'a', 'hybrid', 'approach', 'combining', 'stochastic', 'semismooth', 'newton', 'steps', 'and', 'stochastic', 'proximal', 'gradient', 'steps', 'two', 'inexact', 'growth', 'conditions', 'are', 'incorporated', 'to', 'monitor', 'the', 'convergence', 'and', 'the', 'acceptance', 'of', 'the', 'semismooth', 'newton', 'steps', 'and', 'it', 'is', 'shown', 'that', 'the', 'algorithm', 'converges', 'globally', 'to', 'stationary', 'points', 'in', 'expectation', 'moreover', 'under', 'standard', 'assumptions', 'and', 'utilizing', 'random', 'matrix', 'concentration', 'inequalities', 'we', 'prove', 'that', 'the', 'proposed', 'approach', 'locally', 'turns', 'into', 'a', 'pure', 'stochastic', 'semismooth', 'newton', 'method', 'and', 'converges', 'rsuperlinearly', 'with', 'high', 'probability', 'we', 'present', 'numerical', 'results', 'and', 'comparisons', 'on', 'ell_1regularized', 'logistic', 'regression', 'and', 'nonconvex', 'binary', 'classification', 'that', 'demonstrate', 'the', 'efficiency', 'of', 'our', 'algorithm']]
[-0.06034422989365869, -0.051730321717295275, -0.11769118480151519, 0.06269464058867108, -0.08448790814108628, -0.1865158826731664, 0.030030161852630067, 0.39475889195971003, -0.34033865242668937, -0.23368137576794135, 0.14174469568710657, -0.23875383044817025, -0.2280415100247387, 0.1953533757006443, -0.11564714237870767, 0.12881719932266616, 0.10843277555194837, -0.039100573415856196, -0.11148966363147844, -0.34149330306527076, 0.2803600582108491, -0.005540908998043477, 0.24366258024945384, 0.007255699303917752, 0.188203807702123, -0.006640698890425736, 0.002236368928157689, 0.08457065941294349, -0.061527674936113254, 0.12083555597817831, 0.26438758147974745, 0.18350965307017528, 0.3876581476305765, -0.41579661353290837, -0.15222983661143086, 0.1377428075286878, 0.11990527452825851, 0.0668349632509996, -0.07631093409734696, -0.24978665625927027, 0.08246243211641154, -0.08506313299382978, -0.10070952060160852, -0.15682337158565893, -0.10522673481926499, 0.10723684509277426, -0.3709943479227633, 0.08717405179197181, 0.04195649361921639, -0.014389812916110542, -0.0708875531902466, -0.14238163375566842, 0.02635523451103433, 0.0018209326228339083, 0.06322044167443638, 0.06406998044783191, 0.14637180444890563, -0.045252446667291224, -0.10319728500952449, 0.3187286500270844, -0.09008672543509592, -0.26176184258435536, 0.1615853620445521, -0.057190816094980966, -0.16291872889711226, 0.1450855421250328, 0.21879394572888372, 0.22778819281537133, -0.170884979406189, 0.10528443314682061, -0.010402091825970365, 0.11249059199685632, 0.03334225626674162, -0.07592190525058327, 0.055557025917746784, 0.1496777241589808, 0.19601858550494042, 0.1465569190110693, -0.07551445800934836, -0.17609981544127193, -0.3080652527248817, -0.14706124784866983, -0.23381955427990023, 0.005120177492440407, -0.1569496031452333, -0.1662667915230555, 0.3595446171946352, 0.13280339096083388, 0.16080024384869898, 0.1629645985822323, 0.34511987152922, 0.17200810605176736, -0.0044687166647938426, 0.12976604317538912, 0.20193684656951058, 0.12884903845047177, 0.09868942432494575, -0.25220097956425197, 0.08778586638855594, 0.18662954200813664]