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.04967
|
Recurrent Neural Network Attention Mechanisms for Interpretable System
Log Anomaly Detection
|
Deep learning has recently demonstrated state-of-the art performance on key
tasks related to the maintenance of computer systems, such as intrusion
detection, denial of service attack detection, hardware and software system
failures, and malware detection. In these contexts, model interpretability is
vital for administrator and analyst to trust and act on the automated analysis
of machine learning models. Deep learning methods have been criticized as black
box oracles which allow limited insight into decision factors. In this work we
seek to "bridge the gap" between the impressive performance of deep learning
models and the need for interpretable model introspection. To this end we
present recurrent neural network (RNN) language models augmented with attention
for anomaly detection in system logs. Our methods are generally applicable to
any computer system and logging source.
By incorporating attention variants into our RNN language models we create
opportunities for model introspection and analysis without sacrificing
state-of-the art performance.
We demonstrate model performance and illustrate model interpretability on an
intrusion detection task using the Los Alamos National Laboratory (LANL) cyber
security dataset, reporting upward of 0.99 area under the receiver operator
characteristic curve despite being trained only on a single day's worth of
data.
|
cs.LG cs.NE stat.ML
|
deep learning has recently demonstrated stateofthe art performance on key tasks related to the maintenance of computer systems such as intrusion detection denial of service attack detection hardware and software system failures and malware detection in these contexts model interpretability is vital for administrator and analyst to trust and act on the automated analysis of machine learning models deep learning methods have been criticized as black box oracles which allow limited insight into decision factors in this work we seek to bridge the gap between the impressive performance of deep learning models and the need for interpretable model introspection to this end we present recurrent neural network rnn language models augmented with attention for anomaly detection in system logs our methods are generally applicable to any computer system and logging source by incorporating attention variants into our rnn language models we create opportunities for model introspection and analysis without sacrificing stateofthe art performance we demonstrate model performance and illustrate model interpretability on an intrusion detection task using the los alamos national laboratory lanl cyber security dataset reporting upward of 099 area under the receiver operator characteristic curve despite being trained only on a single days worth of data
|
[['deep', 'learning', 'has', 'recently', 'demonstrated', 'stateofthe', 'art', 'performance', 'on', 'key', 'tasks', 'related', 'to', 'the', 'maintenance', 'of', 'computer', 'systems', 'such', 'as', 'intrusion', 'detection', 'denial', 'of', 'service', 'attack', 'detection', 'hardware', 'and', 'software', 'system', 'failures', 'and', 'malware', 'detection', 'in', 'these', 'contexts', 'model', 'interpretability', 'is', 'vital', 'for', 'administrator', 'and', 'analyst', 'to', 'trust', 'and', 'act', 'on', 'the', 'automated', 'analysis', 'of', 'machine', 'learning', 'models', 'deep', 'learning', 'methods', 'have', 'been', 'criticized', 'as', 'black', 'box', 'oracles', 'which', 'allow', 'limited', 'insight', 'into', 'decision', 'factors', 'in', 'this', 'work', 'we', 'seek', 'to', 'bridge', 'the', 'gap', 'between', 'the', 'impressive', 'performance', 'of', 'deep', 'learning', 'models', 'and', 'the', 'need', 'for', 'interpretable', 'model', 'introspection', 'to', 'this', 'end', 'we', 'present', 'recurrent', 'neural', 'network', 'rnn', 'language', 'models', 'augmented', 'with', 'attention', 'for', 'anomaly', 'detection', 'in', 'system', 'logs', 'our', 'methods', 'are', 'generally', 'applicable', 'to', 'any', 'computer', 'system', 'and', 'logging', 'source', 'by', 'incorporating', 'attention', 'variants', 'into', 'our', 'rnn', 'language', 'models', 'we', 'create', 'opportunities', 'for', 'model', 'introspection', 'and', 'analysis', 'without', 'sacrificing', 'stateofthe', 'art', 'performance', 'we', 'demonstrate', 'model', 'performance', 'and', 'illustrate', 'model', 'interpretability', 'on', 'an', 'intrusion', 'detection', 'task', 'using', 'the', 'los', 'alamos', 'national', 'laboratory', 'lanl', 'cyber', 'security', 'dataset', 'reporting', 'upward', 'of', '099', 'area', 'under', 'the', 'receiver', 'operator', 'characteristic', 'curve', 'despite', 'being', 'trained', 'only', 'on', 'a', 'single', 'days', 'worth', 'of', 'data']]
|
[-0.06507234257702349, -0.05468994942063059, -0.04580326580690606, 0.07367137434828858, -0.13368314394087652, -0.2585506795204687, 0.07070056273663097, 0.4365588920002784, -0.22538736924491445, -0.36023630913949073, 0.09639056519348871, -0.2933015138959757, -0.17734557524149427, 0.22975536803315122, -0.15341357660780877, 0.1417839113444165, 0.14708539659411393, 0.06085863741904949, -0.024046790499164902, -0.305949299181153, 0.2743669181916336, 0.08995109197822979, 0.3706442774085309, 0.06840604066118514, 0.09898286241969809, -0.01656376728388208, -0.01616041072570211, -0.05026873022216758, -0.04641215938068174, 0.15052016300850105, 0.36409593827181996, 0.2662696573128359, 0.34360665148547426, -0.42538874841182295, -0.2545143386367897, 0.08714903884971834, 0.13323118907253662, 0.08092284522129863, -0.0334657689079059, -0.3868400017364007, 0.06474062553818592, -0.2696732250277442, 0.0016644550946004915, -0.15168488456519566, -0.03548932006474434, -0.02259865791226427, -0.22133657564949996, -0.012546463775439094, 0.0814189150096905, 0.12912693062345637, -0.05130080525490521, -0.11335354801702473, 0.04568599865329687, 0.15945287913516473, 0.03874209498330443, 0.03662092024942559, 0.17075593862917762, -0.2132853383475896, -0.18802651746499568, 0.3213149500432227, -0.04618296317633881, -0.16105351182208819, 0.21447356388788916, 0.021185333379591356, -0.18738946800985645, 0.07637654468323095, 0.2988302686291093, 0.05626366208448554, -0.16393705574569828, 0.034340017207079764, 0.01432807639422309, 0.20607602220049806, 0.013235828888630776, -0.03321154668663788, 0.227109596013877, 0.3129020506890039, -0.0001089568826078315, 0.10610853971424278, -0.11371434501059485, -0.08550489753675224, -0.17543445601400853, -0.1229325186827507, -0.12399062372490087, -0.00975357771867585, -0.0585050780339063, -0.13326423545250424, 0.38165408466011286, 0.2749275877093426, 0.11628152368086946, 0.0950515576199666, 0.4066055059301281, 0.007826532297938206, 0.13365023721461045, 0.13028104297759133, 0.1817396837463038, 0.0006157158517673837, 0.1551811106836969, -0.1593201712839249, 0.15589169221412805, 0.033974838435163045]
|
1,803.04968
|
Light Virtual Reality systems for the training of conditionally
automated vehicle drivers
|
In conditionally automated vehicles, drivers can engage in secondary
activities while traveling to their destination. However, drivers are required
to appropriately respond, in a limited amount of time, to a take-over request
when the system reaches its functional boundaries. In this context, Virtual
Reality systems represent a promising training and learning tool to properly
familiarize drivers with the automated vehicle and allow them to interact with
the novel equipment involved. In this study, the effectiveness of an
Head-Mounted display (HMD)-based training program for acquiring interaction
skills in automated cars was compared to a user manual and a fixed-base
simulator. Results show that the training system affects the take-over
performances evaluated in a test drive in a high-end driving simulator.
Moreover, self-reported measures indicate that the HMD-based training is
preferred with respect to the other systems.
|
cs.HC
|
in conditionally automated vehicles drivers can engage in secondary activities while traveling to their destination however drivers are required to appropriately respond in a limited amount of time to a takeover request when the system reaches its functional boundaries in this context virtual reality systems represent a promising training and learning tool to properly familiarize drivers with the automated vehicle and allow them to interact with the novel equipment involved in this study the effectiveness of an headmounted display hmdbased training program for acquiring interaction skills in automated cars was compared to a user manual and a fixedbase simulator results show that the training system affects the takeover performances evaluated in a test drive in a highend driving simulator moreover selfreported measures indicate that the hmdbased training is preferred with respect to the other systems
|
[['in', 'conditionally', 'automated', 'vehicles', 'drivers', 'can', 'engage', 'in', 'secondary', 'activities', 'while', 'traveling', 'to', 'their', 'destination', 'however', 'drivers', 'are', 'required', 'to', 'appropriately', 'respond', 'in', 'a', 'limited', 'amount', 'of', 'time', 'to', 'a', 'takeover', 'request', 'when', 'the', 'system', 'reaches', 'its', 'functional', 'boundaries', 'in', 'this', 'context', 'virtual', 'reality', 'systems', 'represent', 'a', 'promising', 'training', 'and', 'learning', 'tool', 'to', 'properly', 'familiarize', 'drivers', 'with', 'the', 'automated', 'vehicle', 'and', 'allow', 'them', 'to', 'interact', 'with', 'the', 'novel', 'equipment', 'involved', 'in', 'this', 'study', 'the', 'effectiveness', 'of', 'an', 'headmounted', 'display', 'hmdbased', 'training', 'program', 'for', 'acquiring', 'interaction', 'skills', 'in', 'automated', 'cars', 'was', 'compared', 'to', 'a', 'user', 'manual', 'and', 'a', 'fixedbase', 'simulator', 'results', 'show', 'that', 'the', 'training', 'system', 'affects', 'the', 'takeover', 'performances', 'evaluated', 'in', 'a', 'test', 'drive', 'in', 'a', 'highend', 'driving', 'simulator', 'moreover', 'selfreported', 'measures', 'indicate', 'that', 'the', 'hmdbased', 'training', 'is', 'preferred', 'with', 'respect', 'to', 'the', 'other', 'systems']]
|
[-0.12046676770524871, 0.0910167191537575, -0.06145614269364597, 0.05868472331212273, -0.11724797424797277, -0.20013197580758565, 0.08872023689879202, 0.4379726583908375, -0.2276745800325416, -0.35701964951962356, 0.06742673741060105, -0.27993396752604977, -0.13730402508421444, 0.216807106917696, -0.15996025458664925, 0.05899002675634032, 0.1362981268211751, 0.05998503747116074, 0.014972802739996547, -0.25699112899391385, 0.2671157716356806, 0.052278499871744474, 0.3241215217525938, 0.009222637997639078, 0.08059138537881742, 0.0015943157486617565, -0.026892540367194136, -0.019967535230562203, 0.0011694161040853722, 0.12305966459382746, 0.31936456095751137, 0.17462730145123892, 0.36577315699603213, -0.4509675887770447, -0.18552700983346404, 0.08044202421455734, 0.13511025409487293, 0.06616828005053663, -0.03708271627993624, -0.33723491579784376, 0.08929417381077108, -0.19376138512997476, -0.1247561184367291, -0.06750585095907904, -0.005630753389507168, 0.06738727945962193, -0.2893794803666581, -0.04705671770708229, -0.015091963959647748, 0.0931502348512299, -0.07304479498013546, -0.021127985592553376, -0.023772483201403367, 0.25426725557890606, 0.05729612653998, 0.05758280180835802, 0.16606545909062811, -0.17564104971146785, -0.13221930440767368, 0.3900679377908993, 0.004649435637406725, -0.20099721370173856, 0.24272379928961732, -0.08350355444560037, -0.12742601495054096, 0.1188527918665817, 0.2535364848655242, 0.08384899981319904, -0.18401444163398828, -0.0324419100144773, 0.055397478996643, 0.19951849295827734, 0.009687691711631596, -0.022342037150454252, 0.18725339033556893, 0.2271234576128199, 0.0595035577101871, 0.12265314036652908, -0.037928570837659506, -0.07142440108512353, -0.23123623196847906, -0.1823114913054987, -0.14845597122172663, -0.031155566138712534, -0.029202546404969627, -0.11271873532612353, 0.35825000608802066, 0.24565831602978191, 0.13681578515552656, 0.06780151806113527, 0.35909217696889, 0.04079638072464587, 0.1072627709726838, 0.0902587384356648, 0.20626873919946892, -0.030266046513544212, 0.19694584766507878, -0.21518835507436565, 0.13362570534131132, -0.02294902008068853]
|
1,803.04969
|
A Framework for Video-Driven Crowd Synthesis
|
We present a framework for video-driven crowd synthesis. Motion vectors
extracted from input crowd video are processed to compute global motion paths.
These paths encode the dominant motions observed in the input video. These
paths are then fed into a behavior-based crowd simulation framework, which is
responsible for synthesizing crowd animations that respect the motion patterns
observed in the video. Our system synthesizes 3D virtual crowds by animating
virtual humans along the trajectories returned by the crowd simulation
framework. We also propose a new metric for comparing the "visual similarity"
between the synthesized crowd and exemplar crowd. We demonstrate the proposed
approach on crowd videos collected under different settings.
|
cs.CV
|
we present a framework for videodriven crowd synthesis motion vectors extracted from input crowd video are processed to compute global motion paths these paths encode the dominant motions observed in the input video these paths are then fed into a behaviorbased crowd simulation framework which is responsible for synthesizing crowd animations that respect the motion patterns observed in the video our system synthesizes 3d virtual crowds by animating virtual humans along the trajectories returned by the crowd simulation framework we also propose a new metric for comparing the visual similarity between the synthesized crowd and exemplar crowd we demonstrate the proposed approach on crowd videos collected under different settings
|
[['we', 'present', 'a', 'framework', 'for', 'videodriven', 'crowd', 'synthesis', 'motion', 'vectors', 'extracted', 'from', 'input', 'crowd', 'video', 'are', 'processed', 'to', 'compute', 'global', 'motion', 'paths', 'these', 'paths', 'encode', 'the', 'dominant', 'motions', 'observed', 'in', 'the', 'input', 'video', 'these', 'paths', 'are', 'then', 'fed', 'into', 'a', 'behaviorbased', 'crowd', 'simulation', 'framework', 'which', 'is', 'responsible', 'for', 'synthesizing', 'crowd', 'animations', 'that', 'respect', 'the', 'motion', 'patterns', 'observed', 'in', 'the', 'video', 'our', 'system', 'synthesizes', '3d', 'virtual', 'crowds', 'by', 'animating', 'virtual', 'humans', 'along', 'the', 'trajectories', 'returned', 'by', 'the', 'crowd', 'simulation', 'framework', 'we', 'also', 'propose', 'a', 'new', 'metric', 'for', 'comparing', 'the', 'visual', 'similarity', 'between', 'the', 'synthesized', 'crowd', 'and', 'exemplar', 'crowd', 'we', 'demonstrate', 'the', 'proposed', 'approach', 'on', 'crowd', 'videos', 'collected', 'under', 'different', 'settings']]
|
[-0.07395994639093126, 0.0945602822941038, -0.1149324268637294, 0.05876366687934259, -0.08332305802118585, -0.09653031082739795, 0.016313511675603135, 0.45279311135204303, -0.29059622850683, -0.35205083991308195, -0.016617489122802875, -0.2805500359757355, -0.195678207885336, 0.19608899060188345, -0.16131031335572954, 0.10194953090265496, 0.16223955635171108, 0.03947086132743775, 0.07104132182387358, -0.20877331813486913, 0.2967106811348559, -0.04909562108244885, 0.35746273102618203, -0.0648267928072191, 0.2038708516198245, -0.02143755122475947, -0.0923803177149104, 0.040162742500089936, -0.08312294102971565, 0.20789638483310463, 0.2881553514291429, 0.2016414547537419, 0.2798812987274249, -0.4717355610768276, -0.23861571000371543, 0.02665540853222073, 0.13109649253871153, 0.0948979758120711, -0.0943199561669543, -0.44190140077154394, 0.16389825473608519, -0.15269442851530146, -0.0015268635211719407, -0.11892218891255281, -0.012443853731922529, -0.007691057511018934, -0.2658560359678059, 0.005730885143243035, -0.01059575589089137, 0.05551296695894389, -0.11273452910784355, -0.03810521353066347, 0.025995943766449474, 0.26686377089936286, 0.036153882334474474, 0.004974850962214448, 0.2095549474556551, -0.1837473649971394, -0.15091318567283452, 0.4420348882537197, -0.00725903536874318, -0.2047998952788206, 0.1770957542186672, -0.04232237659636195, -0.10526217004129042, 0.14616501705367463, 0.24000041699036956, 0.13816143721083385, -0.20366236675720387, -0.06319235221329748, -0.10732977574311749, 0.1433083418092725, 0.05019685270747653, -0.0369278366410139, 0.22312754227055442, 0.17721487458415883, 7.087200949037517e-05, 0.14208140051320056, -0.11465528074283309, -0.1103205823003211, -0.23259812819392042, -0.09166739724524733, -0.17576613301773453, -0.047073447007547925, -0.11674213662937055, -0.07615350248050634, 0.38873238107879404, 0.2521199649070493, 0.20973552854438485, 0.10918974795452042, 0.35125882095545186, 0.02760274469080657, 0.01344217728237035, 0.10785537241112993, 0.1156173812708369, -0.06324035729091891, 0.18363021829820894, -0.19098473379724762, 0.08425608202728822, 0.11359335729179697]
|
1,803.0497
|
Scalable Algorithms for Parallel Tree-based Adaptive Mesh Refinement
with General Element Types
|
In this thesis, we develop, discuss and implement algorithms for scalable
parallel tree-based adaptive mesh refinement (AMR) using space-filling curves
(SFCs). We create an AMR software that works independently of the used element
type, such as for example lines, triangles, tetrahedra, quadrilaterals,
hexahedra, and prisms. Along with a detailed mathematical discussion, this
requires the implementation as a numerical software and its validation, as well
as scalability tests on current supercomputers. For triangular and tetrahedral
elements (simplices) with red-refinement (1:4 in 2D, 1:8 in 3D), we develop a
new SFC index, the tetrahedral Morton index (TM-index). Its construction is
similar to the Morton index for quadrilaterals/hexahedra, as it is also based
on bitwise interleaving the coordinates of a certain vertex of the simplex, the
anchor node. We develop and demonstrate a new simplicial SFC and create a fast
and scalable tree-based AMR software that offers a flexibility and generality
that was previously not available.
|
cs.DC
|
in this thesis we develop discuss and implement algorithms for scalable parallel treebased adaptive mesh refinement amr using spacefilling curves sfcs we create an amr software that works independently of the used element type such as for example lines triangles tetrahedra quadrilaterals hexahedra and prisms along with a detailed mathematical discussion this requires the implementation as a numerical software and its validation as well as scalability tests on current supercomputers for triangular and tetrahedral elements simplices with redrefinement 14 in 2d 18 in 3d we develop a new sfc index the tetrahedral morton index tmindex its construction is similar to the morton index for quadrilateralshexahedra as it is also based on bitwise interleaving the coordinates of a certain vertex of the simplex the anchor node we develop and demonstrate a new simplicial sfc and create a fast and scalable treebased amr software that offers a flexibility and generality that was previously not available
|
[['in', 'this', 'thesis', 'we', 'develop', 'discuss', 'and', 'implement', 'algorithms', 'for', 'scalable', 'parallel', 'treebased', 'adaptive', 'mesh', 'refinement', 'amr', 'using', 'spacefilling', 'curves', 'sfcs', 'we', 'create', 'an', 'amr', 'software', 'that', 'works', 'independently', 'of', 'the', 'used', 'element', 'type', 'such', 'as', 'for', 'example', 'lines', 'triangles', 'tetrahedra', 'quadrilaterals', 'hexahedra', 'and', 'prisms', 'along', 'with', 'a', 'detailed', 'mathematical', 'discussion', 'this', 'requires', 'the', 'implementation', 'as', 'a', 'numerical', 'software', 'and', 'its', 'validation', 'as', 'well', 'as', 'scalability', 'tests', 'on', 'current', 'supercomputers', 'for', 'triangular', 'and', 'tetrahedral', 'elements', 'simplices', 'with', 'redrefinement', '14', 'in', '2d', '18', 'in', '3d', 'we', 'develop', 'a', 'new', 'sfc', 'index', 'the', 'tetrahedral', 'morton', 'index', 'tmindex', 'its', 'construction', 'is', 'similar', 'to', 'the', 'morton', 'index', 'for', 'quadrilateralshexahedra', 'as', 'it', 'is', 'also', 'based', 'on', 'bitwise', 'interleaving', 'the', 'coordinates', 'of', 'a', 'certain', 'vertex', 'of', 'the', 'simplex', 'the', 'anchor', 'node', 'we', 'develop', 'and', 'demonstrate', 'a', 'new', 'simplicial', 'sfc', 'and', 'create', 'a', 'fast', 'and', 'scalable', 'treebased', 'amr', 'software', 'that', 'offers', 'a', 'flexibility', 'and', 'generality', 'that', 'was', 'previously', 'not', 'available']]
|
[-0.09594758117881914, 0.03445382542064181, -0.05188520951196551, 0.03172367443020145, -0.12032092904051145, -0.16493011777910094, 0.05468852058673898, 0.4270235864135126, -0.2509733788048228, -0.30522604278599225, 0.11813733970203126, -0.2306317699359109, -0.14992759246922407, 0.17789317782968284, -0.11267475535161793, 0.05270488565089181, 0.07848985111496101, -0.0415614277527978, -0.08183581843816985, -0.2604965612043937, 0.27921961546375923, 0.11569057934296628, 0.2991403982322663, 0.022275600113595525, 0.1097791117336601, 0.008510511682058373, -0.044713813482473296, 0.06863550361245871, -0.13161903169854972, 0.1566154819257402, 0.24065189594247688, 0.1399244356636579, 0.21068227044617135, -0.41702980630099773, -0.1457147986983182, 0.003333080057054758, 0.14756000235211103, 0.09018685592648884, -0.0948337595925356, -0.1893551173309485, 0.1091735048374782, -0.18795414214022457, -0.1437490164426466, -0.10470920022577047, -0.007875676148881515, 0.03764706925023347, -0.26397781663574277, -0.03881978414351276, 0.06067104736265416, 0.12547328007717928, 0.030260699631956715, -0.13589866374929746, -0.02374238499905914, 0.0986061564149956, -0.08972781295888126, 0.045952200020353, 0.0661268344676743, -0.04378154931667571, -0.18592922252602875, 0.4105266303382814, 0.005561985377765571, -0.23280777343238393, 0.18559393256437035, -0.02955614132185777, -0.1718970040231943, 0.06894808968529105, 0.1665853778583308, 0.12485582200189431, -0.09899010530672968, 0.07861316915911933, -0.030584927058468263, 0.16435078244656323, 0.07438756857377787, -0.029375229485643407, 0.16340618972356122, 0.20359733917439976, 0.08720203696439664, 0.18299542782789407, -0.10290842764390011, -0.06861147067199151, -0.2678803014949275, -0.2332102585415123, -0.17914170923021933, -0.009345539964948937, -0.17355573292123153, -0.25070039968316754, 0.38390942258760336, 0.12489352035025755, 0.1436718702649038, 0.08564829208577672, 0.33086237947146097, -0.004403272656879078, 0.12060558838148912, 0.12571579835067193, 0.137647043033503, 0.07916792986293633, 0.1150051915831864, -0.15555699188262223, 0.039075278990591565, 0.14320606653015905]
|
1,803.04971
|
Forward Modeling of the Kepler Stellar Rotation Period Distribution:
Interpreting Periods from Mixed and Biased Stellar Populations
|
Stellar surface rotation carries information about stellar
parameters---particularly ages---and thus the large rotational datasets
extracted from Kepler timeseries represent powerful probes of stellar
populations. In this article, we address the challenge of interpreting such
datasets with a forward-modeling exercise. We combine theoretical models of
stellar rotation, a stellar population model for the galaxy, and prescriptions
for observational bias and confusion to predict the rotation distribution in
the Kepler field under standard "vanilla" assumptions. We arrive at two central
conclusions: first, that standard braking models fail to reproduce the observed
distribution at long periods, and second, that the interpretation of the period
distribution is complicated by mixtures of unevolved and evolved stars and
observational uncertainties. By assuming that the amplitude and thus
detectability of rotational signatures is tied to the Rossby number, we show
that the observed period distribution contains an apparent "Rossby edge" at
$\textrm{Ro}_{thresh} = 2.08$, above which long-period, high-Rossby number
stars are either absent or undetected. This $\textrm{Ro}_{thresh}$ is
comparable to the Rossby number at which van Saders et al. (2016) observed the
onset of weakened magnetic braking, and suggests either that this modified
braking is in operation in the full Kepler population, or that stars undergo a
transition in spottedness and activity at a very similar Rossby number. We
discuss the observations necessary to disentangle these competing scenarios.
(abridged)
|
astro-ph.SR
|
stellar surface rotation carries information about stellar parametersparticularly agesand thus the large rotational datasets extracted from kepler timeseries represent powerful probes of stellar populations in this article we address the challenge of interpreting such datasets with a forwardmodeling exercise we combine theoretical models of stellar rotation a stellar population model for the galaxy and prescriptions for observational bias and confusion to predict the rotation distribution in the kepler field under standard vanilla assumptions we arrive at two central conclusions first that standard braking models fail to reproduce the observed distribution at long periods and second that the interpretation of the period distribution is complicated by mixtures of unevolved and evolved stars and observational uncertainties by assuming that the amplitude and thus detectability of rotational signatures is tied to the rossby number we show that the observed period distribution contains an apparent rossby edge at textrmro_thresh 208 above which longperiod highrossby number stars are either absent or undetected this textrmro_thresh is comparable to the rossby number at which van saders et al 2016 observed the onset of weakened magnetic braking and suggests either that this modified braking is in operation in the full kepler population or that stars undergo a transition in spottedness and activity at a very similar rossby number we discuss the observations necessary to disentangle these competing scenarios abridged
|
[['stellar', 'surface', 'rotation', 'carries', 'information', 'about', 'stellar', 'parametersparticularly', 'agesand', 'thus', 'the', 'large', 'rotational', 'datasets', 'extracted', 'from', 'kepler', 'timeseries', 'represent', 'powerful', 'probes', 'of', 'stellar', 'populations', 'in', 'this', 'article', 'we', 'address', 'the', 'challenge', 'of', 'interpreting', 'such', 'datasets', 'with', 'a', 'forwardmodeling', 'exercise', 'we', 'combine', 'theoretical', 'models', 'of', 'stellar', 'rotation', 'a', 'stellar', 'population', 'model', 'for', 'the', 'galaxy', 'and', 'prescriptions', 'for', 'observational', 'bias', 'and', 'confusion', 'to', 'predict', 'the', 'rotation', 'distribution', 'in', 'the', 'kepler', 'field', 'under', 'standard', 'vanilla', 'assumptions', 'we', 'arrive', 'at', 'two', 'central', 'conclusions', 'first', 'that', 'standard', 'braking', 'models', 'fail', 'to', 'reproduce', 'the', 'observed', 'distribution', 'at', 'long', 'periods', 'and', 'second', 'that', 'the', 'interpretation', 'of', 'the', 'period', 'distribution', 'is', 'complicated', 'by', 'mixtures', 'of', 'unevolved', 'and', 'evolved', 'stars', 'and', 'observational', 'uncertainties', 'by', 'assuming', 'that', 'the', 'amplitude', 'and', 'thus', 'detectability', 'of', 'rotational', 'signatures', 'is', 'tied', 'to', 'the', 'rossby', 'number', 'we', 'show', 'that', 'the', 'observed', 'period', 'distribution', 'contains', 'an', 'apparent', 'rossby', 'edge', 'at', 'textrmro_thresh', '208', 'above', 'which', 'longperiod', 'highrossby', 'number', 'stars', 'are', 'either', 'absent', 'or', 'undetected', 'this', 'textrmro_thresh', 'is', 'comparable', 'to', 'the', 'rossby', 'number', 'at', 'which', 'van', 'saders', 'et', 'al', '2016', 'observed', 'the', 'onset', 'of', 'weakened', 'magnetic', 'braking', 'and', 'suggests', 'either', 'that', 'this', 'modified', 'braking', 'is', 'in', 'operation', 'in', 'the', 'full', 'kepler', 'population', 'or', 'that', 'stars', 'undergo', 'a', 'transition', 'in', 'spottedness', 'and', 'activity', 'at', 'a', 'very', 'similar', 'rossby', 'number', 'we', 'discuss', 'the', 'observations', 'necessary', 'to', 'disentangle', 'these', 'competing', 'scenarios', 'abridged']]
|
[-0.09531522989489657, 0.16780085716603682, -0.08560493040808238, 0.1429568669287661, -0.11489505727103977, -0.0723278431135208, 0.061289699110310784, 0.3546341495588422, -0.2073675358581335, -0.3954371524324944, 0.06852563857263344, -0.2563811390743277, -0.0790775458362606, 0.19804246394115305, -0.09396023991041232, -0.0015685388726333893, 0.0957621564872043, -0.04050894230604172, -0.01746464017941075, -0.23969652734177058, 0.3030291934714241, 0.048749554191910946, 0.1765113521069505, -0.06266886945732675, 0.040302740158729776, -0.07478058528653238, -0.047511482461041574, -0.01602709898941739, -0.15515127107548407, 0.03302107062407358, 0.21275397299367224, 0.1310033827695216, 0.21413992329128018, -0.4013287572320117, -0.23494950200953565, 0.07817126590552805, 0.1476640267162259, 0.09753101169914115, -0.035949675167699584, -0.2310805844922745, 0.06603403781150836, -0.17976857501320367, -0.1755302306340444, -0.021219763025468172, 0.08170040032858852, 0.020419268440563493, -0.27192472002447343, 0.1261597653729083, 0.07079756396151213, 0.13447959894357725, -0.11020253805746866, -0.1075593709956508, -0.08626947874192495, 0.08871485744927858, 0.1023437256145096, 0.05468199970633831, 0.09752520792576116, -0.1433247747699741, -0.04993103089536605, 0.36480661130748515, -0.08298567667235296, -0.06392518809866593, 0.2180260319522647, -0.19786262617468142, -0.1874649922818292, 0.10454558997393347, 0.17232498678258285, 0.08982106569374716, -0.10834799148575511, -0.01898405720306517, -0.01264985635400165, 0.20068441181725194, 0.07315794145282314, 0.01098099324187578, 0.32809041214803625, 0.13405582654224926, 0.010601626074504714, 0.06148290348369195, -0.21972851422398762, -0.07271238169226753, -0.23763463136978275, -0.06591603197807143, -0.15595638477270557, 0.052278218076152856, -0.08098149071068525, -0.12872615399889561, 0.3706582295088379, 0.1847887598562899, 0.20955425419866347, 0.06458796864851962, 0.29645043747976074, 0.10933344419179268, 0.09095040840857532, 0.11570813569651786, 0.282762511399423, 0.15859476865897346, 0.07858212904701399, -0.26171314787122335, 0.10651691470858315, -0.030665720701434238]
|
1,803.04972
|
Revisiting the Cooling Flow Problem in Galaxies, Groups, and Clusters of
Galaxies
|
We present a study of 107 galaxies, groups, and clusters spanning ~3 orders
of magnitude in mass, ~5 orders of magnitude in central galaxy star formation
rate (SFR), ~4 orders of magnitude in the classical cooling rate (dM/dt) of the
intracluster medium (ICM), and ~5 orders of magnitude in the central black hole
accretion rate. For each system in this sample, we measure dM/dt using archival
Chandra X-ray data and acquire the SFR and systematic uncertainty in the SFR by
combining over 330 estimates from dozens of literature sources. With these
data, we estimate the efficiency with which the ICM cools and forms stars,
finding e_cool = SFR/(dM/dt) = 1.4 +/- 0.4% for systems with dM/dt > 30
Msun/yr. For these systems, we measure a slope in the SFR-dM/dt relation
greater than unity, suggesting that the systems with the strongest cool cores
are also cooling more efficiently. We propose that this may be related to, on
average, higher black hole accretion rates in the strongest cool cores, which
could influence the total amount (saturating near the Eddington rate) and
dominant mode (mechanical vs radiative) of feedback. For systems with dM/dt <
30 Msun/yr, we find that the SFR and dM/dt are uncorrelated, and show that this
is consistent with star formation being fueled at a low (but dominant) level by
recycled ISM gas in these systems. We find an intrinsic log-normal scatter in
SFR at fixed dM/dt of 0.52 +/- 0.06 dex, suggesting that cooling is tightly
self-regulated over very long timescales, but can vary dramatically on short
timescales. There is weak evidence that this scatter may be related to the
feedback mechanism, with the scatter being minimized (~0.4 dex) in systems for
which the mechanical feedback power is within a factor of two of the cooling
luminosity.
|
astro-ph.HE astro-ph.CO astro-ph.GA
|
we present a study of 107 galaxies groups and clusters spanning 3 orders of magnitude in mass 5 orders of magnitude in central galaxy star formation rate sfr 4 orders of magnitude in the classical cooling rate dmdt of the intracluster medium icm and 5 orders of magnitude in the central black hole accretion rate for each system in this sample we measure dmdt using archival chandra xray data and acquire the sfr and systematic uncertainty in the sfr by combining over 330 estimates from dozens of literature sources with these data we estimate the efficiency with which the icm cools and forms stars finding e_cool sfrdmdt 14 04 for systems with dmdt 30 msunyr for these systems we measure a slope in the sfrdmdt relation greater than unity suggesting that the systems with the strongest cool cores are also cooling more efficiently we propose that this may be related to on average higher black hole accretion rates in the strongest cool cores which could influence the total amount saturating near the eddington rate and dominant mode mechanical vs radiative of feedback for systems with dmdt 30 msunyr we find that the sfr and dmdt are uncorrelated and show that this is consistent with star formation being fueled at a low but dominant level by recycled ism gas in these systems we find an intrinsic lognormal scatter in sfr at fixed dmdt of 052 006 dex suggesting that cooling is tightly selfregulated over very long timescales but can vary dramatically on short timescales there is weak evidence that this scatter may be related to the feedback mechanism with the scatter being minimized 04 dex in systems for which the mechanical feedback power is within a factor of two of the cooling luminosity
|
[['we', 'present', 'a', 'study', 'of', '107', 'galaxies', 'groups', 'and', 'clusters', 'spanning', '3', 'orders', 'of', 'magnitude', 'in', 'mass', '5', 'orders', 'of', 'magnitude', 'in', 'central', 'galaxy', 'star', 'formation', 'rate', 'sfr', '4', 'orders', 'of', 'magnitude', 'in', 'the', 'classical', 'cooling', 'rate', 'dmdt', 'of', 'the', 'intracluster', 'medium', 'icm', 'and', '5', 'orders', 'of', 'magnitude', 'in', 'the', 'central', 'black', 'hole', 'accretion', 'rate', 'for', 'each', 'system', 'in', 'this', 'sample', 'we', 'measure', 'dmdt', 'using', 'archival', 'chandra', 'xray', 'data', 'and', 'acquire', 'the', 'sfr', 'and', 'systematic', 'uncertainty', 'in', 'the', 'sfr', 'by', 'combining', 'over', '330', 'estimates', 'from', 'dozens', 'of', 'literature', 'sources', 'with', 'these', 'data', 'we', 'estimate', 'the', 'efficiency', 'with', 'which', 'the', 'icm', 'cools', 'and', 'forms', 'stars', 'finding', 'e_cool', 'sfrdmdt', '14', '04', 'for', 'systems', 'with', 'dmdt', '30', 'msunyr', 'for', 'these', 'systems', 'we', 'measure', 'a', 'slope', 'in', 'the', 'sfrdmdt', 'relation', 'greater', 'than', 'unity', 'suggesting', 'that', 'the', 'systems', 'with', 'the', 'strongest', 'cool', 'cores', 'are', 'also', 'cooling', 'more', 'efficiently', 'we', 'propose', 'that', 'this', 'may', 'be', 'related', 'to', 'on', 'average', 'higher', 'black', 'hole', 'accretion', 'rates', 'in', 'the', 'strongest', 'cool', 'cores', 'which', 'could', 'influence', 'the', 'total', 'amount', 'saturating', 'near', 'the', 'eddington', 'rate', 'and', 'dominant', 'mode', 'mechanical', 'vs', 'radiative', 'of', 'feedback', 'for', 'systems', 'with', 'dmdt', '30', 'msunyr', 'we', 'find', 'that', 'the', 'sfr', 'and', 'dmdt', 'are', 'uncorrelated', 'and', 'show', 'that', 'this', 'is', 'consistent', 'with', 'star', 'formation', 'being', 'fueled', 'at', 'a', 'low', 'but', 'dominant', 'level', 'by', 'recycled', 'ism', 'gas', 'in', 'these', 'systems', 'we', 'find', 'an', 'intrinsic', 'lognormal', 'scatter', 'in', 'sfr', 'at', 'fixed', 'dmdt', 'of', '052', '006', 'dex', 'suggesting', 'that', 'cooling', 'is', 'tightly', 'selfregulated', 'over', 'very', 'long', 'timescales', 'but', 'can', 'vary', 'dramatically', 'on', 'short', 'timescales', 'there', 'is', 'weak', 'evidence', 'that', 'this', 'scatter', 'may', 'be', 'related', 'to', 'the', 'feedback', 'mechanism', 'with', 'the', 'scatter', 'being', 'minimized', '04', 'dex', 'in', 'systems', 'for', 'which', 'the', 'mechanical', 'feedback', 'power', 'is', 'within', 'a', 'factor', 'of', 'two', 'of', 'the', 'cooling', 'luminosity']]
|
[-0.10130804855917068, 0.14941882588510896, -0.007375199666768828, 0.09787094630913287, -0.020930681164959723, -0.05502766687068508, 0.0952030397850092, 0.4205302641466002, -0.19643402155359826, -0.36158571334613754, 0.08257310794244253, -0.3077209216335492, 0.009869127638056346, 0.2538873870159374, -0.04811212756980378, -0.03860667277817134, 0.01746915424444832, -0.05063974902607423, -0.09342395380996554, -0.3036418411023528, 0.30998562619083636, 0.07978289414384115, 0.21211577774304252, 0.004821573119855463, 0.07033983390945675, -0.12364183820600405, -0.03742655998798894, -0.02088867631784373, -0.171650116689933, 0.043797490972692026, 0.23120277999113975, 0.08979206687890019, 0.2546967447938391, -0.3532342117014258, -0.21542035596796463, 0.07596030828114406, 0.2019744580450458, 0.030575612424969492, -0.07899822318100871, -0.15113912769802765, 0.08767248029421022, -0.24263280054721917, -0.09890783890746663, 0.05616163524918284, 0.06274409152754296, 0.01823843137976192, -0.2366696491750492, 0.23327709445445863, 0.024482029472448732, 0.05247102789000759, -0.1105731971043075, -0.0775202776178086, -0.03804482286473717, 0.059097603757005304, 0.03639379168045304, 0.09885331338473312, 0.2198370221460876, -0.14169688358142404, -0.0322193125243521, 0.3746376425629259, -0.08380670381483749, -0.018848505441524784, 0.23978774547963613, -0.239564615959192, -0.12937765314072938, 0.16160421450719056, 0.17055926751667652, 0.09278160712446464, -0.149976938711576, -0.0642347866209074, 0.011986033441531102, 0.286209909605494, 0.04973806776380276, 0.08061597554040727, 0.30103976451743486, 0.14862640876247254, 0.05272953702977965, 0.09156154217617425, -0.13050232870362466, -0.0615510791105099, -0.20026195844052083, -0.08793223343119283, -0.07524938214758402, 0.12874457576299234, -0.18353825651558767, -0.059995166688898066, 0.28652861378692207, 0.13727900262935744, 0.22276990784970224, 0.08972141880318071, 0.2949318505314446, 0.15733388387259728, 0.1214364548519924, 0.16561801648283037, 0.30834339974467423, 0.15952359297865468, 0.04601518147960176, -0.2677086184444196, 0.06381174021764661, -2.0831354465142254e-05]
|
1,803.04973
|
Quantum-first gravity
|
This paper elaborates on an intrinsically quantum approach to gravity, which
begins with a general framework for quantum mechanics and then seeks to
identify additional mathematical structure on Hilbert space that is responsible
for gravity and other phenomena. A key principle in this approach is that of
correspondence: this structure should reproduce spacetime, general relativity,
and quantum field theory in a limit of weak gravitational fields. A central
question is that of "Einstein separability," and asks how to define mutually
independent subsystems, e.g. through localization. Familiar definitions
involving tensor products or operator subalgebras do not clearly accomplish
this in gravity, as is seen in the correspondence limit. Instead, gravitational
behavior, particularly gauge invariance, suggests a network of Hilbert
subspaces related via inclusion maps, contrasting with other approaches based
on tensor-factorized Hilbert spaces. Any such localization structure is also
expected to place strong constraints on evolution, which are also supplemented
by the constraint of unitarity.
|
hep-th gr-qc quant-ph
|
this paper elaborates on an intrinsically quantum approach to gravity which begins with a general framework for quantum mechanics and then seeks to identify additional mathematical structure on hilbert space that is responsible for gravity and other phenomena a key principle in this approach is that of correspondence this structure should reproduce spacetime general relativity and quantum field theory in a limit of weak gravitational fields a central question is that of einstein separability and asks how to define mutually independent subsystems eg through localization familiar definitions involving tensor products or operator subalgebras do not clearly accomplish this in gravity as is seen in the correspondence limit instead gravitational behavior particularly gauge invariance suggests a network of hilbert subspaces related via inclusion maps contrasting with other approaches based on tensorfactorized hilbert spaces any such localization structure is also expected to place strong constraints on evolution which are also supplemented by the constraint of unitarity
|
[['this', 'paper', 'elaborates', 'on', 'an', 'intrinsically', 'quantum', 'approach', 'to', 'gravity', 'which', 'begins', 'with', 'a', 'general', 'framework', 'for', 'quantum', 'mechanics', 'and', 'then', 'seeks', 'to', 'identify', 'additional', 'mathematical', 'structure', 'on', 'hilbert', 'space', 'that', 'is', 'responsible', 'for', 'gravity', 'and', 'other', 'phenomena', 'a', 'key', 'principle', 'in', 'this', 'approach', 'is', 'that', 'of', 'correspondence', 'this', 'structure', 'should', 'reproduce', 'spacetime', 'general', 'relativity', 'and', 'quantum', 'field', 'theory', 'in', 'a', 'limit', 'of', 'weak', 'gravitational', 'fields', 'a', 'central', 'question', 'is', 'that', 'of', 'einstein', 'separability', 'and', 'asks', 'how', 'to', 'define', 'mutually', 'independent', 'subsystems', 'eg', 'through', 'localization', 'familiar', 'definitions', 'involving', 'tensor', 'products', 'or', 'operator', 'subalgebras', 'do', 'not', 'clearly', 'accomplish', 'this', 'in', 'gravity', 'as', 'is', 'seen', 'in', 'the', 'correspondence', 'limit', 'instead', 'gravitational', 'behavior', 'particularly', 'gauge', 'invariance', 'suggests', 'a', 'network', 'of', 'hilbert', 'subspaces', 'related', 'via', 'inclusion', 'maps', 'contrasting', 'with', 'other', 'approaches', 'based', 'on', 'tensorfactorized', 'hilbert', 'spaces', 'any', 'such', 'localization', 'structure', 'is', 'also', 'expected', 'to', 'place', 'strong', 'constraints', 'on', 'evolution', 'which', 'are', 'also', 'supplemented', 'by', 'the', 'constraint', 'of', 'unitarity']]
|
[-0.12999601831075316, 0.11563771744679091, -0.1218998750878705, 0.10601340749322322, -0.10701440006275387, -0.15866087974517856, -0.013050167774172877, 0.3112749592218475, -0.2679013294453909, -0.25184602734748446, 0.08675775585659579, -0.23108212489732147, -0.1984343445824944, 0.17538991871326431, -0.09135460291739578, 0.019360403962482033, 0.042784304324586214, 0.05751965346204397, -0.08938734520841511, -0.2114688729512767, 0.41322622269093745, 0.056013950914467134, 0.26908079040498517, 0.046321615232824305, 0.10064987334258416, 0.0340121736129125, -0.01171394822863387, 0.05878614834140761, -0.09982863071543321, 0.1351622525432141, 0.2536731474938516, 0.13845065918942615, 0.2529552169859385, -0.42762367034124005, -0.23057064449329392, 0.09536668711822796, 0.13422963588551415, 0.11113064289108235, 0.0007068788841232852, -0.30396491251398927, 0.02704546473664688, -0.1442376692517618, -0.10239173515221968, -0.10688100222595572, 0.017858439555020356, -0.08391819565155197, -0.24109960991198356, 0.055106626674030705, 0.087364419969864, 0.036928306120673035, -0.06054233011235696, -0.014675870992005895, 0.013587559711833308, 0.0875926956525255, 0.03688614611708699, 0.05272200524660887, 0.12369308119230399, -0.11686201105381247, -0.13973174762023383, 0.43095510844993434, -0.05533728797066336, -0.23902555815632048, 0.2135492716048497, -0.14939745007618482, -0.19262179382772374, 0.05001888242002357, 0.1268042982403749, 0.10079157976220587, -0.15059282985672634, 0.1392493916270658, -0.04771122699177343, 0.136231511564974, 0.0529818057046071, 0.09443367413911677, 0.248178485954436, 0.08940988836286504, 0.08447974994230796, 0.10378585649681661, 0.009226972179402129, -0.12657971758193037, -0.36029412549786466, -0.1645424383056344, -0.15191427802703544, 0.08600997233474582, -0.0772887188146116, -0.16097608669752292, 0.33306505216979515, 0.16060575617026854, 0.16797470638956083, 0.048447222721282074, 0.2568409403503014, 0.10191434751846067, 0.07402283268877202, 0.031544078126233194, 0.2537020336854838, 0.17524166653705822, 0.05839494452507424, -0.1860186042308996, 0.007963551882520513, 0.13249796946697376]
|
1,803.04974
|
The Hubble Catalog of Variables (HCV)
|
The Hubble Source Catalog (HSC) combines lists of sources detected on images
obtained with the WFPC2, ACS and WFC3 instruments aboard the Hubble Space
Telescope (HST) available in the Hubble Legacy Archive. The catalog contains
time-domain information with about two million of its sources detected with the
same instrument and filter in at least five HST visits. The Hubble Catalog of
Variables (HCV) project aims to identify HSC sources showing significant
brightness variations. A magnitude-dependent threshold in the median absolute
deviation of photometric measurements (an outlier-resistant measure of
lightcurve scatter) is adopted as the variability-detection statistic. It is
supplemented with a cut in $\chi_{\rm red}^2$ that removes sources with large
photometric errors. A pre-processing procedure involving bad image
identification, outlier rejection and computation of local magnitude zero-point
corrections is applied to HSC lightcurves before computing the variability
detection statistic. About 52000 HSC sources are identified as candidate
variables, among which 7800 show variability in more than one filter. Visual
inspection suggests that $\sim 70\%$ of the candidates detected in multiple
filters are true variables while the remaining $\sim 30\%$ are sources with
aperture photometry corrupted by blending, imaging artifacts or image
processing anomalies. The candidate variables have AB magnitudes in the range
15-27$^{m}$ with the median 22$^{m}$. Among them are the stars in our own and
nearby galaxies as well as active galactic nuclei.
|
astro-ph.IM astro-ph.GA astro-ph.SR
|
the hubble source catalog hsc combines lists of sources detected on images obtained with the wfpc2 acs and wfc3 instruments aboard the hubble space telescope hst available in the hubble legacy archive the catalog contains timedomain information with about two million of its sources detected with the same instrument and filter in at least five hst visits the hubble catalog of variables hcv project aims to identify hsc sources showing significant brightness variations a magnitudedependent threshold in the median absolute deviation of photometric measurements an outlierresistant measure of lightcurve scatter is adopted as the variabilitydetection statistic it is supplemented with a cut in chi_rm red2 that removes sources with large photometric errors a preprocessing procedure involving bad image identification outlier rejection and computation of local magnitude zeropoint corrections is applied to hsc lightcurves before computing the variability detection statistic about 52000 hsc sources are identified as candidate variables among which 7800 show variability in more than one filter visual inspection suggests that sim 70 of the candidates detected in multiple filters are true variables while the remaining sim 30 are sources with aperture photometry corrupted by blending imaging artifacts or image processing anomalies the candidate variables have ab magnitudes in the range 1527m with the median 22m among them are the stars in our own and nearby galaxies as well as active galactic nuclei
|
[['the', 'hubble', 'source', 'catalog', 'hsc', 'combines', 'lists', 'of', 'sources', 'detected', 'on', 'images', 'obtained', 'with', 'the', 'wfpc2', 'acs', 'and', 'wfc3', 'instruments', 'aboard', 'the', 'hubble', 'space', 'telescope', 'hst', 'available', 'in', 'the', 'hubble', 'legacy', 'archive', 'the', 'catalog', 'contains', 'timedomain', 'information', 'with', 'about', 'two', 'million', 'of', 'its', 'sources', 'detected', 'with', 'the', 'same', 'instrument', 'and', 'filter', 'in', 'at', 'least', 'five', 'hst', 'visits', 'the', 'hubble', 'catalog', 'of', 'variables', 'hcv', 'project', 'aims', 'to', 'identify', 'hsc', 'sources', 'showing', 'significant', 'brightness', 'variations', 'a', 'magnitudedependent', 'threshold', 'in', 'the', 'median', 'absolute', 'deviation', 'of', 'photometric', 'measurements', 'an', 'outlierresistant', 'measure', 'of', 'lightcurve', 'scatter', 'is', 'adopted', 'as', 'the', 'variabilitydetection', 'statistic', 'it', 'is', 'supplemented', 'with', 'a', 'cut', 'in', 'chi_rm', 'red2', 'that', 'removes', 'sources', 'with', 'large', 'photometric', 'errors', 'a', 'preprocessing', 'procedure', 'involving', 'bad', 'image', 'identification', 'outlier', 'rejection', 'and', 'computation', 'of', 'local', 'magnitude', 'zeropoint', 'corrections', 'is', 'applied', 'to', 'hsc', 'lightcurves', 'before', 'computing', 'the', 'variability', 'detection', 'statistic', 'about', '52000', 'hsc', 'sources', 'are', 'identified', 'as', 'candidate', 'variables', 'among', 'which', '7800', 'show', 'variability', 'in', 'more', 'than', 'one', 'filter', 'visual', 'inspection', 'suggests', 'that', 'sim', '70', 'of', 'the', 'candidates', 'detected', 'in', 'multiple', 'filters', 'are', 'true', 'variables', 'while', 'the', 'remaining', 'sim', '30', 'are', 'sources', 'with', 'aperture', 'photometry', 'corrupted', 'by', 'blending', 'imaging', 'artifacts', 'or', 'image', 'processing', 'anomalies', 'the', 'candidate', 'variables', 'have', 'ab', 'magnitudes', 'in', 'the', 'range', '1527m', 'with', 'the', 'median', '22m', 'among', 'them', 'are', 'the', 'stars', 'in', 'our', 'own', 'and', 'nearby', 'galaxies', 'as', 'well', 'as', 'active', 'galactic', 'nuclei']]
|
[-0.05511526550678326, 0.06290408855387615, -0.08246923982464957, 0.0741912797472663, -0.11948991429831883, -0.10899823349879473, 0.07213492316459369, 0.45048479406306374, -0.16882691735915872, -0.4165924845760629, 0.10536094968959403, -0.3811828610381929, -0.03327160943915848, 0.21155648471337712, -0.08093605962109424, -0.008726010588155765, 0.11293736492953689, -0.07308922302213865, -0.03078815438131469, -0.32523965565867013, 0.21921597430861778, 0.07279217543240586, 0.19072949593650743, -0.15134484364600573, 0.11706546780535303, -0.04368198572392512, -0.1965247478148567, -0.0038680770839785742, -0.08590251419566018, 0.033800240865238515, 0.27179979986818803, 0.17976839746489734, 0.25216989003846685, -0.26385639401414007, -0.1940977801632018, 0.09526573435078918, 0.17318740011791, 0.015374450350698607, -0.009615844319802625, -0.3451446169582765, 0.029472663499229498, -0.10876987285056569, -0.12191218410368916, 0.019120375264954345, 0.03487611618957048, 0.03734482197502915, -0.23084747217325874, 0.11513943294309736, -0.06922068818297439, 0.15856304053402595, -0.13517600984509934, -0.16444334260723237, -0.05432782507642716, 0.10137893289761676, -0.019052428790743196, 0.09980549646027352, 0.13815208310387792, -0.17753177603200496, -0.046275585603255495, 0.37429763833103, -0.05871354992591251, 0.003424849685405832, 0.13175774092285059, -0.1724372175279836, -0.18708099026972538, 0.16600120491853904, 0.1305757406904105, 0.08313961180055522, -0.21123730947107616, 0.011498288617035316, 0.04914966445206559, 0.25930510831330966, 0.06492372214155719, 0.12204942893293766, 0.25029725394300206, 0.08761118524981772, 0.05971677597228657, 0.12065609336192762, -0.3404271053214825, 0.007799142776731385, -0.28423343952487085, -0.07420048103309594, -0.16058298458484302, 0.029096302842906766, -0.1445330012549132, -0.13719172397053198, 0.32647426152281567, 0.16631558580730718, 0.15862848638341978, 0.04191752066372207, 0.3383457818747039, 0.0121763613142444, 0.18719002826200437, 0.06891167513832315, 0.29357920110866226, 0.08222168169671257, 0.06789552133553556, -0.16157936859176372, 0.03402318814095127, -0.0018843907502857015]
|
1,803.04975
|
Lensing reconstruction from line intensity maps: the impact of
gravitational nonlinearity
|
We investigate the detection prospects for gravitational lensing of
three-dimensional maps from upcoming line intensity surveys, focusing in
particular on the impact of gravitational nonlinearities on standard quadratic
lensing estimators. Using perturbation theory, we show that these
nonlinearities can provide a significant contaminant to lensing reconstruction,
even for observations at reionization-era redshifts. However, we show how this
contamination can be mitigated with the use of a "bias-hardened" estimator.
Along the way, we present an estimator for reconstructing long-wavelength
density modes, in the spirit of the "tidal reconstruction" technique that has
been proposed elsewhere, and discuss the dominant biases on this estimator.
After applying bias-hardening, we find that a detection of the lensing
potential power spectrum will still be challenging for the first phase of
SKA-Low, CHIME, and HIRAX, with gravitational nonlinearities decreasing the
signal to noise by a factor of a few compared to forecasts that ignore these
effects. On the other hand, cross-correlations between lensing and galaxy
clustering or cosmic shear from a large photometric survey look promising,
provided that systematics can be sufficiently controlled. We reach similar
conclusions for a single-dish survey inspired by CII measurements planned for
CCAT-prime, suggesting that lensing is an interesting science target not just
for 21cm surveys, but also for intensity maps of other lines.
|
astro-ph.CO gr-qc
|
we investigate the detection prospects for gravitational lensing of threedimensional maps from upcoming line intensity surveys focusing in particular on the impact of gravitational nonlinearities on standard quadratic lensing estimators using perturbation theory we show that these nonlinearities can provide a significant contaminant to lensing reconstruction even for observations at reionizationera redshifts however we show how this contamination can be mitigated with the use of a biashardened estimator along the way we present an estimator for reconstructing longwavelength density modes in the spirit of the tidal reconstruction technique that has been proposed elsewhere and discuss the dominant biases on this estimator after applying biashardening we find that a detection of the lensing potential power spectrum will still be challenging for the first phase of skalow chime and hirax with gravitational nonlinearities decreasing the signal to noise by a factor of a few compared to forecasts that ignore these effects on the other hand crosscorrelations between lensing and galaxy clustering or cosmic shear from a large photometric survey look promising provided that systematics can be sufficiently controlled we reach similar conclusions for a singledish survey inspired by cii measurements planned for ccatprime suggesting that lensing is an interesting science target not just for 21cm surveys but also for intensity maps of other lines
|
[['we', 'investigate', 'the', 'detection', 'prospects', 'for', 'gravitational', 'lensing', 'of', 'threedimensional', 'maps', 'from', 'upcoming', 'line', 'intensity', 'surveys', 'focusing', 'in', 'particular', 'on', 'the', 'impact', 'of', 'gravitational', 'nonlinearities', 'on', 'standard', 'quadratic', 'lensing', 'estimators', 'using', 'perturbation', 'theory', 'we', 'show', 'that', 'these', 'nonlinearities', 'can', 'provide', 'a', 'significant', 'contaminant', 'to', 'lensing', 'reconstruction', 'even', 'for', 'observations', 'at', 'reionizationera', 'redshifts', 'however', 'we', 'show', 'how', 'this', 'contamination', 'can', 'be', 'mitigated', 'with', 'the', 'use', 'of', 'a', 'biashardened', 'estimator', 'along', 'the', 'way', 'we', 'present', 'an', 'estimator', 'for', 'reconstructing', 'longwavelength', 'density', 'modes', 'in', 'the', 'spirit', 'of', 'the', 'tidal', 'reconstruction', 'technique', 'that', 'has', 'been', 'proposed', 'elsewhere', 'and', 'discuss', 'the', 'dominant', 'biases', 'on', 'this', 'estimator', 'after', 'applying', 'biashardening', 'we', 'find', 'that', 'a', 'detection', 'of', 'the', 'lensing', 'potential', 'power', 'spectrum', 'will', 'still', 'be', 'challenging', 'for', 'the', 'first', 'phase', 'of', 'skalow', 'chime', 'and', 'hirax', 'with', 'gravitational', 'nonlinearities', 'decreasing', 'the', 'signal', 'to', 'noise', 'by', 'a', 'factor', 'of', 'a', 'few', 'compared', 'to', 'forecasts', 'that', 'ignore', 'these', 'effects', 'on', 'the', 'other', 'hand', 'crosscorrelations', 'between', 'lensing', 'and', 'galaxy', 'clustering', 'or', 'cosmic', 'shear', 'from', 'a', 'large', 'photometric', 'survey', 'look', 'promising', 'provided', 'that', 'systematics', 'can', 'be', 'sufficiently', 'controlled', 'we', 'reach', 'similar', 'conclusions', 'for', 'a', 'singledish', 'survey', 'inspired', 'by', 'cii', 'measurements', 'planned', 'for', 'ccatprime', 'suggesting', 'that', 'lensing', 'is', 'an', 'interesting', 'science', 'target', 'not', 'just', 'for', '21cm', 'surveys', 'but', 'also', 'for', 'intensity', 'maps', 'of', 'other', 'lines']]
|
[-0.07702484979047065, 0.05233773158907877, -0.08869529649575564, 0.10511039757810894, -0.09163624634392453, -0.09747967979389627, -0.010865826710895305, 0.39563783265261854, -0.22580688158977089, -0.2775818195339663, 0.11780627371226901, -0.3070190603209227, -0.1510597445231849, 0.25506263287071473, -0.014119995740833759, 0.021014682902243887, 0.08495183142787066, -0.084650384461793, -0.06002178643190112, -0.2737671198263782, 0.3003786230940919, 0.1407595313423406, 0.2333132366460011, 0.023725859360698768, 0.08057502588553474, -0.03108775441929512, -0.11074692330883719, 0.07643177815916026, -0.13957392158293247, 0.056995674449414176, 0.2579638323828278, 0.16043096313460495, 0.24997487606180577, -0.3676711089811972, -0.23595344338464547, 0.12902199181449991, 0.15909928555260477, 0.1513877400810614, -0.08993970726779993, -0.3324003559162055, 0.0673594467978598, -0.1461772538734803, -0.10421669759491892, -0.06688825886639196, -0.017379008319617306, 0.0516363375122831, -0.25681936926532856, 0.12156005022190489, 0.008765573487550868, 0.052018072553226165, -0.05178656371451597, -0.09368627158796936, 0.002895812349508724, 0.08250638941784005, 0.019835645729075604, 0.048137360448856345, 0.14659613424302984, -0.19011478076393218, -0.051325961247845706, 0.3836593425996001, -0.1330129699902918, -0.11440845956734572, 0.14302680961416936, -0.19601301753438868, -0.22354883145015705, 0.09429928177627801, 0.2025201879441738, 0.05171171557687894, -0.13372539338695494, 0.03728894820526216, 0.043140825706807745, 0.21151126906169818, 0.07340357418423651, 0.04230312995345859, 0.2989052126395971, 0.11603734304166236, 0.1485246889407954, 0.10292229198401583, -0.21679441487390141, 0.05074044863662519, -0.28380447621258653, -0.05647829703112702, -0.17526568232713294, 0.06923763647238819, -0.09581920458865958, -0.12421071799391974, 0.3755859339927539, 0.20595250886719302, 0.17197465601595674, 0.08106385554425348, 0.3592644152027374, 0.09361453349393091, 0.07724903065543534, 0.0038678787121222626, 0.35047287147015477, 0.10359322281236544, 0.06544232138617945, -0.18693381585886976, 0.051487111865534, -0.026362254000732332]
|
1,803.04976
|
Topological semimetals and insulators in three-dimensional honeycomb
materials
|
Semimetals, in which conduction and valence bands touch but do not form Fermi
surfaces, have attracted considerable interest for their anomalous properties
starting with the discovery of Dirac matter in graphene and other
two-dimensional honeycomb materials. Here we introduce a family of
three-dimensional honeycomb systems whose electronic band structures exhibit a
variety of topological semimetals with Dirac nodal lines. We show that these
nodal lines appear in varying numbers and mutual geometries, depending on the
underlying lattice structure. They are stabilized, in most cases, by a
combination of time-reversal and inversion symmetries and are accompanied by
topologically protected "drumhead" surface states. In the bulk, these nodal
line systems exhibit Landau level quantization and flat bands upon applying a
magnetic field. In the presence of spin-orbit coupling, these topological
semimetals are found to generically form (strong) topological insulators. This
comprehensive classification of the electronic band structures of
three-dimensional honeycomb systems might serve as guidance for future material
synthesis.
|
cond-mat.str-el
|
semimetals in which conduction and valence bands touch but do not form fermi surfaces have attracted considerable interest for their anomalous properties starting with the discovery of dirac matter in graphene and other twodimensional honeycomb materials here we introduce a family of threedimensional honeycomb systems whose electronic band structures exhibit a variety of topological semimetals with dirac nodal lines we show that these nodal lines appear in varying numbers and mutual geometries depending on the underlying lattice structure they are stabilized in most cases by a combination of timereversal and inversion symmetries and are accompanied by topologically protected drumhead surface states in the bulk these nodal line systems exhibit landau level quantization and flat bands upon applying a magnetic field in the presence of spinorbit coupling these topological semimetals are found to generically form strong topological insulators this comprehensive classification of the electronic band structures of threedimensional honeycomb systems might serve as guidance for future material synthesis
|
[['semimetals', 'in', 'which', 'conduction', 'and', 'valence', 'bands', 'touch', 'but', 'do', 'not', 'form', 'fermi', 'surfaces', 'have', 'attracted', 'considerable', 'interest', 'for', 'their', 'anomalous', 'properties', 'starting', 'with', 'the', 'discovery', 'of', 'dirac', 'matter', 'in', 'graphene', 'and', 'other', 'twodimensional', 'honeycomb', 'materials', 'here', 'we', 'introduce', 'a', 'family', 'of', 'threedimensional', 'honeycomb', 'systems', 'whose', 'electronic', 'band', 'structures', 'exhibit', 'a', 'variety', 'of', 'topological', 'semimetals', 'with', 'dirac', 'nodal', 'lines', 'we', 'show', 'that', 'these', 'nodal', 'lines', 'appear', 'in', 'varying', 'numbers', 'and', 'mutual', 'geometries', 'depending', 'on', 'the', 'underlying', 'lattice', 'structure', 'they', 'are', 'stabilized', 'in', 'most', 'cases', 'by', 'a', 'combination', 'of', 'timereversal', 'and', 'inversion', 'symmetries', 'and', 'are', 'accompanied', 'by', 'topologically', 'protected', 'drumhead', 'surface', 'states', 'in', 'the', 'bulk', 'these', 'nodal', 'line', 'systems', 'exhibit', 'landau', 'level', 'quantization', 'and', 'flat', 'bands', 'upon', 'applying', 'a', 'magnetic', 'field', 'in', 'the', 'presence', 'of', 'spinorbit', 'coupling', 'these', 'topological', 'semimetals', 'are', 'found', 'to', 'generically', 'form', 'strong', 'topological', 'insulators', 'this', 'comprehensive', 'classification', 'of', 'the', 'electronic', 'band', 'structures', 'of', 'threedimensional', 'honeycomb', 'systems', 'might', 'serve', 'as', 'guidance', 'for', 'future', 'material', 'synthesis']]
|
[-0.242321342154581, 0.18681328480909015, 0.004877269723316192, 0.026855327897100073, -0.10416451727698563, -0.2093174363409353, 0.08235454284452542, 0.42138778459752324, -0.24871127421383385, -0.2956107529139763, 0.024618021676696505, -0.31284273159541903, -0.206217114035052, 0.17635657854903206, 0.01728222508036834, 0.03013209841558176, -0.024257634666297514, -0.09586555842061047, -0.14171137614991325, -0.2128609519757354, 0.3447559646740081, -0.03859189131955622, 0.3280291390089188, 0.07020503043191163, -0.04291168871857701, -0.03126805253730268, 0.10759243634262472, 0.0597904528526119, -0.1237996878766712, 0.1174450379534577, 0.25429564137249044, -0.12680023371769933, 0.1505729684911692, -0.4687570439307553, -0.2677833156016578, -0.0011462114030602061, 0.13213151953758517, 0.15249960819796132, -0.10599848863914918, -0.33350968816477783, 0.04172449251807407, -0.1326601220306697, -0.13422595479845953, -0.14804852653923592, -0.027048513046347176, -0.0262079385619397, -0.123605398062667, 0.04889114500041221, 0.05533194801455755, 0.13696346225314862, -0.09857507132640357, -0.12398058716000122, -0.18140316877668355, 0.060280418578108216, 0.04314383984228987, -0.030785288285593067, 0.09527521817144124, -0.14527276292840718, -0.15911565381725123, 0.463100300456329, -0.029715323375810863, -0.1780562712529164, 0.22088194601415734, -0.16426564937095592, -0.13736939196812975, 0.1764826271312228, 0.1598749596945894, 0.06424614701384476, -0.05949178626975875, 0.11998711952533288, -0.04677846957781133, 0.09424676101619175, 0.02054800274767053, 0.14670457379969584, 0.35991172863846754, 0.10827201659417456, 0.06886134173492693, 0.09083143307102227, -0.11987206380321959, -0.04108942518081919, -0.24372711519052268, -0.1839893392708366, -0.24431177573931065, 0.0627799088501106, -0.005881171221036618, -0.27135342604534074, 0.4512668479305164, 0.07554458637846409, 0.1873741149798534, -0.08267175048889272, 0.1436283730836526, 0.10385039006767699, 0.0783621816329397, 0.06787198788788952, 0.24022774376675107, 0.12387073425587955, 0.06686433302060624, -0.2011765342081191, -0.005071886360221157, 0.04973793054996117]
|
1,803.04977
|
Itinerant fermions on a triangular lattice: unconventional magnetism and
other ordered states
|
We consider a system of 2D fermions on a triangular lattice with well
separated electron and hole pockets of similar sizes, centered at certain
high-symmetry-points in the Brillouin zone. We first analyze Stoner-type
spin-density-wave (SDW) magnetism. We show that SDW order is degenerate at the
mean-field level. Beyond mean-field, the degeneracy is lifted and is either
$120^{\circ}$ "triangular" order (same as for localized spins), or a collinear
order with antiferromagnetic spin arrangement on two-thirds of sites, and
non-magnetic on the rest of sites. We also study a time-reversal symmetric
directional spin bond order, which emerges when some interactions are repulsive
and some are attractive. We show that this order is also degenerate at a
mean-field level, but beyond mean-field the degeneracy is again lifted. We next
consider the evolution of a magnetic order in a magnetic field starting from an
SDW state in zero field. We show that a field gives rise to a canting of an SDW
spin configuration. In addition, it necessarily triggers the directional bond
order, which, we argue, is linearly coupled to the SDW order in a finite field.
We derive the corresponding term in the Free energy. Finally, we consider the
interplay between an SDW order and superconductivity and charge order. For
this, we analyze the flow of the couplings within parquet renormalization group
(pRG) scheme. We show that magnetism wins if all interactions are repulsive and
there is little energy space for pRG to develop. However, if system parameters
are such that pRG runs over a wide range of energies, the system may develop
either superconductivity or an unconventional charge order, which breaks
time-reversal symmetry.
|
cond-mat.str-el
|
we consider a system of 2d fermions on a triangular lattice with well separated electron and hole pockets of similar sizes centered at certain highsymmetrypoints in the brillouin zone we first analyze stonertype spindensitywave sdw magnetism we show that sdw order is degenerate at the meanfield level beyond meanfield the degeneracy is lifted and is either 120circ triangular order same as for localized spins or a collinear order with antiferromagnetic spin arrangement on twothirds of sites and nonmagnetic on the rest of sites we also study a timereversal symmetric directional spin bond order which emerges when some interactions are repulsive and some are attractive we show that this order is also degenerate at a meanfield level but beyond meanfield the degeneracy is again lifted we next consider the evolution of a magnetic order in a magnetic field starting from an sdw state in zero field we show that a field gives rise to a canting of an sdw spin configuration in addition it necessarily triggers the directional bond order which we argue is linearly coupled to the sdw order in a finite field we derive the corresponding term in the free energy finally we consider the interplay between an sdw order and superconductivity and charge order for this we analyze the flow of the couplings within parquet renormalization group prg scheme we show that magnetism wins if all interactions are repulsive and there is little energy space for prg to develop however if system parameters are such that prg runs over a wide range of energies the system may develop either superconductivity or an unconventional charge order which breaks timereversal symmetry
|
[['we', 'consider', 'a', 'system', 'of', '2d', 'fermions', 'on', 'a', 'triangular', 'lattice', 'with', 'well', 'separated', 'electron', 'and', 'hole', 'pockets', 'of', 'similar', 'sizes', 'centered', 'at', 'certain', 'highsymmetrypoints', 'in', 'the', 'brillouin', 'zone', 'we', 'first', 'analyze', 'stonertype', 'spindensitywave', 'sdw', 'magnetism', 'we', 'show', 'that', 'sdw', 'order', 'is', 'degenerate', 'at', 'the', 'meanfield', 'level', 'beyond', 'meanfield', 'the', 'degeneracy', 'is', 'lifted', 'and', 'is', 'either', '120circ', 'triangular', 'order', 'same', 'as', 'for', 'localized', 'spins', 'or', 'a', 'collinear', 'order', 'with', 'antiferromagnetic', 'spin', 'arrangement', 'on', 'twothirds', 'of', 'sites', 'and', 'nonmagnetic', 'on', 'the', 'rest', 'of', 'sites', 'we', 'also', 'study', 'a', 'timereversal', 'symmetric', 'directional', 'spin', 'bond', 'order', 'which', 'emerges', 'when', 'some', 'interactions', 'are', 'repulsive', 'and', 'some', 'are', 'attractive', 'we', 'show', 'that', 'this', 'order', 'is', 'also', 'degenerate', 'at', 'a', 'meanfield', 'level', 'but', 'beyond', 'meanfield', 'the', 'degeneracy', 'is', 'again', 'lifted', 'we', 'next', 'consider', 'the', 'evolution', 'of', 'a', 'magnetic', 'order', 'in', 'a', 'magnetic', 'field', 'starting', 'from', 'an', 'sdw', 'state', 'in', 'zero', 'field', 'we', 'show', 'that', 'a', 'field', 'gives', 'rise', 'to', 'a', 'canting', 'of', 'an', 'sdw', 'spin', 'configuration', 'in', 'addition', 'it', 'necessarily', 'triggers', 'the', 'directional', 'bond', 'order', 'which', 'we', 'argue', 'is', 'linearly', 'coupled', 'to', 'the', 'sdw', 'order', 'in', 'a', 'finite', 'field', 'we', 'derive', 'the', 'corresponding', 'term', 'in', 'the', 'free', 'energy', 'finally', 'we', 'consider', 'the', 'interplay', 'between', 'an', 'sdw', 'order', 'and', 'superconductivity', 'and', 'charge', 'order', 'for', 'this', 'we', 'analyze', 'the', 'flow', 'of', 'the', 'couplings', 'within', 'parquet', 'renormalization', 'group', 'prg', 'scheme', 'we', 'show', 'that', 'magnetism', 'wins', 'if', 'all', 'interactions', 'are', 'repulsive', 'and', 'there', 'is', 'little', 'energy', 'space', 'for', 'prg', 'to', 'develop', 'however', 'if', 'system', 'parameters', 'are', 'such', 'that', 'prg', 'runs', 'over', 'a', 'wide', 'range', 'of', 'energies', 'the', 'system', 'may', 'develop', 'either', 'superconductivity', 'or', 'an', 'unconventional', 'charge', 'order', 'which', 'breaks', 'timereversal', 'symmetry']]
|
[-0.217448633612582, 0.21101464348202745, -0.022886882721084273, 0.08467905859126607, -0.05023777381930914, -0.11446984335262743, 0.057779764716030545, 0.3826857889726482, -0.2711438418219418, -0.2402136709799783, 0.04480227610803451, -0.32946556204998934, -0.1112872332058571, 0.08982154324185103, 0.06621575392955155, -0.05388112794607878, -0.04623255400607983, 0.05152465261053294, -0.13722277368781052, -0.23265691903480157, 0.3502039320404206, -0.009743312613486693, 0.2513358421313266, 0.07075342726203855, 0.07641928265630095, 0.03216152630522157, 0.1339892853655059, 0.03341630282111173, -0.1502844557664368, 0.02991000663961232, 0.24815183978320823, -0.05624774477996484, 0.22485520028750652, -0.43368867763352614, -0.1788411297335255, 0.060581008068941254, 0.1466179940819361, 0.1919705835076187, -0.05502867097362738, -0.2614460493851867, 0.07244783759858735, -0.20403529304010726, -0.15565092875988706, -0.10911211886236237, -0.043696406985529596, -0.007500645155690749, -0.2924321394146386, 0.08540963729761575, 0.0957435081962979, 0.07079137279824527, -0.06962800618968214, -0.08107325290631572, -0.06876374715163062, 0.06084683958960576, 0.062425531068368366, 0.08347604206431208, 0.06960322802619043, -0.10820344833450185, -0.11880287910915083, 0.3844993220762936, -0.040564261079998686, -0.12345655893527523, 0.19218923129589746, -0.1925450317216692, -0.10227771638547657, 0.1593607113722505, 0.13709961932014536, 0.08380701481537134, -0.09457346817863355, 0.09729872000839182, -0.0310707608030902, 0.2086208584800328, 0.01344052943383792, 0.045746592708207946, 0.2415637729861946, 0.1730057404850851, 0.14350021936137367, 0.11286132766140831, -0.10968629800999123, -0.11854670480480073, -0.29522794921606504, -0.14507250100788144, -0.19303192662601187, 0.045020276190782034, -0.06750205928848893, -0.16661441191616985, 0.4039211548498753, 0.17398925954260416, 0.18300481754769055, -0.02455005376573859, 0.2157087171053583, 0.1315163825668774, 0.05450420757169249, 0.08307614154484191, 0.2258065493098305, 0.12770247943397542, 0.046609199850354346, -0.25386901388216454, 0.010288336461720367, 0.06610251890529913]
|
1,803.04978
|
An $S_4 \times SU(5)$ SUSY GUT of flavour in 6d
|
We propose a 6d model with a SUSY $SU(5)$ gauge symmetry. After
compactification, it explains the origin of the $S_4$ Family Symmetry with CSD3
vacuum alignment, as well as $SU(5)$ breaking with doublet-triplet splitting.
The model naturally accounts for all quark and lepton (including neutrino)
masses and mixings, incorporating the highly predictive Littlest Seesaw
structure. It spontaneously breaks CP symmetry, resulting in successful CP
violation in the quark and lepton sectors, while solving the Strong CP problem.
It also explains the Baryon Asymmetry of the Universe (BAU) through
leptogenesis, with the leptogenesis phase directly linked to the Dirac and
Majorana phases.
|
hep-ph
|
we propose a 6d model with a susy su5 gauge symmetry after compactification it explains the origin of the s_4 family symmetry with csd3 vacuum alignment as well as su5 breaking with doublettriplet splitting the model naturally accounts for all quark and lepton including neutrino masses and mixings incorporating the highly predictive littlest seesaw structure it spontaneously breaks cp symmetry resulting in successful cp violation in the quark and lepton sectors while solving the strong cp problem it also explains the baryon asymmetry of the universe bau through leptogenesis with the leptogenesis phase directly linked to the dirac and majorana phases
|
[['we', 'propose', 'a', '6d', 'model', 'with', 'a', 'susy', 'su5', 'gauge', 'symmetry', 'after', 'compactification', 'it', 'explains', 'the', 'origin', 'of', 'the', 's_4', 'family', 'symmetry', 'with', 'csd3', 'vacuum', 'alignment', 'as', 'well', 'as', 'su5', 'breaking', 'with', 'doublettriplet', 'splitting', 'the', 'model', 'naturally', 'accounts', 'for', 'all', 'quark', 'and', 'lepton', 'including', 'neutrino', 'masses', 'and', 'mixings', 'incorporating', 'the', 'highly', 'predictive', 'littlest', 'seesaw', 'structure', 'it', 'spontaneously', 'breaks', 'cp', 'symmetry', 'resulting', 'in', 'successful', 'cp', 'violation', 'in', 'the', 'quark', 'and', 'lepton', 'sectors', 'while', 'solving', 'the', 'strong', 'cp', 'problem', 'it', 'also', 'explains', 'the', 'baryon', 'asymmetry', 'of', 'the', 'universe', 'bau', 'through', 'leptogenesis', 'with', 'the', 'leptogenesis', 'phase', 'directly', 'linked', 'to', 'the', 'dirac', 'and', 'majorana', 'phases']]
|
[-0.12477339817081938, 0.2981890401201286, 0.006905133992728621, 0.19854833048279627, -0.1490686229467023, -0.20176117473494004, 0.07039830446851873, 0.2933090208029135, -0.22315717976319022, -0.3273412226146032, 0.03410987743008813, -0.21818572329818317, -0.05055308142978938, -0.006143117023834793, 0.05185045017906935, 0.04582729358410481, -0.05430394786843421, -0.09351203706355231, -0.10444544640710891, -0.21581435815597155, 0.2824988622716305, -0.021064268058571634, 0.2971687371114103, 0.06468857684412437, 0.10105736208802993, -0.07295894937700417, 0.043681001230742374, -0.1347954044496585, -0.008785804620676555, 0.01854445717855366, 0.16111284517798352, 0.09207362070734991, -0.0027834957829759558, -0.3816324598202021, -0.18117807956762833, 0.1823636645976786, 0.16136595406707857, 0.16316985352527313, -0.14613925590004662, -0.3713419246717845, 0.053277494342038684, -0.23159615583902243, -0.12225971143752669, -0.1266567389466938, -0.10334982899119063, -0.21439100730654756, -0.35845247276143477, 0.15020613793236443, -0.08451303931317375, -0.02732067815452298, 0.038201671370332785, -0.14799735459065674, -0.13459686316448347, -0.030243038541019552, 0.28553569113310096, -0.050387576582039344, 0.09250076985249461, -0.1853165021535046, -0.1629156496302031, 0.5326073562120097, -0.04351129004095524, -0.13128362196765028, 0.0604974995966595, -0.14332567429931323, -0.20086322863134418, 0.0786966015077611, 0.0902312938400572, 0.058910972512520775, -0.14578098174020887, 0.22026781298653544, -0.10217996065200556, 0.1218162516966499, 0.05552220983790363, 0.02673191234635392, 0.3355907482131947, 0.22769904145187153, 0.07763187221647931, -0.00587540450920858, -0.027560679449487736, -0.10440086219966928, -0.4643837528690548, -0.09655669927112942, -0.0794599227305262, 0.0461499073846948, -0.10151022586148546, -0.09544706798508984, 0.5153318137843346, 0.08486837515778065, 0.24217029811242724, 0.012079955281523785, 0.258611576938264, 0.04198079736728111, 0.1292607586572666, 0.015361744633848123, 0.24082027637574932, 0.18631225305789215, 0.14157169954251902, -0.367408132003067, -0.032751893016076325, 0.127352883337333]
|
1,803.04979
|
Phoebe: a surface dominated by water
|
The Saturnian irregular satellite, Phoebe, can be broadly described as a
water-rich rock. This object, which presumably originated from the same
primordial population shared by the dynamically excited Kuiper Belt Objects,
has received high resolution spectral imaging during the Cassini flyby. We
present a new analysis of the Visual Infrared Mapping Spectrometer observations
of Phoebe, which critically, includes a geometry correction routine that
enables pixel-by-pixel mapping of visible and infrared spectral cubes directly
onto the Phoebe shape model, even when an image exhibits significant trailing
errors. The result of our re-analysis is a successful match of 40 images,
producing spectral maps covering the majority of Phoebe's surface, roughly a
3rd of which is imaged by high resolution observations (<22 km per pixel
resolution). There is no spot on Phoebe's surface that is absent of water
absorption. The regions richest in water are clearly associated with the Jason
and South Pole impact basins. We find Phoebe exhibits only three spectral
types, and a water-ice concentration that correlates with physical depth and
visible albedo. The water-rich and water-poor regions exhibit significantly
different crater size frequency distributions, and different large crater
morphologies. We propose that Phoebe once had a water-poor surface whose
water-ice concentration was enhanced by basin forming impacts which exposed
richer subsurface layers. Finally, we demonstrate that the range of Phoebe's
water-ice absorption spans the same range exhibited by dynamically excited
Kuiper Belt Objects. The common water-ice absorption depths and primordial
origins, and the association of Phoebe's water-rich regions with its impact
basins, suggests the plausible idea that Kuiper Belt Objects also originated
with water-poor surfaces that were enhanced through stochastic collisional
modification.
|
astro-ph.EP
|
the saturnian irregular satellite phoebe can be broadly described as a waterrich rock this object which presumably originated from the same primordial population shared by the dynamically excited kuiper belt objects has received high resolution spectral imaging during the cassini flyby we present a new analysis of the visual infrared mapping spectrometer observations of phoebe which critically includes a geometry correction routine that enables pixelbypixel mapping of visible and infrared spectral cubes directly onto the phoebe shape model even when an image exhibits significant trailing errors the result of our reanalysis is a successful match of 40 images producing spectral maps covering the majority of phoebes surface roughly a 3rd of which is imaged by high resolution observations 22 km per pixel resolution there is no spot on phoebes surface that is absent of water absorption the regions richest in water are clearly associated with the jason and south pole impact basins we find phoebe exhibits only three spectral types and a waterice concentration that correlates with physical depth and visible albedo the waterrich and waterpoor regions exhibit significantly different crater size frequency distributions and different large crater morphologies we propose that phoebe once had a waterpoor surface whose waterice concentration was enhanced by basin forming impacts which exposed richer subsurface layers finally we demonstrate that the range of phoebes waterice absorption spans the same range exhibited by dynamically excited kuiper belt objects the common waterice absorption depths and primordial origins and the association of phoebes waterrich regions with its impact basins suggests the plausible idea that kuiper belt objects also originated with waterpoor surfaces that were enhanced through stochastic collisional modification
|
[['the', 'saturnian', 'irregular', 'satellite', 'phoebe', 'can', 'be', 'broadly', 'described', 'as', 'a', 'waterrich', 'rock', 'this', 'object', 'which', 'presumably', 'originated', 'from', 'the', 'same', 'primordial', 'population', 'shared', 'by', 'the', 'dynamically', 'excited', 'kuiper', 'belt', 'objects', 'has', 'received', 'high', 'resolution', 'spectral', 'imaging', 'during', 'the', 'cassini', 'flyby', 'we', 'present', 'a', 'new', 'analysis', 'of', 'the', 'visual', 'infrared', 'mapping', 'spectrometer', 'observations', 'of', 'phoebe', 'which', 'critically', 'includes', 'a', 'geometry', 'correction', 'routine', 'that', 'enables', 'pixelbypixel', 'mapping', 'of', 'visible', 'and', 'infrared', 'spectral', 'cubes', 'directly', 'onto', 'the', 'phoebe', 'shape', 'model', 'even', 'when', 'an', 'image', 'exhibits', 'significant', 'trailing', 'errors', 'the', 'result', 'of', 'our', 'reanalysis', 'is', 'a', 'successful', 'match', 'of', '40', 'images', 'producing', 'spectral', 'maps', 'covering', 'the', 'majority', 'of', 'phoebes', 'surface', 'roughly', 'a', '3rd', 'of', 'which', 'is', 'imaged', 'by', 'high', 'resolution', 'observations', '22', 'km', 'per', 'pixel', 'resolution', 'there', 'is', 'no', 'spot', 'on', 'phoebes', 'surface', 'that', 'is', 'absent', 'of', 'water', 'absorption', 'the', 'regions', 'richest', 'in', 'water', 'are', 'clearly', 'associated', 'with', 'the', 'jason', 'and', 'south', 'pole', 'impact', 'basins', 'we', 'find', 'phoebe', 'exhibits', 'only', 'three', 'spectral', 'types', 'and', 'a', 'waterice', 'concentration', 'that', 'correlates', 'with', 'physical', 'depth', 'and', 'visible', 'albedo', 'the', 'waterrich', 'and', 'waterpoor', 'regions', 'exhibit', 'significantly', 'different', 'crater', 'size', 'frequency', 'distributions', 'and', 'different', 'large', 'crater', 'morphologies', 'we', 'propose', 'that', 'phoebe', 'once', 'had', 'a', 'waterpoor', 'surface', 'whose', 'waterice', 'concentration', 'was', 'enhanced', 'by', 'basin', 'forming', 'impacts', 'which', 'exposed', 'richer', 'subsurface', 'layers', 'finally', 'we', 'demonstrate', 'that', 'the', 'range', 'of', 'phoebes', 'waterice', 'absorption', 'spans', 'the', 'same', 'range', 'exhibited', 'by', 'dynamically', 'excited', 'kuiper', 'belt', 'objects', 'the', 'common', 'waterice', 'absorption', 'depths', 'and', 'primordial', 'origins', 'and', 'the', 'association', 'of', 'phoebes', 'waterrich', 'regions', 'with', 'its', 'impact', 'basins', 'suggests', 'the', 'plausible', 'idea', 'that', 'kuiper', 'belt', 'objects', 'also', 'originated', 'with', 'waterpoor', 'surfaces', 'that', 'were', 'enhanced', 'through', 'stochastic', 'collisional', 'modification']]
|
[-0.06950292766594109, 0.14874734491567163, -0.1074381005095989, 0.059532936090630865, -0.05707950436558081, -0.0760731691522832, -0.007059939757335301, 0.3725740745430812, -0.21468746242702336, -0.35805341202820484, 0.09720374537274064, -0.2745021995917127, -0.13413446773227086, 0.1763227329861633, -0.12287718547347193, -0.025811691288147226, 0.11361833836246446, -0.0922055069822818, -0.0025827191429390736, -0.20904101554675864, 0.27248972080911593, 0.09435034295893274, 0.16842514116947047, 0.006011097490794354, 0.09922524658545359, -0.06562608024678947, -0.045521314367172584, -0.018059571847141555, -0.14723878110225996, 0.1299991702373304, 0.2249096525620724, 0.11538300916906925, 0.16245478873486932, -0.3829884202739991, -0.24566152026561802, 0.036986759993049095, 0.13477865222108343, 0.028549523740794565, -0.0543690438821881, -0.2846411918880596, 0.05084919416848981, -0.17132245998886098, -0.17655818579677382, 0.051795555141699666, 0.05875799595592338, -0.0016292745760224266, -0.1918459110568031, 0.07071382081320575, 0.03992743091144161, 0.13821732833029649, -0.13201045065216022, -0.15472006954277115, -0.13779267231396208, 0.11165862119731387, -0.009230928799832542, -0.01329065959126798, 0.2320101279885207, -0.09025418786212172, -0.0037503400864593193, 0.37891571808894, -0.09368808808743351, -0.030687531815869185, 0.2576956144758322, -0.23588043336231374, -0.10280241875614807, 0.263849855722476, 0.1391708831759067, 0.0968611936464988, -0.1350076962611745, 0.021809463503947937, -0.07343724038732677, 0.2363937855599729, 0.1491565770805156, 0.056944920558581705, 0.32783149689545527, 0.13543998901578186, 0.030746418457591275, 0.1330033526486231, -0.2644663156544779, -0.06256497296913842, -0.19067866600102312, -0.08762851613060132, -0.16212899339734577, -0.02267303715352147, -0.11431709847452379, -0.13923499270886702, 0.3556274960443689, 0.11068350943027969, 0.20792750501443472, 0.005646439779893091, 0.30191796642526136, 0.023430534524189115, 0.13614468428268617, 0.07701722290948965, 0.28169247058223634, 0.07369449853778111, 0.10155485073953648, -0.2089471718726974, 0.11187355570933398, 0.0104548086067499]
|
1,803.0498
|
Higher Rank Deconfined Quantum Criticality at the Lifshitz Transition
and the Exciton Bose Condensate
|
Deconfined quantum critical points are characterized by the presence of an
emergent gauge field and exotic fractionalized particles, which exist as
well-defined excitations only at the critical point. We here demonstrate the
existence of quantum critical points described by an emergent tensor gauge
theory featuring subdimensional excitations, in close relation to fracton
theories. We begin by reexamining a previously studied deconfined quantum
critical point between two valence bond solid (VBS) phases on a bilayer
honeycomb lattice. We show that the critical theory maps onto a rank-two tensor
gauge theory featuring one-dimensional particles. In a slightly different
context, the same tensor gauge theory also describes a deconfined quantum
critical point between a two-dimensional superfluid and a finite-momentum Bose
condensate, both of which are dual to rank-one gauge theories. This represents
an entirely new class of deconfined quantum criticality, in which a critical
tensor gauge theory arises on top of a stable conventional gauge theory.
Furthermore, we propose that this quantum critical point gives rise to a new
finite-temperature phase of bosons, behaving as an exciton Bose condensate, in
which excitons (boson-hole pairs) are condensed but individual bosons are not.
We discuss how small modifications of this theory give rise to the stable
quantum "exciton Bose liquid" phase studied by Paramekanti, Balents, and
Fisher.
|
cond-mat.str-el
|
deconfined quantum critical points are characterized by the presence of an emergent gauge field and exotic fractionalized particles which exist as welldefined excitations only at the critical point we here demonstrate the existence of quantum critical points described by an emergent tensor gauge theory featuring subdimensional excitations in close relation to fracton theories we begin by reexamining a previously studied deconfined quantum critical point between two valence bond solid vbs phases on a bilayer honeycomb lattice we show that the critical theory maps onto a ranktwo tensor gauge theory featuring onedimensional particles in a slightly different context the same tensor gauge theory also describes a deconfined quantum critical point between a twodimensional superfluid and a finitemomentum bose condensate both of which are dual to rankone gauge theories this represents an entirely new class of deconfined quantum criticality in which a critical tensor gauge theory arises on top of a stable conventional gauge theory furthermore we propose that this quantum critical point gives rise to a new finitetemperature phase of bosons behaving as an exciton bose condensate in which excitons bosonhole pairs are condensed but individual bosons are not we discuss how small modifications of this theory give rise to the stable quantum exciton bose liquid phase studied by paramekanti balents and fisher
|
[['deconfined', 'quantum', 'critical', 'points', 'are', 'characterized', 'by', 'the', 'presence', 'of', 'an', 'emergent', 'gauge', 'field', 'and', 'exotic', 'fractionalized', 'particles', 'which', 'exist', 'as', 'welldefined', 'excitations', 'only', 'at', 'the', 'critical', 'point', 'we', 'here', 'demonstrate', 'the', 'existence', 'of', 'quantum', 'critical', 'points', 'described', 'by', 'an', 'emergent', 'tensor', 'gauge', 'theory', 'featuring', 'subdimensional', 'excitations', 'in', 'close', 'relation', 'to', 'fracton', 'theories', 'we', 'begin', 'by', 'reexamining', 'a', 'previously', 'studied', 'deconfined', 'quantum', 'critical', 'point', 'between', 'two', 'valence', 'bond', 'solid', 'vbs', 'phases', 'on', 'a', 'bilayer', 'honeycomb', 'lattice', 'we', 'show', 'that', 'the', 'critical', 'theory', 'maps', 'onto', 'a', 'ranktwo', 'tensor', 'gauge', 'theory', 'featuring', 'onedimensional', 'particles', 'in', 'a', 'slightly', 'different', 'context', 'the', 'same', 'tensor', 'gauge', 'theory', 'also', 'describes', 'a', 'deconfined', 'quantum', 'critical', 'point', 'between', 'a', 'twodimensional', 'superfluid', 'and', 'a', 'finitemomentum', 'bose', 'condensate', 'both', 'of', 'which', 'are', 'dual', 'to', 'rankone', 'gauge', 'theories', 'this', 'represents', 'an', 'entirely', 'new', 'class', 'of', 'deconfined', 'quantum', 'criticality', 'in', 'which', 'a', 'critical', 'tensor', 'gauge', 'theory', 'arises', 'on', 'top', 'of', 'a', 'stable', 'conventional', 'gauge', 'theory', 'furthermore', 'we', 'propose', 'that', 'this', 'quantum', 'critical', 'point', 'gives', 'rise', 'to', 'a', 'new', 'finitetemperature', 'phase', 'of', 'bosons', 'behaving', 'as', 'an', 'exciton', 'bose', 'condensate', 'in', 'which', 'excitons', 'bosonhole', 'pairs', 'are', 'condensed', 'but', 'individual', 'bosons', 'are', 'not', 'we', 'discuss', 'how', 'small', 'modifications', 'of', 'this', 'theory', 'give', 'rise', 'to', 'the', 'stable', 'quantum', 'exciton', 'bose', 'liquid', 'phase', 'studied', 'by', 'paramekanti', 'balents', 'and', 'fisher']]
|
[-0.17339479542663983, 0.33625605175413975, -0.10636914366419246, 0.06871548522830945, -0.012629197972221963, -0.21031698327670448, 0.060972099841828345, 0.3063701979222297, -0.20506522512743117, -0.19906178463727095, -0.014451538813984578, -0.29660046087374903, -0.18806880468864576, 0.06903231628592263, 0.021085364702135605, 0.04001720346316201, -0.06881819333731069, 0.028699575994004852, -0.12485366627150238, -0.2427778381802433, 0.33507402424184135, -0.022682199404151202, 0.31352459668662946, 0.09744283845824724, 0.07588106206004724, 0.006231613055542464, 0.09234123158387804, 0.015940069255167486, -0.16661495758890632, 0.06061716204491484, 0.2508116733132182, -0.03909622591377293, 0.16192574729911638, -0.4221491080607283, -0.2198160241586399, 0.08146731872376389, 0.1652572519439427, 0.17625669086069504, -0.06588703925694864, -0.33640260351667295, 0.03384405622571614, -0.20199331884400398, -0.16299496890405432, -0.14533131071300162, -0.03289542824495584, -0.07859646997061973, -0.19343896219904105, 0.09187032647474483, 0.04323979368835017, 0.08881149010322281, -0.04452596012374907, -0.05689521305350216, -0.034293074842754276, 0.03919952229698193, 0.02177733592071098, 0.07585979008967701, 0.1392920371211218, -0.22835285076650821, -0.16944597924891772, 0.4176734797435844, -0.059691110577862444, -0.155981375893216, 0.2071368395686326, -0.10414071610177839, -0.12022874475196357, 0.12752731133724665, 0.11524617479798512, 0.08483586783887227, -0.10595832135245839, 0.129538427521145, -0.07826226188743848, 0.14845639542426575, 0.018914883479617218, 0.0863222590497567, 0.34869895322094957, 0.11424409118105804, 0.05489761797022692, 0.16522137316879573, -0.011564359018111257, -0.2279397951112398, -0.34913193983559926, -0.1871033828720446, -0.21243708866749894, 0.09706389449954185, -0.07947102234064617, -0.2367394551528856, 0.3733382707117434, 0.1232421421021073, 0.18017385286247883, -0.037062207674133145, 0.17748833143359746, 0.12237948684079211, 0.005280040412527725, 0.025322744090957524, 0.24377577607762688, 0.17788983630987493, 0.07716219886581267, -0.22785127448150888, -0.11665671945977692, 0.16084781638898343]
|
1,803.04981
|
Unveiling the dynamical state of massive clusters through the ICL
fraction
|
We have selected a sample of eleven massive clusters of galaxies observed by
the Hubble Space Telescope in order to study the impact of the dynamical state
on the IntraCluster Light (ICL) fraction, the ratio of total integrated ICL to
the total galaxy member light. With the exception of the Bullet cluster, the
sample is drawn from the Cluster Lensing and Supernova Survey and the Frontier
Fields program, containing five relaxed and six merging clusters. The ICL
fraction is calculated in three optical filters using the CHEFs IntraCluster
Light Estimator, a robust and accurate algorithm free of a priori assumptions.
We find that the ICL fraction in the three bands is, on average, higher for the
merging clusters, ranging between $\sim7-23\%$, compared with the $\sim 2-11\%$
found for the relaxed systems. We observe a nearly constant value (within the
error bars) in the ICL fraction of the regular clusters at the three
wavelengths considered, which would indicate that the colors of the ICL and the
cluster galaxies are, on average, coincident and, thus, their stellar
populations. However, we find a higher ICL fraction in the F606W filter for the
merging clusters, consistent with an excess of lower-metallicity/younger stars
in the ICL, which could have migrated violently from the outskirts of the
infalling galaxies during the merger event.
|
astro-ph.GA
|
we have selected a sample of eleven massive clusters of galaxies observed by the hubble space telescope in order to study the impact of the dynamical state on the intracluster light icl fraction the ratio of total integrated icl to the total galaxy member light with the exception of the bullet cluster the sample is drawn from the cluster lensing and supernova survey and the frontier fields program containing five relaxed and six merging clusters the icl fraction is calculated in three optical filters using the chefs intracluster light estimator a robust and accurate algorithm free of a priori assumptions we find that the icl fraction in the three bands is on average higher for the merging clusters ranging between sim723 compared with the sim 211 found for the relaxed systems we observe a nearly constant value within the error bars in the icl fraction of the regular clusters at the three wavelengths considered which would indicate that the colors of the icl and the cluster galaxies are on average coincident and thus their stellar populations however we find a higher icl fraction in the f606w filter for the merging clusters consistent with an excess of lowermetallicityyounger stars in the icl which could have migrated violently from the outskirts of the infalling galaxies during the merger event
|
[['we', 'have', 'selected', 'a', 'sample', 'of', 'eleven', 'massive', 'clusters', 'of', 'galaxies', 'observed', 'by', 'the', 'hubble', 'space', 'telescope', 'in', 'order', 'to', 'study', 'the', 'impact', 'of', 'the', 'dynamical', 'state', 'on', 'the', 'intracluster', 'light', 'icl', 'fraction', 'the', 'ratio', 'of', 'total', 'integrated', 'icl', 'to', 'the', 'total', 'galaxy', 'member', 'light', 'with', 'the', 'exception', 'of', 'the', 'bullet', 'cluster', 'the', 'sample', 'is', 'drawn', 'from', 'the', 'cluster', 'lensing', 'and', 'supernova', 'survey', 'and', 'the', 'frontier', 'fields', 'program', 'containing', 'five', 'relaxed', 'and', 'six', 'merging', 'clusters', 'the', 'icl', 'fraction', 'is', 'calculated', 'in', 'three', 'optical', 'filters', 'using', 'the', 'chefs', 'intracluster', 'light', 'estimator', 'a', 'robust', 'and', 'accurate', 'algorithm', 'free', 'of', 'a', 'priori', 'assumptions', 'we', 'find', 'that', 'the', 'icl', 'fraction', 'in', 'the', 'three', 'bands', 'is', 'on', 'average', 'higher', 'for', 'the', 'merging', 'clusters', 'ranging', 'between', 'sim723', 'compared', 'with', 'the', 'sim', '211', 'found', 'for', 'the', 'relaxed', 'systems', 'we', 'observe', 'a', 'nearly', 'constant', 'value', 'within', 'the', 'error', 'bars', 'in', 'the', 'icl', 'fraction', 'of', 'the', 'regular', 'clusters', 'at', 'the', 'three', 'wavelengths', 'considered', 'which', 'would', 'indicate', 'that', 'the', 'colors', 'of', 'the', 'icl', 'and', 'the', 'cluster', 'galaxies', 'are', 'on', 'average', 'coincident', 'and', 'thus', 'their', 'stellar', 'populations', 'however', 'we', 'find', 'a', 'higher', 'icl', 'fraction', 'in', 'the', 'f606w', 'filter', 'for', 'the', 'merging', 'clusters', 'consistent', 'with', 'an', 'excess', 'of', 'lowermetallicityyounger', 'stars', 'in', 'the', 'icl', 'which', 'could', 'have', 'migrated', 'violently', 'from', 'the', 'outskirts', 'of', 'the', 'infalling', 'galaxies', 'during', 'the', 'merger', 'event']]
|
[-0.07437195940766224, 0.10123776347426491, -0.12270402161534442, 0.08175384397131152, -0.05271067381511594, 0.004731674158274261, 0.08413044307272621, 0.4199763928583368, -0.15794320960615782, -0.36377856967927413, 0.04956472422061271, -0.3194810466580959, -0.017496794226124535, 0.19296143417311615, 0.01446977715701038, -0.010204050568647163, 0.0797094609063162, -0.024248845147532085, -0.04473367018062015, -0.3614825644931041, 0.31423186219708865, 0.040515006428887675, 0.2002606452550999, -0.08643527115846789, 0.1005769111822511, -0.03242336046329678, -0.08983979443044857, 0.01418552890752962, -0.12108784679487228, 0.06456985385509122, 0.1850521578754672, 0.12786313205264335, 0.2554855248782524, -0.3489862297939781, -0.171049902410528, 0.0924813971746453, 0.20265564170752673, 0.05805307080533334, -0.09191825787460994, -0.2679847681201821, 0.09081561375236095, -0.1685756938044675, -0.13336540884446613, 0.1152081348018201, 0.016896356375083237, 0.023634516838179943, -0.18658524948757055, 0.17311336794315815, -0.04355674311369766, 0.03281918989364491, -0.10018539558662924, -0.14794160096234707, -0.075945537615849, 0.0773262552700417, -0.011588707855404463, 0.05467010656436689, 0.1923483515851373, -0.15876845150893598, -0.015779471330258043, 0.41125556979934835, -0.03995519061681143, -0.008749801518265592, 0.2108316109342457, -0.2039318083482253, -0.17099995571946683, 0.14125533761120898, 0.1981859425970808, 0.06780691053285155, -0.1616991369660164, -0.004551894215022235, -0.0337703576766301, 0.23436816130591512, 0.04143062705758872, 0.06981304433724037, 0.2908294549645033, 0.09874783337636049, 0.07076214366310904, 0.1324994894405177, -0.19715156426198435, -0.03144483435519992, -0.23379848023313424, -0.11123626889697504, -0.12735402544169838, 0.0159186492944786, -0.15952385790432197, -0.13585002024787976, 0.3351172497994158, 0.08869805919916131, 0.19553288962627047, 0.08508038740973313, 0.2805424483319701, 0.06920691045856667, 0.15306201986968518, 0.12264207182018909, 0.32971470327831287, 0.1716201299519906, 0.015411780445381652, -0.2587800513985459, 0.05242304858794913, -0.034043418799072155]
|
1,803.04982
|
Identifying Universality in Warm Inflation
|
Ideas borrowed from renormalization group are applied to warm inflation to
characterize the inflationary epoch in terms of flows away from the de Sitter
regime. In this framework different models of inflation fall into universality
classes. Furthermore, for warm inflation this approach also helps to
characterise when inflation can smoothly end into the radiation dominated
regime. Warm inflation has a second functional dependence compared to cold
inflation due to dissipation, yet despite this feature, it is shown that the
universality classes defined for cold inflation can be consistently extended to
warm inflation.
|
astro-ph.CO gr-qc hep-ph hep-th
|
ideas borrowed from renormalization group are applied to warm inflation to characterize the inflationary epoch in terms of flows away from the de sitter regime in this framework different models of inflation fall into universality classes furthermore for warm inflation this approach also helps to characterise when inflation can smoothly end into the radiation dominated regime warm inflation has a second functional dependence compared to cold inflation due to dissipation yet despite this feature it is shown that the universality classes defined for cold inflation can be consistently extended to warm inflation
|
[['ideas', 'borrowed', 'from', 'renormalization', 'group', 'are', 'applied', 'to', 'warm', 'inflation', 'to', 'characterize', 'the', 'inflationary', 'epoch', 'in', 'terms', 'of', 'flows', 'away', 'from', 'the', 'de', 'sitter', 'regime', 'in', 'this', 'framework', 'different', 'models', 'of', 'inflation', 'fall', 'into', 'universality', 'classes', 'furthermore', 'for', 'warm', 'inflation', 'this', 'approach', 'also', 'helps', 'to', 'characterise', 'when', 'inflation', 'can', 'smoothly', 'end', 'into', 'the', 'radiation', 'dominated', 'regime', 'warm', 'inflation', 'has', 'a', 'second', 'functional', 'dependence', 'compared', 'to', 'cold', 'inflation', 'due', 'to', 'dissipation', 'yet', 'despite', 'this', 'feature', 'it', 'is', 'shown', 'that', 'the', 'universality', 'classes', 'defined', 'for', 'cold', 'inflation', 'can', 'be', 'consistently', 'extended', 'to', 'warm', 'inflation']]
|
[-0.06820481706223369, 0.2281663048222823, -0.18957353216018932, 0.12738090969429797, -0.08340911374872793, -0.15703484202917342, -0.055338545692274754, 0.3045496947091559, -0.28546585438206146, -0.28852040274068713, 0.07113380686369845, -0.20005088135519106, -0.09561336110852173, 0.15967595350736266, -0.08696303527761737, -0.0029393235555566525, -0.019188371049139, -0.05319454626726877, 0.0028359059107732837, -0.272615373909028, 0.3036081948540295, 0.09230432994461255, 0.22068656076494927, -0.008911704766037672, 0.035622562281787395, -0.16305911915032598, 0.031226335219917415, -0.01762901954150394, -0.1661394772316113, 0.05312654251010036, 0.25772174890331057, 0.11842586073781484, 0.2667698763290663, -0.4015181848333906, -0.3285384643316755, 0.20430798662583466, 0.1699151679235713, 0.140350489259657, -0.0032315170797316923, -0.28546559475564764, 0.04689200964513356, -0.18980275098558352, -0.08584911275892923, -0.09046519614513153, -0.016906409129581374, -0.11696284955731877, -0.27012752937962825, 0.06674297176948091, -0.013550717596207624, -0.03717916560075853, -0.0468622946291757, -0.00899292587849271, -0.03410879010334611, -0.003111131449733638, 0.1427162916819646, 0.024527059635147452, 0.19549892004579306, -0.14389935906207107, -0.021835484278752752, 0.4261221658316967, -0.18595085069840855, -0.04131909701264585, 0.2125998342450222, -0.13296592820172562, -0.1958678928254496, 0.13336085841950515, 0.12158528699175171, 0.05486773545651332, -0.11826446051940287, 0.14920333256621077, 0.06547315098831187, 0.1256846492583661, 0.10738471553296498, -0.004762653023530932, 0.3465327965804254, 0.10530444505654843, 0.02573762045484846, 0.17230381649468376, 0.015161641235665782, -0.17956280714386832, -0.36459231112435786, -0.05041999417754477, -0.14561366770699943, 0.01829666703428223, -0.10335984859494088, -0.15789568674335897, 0.41563715615674207, 0.19060152411744322, 0.2135720162794156, 0.06724309336151117, 0.27290139864097634, 0.0753492851458166, 0.05550278538999998, 0.10259436104325173, 0.30038494814399874, 0.13378644327673575, 0.12969418059346144, -0.19390623346660743, -0.014640542632981163, 0.06138231331968437]
|
1,803.04983
|
Ultra Long Gamma-Ray Bursts from the collapse of Blue Super Giant stars:
an end-to-end simulation
|
Ultra-long gamma ray bursts (ULGRBs) are a distinct class of GRBs
characterized by durations of several thousands of seconds, about two orders of
magnitude longer than those of standard long GRBs (LGRBs). The driving engine
of these events has not been uncovered yet, and ideas range from magnetars, to
tidal disruption events, to extended massive stars, such as blue super giants
(BSG). BSGs, a possible endpoint of stellar evolution, are attractive for the
relatively long free-fall times of their envelopes, allowing accretion to power
a long-lasting central engine. At the same time, their large radial extension
poses a challenge to the emergence of a jet. Here we perform an end-to-end
simulation aimed at assessing the viability of BSGs as ULGRB progenitors. The
evolution to core collapse of a BSG star model is calculated with the MESA
code. We then compute the accretion rate for the fraction of envelope material
with enough angular momentum to circularize and form an accretion disk, and
input the corresponding power into a jet which we evolve through the star
envelope with the FLASH code. Our simulation shows that the jet can emerge, and
the resulting light curves resemble those observed in ULGRBs, with durations
$T_{90}$ ranging from $\approx$4000~s to $\approx10^4$ s depending on the
viewing angle.
|
astro-ph.HE
|
ultralong gamma ray bursts ulgrbs are a distinct class of grbs characterized by durations of several thousands of seconds about two orders of magnitude longer than those of standard long grbs lgrbs the driving engine of these events has not been uncovered yet and ideas range from magnetars to tidal disruption events to extended massive stars such as blue super giants bsg bsgs a possible endpoint of stellar evolution are attractive for the relatively long freefall times of their envelopes allowing accretion to power a longlasting central engine at the same time their large radial extension poses a challenge to the emergence of a jet here we perform an endtoend simulation aimed at assessing the viability of bsgs as ulgrb progenitors the evolution to core collapse of a bsg star model is calculated with the mesa code we then compute the accretion rate for the fraction of envelope material with enough angular momentum to circularize and form an accretion disk and input the corresponding power into a jet which we evolve through the star envelope with the flash code our simulation shows that the jet can emerge and the resulting light curves resemble those observed in ulgrbs with durations t_90 ranging from approx4000s to approx104 s depending on the viewing angle
|
[['ultralong', 'gamma', 'ray', 'bursts', 'ulgrbs', 'are', 'a', 'distinct', 'class', 'of', 'grbs', 'characterized', 'by', 'durations', 'of', 'several', 'thousands', 'of', 'seconds', 'about', 'two', 'orders', 'of', 'magnitude', 'longer', 'than', 'those', 'of', 'standard', 'long', 'grbs', 'lgrbs', 'the', 'driving', 'engine', 'of', 'these', 'events', 'has', 'not', 'been', 'uncovered', 'yet', 'and', 'ideas', 'range', 'from', 'magnetars', 'to', 'tidal', 'disruption', 'events', 'to', 'extended', 'massive', 'stars', 'such', 'as', 'blue', 'super', 'giants', 'bsg', 'bsgs', 'a', 'possible', 'endpoint', 'of', 'stellar', 'evolution', 'are', 'attractive', 'for', 'the', 'relatively', 'long', 'freefall', 'times', 'of', 'their', 'envelopes', 'allowing', 'accretion', 'to', 'power', 'a', 'longlasting', 'central', 'engine', 'at', 'the', 'same', 'time', 'their', 'large', 'radial', 'extension', 'poses', 'a', 'challenge', 'to', 'the', 'emergence', 'of', 'a', 'jet', 'here', 'we', 'perform', 'an', 'endtoend', 'simulation', 'aimed', 'at', 'assessing', 'the', 'viability', 'of', 'bsgs', 'as', 'ulgrb', 'progenitors', 'the', 'evolution', 'to', 'core', 'collapse', 'of', 'a', 'bsg', 'star', 'model', 'is', 'calculated', 'with', 'the', 'mesa', 'code', 'we', 'then', 'compute', 'the', 'accretion', 'rate', 'for', 'the', 'fraction', 'of', 'envelope', 'material', 'with', 'enough', 'angular', 'momentum', 'to', 'circularize', 'and', 'form', 'an', 'accretion', 'disk', 'and', 'input', 'the', 'corresponding', 'power', 'into', 'a', 'jet', 'which', 'we', 'evolve', 'through', 'the', 'star', 'envelope', 'with', 'the', 'flash', 'code', 'our', 'simulation', 'shows', 'that', 'the', 'jet', 'can', 'emerge', 'and', 'the', 'resulting', 'light', 'curves', 'resemble', 'those', 'observed', 'in', 'ulgrbs', 'with', 'durations', 't_90', 'ranging', 'from', 'approx4000s', 'to', 'approx104', 's', 'depending', 'on', 'the', 'viewing', 'angle']]
|
[-0.09448427467307607, 0.1518150425811265, -0.07387462388391473, 0.14258324355164187, -0.12000171752602216, -0.07663797954363483, 0.043016790057022476, 0.42994949800139737, -0.22129469636073779, -0.3499692509749106, 0.06947956794617875, -0.26404950846252695, -0.0002519721364868539, 0.2580910974348496, -0.009699148468540184, 0.0018860966920675266, 0.0953708219580308, -0.034703841253316825, -0.08382377351018866, -0.21998689270001792, 0.2748922511034401, 0.08163427704767812, 0.1445341031798827, -0.045716993954210056, 0.07019024484436072, -0.0995260301023899, -0.037045951440398184, -0.033200188038782, -0.1281881920008302, 0.027621104603721983, 0.21255830591987995, 0.1379242590284862, 0.23921443108868387, -0.4274942817687545, -0.24724386879908186, 0.09243346066214145, 0.17223039261686304, 0.043229193157804685, -0.05095190737463002, -0.23126158510068698, 0.0924632343713061, -0.26083136163319326, -0.1412698267759489, 0.057665646220335647, 0.07992723851154247, 0.07589353616792886, -0.215419419970186, 0.08736392319413079, 0.053268340229988095, 0.032419073683143194, -0.05398822538610104, -0.031492020764077706, -0.051728229876607655, 0.09114768758992708, 0.09963076102292343, 0.061577795853927024, 0.16074775044495862, -0.13640347867317143, -0.06909366691363089, 0.4191199927723834, -0.05058948314461824, -0.01293373496848203, 0.23934342785782758, -0.18858031753361934, -0.11019706887059978, 0.17374689001146526, 0.1699047041588485, 0.13163751930530582, -0.12848489825569448, -0.057256992421822535, 0.02412779875365751, 0.16914574761121046, 0.06398802036419511, 0.06925088259657579, 0.3307688185169051, 0.17107059573643796, -0.03290407654962369, 0.09498120384967132, -0.18053563970495903, -0.07304200898174064, -0.2655548686671647, -0.0953324709747297, -0.11894052919066911, 0.1279469979317842, -0.12216738264625226, -0.14101495785039983, 0.39355384842173885, 0.07717766279820353, 0.2145369458278375, 0.08071117670818542, 0.2632737605499902, 0.08025079029057884, 0.10919208644578854, 0.15008499762653152, 0.26498307374616464, 0.12355123163267438, 0.10185164092940145, -0.23744683822438847, 0.10154015494820973, 0.02097170777297357]
|
1,803.04984
|
Anomalous quantum interference effects in graphene SNS junctions due to
strain-induced gauge fields
|
We investigate the influence of gauge fields induced by strain on the
supercurrent passing through the graphene-based Josephson junctions. We show in
the presence of a constant pseudomagnetic field ${\bf B}_S$ originated from an
arc-shape elastic deformation, the Josephson current is monotonically enhanced.
This is in contrast with the oscillatory behavior of supercurrent (known as
Fraunhofer pattern) caused by real magnetic fields passing through the
junction. The absence of oscillatory supercurrent originates from the fact that
strain-induced gauge fields have opposite directions at the two valleys due to
the time-reversal symmetry. Subsequently there is no net Aharonov-Bohm effect
due to ${\bf B}_S$ in the current carried by the bound states composed of
electrons and holes from different valleys. On the other hand, when both
magnetic and pseudomagnetic fields are present, Fraunhofer-like oscillations as
function of the real magnetic field flux are found. We find that the Fraunhofer
pattern and in particular its period slightly change by varying the
strain-induced gauge field as well as the geometric aspect ratio of the
junction. Intriguingly, the combination of two kinds of gauge fields results in
two special fingerprint in the local current density profile: (i) strong
localization of the Josephson current density with more intense maximum
amplitudes; (ii) appearance of the inflated vortex cores - finite regions with
almost diminishing Josephson currents - which their sizes increases by
increasing ${\bf B}_S$. These findings reveal unexpected interference
signatures of strain-induced gauge fields in graphene SNS junctions and provide
unique tools for sensitive probing of the pseudomagnetic fields.
|
cond-mat.mes-hall cond-mat.supr-con
|
we investigate the influence of gauge fields induced by strain on the supercurrent passing through the graphenebased josephson junctions we show in the presence of a constant pseudomagnetic field bf b_s originated from an arcshape elastic deformation the josephson current is monotonically enhanced this is in contrast with the oscillatory behavior of supercurrent known as fraunhofer pattern caused by real magnetic fields passing through the junction the absence of oscillatory supercurrent originates from the fact that straininduced gauge fields have opposite directions at the two valleys due to the timereversal symmetry subsequently there is no net aharonovbohm effect due to bf b_s in the current carried by the bound states composed of electrons and holes from different valleys on the other hand when both magnetic and pseudomagnetic fields are present fraunhoferlike oscillations as function of the real magnetic field flux are found we find that the fraunhofer pattern and in particular its period slightly change by varying the straininduced gauge field as well as the geometric aspect ratio of the junction intriguingly the combination of two kinds of gauge fields results in two special fingerprint in the local current density profile i strong localization of the josephson current density with more intense maximum amplitudes ii appearance of the inflated vortex cores finite regions with almost diminishing josephson currents which their sizes increases by increasing bf b_s these findings reveal unexpected interference signatures of straininduced gauge fields in graphene sns junctions and provide unique tools for sensitive probing of the pseudomagnetic fields
|
[['we', 'investigate', 'the', 'influence', 'of', 'gauge', 'fields', 'induced', 'by', 'strain', 'on', 'the', 'supercurrent', 'passing', 'through', 'the', 'graphenebased', 'josephson', 'junctions', 'we', 'show', 'in', 'the', 'presence', 'of', 'a', 'constant', 'pseudomagnetic', 'field', 'bf', 'b_s', 'originated', 'from', 'an', 'arcshape', 'elastic', 'deformation', 'the', 'josephson', 'current', 'is', 'monotonically', 'enhanced', 'this', 'is', 'in', 'contrast', 'with', 'the', 'oscillatory', 'behavior', 'of', 'supercurrent', 'known', 'as', 'fraunhofer', 'pattern', 'caused', 'by', 'real', 'magnetic', 'fields', 'passing', 'through', 'the', 'junction', 'the', 'absence', 'of', 'oscillatory', 'supercurrent', 'originates', 'from', 'the', 'fact', 'that', 'straininduced', 'gauge', 'fields', 'have', 'opposite', 'directions', 'at', 'the', 'two', 'valleys', 'due', 'to', 'the', 'timereversal', 'symmetry', 'subsequently', 'there', 'is', 'no', 'net', 'aharonovbohm', 'effect', 'due', 'to', 'bf', 'b_s', 'in', 'the', 'current', 'carried', 'by', 'the', 'bound', 'states', 'composed', 'of', 'electrons', 'and', 'holes', 'from', 'different', 'valleys', 'on', 'the', 'other', 'hand', 'when', 'both', 'magnetic', 'and', 'pseudomagnetic', 'fields', 'are', 'present', 'fraunhoferlike', 'oscillations', 'as', 'function', 'of', 'the', 'real', 'magnetic', 'field', 'flux', 'are', 'found', 'we', 'find', 'that', 'the', 'fraunhofer', 'pattern', 'and', 'in', 'particular', 'its', 'period', 'slightly', 'change', 'by', 'varying', 'the', 'straininduced', 'gauge', 'field', 'as', 'well', 'as', 'the', 'geometric', 'aspect', 'ratio', 'of', 'the', 'junction', 'intriguingly', 'the', 'combination', 'of', 'two', 'kinds', 'of', 'gauge', 'fields', 'results', 'in', 'two', 'special', 'fingerprint', 'in', 'the', 'local', 'current', 'density', 'profile', 'i', 'strong', 'localization', 'of', 'the', 'josephson', 'current', 'density', 'with', 'more', 'intense', 'maximum', 'amplitudes', 'ii', 'appearance', 'of', 'the', 'inflated', 'vortex', 'cores', 'finite', 'regions', 'with', 'almost', 'diminishing', 'josephson', 'currents', 'which', 'their', 'sizes', 'increases', 'by', 'increasing', 'bf', 'b_s', 'these', 'findings', 'reveal', 'unexpected', 'interference', 'signatures', 'of', 'straininduced', 'gauge', 'fields', 'in', 'graphene', 'sns', 'junctions', 'and', 'provide', 'unique', 'tools', 'for', 'sensitive', 'probing', 'of', 'the', 'pseudomagnetic', 'fields']]
|
[-0.24062595877817747, 0.22560762700702916, -0.010323667226619516, 0.034459143824155526, -0.04751990400106308, -0.10573134829190028, 0.034297053873320056, 0.3697062826370338, -0.25178816070802423, -0.3086558495726125, -0.004141871360792923, -0.24901295770275075, -0.16597789853432798, 0.16700431604710114, 0.016742598817338684, -0.03450361186888002, -0.015974871906548352, -0.00786644401595987, -0.056936739425850195, -0.18865156284425258, 0.31460937092162344, -0.008580837640874237, 0.3532682571057379, 0.06441717558917015, 0.014027621624879985, -0.010399925511374891, 0.022520018189907096, 0.048824148407981424, -0.10143138427995572, 0.015253532921618957, 0.18469196278694647, -0.036935747197058805, 0.16017276027881766, -0.5008211749257052, -0.17449274351560617, 0.07072793261149891, 0.16041553960101998, 0.1341848113398769, -0.06485763736992409, -0.3336983126109518, 0.06107977530371724, -0.09817194173194141, -0.10509637778344753, -0.0493519353583841, 0.028567030695192813, 0.024541815161469402, -0.2505901336143038, 0.09965030476821965, 0.03954737131906844, 0.11318272764449457, -0.030397474068677075, -0.11384321043251149, -0.07136044777564304, 0.04184107318814135, 0.14542562232271164, 0.07754516991901683, 0.1810099766956108, -0.19418677646922786, -0.13210076362310177, 0.3188070631511806, -0.09789082404240906, -0.13048735594254476, 0.16294481565218522, -0.17414374798128152, -0.055471919253083556, 0.14907007881735204, 0.11739516697000282, 0.08704662737455145, -0.10788607653315073, 0.10135900679014742, -0.019962510882284998, 0.09861965210685336, 0.10440209733537469, 0.07089536071827346, 0.3019478113969799, 0.10147455485214839, 0.08011179330732777, 0.1300529494551864, -0.15460398170421738, -0.06664364790799934, -0.30523426211680255, -0.11739865507104015, -0.17546089990686, 0.08652138587948217, -0.07475738708218337, -0.19140060536518871, 0.4257720676658905, 0.16027988488618952, 0.187000662148573, -0.048735506013054326, 0.26483366820310805, 0.14051301223392862, 0.10070544694981907, 0.02842481725244408, 0.2783313658333335, 0.21039663023311658, 0.12217369386777875, -0.2944187685166415, 0.019099804175743067, -0.03436557225608434]
|
1,803.04985
|
The Transiting Exoplanet Community Early Release Science Program for
JWST
|
The James Webb Space Telescope (JWST) presents the opportunity to transform
our understanding of planets and the origins of life by revealing the
atmospheric compositions, structures, and dynamics of transiting exoplanets in
unprecedented detail. However, the high-precision, time-series observations
required for such investigations have unique technical challenges, and prior
experience with other facilities indicates that there will be a steep learning
curve when JWST becomes operational. In this paper we describe the science
objectives and detailed plans of the Transiting Exoplanet Community Early
Release Science (ERS) Program, which is a recently approved program for JWST
observations early in Cycle 1. The goal of this project, for which the obtained
data will have no exclusive access period, is to accelerate the acquisition and
diffusion of technical expertise for transiting exoplanet observations with
JWST, while also providing a compelling set of representative datasets that
will enable immediate scientific breakthroughs. The Transiting Exoplanet
Community ERS Program will exercise the time-series modes of all four JWST
instruments that have been identified as the consensus highest priorities,
observe the full suite of transiting planet characterization geometries
(transits, eclipses, and phase curves), and target planets with host stars that
span an illustrative range of brightnesses. The observations in this program
were defined through an inclusive and transparent process that had
participation from JWST instrument experts and international leaders in
transiting exoplanet studies. Community engagement in the project will be
centered on a two-phase Data Challenge that culminates with the delivery of
planetary spectra, time-series instrument performance reports, and open-source
data analysis toolkits in time to inform the agenda for Cycle 2 of the JWST
mission.
|
astro-ph.EP
|
the james webb space telescope jwst presents the opportunity to transform our understanding of planets and the origins of life by revealing the atmospheric compositions structures and dynamics of transiting exoplanets in unprecedented detail however the highprecision timeseries observations required for such investigations have unique technical challenges and prior experience with other facilities indicates that there will be a steep learning curve when jwst becomes operational in this paper we describe the science objectives and detailed plans of the transiting exoplanet community early release science ers program which is a recently approved program for jwst observations early in cycle 1 the goal of this project for which the obtained data will have no exclusive access period is to accelerate the acquisition and diffusion of technical expertise for transiting exoplanet observations with jwst while also providing a compelling set of representative datasets that will enable immediate scientific breakthroughs the transiting exoplanet community ers program will exercise the timeseries modes of all four jwst instruments that have been identified as the consensus highest priorities observe the full suite of transiting planet characterization geometries transits eclipses and phase curves and target planets with host stars that span an illustrative range of brightnesses the observations in this program were defined through an inclusive and transparent process that had participation from jwst instrument experts and international leaders in transiting exoplanet studies community engagement in the project will be centered on a twophase data challenge that culminates with the delivery of planetary spectra timeseries instrument performance reports and opensource data analysis toolkits in time to inform the agenda for cycle 2 of the jwst mission
|
[['the', 'james', 'webb', 'space', 'telescope', 'jwst', 'presents', 'the', 'opportunity', 'to', 'transform', 'our', 'understanding', 'of', 'planets', 'and', 'the', 'origins', 'of', 'life', 'by', 'revealing', 'the', 'atmospheric', 'compositions', 'structures', 'and', 'dynamics', 'of', 'transiting', 'exoplanets', 'in', 'unprecedented', 'detail', 'however', 'the', 'highprecision', 'timeseries', 'observations', 'required', 'for', 'such', 'investigations', 'have', 'unique', 'technical', 'challenges', 'and', 'prior', 'experience', 'with', 'other', 'facilities', 'indicates', 'that', 'there', 'will', 'be', 'a', 'steep', 'learning', 'curve', 'when', 'jwst', 'becomes', 'operational', 'in', 'this', 'paper', 'we', 'describe', 'the', 'science', 'objectives', 'and', 'detailed', 'plans', 'of', 'the', 'transiting', 'exoplanet', 'community', 'early', 'release', 'science', 'ers', 'program', 'which', 'is', 'a', 'recently', 'approved', 'program', 'for', 'jwst', 'observations', 'early', 'in', 'cycle', '1', 'the', 'goal', 'of', 'this', 'project', 'for', 'which', 'the', 'obtained', 'data', 'will', 'have', 'no', 'exclusive', 'access', 'period', 'is', 'to', 'accelerate', 'the', 'acquisition', 'and', 'diffusion', 'of', 'technical', 'expertise', 'for', 'transiting', 'exoplanet', 'observations', 'with', 'jwst', 'while', 'also', 'providing', 'a', 'compelling', 'set', 'of', 'representative', 'datasets', 'that', 'will', 'enable', 'immediate', 'scientific', 'breakthroughs', 'the', 'transiting', 'exoplanet', 'community', 'ers', 'program', 'will', 'exercise', 'the', 'timeseries', 'modes', 'of', 'all', 'four', 'jwst', 'instruments', 'that', 'have', 'been', 'identified', 'as', 'the', 'consensus', 'highest', 'priorities', 'observe', 'the', 'full', 'suite', 'of', 'transiting', 'planet', 'characterization', 'geometries', 'transits', 'eclipses', 'and', 'phase', 'curves', 'and', 'target', 'planets', 'with', 'host', 'stars', 'that', 'span', 'an', 'illustrative', 'range', 'of', 'brightnesses', 'the', 'observations', 'in', 'this', 'program', 'were', 'defined', 'through', 'an', 'inclusive', 'and', 'transparent', 'process', 'that', 'had', 'participation', 'from', 'jwst', 'instrument', 'experts', 'and', 'international', 'leaders', 'in', 'transiting', 'exoplanet', 'studies', 'community', 'engagement', 'in', 'the', 'project', 'will', 'be', 'centered', 'on', 'a', 'twophase', 'data', 'challenge', 'that', 'culminates', 'with', 'the', 'delivery', 'of', 'planetary', 'spectra', 'timeseries', 'instrument', 'performance', 'reports', 'and', 'opensource', 'data', 'analysis', 'toolkits', 'in', 'time', 'to', 'inform', 'the', 'agenda', 'for', 'cycle', '2', 'of', 'the', 'jwst', 'mission']]
|
[-0.09479544540957226, 0.11169657267408954, -0.10463618276230506, 0.04617259193619383, -0.171492106262179, -0.09497641797478702, 0.07410954572320967, 0.3974124692539688, -0.16503645158043914, -0.38025647748026264, 0.1526567249013142, -0.3101245191364357, -0.13688753113768592, 0.2358378413129861, -0.08770864865946891, 0.0732873014787205, 0.1990548851216025, -0.09596225026939549, 0.025254878121147756, -0.34479299132092456, 0.24302530344869927, 0.14128240943387788, 0.13038978869005427, -0.019515379657016784, 0.0322149210773083, -0.02868064059823973, -0.11650487821911407, -0.05149662738579817, -0.17417165027063844, 0.07161678774917697, 0.38622239791982044, 0.2707493746883433, 0.28147646974855306, -0.38274784724065364, -0.20982007304168407, 0.06989357224752137, 0.1122731278142444, -0.013426697668807708, -0.03581864283408028, -0.30753706458464375, 0.008060266151262593, -0.16562785490218646, -0.16010407928367004, -0.048117577171015474, 0.06134023788111582, 0.013225726330813824, -0.24524437562760734, -0.05554543230321248, -0.00788068467557264, 0.18509592752917547, -0.13764024731014132, -0.14323560067549432, -0.022158256586949206, 0.16329011283438397, -0.006532486138772739, 0.035871816556584814, 0.10259651446534965, -0.1325442050873617, -0.10299722507914535, 0.39608402239664225, -0.0726769277479735, 0.007563038587939777, 0.19226917405837807, -0.21701289241943944, -0.18013685274796498, 0.12835698874864632, 0.21257576688805588, 0.10267769832503341, -0.17947027885700623, 0.04262640427747831, 0.011138622283755515, 0.1770891728767689, 0.03186352188905812, 0.0680784042799139, 0.34364932938651993, 0.21283705879892587, 0.09925595761127909, 0.06393316212706579, -0.1733185632602696, -0.033662025051599986, -0.22045769441360435, -0.19426033278186303, -0.14967293898379397, 0.017149305209555564, -0.028640208786961944, -0.09205279122002866, 0.39606419023382566, 0.17898424473057975, 0.08308765234003279, 0.020458805828344865, 0.3359060012631562, -0.020349751094987593, 0.10459787933811325, 0.027631826922089747, 0.2896081219828899, 0.0424251609938877, 0.17161006118572528, -0.1836557777193427, 0.09203884131655955, -0.05868132681573731]
|
1,803.04986
|
A Survey of CH3CN and HC3N in Protoplanetary Disks
|
The organic content of protoplanetary disks sets the initial compositions of
planets and comets, thereby influencing subsequent chemistry that is possible
in nascent planetary systems. We present observations of the complex
nitrile-bearing species CH3CN and HC3N towards the disks around the T Tauri
stars AS 209, IM Lup, LkCa 15, and V4046 Sgr as well as the Herbig Ae stars MWC
480 and HD 163296. HC3N is detected towards all disks except IM Lup, and CH3CN
is detected towards V4046 Sgr, MWC 480, and HD 163296. Rotational temperatures
derived for disks with multiple detected lines range from 29-73K, indicating
emission from the temperate molecular layer of the disk. V4046 Sgr and MWC 480
radial abundance profiles are constrained using a parametric model; the
gas-phase CH3CN and HC3N abundances with respect to HCN are a few to tens of
percent in the inner 100 AU of the disk, signifying a rich nitrile chemistry at
planet- and comet-forming disk radii. We find consistent relative abundances of
CH3CN, HC3N, and HCN between our disk sample, protostellar envelopes, and solar
system comets; this is suggestive of a robust nitrile chemistry with similar
outcomes under a wide range of physical conditions.
|
astro-ph.EP
|
the organic content of protoplanetary disks sets the initial compositions of planets and comets thereby influencing subsequent chemistry that is possible in nascent planetary systems we present observations of the complex nitrilebearing species ch3cn and hc3n towards the disks around the t tauri stars as 209 im lup lkca 15 and v4046 sgr as well as the herbig ae stars mwc 480 and hd 163296 hc3n is detected towards all disks except im lup and ch3cn is detected towards v4046 sgr mwc 480 and hd 163296 rotational temperatures derived for disks with multiple detected lines range from 2973k indicating emission from the temperate molecular layer of the disk v4046 sgr and mwc 480 radial abundance profiles are constrained using a parametric model the gasphase ch3cn and hc3n abundances with respect to hcn are a few to tens of percent in the inner 100 au of the disk signifying a rich nitrile chemistry at planet and cometforming disk radii we find consistent relative abundances of ch3cn hc3n and hcn between our disk sample protostellar envelopes and solar system comets this is suggestive of a robust nitrile chemistry with similar outcomes under a wide range of physical conditions
|
[['the', 'organic', 'content', 'of', 'protoplanetary', 'disks', 'sets', 'the', 'initial', 'compositions', 'of', 'planets', 'and', 'comets', 'thereby', 'influencing', 'subsequent', 'chemistry', 'that', 'is', 'possible', 'in', 'nascent', 'planetary', 'systems', 'we', 'present', 'observations', 'of', 'the', 'complex', 'nitrilebearing', 'species', 'ch3cn', 'and', 'hc3n', 'towards', 'the', 'disks', 'around', 'the', 't', 'tauri', 'stars', 'as', '209', 'im', 'lup', 'lkca', '15', 'and', 'v4046', 'sgr', 'as', 'well', 'as', 'the', 'herbig', 'ae', 'stars', 'mwc', '480', 'and', 'hd', '163296', 'hc3n', 'is', 'detected', 'towards', 'all', 'disks', 'except', 'im', 'lup', 'and', 'ch3cn', 'is', 'detected', 'towards', 'v4046', 'sgr', 'mwc', '480', 'and', 'hd', '163296', 'rotational', 'temperatures', 'derived', 'for', 'disks', 'with', 'multiple', 'detected', 'lines', 'range', 'from', '2973k', 'indicating', 'emission', 'from', 'the', 'temperate', 'molecular', 'layer', 'of', 'the', 'disk', 'v4046', 'sgr', 'and', 'mwc', '480', 'radial', 'abundance', 'profiles', 'are', 'constrained', 'using', 'a', 'parametric', 'model', 'the', 'gasphase', 'ch3cn', 'and', 'hc3n', 'abundances', 'with', 'respect', 'to', 'hcn', 'are', 'a', 'few', 'to', 'tens', 'of', 'percent', 'in', 'the', 'inner', '100', 'au', 'of', 'the', 'disk', 'signifying', 'a', 'rich', 'nitrile', 'chemistry', 'at', 'planet', 'and', 'cometforming', 'disk', 'radii', 'we', 'find', 'consistent', 'relative', 'abundances', 'of', 'ch3cn', 'hc3n', 'and', 'hcn', 'between', 'our', 'disk', 'sample', 'protostellar', 'envelopes', 'and', 'solar', 'system', 'comets', 'this', 'is', 'suggestive', 'of', 'a', 'robust', 'nitrile', 'chemistry', 'with', 'similar', 'outcomes', 'under', 'a', 'wide', 'range', 'of', 'physical', 'conditions']]
|
[-0.05428312214561882, 0.09053700393997133, 0.030244973396940024, -0.0086092563092795, -0.04136155708272913, -0.1048833727122515, 0.0782420445298392, 0.45034507496916143, -0.17178725475474194, -0.3157569909742529, 0.022575435815523043, -0.25771587148618397, 0.009378481363474401, 0.11746092599494978, -0.038176103321254144, 0.004742160707726576, 0.10386730909255872, -0.15842245542954356, -0.0017715520984565205, -0.14380464572267435, 0.2349319209239071, 0.06366730785506211, -0.046589728386006946, -0.029247623600951424, -0.014192745094331577, -0.2538341593751012, 0.0007044292383913681, -0.1338836359407407, -0.2012506382461183, 0.042219723690032344, 0.30446206334109427, 0.13883871161954997, 0.1466943821749775, -0.35784433630381957, -0.25806669026286794, -0.010442120692759906, 0.175396073719405, -0.03945073065799229, -0.009923096940631872, -0.28526178387848217, 0.10301389794175024, -0.1762212248982324, -0.1669121207165311, 0.061322067599904426, 0.13231416219922223, 0.027919216363537173, -0.252316319012832, 0.1029981010228626, 0.040971169825686805, 0.23309598732547662, -0.19842929629544181, -0.2130513735488777, -0.1329768313666249, 0.052845883369205766, -0.031825294493116704, 0.1040520354230485, 0.29706197246889937, -0.07331529601846735, -0.02517637430591816, 0.4617790332128241, -0.18974232180620132, 0.042351182823827896, 0.34875470867798153, -0.2602948294946511, -0.25530887748770054, 0.19540898489871436, 0.08443817981163558, 0.23812836173864216, -0.1343218649967967, -0.04807843827281253, -0.06726863851516325, 0.23908158394594475, 0.10468554801605258, 0.10094116289365422, 0.4246504093981204, 0.0826440710783216, 0.01617293076268061, 0.12512969202752053, -0.32421288505609425, -0.1426806496627288, -0.12365961821597386, -0.17773248798924393, -0.08733149698140945, 0.07035547823131506, -0.14468956262405216, -0.04323401040074742, 0.28895677713504464, 0.06972297268455185, 0.23668204512946384, 0.014935850668350504, 0.3024878039015169, 0.025003021159305323, 0.10078468828788507, 0.17945461713027247, 0.2701681878984205, 0.23770692047288583, 0.15775932272243284, -0.2681328660458058, 0.14819238819637978, -0.07262674582697279]
|
1,803.04987
|
Detecting Weak Spectral Lines in Interferometric Data through Matched
Filtering
|
Modern radio interferometers enable observations of spectral lines with
unprecedented spatial resolution and sensitivity. In spite of these technical
advances, many lines of interest are still at best weakly detected and
therefore necessitate detection and analysis techniques specialized for the low
signal-to-noise ratio (SNR) regime. Matched filters can leverage knowledge of
the source structure and kinematics to increase sensitivity of spectral line
observations. Application of the filter in the native Fourier domain improves
SNR while simultaneously avoiding the computational cost and ambiguities
associated with imaging, making matched filtering a fast and robust method for
weak spectral line detection. We demonstrate how an approximate matched filter
can be constructed from a previously observed line or from a model of the
source, and we show how this filter can be used to robustly infer a detection
significance for weak spectral lines. When applied to ALMA Cycle 2 observations
of CH3OH in the protoplanetary disk around TW Hya, the technique yields a ~53%
SNR boost over aperture-based spectral extraction methods, and we show that an
even higher boost will be achieved for observations at higher spatial
resolution. A Python-based open-source implementation of this technique is
available under the MIT license at https://github.com/AstroChem/VISIBLE.
|
astro-ph.IM
|
modern radio interferometers enable observations of spectral lines with unprecedented spatial resolution and sensitivity in spite of these technical advances many lines of interest are still at best weakly detected and therefore necessitate detection and analysis techniques specialized for the low signaltonoise ratio snr regime matched filters can leverage knowledge of the source structure and kinematics to increase sensitivity of spectral line observations application of the filter in the native fourier domain improves snr while simultaneously avoiding the computational cost and ambiguities associated with imaging making matched filtering a fast and robust method for weak spectral line detection we demonstrate how an approximate matched filter can be constructed from a previously observed line or from a model of the source and we show how this filter can be used to robustly infer a detection significance for weak spectral lines when applied to alma cycle 2 observations of ch3oh in the protoplanetary disk around tw hya the technique yields a 53 snr boost over aperturebased spectral extraction methods and we show that an even higher boost will be achieved for observations at higher spatial resolution a pythonbased opensource implementation of this technique is available under the mit license at httpsgithubcomastrochemvisible
|
[['modern', 'radio', 'interferometers', 'enable', 'observations', 'of', 'spectral', 'lines', 'with', 'unprecedented', 'spatial', 'resolution', 'and', 'sensitivity', 'in', 'spite', 'of', 'these', 'technical', 'advances', 'many', 'lines', 'of', 'interest', 'are', 'still', 'at', 'best', 'weakly', 'detected', 'and', 'therefore', 'necessitate', 'detection', 'and', 'analysis', 'techniques', 'specialized', 'for', 'the', 'low', 'signaltonoise', 'ratio', 'snr', 'regime', 'matched', 'filters', 'can', 'leverage', 'knowledge', 'of', 'the', 'source', 'structure', 'and', 'kinematics', 'to', 'increase', 'sensitivity', 'of', 'spectral', 'line', 'observations', 'application', 'of', 'the', 'filter', 'in', 'the', 'native', 'fourier', 'domain', 'improves', 'snr', 'while', 'simultaneously', 'avoiding', 'the', 'computational', 'cost', 'and', 'ambiguities', 'associated', 'with', 'imaging', 'making', 'matched', 'filtering', 'a', 'fast', 'and', 'robust', 'method', 'for', 'weak', 'spectral', 'line', 'detection', 'we', 'demonstrate', 'how', 'an', 'approximate', 'matched', 'filter', 'can', 'be', 'constructed', 'from', 'a', 'previously', 'observed', 'line', 'or', 'from', 'a', 'model', 'of', 'the', 'source', 'and', 'we', 'show', 'how', 'this', 'filter', 'can', 'be', 'used', 'to', 'robustly', 'infer', 'a', 'detection', 'significance', 'for', 'weak', 'spectral', 'lines', 'when', 'applied', 'to', 'alma', 'cycle', '2', 'observations', 'of', 'ch3oh', 'in', 'the', 'protoplanetary', 'disk', 'around', 'tw', 'hya', 'the', 'technique', 'yields', 'a', '53', 'snr', 'boost', 'over', 'aperturebased', 'spectral', 'extraction', 'methods', 'and', 'we', 'show', 'that', 'an', 'even', 'higher', 'boost', 'will', 'be', 'achieved', 'for', 'observations', 'at', 'higher', 'spatial', 'resolution', 'a', 'pythonbased', 'opensource', 'implementation', 'of', 'this', 'technique', 'is', 'available', 'under', 'the', 'mit', 'license', 'at', 'httpsgithubcomastrochemvisible']]
|
[-0.05076426362167254, -0.006565740422405669, -0.05352008521246413, 0.036923508379123914, -0.08167040490220781, -0.14864876460680276, 0.040388892270681084, 0.48011103528316573, -0.233421751476749, -0.3463309587195817, 0.1361616596872354, -0.22177397290061257, -0.08374543598443834, 0.20841183318789447, -0.05326185234812925, 0.0268419746414175, 0.12449960137783277, -0.035228644248399166, -0.069421961488769, -0.18744371708945815, 0.23319405110169558, 0.14874097941716136, 0.2739054938552506, 0.03177067526995976, 0.08743856984794474, -0.05518373362414276, -0.09611401295129474, 0.002506226691596135, -0.0714204176554337, 0.11610146446536869, 0.29687043542813774, 0.17122526357133844, 0.2279037067612558, -0.35886023445243037, -0.22939753229641638, 0.058414151913232425, 0.19671671698575444, 0.07514128624814365, -0.008159782720442786, -0.2934486605127041, 0.10792018203629238, -0.157362955488321, -0.14396866058902533, -0.04639973282235477, -0.05029683908203034, 0.024086461094974757, -0.2847619345679178, 0.05833856497815989, 0.029596556046262684, 0.08805201840093077, -0.03722529712772806, -0.11898596225202912, 0.017602866369704106, 0.1135487258094751, -0.024616740241228143, 0.01823288207459781, 0.12162651715452096, -0.17595863033490575, -0.0909438122280243, 0.3393631513157596, -0.11823446621337548, -0.1305459049504457, 0.2325376402821881, -0.15427228273950855, -0.17499299387146502, 0.21885234071882537, 0.16662759928390233, 0.1053774737767085, -0.1244306854447003, 0.04529949967914632, 0.03483559413709574, 0.25087823832614553, 0.09461503616778763, 0.07545331538057501, 0.24078923842112412, 0.13991452507895766, 0.07099359695572698, 0.1229560861726776, -0.22320625231974062, 0.0012907781961580946, -0.22879919564031592, -0.12095562338057642, -0.17300442005378297, 0.024723127401419773, -0.10397625342187838, -0.10968482352304038, 0.365894185064003, 0.19134928958815042, 0.18698755401595862, 0.04096619728623391, 0.32282958482627316, 0.1145918179312815, 0.09028705835372981, 0.0776939465584365, 0.24148058400764552, 0.09933886830130535, 0.13038445826481107, -0.2064460776813888, 0.023127073465583074, -0.012761191112186872]
|
1,803.04988
|
LCANet: End-to-End Lipreading with Cascaded Attention-CTC
|
Machine lipreading is a special type of automatic speech recognition (ASR)
which transcribes human speech by visually interpreting the movement of related
face regions including lips, face, and tongue. Recently, deep neural network
based lipreading methods show great potential and have exceeded the accuracy of
experienced human lipreaders in some benchmark datasets. However, lipreading is
still far from being solved, and existing methods tend to have high error rates
on the wild data. In this paper, we propose LCANet, an end-to-end deep neural
network based lipreading system. LCANet encodes input video frames using a
stacked 3D convolutional neural network (CNN), highway network and
bidirectional GRU network. The encoder effectively captures both short-term and
long-term spatio-temporal information. More importantly, LCANet incorporates a
cascaded attention-CTC decoder to generate output texts. By cascading CTC with
attention, it partially eliminates the defect of the conditional independence
assumption of CTC within the hidden neural layers, and this yields notably
performance improvement as well as faster convergence. The experimental results
show the proposed system achieves a 1.3% CER and 3.0% WER on the GRID corpus
database, leading to a 12.3% improvement compared to the state-of-the-art
methods.
|
cs.CV
|
machine lipreading is a special type of automatic speech recognition asr which transcribes human speech by visually interpreting the movement of related face regions including lips face and tongue recently deep neural network based lipreading methods show great potential and have exceeded the accuracy of experienced human lipreaders in some benchmark datasets however lipreading is still far from being solved and existing methods tend to have high error rates on the wild data in this paper we propose lcanet an endtoend deep neural network based lipreading system lcanet encodes input video frames using a stacked 3d convolutional neural network cnn highway network and bidirectional gru network the encoder effectively captures both shortterm and longterm spatiotemporal information more importantly lcanet incorporates a cascaded attentionctc decoder to generate output texts by cascading ctc with attention it partially eliminates the defect of the conditional independence assumption of ctc within the hidden neural layers and this yields notably performance improvement as well as faster convergence the experimental results show the proposed system achieves a 13 cer and 30 wer on the grid corpus database leading to a 123 improvement compared to the stateoftheart methods
|
[['machine', 'lipreading', 'is', 'a', 'special', 'type', 'of', 'automatic', 'speech', 'recognition', 'asr', 'which', 'transcribes', 'human', 'speech', 'by', 'visually', 'interpreting', 'the', 'movement', 'of', 'related', 'face', 'regions', 'including', 'lips', 'face', 'and', 'tongue', 'recently', 'deep', 'neural', 'network', 'based', 'lipreading', 'methods', 'show', 'great', 'potential', 'and', 'have', 'exceeded', 'the', 'accuracy', 'of', 'experienced', 'human', 'lipreaders', 'in', 'some', 'benchmark', 'datasets', 'however', 'lipreading', 'is', 'still', 'far', 'from', 'being', 'solved', 'and', 'existing', 'methods', 'tend', 'to', 'have', 'high', 'error', 'rates', 'on', 'the', 'wild', 'data', 'in', 'this', 'paper', 'we', 'propose', 'lcanet', 'an', 'endtoend', 'deep', 'neural', 'network', 'based', 'lipreading', 'system', 'lcanet', 'encodes', 'input', 'video', 'frames', 'using', 'a', 'stacked', '3d', 'convolutional', 'neural', 'network', 'cnn', 'highway', 'network', 'and', 'bidirectional', 'gru', 'network', 'the', 'encoder', 'effectively', 'captures', 'both', 'shortterm', 'and', 'longterm', 'spatiotemporal', 'information', 'more', 'importantly', 'lcanet', 'incorporates', 'a', 'cascaded', 'attentionctc', 'decoder', 'to', 'generate', 'output', 'texts', 'by', 'cascading', 'ctc', 'with', 'attention', 'it', 'partially', 'eliminates', 'the', 'defect', 'of', 'the', 'conditional', 'independence', 'assumption', 'of', 'ctc', 'within', 'the', 'hidden', 'neural', 'layers', 'and', 'this', 'yields', 'notably', 'performance', 'improvement', 'as', 'well', 'as', 'faster', 'convergence', 'the', 'experimental', 'results', 'show', 'the', 'proposed', 'system', 'achieves', 'a', '13', 'cer', 'and', '30', 'wer', 'on', 'the', 'grid', 'corpus', 'database', 'leading', 'to', 'a', '123', 'improvement', 'compared', 'to', 'the', 'stateoftheart', 'methods']]
|
[-0.05277135833745537, -0.04315621094467431, -0.014861610381452554, 0.07239992640636585, -0.08011612317662824, -0.22257714474416046, 0.02901277545545122, 0.4677413448139473, -0.24925940192339044, -0.3075929371388777, 0.06248353887164581, -0.2895550295259685, -0.22776573821662052, 0.19840385498775898, -0.19585644348928577, 0.1211408880975334, 0.18786373411267676, 0.08468384850245442, -0.03910807405491286, -0.303414227136056, 0.23962492845760333, 0.049927689562238774, 0.396206937976694, 0.006275616134098046, 0.16960287823713824, -0.06115908559692639, -0.023430843310610506, -0.06562027176558755, -0.008922472912768917, 0.1929498442979012, 0.2856836734578585, 0.1819359787959093, 0.31644557363651793, -0.42826733498701025, -0.26607873254805486, 0.047556768954982835, 0.16072493724564396, 0.1228529304345588, 0.0017621923731880203, -0.3880759236469333, 0.11006412562722015, -0.19490764503091298, 0.0932160051904185, -0.103959522955366, -0.019076938359017567, -0.015083322923312643, -0.2796403785290384, 0.07096670684774244, 0.12812393083219864, 0.128417778689976, -0.028966364381765877, -0.10638154553872824, -0.005314135519299833, 0.18840117674449056, 0.04939183281308346, 0.12577096676076985, 0.14111217987482194, -0.21066687767432077, -0.13885316549690696, 0.33822173022581314, -0.08433187826691817, -0.1993930544260712, 0.17895004031539122, -0.01097830637264504, -0.1221929605700391, 0.12175234667919872, 0.2535456915400804, 0.06072984211529955, -0.17486157232314034, -0.025365285151305476, -0.040695758572183355, 0.22434864250915962, 0.08409140108888673, 0.009165556728100729, 0.16196904927073294, 0.308402008397958, -0.03507329717712112, 0.13862114494898056, -0.1904618019216864, -0.0659583916095524, -0.14197948427745216, -0.06005127515712206, -0.15147081002711305, -0.04265991678811294, -0.10940615922742629, -0.13664916069025085, 0.4136597043169396, 0.22386670985293608, 0.18738885228793142, 0.16015895970828495, 0.3380582728694198, 0.012611556142844536, 0.16013784920698199, 0.10557737826768841, 0.1968039364097258, -0.003135217026014019, 0.15791125925545837, -0.16859607877352684, 0.10550525846827045, 0.08010786486957124]
|
1,803.04989
|
The Refined Swampland Distance Conjecture in Calabi-Yau Moduli Spaces
|
The Swampland Distance Conjecture claims that effective theories derived from
a consistent theory of quantum gravity only have a finite range of validity.
This will imply drastic consequences for string theory model building. The
refined version of this conjecture says that this range is of the order of the
naturally built in scale, namely the Planck scale. It is investigated whether
the Refined Swampland Distance Conjecture is consistent with proper field
distances arising in the well understood moduli spaces of Calabi-Yau
compactification. Investigating in particular the non-geometric phases of
Kahler moduli spaces of dimension $h^{11}\in\{1,2,101\}$, we always found
proper field distances that are smaller than the Planck-length.
|
hep-th
|
the swampland distance conjecture claims that effective theories derived from a consistent theory of quantum gravity only have a finite range of validity this will imply drastic consequences for string theory model building the refined version of this conjecture says that this range is of the order of the naturally built in scale namely the planck scale it is investigated whether the refined swampland distance conjecture is consistent with proper field distances arising in the well understood moduli spaces of calabiyau compactification investigating in particular the nongeometric phases of kahler moduli spaces of dimension h11in12101 we always found proper field distances that are smaller than the plancklength
|
[['the', 'swampland', 'distance', 'conjecture', 'claims', 'that', 'effective', 'theories', 'derived', 'from', 'a', 'consistent', 'theory', 'of', 'quantum', 'gravity', 'only', 'have', 'a', 'finite', 'range', 'of', 'validity', 'this', 'will', 'imply', 'drastic', 'consequences', 'for', 'string', 'theory', 'model', 'building', 'the', 'refined', 'version', 'of', 'this', 'conjecture', 'says', 'that', 'this', 'range', 'is', 'of', 'the', 'order', 'of', 'the', 'naturally', 'built', 'in', 'scale', 'namely', 'the', 'planck', 'scale', 'it', 'is', 'investigated', 'whether', 'the', 'refined', 'swampland', 'distance', 'conjecture', 'is', 'consistent', 'with', 'proper', 'field', 'distances', 'arising', 'in', 'the', 'well', 'understood', 'moduli', 'spaces', 'of', 'calabiyau', 'compactification', 'investigating', 'in', 'particular', 'the', 'nongeometric', 'phases', 'of', 'kahler', 'moduli', 'spaces', 'of', 'dimension', 'h11in12101', 'we', 'always', 'found', 'proper', 'field', 'distances', 'that', 'are', 'smaller', 'than', 'the', 'plancklength']]
|
[-0.164565117762837, 0.16512653077864703, -0.12758123465233817, 0.16291791448404766, -0.07594419614728189, -0.11807707717800338, -0.007299793989590879, 0.29033208127300486, -0.25783222890898305, -0.27205798624496347, 0.09261005700956855, -0.1874359708810928, -0.1266636409849491, 0.19468382350773164, -0.12639754266425404, -0.008940722916345551, 0.02442464437818963, 0.019303317317949993, -0.0928454487255054, -0.30985833389491263, 0.38274734207200556, 0.0385083025617894, 0.27004923591530827, 0.08779789434904058, 0.07573116039154383, -0.030638306195197522, -0.02625262943719171, 0.09726131851521302, -0.17477041484456113, 0.15341592167135118, 0.22827429876592503, 0.08840612263445093, 0.18364404899515444, -0.37809518513155504, -0.26914915192942573, 0.13336972667361205, 0.121479356244101, 0.10386767719854724, -0.0011164299157483256, -0.26213738335437087, 0.11128701188794847, -0.15297883673448046, -0.20691297852592366, -0.03851939564272058, 0.06905581349867203, -0.06136530766676549, -0.19352352564697559, 0.07062474552861564, 0.03447160814155139, 0.07372028886050619, -0.07120448439206295, -0.09189187679966947, -0.04041628247206012, 0.06500376654538449, 0.09805937068435838, 0.11328618670813739, 0.08103171457044499, -0.11464220567667892, -0.11824381586937409, 0.3958950994386918, -0.056098085937539406, -0.1333945624690661, 0.12180452588023091, -0.14177203421573756, -0.16961380311305513, 0.07372060238893302, 0.06362879958074048, 0.16062274487372838, -0.07076055639124704, 0.19191926207287974, -0.07821974289199372, 0.15443280351047298, 0.11183076901449207, 0.0712071431510783, 0.2261233986882528, 0.12622870526601612, 0.06383369948477748, 0.07301064494575532, -0.023116605720957212, -0.13797166210243408, -0.38989815667693345, -0.10942250730048092, -0.1581296532893694, 0.11776496981542979, -0.16228283206352367, -0.18097849389239443, 0.30887677782338185, 0.15716155507175675, 0.1755524448268467, 0.11439068409183747, 0.18665029776265035, 0.0526231145398375, 0.09279037261698043, 0.03441900967725746, 0.2893581479207946, 0.17629688596001492, 0.01676870985088413, -0.15148222792392843, -0.02134616441919275, 0.15919842720383182]
|
1,803.0499
|
Topological terms, AdS_2n gravity and renormalized Entanglement Entropy
of holographic CFTs
|
We extend our topological renormalization scheme for Entanglement Entropy to
holographic CFTs of arbitrary odd dimensions in the context of the AdS/CFT
correspondence. The procedure consists in adding the Chern form as a boundary
term to the area functional of the Ryu-Takayanagi minimal surface. The
renormalized Entanglement Entropy thus obtained can be rewritten in terms of
the Euler characteristic and the AdS curvature of the minimal surface. This
prescription considers the use of the Replica Trick to express the renormalized
Entanglement Entropy in terms of the renormalized gravitational action
evaluated on the conically-singular replica manifold extended to the bulk. This
renormalized action is obtained in turn by adding the Chern form as the
counterterm at the boundary of the 2n-dimensional asymptotically AdS bulk
manifold. We explicitly show that, up to next-to-leading order in the
holographic radial coordinate, the addition of this boundary term cancels the
divergent part of the Entanglement Entropy. We discuss possible applications of
the method for studying CFT parameters like central charges.
|
hep-th gr-qc
|
we extend our topological renormalization scheme for entanglement entropy to holographic cfts of arbitrary odd dimensions in the context of the adscft correspondence the procedure consists in adding the chern form as a boundary term to the area functional of the ryutakayanagi minimal surface the renormalized entanglement entropy thus obtained can be rewritten in terms of the euler characteristic and the ads curvature of the minimal surface this prescription considers the use of the replica trick to express the renormalized entanglement entropy in terms of the renormalized gravitational action evaluated on the conicallysingular replica manifold extended to the bulk this renormalized action is obtained in turn by adding the chern form as the counterterm at the boundary of the 2ndimensional asymptotically ads bulk manifold we explicitly show that up to nexttoleading order in the holographic radial coordinate the addition of this boundary term cancels the divergent part of the entanglement entropy we discuss possible applications of the method for studying cft parameters like central charges
|
[['we', 'extend', 'our', 'topological', 'renormalization', 'scheme', 'for', 'entanglement', 'entropy', 'to', 'holographic', 'cfts', 'of', 'arbitrary', 'odd', 'dimensions', 'in', 'the', 'context', 'of', 'the', 'adscft', 'correspondence', 'the', 'procedure', 'consists', 'in', 'adding', 'the', 'chern', 'form', 'as', 'a', 'boundary', 'term', 'to', 'the', 'area', 'functional', 'of', 'the', 'ryutakayanagi', 'minimal', 'surface', 'the', 'renormalized', 'entanglement', 'entropy', 'thus', 'obtained', 'can', 'be', 'rewritten', 'in', 'terms', 'of', 'the', 'euler', 'characteristic', 'and', 'the', 'ads', 'curvature', 'of', 'the', 'minimal', 'surface', 'this', 'prescription', 'considers', 'the', 'use', 'of', 'the', 'replica', 'trick', 'to', 'express', 'the', 'renormalized', 'entanglement', 'entropy', 'in', 'terms', 'of', 'the', 'renormalized', 'gravitational', 'action', 'evaluated', 'on', 'the', 'conicallysingular', 'replica', 'manifold', 'extended', 'to', 'the', 'bulk', 'this', 'renormalized', 'action', 'is', 'obtained', 'in', 'turn', 'by', 'adding', 'the', 'chern', 'form', 'as', 'the', 'counterterm', 'at', 'the', 'boundary', 'of', 'the', '2ndimensional', 'asymptotically', 'ads', 'bulk', 'manifold', 'we', 'explicitly', 'show', 'that', 'up', 'to', 'nexttoleading', 'order', 'in', 'the', 'holographic', 'radial', 'coordinate', 'the', 'addition', 'of', 'this', 'boundary', 'term', 'cancels', 'the', 'divergent', 'part', 'of', 'the', 'entanglement', 'entropy', 'we', 'discuss', 'possible', 'applications', 'of', 'the', 'method', 'for', 'studying', 'cft', 'parameters', 'like', 'central', 'charges']]
|
[-0.1769291659612663, 0.1368528247595106, -0.10546850951149969, 0.08135384249517967, -0.042496844399266126, -0.12739424024447343, 0.009399465546466229, 0.2615156500861503, -0.21610173638115024, -0.23648951847742244, 0.06168436032589298, -0.30223898376088315, -0.14096654048075946, 0.11249996340981253, -0.0734910396461534, 0.08251927076929771, -0.004148801024889619, 0.09432833352148896, -0.13144019821824834, -0.25787786739841445, 0.38492807092304093, 0.025300085990371684, 0.285487049841322, 0.12693550976322646, 0.10477265123087663, 0.0194814962046732, -0.015715258343644987, 0.05542048799419185, -0.15519298208905305, 0.1531487385715392, 0.24692617916138615, 0.01958858441822685, 0.17259026842941416, -0.4085573618209398, -0.25466214826262396, 0.06644642469473183, 0.12397154994314627, 0.12837401490726666, 0.03489013996029205, -0.27482486702785713, 0.04860635696365157, -0.21456161014048564, -0.19180642238466022, -0.11335219094734185, -0.018570622633688333, -0.11777988147762854, -0.21571549208034058, 0.10146722680798209, 0.02378601877859271, 0.01861070957398269, -0.07715574042905667, -0.025352622953061833, -0.08175084681928771, 0.12917961015808965, 0.11778133980242717, 0.05854581576976471, 0.1324019341292314, -0.14321348507087905, -0.06771024715236286, 0.32333056845350144, -0.11422528567647267, -0.24586563694813265, 0.1139421120978801, -0.12705451207201382, -0.10101770384736904, 0.08406996393076531, 0.09148381089382782, 0.171852019702073, -0.13410423701719903, 0.17025251645508233, -0.012976820748895633, 0.09969121595935487, 0.10144161923629481, 0.05629533421739413, 0.1962524642032094, 0.02808735863924617, 0.06589648342782223, 0.24643778776900457, -0.036618712280625645, -0.12933096466422728, -0.43270992732425106, -0.23820673044495536, -0.24787277309791889, 0.06566741162408483, -0.17309803885069502, -0.17091082614667646, 0.4122241748882294, 0.1249988687937375, 0.16758800231089968, 0.07929373653208065, 0.24563978849512683, 0.13886662460537058, 0.12310831414865012, 0.07775509882492593, 0.23479578724960093, 0.10210542187872683, 0.09134763773110491, -0.3161861063179946, -0.04626762958402496, 0.22923322320381953]
|
1,803.04991
|
Inference on a Distribution from Noisy Draws
|
We consider a situation where the distribution of a random variable is being
estimated by the empirical distribution of noisy measurements of that variable.
This is common practice in, for example, teacher value-added models and other
fixed-effect models for panel data. We use an asymptotic embedding where the
noise shrinks with the sample size to calculate the leading bias in the
empirical distribution arising from the presence of noise. The leading bias in
the empirical quantile function is equally obtained. These calculations are new
in the literature, where only results on smooth functionals such as the mean
and variance have been derived. We provide both analytical and jackknife
corrections that recenter the limit distribution and yield confidence intervals
with correct coverage in large samples. Our approach can be connected to
corrections for selection bias and shrinkage estimation and is to be contrasted
with deconvolution. Simulation results confirm the much-improved sampling
behavior of the corrected estimators. An empirical illustration on
heterogeneity in deviations from the law of one price is equally provided.
|
econ.EM stat.ME
|
we consider a situation where the distribution of a random variable is being estimated by the empirical distribution of noisy measurements of that variable this is common practice in for example teacher valueadded models and other fixedeffect models for panel data we use an asymptotic embedding where the noise shrinks with the sample size to calculate the leading bias in the empirical distribution arising from the presence of noise the leading bias in the empirical quantile function is equally obtained these calculations are new in the literature where only results on smooth functionals such as the mean and variance have been derived we provide both analytical and jackknife corrections that recenter the limit distribution and yield confidence intervals with correct coverage in large samples our approach can be connected to corrections for selection bias and shrinkage estimation and is to be contrasted with deconvolution simulation results confirm the muchimproved sampling behavior of the corrected estimators an empirical illustration on heterogeneity in deviations from the law of one price is equally provided
|
[['we', 'consider', 'a', 'situation', 'where', 'the', 'distribution', 'of', 'a', 'random', 'variable', 'is', 'being', 'estimated', 'by', 'the', 'empirical', 'distribution', 'of', 'noisy', 'measurements', 'of', 'that', 'variable', 'this', 'is', 'common', 'practice', 'in', 'for', 'example', 'teacher', 'valueadded', 'models', 'and', 'other', 'fixedeffect', 'models', 'for', 'panel', 'data', 'we', 'use', 'an', 'asymptotic', 'embedding', 'where', 'the', 'noise', 'shrinks', 'with', 'the', 'sample', 'size', 'to', 'calculate', 'the', 'leading', 'bias', 'in', 'the', 'empirical', 'distribution', 'arising', 'from', 'the', 'presence', 'of', 'noise', 'the', 'leading', 'bias', 'in', 'the', 'empirical', 'quantile', 'function', 'is', 'equally', 'obtained', 'these', 'calculations', 'are', 'new', 'in', 'the', 'literature', 'where', 'only', 'results', 'on', 'smooth', 'functionals', 'such', 'as', 'the', 'mean', 'and', 'variance', 'have', 'been', 'derived', 'we', 'provide', 'both', 'analytical', 'and', 'jackknife', 'corrections', 'that', 'recenter', 'the', 'limit', 'distribution', 'and', 'yield', 'confidence', 'intervals', 'with', 'correct', 'coverage', 'in', 'large', 'samples', 'our', 'approach', 'can', 'be', 'connected', 'to', 'corrections', 'for', 'selection', 'bias', 'and', 'shrinkage', 'estimation', 'and', 'is', 'to', 'be', 'contrasted', 'with', 'deconvolution', 'simulation', 'results', 'confirm', 'the', 'muchimproved', 'sampling', 'behavior', 'of', 'the', 'corrected', 'estimators', 'an', 'empirical', 'illustration', 'on', 'heterogeneity', 'in', 'deviations', 'from', 'the', 'law', 'of', 'one', 'price', 'is', 'equally', 'provided']]
|
[-0.02091569902255521, 0.04405805393008445, -0.1278653399920437, 0.10970324024283028, -0.035795791537571724, -0.11355611702089595, 0.06626699417380191, 0.39684654360539035, -0.23544421683376035, -0.31933850653425994, 0.1326835638998697, -0.32971878400431914, -0.11192703905395554, 0.19436711211122398, -0.09618888756162242, 0.04682563669837968, 0.04729418164903396, -0.0019321624713484198, -0.032285860325727195, -0.2604434013717988, 0.2812757302573964, 0.07398084888223842, 0.29457238808339625, -0.014217100857773371, 0.06002230722421769, 0.00987633017888456, -0.06138523175736497, 0.052510750008888586, -0.11782007139186002, 0.10130009828516615, 0.2315792365410935, 0.09402595055071714, 0.28921419319892283, -0.35638789543642885, -0.21085005549289154, 0.10128740790403551, 0.1332138249901129, 0.1129873850932944, -0.048314540226241216, -0.25229366529564107, 0.058483103678251304, -0.17265753103546086, -0.10064709608916912, -0.09044036464438888, -0.01617425084468086, 0.06638043964886221, -0.36144091386064797, 0.1304929876572055, 0.025648763019330147, 0.058676198686836274, -0.045022246800907696, -0.17887571977168235, -0.0013346732784694398, 0.14604192209152275, 0.10498048067814535, -0.0008269210253455486, 0.11619654861796233, -0.12284198303673585, -0.08071903878419895, 0.32216952285560513, -0.0833749822871923, -0.22506516009068106, 0.13609166923305838, -0.1598916863927302, -0.12942092795992455, 0.08878775646812037, 0.19692295642054983, 0.07413056676368106, -0.16749094515202884, 0.062702702032266, -0.008633639660734705, 0.1429299106637604, -0.006690901320166232, 0.002166090224058046, 0.15380056077962992, 0.1581587098778514, 0.0495662345858672, 0.13648296768909146, -0.15208426299940642, -0.10266069200826668, -0.3336164675740122, -0.09640975342246524, -0.22123992054761327, 0.025755565444671967, -0.15730773258020922, -0.19941967599398908, 0.35307564479652903, 0.198158236269496, 0.2186804866113248, 0.11682035837714609, 0.30238058279698704, 0.16966166151946205, 0.039000255660268296, 0.05701231526221797, 0.22690248152796635, 0.10744180792550508, 0.018361176642567485, -0.16650273839395754, 0.1369008420577153, -0.022530250573988286]
|
1,803.04992
|
SU(N) - symmetric dynamic aether: General formalism and a hypothesis on
spontaneous color polarization
|
The SU(N)-symmetric generalization of the model of the electromagnetically
active dynamic aether is formulated. This generalization is based on the
introduction of a Yang-Mills gauge field instead of the Maxwell field, and of a
SU(N)-multiplet of vector fields instead of the standard single vector field.
In the framework of the second order version of the effective field theory this
generalization includes three constitutive tensors, which are the SU(N)
extensions of the tensors appeared in the Einstein-Maxwell-aether theory; we
reconstructed the full-format set of these constitutive tensors. The total
self-consistent system of master equations for the gauge, vector and
gravitational fields is obtained by the variation procedure. The general model
of the SU(N)-symmetric dynamic aether is reduced to the extended
Einstein-Yang-Mills-aether model by the ansatz about spontaneous color
polarization of the vector fields. In fact, this ansatz requires the vector
fields, which form the SU(N) multiplet, to become parallel in the group (color)
space due to a phase transition, and a new selected direction in the group
space to appear, thus converting it into the anisotropic color space.
|
gr-qc astro-ph.HE hep-th
|
the sunsymmetric generalization of the model of the electromagnetically active dynamic aether is formulated this generalization is based on the introduction of a yangmills gauge field instead of the maxwell field and of a sunmultiplet of vector fields instead of the standard single vector field in the framework of the second order version of the effective field theory this generalization includes three constitutive tensors which are the sun extensions of the tensors appeared in the einsteinmaxwellaether theory we reconstructed the fullformat set of these constitutive tensors the total selfconsistent system of master equations for the gauge vector and gravitational fields is obtained by the variation procedure the general model of the sunsymmetric dynamic aether is reduced to the extended einsteinyangmillsaether model by the ansatz about spontaneous color polarization of the vector fields in fact this ansatz requires the vector fields which form the sun multiplet to become parallel in the group color space due to a phase transition and a new selected direction in the group space to appear thus converting it into the anisotropic color space
|
[['the', 'sunsymmetric', 'generalization', 'of', 'the', 'model', 'of', 'the', 'electromagnetically', 'active', 'dynamic', 'aether', 'is', 'formulated', 'this', 'generalization', 'is', 'based', 'on', 'the', 'introduction', 'of', 'a', 'yangmills', 'gauge', 'field', 'instead', 'of', 'the', 'maxwell', 'field', 'and', 'of', 'a', 'sunmultiplet', 'of', 'vector', 'fields', 'instead', 'of', 'the', 'standard', 'single', 'vector', 'field', 'in', 'the', 'framework', 'of', 'the', 'second', 'order', 'version', 'of', 'the', 'effective', 'field', 'theory', 'this', 'generalization', 'includes', 'three', 'constitutive', 'tensors', 'which', 'are', 'the', 'sun', 'extensions', 'of', 'the', 'tensors', 'appeared', 'in', 'the', 'einsteinmaxwellaether', 'theory', 'we', 'reconstructed', 'the', 'fullformat', 'set', 'of', 'these', 'constitutive', 'tensors', 'the', 'total', 'selfconsistent', 'system', 'of', 'master', 'equations', 'for', 'the', 'gauge', 'vector', 'and', 'gravitational', 'fields', 'is', 'obtained', 'by', 'the', 'variation', 'procedure', 'the', 'general', 'model', 'of', 'the', 'sunsymmetric', 'dynamic', 'aether', 'is', 'reduced', 'to', 'the', 'extended', 'einsteinyangmillsaether', 'model', 'by', 'the', 'ansatz', 'about', 'spontaneous', 'color', 'polarization', 'of', 'the', 'vector', 'fields', 'in', 'fact', 'this', 'ansatz', 'requires', 'the', 'vector', 'fields', 'which', 'form', 'the', 'sun', 'multiplet', 'to', 'become', 'parallel', 'in', 'the', 'group', 'color', 'space', 'due', 'to', 'a', 'phase', 'transition', 'and', 'a', 'new', 'selected', 'direction', 'in', 'the', 'group', 'space', 'to', 'appear', 'thus', 'converting', 'it', 'into', 'the', 'anisotropic', 'color', 'space']]
|
[-0.13675499325832244, 0.16303502913328938, -0.07040623247830181, 0.05617613990954391, -0.10488145483186705, -0.053632962223056746, -0.009339706358050221, 0.3150881509532103, -0.253722888393456, -0.29618658010858573, 0.06849219083141043, -0.20855037165516666, -0.15616957763820116, 0.10281025345207075, -0.004931692250779477, 0.010419607298962515, -0.028959234645215517, 0.09188894876519796, -0.08285195100651091, -0.24049007729091948, 0.34036377558334807, 0.014656539283821294, 0.3021280410346286, -0.022315716753638852, 0.1411946473198932, 0.06366540268786124, -0.03823265300571233, 0.04761225846478978, -0.0495655107493887, 0.15400966800663662, 0.1601440765862835, 0.09907254317357879, 0.20658940978176976, -0.4054404733509853, -0.23924421500842805, 0.07516263202020106, 0.08916418544209466, 0.15149064983332253, -0.008938723573616395, -0.30406904499977827, 0.04649283622402227, -0.14986587158302594, -0.14367178667888003, -0.07268266584831236, 0.002887635892551478, -0.05037470378420562, -0.2729387348143106, 0.06845318306764005, 0.062146259032874955, 0.04502232058163419, -0.11715327486902309, -0.09490969798650764, -0.021232309013915557, 0.048668803695332385, 0.0752771729195287, 0.09953728000213254, 0.1113277187540153, -0.19352936303917448, -0.09355226709860666, 0.4233171409531229, -0.1083243226809106, -0.22226328688577332, 0.1186312434046754, -0.11644993092457967, -0.09806144709468702, 0.12719563485642402, 0.1828761855060042, 0.1423937813097868, -0.1646918514288491, 0.13350970856477398, -0.06192990656053626, 0.11546568187681594, 0.017826191098803932, 0.013599312274473259, 0.21403387199081053, 0.10216584331195416, 0.024912910155909157, 0.14350291013439326, -0.0539607154673779, -0.132321131613705, -0.36565617447312193, -0.1813479445335434, -0.1527693062530959, 0.028949165992417383, -0.11592138527021757, -0.17954090125216493, 0.4232398887906202, 0.14071174858180785, 0.14240735276313177, 0.00278891926101441, 0.2546111240651159, 0.12776056962931093, 0.1187787294108822, 0.045461253225589277, 0.28377792278529496, 0.2310225001466728, 0.1092446963650699, -0.21313288403041367, -0.046590821226408445, 0.1401894340738547]
|
1,803.04993
|
Notes on Some Entanglement Properties of Quantum Field Theory
|
These are notes on some entanglement properties of quantum field theory,
aiming to make accessible a variety of ideas that are known in the literature.
The main goal is to explain how to deal with entanglement when -- as in quantum
field theory -- it is a property of the algebra of observables and not just of
the states.
|
hep-th math-ph math.MP quant-ph
|
these are notes on some entanglement properties of quantum field theory aiming to make accessible a variety of ideas that are known in the literature the main goal is to explain how to deal with entanglement when as in quantum field theory it is a property of the algebra of observables and not just of the states
|
[['these', 'are', 'notes', 'on', 'some', 'entanglement', 'properties', 'of', 'quantum', 'field', 'theory', 'aiming', 'to', 'make', 'accessible', 'a', 'variety', 'of', 'ideas', 'that', 'are', 'known', 'in', 'the', 'literature', 'the', 'main', 'goal', 'is', 'to', 'explain', 'how', 'to', 'deal', 'with', 'entanglement', 'when', 'as', 'in', 'quantum', 'field', 'theory', 'it', 'is', 'a', 'property', 'of', 'the', 'algebra', 'of', 'observables', 'and', 'not', 'just', 'of', 'the', 'states']]
|
[-0.08694722501789792, 0.1568268084931269, -0.1333811888307856, 0.08849525288678706, -0.07433018022984789, -0.1374690912239123, -0.018793954297475386, 0.3517356869160083, -0.27257608491600605, -0.2769894649748478, 0.13367233109627769, -0.2745659309194276, -0.15762837708257793, 0.22134334350560317, -0.10422749379486368, 0.051771392408562336, 0.01566615826531983, 0.1046134635087168, -0.03895853338518033, -0.27519054436369944, 0.3639196370352517, 0.0460447505598463, 0.2429890531000861, 0.08976075684717089, 0.04786552407108901, -0.04031711980994595, 0.005107013394304535, 0.04882680833862539, -0.12217994087047389, 0.14395791476310574, 0.32422567681785214, 0.1574191300018707, 0.26280053417410765, -0.43302784428784724, -0.1847259736080703, 0.06635413965283844, 0.07805399983721018, 0.1666335914234974, -0.016175714446019316, -0.2507757169701028, 0.09891290057515889, -0.1423456000588965, -0.15409389868574708, -0.10805893725339781, -0.00033130305165653687, -0.0041910274640509955, -0.1826537777342948, 0.009176060140721108, 0.061955523611814306, 0.07095896233722829, -0.001489705373451375, -0.0489054768460623, 0.009026664382729092, 0.13562135919448592, 0.04915821443622311, 0.04259210713861281, 0.10988947346381712, -0.18058499357287297, -0.16661385478852153, 0.3819482613747057, -0.005511653585065352, -0.1820817761972808, 0.2068113644705399, -0.1622284489700146, -0.14893131206432977, 0.04982023072641408, 0.12980460950679945, 0.10704280487506797, -0.13668653938899902, 0.12331792551987364, -0.03684510129607046, 0.14048427748575545, -0.016610913909971714, 0.11953687867999338, 0.2027849931465952, 0.06380636945546589, 0.04502739110275319, 0.1195035926066339, 0.011744531431121, -0.17988708693730204, -0.358221595763768, -0.1864484744473246, -0.2204149785337218, 0.08557963691955113, 0.007065824388471236, -0.16510472976063428, 0.41276597641735224, 0.20372049358526342, 0.20887564290968472, 0.009560781906832728, 0.24534890138168344, 0.08564554450404421, 0.08637506772943757, -0.0008803044788931546, 0.24864305773384363, 0.23040613476513772, 0.06647501798477351, -0.16610107752249428, 0.02735690629567232, 0.05615639490516562]
|
1,803.04994
|
On the Algebra in Boole's Laws of Thought
|
This article explores the ideas that went into George Boole's development of
an algebra for logical inference in his book The Laws of Thought. We explore in
particular his wife Mary Boole's claim that he was deeply influenced by Indian
logic and argue that his work was more than a framework for processing
propositions. By exploring parallels between his work and Indian logic, we are
able to explain several peculiarities of this work.
|
cs.AI
|
this article explores the ideas that went into george booles development of an algebra for logical inference in his book the laws of thought we explore in particular his wife mary booles claim that he was deeply influenced by indian logic and argue that his work was more than a framework for processing propositions by exploring parallels between his work and indian logic we are able to explain several peculiarities of this work
|
[['this', 'article', 'explores', 'the', 'ideas', 'that', 'went', 'into', 'george', 'booles', 'development', 'of', 'an', 'algebra', 'for', 'logical', 'inference', 'in', 'his', 'book', 'the', 'laws', 'of', 'thought', 'we', 'explore', 'in', 'particular', 'his', 'wife', 'mary', 'booles', 'claim', 'that', 'he', 'was', 'deeply', 'influenced', 'by', 'indian', 'logic', 'and', 'argue', 'that', 'his', 'work', 'was', 'more', 'than', 'a', 'framework', 'for', 'processing', 'propositions', 'by', 'exploring', 'parallels', 'between', 'his', 'work', 'and', 'indian', 'logic', 'we', 'are', 'able', 'to', 'explain', 'several', 'peculiarities', 'of', 'this', 'work']]
|
[-0.04899458692900275, 0.09203617543493213, -0.14467498278309118, 0.1193958024003173, -0.17464931415033538, -0.1335832992989621, 0.09063205046400633, 0.3034737268462777, -0.22126966874969944, -0.3153951553092019, 0.05461042708309036, -0.2560734891728179, -0.23039695288832873, 0.1881350618850899, -0.215952355739954, -0.05974278874593238, 0.004005221616515048, 0.016261465617851037, -0.01574942166917026, -0.30941809465062536, 0.3268714519600346, 0.10671496953917285, 0.2761552529281949, 0.01776977671846135, 0.06481091174945293, 0.04449411352764662, -0.10076525661303368, -0.025286027013439023, -0.14062891262477784, 0.18528583326874531, 0.30519141119024523, 0.24810535387990817, 0.380346136448318, -0.4701020051151106, -0.14858404358160004, 0.025435839256603424, 0.10311385977866562, 0.0727244269498305, 0.021164678527346863, -0.32801442789169005, 0.005873135067777683, -0.23329551789705474, -0.08114012653543932, -0.04451127578695751, 0.11029868644394286, -0.04625523231974612, -0.11819691641881347, -0.0530446912273637, 0.21455620710214932, 0.10932098919755384, -0.012944142685003886, -0.12227903912481788, 0.08189649934791131, 0.09772974680726455, 0.04213284425061094, 0.020717842325772326, 0.07413789241459884, -0.07767849865254678, -0.2120627848916266, 0.3328388256135665, 0.017374687217939836, -0.10305798930843195, 0.1289762875754131, -0.11774939832226565, -0.221668457797384, -0.0022070886031405564, 0.10454638529415816, 0.08719730699332813, -0.18717416822399996, 0.09453176176143581, -0.0675412099680876, 0.14395821187007304, 0.17115556995371636, -0.03998886509830362, 0.21206849377143056, 0.15394733442401845, -0.0753041538473678, 0.12623469066911389, 0.018764273569702287, -0.1444240747887182, -0.25812580348439007, -0.2444154468990148, -0.13623318336393736, 0.04577903994295287, 0.061257768754467805, -0.05502846044781681, 0.33544598232750616, 0.2044752661955275, 0.09122794193585645, 0.04035752031422692, 0.23479307678285732, 0.07163419807489246, 0.0233262039159667, 0.06166992633769365, 0.23055890554957703, 0.1397147821326268, 0.1836019062424359, -0.10854711475437634, 0.12663626452040386, 0.07235924201086164]
|
1,803.04995
|
Are thermal fluctuations the sole reason for finite longitudinal
resistance in quantum anomalous Hall experiments?
|
In some recent experiments [A. J. Bestwick, et. al., Phys. Rev. Lett. 114,
187201 (2015), Cui-Zu Chang, et. al., Nat. Materials. 14, 473-477 (2015)] it
has been shown that in observations of the quantum anomalous Hall (QAH) effect
the longitudinal resistance $R_L$ increases as temperature $T$ increases, while
Hall resistance $R_H$ loses its quantization with increase in $T$. This
behavior was explained due to increased thermal fluctuations as $T$ increases.
We show that similar effects arise in QAH samples with quasi-helical edge modes
as disorder increases in presence of inelastic scattering or otherwise even at
temperature $T=0$.
|
cond-mat.mes-hall
|
in some recent experiments a j bestwick et al phys rev lett 114 187201 2015 cuizu chang et al nat materials 14 473477 2015 it has been shown that in observations of the quantum anomalous hall qah effect the longitudinal resistance r_l increases as temperature t increases while hall resistance r_h loses its quantization with increase in t this behavior was explained due to increased thermal fluctuations as t increases we show that similar effects arise in qah samples with quasihelical edge modes as disorder increases in presence of inelastic scattering or otherwise even at temperature t0
|
[['in', 'some', 'recent', 'experiments', 'a', 'j', 'bestwick', 'et', 'al', 'phys', 'rev', 'lett', '114', '187201', '2015', 'cuizu', 'chang', 'et', 'al', 'nat', 'materials', '14', '473477', '2015', 'it', 'has', 'been', 'shown', 'that', 'in', 'observations', 'of', 'the', 'quantum', 'anomalous', 'hall', 'qah', 'effect', 'the', 'longitudinal', 'resistance', 'r_l', 'increases', 'as', 'temperature', 't', 'increases', 'while', 'hall', 'resistance', 'r_h', 'loses', 'its', 'quantization', 'with', 'increase', 'in', 't', 'this', 'behavior', 'was', 'explained', 'due', 'to', 'increased', 'thermal', 'fluctuations', 'as', 't', 'increases', 'we', 'show', 'that', 'similar', 'effects', 'arise', 'in', 'qah', 'samples', 'with', 'quasihelical', 'edge', 'modes', 'as', 'disorder', 'increases', 'in', 'presence', 'of', 'inelastic', 'scattering', 'or', 'otherwise', 'even', 'at', 'temperature', 't0']]
|
[-0.14122892329543632, 0.2637916503652455, -0.02738278149627149, -0.09847814108349105, -0.055960451272573875, -0.15862940605283973, 0.07747253439478338, 0.30218008738209273, -0.19167926717311778, -0.37121098968101307, -0.0342825134643948, -0.39354173878723003, -0.19240391449854174, 0.14876669916036994, -0.11327359827601925, 0.024543899843999323, -0.04092505927930804, -0.0896652731648151, -0.052758172324095715, -0.31206018977025723, 0.1293617748516671, 0.14578446069053633, 0.3316932990766215, 0.10951932664821915, 0.030058937476690303, 0.0379246310628158, 0.023066748983840993, 0.10929443781323572, -0.17132488644680013, -0.15084901481787574, 0.24828820926275977, -0.09232486450073725, 0.217389611708139, -0.3817452778048972, -0.25458468830193137, 0.05124821685789589, 0.09197664139990477, 0.14773423436464386, -0.0019802021945113358, -0.2971347383064951, 0.053636314924509126, -0.20988967584228105, -0.13920680711422354, -0.06627599574239092, 0.20220649676357813, -0.09677633377933934, -0.27041432722174424, 0.2291953652834599, 0.09509639167524081, 0.07738962054173364, -0.019366995620967307, -0.17041386967584332, -0.08972426591579744, -0.028693983140599694, 0.021217386991261168, 0.1171300118848523, 0.158641466806504, -0.10485181681306517, -0.17866646030798872, 0.26210849203090086, -0.07277256165175362, -0.015565128402507051, 0.22220769921872527, -0.1801384897862977, -0.10451147983351008, 0.11549851912608806, 0.12115483969806674, 0.07236776682994071, -0.04597861687355536, 0.16287761079543767, -0.04622920959732158, 0.10865271851133079, 0.12583758334252745, 0.06486741005210206, 0.1890014422799837, 0.14176804326137804, -0.02688113641132541, 0.12026238824151694, -0.1282610945463022, -0.007786879442295337, -0.22262947180090434, -0.16201501302024784, -0.2307720606988098, 0.11933271231209026, 0.019379832038774768, -0.1187154853854581, 0.2788075991173057, 0.20484327103428981, 0.2992821168352632, -0.04935640991823946, 0.19327692116828674, 0.1370487313264327, 0.04131174084056723, 0.17015999730458445, 0.2847773479585699, 0.2034715001243464, 0.19686129172406894, -0.32031634454912644, 0.08774870770928905, -0.044375422811928265]
|
1,803.04996
|
Comparing Task Simplifications to Learn Closed-Loop Object Picking Using
Deep Reinforcement Learning
|
Enabling autonomous robots to interact in unstructured environments with
dynamic objects requires manipulation capabilities that can deal with clutter,
changes, and objects' variability. This paper presents a comparison of
different reinforcement learning-based approaches for object picking with a
robotic manipulator. We learn closed-loop policies mapping depth camera inputs
to motion commands and compare different approaches to keep the problem
tractable, including reward shaping, curriculum learning and using a policy
pre-trained on a task with a reduced action set to warm-start the full problem.
For efficient and more flexible data collection, we train in simulation and
transfer the policies to a real robot. We show that using curriculum learning,
policies learned with a sparse reward formulation can be trained at similar
rates as with a shaped reward. These policies result in success rates
comparable to the policy initialized on the simplified task. We could
successfully transfer these policies to the real robot with only minor
modifications of the depth image filtering. We found that using a heuristic to
warm-start the training was useful to enforce desired behavior, while the
policies trained from scratch using a curriculum learned better to cope with
unseen scenarios where objects are removed.
|
cs.RO
|
enabling autonomous robots to interact in unstructured environments with dynamic objects requires manipulation capabilities that can deal with clutter changes and objects variability this paper presents a comparison of different reinforcement learningbased approaches for object picking with a robotic manipulator we learn closedloop policies mapping depth camera inputs to motion commands and compare different approaches to keep the problem tractable including reward shaping curriculum learning and using a policy pretrained on a task with a reduced action set to warmstart the full problem for efficient and more flexible data collection we train in simulation and transfer the policies to a real robot we show that using curriculum learning policies learned with a sparse reward formulation can be trained at similar rates as with a shaped reward these policies result in success rates comparable to the policy initialized on the simplified task we could successfully transfer these policies to the real robot with only minor modifications of the depth image filtering we found that using a heuristic to warmstart the training was useful to enforce desired behavior while the policies trained from scratch using a curriculum learned better to cope with unseen scenarios where objects are removed
|
[['enabling', 'autonomous', 'robots', 'to', 'interact', 'in', 'unstructured', 'environments', 'with', 'dynamic', 'objects', 'requires', 'manipulation', 'capabilities', 'that', 'can', 'deal', 'with', 'clutter', 'changes', 'and', 'objects', 'variability', 'this', 'paper', 'presents', 'a', 'comparison', 'of', 'different', 'reinforcement', 'learningbased', 'approaches', 'for', 'object', 'picking', 'with', 'a', 'robotic', 'manipulator', 'we', 'learn', 'closedloop', 'policies', 'mapping', 'depth', 'camera', 'inputs', 'to', 'motion', 'commands', 'and', 'compare', 'different', 'approaches', 'to', 'keep', 'the', 'problem', 'tractable', 'including', 'reward', 'shaping', 'curriculum', 'learning', 'and', 'using', 'a', 'policy', 'pretrained', 'on', 'a', 'task', 'with', 'a', 'reduced', 'action', 'set', 'to', 'warmstart', 'the', 'full', 'problem', 'for', 'efficient', 'and', 'more', 'flexible', 'data', 'collection', 'we', 'train', 'in', 'simulation', 'and', 'transfer', 'the', 'policies', 'to', 'a', 'real', 'robot', 'we', 'show', 'that', 'using', 'curriculum', 'learning', 'policies', 'learned', 'with', 'a', 'sparse', 'reward', 'formulation', 'can', 'be', 'trained', 'at', 'similar', 'rates', 'as', 'with', 'a', 'shaped', 'reward', 'these', 'policies', 'result', 'in', 'success', 'rates', 'comparable', 'to', 'the', 'policy', 'initialized', 'on', 'the', 'simplified', 'task', 'we', 'could', 'successfully', 'transfer', 'these', 'policies', 'to', 'the', 'real', 'robot', 'with', 'only', 'minor', 'modifications', 'of', 'the', 'depth', 'image', 'filtering', 'we', 'found', 'that', 'using', 'a', 'heuristic', 'to', 'warmstart', 'the', 'training', 'was', 'useful', 'to', 'enforce', 'desired', 'behavior', 'while', 'the', 'policies', 'trained', 'from', 'scratch', 'using', 'a', 'curriculum', 'learned', 'better', 'to', 'cope', 'with', 'unseen', 'scenarios', 'where', 'objects', 'are', 'removed']]
|
[-0.0333514723894709, 0.02205555168412892, -0.08725146874452808, 0.04516006838197687, -0.1823725230369375, -0.21788555875002424, 0.05309393426595845, 0.5234171160572798, -0.27720914763512505, -0.37427187690568364, 0.07082199678121952, -0.22079914809461226, -0.16491605024737288, 0.19344650036702882, -0.19429127859635925, 0.1120594952906463, 0.15006363194623526, 0.018450107769945597, -0.057818049159879814, -0.26072519033617453, 0.30031581762441606, 0.04030747866324548, 0.2608327487914536, -0.05691161888119366, 0.19366326053063765, -0.009049176934667582, 0.029901610807354123, 0.013508774649009717, -0.04142304190029289, 0.15419039218684294, 0.37266827296294575, 0.20450318848942312, 0.3164277210408746, -0.4173675371447996, -0.19726417432729232, 0.0984496011313203, 0.10659147745083865, 0.11673178754471318, -0.04055948020114946, -0.3706719939114659, 0.1000918448842974, -0.1944206355719314, -0.026343378573370983, -0.13079858481484866, -0.04016155731503149, -0.008038260453387772, -0.3524971497577748, -0.052684705116137466, 0.02141915998696017, 0.06289232173716003, -0.09566605383558768, -0.08230813442163967, 0.013500868360635502, 0.21421751293011618, 0.024638878343132685, 0.061096566382377426, 0.2096032952837532, -0.2114933585577017, -0.1676536410909184, 0.3678763542295795, -0.01560877462164784, -0.23343493251488734, 0.22945560503047796, -0.031644417465978056, -0.1092200066623449, 0.1282341273748601, 0.2893011446719115, 0.1323677094543961, -0.16738009341698132, -0.024246154230964673, -0.022243925715958207, 0.19936953647755923, 0.04242070012474052, -0.0574861017545229, 0.15319598769416856, 0.2335752486512635, 0.08446207986811974, 0.13978913315864072, -0.0639034356335083, -0.10476871413340298, -0.20245901189687454, -0.056929959143435925, -0.16227491519280843, -0.021994416087590233, -0.085850309302222, -0.08625864891945063, 0.36257798034621747, 0.22805594451421377, 0.2103458046794356, 0.16636946029980115, 0.3590641641058028, 0.049638140895620714, 0.1101668583257694, 0.12362427250256439, 0.17048855601662619, -0.034992478640598, 0.1567971365614224, -0.19013867614320384, 0.12134783661197301, 0.006532717220561236]
|
1,803.04997
|
The initial ideal of generic sequences and Fr\"{o}berg's Conjecture
|
Let $K$ be an infinite field and let $I = (f_1,\cdots,f_r)$ be an ideal in the polynomial ring $R = K[x_1,\cdots,x_n]$ generated by generic forms of degrees $d_1,\cdots,d_r$. A longstanding conjecture by Fr\"{o}berg predicts the shape of the Hilbert function of $R/I.$ In 2010 Pardue stated a conjecture on the initial ideal of $n$ generic forms with respect to the deg-revlex order and he proved that it is equivalent to Fr\"{o}berg's Conjecture. We study Pardue's Conjecture and we prove it under suitable conditions on the degrees of the forms. This yields a partial solution to Fr\"{o}berg's Conjecture in the case $r \leq n+2$ over an infinite field of any characteristic.
|
math.AC
|
let k be an infinite field and let i f_1cdotsf_r be an ideal in the polynomial ring r kx_1cdotsx_n generated by generic forms of degrees d_1cdotsd_r a longstanding conjecture by froberg predicts the shape of the hilbert function of ri in 2010 pardue stated a conjecture on the initial ideal of n generic forms with respect to the degrevlex order and he proved that it is equivalent to frobergs conjecture we study pardues conjecture and we prove it under suitable conditions on the degrees of the forms this yields a partial solution to frobergs conjecture in the case r leq n2 over an infinite field of any characteristic
|
[['let', 'k', 'be', 'an', 'infinite', 'field', 'and', 'let', 'i', 'f_1cdotsf_r', 'be', 'an', 'ideal', 'in', 'the', 'polynomial', 'ring', 'r', 'kx_1cdotsx_n', 'generated', 'by', 'generic', 'forms', 'of', 'degrees', 'd_1cdotsd_r', 'a', 'longstanding', 'conjecture', 'by', 'froberg', 'predicts', 'the', 'shape', 'of', 'the', 'hilbert', 'function', 'of', 'ri', 'in', '2010', 'pardue', 'stated', 'a', 'conjecture', 'on', 'the', 'initial', 'ideal', 'of', 'n', 'generic', 'forms', 'with', 'respect', 'to', 'the', 'degrevlex', 'order', 'and', 'he', 'proved', 'that', 'it', 'is', 'equivalent', 'to', 'frobergs', 'conjecture', 'we', 'study', 'pardues', 'conjecture', 'and', 'we', 'prove', 'it', 'under', 'suitable', 'conditions', 'on', 'the', 'degrees', 'of', 'the', 'forms', 'this', 'yields', 'a', 'partial', 'solution', 'to', 'frobergs', 'conjecture', 'in', 'the', 'case', 'r', 'leq', 'n2', 'over', 'an', 'infinite', 'field', 'of', 'any', 'characteristic']]
|
[-0.1874029818080509, 0.08560196152603357, -0.11290176952472673, 9.52094650039306e-06, -0.00012032715200733107, -0.15789692188487747, -0.047971185301251426, 0.2874577818975712, -0.288811166323005, -0.23491706006517724, 0.08438812091145127, -0.21160510787516473, -0.11602278384424818, 0.1824941424599204, -0.0925054994608777, -0.02519994811154902, 0.020153185247461528, 0.07167061145166652, -0.052536897896341264, -0.3450731471216736, 0.33789417335691935, 0.008410142954044905, 0.1851446017390117, 0.08585439244220303, 0.09856992604461713, 0.055414245792829976, 0.022031879948022273, 0.030403841882406805, -0.20520408181374267, 0.10742335711928228, 0.2425906308568441, 0.1423366623729145, 0.2551138855051249, -0.3620442494642563, -0.1322657567238471, 0.1650523561088798, 0.10292341517141232, 0.026669104879077237, 0.005752139747178612, -0.24168967328240307, 0.15519809156047323, -0.1449428501789673, -0.24374137586878183, -0.027967796025152963, 0.10630058722185473, -0.022142763642023056, -0.33735237988786626, 0.011633107017797347, 0.12928076185142764, 0.11496904316188122, -0.059818685766703523, -0.09040588918679322, -0.009503293710832413, 0.023288424957382422, -0.008628586801933125, 0.06888441289685523, -0.0023134011157358494, -0.11444434349631102, -0.07867203627784665, 0.34907805951885307, -0.09431005797243695, -0.19316289504954162, 0.1299763453963141, -0.15997125392851347, -0.10752605301184723, 0.11115142540970388, 0.07395989695886293, 0.17022781925669944, -0.023162362353804592, 0.19877068407200008, -0.1766437993814739, 0.14535342353897598, 0.12310241259491214, -0.03331376710243953, 0.16355159676347214, 0.0388705967567288, 0.09350741492128761, 0.15341409116472976, 0.010697503336884368, -0.011397857675687052, -0.33494845405220985, -0.21818420488853008, -0.16745200760375994, 0.1640778585928134, -0.10302442754940645, -0.13616278622066602, 0.36151283108987486, 0.10720022856436956, 0.18738669222064067, 0.07149105357865874, 0.17691234810850942, 0.1277647398842069, 0.021324340764504787, 0.09031670187295486, 0.12032766000797543, 0.21793232352669853, -0.007888153774099639, -0.15962429239432543, 0.02798096833822246, 0.12968665268719912]
|
1,803.04998
|
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with
Expensive-to-Evaluate Edges
|
Motion-planning problems, such as manipulation in cluttered environments,
often require a collision-free shortest path to be computed quickly given a
roadmap graph. Typically, the computational cost of evaluating whether an edge
of the roadmap graph is collision-free dominates the running time of search
algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been
proposed to reduce the number of edge evaluations by employing a lazy lookahead
(one-step lookahead and infinite-step lookahead, respectively). However, this
comes at the expense of additional graph operations: the larger the lookahead,
the more the graph operations that are typically required. We propose Lazy
Receding-Horizon A* (LRA*) to minimize the total planning time by balancing
edge evaluations and graph operations. Endowed with a lazy lookahead, LRA*
represents a family of lazy shortest-path graph-search algorithms that
generalizes LWA* and LazySP. We analyze the theoretic properties of LRA* and
demonstrate empirically that, in many cases, to minimize the total planning
time, the algorithm requires an intermediate lazy lookahead. Namely, using an
intermediate lazy lookahead, our algorithm outperforms both LWA* and LazySP.
These experiments span simulated random worlds in $\mathbb{R}^2$ and
$\mathbb{R}^4$, and manipulation problems using a 7-DOF manipulator.
|
cs.RO
|
motionplanning problems such as manipulation in cluttered environments often require a collisionfree shortest path to be computed quickly given a roadmap graph typically the computational cost of evaluating whether an edge of the roadmap graph is collisionfree dominates the running time of search algorithms algorithms such as lazy weighted a lwa and lazysp have been proposed to reduce the number of edge evaluations by employing a lazy lookahead onestep lookahead and infinitestep lookahead respectively however this comes at the expense of additional graph operations the larger the lookahead the more the graph operations that are typically required we propose lazy recedinghorizon a lra to minimize the total planning time by balancing edge evaluations and graph operations endowed with a lazy lookahead lra represents a family of lazy shortestpath graphsearch algorithms that generalizes lwa and lazysp we analyze the theoretic properties of lra and demonstrate empirically that in many cases to minimize the total planning time the algorithm requires an intermediate lazy lookahead namely using an intermediate lazy lookahead our algorithm outperforms both lwa and lazysp these experiments span simulated random worlds in mathbbr2 and mathbbr4 and manipulation problems using a 7dof manipulator
|
[['motionplanning', 'problems', 'such', 'as', 'manipulation', 'in', 'cluttered', 'environments', 'often', 'require', 'a', 'collisionfree', 'shortest', 'path', 'to', 'be', 'computed', 'quickly', 'given', 'a', 'roadmap', 'graph', 'typically', 'the', 'computational', 'cost', 'of', 'evaluating', 'whether', 'an', 'edge', 'of', 'the', 'roadmap', 'graph', 'is', 'collisionfree', 'dominates', 'the', 'running', 'time', 'of', 'search', 'algorithms', 'algorithms', 'such', 'as', 'lazy', 'weighted', 'a', 'lwa', 'and', 'lazysp', 'have', 'been', 'proposed', 'to', 'reduce', 'the', 'number', 'of', 'edge', 'evaluations', 'by', 'employing', 'a', 'lazy', 'lookahead', 'onestep', 'lookahead', 'and', 'infinitestep', 'lookahead', 'respectively', 'however', 'this', 'comes', 'at', 'the', 'expense', 'of', 'additional', 'graph', 'operations', 'the', 'larger', 'the', 'lookahead', 'the', 'more', 'the', 'graph', 'operations', 'that', 'are', 'typically', 'required', 'we', 'propose', 'lazy', 'recedinghorizon', 'a', 'lra', 'to', 'minimize', 'the', 'total', 'planning', 'time', 'by', 'balancing', 'edge', 'evaluations', 'and', 'graph', 'operations', 'endowed', 'with', 'a', 'lazy', 'lookahead', 'lra', 'represents', 'a', 'family', 'of', 'lazy', 'shortestpath', 'graphsearch', 'algorithms', 'that', 'generalizes', 'lwa', 'and', 'lazysp', 'we', 'analyze', 'the', 'theoretic', 'properties', 'of', 'lra', 'and', 'demonstrate', 'empirically', 'that', 'in', 'many', 'cases', 'to', 'minimize', 'the', 'total', 'planning', 'time', 'the', 'algorithm', 'requires', 'an', 'intermediate', 'lazy', 'lookahead', 'namely', 'using', 'an', 'intermediate', 'lazy', 'lookahead', 'our', 'algorithm', 'outperforms', 'both', 'lwa', 'and', 'lazysp', 'these', 'experiments', 'span', 'simulated', 'random', 'worlds', 'in', 'mathbbr2', 'and', 'mathbbr4', 'and', 'manipulation', 'problems', 'using', 'a', '7dof', 'manipulator']]
|
[-0.130495255628072, 0.08555037837224215, -0.07050243100820808, 0.04355247518105898, -0.11548040876126227, -0.16109977051746682, 0.13221790252525048, 0.45475059746725793, -0.280105784026091, -0.3412529619466416, 0.13491507039240483, -0.24174758323094162, -0.16007974426126262, 0.17650113535031173, -0.11731964729430426, 0.11118525777419563, 0.13803819464828848, 0.023862232478980634, -0.02854692926393909, -0.2669971451312752, 0.187329999451606, 0.05890500419142578, 0.23117044234095374, -0.002315184452224154, 0.13097914813685443, 0.05417686889086326, -0.037172030380437114, 0.06440871880953598, -0.08472522895920065, 0.06987731518650737, 0.28729442542316974, 0.2197452647948618, 0.3384909039499083, -0.47077923096124624, -0.14241999208995063, 0.14649803299956451, 0.11546427212063766, 0.07201618415516957, 0.008679028840181976, -0.2647895064631787, 0.09860131791356253, -0.14905360724272518, -0.001448635744357792, -0.08399883977655993, -0.009962884003471117, 0.020848617546410726, -0.2977245014141469, -0.06940061202112702, 0.03454026208661768, 0.020773548256935708, 0.026282815206892945, -0.13544251214868078, 0.009344678189033099, 0.11779775549318099, -0.03427810788101245, 0.07412360983031856, 0.11515726079718054, -0.12377932389608759, -0.2764947441294983, 0.3860582100808945, -0.026724019102402963, -0.1651708465142292, 0.14462693319607448, -0.014919805296813138, -0.14324586423511695, 0.14241549760724106, 0.20205982348610027, 0.1847620326007018, -0.09285448021546472, 0.08191688053678566, -0.038817917768028565, 0.13650507249379493, 0.07136763737677636, 0.019963922577517224, 0.0912078876066289, 0.23107423548935913, 0.19690000006357877, 0.15928744096587857, -0.053891701354586985, -0.13197999245797595, -0.2403716905246256, -0.14581570552642611, -0.19981805582816983, -0.04984279115888057, -0.13196160638047635, -0.18392068184402888, 0.3561038701736834, 0.17965258285403252, 0.15450748005362888, 0.19265244897542289, 0.36286031444130157, 0.08461116322814632, 0.09116541724264, 0.1625531736499397, 0.10248843912995653, 0.013915374329371843, 0.08349533947208936, -0.24241523234862447, 0.09189108248028788, 0.0786008739087265]
|
1,803.04999
|
Removing both Internal and Unrealistic Energy-Generating Cycles in Flux
Balance Analysis
|
Constraint-based stoichiometric models are ubiquitous in metabolic research,
with Flux Balance Analysis (FBA) being the most widely used method to describe
metabolic phenotypes of cells growing in steady-state. Of the many variants of
constrain-based modelling methods published throughout the years, only few have
focused on thermodynamic issues, in particular the elimination of non-physical
and non-physiological cyclic fluxes. In this work, we revisit two of these
methods, namely thermodynamic FBA and loopless FBA, and analyze the strengths
and weaknesses of each one. Finally, we suggest a compromise denoted
semi-thermodynamic FBA (st-FBA) which imposes stronger thermodynamic constrains
on the flux polytope compared to loopless FBA, without requiring a large set of
thermodynamic parameters as in the case of thermodynamic FBA. We show that
st-FBA is a useful and simple way to eliminate thermodynamically infeasible
cycles that generate ATP.
|
q-bio.MN
|
constraintbased stoichiometric models are ubiquitous in metabolic research with flux balance analysis fba being the most widely used method to describe metabolic phenotypes of cells growing in steadystate of the many variants of constrainbased modelling methods published throughout the years only few have focused on thermodynamic issues in particular the elimination of nonphysical and nonphysiological cyclic fluxes in this work we revisit two of these methods namely thermodynamic fba and loopless fba and analyze the strengths and weaknesses of each one finally we suggest a compromise denoted semithermodynamic fba stfba which imposes stronger thermodynamic constrains on the flux polytope compared to loopless fba without requiring a large set of thermodynamic parameters as in the case of thermodynamic fba we show that stfba is a useful and simple way to eliminate thermodynamically infeasible cycles that generate atp
|
[['constraintbased', 'stoichiometric', 'models', 'are', 'ubiquitous', 'in', 'metabolic', 'research', 'with', 'flux', 'balance', 'analysis', 'fba', 'being', 'the', 'most', 'widely', 'used', 'method', 'to', 'describe', 'metabolic', 'phenotypes', 'of', 'cells', 'growing', 'in', 'steadystate', 'of', 'the', 'many', 'variants', 'of', 'constrainbased', 'modelling', 'methods', 'published', 'throughout', 'the', 'years', 'only', 'few', 'have', 'focused', 'on', 'thermodynamic', 'issues', 'in', 'particular', 'the', 'elimination', 'of', 'nonphysical', 'and', 'nonphysiological', 'cyclic', 'fluxes', 'in', 'this', 'work', 'we', 'revisit', 'two', 'of', 'these', 'methods', 'namely', 'thermodynamic', 'fba', 'and', 'loopless', 'fba', 'and', 'analyze', 'the', 'strengths', 'and', 'weaknesses', 'of', 'each', 'one', 'finally', 'we', 'suggest', 'a', 'compromise', 'denoted', 'semithermodynamic', 'fba', 'stfba', 'which', 'imposes', 'stronger', 'thermodynamic', 'constrains', 'on', 'the', 'flux', 'polytope', 'compared', 'to', 'loopless', 'fba', 'without', 'requiring', 'a', 'large', 'set', 'of', 'thermodynamic', 'parameters', 'as', 'in', 'the', 'case', 'of', 'thermodynamic', 'fba', 'we', 'show', 'that', 'stfba', 'is', 'a', 'useful', 'and', 'simple', 'way', 'to', 'eliminate', 'thermodynamically', 'infeasible', 'cycles', 'that', 'generate', 'atp']]
|
[-0.10289478651247919, 0.07143353373976424, -0.007671616532289508, 0.07928772162730721, -0.050810404707480106, -0.15684465145000792, 0.12022401281953507, 0.3576411127311682, -0.2518663030747451, -0.2853895367377184, 0.044991133395039164, -0.24174397547066098, -0.13437176761781852, 0.20355053225428105, -0.08554447281604746, 0.05433760379232946, 0.06110096926744463, 0.010894369393953997, -0.028061139690125303, -0.21675221081717277, 0.26566540966318414, 0.04272340466691689, 0.3115583458266249, 0.07598158565462765, 0.0834537520263852, -0.072134381509386, -0.040853476117869526, 0.06335188834010765, -0.13786895389928372, 0.11585250271265536, 0.24577955501701415, 0.16646374532049804, 0.24722817277705128, -0.48817221087996254, -0.24233687124356176, 0.17459899616060834, 0.1416318641382862, 0.12967110978647586, 0.008767825458727946, -0.14306696224428544, 0.08280097561047031, -0.15915701990756628, -0.07107690710814274, -0.13706942297126676, 0.009036577066801714, 0.037004253865399565, -0.2204890393609689, 0.057722730075263164, 0.0252966544918088, 0.10439097933527647, -0.042956623905355984, -0.1667247069646802, -0.07371579420798684, 0.10083487697270219, 0.10124444069559545, -0.012716227098170555, 0.15491362761311006, -0.1124858153630295, -0.13041376221614578, 0.3500202912061165, -0.027254695646468353, -0.18267175542882108, 0.2230978503639838, -0.07613652692684396, -0.24393298497042534, 0.10460627821951428, 0.11931373654145071, 0.12601021618342423, -0.21574920956503996, 0.051233491360714346, -0.007856311020794126, 0.15617694615502842, 0.08526889840846485, 0.00885445070735207, 0.16834034257088648, 0.19782506334277886, 0.06695845783961528, 0.13507827235188222, -0.08051231318082004, -0.12764460759618404, -0.2700634687207639, -0.1166868380087456, -0.11533166737838958, 0.03651885984546618, -0.08649881462737209, -0.1817152553527249, 0.3926525993209163, 0.17989533151514037, 0.19477280342548373, 0.026694014240726545, 0.304393121584629, 0.07991861006446539, 0.10495893363699768, 0.052610866175117815, 0.26050233630689257, 0.1347417032741236, 0.1205245025639394, -0.2332882540949592, 0.12104709382578166, 0.06422914990319194]
|
1,803.05
|
Stellar obliquities and magnetic activities of Planet-Hosting Stars and
Eclipsing Binaries based on Transit Chord Correlation
|
The light curve of an eclipsing system shows anomalies whenever the eclipsing
body passes in front of active regions on the eclipsed star. In some cases, the
pattern of anomalies can be used to determine the obliquity $\Psi$ of the
eclipsed star. Here we present a method for detecting and analyzing these
patterns, based on a statistical test for correlations between the anomalies
observed in a sequence of eclipses. Compared to previous methods, ours makes
fewer assumptions and is easier to automate. We apply it to a sample of 64
stars with transiting planets and 24 eclipsing binaries for which precise
space-based data are available, and for which there was either some indication
of flux anomalies or a previously reported obliquity measurement. We were able
to determine obliquities for ten stars with hot Jupiters. In particular we
found $\Psi \lesssim$10$^\circ$ for Kepler-45, which is only the second M dwarf
with a measured obliquity. The other 8 cases are G and K stars with low
obliquities. Among the eclipsing binaries, we were able to determine
obliquities in 8 cases, all of which are consistent with zero. Our results also
reveal some common patterns of stellar activity for magnetically active G and K
stars, including persistently active longitudes.
|
astro-ph.EP astro-ph.SR
|
the light curve of an eclipsing system shows anomalies whenever the eclipsing body passes in front of active regions on the eclipsed star in some cases the pattern of anomalies can be used to determine the obliquity psi of the eclipsed star here we present a method for detecting and analyzing these patterns based on a statistical test for correlations between the anomalies observed in a sequence of eclipses compared to previous methods ours makes fewer assumptions and is easier to automate we apply it to a sample of 64 stars with transiting planets and 24 eclipsing binaries for which precise spacebased data are available and for which there was either some indication of flux anomalies or a previously reported obliquity measurement we were able to determine obliquities for ten stars with hot jupiters in particular we found psi lesssim10circ for kepler45 which is only the second m dwarf with a measured obliquity the other 8 cases are g and k stars with low obliquities among the eclipsing binaries we were able to determine obliquities in 8 cases all of which are consistent with zero our results also reveal some common patterns of stellar activity for magnetically active g and k stars including persistently active longitudes
|
[['the', 'light', 'curve', 'of', 'an', 'eclipsing', 'system', 'shows', 'anomalies', 'whenever', 'the', 'eclipsing', 'body', 'passes', 'in', 'front', 'of', 'active', 'regions', 'on', 'the', 'eclipsed', 'star', 'in', 'some', 'cases', 'the', 'pattern', 'of', 'anomalies', 'can', 'be', 'used', 'to', 'determine', 'the', 'obliquity', 'psi', 'of', 'the', 'eclipsed', 'star', 'here', 'we', 'present', 'a', 'method', 'for', 'detecting', 'and', 'analyzing', 'these', 'patterns', 'based', 'on', 'a', 'statistical', 'test', 'for', 'correlations', 'between', 'the', 'anomalies', 'observed', 'in', 'a', 'sequence', 'of', 'eclipses', 'compared', 'to', 'previous', 'methods', 'ours', 'makes', 'fewer', 'assumptions', 'and', 'is', 'easier', 'to', 'automate', 'we', 'apply', 'it', 'to', 'a', 'sample', 'of', '64', 'stars', 'with', 'transiting', 'planets', 'and', '24', 'eclipsing', 'binaries', 'for', 'which', 'precise', 'spacebased', 'data', 'are', 'available', 'and', 'for', 'which', 'there', 'was', 'either', 'some', 'indication', 'of', 'flux', 'anomalies', 'or', 'a', 'previously', 'reported', 'obliquity', 'measurement', 'we', 'were', 'able', 'to', 'determine', 'obliquities', 'for', 'ten', 'stars', 'with', 'hot', 'jupiters', 'in', 'particular', 'we', 'found', 'psi', 'lesssim10circ', 'for', 'kepler45', 'which', 'is', 'only', 'the', 'second', 'm', 'dwarf', 'with', 'a', 'measured', 'obliquity', 'the', 'other', '8', 'cases', 'are', 'g', 'and', 'k', 'stars', 'with', 'low', 'obliquities', 'among', 'the', 'eclipsing', 'binaries', 'we', 'were', 'able', 'to', 'determine', 'obliquities', 'in', '8', 'cases', 'all', 'of', 'which', 'are', 'consistent', 'with', 'zero', 'our', 'results', 'also', 'reveal', 'some', 'common', 'patterns', 'of', 'stellar', 'activity', 'for', 'magnetically', 'active', 'g', 'and', 'k', 'stars', 'including', 'persistently', 'active', 'longitudes']]
|
[-0.1290011234286173, 0.1442063947169184, -0.06749471511390832, 0.08066146804542258, -0.1182185798803935, -0.12665988990537277, 0.10112716882182966, 0.37901881015064515, -0.15229139435672906, -0.37057485226314607, 0.07655475021896475, -0.3338810695335269, -0.10135582092263531, 0.24695258136475232, -0.08589692996309434, 0.0368925079368282, 0.10942631374431275, 0.03465906439530777, -0.034362057984874746, -0.28620959542952223, 0.2711074168316838, -0.002433827614820585, 0.07382105847638919, -0.044944612494465415, 0.049273176151100634, -0.07135696601145333, -0.04222251476958485, -0.019832214337541856, -0.14153129510899506, 0.03791083724851289, 0.2693958721224434, 0.12486707295813575, 0.14534490511003065, -0.3450237655828681, -0.20987025440284393, 0.09044308021392038, 0.15063607006152047, 0.047304157014345614, -0.040012154999620665, -0.23861000282894365, 0.1109931512485917, -0.14719175215435737, -0.1617095128826161, -0.041409002380763615, 0.09807306230976814, 0.036354717691769685, -0.28793317893997017, 0.06736060372176125, 0.05891708918256549, 0.1465686588071105, -0.10428313725775608, -0.15118817692656616, -0.03207962882886754, 0.09952651426854839, 0.06186958380815823, 0.06673901201702837, 0.11066232480739795, -0.07466661344146037, -0.05916893221210779, 0.3977411085376289, -0.08630709940590328, -0.08742702093611403, 0.2446490628792473, -0.21250478755228402, -0.18205185899420118, 0.1333154947655957, 0.16115102428579475, 0.159747992202685, -0.16969243009779147, -0.04553994815384901, -0.017829234938977694, 0.19378197650629572, 0.06774841164488618, 0.016787876990601056, 0.310659575793983, 0.11359652447139436, 0.033618433433357714, 0.1004934320842461, -0.22809746756740823, -0.021921654315892516, -0.21494468754021132, -0.10248185538391515, -0.1008812114340821, 0.01635588302231598, -0.0669421147573569, -0.12533899939323706, 0.3660751142743521, 0.13653300729602938, 0.1928639612614927, 0.01176728412804262, 0.2793868233699624, 0.0408024137504626, 0.09142025402156499, 0.13571972458214476, 0.3185629801459826, 0.16760003715980706, 0.07490626085867605, -0.22366133640852484, 0.10311414781594422, -0.028557895888324556]
|
1,803.05001
|
Graph Ranking and the Cost of Sybil Defense
|
Ranking functions such as PageRank assign numeric values (ranks) to nodes of
graphs, most notably the web graph. Node rankings are an integral part of
Internet search algorithms, since they can be used to order the results of
queries. However, these ranking functions are famously subject to attacks by
spammers, who modify the web graph in order to give their own pages more rank.
We characterize the interplay between rankers and spammers as a game. We define
the two critical features of this game, spam resistance and distortion, based
on how spammers spam and how rankers protect against spam. We observe that all
the ranking functions that are well-studied in the literature, including the
original formulation of PageRank, have poor spam resistance, poor distortion,
or both. Finally, we study Min-PPR, the form of PageRank used at Google itself,
but which has received no (theoretical or empirical) treatment in the
literature. We prove that Min-PPR has low distortion and high spam resistance.
A secondary benefit is that Min-PPR comes with an explicit cost function on
nodes that shows how important they are to the spammer; thus a ranker can focus
their spam-detection capacity on these vulnerable nodes. Both Min-PPR and its
associated cost function are straightforward to compute.
|
cs.DS cs.SI
|
ranking functions such as pagerank assign numeric values ranks to nodes of graphs most notably the web graph node rankings are an integral part of internet search algorithms since they can be used to order the results of queries however these ranking functions are famously subject to attacks by spammers who modify the web graph in order to give their own pages more rank we characterize the interplay between rankers and spammers as a game we define the two critical features of this game spam resistance and distortion based on how spammers spam and how rankers protect against spam we observe that all the ranking functions that are wellstudied in the literature including the original formulation of pagerank have poor spam resistance poor distortion or both finally we study minppr the form of pagerank used at google itself but which has received no theoretical or empirical treatment in the literature we prove that minppr has low distortion and high spam resistance a secondary benefit is that minppr comes with an explicit cost function on nodes that shows how important they are to the spammer thus a ranker can focus their spamdetection capacity on these vulnerable nodes both minppr and its associated cost function are straightforward to compute
|
[['ranking', 'functions', 'such', 'as', 'pagerank', 'assign', 'numeric', 'values', 'ranks', 'to', 'nodes', 'of', 'graphs', 'most', 'notably', 'the', 'web', 'graph', 'node', 'rankings', 'are', 'an', 'integral', 'part', 'of', 'internet', 'search', 'algorithms', 'since', 'they', 'can', 'be', 'used', 'to', 'order', 'the', 'results', 'of', 'queries', 'however', 'these', 'ranking', 'functions', 'are', 'famously', 'subject', 'to', 'attacks', 'by', 'spammers', 'who', 'modify', 'the', 'web', 'graph', 'in', 'order', 'to', 'give', 'their', 'own', 'pages', 'more', 'rank', 'we', 'characterize', 'the', 'interplay', 'between', 'rankers', 'and', 'spammers', 'as', 'a', 'game', 'we', 'define', 'the', 'two', 'critical', 'features', 'of', 'this', 'game', 'spam', 'resistance', 'and', 'distortion', 'based', 'on', 'how', 'spammers', 'spam', 'and', 'how', 'rankers', 'protect', 'against', 'spam', 'we', 'observe', 'that', 'all', 'the', 'ranking', 'functions', 'that', 'are', 'wellstudied', 'in', 'the', 'literature', 'including', 'the', 'original', 'formulation', 'of', 'pagerank', 'have', 'poor', 'spam', 'resistance', 'poor', 'distortion', 'or', 'both', 'finally', 'we', 'study', 'minppr', 'the', 'form', 'of', 'pagerank', 'used', 'at', 'google', 'itself', 'but', 'which', 'has', 'received', 'no', 'theoretical', 'or', 'empirical', 'treatment', 'in', 'the', 'literature', 'we', 'prove', 'that', 'minppr', 'has', 'low', 'distortion', 'and', 'high', 'spam', 'resistance', 'a', 'secondary', 'benefit', 'is', 'that', 'minppr', 'comes', 'with', 'an', 'explicit', 'cost', 'function', 'on', 'nodes', 'that', 'shows', 'how', 'important', 'they', 'are', 'to', 'the', 'spammer', 'thus', 'a', 'ranker', 'can', 'focus', 'their', 'spamdetection', 'capacity', 'on', 'these', 'vulnerable', 'nodes', 'both', 'minppr', 'and', 'its', 'associated', 'cost', 'function', 'are', 'straightforward', 'to', 'compute']]
|
[-0.10958805650496262, 0.01984146135481826, -0.07114637625327216, 0.11776944447380765, -0.14141959158798167, -0.18371984353603948, 0.11292928098790923, 0.4189514300992919, -0.254791728381162, -0.3232634817227577, 0.09774430618331215, -0.37893179697232043, -0.20664292912601812, 0.1489851972963301, -0.11058635711062538, 0.02238271609467515, 0.03412661893441733, 0.10456478491128571, -0.017109521625873942, -0.343571804805517, 0.31939390582113486, 0.07438724483408322, 0.2838515060254179, 0.08601995760682916, 0.03363205360840322, 0.0017314575109765797, -0.06536706994796072, 0.044774107362823064, -0.09645639019116342, 0.10599343267219942, 0.3209861335547074, 0.1947607880037566, 0.3207384370568834, -0.397503928915746, -0.16153050422587473, 0.1439020275419515, 0.11971109378453038, 0.10165191897481302, -0.031485705391027526, -0.29282524128520976, 0.12531550538811634, -0.19224906206054496, -0.012092878238932379, -0.12750978847281727, 0.017660931628399892, 0.05988219594369206, -0.2025270685778508, 0.02320364370699162, 0.025678331155278202, 0.03949142697127761, 0.01629093170541694, -0.13449520201215315, -0.04394282902037536, 0.19954760030703844, 0.06495304413787696, 0.005154025482220782, 0.16331793136156844, -0.1483365281553633, -0.18600426990525337, 0.3645311569938985, -0.00017172229787838704, -0.17328426485447043, 0.19751485920475192, -0.039738643005634275, -0.13339276007345116, 0.09001756049265212, 0.22992675721078462, 0.08630306893132361, -0.14120297288243178, -0.0008075669125804525, -0.03320704237220512, 0.15835794558127722, 0.06535680064535587, 0.04831053720110046, 0.14951921159689482, 0.09944267103033465, 0.11011544935031825, 0.14141971807857157, -0.022755314768370744, -0.06853809428023364, -0.1876813723989155, -0.12092391596932711, -0.1921077901761808, 0.01835500344787027, -0.12304837064212132, -0.21533922358766955, 0.4089567548615615, 0.1921031908762016, 0.17283683482575532, 0.07198573851897179, 0.3029364791377065, 0.06876677053683586, 0.07257620800398448, 0.11921167768175817, 0.18436927949798243, 0.0539360668224503, 0.12606480268869494, -0.1457109407134858, 0.16325610381290137, 0.05329433762229943]
|
1,803.05002
|
An Endogenous Mechanism of Business Cycles
|
This paper suggests that business cycles may be a manifestation of coupled
real economy and stock market dynamics and describes a mechanism that can
generate economic fluctuations consistent with observed business cycles. To
this end, we seek to incorporate into the macroeconomic framework a dynamic
stock market model based on opinion interactions (Gusev et al., 2015). We
derive this model from microfoundations, provide its empirical verification,
demonstrate that it contains the efficient market as a particular regime and
establish a link through which macroeconomic models can be attached for the
study of real economy and stock market interaction. To examine key effects, we
link it with a simple macroeconomic model (Blanchard, 1981). The coupled system
generates nontrivial endogenous dynamics, which exhibit deterministic and
stochastic features, producing quasiperiodic fluctuations (business cycles). We
also inspect this system's behavior in the phase space. The real economy and
the stock market coevolve dynamically along the path governed by a
stochastically-forced dynamical system with two stable equilibria, one where
the economy expands and the other where it contracts, resulting in business
cycles identified as the coherence resonance phenomenon. Thus, the
incorporation of stock market dynamics into the macroeconomic framework, as
presented here, allows the derivation of realistic behaviors in a tractable
setting.
|
q-fin.GN physics.soc-ph
|
this paper suggests that business cycles may be a manifestation of coupled real economy and stock market dynamics and describes a mechanism that can generate economic fluctuations consistent with observed business cycles to this end we seek to incorporate into the macroeconomic framework a dynamic stock market model based on opinion interactions gusev et al 2015 we derive this model from microfoundations provide its empirical verification demonstrate that it contains the efficient market as a particular regime and establish a link through which macroeconomic models can be attached for the study of real economy and stock market interaction to examine key effects we link it with a simple macroeconomic model blanchard 1981 the coupled system generates nontrivial endogenous dynamics which exhibit deterministic and stochastic features producing quasiperiodic fluctuations business cycles we also inspect this systems behavior in the phase space the real economy and the stock market coevolve dynamically along the path governed by a stochasticallyforced dynamical system with two stable equilibria one where the economy expands and the other where it contracts resulting in business cycles identified as the coherence resonance phenomenon thus the incorporation of stock market dynamics into the macroeconomic framework as presented here allows the derivation of realistic behaviors in a tractable setting
|
[['this', 'paper', 'suggests', 'that', 'business', 'cycles', 'may', 'be', 'a', 'manifestation', 'of', 'coupled', 'real', 'economy', 'and', 'stock', 'market', 'dynamics', 'and', 'describes', 'a', 'mechanism', 'that', 'can', 'generate', 'economic', 'fluctuations', 'consistent', 'with', 'observed', 'business', 'cycles', 'to', 'this', 'end', 'we', 'seek', 'to', 'incorporate', 'into', 'the', 'macroeconomic', 'framework', 'a', 'dynamic', 'stock', 'market', 'model', 'based', 'on', 'opinion', 'interactions', 'gusev', 'et', 'al', '2015', 'we', 'derive', 'this', 'model', 'from', 'microfoundations', 'provide', 'its', 'empirical', 'verification', 'demonstrate', 'that', 'it', 'contains', 'the', 'efficient', 'market', 'as', 'a', 'particular', 'regime', 'and', 'establish', 'a', 'link', 'through', 'which', 'macroeconomic', 'models', 'can', 'be', 'attached', 'for', 'the', 'study', 'of', 'real', 'economy', 'and', 'stock', 'market', 'interaction', 'to', 'examine', 'key', 'effects', 'we', 'link', 'it', 'with', 'a', 'simple', 'macroeconomic', 'model', 'blanchard', '1981', 'the', 'coupled', 'system', 'generates', 'nontrivial', 'endogenous', 'dynamics', 'which', 'exhibit', 'deterministic', 'and', 'stochastic', 'features', 'producing', 'quasiperiodic', 'fluctuations', 'business', 'cycles', 'we', 'also', 'inspect', 'this', 'systems', 'behavior', 'in', 'the', 'phase', 'space', 'the', 'real', 'economy', 'and', 'the', 'stock', 'market', 'coevolve', 'dynamically', 'along', 'the', 'path', 'governed', 'by', 'a', 'stochasticallyforced', 'dynamical', 'system', 'with', 'two', 'stable', 'equilibria', 'one', 'where', 'the', 'economy', 'expands', 'and', 'the', 'other', 'where', 'it', 'contracts', 'resulting', 'in', 'business', 'cycles', 'identified', 'as', 'the', 'coherence', 'resonance', 'phenomenon', 'thus', 'the', 'incorporation', 'of', 'stock', 'market', 'dynamics', 'into', 'the', 'macroeconomic', 'framework', 'as', 'presented', 'here', 'allows', 'the', 'derivation', 'of', 'realistic', 'behaviors', 'in', 'a', 'tractable', 'setting']]
|
[-0.12719535223152986, 0.10686379851794856, -0.13098580081573036, 0.11285097675750629, -0.0792234764475086, -0.1450819303196837, 0.08524457629073809, 0.35176624484287883, -0.27953095343845524, -0.26565834575386954, 0.11317925433711899, -0.26212081588581215, -0.23673415082750968, 0.17171222553447169, -0.07247810111521263, -0.026801613475663986, 0.04769241438672236, -0.00834996266913876, 0.09612532001603576, -0.2414189055652439, 0.2699310542626795, 0.029359106405765875, 0.28791375803078517, 0.010009669181122218, 0.11694066746395479, -0.0007878925710084658, -0.022682173454510138, 0.016996716918707463, -0.13342136115643724, 0.13474135619398314, 0.26261579842206434, 0.12339946809134365, 0.32377602829760643, -0.4530890462287132, -0.2060467608101232, 0.12186197502124892, 0.08933571271823823, 0.05925523987360914, 0.023851117012384845, -0.2676232671636401, -0.007859237223085992, -0.2642064993151066, -0.11941722621270953, -0.1396737463446786, 0.034568013384874946, 0.004626559258327883, -0.2947087183931517, 0.04700646259993184, 0.05550271586570957, 0.059680601283546214, -0.05416064114096231, -0.030157173625464797, -0.06775000730746435, 0.15076676192136768, 0.09255656060023523, -0.04094265714045885, 0.16270513922084592, -0.0919371043797865, -0.1676702021499101, 0.38603095434045476, -0.07459452823968604, -0.12536449772462607, 0.1657068811852069, -0.11107615574073156, -0.13634633193429993, 0.07213937763115662, 0.2168567007691803, 0.014682132782396471, -0.19110972560417738, 0.048102048020278676, -0.04273390239195048, 0.17294949718617644, 0.024807577429438753, -0.016673325949791564, 0.22769241058370082, 0.21432427005408314, 0.06867162238589479, 0.1474322837755396, -0.0028726984633729584, -0.2262435834541198, -0.24331237731763677, -0.1120444129569257, -0.11199643123822595, 0.05509095714490825, -0.12988819392095377, -0.1871361866891746, 0.42585327864841566, 0.18211867474641164, 0.16201285599477733, 0.045095867633119395, 0.2553328720347513, 0.10515636080074649, -0.01715315515130252, 0.10299837322977995, 0.19123419515282206, 0.02949639226341602, 0.18334241722737557, -0.19807622002017258, 0.14553424947484264, 0.03369600432744087]
|
1,803.05003
|
An algorithm for hiding and recovering data using matrices
|
We present an algorithm for the recovery of a matrix $\mathbb{M}$ %
(non-singular $\in $ $\mathbb{C}^{N\times N}$) by only being aware of two of
its powers, $\mathbb{M}_{k_{1}}:=\mathbb{M}^{k_{1}}$ and $\mathbb{M}%
_{k_{2}}:=\mathbb{M}^{k_{2}}$ ($k_{1}>k_{2}$) whose exponents are positive
coprime numbers. The knowledge of the exponents is the key to retrieve matrix
$\mathbb{M}$ out from the two matrices $\mathbb{M}_{k_{i}}$. The procedure
combines products and inversions of matrices, and a few computational steps are
needed to get $\mathbb{M}$, almost independently of the exponents magnitudes.
Guessing the matrix $\mathbb{M}$ from the two matrices $\mathbb{M}_{k_{i}}$,
without the knowledge of $k_{1}$ and $k_{2}$, is comparatively highly consuming
in terms of number of operations. If a private message, contained in
$\mathbb{M}$, has to be conveyed, the exponents can be encrypted and then
distributed through a public key method as, for instance, the DF
(Diffie-Hellman), the RSA (Rivest-Shamir-Adleman), or any other.
|
cs.CR
|
we present an algorithm for the recovery of a matrix mathbbm nonsingular in mathbbcntimes n by only being aware of two of its powers mathbbm_k_1mathbbmk_1 and mathbbm _k_2mathbbmk_2 k_1k_2 whose exponents are positive coprime numbers the knowledge of the exponents is the key to retrieve matrix mathbbm out from the two matrices mathbbm_k_i the procedure combines products and inversions of matrices and a few computational steps are needed to get mathbbm almost independently of the exponents magnitudes guessing the matrix mathbbm from the two matrices mathbbm_k_i without the knowledge of k_1 and k_2 is comparatively highly consuming in terms of number of operations if a private message contained in mathbbm has to be conveyed the exponents can be encrypted and then distributed through a public key method as for instance the df diffiehellman the rsa rivestshamiradleman or any other
|
[['we', 'present', 'an', 'algorithm', 'for', 'the', 'recovery', 'of', 'a', 'matrix', 'mathbbm', 'nonsingular', 'in', 'mathbbcntimes', 'n', 'by', 'only', 'being', 'aware', 'of', 'two', 'of', 'its', 'powers', 'mathbbm_k_1mathbbmk_1', 'and', 'mathbbm', '_k_2mathbbmk_2', 'k_1k_2', 'whose', 'exponents', 'are', 'positive', 'coprime', 'numbers', 'the', 'knowledge', 'of', 'the', 'exponents', 'is', 'the', 'key', 'to', 'retrieve', 'matrix', 'mathbbm', 'out', 'from', 'the', 'two', 'matrices', 'mathbbm_k_i', 'the', 'procedure', 'combines', 'products', 'and', 'inversions', 'of', 'matrices', 'and', 'a', 'few', 'computational', 'steps', 'are', 'needed', 'to', 'get', 'mathbbm', 'almost', 'independently', 'of', 'the', 'exponents', 'magnitudes', 'guessing', 'the', 'matrix', 'mathbbm', 'from', 'the', 'two', 'matrices', 'mathbbm_k_i', 'without', 'the', 'knowledge', 'of', 'k_1', 'and', 'k_2', 'is', 'comparatively', 'highly', 'consuming', 'in', 'terms', 'of', 'number', 'of', 'operations', 'if', 'a', 'private', 'message', 'contained', 'in', 'mathbbm', 'has', 'to', 'be', 'conveyed', 'the', 'exponents', 'can', 'be', 'encrypted', 'and', 'then', 'distributed', 'through', 'a', 'public', 'key', 'method', 'as', 'for', 'instance', 'the', 'df', 'diffiehellman', 'the', 'rsa', 'rivestshamiradleman', 'or', 'any', 'other']]
|
[-0.1732007191019522, 0.11522785623815457, -0.06191716787975226, 0.014870709366053898, -0.02914565626476238, -0.2051791717583286, 0.05937909376859637, 0.34620277373356495, -0.32816029954423653, -0.24518112265921907, 0.14467847954356738, -0.30848737978793456, -0.14341852273496647, 0.17824913996598446, -0.05389861490772064, 0.0572884919833385, 0.026821174439904626, 0.10697472544817893, -0.07724653024560035, -0.2855643015441749, 0.32373047131548094, -0.023074403627594903, 0.17944598315568613, 0.013614933541628406, 0.08292110289321906, -0.007026993391562754, -0.05838552111483512, -0.03700381122640709, -0.0809463348392564, 0.09764397233801046, 0.26920087319979474, 0.17515418749413827, 0.25680294819871213, -0.4022127291180694, -0.12001280020922422, 0.16631501587096917, 0.154041047345277, 0.04328918516802699, 0.00747433139720181, -0.2549173337574214, 0.15520525089666637, -0.14050026486780662, -0.07204679082453584, -0.08197825199076489, 0.013790086186282448, 0.013906591405063423, -0.3396710537581113, 0.01622783167308558, 0.05444506757350555, 0.06028321193211448, 0.013316833500145698, -0.16001674108930045, -0.005289119588377983, 0.19209176788989232, 0.023296340023785996, -0.0015946121681342596, 0.10254922563491611, -0.08136160429845106, -0.09274371056608967, 0.39115312044967465, -0.008411501659386193, -0.2461563712733089, 0.09093639004190188, -0.111494529992342, -0.10087335458956659, 0.16127367606108536, 0.11450922392124532, 0.12001759001512581, -0.09982238709839727, 0.11295818704755546, -0.06898424709771774, 0.1918769585613314, 0.0617393295266735, 0.015335309499902512, 0.13354016711184782, 0.05266585941912968, 0.09719559646545173, 0.11486472354710116, -0.026944558038862785, -0.05398141800203541, -0.2851935825023953, -0.1741175365359731, -0.2742501180688503, 0.08126392106372696, -0.17401009436413115, -0.15843542506779307, 0.3915497147505964, 0.1101034684697472, 0.22323692936203512, 0.07536264779324185, 0.32232476980077907, 0.06357735910352125, 0.05704165020707383, 0.11591377801265318, 0.134691152249032, 0.1671289809260156, 0.05600851697068828, -0.12432481145917146, 0.12138113190781381, 0.12421692141727891]
|
1,803.05004
|
A Brief Retrospective Look at the Cayley-Purser Public-key Cryptosystem,
19 Years Later
|
The purpose of this paper is to describe and analyze the Cayley-Purser
algorithm, which is a public-key cryptosystem proposed by Flannery in 1999. I
will present two attacks on it, one of which is apparently new. I will also
examine a variant of the Cayley-Purser algorithm that was patented by Slavin in
2008, and show that it is also insecure.
|
cs.CR
|
the purpose of this paper is to describe and analyze the cayleypurser algorithm which is a publickey cryptosystem proposed by flannery in 1999 i will present two attacks on it one of which is apparently new i will also examine a variant of the cayleypurser algorithm that was patented by slavin in 2008 and show that it is also insecure
|
[['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'describe', 'and', 'analyze', 'the', 'cayleypurser', 'algorithm', 'which', 'is', 'a', 'publickey', 'cryptosystem', 'proposed', 'by', 'flannery', 'in', '1999', 'i', 'will', 'present', 'two', 'attacks', 'on', 'it', 'one', 'of', 'which', 'is', 'apparently', 'new', 'i', 'will', 'also', 'examine', 'a', 'variant', 'of', 'the', 'cayleypurser', 'algorithm', 'that', 'was', 'patented', 'by', 'slavin', 'in', '2008', 'and', 'show', 'that', 'it', 'is', 'also', 'insecure']]
|
[-0.11643324503353958, 0.05365578334072027, -0.15130535202454135, 0.05717963362233071, -0.04374954290688038, -0.2029657556579031, 0.024070529233070154, 0.35562529658160075, -0.2320104817506568, -0.29429708986446773, 0.1553192422685117, -0.22661917740157966, -0.25353258549524793, 0.20699682682030032, -0.17773843293303046, -0.01565059264800672, 0.042522628454427266, -0.007032586189372273, 0.021812989031253702, -0.3417762325241648, 0.3488962209466363, 0.07109443899565215, 0.2561070113442838, 0.06398359777662775, 0.08243083370175085, -0.01944484295933668, -0.05135113121299394, 0.0017183397832358706, -0.11600146722976833, 0.1004440253761051, 0.21506423427691235, 0.202237335635863, 0.2844365672047796, -0.31555903741511804, -0.1305827184235035, 0.0636538845037335, 0.10594647758287089, 0.14218599093548054, -0.052109877107231396, -0.25449211855322634, 0.15070714354354503, -0.22813859912727413, -0.07071553381031444, -0.06866012642095828, 0.0702879645958029, 0.006684746914382638, -0.2215018259232928, -0.027115103564875457, 0.09807898004635654, 0.005919619142238436, 0.031279455388671364, -0.04709524941502203, 0.06304578007432704, 0.017652569964913458, 0.027875622332995308, 0.03145508287506628, 0.042761526857342184, -0.041612313189222636, -0.14788651806784087, 0.3680835136308752, -0.02219572204068817, -0.11872601663244181, 0.14998139351092535, -0.04653885232782441, -0.17237473150779462, 0.08146798837094985, 0.17057046769508, 0.10498551678329963, -0.1914035301205927, 0.0816805117165445, -0.13562743298324018, 0.16600325928422913, 0.03006701249677431, -0.037277156149904275, 0.10041755672287324, 0.13782155256846856, 0.06971725731574256, 0.15644325242891652, -0.09898198505558459, -0.06448258021204122, -0.2675021003433985, -0.22799732096910733, -0.1935061736048424, 0.01449497332716168, 0.0486755601199673, -0.10298884147778153, 0.4296026831685469, 0.22614378045345174, 0.13802659781328563, -0.004906904357806619, 0.32203535656926446, 0.05066872832911282, 0.03509404940594887, 0.142282108671899, 0.25501246482599527, 0.05092285580708292, 0.11036022976522558, -0.1666212295230221, 0.10449784151920728, 0.09301596460462516]
|
1,803.05005
|
PyMUSE: a Python package for VLT/MUSE data
|
This is a companion Focus Demonstration article to the PyMUSE python package,
demonstrating its usage and utilities for VLT/MUSE data analysis, that include
a wide range of options for spectra extractions, the creation of different
types of images, compatibilities with some commonly used software for
astronomical data analysis, among others. PyMUSE is an open-source software and
can be found on Github for free use and distribution.
|
astro-ph.IM
|
this is a companion focus demonstration article to the pymuse python package demonstrating its usage and utilities for vltmuse data analysis that include a wide range of options for spectra extractions the creation of different types of images compatibilities with some commonly used software for astronomical data analysis among others pymuse is an opensource software and can be found on github for free use and distribution
|
[['this', 'is', 'a', 'companion', 'focus', 'demonstration', 'article', 'to', 'the', 'pymuse', 'python', 'package', 'demonstrating', 'its', 'usage', 'and', 'utilities', 'for', 'vltmuse', 'data', 'analysis', 'that', 'include', 'a', 'wide', 'range', 'of', 'options', 'for', 'spectra', 'extractions', 'the', 'creation', 'of', 'different', 'types', 'of', 'images', 'compatibilities', 'with', 'some', 'commonly', 'used', 'software', 'for', 'astronomical', 'data', 'analysis', 'among', 'others', 'pymuse', 'is', 'an', 'opensource', 'software', 'and', 'can', 'be', 'found', 'on', 'github', 'for', 'free', 'use', 'and', 'distribution']]
|
[-0.05334436954581179, -0.014100266341984025, -0.08175231645509484, 0.06884553231975588, -0.12986548730987124, -0.1439871307447902, -0.03499195155745838, 0.44264869717881083, -0.24840361082169693, -0.35528876293756184, 0.1425931220583152, -0.28645352163584903, -0.07834762547281571, 0.30966051051836985, -0.04022891321073985, 0.013752139187090506, 0.15466704573191237, -0.03196284137084149, -0.02498311019371613, -0.2377882751461584, 0.3086418345774291, 0.08976985642220825, 0.2816708126811136, 0.06652198235678952, 0.025996685162681388, 0.03521517079207115, -0.10012835238740081, -0.05155434849439189, -0.15553679489369188, 0.14967438746680273, 0.32948895811568946, 0.24120469569015768, 0.26534989968058653, -0.3363666065270081, -0.1762907503580209, 0.027731429410550845, 0.12020874167501461, 0.06565849268736201, -0.056401523639578954, -0.27286721002019476, 0.06232829636428505, -0.24646840553032234, -0.10507615772075951, -0.102184938499704, 0.03102992406093108, 0.07985963998362422, -0.26838004372257274, -0.029380806467088405, -0.04351571714505553, 0.1606687366438564, -0.05031655659149692, -0.1396518835972529, -0.0062553279276471585, 0.15862430590641452, 0.045596658303111326, -0.014174391211781767, 0.12144452493521385, -0.09786984414313338, -0.09977170833735727, 0.40227457755827345, -0.04704071962623857, -0.13617044093552977, 0.21024653580388986, -0.04137765332052368, -0.17617935726593714, 0.06368989642942324, 0.2003771954914555, 0.10208324118866585, -0.24286761194525752, 0.07737805707165535, 0.011229105642996728, 0.2075015415175585, 0.025128359862719662, 0.022580010767342173, 0.2013705943536479, 0.14929345573909814, -0.013297852638061158, 0.13497902056951716, -0.08627095257907058, -0.04826592457538936, -0.29138286190573126, -0.18532520583539736, -0.15846005862113088, -0.04492293836301542, -0.06138536828007091, -0.18315054899721872, 0.40917549266305286, 0.17915457816707203, 0.0936450506123947, 0.036452769006245944, 0.32667753368150443, 0.01765035855351016, 0.11997896552202292, 0.08858861312910449, 0.12804615926370388, 0.020233186856785323, 0.13282449365215143, -0.1186537998582935, 0.05333563533349661, -0.058081763821974164]
|
1,803.05006
|
Conditional Activation for Diverse Neurons in Heterogeneous Networks
|
In this paper, we propose a new scheme for modelling the diverse behavior of
neurons. We introduce the conditional activation, in which a neurons activation
function is dynamically modified by a control signal. We apply this method to
recreate behavior of special neurons existing in the human auditory and visual
system. A heterogeneous multilayered perceptron (MLP) incorporating the
developed models demonstrates simultaneous improvement in learning speed and
performance across a various number of hidden units and layers, compared to a
homogeneous network composed of the conventional neuron model. For similar
performance, the proposed model lowers the memory for storing network
parameters significantly.
|
cs.NE
|
in this paper we propose a new scheme for modelling the diverse behavior of neurons we introduce the conditional activation in which a neurons activation function is dynamically modified by a control signal we apply this method to recreate behavior of special neurons existing in the human auditory and visual system a heterogeneous multilayered perceptron mlp incorporating the developed models demonstrates simultaneous improvement in learning speed and performance across a various number of hidden units and layers compared to a homogeneous network composed of the conventional neuron model for similar performance the proposed model lowers the memory for storing network parameters significantly
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'scheme', 'for', 'modelling', 'the', 'diverse', 'behavior', 'of', 'neurons', 'we', 'introduce', 'the', 'conditional', 'activation', 'in', 'which', 'a', 'neurons', 'activation', 'function', 'is', 'dynamically', 'modified', 'by', 'a', 'control', 'signal', 'we', 'apply', 'this', 'method', 'to', 'recreate', 'behavior', 'of', 'special', 'neurons', 'existing', 'in', 'the', 'human', 'auditory', 'and', 'visual', 'system', 'a', 'heterogeneous', 'multilayered', 'perceptron', 'mlp', 'incorporating', 'the', 'developed', 'models', 'demonstrates', 'simultaneous', 'improvement', 'in', 'learning', 'speed', 'and', 'performance', 'across', 'a', 'various', 'number', 'of', 'hidden', 'units', 'and', 'layers', 'compared', 'to', 'a', 'homogeneous', 'network', 'composed', 'of', 'the', 'conventional', 'neuron', 'model', 'for', 'similar', 'performance', 'the', 'proposed', 'model', 'lowers', 'the', 'memory', 'for', 'storing', 'network', 'parameters', 'significantly']]
|
[-0.07938834921657748, 0.03856416231970869, -0.02925708677446214, 0.024665749781335906, -0.0746010086298281, -0.1816323175021977, 0.07735492204494007, 0.40190561614273224, -0.27690628565409603, -0.3174125678042936, -0.008274314349845928, -0.22592090097411224, -0.27007775143811513, 0.16966380822180094, -0.11390827512185947, 0.09501418809169064, 0.0696669961873661, 0.05200563070556039, -0.014484102175771897, -0.2466535046399918, 0.27070933028452976, 0.054464660217419414, 0.355832697604509, -0.05206202150450325, 0.15462968387074916, -0.006989699735890562, 0.01533592565386903, -0.005781244689726508, -0.03841597088795228, 0.17235392307196104, 0.2511476004585312, 0.12721646231868505, 0.3223003709469648, -0.47002370752321154, -0.31308326469369085, 0.08352705041932709, 0.13495245913965812, 0.1001835723154192, -0.022918839546322237, -0.2809008355435057, 0.09477690238774955, -0.2103727447946428, -0.024625256630208564, -0.09361495650556012, -0.035860359773733745, 0.03833815434892826, -0.3159043996631369, 0.05871446707112459, 0.06496104497808333, 0.057446394296016036, -0.08020569328857842, -0.08640576287985359, 0.03173607291411791, 0.14919764676825234, -0.04111718364269929, 0.0077531292313235065, 0.1594373001808337, -0.1903315408602722, -0.1162527611789604, 0.28990641901013897, -0.07892766692356079, -0.22708617643765333, 0.1896442420068471, -0.02136125775766285, -0.13026794442432185, 0.0841949002317372, 0.25723696553020503, 0.07994507344476148, -0.1906860573354232, -0.017130498287573858, -0.015257946726884328, 0.21595205195869008, 0.02379801752064012, 0.008779137778808089, 0.13904899854998232, 0.31055879129060343, -0.0042542749376711896, 0.20801405155319064, -0.11766939402977918, -0.09967773331000525, -0.22032831108891496, -0.13756395896494972, -0.15151387418382892, -0.035790501660028215, -0.13064540372022962, -0.15228087177463606, 0.49080319467865074, 0.20658313525913685, 0.23022673163544752, 0.12964519948111367, 0.31159637877535, 0.07496788341771154, 0.13832448381821022, 0.08057998361376424, 0.18955461326164796, 0.06603601053083206, 0.1598272180440379, -0.20814433137146646, 0.11111132130420576, 0.02540622394778492]
|
1,803.05007
|
X-ray scaling relations from a complete sample of the richest maxBCG
clusters
|
We use a complete sample of 38 richest maxBCG clusters to study the
ICM-galaxy scaling relations and the halo mass selection properties of the
maxBCG algorithm, based on X-ray and optical observations. The clusters are
selected from the two largest bins of optical richness in the Planck stacking
work with the maxBCG richness $N_{200} \geq 78$. We analyze their Chandra and
XMM-Newton data to derive the X-ray properties of the ICM. We then use the
distribution of $P(X|N)$, $X=T_X,\ L_X,\ Y_X$, to study the mass selection
$P(M|N)$ of maxBCG. Compared with previous works based on the whole richness
sample, a significant fraction of blended systems with boosted richness is
skewed into this richest sample. Parts of the blended halos are picked apart by
the redMaPPer, an updated red-sequence cluster finding algorithm with lower
mass scatter. Moreover, all the optical blended halos are resolved as
individual X-ray halos, following the established $L_X-T_X$ and $L_X-Y_X$
relations. We further discuss that the discrepancy between ICM-galaxy scaling
relations, especially for future blind stacking, can come from several factors,
including miscentering, projection, contamination of low mass systems, mass
bias and covariance bias. We also evaluate the fractions of relaxed and cool
core clusters in our sample. Both are smaller than those from SZ or X-ray
selected samples. Moreover, disturbed clusters show a higher level of mass bias
than relaxed clusters.
|
astro-ph.GA astro-ph.CO
|
we use a complete sample of 38 richest maxbcg clusters to study the icmgalaxy scaling relations and the halo mass selection properties of the maxbcg algorithm based on xray and optical observations the clusters are selected from the two largest bins of optical richness in the planck stacking work with the maxbcg richness n_200 geq 78 we analyze their chandra and xmmnewton data to derive the xray properties of the icm we then use the distribution of pxn xt_x l_x y_x to study the mass selection pmn of maxbcg compared with previous works based on the whole richness sample a significant fraction of blended systems with boosted richness is skewed into this richest sample parts of the blended halos are picked apart by the redmapper an updated redsequence cluster finding algorithm with lower mass scatter moreover all the optical blended halos are resolved as individual xray halos following the established l_xt_x and l_xy_x relations we further discuss that the discrepancy between icmgalaxy scaling relations especially for future blind stacking can come from several factors including miscentering projection contamination of low mass systems mass bias and covariance bias we also evaluate the fractions of relaxed and cool core clusters in our sample both are smaller than those from sz or xray selected samples moreover disturbed clusters show a higher level of mass bias than relaxed clusters
|
[['we', 'use', 'a', 'complete', 'sample', 'of', '38', 'richest', 'maxbcg', 'clusters', 'to', 'study', 'the', 'icmgalaxy', 'scaling', 'relations', 'and', 'the', 'halo', 'mass', 'selection', 'properties', 'of', 'the', 'maxbcg', 'algorithm', 'based', 'on', 'xray', 'and', 'optical', 'observations', 'the', 'clusters', 'are', 'selected', 'from', 'the', 'two', 'largest', 'bins', 'of', 'optical', 'richness', 'in', 'the', 'planck', 'stacking', 'work', 'with', 'the', 'maxbcg', 'richness', 'n_200', 'geq', '78', 'we', 'analyze', 'their', 'chandra', 'and', 'xmmnewton', 'data', 'to', 'derive', 'the', 'xray', 'properties', 'of', 'the', 'icm', 'we', 'then', 'use', 'the', 'distribution', 'of', 'pxn', 'xt_x', 'l_x', 'y_x', 'to', 'study', 'the', 'mass', 'selection', 'pmn', 'of', 'maxbcg', 'compared', 'with', 'previous', 'works', 'based', 'on', 'the', 'whole', 'richness', 'sample', 'a', 'significant', 'fraction', 'of', 'blended', 'systems', 'with', 'boosted', 'richness', 'is', 'skewed', 'into', 'this', 'richest', 'sample', 'parts', 'of', 'the', 'blended', 'halos', 'are', 'picked', 'apart', 'by', 'the', 'redmapper', 'an', 'updated', 'redsequence', 'cluster', 'finding', 'algorithm', 'with', 'lower', 'mass', 'scatter', 'moreover', 'all', 'the', 'optical', 'blended', 'halos', 'are', 'resolved', 'as', 'individual', 'xray', 'halos', 'following', 'the', 'established', 'l_xt_x', 'and', 'l_xy_x', 'relations', 'we', 'further', 'discuss', 'that', 'the', 'discrepancy', 'between', 'icmgalaxy', 'scaling', 'relations', 'especially', 'for', 'future', 'blind', 'stacking', 'can', 'come', 'from', 'several', 'factors', 'including', 'miscentering', 'projection', 'contamination', 'of', 'low', 'mass', 'systems', 'mass', 'bias', 'and', 'covariance', 'bias', 'we', 'also', 'evaluate', 'the', 'fractions', 'of', 'relaxed', 'and', 'cool', 'core', 'clusters', 'in', 'our', 'sample', 'both', 'are', 'smaller', 'than', 'those', 'from', 'sz', 'or', 'xray', 'selected', 'samples', 'moreover', 'disturbed', 'clusters', 'show', 'a', 'higher', 'level', 'of', 'mass', 'bias', 'than', 'relaxed', 'clusters']]
|
[-0.039693872000794536, 0.08420592858157136, -0.07494034372982294, 0.13307478176893422, -0.10180648407115016, -0.0337249724830741, 0.11831581931797223, 0.4565968662163251, -0.17766457231719535, -0.392093354598008, 0.05432969104705117, -0.354772267850512, -0.022466040283812386, 0.20067632162592655, 0.008602352088055999, 0.0028102204856927386, 0.04845096856962502, -0.07278561858645728, -0.09607440881574383, -0.3209782702036042, 0.3167692588482103, 0.06369891226801566, 0.25181478081161485, -0.08713813894217606, 0.06228717253069347, -0.022332044373102048, -0.12352546069948045, 0.05339899831725394, -0.1343472231342049, 0.07420615645202416, 0.20472305026474277, 0.12517708002029163, 0.23732616285039154, -0.2765460768887063, -0.14708375482666158, 0.09100550639641164, 0.2078700812472393, 0.04756217196634317, -0.07615445968610703, -0.2811443904473771, 0.08601596934180412, -0.16474512521608425, -0.1278315467310372, 0.03843698929784592, -0.014448512503582292, 0.06251265764145847, -0.17753259110268693, 0.21324320504116842, -0.0001229161725324743, 0.0461120651065629, -0.12237210585672527, -0.18333683807267998, -0.06781148011964741, 0.10795906325064734, -0.020145868011265656, 0.01707668326085547, 0.20291263649526697, -0.1364748365394505, -0.033101023181143524, 0.3792478354748895, 0.0072261604391685285, -0.023942519978059632, 0.20429426340419984, -0.1887679702214627, -0.24298327078419102, 0.09053398886531153, 0.18850367987313524, 0.05086070552628437, -0.197266979436959, 0.015334342264099366, -0.04876435804286154, 0.2814888594254885, 0.03408101465283341, 0.05352379098783218, 0.2331515376654146, 0.1179967456332901, 0.038300554046820326, 0.14698128313314995, -0.19535198200354983, 0.02241721144156758, -0.20201836852725527, -0.06285472664290963, -0.14148706825591237, 0.03545353806902111, -0.1577545169302909, -0.12642182155598664, 0.2919468217594149, 0.14197563364410698, 0.26074860485919066, 0.1266516545277544, 0.31070867060300184, 0.08591200980385218, 0.10247821904975937, 0.0657910929794731, 0.26212866976225063, 0.18361168406287165, 0.008054661075821635, -0.2338753937905848, 0.010863351732559872, -0.011470525741484437]
|
1,803.05008
|
Explicit tight bounds on the stably recoverable information for the
inverse source problem
|
For the inverse source problem with the two-dimensional Helmholtz equation,
the singular values of the 'source-to-near field' forward operator reveal a
sharp frequency cut-off in the stably recoverable information on the source. We
prove and numerically validate an explicit, tight lower bound for the spectral
location of this cut-off. We also conjecture and support numerically a tight
upper bound for the cut-off. The bounds are expressed in terms of zeros of
Bessel functions of the first and second kind.
|
math.AP
|
for the inverse source problem with the twodimensional helmholtz equation the singular values of the sourcetonear field forward operator reveal a sharp frequency cutoff in the stably recoverable information on the source we prove and numerically validate an explicit tight lower bound for the spectral location of this cutoff we also conjecture and support numerically a tight upper bound for the cutoff the bounds are expressed in terms of zeros of bessel functions of the first and second kind
|
[['for', 'the', 'inverse', 'source', 'problem', 'with', 'the', 'twodimensional', 'helmholtz', 'equation', 'the', 'singular', 'values', 'of', 'the', 'sourcetonear', 'field', 'forward', 'operator', 'reveal', 'a', 'sharp', 'frequency', 'cutoff', 'in', 'the', 'stably', 'recoverable', 'information', 'on', 'the', 'source', 'we', 'prove', 'and', 'numerically', 'validate', 'an', 'explicit', 'tight', 'lower', 'bound', 'for', 'the', 'spectral', 'location', 'of', 'this', 'cutoff', 'we', 'also', 'conjecture', 'and', 'support', 'numerically', 'a', 'tight', 'upper', 'bound', 'for', 'the', 'cutoff', 'the', 'bounds', 'are', 'expressed', 'in', 'terms', 'of', 'zeros', 'of', 'bessel', 'functions', 'of', 'the', 'first', 'and', 'second', 'kind']]
|
[-0.13605865065115863, 0.07985101018913646, -0.08373999104309732, 0.14057077383115077, -0.08414766968538363, -0.10254659660112782, 0.0627594328342149, 0.32883815962869006, -0.25373991115544087, -0.27763978831278974, 0.12492820056668745, -0.2472378664608233, -0.1286435732856775, 0.24347715430821365, -0.008597768031251736, 0.09763592944158844, 0.021234254215438016, 0.101405894703184, -0.08785781257141095, -0.2006085229494112, 0.35380700493279177, 0.07689962715047817, 0.23716563142788333, 0.14899183536330476, 0.08588447303582843, -0.023220728151500225, 0.001606398136713184, -0.07981969327785265, -0.2017480714742142, 0.14240247425354588, 0.21616825085276595, 0.06943294978163277, 0.24092309720193347, -0.39523232833315164, -0.1759744274746388, 0.1058397576189003, 0.1582921865569332, 0.055045567655888125, -0.044729839029829375, -0.24941062124875876, 0.060288881768102355, -0.10885932105473983, -0.180222341671395, -0.014239457770226857, 0.010535635742155883, 0.04879060701634257, -0.31210688621892285, 0.11482791142584457, 0.09290880688394491, 0.03446311443015778, -0.12531063765979922, -0.1254299033033208, 0.032267334673983544, 0.08265244498705634, 0.01199017983312026, -0.027891701499286752, 0.01886829096250809, -0.11728012451651292, -0.07224022642446634, 0.2842186028764655, -0.10692338411135073, -0.23324921922997022, 0.09569260782490556, -0.16462745040487975, -0.10285755560303536, 0.1296576204088827, 0.17277394589753106, 0.14489207063347864, -0.11817422472627069, 0.12479971534085986, -0.08216747106052935, 0.16483836523137796, 0.14674684569502297, 0.053669288754463196, 0.13170318712647527, 0.08187653914762613, 0.11951367158251695, 0.21039662325683123, -0.065852403619852, -0.04649813179499828, -0.36224207052817714, -0.14600102425081274, -0.25168563870904154, 0.00037457265007572295, -0.16359547890953344, -0.1884313836105717, 0.38501785829281193, 0.10339047254110949, 0.20058830816131562, 0.1197097297751894, 0.2704597743323598, 0.24852963211014867, 0.002418661561722939, 0.13878456885233903, 0.24930680604078448, 0.15651199320116296, 0.047181627181812354, -0.2086676596816874, 0.004865154421004729, 0.1388104897326766]
|
1,803.05009
|
Tidal disruption of stars in a supermassive black hole binary system:
the influence of orbital properties on fallback and accretion rates
|
The disruption of a star by a supermassive black hole generates a sudden
bright flare. Previous studies have focused on the disruption by single black
holes, for which the fallback rate decays as~$\propto t^{-5/3}$. In this paper,
we generalise the study to the case of a supermassive black hole binary
(SMBHB), using both analytical estimates and hydrodynamical simulations,
looking for specific observable signatures. The range of binary separation for
which it is possible to distinguish between the disruption created by a single
or a binary black hole concerns typically separations of order a few
milliparsecs for a primary of mass $\sim 10^6M_{\odot}$. When the fallback rate
is affected by the secondary, it undergoes two types interruptions, depending
on the initial inclination $\theta$ of the orbit of the star relative to the
plane of the SMBHB. For $\theta \lesssim 70^\circ$, periodic sharp
interruptions occur and the time of first interruption depends on the distance
of the secondary black hole with the debris. If $\theta \gtrsim 70^\circ$, a
first smooth interruption occurs, but not always followed by a further recovery
of the fallback rate. This implies that most of the TDEs around a SMBHB will
undergo periodic sharp interruptions of their lightcurve.
|
astro-ph.HE
|
the disruption of a star by a supermassive black hole generates a sudden bright flare previous studies have focused on the disruption by single black holes for which the fallback rate decays aspropto t53 in this paper we generalise the study to the case of a supermassive black hole binary smbhb using both analytical estimates and hydrodynamical simulations looking for specific observable signatures the range of binary separation for which it is possible to distinguish between the disruption created by a single or a binary black hole concerns typically separations of order a few milliparsecs for a primary of mass sim 106m_odot when the fallback rate is affected by the secondary it undergoes two types interruptions depending on the initial inclination theta of the orbit of the star relative to the plane of the smbhb for theta lesssim 70circ periodic sharp interruptions occur and the time of first interruption depends on the distance of the secondary black hole with the debris if theta gtrsim 70circ a first smooth interruption occurs but not always followed by a further recovery of the fallback rate this implies that most of the tdes around a smbhb will undergo periodic sharp interruptions of their lightcurve
|
[['the', 'disruption', 'of', 'a', 'star', 'by', 'a', 'supermassive', 'black', 'hole', 'generates', 'a', 'sudden', 'bright', 'flare', 'previous', 'studies', 'have', 'focused', 'on', 'the', 'disruption', 'by', 'single', 'black', 'holes', 'for', 'which', 'the', 'fallback', 'rate', 'decays', 'aspropto', 't53', 'in', 'this', 'paper', 'we', 'generalise', 'the', 'study', 'to', 'the', 'case', 'of', 'a', 'supermassive', 'black', 'hole', 'binary', 'smbhb', 'using', 'both', 'analytical', 'estimates', 'and', 'hydrodynamical', 'simulations', 'looking', 'for', 'specific', 'observable', 'signatures', 'the', 'range', 'of', 'binary', 'separation', 'for', 'which', 'it', 'is', 'possible', 'to', 'distinguish', 'between', 'the', 'disruption', 'created', 'by', 'a', 'single', 'or', 'a', 'binary', 'black', 'hole', 'concerns', 'typically', 'separations', 'of', 'order', 'a', 'few', 'milliparsecs', 'for', 'a', 'primary', 'of', 'mass', 'sim', '106m_odot', 'when', 'the', 'fallback', 'rate', 'is', 'affected', 'by', 'the', 'secondary', 'it', 'undergoes', 'two', 'types', 'interruptions', 'depending', 'on', 'the', 'initial', 'inclination', 'theta', 'of', 'the', 'orbit', 'of', 'the', 'star', 'relative', 'to', 'the', 'plane', 'of', 'the', 'smbhb', 'for', 'theta', 'lesssim', '70circ', 'periodic', 'sharp', 'interruptions', 'occur', 'and', 'the', 'time', 'of', 'first', 'interruption', 'depends', 'on', 'the', 'distance', 'of', 'the', 'secondary', 'black', 'hole', 'with', 'the', 'debris', 'if', 'theta', 'gtrsim', '70circ', 'a', 'first', 'smooth', 'interruption', 'occurs', 'but', 'not', 'always', 'followed', 'by', 'a', 'further', 'recovery', 'of', 'the', 'fallback', 'rate', 'this', 'implies', 'that', 'most', 'of', 'the', 'tdes', 'around', 'a', 'smbhb', 'will', 'undergo', 'periodic', 'sharp', 'interruptions', 'of', 'their', 'lightcurve']]
|
[-0.19680755087595678, 0.13649952456111733, -0.03882347511586232, 0.09369426092013586, -0.07858362111108537, -0.1172180861613746, 0.08916954015704555, 0.3194631322488264, -0.2154158694960935, -0.30826482579729814, 0.11486785614046376, -0.29350060970059144, -0.06645649234382857, 0.24053066830506464, -0.04639121061120763, 0.002776702063335995, 0.08062362285733372, 0.026028971407730975, -0.12717998853268045, -0.23673602085017678, 0.34051602052983326, 0.0871278179783711, 0.11134613148783844, -0.011955653029451868, 0.05847302823322802, 0.012699921110382564, 0.015530945882949997, -0.036494697692181596, -0.17081171264024433, 0.01518743602037149, 0.16615853847435033, 0.13382044162872672, 0.2589368083556393, -0.381549848547795, -0.21999761612908025, 0.08384831519633644, 0.156117142098558, 0.07913604346759168, -0.11962426831856857, -0.24887393044141687, 0.11876145251862817, -0.2668685628470951, -0.12614408533917226, 0.075935768819971, 0.09134942975044999, 0.04515060443014618, -0.26779021528881775, 0.1549892210186314, 0.12231143226926174, -0.02331662332947979, -0.08449625429795615, 0.014151314935698432, -0.06667612875863235, 0.09578700545469145, 0.13564141378176384, 0.07735604268437879, 0.17778258834586447, -0.11759049527407928, -0.06869167030143117, 0.3845359900376605, -0.025779794363407934, -0.06154076623538481, 0.20161396242097843, -0.24698466165740063, -0.10642643105800277, 0.18094278975090378, 0.18844535946144006, 0.18924568431339597, -0.12088668164740089, -0.014779377448484864, 0.013593365597402929, 0.21697020393693306, 0.12977486334614755, 0.025200030363946406, 0.38756529762217745, 0.15236524108975152, 0.019611703623881815, 0.1307487745427681, -0.16303482010755316, -0.04348318396930597, -0.24396348525138206, -0.08148031998495922, -0.1492368477793298, 0.11424216325636122, -0.1323805767175538, -0.15310805429524307, 0.34635436807726344, 0.07094011503166751, 0.2490644205838966, 0.025291971682135633, 0.26485319594813794, 0.0840000844342358, 0.04187550250061755, 0.09881316781764728, 0.3260872679441961, 0.07609095734347537, 0.09273953803688587, -0.2442090001896763, 0.10425354398543661, 0.03786206871023093]
|
1,803.0501
|
Stable source reconstruction from a finite number of measurements in the
Multi-frequency Inverse Source Problem
|
We consider the multi-frequency inverse source problem for the scalar
Helmholtz equation in the plane. The goal is to reconstruct the source term in
the equation from measurements of the solution on a surface outside the support
of the source. We study the problem in a certain finite dimensional setting:
From measurements made at a finite set of frequencies we uniquely determine and
reconstruct sources in a subspace spanned by finitely many Fourier-Bessel
functions. Further, we obtain a constructive criterion for identifying a
minimal set of measurement frequencies sufficient for reconstruction, and under
an additional, mild assumption, the reconstruction method is shown to be
stable. Our analysis is based on a singular value decomposition of the
source-to-measurement forward operators and the distribution of positive zeros
of the Bessel functions of the first kind. The reconstruction method is
implemented numerically and our theoretical findings are supported by numerical
experiments.
|
math.NA
|
we consider the multifrequency inverse source problem for the scalar helmholtz equation in the plane the goal is to reconstruct the source term in the equation from measurements of the solution on a surface outside the support of the source we study the problem in a certain finite dimensional setting from measurements made at a finite set of frequencies we uniquely determine and reconstruct sources in a subspace spanned by finitely many fourierbessel functions further we obtain a constructive criterion for identifying a minimal set of measurement frequencies sufficient for reconstruction and under an additional mild assumption the reconstruction method is shown to be stable our analysis is based on a singular value decomposition of the sourcetomeasurement forward operators and the distribution of positive zeros of the bessel functions of the first kind the reconstruction method is implemented numerically and our theoretical findings are supported by numerical experiments
|
[['we', 'consider', 'the', 'multifrequency', 'inverse', 'source', 'problem', 'for', 'the', 'scalar', 'helmholtz', 'equation', 'in', 'the', 'plane', 'the', 'goal', 'is', 'to', 'reconstruct', 'the', 'source', 'term', 'in', 'the', 'equation', 'from', 'measurements', 'of', 'the', 'solution', 'on', 'a', 'surface', 'outside', 'the', 'support', 'of', 'the', 'source', 'we', 'study', 'the', 'problem', 'in', 'a', 'certain', 'finite', 'dimensional', 'setting', 'from', 'measurements', 'made', 'at', 'a', 'finite', 'set', 'of', 'frequencies', 'we', 'uniquely', 'determine', 'and', 'reconstruct', 'sources', 'in', 'a', 'subspace', 'spanned', 'by', 'finitely', 'many', 'fourierbessel', 'functions', 'further', 'we', 'obtain', 'a', 'constructive', 'criterion', 'for', 'identifying', 'a', 'minimal', 'set', 'of', 'measurement', 'frequencies', 'sufficient', 'for', 'reconstruction', 'and', 'under', 'an', 'additional', 'mild', 'assumption', 'the', 'reconstruction', 'method', 'is', 'shown', 'to', 'be', 'stable', 'our', 'analysis', 'is', 'based', 'on', 'a', 'singular', 'value', 'decomposition', 'of', 'the', 'sourcetomeasurement', 'forward', 'operators', 'and', 'the', 'distribution', 'of', 'positive', 'zeros', 'of', 'the', 'bessel', 'functions', 'of', 'the', 'first', 'kind', 'the', 'reconstruction', 'method', 'is', 'implemented', 'numerically', 'and', 'our', 'theoretical', 'findings', 'are', 'supported', 'by', 'numerical', 'experiments']]
|
[-0.10577054183572202, 0.047495538968419446, -0.10367324098399809, 0.05076077319111447, -0.07473062401555074, -0.08016758174857214, 0.038317585500197954, 0.3420543112082496, -0.28541934948896064, -0.23786532857334938, 0.1441351444283057, -0.2854596846008382, -0.1259660482102511, 0.24109828114180135, -0.012115535807802159, 0.09075398314870944, 0.0875197223999037, 0.041616230015167774, -0.07871237042028184, -0.19802148269052255, 0.3548956164760756, 0.02906415553852206, 0.2724527021122425, 0.059501494665481276, 0.1395664117520269, 0.0005432280528099359, -0.06715365542814794, -0.003957867128204326, -0.12925967303434147, 0.10786543547676332, 0.23449254269097128, 0.1404702046974784, 0.26760028879202546, -0.3843014949590576, -0.20831424611950053, 0.12091292332553742, 0.10988878858114155, 0.10238402693367683, -0.05981985677736906, -0.26978663887929955, 0.12931026470907617, -0.09817289708809433, -0.1658146259102489, -0.051670086234301124, -0.026007203005102217, 0.0026558312657922758, -0.32047114685513584, 0.0630912385884115, 0.03868347471326488, 0.04728082837346865, -0.13062203863673671, -0.09131580407788255, 0.0251962408474108, 0.08085386156418113, 0.0038017684516186514, 0.02161153845036035, 0.06095099315161304, -0.10012834799242543, -0.07584395631276654, 0.3515581779806007, -0.06873371367830605, -0.29202952109226565, 0.14335438731557304, -0.15833500353619456, -0.1095311313544457, 0.12328211039456786, 0.17398944121411666, 0.15931954964691278, -0.15018396069561796, 0.11223729956280566, -0.06808377065233329, 0.1471338943696302, 0.0713334782920195, -0.025733091009996174, 0.16910965344710213, 0.13040167418923101, 0.10058907763422689, 0.17337298699572276, -0.07868834206720396, -0.041213809661440504, -0.36206447089813193, -0.13057332985787368, -0.2353812958451216, 0.030160707219655872, -0.07941142821543515, -0.17549723620248522, 0.4355406861144061, 0.1241303724470409, 0.19570389478055594, 0.03575492252240933, 0.2913822496838893, 0.15909011303078935, 0.02466492059634251, 0.05170095949528777, 0.20147050120772755, 0.1633901817100059, 0.03982713065097476, -0.20557126969567874, 0.028646613873516014, 0.09720506316659097]
|
1,803.05011
|
A Probabilistic Disease Progression Model for Predicting Future Clinical
Outcome
|
In this work, we consider the problem of predicting the course of a
progressive disease, such as cancer or Alzheimer's. Progressive diseases often
start with mild symptoms that might precede a diagnosis, and each patient
follows their own trajectory. Patient trajectories exhibit wild variability,
which can be associated with many factors such as genotype, age, or sex. An
additional layer of complexity is that, in real life, the amount and type of
data available for each patient can differ significantly. For example, for one
patient we might have no prior history, whereas for another patient we might
have detailed clinical assessments obtained at multiple prior time-points. This
paper presents a probabilistic model that can handle multiple modalities
(including images and clinical assessments) and variable patient histories with
irregular timings and missing entries, to predict clinical scores at future
time-points. We use a sigmoidal function to model latent disease progression,
which gives rise to clinical observations in our generative model. We
implemented an approximate Bayesian inference strategy on the proposed model to
estimate the parameters on data from a large population of subjects.
Furthermore, the Bayesian framework enables the model to automatically
fine-tune its predictions based on historical observations that might be
available on the test subject. We applied our method to a longitudinal
Alzheimer's disease dataset with more than 3000 subjects [23] and present a
detailed empirical analysis of prediction performance under different
scenarios, with comparisons against several benchmarks. We also demonstrate how
the proposed model can be interrogated to glean insights about temporal
dynamics in Alzheimer's disease.
|
cs.LG cs.CV stat.ML
|
in this work we consider the problem of predicting the course of a progressive disease such as cancer or alzheimers progressive diseases often start with mild symptoms that might precede a diagnosis and each patient follows their own trajectory patient trajectories exhibit wild variability which can be associated with many factors such as genotype age or sex an additional layer of complexity is that in real life the amount and type of data available for each patient can differ significantly for example for one patient we might have no prior history whereas for another patient we might have detailed clinical assessments obtained at multiple prior timepoints this paper presents a probabilistic model that can handle multiple modalities including images and clinical assessments and variable patient histories with irregular timings and missing entries to predict clinical scores at future timepoints we use a sigmoidal function to model latent disease progression which gives rise to clinical observations in our generative model we implemented an approximate bayesian inference strategy on the proposed model to estimate the parameters on data from a large population of subjects furthermore the bayesian framework enables the model to automatically finetune its predictions based on historical observations that might be available on the test subject we applied our method to a longitudinal alzheimers disease dataset with more than 3000 subjects 23 and present a detailed empirical analysis of prediction performance under different scenarios with comparisons against several benchmarks we also demonstrate how the proposed model can be interrogated to glean insights about temporal dynamics in alzheimers disease
|
[['in', 'this', 'work', 'we', 'consider', 'the', 'problem', 'of', 'predicting', 'the', 'course', 'of', 'a', 'progressive', 'disease', 'such', 'as', 'cancer', 'or', 'alzheimers', 'progressive', 'diseases', 'often', 'start', 'with', 'mild', 'symptoms', 'that', 'might', 'precede', 'a', 'diagnosis', 'and', 'each', 'patient', 'follows', 'their', 'own', 'trajectory', 'patient', 'trajectories', 'exhibit', 'wild', 'variability', 'which', 'can', 'be', 'associated', 'with', 'many', 'factors', 'such', 'as', 'genotype', 'age', 'or', 'sex', 'an', 'additional', 'layer', 'of', 'complexity', 'is', 'that', 'in', 'real', 'life', 'the', 'amount', 'and', 'type', 'of', 'data', 'available', 'for', 'each', 'patient', 'can', 'differ', 'significantly', 'for', 'example', 'for', 'one', 'patient', 'we', 'might', 'have', 'no', 'prior', 'history', 'whereas', 'for', 'another', 'patient', 'we', 'might', 'have', 'detailed', 'clinical', 'assessments', 'obtained', 'at', 'multiple', 'prior', 'timepoints', 'this', 'paper', 'presents', 'a', 'probabilistic', 'model', 'that', 'can', 'handle', 'multiple', 'modalities', 'including', 'images', 'and', 'clinical', 'assessments', 'and', 'variable', 'patient', 'histories', 'with', 'irregular', 'timings', 'and', 'missing', 'entries', 'to', 'predict', 'clinical', 'scores', 'at', 'future', 'timepoints', 'we', 'use', 'a', 'sigmoidal', 'function', 'to', 'model', 'latent', 'disease', 'progression', 'which', 'gives', 'rise', 'to', 'clinical', 'observations', 'in', 'our', 'generative', 'model', 'we', 'implemented', 'an', 'approximate', 'bayesian', 'inference', 'strategy', 'on', 'the', 'proposed', 'model', 'to', 'estimate', 'the', 'parameters', 'on', 'data', 'from', 'a', 'large', 'population', 'of', 'subjects', 'furthermore', 'the', 'bayesian', 'framework', 'enables', 'the', 'model', 'to', 'automatically', 'finetune', 'its', 'predictions', 'based', 'on', 'historical', 'observations', 'that', 'might', 'be', 'available', 'on', 'the', 'test', 'subject', 'we', 'applied', 'our', 'method', 'to', 'a', 'longitudinal', 'alzheimers', 'disease', 'dataset', 'with', 'more', 'than', '3000', 'subjects', '23', 'and', 'present', 'a', 'detailed', 'empirical', 'analysis', 'of', 'prediction', 'performance', 'under', 'different', 'scenarios', 'with', 'comparisons', 'against', 'several', 'benchmarks', 'we', 'also', 'demonstrate', 'how', 'the', 'proposed', 'model', 'can', 'be', 'interrogated', 'to', 'glean', 'insights', 'about', 'temporal', 'dynamics', 'in', 'alzheimers', 'disease']]
|
[-0.01622056262703006, 0.040750839546356214, -0.09611239416485061, 0.10572084978849143, -0.12336735637829632, -0.17825198839346396, 0.08180242112807048, 0.4436982269380819, -0.2272571409148229, -0.3119334534619206, 0.12176827485709227, -0.2801351846563955, -0.1840996022551418, 0.2191735508169459, -0.15616530859878994, 0.02288660210581648, 0.16608741282891074, 0.0691277477583422, -0.0003967832593660614, -0.2865249627832027, 0.2574580108102541, 0.051451556937761836, 0.29520915232439954, -0.006993637755269531, 0.07943868133430766, -0.00879232658528138, -0.05115912127662306, -0.008131051244748425, -0.08980472070163173, 0.11360986506369672, 0.32528964921384473, 0.2494655155194129, 0.3582795924347349, -0.45374604460851886, -0.2706458496043545, 0.10984897517144333, 0.1350085748668197, 0.12000654738616602, -0.005295756266936533, -0.3022817172752621, 0.06551315927270678, -0.16594610126082635, -0.07496873255217378, -0.08382228823638586, -0.037352351046053604, -0.02606729088827621, -0.32502481182892773, 0.11843632020914924, -0.03457721169269102, 0.13642403998054825, -0.1084733650439361, -0.13804306891745013, -0.0156469361950434, 0.17972825796256753, 0.10479849451013963, 0.034056714122263035, 0.15378149853867673, -0.1440117365532634, -0.14775824586160538, 0.31893751678208626, -0.014310082983211595, -0.17570794043230442, 0.21580918904397522, -0.10128048712941781, -0.15460093901853633, 0.09836267342139171, 0.23285882681961959, 0.07284031097069671, -0.19901958043152798, -0.07742318053063828, -0.010918937545890609, 0.20043499153396188, 0.025984232183076557, -0.04410497127458419, 0.18035765659233713, 0.20879126775670478, -0.02897348368649602, 0.0863203028809864, -0.14366015793178988, -0.06316339130722737, -0.23932716534193244, -0.12112218259595507, -0.09573740438763918, 0.04302863790085106, -0.12055460854522368, -0.1809984651545799, 0.43336670502096186, 0.21452118672648568, 0.18989627134657733, 0.06351732518325394, 0.2653236258522311, 0.029101469160541314, 0.07962498572644193, 0.00443548888379578, 0.11182574035853414, 0.008933586240367055, 0.08822488093517664, -0.1925981177464705, 0.19461333294455035, -0.040238241083891124]
|
1,803.05012
|
Using RuleBuilder to graphically define and visualize BioNetGen-language
patterns and reaction rules
|
RuleBuilder is a tool for drawing graphs that can be represented by the
BioNetGen language (BNGL), which is used to formulate mathematical, rule-based
models of biochemical systems. BNGL provides an intuitive plain-text, or
string, representation of such systems, which is based on a graphical
formalism. Reactions are defined in terms of graph-rewriting rules that specify
the necessary intrinsic properties of the reactants, a transformation, and a
rate law. Rules may also contain contextual constraints that restrict
application of the rule. In some cases, the specification of contextual
constraints can be verbose, making a rule difficult to read. RuleBuilder is
designed to ease the task of reading and writing individual reaction rules, as
well as individual BNGL patterns similar to those found in rules. The software
assists in the reading of existing models by converting BNGL strings of
interest into a graph-based representation composed of nodes and edges.
RuleBuilder also enables the user to construct de novo a visual representation
of BNGL strings using drawing tools available in its interface. As objects are
added to the drawing canvas, the corresponding BNGL string is generated on the
fly, and objects are similarly drawn on the fly as BNGL strings are entered
into the application. RuleBuilder thus facilitates construction and
interpretation of rule-based models.
|
q-bio.QM
|
rulebuilder is a tool for drawing graphs that can be represented by the bionetgen language bngl which is used to formulate mathematical rulebased models of biochemical systems bngl provides an intuitive plaintext or string representation of such systems which is based on a graphical formalism reactions are defined in terms of graphrewriting rules that specify the necessary intrinsic properties of the reactants a transformation and a rate law rules may also contain contextual constraints that restrict application of the rule in some cases the specification of contextual constraints can be verbose making a rule difficult to read rulebuilder is designed to ease the task of reading and writing individual reaction rules as well as individual bngl patterns similar to those found in rules the software assists in the reading of existing models by converting bngl strings of interest into a graphbased representation composed of nodes and edges rulebuilder also enables the user to construct de novo a visual representation of bngl strings using drawing tools available in its interface as objects are added to the drawing canvas the corresponding bngl string is generated on the fly and objects are similarly drawn on the fly as bngl strings are entered into the application rulebuilder thus facilitates construction and interpretation of rulebased models
|
[['rulebuilder', 'is', 'a', 'tool', 'for', 'drawing', 'graphs', 'that', 'can', 'be', 'represented', 'by', 'the', 'bionetgen', 'language', 'bngl', 'which', 'is', 'used', 'to', 'formulate', 'mathematical', 'rulebased', 'models', 'of', 'biochemical', 'systems', 'bngl', 'provides', 'an', 'intuitive', 'plaintext', 'or', 'string', 'representation', 'of', 'such', 'systems', 'which', 'is', 'based', 'on', 'a', 'graphical', 'formalism', 'reactions', 'are', 'defined', 'in', 'terms', 'of', 'graphrewriting', 'rules', 'that', 'specify', 'the', 'necessary', 'intrinsic', 'properties', 'of', 'the', 'reactants', 'a', 'transformation', 'and', 'a', 'rate', 'law', 'rules', 'may', 'also', 'contain', 'contextual', 'constraints', 'that', 'restrict', 'application', 'of', 'the', 'rule', 'in', 'some', 'cases', 'the', 'specification', 'of', 'contextual', 'constraints', 'can', 'be', 'verbose', 'making', 'a', 'rule', 'difficult', 'to', 'read', 'rulebuilder', 'is', 'designed', 'to', 'ease', 'the', 'task', 'of', 'reading', 'and', 'writing', 'individual', 'reaction', 'rules', 'as', 'well', 'as', 'individual', 'bngl', 'patterns', 'similar', 'to', 'those', 'found', 'in', 'rules', 'the', 'software', 'assists', 'in', 'the', 'reading', 'of', 'existing', 'models', 'by', 'converting', 'bngl', 'strings', 'of', 'interest', 'into', 'a', 'graphbased', 'representation', 'composed', 'of', 'nodes', 'and', 'edges', 'rulebuilder', 'also', 'enables', 'the', 'user', 'to', 'construct', 'de', 'novo', 'a', 'visual', 'representation', 'of', 'bngl', 'strings', 'using', 'drawing', 'tools', 'available', 'in', 'its', 'interface', 'as', 'objects', 'are', 'added', 'to', 'the', 'drawing', 'canvas', 'the', 'corresponding', 'bngl', 'string', 'is', 'generated', 'on', 'the', 'fly', 'and', 'objects', 'are', 'similarly', 'drawn', 'on', 'the', 'fly', 'as', 'bngl', 'strings', 'are', 'entered', 'into', 'the', 'application', 'rulebuilder', 'thus', 'facilitates', 'construction', 'and', 'interpretation', 'of', 'rulebased', 'models']]
|
[-0.08194794055345905, 0.07869779401999773, -0.10996042599946247, 0.08783691433662222, -0.17302239038959427, -0.16768448040224787, 0.08273077909658129, 0.3695589066019626, -0.2596854546010247, -0.32279400976807304, 0.07982473990988093, -0.25947918794316494, -0.14412848344315463, 0.18819316495783733, -0.08955975085214415, 0.039823050967967184, 0.0689358735982311, 0.07764585198110667, -0.014868834864798387, -0.21152252416784093, 0.26968323996939403, 0.0602939531374811, 0.2791461518036546, 0.0008974640709634923, 0.10913181131522467, 0.01432740269173643, -0.06187019887119885, 0.011156516035492033, -0.073453836634575, 0.1623762728430119, 0.3147210582741088, 0.23821029910526428, 0.21143875709377336, -0.4486142720285609, -0.18085001952716115, 0.057991655455169516, 0.1507175466348086, 0.12326616462280365, 0.006315962114080045, -0.2931883598223187, 0.0792499935818324, -0.16530958060682774, -0.0346675109983338, -0.10802966229710287, 0.025736193346204892, 0.035305406889432414, -0.2558394187914596, -0.011544916380676954, 0.0938600712147943, 0.05226246218342705, -0.02404127729299668, -0.09866024808896379, -0.038960364533001245, 0.18247474328244007, 0.0055096781127357865, 0.029691908054602204, 0.15020533138444708, -0.14918149979255424, -0.15865718702878362, 0.4183131877897899, 0.002426615991228, -0.242020694181429, 0.18359972060530036, -0.006462718130605763, -0.1489957090626113, 0.085906577120001, 0.15465078829683945, 0.10897726758336455, -0.1913391956573979, 0.08521861000669573, 0.00011283015805821848, 0.17798442892747893, 0.09077731171463974, 0.02459466455601403, 0.24868076568981412, 0.17701800639180565, -0.015266563200725074, 0.1563392862538538, -0.0006295491343196394, -0.09346305420600161, -0.2598524629943938, -0.13835495265899847, -0.14322929361159803, 0.012434892082736956, -0.07628013123834, -0.18881410574849466, 0.3332531005684816, 0.1361018974246828, 0.18759457646406427, 0.06486283031168671, 0.26105922735980336, 0.07480807880478166, 0.1059425616996808, 0.03323624314606781, 0.12414759181738363, 0.07412271657782073, 0.0894267138742546, -0.12853404627594284, 0.11008627535841511, 0.08871551318495795]
|
1,803.05013
|
Sturm Liouville Equations in the frame of fractional operators with
Mittag-Leffler kernels and their discrete versions
|
Very recently, some authors have studied new types of fractional derivatives
whose kernels are nonsingular. In this article, we study Sturm-Liouville
Equations ($SLEs$) in the frame of fractional operators with Mittag-Leffler
kernels. We formulate some Fractional Sturm-Liouville Problems ($FSLPs$) with
the diffferential part containing the left and right sided derivatives. We
investigate the self-adjointness, eigenvalue and eigenfunction properties of
the corresponding Fractional Sturm-Liouville Operators ($FSLOs$) by using
fractional integration by parts formulas. The nabla discrete version of our
results are also established.
|
math.CA math.DS
|
very recently some authors have studied new types of fractional derivatives whose kernels are nonsingular in this article we study sturmliouville equations sles in the frame of fractional operators with mittagleffler kernels we formulate some fractional sturmliouville problems fslps with the diffferential part containing the left and right sided derivatives we investigate the selfadjointness eigenvalue and eigenfunction properties of the corresponding fractional sturmliouville operators fslos by using fractional integration by parts formulas the nabla discrete version of our results are also established
|
[['very', 'recently', 'some', 'authors', 'have', 'studied', 'new', 'types', 'of', 'fractional', 'derivatives', 'whose', 'kernels', 'are', 'nonsingular', 'in', 'this', 'article', 'we', 'study', 'sturmliouville', 'equations', 'sles', 'in', 'the', 'frame', 'of', 'fractional', 'operators', 'with', 'mittagleffler', 'kernels', 'we', 'formulate', 'some', 'fractional', 'sturmliouville', 'problems', 'fslps', 'with', 'the', 'diffferential', 'part', 'containing', 'the', 'left', 'and', 'right', 'sided', 'derivatives', 'we', 'investigate', 'the', 'selfadjointness', 'eigenvalue', 'and', 'eigenfunction', 'properties', 'of', 'the', 'corresponding', 'fractional', 'sturmliouville', 'operators', 'fslos', 'by', 'using', 'fractional', 'integration', 'by', 'parts', 'formulas', 'the', 'nabla', 'discrete', 'version', 'of', 'our', 'results', 'are', 'also', 'established']]
|
[-0.10943600870668888, 0.010336106047907379, -0.023817684494861168, 0.06461812785564688, -0.13608910404436755, -0.11362463380210101, -0.08039869833592092, 0.35969325313344597, -0.29589405658189205, -0.20768747192341835, 0.2093977976270253, -0.3393005382269621, -0.1653441326925531, 0.14934212982770986, -0.08376948615095899, 0.12411150308325887, 0.016945786046562716, 0.029918939457274973, -0.12404405228444375, -0.1909258236992173, 0.4044561350252479, -0.05603339187800884, 0.10655841250554658, 0.029267623997293414, 0.08897482705651782, -0.07179044994991272, -0.10162718202918768, -0.05845077047124505, -0.21175600082497112, 0.13432979870121925, 0.2490173280792078, -0.016522343060933052, 0.3207012914586812, -0.45242326306179165, -0.16822559791617095, 0.14379695656243713, 0.10654323924100026, -0.031249984866008162, -0.012874641327653081, -0.36967931884573774, 0.059243744291597976, -0.1243075034202775, -0.1709429445792921, -0.09212369332708477, 0.05238749044947326, 0.10192964870511786, -0.2440828006830998, 0.14234600673917158, 0.056931553641334176, 0.00024877590185496957, -0.11540988404376548, -0.19599426108179613, 0.03254557415202726, 0.019285145227331667, 0.023874977926607244, -0.11208043745427858, -0.00971222723601386, -0.08537447212438565, -0.1717187829548493, 0.3086805744038429, -0.07355529175256378, -0.30924420496448873, 0.07379056281642989, -0.18990744823240674, -0.1462104877224192, 0.017643591685919092, 0.09154012838262134, 0.20297321218531578, -0.18489639819599687, 0.17944039711583173, -0.0560211003292352, 0.06276081247488037, 0.1658840898773633, 0.07161057866178452, 0.07299538100487553, 0.06773138380522141, 0.0930275531805819, 0.15652799839444925, 0.007389517016417812, -0.14954764740541576, -0.3745658690109849, -0.19483811969403178, -0.16117004432890097, 0.041835547602568114, -0.10727000174192654, -0.20262805257225408, 0.45646977238357067, 0.11180066475644708, 0.14817080480279401, 0.08529416328528897, 0.18005890045315026, 0.30867678891663675, 0.03403292684815824, 0.04967390546116803, 0.0962896423159691, 0.2151856755663175, 0.15817547229817136, -0.1967803789419122, -0.037455166899599136, 0.23116219995426945]
|
1,803.05014
|
Weyl and intuitionistic infinitesimals
|
As Weyl was interested in infinitesimal analysis and for some years embraced
Brouwer's intuitionism, which he continued to see as an ideal even after he had
convinced himself that it is a practical necessity for science to go beyond
intuitionistic mathematics, this note presents some remarks on infinitesimals
from a Brouwerian perspective. After an introduction and a look at Robinson's
and Nelson's approaches to classical nonstandard analysis, three desiderata for
an intuitionistic construction of infinitesimals are extracted from Brouwer's
writings. These cannot be met, but in explicitly Brouwerian settings what might
in different ways be called approximations to infinitesimals have been
developed by early Brouwer, Vesley, and Reeb. I conclude that perhaps Reeb's
approach, with its Brouwerian motivation for accepting Nelson's classical
formalism, would have suited Weyl best.
|
math.HO
|
as weyl was interested in infinitesimal analysis and for some years embraced brouwers intuitionism which he continued to see as an ideal even after he had convinced himself that it is a practical necessity for science to go beyond intuitionistic mathematics this note presents some remarks on infinitesimals from a brouwerian perspective after an introduction and a look at robinsons and nelsons approaches to classical nonstandard analysis three desiderata for an intuitionistic construction of infinitesimals are extracted from brouwers writings these cannot be met but in explicitly brouwerian settings what might in different ways be called approximations to infinitesimals have been developed by early brouwer vesley and reeb i conclude that perhaps reebs approach with its brouwerian motivation for accepting nelsons classical formalism would have suited weyl best
|
[['as', 'weyl', 'was', 'interested', 'in', 'infinitesimal', 'analysis', 'and', 'for', 'some', 'years', 'embraced', 'brouwers', 'intuitionism', 'which', 'he', 'continued', 'to', 'see', 'as', 'an', 'ideal', 'even', 'after', 'he', 'had', 'convinced', 'himself', 'that', 'it', 'is', 'a', 'practical', 'necessity', 'for', 'science', 'to', 'go', 'beyond', 'intuitionistic', 'mathematics', 'this', 'note', 'presents', 'some', 'remarks', 'on', 'infinitesimals', 'from', 'a', 'brouwerian', 'perspective', 'after', 'an', 'introduction', 'and', 'a', 'look', 'at', 'robinsons', 'and', 'nelsons', 'approaches', 'to', 'classical', 'nonstandard', 'analysis', 'three', 'desiderata', 'for', 'an', 'intuitionistic', 'construction', 'of', 'infinitesimals', 'are', 'extracted', 'from', 'brouwers', 'writings', 'these', 'can', 'not', 'be', 'met', 'but', 'in', 'explicitly', 'brouwerian', 'settings', 'what', 'might', 'in', 'different', 'ways', 'be', 'called', 'approximations', 'to', 'infinitesimals', 'have', 'been', 'developed', 'by', 'early', 'brouwer', 'vesley', 'and', 'reeb', 'i', 'conclude', 'that', 'perhaps', 'reebs', 'approach', 'with', 'its', 'brouwerian', 'motivation', 'for', 'accepting', 'nelsons', 'classical', 'formalism', 'would', 'have', 'suited', 'weyl', 'best']]
|
[-0.02428806307943887, 0.0688072996703113, -0.1812750945427979, 0.16103266835489194, -0.16015950643486576, -0.21059610874362988, 0.04964788047072943, 0.3240717487869915, -0.2666217352380045, -0.2668845965949913, 0.11868047509415192, -0.2756131407513749, -0.14198153198958607, 0.2020945741714968, -0.18197147108003264, -0.003207344328529871, 0.04682265414066933, 0.053998170259546896, -0.04734880491196236, -0.2970203630175092, 0.3021360202365031, 0.07330799787268916, 0.20926089776185108, 0.03994958801922621, 0.05868594280036632, 0.00605360139388722, -0.045897896743554156, 0.03144805541523965, -0.12083346505153258, 0.09323104567283735, 0.3320247038209345, 0.22327216839221364, 0.3614334847370628, -0.44650183799967635, -0.16046438628632131, 0.06785462981542878, 0.11942675202226383, 0.11693008573911357, -0.019927237627598515, -0.3058861028403044, 0.06375889597711648, -0.18009643749610404, -0.16614954774195212, -0.12211841172666027, 0.07676054789044429, -0.04401723163027782, -0.13533514240953082, -0.022520973432392566, 0.16868509257801634, 0.14596641455500503, 0.012343196658321176, -0.15212271506607067, 0.05146690902074624, 0.07348411535349442, 0.0709797597751276, 0.0050125712259614374, 0.0949134020575002, -0.09178558507665002, -0.18684179677347856, 0.3786819652596023, 0.010520810923480894, -0.15218864339931315, 0.18547224573558196, -0.08189584229694447, -0.20333412507352477, 0.07026298563141609, 0.04946961150926654, 0.07145177520737889, -0.14489942097952735, 0.13473141740360006, -0.039445314010663424, 0.08121120334180887, 0.14528325500214123, -0.006965098418731941, 0.231559045620088, 0.07991798959483276, -0.006138654837741342, 0.04528755307728716, 0.048566626233878196, -0.10003408487682464, -0.34360677691802266, -0.18456920684732836, -0.12375433193119534, 0.10428327026068018, -0.004574131415438387, -0.15575546141917584, 0.2989559714333154, 0.2027147053659064, 0.09306502309482312, 0.04579017674859642, 0.25189912254518276, 0.07302327794786834, 0.04291100572072537, 0.046973839425845654, 0.25878385805708604, 0.1312342637229449, 0.1570823653928528, -0.040486881698598154, 0.08137153685129306, 0.1353675623968229]
|
1,803.05015
|
How Information Crosses Schwarzschild's Central Singularity
|
We study the natural extension of spacetime across Schwarzschild's central
singularity and the behavior of the geodesics crossing it. Locality implies
that this extension is independent from the future fate of black holes. We
argue that this extension is the natural $\hbar\!\to\!0$ limit of the effective
quantum geometry inside a black hole, and show that the central region contains
causal diamonds with area satisfying Bousso's bound for an entropy that can be
as large as Hawking's radiation entropy. This result sheds light on the
possibility that Hawking radiation is purified by information crossing the
internal singularity.
|
gr-qc
|
we study the natural extension of spacetime across schwarzschilds central singularity and the behavior of the geodesics crossing it locality implies that this extension is independent from the future fate of black holes we argue that this extension is the natural hbarto0 limit of the effective quantum geometry inside a black hole and show that the central region contains causal diamonds with area satisfying boussos bound for an entropy that can be as large as hawkings radiation entropy this result sheds light on the possibility that hawking radiation is purified by information crossing the internal singularity
|
[['we', 'study', 'the', 'natural', 'extension', 'of', 'spacetime', 'across', 'schwarzschilds', 'central', 'singularity', 'and', 'the', 'behavior', 'of', 'the', 'geodesics', 'crossing', 'it', 'locality', 'implies', 'that', 'this', 'extension', 'is', 'independent', 'from', 'the', 'future', 'fate', 'of', 'black', 'holes', 'we', 'argue', 'that', 'this', 'extension', 'is', 'the', 'natural', 'hbarto0', 'limit', 'of', 'the', 'effective', 'quantum', 'geometry', 'inside', 'a', 'black', 'hole', 'and', 'show', 'that', 'the', 'central', 'region', 'contains', 'causal', 'diamonds', 'with', 'area', 'satisfying', 'boussos', 'bound', 'for', 'an', 'entropy', 'that', 'can', 'be', 'as', 'large', 'as', 'hawkings', 'radiation', 'entropy', 'this', 'result', 'sheds', 'light', 'on', 'the', 'possibility', 'that', 'hawking', 'radiation', 'is', 'purified', 'by', 'information', 'crossing', 'the', 'internal', 'singularity']]
|
[-0.13225014867202844, 0.1308158422939414, -0.13830722135996135, 0.1390851688144418, -0.07099076394418564, -0.11025003432587255, 0.03067620073488797, 0.25190604336482164, -0.22148815113663053, -0.2618633302433106, 0.0914664863763998, -0.32802856628162164, -0.12037596885541764, 0.18612599871524557, -0.1153148167265196, -0.009863668897499641, 0.03573099261363192, 0.07646792539162561, -0.044715145474280384, -0.18723877310791673, 0.3924408662909021, 0.11335375722046592, 0.28174611992047477, 0.10240986221955002, 0.09952768823131919, 0.059295521247501405, 0.05230001972328561, 0.0746738972957246, -0.1429219543488974, 0.09795887318129341, 0.20908159803366289, 0.17654904069111885, 0.20010599944119653, -0.3816656359025122, -0.2612284945207648, 0.08769690520421136, 0.1412820195352348, 0.14235698870227984, -0.09116875669982012, -0.24723838210775284, 0.08155585085417745, -0.17172683443156225, -0.17944163879049788, 0.004018930669796343, 0.05067260681077338, -0.08518417482749403, -0.17238492841715924, 0.10966328842399282, 0.14238327729981393, -0.021959069776736822, -0.056693484477970436, 0.011819082717314208, -0.022395812906324863, 0.07432874288739792, 0.08274090381504114, 0.024849505369274993, 0.19069556321483105, -0.07484980372798115, -0.09627961014242221, 0.32186281130998395, -0.06723196137318155, -0.1706190597760724, 0.14584701346999887, -0.2028558399809602, -0.1010284905739051, 0.10110770628671162, 0.09135279708910578, 0.166829613619484, -0.12904963630717248, 0.16792473959382428, -0.06399361193083071, 0.14222184428945184, 0.1351387790152027, 0.08628696219238918, 0.34936953442714486, 0.11993673674199574, 0.05789128460067635, 0.20332769894230296, -0.06675073107423184, -0.11889305382889385, -0.37203639357661206, -0.20396994061411533, -0.17696536285317657, 0.13673006070651658, -0.15672806777941636, -0.16072285224072402, 0.3082721767326196, 0.13070738624082878, 0.18348741259251256, 0.0250680156383775, 0.25520009759160683, 0.08594532339823975, 0.07374347284591447, 0.11377387279935647, 0.27194330282509327, 0.10869521383089402, 0.0786714763623119, -0.251002666237279, 0.0014303518692031503, 0.07667269443239395]
|
1,803.05016
|
Discrete Fractional Solutions of a Physical Differential Equation via $
\nabla $-DFC Operator
|
Discrete mathematics, the study of finite structures, is one of the fastest
growing areas in mathematics and optimization. Discrete fractional calculus
(DFC) theory that is an important subject of the fractional calculus includes
the difference of fractional order. In present paper, we mention the radial
Schr{\"o}dinger equation which is a physical and singular differential
equation. And, we can obtain the particular solutions of this equation by
applying nabla ($ \nabla $) discrete fractional operator. This operator gives
successful results for the singular equations, and solutions have fractional
forms including discrete shift operator $ E $.
|
math.CA
|
discrete mathematics the study of finite structures is one of the fastest growing areas in mathematics and optimization discrete fractional calculus dfc theory that is an important subject of the fractional calculus includes the difference of fractional order in present paper we mention the radial schrodinger equation which is a physical and singular differential equation and we can obtain the particular solutions of this equation by applying nabla nabla discrete fractional operator this operator gives successful results for the singular equations and solutions have fractional forms including discrete shift operator e
|
[['discrete', 'mathematics', 'the', 'study', 'of', 'finite', 'structures', 'is', 'one', 'of', 'the', 'fastest', 'growing', 'areas', 'in', 'mathematics', 'and', 'optimization', 'discrete', 'fractional', 'calculus', 'dfc', 'theory', 'that', 'is', 'an', 'important', 'subject', 'of', 'the', 'fractional', 'calculus', 'includes', 'the', 'difference', 'of', 'fractional', 'order', 'in', 'present', 'paper', 'we', 'mention', 'the', 'radial', 'schrodinger', 'equation', 'which', 'is', 'a', 'physical', 'and', 'singular', 'differential', 'equation', 'and', 'we', 'can', 'obtain', 'the', 'particular', 'solutions', 'of', 'this', 'equation', 'by', 'applying', 'nabla', 'nabla', 'discrete', 'fractional', 'operator', 'this', 'operator', 'gives', 'successful', 'results', 'for', 'the', 'singular', 'equations', 'and', 'solutions', 'have', 'fractional', 'forms', 'including', 'discrete', 'shift', 'operator', 'e']]
|
[-0.12443103339871044, 0.04881335459767897, -0.10616475843138747, 0.05404798299135579, -0.1654838796009074, -0.11559635443244498, -0.04756002299804855, 0.2670129503319833, -0.333895137287922, -0.25073771348611995, 0.13983412044235394, -0.301302087401132, -0.18385512989198605, 0.17304957902652549, -0.10144650741674743, 0.09307534751165045, 0.015184241776856093, 0.047545365354680756, -0.0908728754761946, -0.1662747102219018, 0.35417302219442776, -0.08025152886613876, 0.19168349746410007, 0.03355657853759252, 0.1533953003012217, -0.04291807494259307, -0.07628988059094319, -0.04291086191577571, -0.17369278610703487, 0.14843455741980247, 0.2570031606848096, 0.030594747145097335, 0.34911723322347626, -0.45696678094483995, -0.20354727479618984, 0.12544596789322876, 0.1296130718642866, 0.07391350876391548, -0.03186322548068487, -0.29702958771651916, 0.061802966694173574, -0.12475373406618179, -0.17624056387876907, -0.07002238753241496, 0.10220650964222111, 0.06215568196673233, -0.2489651774393988, 0.14754039669347987, 0.0852291642401654, 0.02106161505638898, -0.12987832612982328, -0.12566871474404911, -0.012584526357906205, 0.028382357747222368, 0.014711755972642165, 0.02151076525582799, 0.01693967121376932, -0.09271814859891822, -0.16185719023489362, 0.37237164556754976, -0.058667551865545356, -0.28036510213636434, 0.08811936632904051, -0.1420739882441422, -0.1428810450463341, 0.06598526459944608, 0.15452152236804859, 0.17542631124340735, -0.12954278463743382, 0.20897231551122616, -0.0403011559254802, 0.10971620931689229, 0.08578200258089455, 0.01684389498269001, 0.06216540026150971, 0.1291490971689, 0.15924051192404887, 0.11687725567729673, -0.010131105053965207, -0.1838424812060791, -0.3690178829890031, -0.1877342517395596, -0.11697026126209524, 0.07821743841190915, -0.09985346569625947, -0.18772633404440278, 0.40397018761179604, 0.11375090211200026, 0.10148747299112133, 0.010323448895968005, 0.2133858047916994, 0.33370798526863965, -0.0001775078004696867, 0.046048369437742695, 0.13113786086726648, 0.22395937538009833, 0.19056277791201903, -0.2223142346694738, -0.00720079430982798, 0.14074005094448944]
|
1,803.05017
|
On Computing Jacobi's Elliptic Function \texttt{sn}
|
The paper presents a method to compute the Jacobi's elliptic function
\texttt{sn} on the period parallelogram. For fixed $m$ it requires first to
compute the complete elliptic integrals $K=K(m)$ and $K'=K(1-m).$ The Newton
method is used to compute sn(z,m), when $z\in [0,K]\cup[0,i K').$ The
computation in any other point does not require the usage of any numerical
procedure, it is done only with the help of the properties of sn.
|
math.CA math.NA
|
the paper presents a method to compute the jacobis elliptic function textttsn on the period parallelogram for fixed m it requires first to compute the complete elliptic integrals kkm and kk1m the newton method is used to compute snzm when zin 0kcup0i k the computation in any other point does not require the usage of any numerical procedure it is done only with the help of the properties of sn
|
[['the', 'paper', 'presents', 'a', 'method', 'to', 'compute', 'the', 'jacobis', 'elliptic', 'function', 'textttsn', 'on', 'the', 'period', 'parallelogram', 'for', 'fixed', 'm', 'it', 'requires', 'first', 'to', 'compute', 'the', 'complete', 'elliptic', 'integrals', 'kkm', 'and', 'kk1m', 'the', 'newton', 'method', 'is', 'used', 'to', 'compute', 'snzm', 'when', 'zin', '0kcup0i', 'k', 'the', 'computation', 'in', 'any', 'other', 'point', 'does', 'not', 'require', 'the', 'usage', 'of', 'any', 'numerical', 'procedure', 'it', 'is', 'done', 'only', 'with', 'the', 'help', 'of', 'the', 'properties', 'of', 'sn']]
|
[-0.1242554631846195, -0.011116037526252594, -0.1415518608762685, 0.03510063855951144, -0.1371108680067471, -0.13358346324160017, 0.0557382106939754, 0.3513504745946689, -0.27350670601608174, -0.27776999444221007, 0.10297273437908823, -0.2685231934160446, -0.13106115338759441, 0.24693744905843315, -0.08307523653572636, 0.06989054063645501, 0.07672549148044323, 0.09117940611516435, -0.12565256100655955, -0.3086271121900416, 0.3115678447101152, -0.0029095924798060546, 0.1938823931003836, 0.045046246963355574, 0.10517759345450693, 0.061216393704385016, -0.0560064468851179, -0.047029814407737416, -0.1441702404849683, 0.12664642784688057, 0.2393512065719926, 0.1224894302149275, 0.2397823981714971, -0.3796216107227586, -0.15779221808594285, 0.16976054635068233, 0.13420757438253725, 0.06469611230898988, 0.022405818773250125, -0.15113602199672835, 0.13142815824936738, -0.12913881123743273, -0.20798383229835468, -0.103552916813924, 0.009646888540098162, 0.030521581993635857, -0.2812661331510312, 0.017214948762998436, 0.051220095942192005, 0.04750591330230236, -0.0038553346724559865, -0.10275218694181548, -0.01164581182158806, 0.11383430915046835, 0.013608888440737219, 0.06058572466259427, 0.06902061642683817, -0.05634343350362597, -0.08487140085322387, 0.4114440588675665, -0.04771279639769063, -0.2275029125986762, 0.12005635537207127, -0.15545499846903663, -0.12849480661239024, 0.15283938090204063, 0.116025026005721, 0.21245606606967296, -0.10133412212709311, 0.12567155044719888, -0.016986243666685892, 0.15719475744117517, 0.04128212144485477, -0.0699562608744159, 0.13878831549575835, 0.06973179952932917, 0.11328774468027845, 0.11142503852677306, -0.0766034975302208, -0.05724827198763237, -0.34922849245820986, -0.19098222687501798, -0.21304785018561012, 0.06177869783807017, -0.08277817121261526, -0.20843961767174982, 0.3658835600610032, 0.12529564204371788, 0.19751458205847125, 0.0630053159583247, 0.28798119770362973, 0.15663399183981572, 0.10137283200839936, 0.11057731358221534, 0.1819213554545334, 0.09993352792155223, 0.12268714982113152, -0.23426474164465838, 0.05953810944673464, 0.1691914098478402]
|
1,803.05018
|
Fractional derivative of composite functions: exact results and physical
applications
|
We examine the fractional derivative of composite functions and present a
generalization of the product and chain rules for the Caputo fractional
derivative. These results are especially important for physical and biological
systems that exhibit multiple spatial and temporal scales, such as porous
materials and clusters of neurons, in which transport phenomena are governed by
a fractional derivative of slowly varying parameters given in terms of
elementary functions. Both the product and chain rules of the Caputo fractional
derivative are obtained from the expansion of the fractional derivative in
terms of an infinite series of integer order derivatives. The crucial step in
the practical implementation of the fractional product rule relies on the exact
evaluation of the repeated integral of the generalized hypergeometric function
with a power-law argument. By applying the generalized Euler's integral
transform, we are able to represent the repeated integral in terms of a single
hypergeometric function of a higher order. We demonstrate the obtained results
by the exact evaluation of the Caputo fractional derivative of hyperbolic
tangent which describes dark soliton propagation in the non-linear media. We
conclude that in the most general case both fractional chain and product rules
result in an infinite series of the generalized hypergeometric functions.
|
math.CA math-ph math.MP
|
we examine the fractional derivative of composite functions and present a generalization of the product and chain rules for the caputo fractional derivative these results are especially important for physical and biological systems that exhibit multiple spatial and temporal scales such as porous materials and clusters of neurons in which transport phenomena are governed by a fractional derivative of slowly varying parameters given in terms of elementary functions both the product and chain rules of the caputo fractional derivative are obtained from the expansion of the fractional derivative in terms of an infinite series of integer order derivatives the crucial step in the practical implementation of the fractional product rule relies on the exact evaluation of the repeated integral of the generalized hypergeometric function with a powerlaw argument by applying the generalized eulers integral transform we are able to represent the repeated integral in terms of a single hypergeometric function of a higher order we demonstrate the obtained results by the exact evaluation of the caputo fractional derivative of hyperbolic tangent which describes dark soliton propagation in the nonlinear media we conclude that in the most general case both fractional chain and product rules result in an infinite series of the generalized hypergeometric functions
|
[['we', 'examine', 'the', 'fractional', 'derivative', 'of', 'composite', 'functions', 'and', 'present', 'a', 'generalization', 'of', 'the', 'product', 'and', 'chain', 'rules', 'for', 'the', 'caputo', 'fractional', 'derivative', 'these', 'results', 'are', 'especially', 'important', 'for', 'physical', 'and', 'biological', 'systems', 'that', 'exhibit', 'multiple', 'spatial', 'and', 'temporal', 'scales', 'such', 'as', 'porous', 'materials', 'and', 'clusters', 'of', 'neurons', 'in', 'which', 'transport', 'phenomena', 'are', 'governed', 'by', 'a', 'fractional', 'derivative', 'of', 'slowly', 'varying', 'parameters', 'given', 'in', 'terms', 'of', 'elementary', 'functions', 'both', 'the', 'product', 'and', 'chain', 'rules', 'of', 'the', 'caputo', 'fractional', 'derivative', 'are', 'obtained', 'from', 'the', 'expansion', 'of', 'the', 'fractional', 'derivative', 'in', 'terms', 'of', 'an', 'infinite', 'series', 'of', 'integer', 'order', 'derivatives', 'the', 'crucial', 'step', 'in', 'the', 'practical', 'implementation', 'of', 'the', 'fractional', 'product', 'rule', 'relies', 'on', 'the', 'exact', 'evaluation', 'of', 'the', 'repeated', 'integral', 'of', 'the', 'generalized', 'hypergeometric', 'function', 'with', 'a', 'powerlaw', 'argument', 'by', 'applying', 'the', 'generalized', 'eulers', 'integral', 'transform', 'we', 'are', 'able', 'to', 'represent', 'the', 'repeated', 'integral', 'in', 'terms', 'of', 'a', 'single', 'hypergeometric', 'function', 'of', 'a', 'higher', 'order', 'we', 'demonstrate', 'the', 'obtained', 'results', 'by', 'the', 'exact', 'evaluation', 'of', 'the', 'caputo', 'fractional', 'derivative', 'of', 'hyperbolic', 'tangent', 'which', 'describes', 'dark', 'soliton', 'propagation', 'in', 'the', 'nonlinear', 'media', 'we', 'conclude', 'that', 'in', 'the', 'most', 'general', 'case', 'both', 'fractional', 'chain', 'and', 'product', 'rules', 'result', 'in', 'an', 'infinite', 'series', 'of', 'the', 'generalized', 'hypergeometric', 'functions']]
|
[-0.14813825664767885, 0.07464510710654876, -0.06146594924126368, 0.0768139260152227, -0.0996615839745466, -0.06854681030153205, 0.007892620461015944, 0.3352790183168562, -0.28741603665448745, -0.26283567481418596, 0.1259837682021088, -0.2568491115097833, -0.18937321662287657, 0.20275210519321263, -0.02052605354259083, 0.08805956178220381, -0.007806960286175394, 0.04038487189887639, -0.09200412568672761, -0.23141782850428833, 0.3376445705710235, -0.027088097145429393, 0.20880878963233793, 0.01901448383132982, 0.15428841448338776, 0.013423219471530733, -0.09172489246417422, -0.02610338729459281, -0.13548643906024688, 0.13478786606648618, 0.21435834201710188, 0.02015153405384398, 0.291048735049188, -0.4426398141419186, -0.19851143790098527, 0.07699909117118474, 0.12683968543641122, 0.01764673597576535, 0.012767671417403856, -0.2844895205207114, 0.02205039276147955, -0.1908155001229698, -0.16242430924552642, -0.09337395394914876, 0.02512471501683524, 0.12302900351784832, -0.27600911735156414, 0.1410826000421509, 0.05928926862885847, 0.017583534651445614, -0.07915423626328964, -0.15542728454502316, 0.008710674170002925, 0.07308311510931555, 0.04199377638196536, -0.023822331394744562, 0.06422898069699752, -0.15316236610570008, -0.15551450703859182, 0.3647429863465767, -0.10314697770324226, -0.26026309825315636, 0.11123554808471132, -0.17140909367370505, -0.13201020629254773, 0.10729196009398555, 0.12405344419290915, 0.16731621930375695, -0.1397455732375794, 0.06822203709224613, -0.01734236827092793, 0.12610362926224136, 0.09591794449963845, 0.053815202930469666, 0.1516733123194974, 0.11656943345944598, 0.042508235733097824, 0.1854336016386857, -0.00833118864102289, -0.16297477023794735, -0.35259587023271405, -0.226105189051333, -0.18988739734627683, 0.042046737619767, -0.1691729918427739, -0.20633201826564676, 0.4031598919964916, 0.09150321026435021, 0.12746239757874647, 0.071573970017626, 0.22010929920304312, 0.25391647996530436, 0.04675919994456219, -0.009114782958218427, 0.14413904057765453, 0.1338389087388493, 0.11543983919317742, -0.2178874938131319, 0.04603698213959076, 0.1341990075866217]
|
1,803.05019
|
Minimum error correction-based haplotype assembly: considerations for
long read data
|
The single nucleotide polymorphism (SNP) is the most widely studied type of
genetic variation. A haplotype is defined as the sequence of alleles at SNP
sites on each haploid chromosome. Haplotype information is essential in
unravelling the genome-phenotype association. Haplotype assembly is a
well-known approach for reconstructing haplotypes, exploiting reads generated
by DNA sequencing devices. The Minimum Error Correction (MEC) metric is often
used for reconstruction of haplotypes from reads. However, problems with the
MEC metric have been reported. Here, we investigate the MEC approach to
demonstrate that it may result in incorrectly reconstructed haplotypes for
devices that produce error-prone long reads. Specifically, we evaluate this
approach for devices developed by Illumina, Pacific BioSciences and Oxford
Nanopore Technologies. We show that imprecise haplotypes may be reconstructed
with a lower MEC than that of the exact haplotype. The performance of MEC is
explored for different coverage levels and error rates of data. Our simulation
results reveal that in order to avoid incorrect MEC-based haplotypes, a
coverage of 25 is needed for reads generated by Pacific BioSciences RS systems.
|
q-bio.GN
|
the single nucleotide polymorphism snp is the most widely studied type of genetic variation a haplotype is defined as the sequence of alleles at snp sites on each haploid chromosome haplotype information is essential in unravelling the genomephenotype association haplotype assembly is a wellknown approach for reconstructing haplotypes exploiting reads generated by dna sequencing devices the minimum error correction mec metric is often used for reconstruction of haplotypes from reads however problems with the mec metric have been reported here we investigate the mec approach to demonstrate that it may result in incorrectly reconstructed haplotypes for devices that produce errorprone long reads specifically we evaluate this approach for devices developed by illumina pacific biosciences and oxford nanopore technologies we show that imprecise haplotypes may be reconstructed with a lower mec than that of the exact haplotype the performance of mec is explored for different coverage levels and error rates of data our simulation results reveal that in order to avoid incorrect mecbased haplotypes a coverage of 25 is needed for reads generated by pacific biosciences rs systems
|
[['the', 'single', 'nucleotide', 'polymorphism', 'snp', 'is', 'the', 'most', 'widely', 'studied', 'type', 'of', 'genetic', 'variation', 'a', 'haplotype', 'is', 'defined', 'as', 'the', 'sequence', 'of', 'alleles', 'at', 'snp', 'sites', 'on', 'each', 'haploid', 'chromosome', 'haplotype', 'information', 'is', 'essential', 'in', 'unravelling', 'the', 'genomephenotype', 'association', 'haplotype', 'assembly', 'is', 'a', 'wellknown', 'approach', 'for', 'reconstructing', 'haplotypes', 'exploiting', 'reads', 'generated', 'by', 'dna', 'sequencing', 'devices', 'the', 'minimum', 'error', 'correction', 'mec', 'metric', 'is', 'often', 'used', 'for', 'reconstruction', 'of', 'haplotypes', 'from', 'reads', 'however', 'problems', 'with', 'the', 'mec', 'metric', 'have', 'been', 'reported', 'here', 'we', 'investigate', 'the', 'mec', 'approach', 'to', 'demonstrate', 'that', 'it', 'may', 'result', 'in', 'incorrectly', 'reconstructed', 'haplotypes', 'for', 'devices', 'that', 'produce', 'errorprone', 'long', 'reads', 'specifically', 'we', 'evaluate', 'this', 'approach', 'for', 'devices', 'developed', 'by', 'illumina', 'pacific', 'biosciences', 'and', 'oxford', 'nanopore', 'technologies', 'we', 'show', 'that', 'imprecise', 'haplotypes', 'may', 'be', 'reconstructed', 'with', 'a', 'lower', 'mec', 'than', 'that', 'of', 'the', 'exact', 'haplotype', 'the', 'performance', 'of', 'mec', 'is', 'explored', 'for', 'different', 'coverage', 'levels', 'and', 'error', 'rates', 'of', 'data', 'our', 'simulation', 'results', 'reveal', 'that', 'in', 'order', 'to', 'avoid', 'incorrect', 'mecbased', 'haplotypes', 'a', 'coverage', 'of', '25', 'is', 'needed', 'for', 'reads', 'generated', 'by', 'pacific', 'biosciences', 'rs', 'systems']]
|
[-0.10457068696748385, 0.07764155304969543, -0.01896331768049012, 0.13183598134756638, -0.024177207320462912, -0.1682839364353144, 0.1025148726310528, 0.3782125530084489, -0.2650631019000271, -0.29860222035693534, 0.07719001846734583, -0.2808266810765913, -0.15832857814067128, 0.17862216747281226, -0.13034953153427606, 0.01402051697765604, 0.18443817508258772, 0.0083296851880732, 0.06170398779663215, -0.23476860598496138, 0.21440969305430455, 0.07162583725717427, 0.31879167577029544, 0.010595717226599598, 0.10899315890657651, -0.012763482588607903, -0.04894219754814086, -0.01029817364178598, -0.12185000646592346, 0.15860594637797476, 0.3454117597244807, 0.21029005677105903, 0.2949023742059415, -0.3947522798553109, -0.20062790417432552, 0.08457397152034735, 0.16845867480680515, 0.16063305551440202, -0.06449301756550664, -0.26181618446108507, 0.1787618764792569, -0.1619791294856854, 0.001977593554908129, -0.024862467496528883, 0.02606880226680501, 0.020301573782159143, -0.2885309590174901, 0.10861553079964571, -0.02806317790567515, 0.0857252754450945, -0.012338357399378518, -0.16776528040910224, -0.012584780984484083, 0.19775514274608047, 0.04150142763021656, 0.08391219944182508, 0.13696684927377978, -0.10189489557751585, -0.14691010439326585, 0.32886814909182827, -0.004740221892627067, -0.18946934217952235, 0.15891963374848606, -0.11160991609490752, -0.16700228349178692, 0.1214018616989382, 0.1352795612765476, 0.08134023853133178, -0.2451541049264382, 0.0670596542711957, 0.04917758512734012, 0.19498590237080035, 0.11539566288808022, 0.010794907611191527, 0.17694174357959788, 0.21324847753699447, 0.0418701532087818, 0.1098543438102669, -0.165158039980187, -0.0867316687535177, -0.15732410137041536, -0.14385283920207506, -0.2064703739486669, 0.008325489581858908, -0.04952286820529976, -0.1824593420076946, 0.37609163064255635, 0.14003242053149734, 0.13912861805411839, 0.09607064459255939, 0.3122535098822978, 0.02163155212077651, 0.14839670951319436, 0.0020652567301030185, 0.10327973635338078, 0.06383992871401874, 0.05461360964744182, -0.22341576280913697, 0.1516270257350036, 0.021078394581061068]
|
1,803.0502
|
On the Morava $E$-theory of wreath products of symmetric groups
|
Strickland gave an interpretation of a quotient of the Morava $E$-theory of
symmetric groups in terms of algebraic geometry. We identify an analogous
quotient of the Morava $E$-theory of wreath products of symmetric groups with a
tensor product of Strickland's quotients. This allows an algebro-geometric
interpretation similar to Strickland's.
|
math.AT
|
strickland gave an interpretation of a quotient of the morava etheory of symmetric groups in terms of algebraic geometry we identify an analogous quotient of the morava etheory of wreath products of symmetric groups with a tensor product of stricklands quotients this allows an algebrogeometric interpretation similar to stricklands
|
[['strickland', 'gave', 'an', 'interpretation', 'of', 'a', 'quotient', 'of', 'the', 'morava', 'etheory', 'of', 'symmetric', 'groups', 'in', 'terms', 'of', 'algebraic', 'geometry', 'we', 'identify', 'an', 'analogous', 'quotient', 'of', 'the', 'morava', 'etheory', 'of', 'wreath', 'products', 'of', 'symmetric', 'groups', 'with', 'a', 'tensor', 'product', 'of', 'stricklands', 'quotients', 'this', 'allows', 'an', 'algebrogeometric', 'interpretation', 'similar', 'to', 'stricklands']]
|
[-0.21626250502862493, 0.00120641513370044, -0.1856046123240067, 0.0645720769665489, -0.12338233623197492, -0.05643124751062417, -0.053898688899923344, 0.29678671050588695, -0.35170799303723843, -0.1932181407678492, 0.09194498884786224, -0.19885194172865323, -0.12525653650946156, 0.18851420317529416, -0.23488517379274174, -0.09271331925933458, -0.010808374153031987, 0.15279030585091333, -0.14247217389507866, -0.24844739434062219, 0.4305393654824596, 0.1019948310009679, 0.23408565062041187, 0.02938509561187987, 0.04054511993486738, 0.03455464789947989, -0.09553407961312606, -0.07236903191221003, -0.1305405563313742, 0.16540064727317313, 0.365218065146889, 0.07366406396791643, 0.1233919500278271, -0.3682640963519106, -0.04486961157194206, 0.21897681620048018, 0.15754505771459365, -0.032677761649674904, -0.007810075900384358, -0.3312354568316012, 0.06142652405387893, -0.3355078844315543, -0.15851251794291393, -0.10177088918506491, 0.058688629304572026, -0.0317843460230803, -0.19735423532523672, -0.025498239846177856, 0.10653647537134131, 0.1605842097719409, -0.11718227853167004, -0.10343505913268167, -0.02078468939859648, 0.12412215614387272, -0.037555394879523286, -0.05631452623982819, 0.09948932737758269, -0.09107269064941424, -0.20149180053600244, 0.41514476434308656, -0.02141730527498056, -0.14534967411689612, 0.09041723069183681, -0.1389001570356896, -0.16671004566382996, 0.1360644922040555, 0.016014741448571488, 0.1908826192422789, 0.04463413905124275, 0.20318763891273006, -0.18901575663678197, 0.0667694877899651, 0.12454905132858121, 0.02078840725732093, 0.09636716919057832, 0.020379034279636582, 0.05907504368877532, 0.2413402187580965, 0.11466416344046593, 0.003582513149903745, -0.3430098781210123, -0.25797239228208757, -0.030919836149836073, 0.2363632078833726, -0.1778013214697035, -0.2578824406622776, 0.4353559474099655, 0.01130656006612948, 0.13714982586442398, 0.1331843546192561, 0.19417874867391147, 0.03593000826634923, 0.037044684307611715, 0.00618184948035953, 0.028562878448592156, 0.33286138418681765, -0.08021167403429139, -0.1318333895439852, -0.05824057199060917, 0.2584176848319416]
|
1,803.05021
|
Fidelity and Uhlmann connection analysis of topological phase
transitions in two dimensions
|
We study the behaviour of the fidelity and the Uhlmann connection in
two-dimensional systems of free fermions that exhibit non-trivial topological
behavior. In particular, we use the fidelity and a quantity closely related to
the Uhlmann factor in order to detect phase transitions at zero and finite
temperature for topological insulators and superconductors. We show that at
zero temperature both quantities predict quantum phase transitions: a sudden
drop of fidelity indicates an abrupt change of the spectrum of the state, while
the behavior of the Uhlmann connection signals equally rapid change in its
eigenbasis. At finite temperature, the topological features are gradually
smeared out, indicating the absence of finite-temperature phase transitions,
which we further confirm by performing a detailed analysis of the edge states.
Moreover, we performed both analytical and numerical analysis of the fidelity
susceptibility in the thermodynamic limit, providing an explicit quantitative
criterion for the existence of phase transitions. The critical behaviour at
zero temperature is further analysed through the numerical computation of
critical exponents.
|
cond-mat.str-el cond-mat.stat-mech quant-ph
|
we study the behaviour of the fidelity and the uhlmann connection in twodimensional systems of free fermions that exhibit nontrivial topological behavior in particular we use the fidelity and a quantity closely related to the uhlmann factor in order to detect phase transitions at zero and finite temperature for topological insulators and superconductors we show that at zero temperature both quantities predict quantum phase transitions a sudden drop of fidelity indicates an abrupt change of the spectrum of the state while the behavior of the uhlmann connection signals equally rapid change in its eigenbasis at finite temperature the topological features are gradually smeared out indicating the absence of finitetemperature phase transitions which we further confirm by performing a detailed analysis of the edge states moreover we performed both analytical and numerical analysis of the fidelity susceptibility in the thermodynamic limit providing an explicit quantitative criterion for the existence of phase transitions the critical behaviour at zero temperature is further analysed through the numerical computation of critical exponents
|
[['we', 'study', 'the', 'behaviour', 'of', 'the', 'fidelity', 'and', 'the', 'uhlmann', 'connection', 'in', 'twodimensional', 'systems', 'of', 'free', 'fermions', 'that', 'exhibit', 'nontrivial', 'topological', 'behavior', 'in', 'particular', 'we', 'use', 'the', 'fidelity', 'and', 'a', 'quantity', 'closely', 'related', 'to', 'the', 'uhlmann', 'factor', 'in', 'order', 'to', 'detect', 'phase', 'transitions', 'at', 'zero', 'and', 'finite', 'temperature', 'for', 'topological', 'insulators', 'and', 'superconductors', 'we', 'show', 'that', 'at', 'zero', 'temperature', 'both', 'quantities', 'predict', 'quantum', 'phase', 'transitions', 'a', 'sudden', 'drop', 'of', 'fidelity', 'indicates', 'an', 'abrupt', 'change', 'of', 'the', 'spectrum', 'of', 'the', 'state', 'while', 'the', 'behavior', 'of', 'the', 'uhlmann', 'connection', 'signals', 'equally', 'rapid', 'change', 'in', 'its', 'eigenbasis', 'at', 'finite', 'temperature', 'the', 'topological', 'features', 'are', 'gradually', 'smeared', 'out', 'indicating', 'the', 'absence', 'of', 'finitetemperature', 'phase', 'transitions', 'which', 'we', 'further', 'confirm', 'by', 'performing', 'a', 'detailed', 'analysis', 'of', 'the', 'edge', 'states', 'moreover', 'we', 'performed', 'both', 'analytical', 'and', 'numerical', 'analysis', 'of', 'the', 'fidelity', 'susceptibility', 'in', 'the', 'thermodynamic', 'limit', 'providing', 'an', 'explicit', 'quantitative', 'criterion', 'for', 'the', 'existence', 'of', 'phase', 'transitions', 'the', 'critical', 'behaviour', 'at', 'zero', 'temperature', 'is', 'further', 'analysed', 'through', 'the', 'numerical', 'computation', 'of', 'critical', 'exponents']]
|
[-0.1847105059163815, 0.18387964352129535, -0.1138205095423451, 0.032535998288034544, 0.004523242544276067, -0.11942167667683191, 0.14348832577952145, 0.3345059849256315, -0.2243586211649333, -0.2699971009201989, 0.0939397983173533, -0.33042260675696644, -0.15766941168844634, 0.15145215028367134, 0.014220214924464158, 0.0913494132611828, -0.017244980631474248, 0.043385350636156374, -0.165703311882506, -0.18699299725341403, 0.31030594233617265, 0.046773122090283045, 0.32418044088380465, 0.10431698885290398, 0.025345083961810868, -0.0352929458524028, 0.03404276467118033, 0.03426589891537578, -0.16941305379633176, -0.0012750510258103783, 0.2545676908684437, 0.002916763823836328, 0.18032071345156717, -0.38878444030122483, -0.23637823408614553, 0.097462911507349, 0.11633821466796847, 0.10755047844625273, -0.023381577506326807, -0.2894976088710263, 0.045222615363065176, -0.14039995058991772, -0.16471743718637322, -0.15833969040206372, 0.0015221825817566433, -0.03593754043285372, -0.2161005368668162, 0.13726781812792052, 0.06408807877757905, 0.12923526742166566, -0.05465616053597678, -0.037589330458316486, -0.04724750791893837, 0.1504470513224557, 0.04071900177562977, 0.007746164211557207, 0.10698667043139656, -0.14764822607938044, -0.10850042684985224, 0.3196418282023804, -0.07687052434469255, -0.10466945633253161, 0.19155576472480162, -0.1690321014998871, -0.10972480707060167, 0.16549427970173117, 0.10824184310427326, 0.08700310973127089, -0.0674124677682262, 0.030597096137231227, 0.04478814511442791, 0.1778476971053814, 0.00503352140829324, 0.06728895502388031, 0.23358973071626024, 0.11484884634519185, 0.04569391719439251, 0.20835903320394591, -0.07981718269115437, -0.13953325546117956, -0.3152060471206742, -0.19437045151713545, -0.21244104088334267, 0.04374664195696126, -0.09909167512928897, -0.19248929095013947, 0.4381158127934633, 0.15976056935472002, 0.22799524775577965, 0.017466160111146014, 0.24190004847519947, 0.17208383494533577, -0.018508842009995245, 0.056576033290141, 0.24251719238236547, 0.155341224916402, 0.12825478522335654, -0.32404499649053475, 0.03897978944012415, 0.050529493459550566]
|
1,803.05022
|
Securing the Internet of Things in the Age of Machine Learning and
Software-defined Networking
|
The Internet of Things (IoT) realizes a vision where billions of
interconnected devices are deployed just about everywhere, from inside our
bodies to the most remote areas of the globe. As the IoT will soon pervade
every aspect of our lives and will be accessible from anywhere, addressing
critical IoT security threats is now more important than ever. Traditional
approaches where security is applied as an afterthought and as a "patch"
against known attacks are insufficient. Indeed, next-generation IoT challenges
will require a new secure-by-design vision, where threats are addressed
proactively and IoT devices learn to dynamically adapt to different threats. To
this end, machine learning and software-defined networking will be key to
provide both reconfigurability and intelligence to the IoT devices. In this
paper, we first provide a taxonomy and survey the state of the art in IoT
security research, and offer a roadmap of concrete research challenges related
to the application of machine learning and software-defined networking to
address existing and next-generation IoT security threats.
|
cs.CR
|
the internet of things iot realizes a vision where billions of interconnected devices are deployed just about everywhere from inside our bodies to the most remote areas of the globe as the iot will soon pervade every aspect of our lives and will be accessible from anywhere addressing critical iot security threats is now more important than ever traditional approaches where security is applied as an afterthought and as a patch against known attacks are insufficient indeed nextgeneration iot challenges will require a new securebydesign vision where threats are addressed proactively and iot devices learn to dynamically adapt to different threats to this end machine learning and softwaredefined networking will be key to provide both reconfigurability and intelligence to the iot devices in this paper we first provide a taxonomy and survey the state of the art in iot security research and offer a roadmap of concrete research challenges related to the application of machine learning and softwaredefined networking to address existing and nextgeneration iot security threats
|
[['the', 'internet', 'of', 'things', 'iot', 'realizes', 'a', 'vision', 'where', 'billions', 'of', 'interconnected', 'devices', 'are', 'deployed', 'just', 'about', 'everywhere', 'from', 'inside', 'our', 'bodies', 'to', 'the', 'most', 'remote', 'areas', 'of', 'the', 'globe', 'as', 'the', 'iot', 'will', 'soon', 'pervade', 'every', 'aspect', 'of', 'our', 'lives', 'and', 'will', 'be', 'accessible', 'from', 'anywhere', 'addressing', 'critical', 'iot', 'security', 'threats', 'is', 'now', 'more', 'important', 'than', 'ever', 'traditional', 'approaches', 'where', 'security', 'is', 'applied', 'as', 'an', 'afterthought', 'and', 'as', 'a', 'patch', 'against', 'known', 'attacks', 'are', 'insufficient', 'indeed', 'nextgeneration', 'iot', 'challenges', 'will', 'require', 'a', 'new', 'securebydesign', 'vision', 'where', 'threats', 'are', 'addressed', 'proactively', 'and', 'iot', 'devices', 'learn', 'to', 'dynamically', 'adapt', 'to', 'different', 'threats', 'to', 'this', 'end', 'machine', 'learning', 'and', 'softwaredefined', 'networking', 'will', 'be', 'key', 'to', 'provide', 'both', 'reconfigurability', 'and', 'intelligence', 'to', 'the', 'iot', 'devices', 'in', 'this', 'paper', 'we', 'first', 'provide', 'a', 'taxonomy', 'and', 'survey', 'the', 'state', 'of', 'the', 'art', 'in', 'iot', 'security', 'research', 'and', 'offer', 'a', 'roadmap', 'of', 'concrete', 'research', 'challenges', 'related', 'to', 'the', 'application', 'of', 'machine', 'learning', 'and', 'softwaredefined', 'networking', 'to', 'address', 'existing', 'and', 'nextgeneration', 'iot', 'security', 'threats']]
|
[-0.17420528574597025, 0.028027417829084203, -0.007563856318144195, 0.03718072740664055, -0.16225578107994543, -0.21656519542336014, 0.010043767887498644, 0.3438434919247022, -0.2763830445102326, -0.3258613639185766, 0.16593489969985178, -0.3082533284056797, -0.18664625733361456, 0.2602798611441829, -0.1875371439101915, 0.07856793427651927, 0.023366685451782613, 0.015569231246039832, 0.01716624399863116, -0.30537656279482756, 0.309975917218253, 0.03822140583869474, 0.3612471848210118, 0.11422286969076573, -0.000114721467673599, -0.07041093747970278, 0.004371021972430578, -0.04861153952261231, -0.0780083794337529, 0.21469259873616048, 0.4628698301630611, 0.2863393187949277, 0.4112820313936268, -0.4811615032353929, -0.1963089601198458, 0.0868617151632445, 0.23475268839000085, 0.06385697465928564, -0.06595594980601426, -0.3807469210306923, 0.1365410175219358, -0.26800130707694286, -0.14222677500684625, -0.07919672017647739, 0.02300742046952427, 0.048749677820765155, -0.1806974999988115, -0.10573838948530245, -0.0412350344956931, 0.06457483664671161, -0.024699441291141485, -0.05954179313415676, 0.02036642061521198, 0.20049148568804992, 0.04385237141122413, 0.018117180147421467, 0.2401428728877056, -0.1852315630376653, -0.15874737007992276, 0.3859378967479051, 0.07494511747414019, -0.09360805243612771, 0.18314084542371017, 0.015041805196452481, -0.18996464635851423, 0.022635645351613904, 0.25015545138214007, 0.042491750292345344, -0.19802511226756117, 0.02804172412086985, 0.07102435658382902, 0.15248724065317087, 0.021196269651830017, 0.09098367416019361, 0.26012058600542104, 0.279060178363404, 0.18892857184386755, 0.07240081532908806, -0.04702823659607086, -0.09886399306446673, -0.21437225272634952, -0.17072667766794428, -0.1765618601269355, 0.06385700465797121, -0.019157164070824673, -0.12166956014698371, 0.3544636576054954, 0.28967904043664416, 0.11982151123285519, 0.01598444193749231, 0.4365466881924904, -0.0349118783752678, 0.15656657741932445, 0.13441255851929268, 0.1968010118881981, -0.006722380695387676, 0.2694287071262587, -0.042189884338954306, 0.09596964094597785, -0.07607978657193072]
|
1,803.05023
|
Project VeSElkA: results of abundance analysis for HD53929 and HD63975
|
Project VeSElkA (Vertical Stratification of Element Abundances) has been
initiated with the aim to detect and study the vertical stratification of
element abundances in the atmosphere of chemically peculiar stars. Abundance
stratification occurs in hydrodynamically stable stellar atmospheres due to the
migration of the elements caused by atomic diffusion. Two HgMn stars, HD53929
and HD63975 were selected from the VeSElkA sample and analysed with the aim to
detect some abundance peculiarities employing the ZEEMAN2 code. We present the
results of abundance analysis of HD53929 and HD63975 observed recently with the
spectropolarimeter ESPaDOnS at Canada-France-Hawaii Telescope. Evidence of
phosphorus vertical stratification was detected in the atmosphere of these two
stars. In both cases, phosphorus abundance increases strongly towards the
superficial layers. The strong overabundance of Mn found in stellar atmosphere
of both stars confirms that they are HgMn type stars.
|
astro-ph.SR
|
project veselka vertical stratification of element abundances has been initiated with the aim to detect and study the vertical stratification of element abundances in the atmosphere of chemically peculiar stars abundance stratification occurs in hydrodynamically stable stellar atmospheres due to the migration of the elements caused by atomic diffusion two hgmn stars hd53929 and hd63975 were selected from the veselka sample and analysed with the aim to detect some abundance peculiarities employing the zeeman2 code we present the results of abundance analysis of hd53929 and hd63975 observed recently with the spectropolarimeter espadons at canadafrancehawaii telescope evidence of phosphorus vertical stratification was detected in the atmosphere of these two stars in both cases phosphorus abundance increases strongly towards the superficial layers the strong overabundance of mn found in stellar atmosphere of both stars confirms that they are hgmn type stars
|
[['project', 'veselka', 'vertical', 'stratification', 'of', 'element', 'abundances', 'has', 'been', 'initiated', 'with', 'the', 'aim', 'to', 'detect', 'and', 'study', 'the', 'vertical', 'stratification', 'of', 'element', 'abundances', 'in', 'the', 'atmosphere', 'of', 'chemically', 'peculiar', 'stars', 'abundance', 'stratification', 'occurs', 'in', 'hydrodynamically', 'stable', 'stellar', 'atmospheres', 'due', 'to', 'the', 'migration', 'of', 'the', 'elements', 'caused', 'by', 'atomic', 'diffusion', 'two', 'hgmn', 'stars', 'hd53929', 'and', 'hd63975', 'were', 'selected', 'from', 'the', 'veselka', 'sample', 'and', 'analysed', 'with', 'the', 'aim', 'to', 'detect', 'some', 'abundance', 'peculiarities', 'employing', 'the', 'zeeman2', 'code', 'we', 'present', 'the', 'results', 'of', 'abundance', 'analysis', 'of', 'hd53929', 'and', 'hd63975', 'observed', 'recently', 'with', 'the', 'spectropolarimeter', 'espadons', 'at', 'canadafrancehawaii', 'telescope', 'evidence', 'of', 'phosphorus', 'vertical', 'stratification', 'was', 'detected', 'in', 'the', 'atmosphere', 'of', 'these', 'two', 'stars', 'in', 'both', 'cases', 'phosphorus', 'abundance', 'increases', 'strongly', 'towards', 'the', 'superficial', 'layers', 'the', 'strong', 'overabundance', 'of', 'mn', 'found', 'in', 'stellar', 'atmosphere', 'of', 'both', 'stars', 'confirms', 'that', 'they', 'are', 'hgmn', 'type', 'stars']]
|
[-0.07409853305434808, 0.1575886071038743, -0.030603293526089852, 0.03333162558265031, -0.05342093231846337, -0.0522491074408646, 0.05232100191319154, 0.39866504339432274, -0.17070924020889733, -0.3650495514066683, 0.011388804248741103, -0.3063189204368326, -0.04302906681033265, 0.1376178040548607, -0.06885183041661178, -0.013463541307417606, 0.12152665270388954, -0.07424915056261751, 0.012783053143087912, -0.2680683206508143, 0.3237067863776314, 0.06665468066305577, 0.1784693577706262, -0.05230510094099575, -0.025902135759868005, -0.19211822680749552, -0.10353083457383845, 0.03251611359892532, -0.13296904516071123, 0.0486891128278027, 0.24125422182734366, 0.11521464640585084, 0.17103775827283108, -0.41111785629392317, -0.2274969705277019, 0.021813506539911032, 0.19005156271504584, 0.062387086758045135, -0.13760442813444468, -0.23839056540142606, 0.10209880414315396, -0.10218335588428157, -0.197954931113593, 0.028158139016617227, 0.02157523929382916, 0.02644477233256179, -0.22247223011735412, 0.026397203745027246, 0.04138342122788782, 0.20226531344534898, -0.14215862523005515, -0.17347475077129074, -0.15096022050086133, 0.09077159844821801, 0.05655778214611389, -0.018797957028814212, 0.11126422382960165, -0.08264855108120375, 0.04106032732460234, 0.4141517344862223, -0.18385641718352283, -0.004437260352144087, 0.22982929482693887, -0.22318471111012278, -0.19164629263083313, 0.11683280366921314, 0.157715806434, 0.1752608115474383, -0.15534108128674604, 0.035213198243743846, -0.005678127781936416, 0.1718413045215938, 0.10522974976165979, -0.008931551214859442, 0.28907573047197527, 0.11922631318577462, 0.0016020420188498166, 0.06458368440227652, -0.2647239161241386, -0.050559016617221966, -0.15110237047904068, -0.18850153954139118, -0.043632596131000255, 0.021253693630677407, -0.0910694143834041, -0.18032427824067848, 0.36041330996969784, 0.11749750719992098, 0.16683744152800906, -0.0654112094340639, 0.28124887308933666, 0.05555577100840984, 0.09200922757111214, 0.08041644752439525, 0.312222117472966, 0.29425980817112657, 0.11429819637840545, -0.31282529462542796, 0.15584942831968268, 0.06480813741821934]
|
1,803.05024
|
Tunable nonlinear coherent perfect absorption with epsilon-near-zero
plasmonic waveguides
|
We propose a scheme to realize nonlinear coherent perfect absorption (CPA) at
the nanoscale using epsilon-near-zero (ENZ) plasmonic waveguides. The general
conditions to achieve CPA in a linear ENZ plasmonic waveguide are analyzed and
presented. The proposed ENZ waveguides support an effective ENZ response at
their cut-off frequency, where the CPA effect occurs under the illumination of
two counter-propagating plane waves with equal amplitudes and appropriate phase
distributions. In addition, the strong and uniform field enhancement inside the
nanochannels of the waveguides at the ENZ resonance can efficiently boost Kerr
nonlinearities, resulting in a new all-optical switching intensity-dependent
CPA phenomenon which can be tunable with ultrafast speed. The proposed
free-standing ENZ structures combine third-order nonlinear functionality with
standing wave CPA interference effects in a nanoscale plasmonic configuration,
thus, leading to a novel degree of tunable light-matter interactions achieved
in subwavelength regions. Our findings provide a new platform to efficiently
excite nonlinear phenomena at the nanoscale and design tunable coherent perfect
absorbers.
|
physics.optics
|
we propose a scheme to realize nonlinear coherent perfect absorption cpa at the nanoscale using epsilonnearzero enz plasmonic waveguides the general conditions to achieve cpa in a linear enz plasmonic waveguide are analyzed and presented the proposed enz waveguides support an effective enz response at their cutoff frequency where the cpa effect occurs under the illumination of two counterpropagating plane waves with equal amplitudes and appropriate phase distributions in addition the strong and uniform field enhancement inside the nanochannels of the waveguides at the enz resonance can efficiently boost kerr nonlinearities resulting in a new alloptical switching intensitydependent cpa phenomenon which can be tunable with ultrafast speed the proposed freestanding enz structures combine thirdorder nonlinear functionality with standing wave cpa interference effects in a nanoscale plasmonic configuration thus leading to a novel degree of tunable lightmatter interactions achieved in subwavelength regions our findings provide a new platform to efficiently excite nonlinear phenomena at the nanoscale and design tunable coherent perfect absorbers
|
[['we', 'propose', 'a', 'scheme', 'to', 'realize', 'nonlinear', 'coherent', 'perfect', 'absorption', 'cpa', 'at', 'the', 'nanoscale', 'using', 'epsilonnearzero', 'enz', 'plasmonic', 'waveguides', 'the', 'general', 'conditions', 'to', 'achieve', 'cpa', 'in', 'a', 'linear', 'enz', 'plasmonic', 'waveguide', 'are', 'analyzed', 'and', 'presented', 'the', 'proposed', 'enz', 'waveguides', 'support', 'an', 'effective', 'enz', 'response', 'at', 'their', 'cutoff', 'frequency', 'where', 'the', 'cpa', 'effect', 'occurs', 'under', 'the', 'illumination', 'of', 'two', 'counterpropagating', 'plane', 'waves', 'with', 'equal', 'amplitudes', 'and', 'appropriate', 'phase', 'distributions', 'in', 'addition', 'the', 'strong', 'and', 'uniform', 'field', 'enhancement', 'inside', 'the', 'nanochannels', 'of', 'the', 'waveguides', 'at', 'the', 'enz', 'resonance', 'can', 'efficiently', 'boost', 'kerr', 'nonlinearities', 'resulting', 'in', 'a', 'new', 'alloptical', 'switching', 'intensitydependent', 'cpa', 'phenomenon', 'which', 'can', 'be', 'tunable', 'with', 'ultrafast', 'speed', 'the', 'proposed', 'freestanding', 'enz', 'structures', 'combine', 'thirdorder', 'nonlinear', 'functionality', 'with', 'standing', 'wave', 'cpa', 'interference', 'effects', 'in', 'a', 'nanoscale', 'plasmonic', 'configuration', 'thus', 'leading', 'to', 'a', 'novel', 'degree', 'of', 'tunable', 'lightmatter', 'interactions', 'achieved', 'in', 'subwavelength', 'regions', 'our', 'findings', 'provide', 'a', 'new', 'platform', 'to', 'efficiently', 'excite', 'nonlinear', 'phenomena', 'at', 'the', 'nanoscale', 'and', 'design', 'tunable', 'coherent', 'perfect', 'absorbers']]
|
[-0.20658243037413182, 0.1549041558684158, -0.05448744151493974, -0.01925224179592886, -0.11114352581276332, -0.20933435403203926, 0.01291417908485652, 0.5215224957336551, -0.2681367599451625, -0.22142434222132013, -0.035006446110934994, -0.24270898140735508, -0.22530897170658112, 0.2039753905532199, 0.019723156036849578, 0.11795484884902373, -0.04948548102890205, -0.12799720790201757, 0.03057463235447403, -0.12740504526119587, 0.22867081266602282, 0.04823348881360086, 0.37442999164232554, 0.09522115334294308, 0.10053960287145206, 0.002174104331422782, 0.13673190681136543, -0.015919274091575966, -0.10595165387733105, 0.09726688123354399, 0.3205407733655887, -0.08550215062615896, 0.26438389809640206, -0.4569694277633745, -0.26322350147764506, -0.02179431393099927, 0.17128154921948457, 0.16589419731381494, -0.11007603404186456, -0.31127826583149454, 0.053300297759062615, -0.08636779686725649, -0.18859182211414258, -0.06125824912364439, -0.06992208339513992, 0.007924301353477011, -0.3158770198326396, -0.01048323494235418, 0.05241760636697182, 0.02624298139295963, -0.020993845661674043, -0.0017276266958529813, 0.017680751866956026, -0.014346148298116205, -0.1150843974908594, -0.04129103442758136, 0.1611637090078283, -0.13971473984181684, -0.12568677354731267, 0.39451057035678433, -0.09466168743009414, -0.16855643458708885, 0.1499557615668507, -0.16520811283602294, 0.0847260153878434, 0.20413062384247965, 0.2441008425178874, 0.10713650497878317, -0.100719075151777, 0.018821030257917617, 0.007584944176606932, 0.22256017889920043, 0.1808515329518419, 0.20103557544264375, 0.2423725759159334, 0.192399440085955, 0.040643218439795445, 0.1615746109363166, -0.07105443769883689, 0.0233947807815944, -0.2601366119216318, -0.10204461645855574, -0.15731012933202065, -0.0032240988738923074, -0.14432525889686257, -0.18706601652496072, 0.4183350784599198, 0.14070037224254808, 0.12358775587502277, -0.03709263511809017, 0.32815874182844756, 0.16923945264309437, 0.07699958296776142, 0.02491280362472771, 0.36303098321608873, 0.1721239544690575, 0.1299381807608449, -0.2891625213300844, -0.018956118081088946, -0.0743194075174028]
|
1,803.05025
|
FDG kinetics in cells and tissues: a biochemically-driven compartmental
approach
|
The radioactive glucose analogue 2-deoxy-2-[18F]fluoro-D-glucose (FDG) is
widely used to reconstruct glucose metabolism and other biological functions in
cells and tissues. The analysis of data on the time course of FDG tracer
distribution is performed by the use of appropriate compartmental models.
Motivated by recent results in cell biochemistry, we describe a new
compartmental model aiming at the reconstruction of tracer kinetics in cells
and tissues, which emphasizes the different roles of the cytosol and of the
endoplasmic reticulum. Two applications of the new model are examined, that are
concerned with real data from cancer cell cultures in vitro, and cancer tissues
in vivo. The results are compared with those obtained through application of
more standard compartmental models against the same datasets and appear to be
in a better agreement with respect to recent biochemical experimental evidence.
In particular, it is shown that tracer tends to accumulate in the endoplasmic
reticulum, rather than cytosol, and that the rate of phosphorylation is higher
than predicted by current models.
|
q-bio.TO
|
the radioactive glucose analogue 2deoxy218ffluorodglucose fdg is widely used to reconstruct glucose metabolism and other biological functions in cells and tissues the analysis of data on the time course of fdg tracer distribution is performed by the use of appropriate compartmental models motivated by recent results in cell biochemistry we describe a new compartmental model aiming at the reconstruction of tracer kinetics in cells and tissues which emphasizes the different roles of the cytosol and of the endoplasmic reticulum two applications of the new model are examined that are concerned with real data from cancer cell cultures in vitro and cancer tissues in vivo the results are compared with those obtained through application of more standard compartmental models against the same datasets and appear to be in a better agreement with respect to recent biochemical experimental evidence in particular it is shown that tracer tends to accumulate in the endoplasmic reticulum rather than cytosol and that the rate of phosphorylation is higher than predicted by current models
|
[['the', 'radioactive', 'glucose', 'analogue', '2deoxy218ffluorodglucose', 'fdg', 'is', 'widely', 'used', 'to', 'reconstruct', 'glucose', 'metabolism', 'and', 'other', 'biological', 'functions', 'in', 'cells', 'and', 'tissues', 'the', 'analysis', 'of', 'data', 'on', 'the', 'time', 'course', 'of', 'fdg', 'tracer', 'distribution', 'is', 'performed', 'by', 'the', 'use', 'of', 'appropriate', 'compartmental', 'models', 'motivated', 'by', 'recent', 'results', 'in', 'cell', 'biochemistry', 'we', 'describe', 'a', 'new', 'compartmental', 'model', 'aiming', 'at', 'the', 'reconstruction', 'of', 'tracer', 'kinetics', 'in', 'cells', 'and', 'tissues', 'which', 'emphasizes', 'the', 'different', 'roles', 'of', 'the', 'cytosol', 'and', 'of', 'the', 'endoplasmic', 'reticulum', 'two', 'applications', 'of', 'the', 'new', 'model', 'are', 'examined', 'that', 'are', 'concerned', 'with', 'real', 'data', 'from', 'cancer', 'cell', 'cultures', 'in', 'vitro', 'and', 'cancer', 'tissues', 'in', 'vivo', 'the', 'results', 'are', 'compared', 'with', 'those', 'obtained', 'through', 'application', 'of', 'more', 'standard', 'compartmental', 'models', 'against', 'the', 'same', 'datasets', 'and', 'appear', 'to', 'be', 'in', 'a', 'better', 'agreement', 'with', 'respect', 'to', 'recent', 'biochemical', 'experimental', 'evidence', 'in', 'particular', 'it', 'is', 'shown', 'that', 'tracer', 'tends', 'to', 'accumulate', 'in', 'the', 'endoplasmic', 'reticulum', 'rather', 'than', 'cytosol', 'and', 'that', 'the', 'rate', 'of', 'phosphorylation', 'is', 'higher', 'than', 'predicted', 'by', 'current', 'models']]
|
[0.011205830337782672, 0.09400525671171855, -0.009665524051244179, 0.06315964372009487, 0.02342873609818361, -0.1467235126218433, 5.846473119075758e-05, 0.3673780221233975, -0.20776450696838908, -0.2671282762098435, 0.05831241801224021, -0.3119615381695779, -0.2306586975534727, 0.22206066961467535, -0.10040678467085383, 0.031296243032732284, 0.07707120651794395, 0.029970963214838272, 0.06207205007078564, -0.21606554933935854, 0.2327503771086347, 0.06616897356460791, 0.31455664648618326, -0.004306869514367868, 0.07384895918335406, -0.07150529428239329, -0.05653954923281962, -0.003882076585642904, -0.13351427644124944, 0.1572106711830136, 0.2749133759308794, 0.15901515773127237, 0.2548376817637718, -0.5309734713645226, -0.28434318681079224, 0.1096444950587711, 0.17073348455456455, 0.11525784406387767, -0.04525826986942578, -0.23550456344901796, 0.08161398851458566, -0.13223680643454552, -0.09179632547199278, -0.04047290467466396, 0.005048404184046639, 0.06917931445164562, -0.26396817651139687, 0.17270012084287395, -0.02284103824689715, 0.12074943362308824, -0.12031700265879956, -0.1310559324246932, -0.05469722979833899, 0.15922404315984662, 0.06619813416226128, 0.019378369985462492, 0.21937138471101603, -0.1612924473747297, -0.09723854994580867, 0.378474190922353, -0.0461503911312145, -0.19122591459315763, 0.25847289647278654, -0.15241946212397553, -0.1196952039791069, 0.11689776179790272, 0.15190005505244325, 0.10245904353929751, -0.198772655682167, -0.00034387921037836876, -0.00046144155659207916, 0.1601686443059133, 0.05836359607981496, -0.06173234428206342, 0.12493901315470596, 0.24992748938854334, -0.0220595882386418, 0.08697779482077661, -0.08963392798772014, -0.08751146465607257, -0.20457834951686169, -0.16885894076360097, -0.1163818994270503, 0.013935268658117941, -0.0916994117861873, -0.12185252184123334, 0.38848423215010797, 0.12897290876808476, 0.19453790648468242, 0.06371942507622046, 0.2568759091103068, 0.0011939565841871571, 0.09502950348717396, -0.04391745779192053, 0.19472534741634076, 0.1151874314205362, 0.13896889991410277, -0.22323467738993735, 0.14708581448817368, 0.009199131302625299]
|
1,803.05026
|
Principal Component Analysis with Tensor Train Subspace
|
Tensor train is a hierarchical tensor network structure that helps alleviate
the curse of dimensionality by parameterizing large-scale multidimensional data
via a set of network of low-rank tensors. Associated with such a construction
is a notion of Tensor Train subspace and in this paper we propose a TT-PCA
algorithm for estimating this structured subspace from the given data. By
maintaining low rank tensor structure, TT-PCA is more robust to noise comparing
with PCA or Tucker-PCA. This is borne out numerically by testing the proposed
approach on the Extended YaleFace Dataset B.
|
cs.LG cs.CV cs.IT cs.NA math.IT
|
tensor train is a hierarchical tensor network structure that helps alleviate the curse of dimensionality by parameterizing largescale multidimensional data via a set of network of lowrank tensors associated with such a construction is a notion of tensor train subspace and in this paper we propose a ttpca algorithm for estimating this structured subspace from the given data by maintaining low rank tensor structure ttpca is more robust to noise comparing with pca or tuckerpca this is borne out numerically by testing the proposed approach on the extended yaleface dataset b
|
[['tensor', 'train', 'is', 'a', 'hierarchical', 'tensor', 'network', 'structure', 'that', 'helps', 'alleviate', 'the', 'curse', 'of', 'dimensionality', 'by', 'parameterizing', 'largescale', 'multidimensional', 'data', 'via', 'a', 'set', 'of', 'network', 'of', 'lowrank', 'tensors', 'associated', 'with', 'such', 'a', 'construction', 'is', 'a', 'notion', 'of', 'tensor', 'train', 'subspace', 'and', 'in', 'this', 'paper', 'we', 'propose', 'a', 'ttpca', 'algorithm', 'for', 'estimating', 'this', 'structured', 'subspace', 'from', 'the', 'given', 'data', 'by', 'maintaining', 'low', 'rank', 'tensor', 'structure', 'ttpca', 'is', 'more', 'robust', 'to', 'noise', 'comparing', 'with', 'pca', 'or', 'tuckerpca', 'this', 'is', 'borne', 'out', 'numerically', 'by', 'testing', 'the', 'proposed', 'approach', 'on', 'the', 'extended', 'yaleface', 'dataset', 'b']]
|
[-0.09673276190758394, 0.049603500831658126, -0.046087143685797166, 0.04677608150094962, -0.11654028452226314, -0.13413350088735934, -0.006785013714280708, 0.36509320448184834, -0.3161114704227824, -0.26210743368699635, 0.13981885386325804, -0.21501245121832874, -0.2337018538336002, 0.111600716724114, -0.0718477944543735, 0.05699460017869527, 0.1155732588965617, 0.002280304411790152, -0.07842174314508407, -0.23329325655646538, 0.4160921396901724, 0.12252425641121192, 0.3273985565950473, -0.054174142242034616, 0.16213346545948465, 0.003303731723431626, -0.09752734292876618, 0.05240171036319058, -0.007669079463126742, 0.20289530099540865, 0.2856188458015864, 0.22662683896955915, 0.3188679833875048, -0.3856584961103254, -0.20253512966306078, 0.1403719107406321, 0.08702050438806436, 0.1251219381931527, 0.0024918543939925625, -0.3047414696293658, 0.14533880210064096, -0.1976883477777585, -0.056377612129281995, -0.20495159503329416, -0.04162934821650343, -0.09474966356038363, -0.30650842522843685, 0.08472292247260439, 0.04378934649900458, 0.022590191392549152, -0.055395023549382374, -0.10144542762742045, 0.03041913796044972, 0.03471426339017163, 0.034249386985668505, 0.05900266672345413, 0.07973289648713223, -0.11921769168880907, -0.09385329025165959, 0.3775212534799658, -0.06957336928395705, -0.27228512809860744, 0.14975800063600228, -0.03480464079813368, -0.12476921811078985, 0.12070196625862228, 0.23136041063986634, 0.08632623625353203, -0.1409077495242865, 0.09704040187837866, -0.08556802382414368, 0.15712008190651736, 0.021141459159124857, -0.054294360956797995, 0.1362913978853445, 0.24117897759223805, 0.09501548842045254, 0.18763590477749534, -0.11163880208028137, -0.012253045827021887, -0.21750756705296226, -0.1028373599411711, -0.2528546149307198, 0.032076878644440365, -0.14993421381172836, -0.16960216211904397, 0.425082387868315, 0.14525480472065253, 0.2561502429715561, 0.0946684129825183, 0.35178661156424335, 0.049825765817572, 0.07124385734733686, 0.10910102244380904, 0.15823495413722663, 0.13905858544193894, 0.04953008181741327, -0.17931976195842284, 0.07283607699464065, 0.09621566875527303]
|
1,803.05027
|
Solving the Course-timetabling Problem of Cairo University Using Max-SAT
|
Due to the good performance of current SAT (satisfiability) and Max-SAT
(maximum ssatisfiability) solvers, many real-life optimization problems such as
scheduling can be solved by encoding them into Max-SAT. In this paper we tackle
the course timetabling problem of the department of mathematics, Cairo
University by encoding it into Max-SAT. Generating timetables for the
department by hand has proven to be cumbersome and the generated timetable
almost always contains conflicts. We show how the constraints can be modelled
as a Max-SAT instance.
|
cs.AI
|
due to the good performance of current sat satisfiability and maxsat maximum ssatisfiability solvers many reallife optimization problems such as scheduling can be solved by encoding them into maxsat in this paper we tackle the course timetabling problem of the department of mathematics cairo university by encoding it into maxsat generating timetables for the department by hand has proven to be cumbersome and the generated timetable almost always contains conflicts we show how the constraints can be modelled as a maxsat instance
|
[['due', 'to', 'the', 'good', 'performance', 'of', 'current', 'sat', 'satisfiability', 'and', 'maxsat', 'maximum', 'ssatisfiability', 'solvers', 'many', 'reallife', 'optimization', 'problems', 'such', 'as', 'scheduling', 'can', 'be', 'solved', 'by', 'encoding', 'them', 'into', 'maxsat', 'in', 'this', 'paper', 'we', 'tackle', 'the', 'course', 'timetabling', 'problem', 'of', 'the', 'department', 'of', 'mathematics', 'cairo', 'university', 'by', 'encoding', 'it', 'into', 'maxsat', 'generating', 'timetables', 'for', 'the', 'department', 'by', 'hand', 'has', 'proven', 'to', 'be', 'cumbersome', 'and', 'the', 'generated', 'timetable', 'almost', 'always', 'contains', 'conflicts', 'we', 'show', 'how', 'the', 'constraints', 'can', 'be', 'modelled', 'as', 'a', 'maxsat', 'instance']]
|
[-0.05501993556139002, 0.03608207952124814, -0.07026849517937933, 0.11389336058795223, -0.15099201587109287, -0.17815214378851246, 0.05067488981301632, 0.3556158394081357, -0.3471416944729877, -0.42826149943802094, 0.1849271303637781, -0.23435688978291036, -0.11611150292231252, 0.2482606230194416, -0.14227921132826143, 0.09614247189443788, 0.13071189949541917, -0.011123881433848981, -0.03778735757517962, -0.34573257141344155, 0.21839423976654623, 0.0007062997427527551, 0.27661528854550405, 0.08264822737072353, 0.08128548335904877, 0.037346024370901745, 0.053098468437652896, 0.09436297816810785, -0.03426729428673876, 0.08242225577842076, 0.43263966994888986, 0.28177829190260834, 0.3323378686643677, -0.4886582310679426, -0.1427047611501666, 0.12182568403443804, 0.12080867276210798, 0.10165365909536679, 0.0016192242569278603, -0.2960732596822911, 0.05722802150764583, -0.16695859337823443, 0.0012014869221106724, -0.08999905066081772, -0.011695223676477686, 0.002733505413979637, -0.22371235052928512, -0.02166140977477218, 0.06301214043510917, 0.012502885228137911, -0.028123576395259597, -0.18499350437411555, 0.057322517313339094, 0.09302162242777369, 0.04351913655337728, 0.015720755650868848, 0.07905124163508047, -0.16327887976989092, -0.22154755470124476, 0.44328074994278543, 0.02974114939570427, -0.15406257359104025, 0.11428833854051283, -0.002291620611270637, -0.1724232746127211, 0.08035093002067303, 0.19553856693070243, 0.1383661668414227, -0.16237805115151, 0.10481918110356976, -0.08419180283161962, 0.16849795035029083, 0.14088564431639733, -0.08070122130951028, 0.17859612240306574, 0.20376639919539477, 0.12218560477255924, 0.2057931156279979, 0.02825163577555357, -0.09186092711249251, -0.17845754759432172, -0.12484227609533219, -0.1807204508625063, 0.00534889594088366, -0.020212817310145768, -0.1230479799280012, 0.39717961955861547, 0.18543878448322232, 0.08731156558856185, 0.04195417586806012, 0.3018341552305185, 0.16747589793090742, 0.08147100924606217, 0.11459956851027572, 0.11751932425734897, 0.056803184317102955, 0.1468876350418101, -0.2076313328227879, 0.11064410438462172, 0.07995533239510325]
|
1,803.05028
|
Decentralised Learning in Systems with Many, Many Strategic Agents
|
Although multi-agent reinforcement learning can tackle systems of
strategically interacting entities, it currently fails in scalability and lacks
rigorous convergence guarantees. Crucially, learning in multi-agent systems can
become intractable due to the explosion in the size of the state-action space
as the number of agents increases. In this paper, we propose a method for
computing closed-loop optimal policies in multi-agent systems that scales
independently of the number of agents. This allows us to show, for the first
time, successful convergence to optimal behaviour in systems with an unbounded
number of interacting adaptive learners. Studying the asymptotic regime of
N-player stochastic games, we devise a learning protocol that is guaranteed to
converge to equilibrium policies even when the number of agents is extremely
large. Our method is model-free and completely decentralised so that each agent
need only observe its local state information and its realised rewards. We
validate these theoretical results by showing convergence to Nash-equilibrium
policies in applications from economics and control theory with thousands of
strategically interacting agents.
|
cs.MA
|
although multiagent reinforcement learning can tackle systems of strategically interacting entities it currently fails in scalability and lacks rigorous convergence guarantees crucially learning in multiagent systems can become intractable due to the explosion in the size of the stateaction space as the number of agents increases in this paper we propose a method for computing closedloop optimal policies in multiagent systems that scales independently of the number of agents this allows us to show for the first time successful convergence to optimal behaviour in systems with an unbounded number of interacting adaptive learners studying the asymptotic regime of nplayer stochastic games we devise a learning protocol that is guaranteed to converge to equilibrium policies even when the number of agents is extremely large our method is modelfree and completely decentralised so that each agent need only observe its local state information and its realised rewards we validate these theoretical results by showing convergence to nashequilibrium policies in applications from economics and control theory with thousands of strategically interacting agents
|
[['although', 'multiagent', 'reinforcement', 'learning', 'can', 'tackle', 'systems', 'of', 'strategically', 'interacting', 'entities', 'it', 'currently', 'fails', 'in', 'scalability', 'and', 'lacks', 'rigorous', 'convergence', 'guarantees', 'crucially', 'learning', 'in', 'multiagent', 'systems', 'can', 'become', 'intractable', 'due', 'to', 'the', 'explosion', 'in', 'the', 'size', 'of', 'the', 'stateaction', 'space', 'as', 'the', 'number', 'of', 'agents', 'increases', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'for', 'computing', 'closedloop', 'optimal', 'policies', 'in', 'multiagent', 'systems', 'that', 'scales', 'independently', 'of', 'the', 'number', 'of', 'agents', 'this', 'allows', 'us', 'to', 'show', 'for', 'the', 'first', 'time', 'successful', 'convergence', 'to', 'optimal', 'behaviour', 'in', 'systems', 'with', 'an', 'unbounded', 'number', 'of', 'interacting', 'adaptive', 'learners', 'studying', 'the', 'asymptotic', 'regime', 'of', 'nplayer', 'stochastic', 'games', 'we', 'devise', 'a', 'learning', 'protocol', 'that', 'is', 'guaranteed', 'to', 'converge', 'to', 'equilibrium', 'policies', 'even', 'when', 'the', 'number', 'of', 'agents', 'is', 'extremely', 'large', 'our', 'method', 'is', 'modelfree', 'and', 'completely', 'decentralised', 'so', 'that', 'each', 'agent', 'need', 'only', 'observe', 'its', 'local', 'state', 'information', 'and', 'its', 'realised', 'rewards', 'we', 'validate', 'these', 'theoretical', 'results', 'by', 'showing', 'convergence', 'to', 'nashequilibrium', 'policies', 'in', 'applications', 'from', 'economics', 'and', 'control', 'theory', 'with', 'thousands', 'of', 'strategically', 'interacting', 'agents']]
|
[-0.13550192924194346, 0.05825601776343007, -0.10495645192468307, 0.058512873424784714, -0.09465722231602175, -0.18651476307887827, 0.10073181125059856, 0.419772955164666, -0.2917370240826755, -0.3132415704495279, 0.0889381352108049, -0.23788976740822562, -0.15996955174018668, 0.15394087939815232, -0.15398429273545036, 0.09834694653024798, 0.06889012606522432, 0.0459550598983449, 0.028995308509790863, -0.3128748470008065, 0.2892370363821402, 0.03095716814725445, 0.2696077747838076, -0.017642161164146204, 0.1407287337888892, 0.010234544894068375, 0.05606562562959169, 0.04507269048164378, -0.08025850331028972, 0.12700561673749658, 0.36424765184786195, 0.18233553978708192, 0.4277801361133361, -0.4245626542320442, -0.1524869478817412, 0.16700334525832455, 0.1902813090660028, 0.13492152271186106, -0.016193998593164706, -0.28998065976420495, 0.07652225877163854, -0.19272618544613115, -0.10976113893984425, -0.13786682959910504, -0.025990170447332178, 0.06873589346582103, -0.32348214386212887, -0.0201362828584939, 0.0450338341210302, 0.03980561659379295, -0.07219211399980914, -0.050554697771044176, 0.032289636576239615, 0.1654961267219286, 0.05805342387237184, -0.028220509361136792, 0.15569607079161343, -0.16528894385039122, -0.17738783409675726, 0.3523904033633467, -0.010717480656960925, -0.179008196285766, 0.23145262563129965, -0.08236065686311154, -0.16379703652783925, 0.12287224389711869, 0.24190001399669597, 0.15346051864918409, -0.16109697936151313, 0.08165813580612767, -0.04723364542122688, 0.18434629136883823, -0.021012800784241517, 0.04705454748862329, 0.1414406867036541, 0.2314907295943497, 0.19019932498791692, 0.10801646637884603, 0.03311975857452352, -0.20593810974780094, -0.21916745284561223, -0.10832271750840033, -0.20288973949992886, 0.0212336035483908, -0.11788725672178135, -0.13577699845315083, 0.3120423228446857, 0.22878773254617915, 0.1497421830578448, 0.15384286446855044, 0.3137135128077318, 0.09015563353841033, 0.00421907434228962, 0.15122090517019732, 0.24143574106887247, 0.06044788346846296, 0.12917221487450176, -0.24335627946396463, 0.14186062374339609, 0.017780583988346116]
|
1,803.05029
|
Stellar Parameters and Radial Velocities of Hot Stars in the Carina
Nebula
|
The Carina Nebula is an active star forming region in the southern sky that
is of particular interest due to the presence of a large number of massive
stars in a wide array of evolutionary stages. Here we present the results of
the spectroscopic analysis of 82 B-type stars and 33 O-type stars that were
observed in 2013 and 2014. For 82 B-type stars without line blending, we fit
model spectra from the Tlusty BSTAR2006 grid to the observed profiles of
H{\gamma} and He {\lambda}{\lambda} 4026, 4388, and 4471 to measure the
effective temperatures, surface gravities, and projected rotational velocities.
We also measure the masses, ages, radii, bolometric luminosities, and distances
of these stars. From the radial velocities measured in our sample, we find 31
single lined spectroscopic binary candidates. We find a high dispersion of
radial velocities among our sample stars, and we argue that the Carina Nebula
stellar population has not yet relaxed and become virialized.
|
astro-ph.SR
|
the carina nebula is an active star forming region in the southern sky that is of particular interest due to the presence of a large number of massive stars in a wide array of evolutionary stages here we present the results of the spectroscopic analysis of 82 btype stars and 33 otype stars that were observed in 2013 and 2014 for 82 btype stars without line blending we fit model spectra from the tlusty bstar2006 grid to the observed profiles of hgamma and he lambdalambda 4026 4388 and 4471 to measure the effective temperatures surface gravities and projected rotational velocities we also measure the masses ages radii bolometric luminosities and distances of these stars from the radial velocities measured in our sample we find 31 single lined spectroscopic binary candidates we find a high dispersion of radial velocities among our sample stars and we argue that the carina nebula stellar population has not yet relaxed and become virialized
|
[['the', 'carina', 'nebula', 'is', 'an', 'active', 'star', 'forming', 'region', 'in', 'the', 'southern', 'sky', 'that', 'is', 'of', 'particular', 'interest', 'due', 'to', 'the', 'presence', 'of', 'a', 'large', 'number', 'of', 'massive', 'stars', 'in', 'a', 'wide', 'array', 'of', 'evolutionary', 'stages', 'here', 'we', 'present', 'the', 'results', 'of', 'the', 'spectroscopic', 'analysis', 'of', '82', 'btype', 'stars', 'and', '33', 'otype', 'stars', 'that', 'were', 'observed', 'in', '2013', 'and', '2014', 'for', '82', 'btype', 'stars', 'without', 'line', 'blending', 'we', 'fit', 'model', 'spectra', 'from', 'the', 'tlusty', 'bstar2006', 'grid', 'to', 'the', 'observed', 'profiles', 'of', 'hgamma', 'and', 'he', 'lambdalambda', '4026', '4388', 'and', '4471', 'to', 'measure', 'the', 'effective', 'temperatures', 'surface', 'gravities', 'and', 'projected', 'rotational', 'velocities', 'we', 'also', 'measure', 'the', 'masses', 'ages', 'radii', 'bolometric', 'luminosities', 'and', 'distances', 'of', 'these', 'stars', 'from', 'the', 'radial', 'velocities', 'measured', 'in', 'our', 'sample', 'we', 'find', '31', 'single', 'lined', 'spectroscopic', 'binary', 'candidates', 'we', 'find', 'a', 'high', 'dispersion', 'of', 'radial', 'velocities', 'among', 'our', 'sample', 'stars', 'and', 'we', 'argue', 'that', 'the', 'carina', 'nebula', 'stellar', 'population', 'has', 'not', 'yet', 'relaxed', 'and', 'become', 'virialized']]
|
[-0.040567327915115435, 0.11379532473079139, -0.06050843783434789, 0.07073520169783218, -0.1076739207147413, -0.039455542658236184, 0.08054770830467012, 0.4399010391229657, -0.10449182799762222, -0.39469005422559894, 0.010364707944926563, -0.29606168149454387, -0.0020248614738036875, 0.1822841569820603, -0.03937965557501936, -0.04797376770004155, 0.12443327245593166, -0.06482011851429002, -0.021240663292052545, -0.259508184090577, 0.28542998741576625, 0.021418006924592007, 0.14361939371332147, -0.05156296521876078, 0.039198503509211315, -0.1352942290784091, -0.07931017116673149, 0.00498550629041567, -0.17902518223794467, 0.05197419976445944, 0.22770964029055255, 0.1531090532699422, 0.18459139269580888, -0.28015276235570924, -0.18821269715691258, 0.06321419051375275, 0.21226629007987347, 0.08143002129082752, -0.06413489979377408, -0.26910190616814406, 0.06989053057233809, -0.18552452388700028, -0.21086915939524295, 0.049841915951318046, 0.09929330743089983, 0.04850252417278043, -0.21819753308964382, 0.12398982543318834, 0.0016923498386030745, 0.1572154335630168, -0.15140118592294158, -0.1691823323630983, -0.10426910575716548, 0.07920322279374643, -0.008412712439746376, 0.034208461261876405, 0.12086593225052591, -0.113227084522272, 0.021186560914394963, 0.399842802885991, -0.10328605801317912, 0.021848454656209916, 0.24963362057022986, -0.22007994880754453, -0.18019827041525843, 0.1433031327375893, 0.19274618556117937, 0.18788475328225904, -0.19121270197307227, -0.005463755937221988, -0.02752991900097128, 0.20493818592920804, 0.043706821894664676, 0.05682825195383589, 0.32270032930881926, 0.0731113091871961, -0.017690157992350068, 0.06116000534506859, -0.3339098684554979, -0.04359626853067404, -0.22522045281169947, -0.11455693663465702, -0.09771714662794902, 0.052290442348609883, -0.133649633422488, -0.13444774595955328, 0.33626671391687574, 0.10181546939987761, 0.21568186100643533, 0.04748478441374602, 0.2554829342967006, 0.0674985369539873, 0.12459199412452994, 0.1495811711095131, 0.33612381669271524, 0.23625257540239128, 0.10514943769785938, -0.259672071621605, 0.02739919522765336, -0.007022422266038502]
|
1,803.0503
|
Deep-FSMN for Large Vocabulary Continuous Speech Recognition
|
In this paper, we present an improved feedforward sequential memory networks
(FSMN) architecture, namely Deep-FSMN (DFSMN), by introducing skip connections
between memory blocks in adjacent layers. These skip connections enable the
information flow across different layers and thus alleviate the gradient
vanishing problem when building very deep structure. As a result, DFSMN
significantly benefits from these skip connections and deep structure. We have
compared the performance of DFSMN to BLSTM both with and without lower frame
rate (LFR) on several large speech recognition tasks, including English and
Mandarin. Experimental results shown that DFSMN can consistently outperform
BLSTM with dramatic gain, especially trained with LFR using CD-Phone as
modeling units. In the 2000 hours Fisher (FSH) task, the proposed DFSMN can
achieve a word error rate of 9.4% by purely using the cross-entropy criterion
and decoding with a 3-gram language model, which achieves a 1.5% absolute
improvement compared to the BLSTM. In a 20000 hours Mandarin recognition task,
the LFR trained DFSMN can achieve more than 20% relative improvement compared
to the LFR trained BLSTM. Moreover, we can easily design the lookahead filter
order of the memory blocks in DFSMN to control the latency for real-time
applications.
|
cs.NE cs.CL
|
in this paper we present an improved feedforward sequential memory networks fsmn architecture namely deepfsmn dfsmn by introducing skip connections between memory blocks in adjacent layers these skip connections enable the information flow across different layers and thus alleviate the gradient vanishing problem when building very deep structure as a result dfsmn significantly benefits from these skip connections and deep structure we have compared the performance of dfsmn to blstm both with and without lower frame rate lfr on several large speech recognition tasks including english and mandarin experimental results shown that dfsmn can consistently outperform blstm with dramatic gain especially trained with lfr using cdphone as modeling units in the 2000 hours fisher fsh task the proposed dfsmn can achieve a word error rate of 94 by purely using the crossentropy criterion and decoding with a 3gram language model which achieves a 15 absolute improvement compared to the blstm in a 20000 hours mandarin recognition task the lfr trained dfsmn can achieve more than 20 relative improvement compared to the lfr trained blstm moreover we can easily design the lookahead filter order of the memory blocks in dfsmn to control the latency for realtime applications
|
[['in', 'this', 'paper', 'we', 'present', 'an', 'improved', 'feedforward', 'sequential', 'memory', 'networks', 'fsmn', 'architecture', 'namely', 'deepfsmn', 'dfsmn', 'by', 'introducing', 'skip', 'connections', 'between', 'memory', 'blocks', 'in', 'adjacent', 'layers', 'these', 'skip', 'connections', 'enable', 'the', 'information', 'flow', 'across', 'different', 'layers', 'and', 'thus', 'alleviate', 'the', 'gradient', 'vanishing', 'problem', 'when', 'building', 'very', 'deep', 'structure', 'as', 'a', 'result', 'dfsmn', 'significantly', 'benefits', 'from', 'these', 'skip', 'connections', 'and', 'deep', 'structure', 'we', 'have', 'compared', 'the', 'performance', 'of', 'dfsmn', 'to', 'blstm', 'both', 'with', 'and', 'without', 'lower', 'frame', 'rate', 'lfr', 'on', 'several', 'large', 'speech', 'recognition', 'tasks', 'including', 'english', 'and', 'mandarin', 'experimental', 'results', 'shown', 'that', 'dfsmn', 'can', 'consistently', 'outperform', 'blstm', 'with', 'dramatic', 'gain', 'especially', 'trained', 'with', 'lfr', 'using', 'cdphone', 'as', 'modeling', 'units', 'in', 'the', '2000', 'hours', 'fisher', 'fsh', 'task', 'the', 'proposed', 'dfsmn', 'can', 'achieve', 'a', 'word', 'error', 'rate', 'of', '94', 'by', 'purely', 'using', 'the', 'crossentropy', 'criterion', 'and', 'decoding', 'with', 'a', '3gram', 'language', 'model', 'which', 'achieves', 'a', '15', 'absolute', 'improvement', 'compared', 'to', 'the', 'blstm', 'in', 'a', '20000', 'hours', 'mandarin', 'recognition', 'task', 'the', 'lfr', 'trained', 'dfsmn', 'can', 'achieve', 'more', 'than', '20', 'relative', 'improvement', 'compared', 'to', 'the', 'lfr', 'trained', 'blstm', 'moreover', 'we', 'can', 'easily', 'design', 'the', 'lookahead', 'filter', 'order', 'of', 'the', 'memory', 'blocks', 'in', 'dfsmn', 'to', 'control', 'the', 'latency', 'for', 'realtime', 'applications']]
|
[-0.05852765199001014, 0.011791691047900966, -0.018257389515674356, 0.054846430607212074, -0.07545737837820515, -0.2000498467067391, 0.08026618959043731, 0.47229247434741634, -0.28039668867431733, -0.36180944970272455, 0.08152060264891935, -0.25464524881501405, -0.2056180830161596, 0.212638649973087, -0.13725073828083492, 0.07456250656780201, 0.16345422276290922, 0.07327600923419651, -0.09520561147340785, -0.3386829280379689, 0.18570050541263497, 0.10062239879529837, 0.3567045079184139, 0.004822199038338197, 0.13701567698816006, -0.0542323917064086, 0.0007271815148979118, -0.023491247864344072, -0.034316323555535794, 0.14497025621294035, 0.277496771508595, 0.12201757024560776, 0.299692521901494, -0.4363800498810549, -0.2330105210961678, 0.06489876208385241, 0.13988218529956395, 0.07960337891240998, -0.0016438440542299656, -0.3250075167947516, 0.13192451758593435, -0.22531292903760314, 0.10308170073126208, -0.10541362232845469, -0.0390761587144711, -0.0030548459437397335, -0.28450396767644615, 0.06161262112976887, 0.10149416733748723, 0.052879534241714585, -0.03519277799797734, -0.14327324884007542, 0.023076397472435665, 0.16132393609159315, 0.0010951510660551949, 0.09765405427201257, 0.12277370776750685, -0.17437732108711437, -0.17145838570053756, 0.3193161132908666, -0.13725567668457048, -0.1989881774247384, 0.18451021316451663, 0.008191931786342073, -0.09087309948187898, 0.10860735808316734, 0.2274837044989402, 0.058718134169034736, -0.13955624356420923, -0.024199515745852662, -0.007583823837531903, 0.23183978341289402, 0.11781433191913727, 0.036395445626862734, 0.11688399015380953, 0.2702331009678562, 0.0011606634433678899, 0.16196132665344024, -0.16113893558468056, -0.09036344091033506, -0.1651585872702723, -0.09729537607492283, -0.1293452675046265, -0.008232583113005097, -0.15459601782925714, -0.08141619787649275, 0.39776093425161985, 0.1994154495067088, 0.20555445862893187, 0.19483806917695304, 0.30589294710110143, 0.02778771403695687, 0.19031482832938357, 0.1319435382875153, 0.1957828869224651, 0.05081341291787391, 0.14626107034639493, -0.17196462116055383, 0.08453265662525886, 0.04379455657368622]
|
1,803.05031
|
Spin-glass--like aging in colloidal and granular glasses
|
Motivated by the mean field prediction of a Gardner phase transition between
a "normal glass" and a "marginally stable glass", we investigate the
off-equilibrium dynamics of three-dimensional polydisperse hard spheres, used
as a model for colloidal or granular glasses. Deep inside the glass phase, we
find that a sharp crossover pressure $P_{\rm G}$ separates two distinct
dynamical regimes. For pressure $P < P_{\rm G}$, the glass behaves as a normal
solid, displaying fast dynamics that quickly equilibrates within the glass free
energy basin. For $P>P_{\rm G}$, instead, the dynamics becomes strongly
anomalous, displaying very large equilibration time scales, aging, and a
constantly increasing dynamical susceptibility. The crossover at $P_{\rm G}$ is
strongly reminiscent of the one observed in three-dimensional spin-glasses in
an external field, suggesting that the two systems could be in the same
universality class, consistently with theoretical expectations.
|
cond-mat.soft cond-mat.dis-nn cond-mat.stat-mech
|
motivated by the mean field prediction of a gardner phase transition between a normal glass and a marginally stable glass we investigate the offequilibrium dynamics of threedimensional polydisperse hard spheres used as a model for colloidal or granular glasses deep inside the glass phase we find that a sharp crossover pressure p_rm g separates two distinct dynamical regimes for pressure p p_rm g the glass behaves as a normal solid displaying fast dynamics that quickly equilibrates within the glass free energy basin for pp_rm g instead the dynamics becomes strongly anomalous displaying very large equilibration time scales aging and a constantly increasing dynamical susceptibility the crossover at p_rm g is strongly reminiscent of the one observed in threedimensional spinglasses in an external field suggesting that the two systems could be in the same universality class consistently with theoretical expectations
|
[['motivated', 'by', 'the', 'mean', 'field', 'prediction', 'of', 'a', 'gardner', 'phase', 'transition', 'between', 'a', 'normal', 'glass', 'and', 'a', 'marginally', 'stable', 'glass', 'we', 'investigate', 'the', 'offequilibrium', 'dynamics', 'of', 'threedimensional', 'polydisperse', 'hard', 'spheres', 'used', 'as', 'a', 'model', 'for', 'colloidal', 'or', 'granular', 'glasses', 'deep', 'inside', 'the', 'glass', 'phase', 'we', 'find', 'that', 'a', 'sharp', 'crossover', 'pressure', 'p_rm', 'g', 'separates', 'two', 'distinct', 'dynamical', 'regimes', 'for', 'pressure', 'p', 'p_rm', 'g', 'the', 'glass', 'behaves', 'as', 'a', 'normal', 'solid', 'displaying', 'fast', 'dynamics', 'that', 'quickly', 'equilibrates', 'within', 'the', 'glass', 'free', 'energy', 'basin', 'for', 'pp_rm', 'g', 'instead', 'the', 'dynamics', 'becomes', 'strongly', 'anomalous', 'displaying', 'very', 'large', 'equilibration', 'time', 'scales', 'aging', 'and', 'a', 'constantly', 'increasing', 'dynamical', 'susceptibility', 'the', 'crossover', 'at', 'p_rm', 'g', 'is', 'strongly', 'reminiscent', 'of', 'the', 'one', 'observed', 'in', 'threedimensional', 'spinglasses', 'in', 'an', 'external', 'field', 'suggesting', 'that', 'the', 'two', 'systems', 'could', 'be', 'in', 'the', 'same', 'universality', 'class', 'consistently', 'with', 'theoretical', 'expectations']]
|
[-0.1385812490203639, 0.3112349037003323, -0.14863241087266732, 0.052219889218007756, 0.002981433363483964, -0.1707706479405944, 0.00300055305413205, 0.3523053254583757, -0.25418004461584226, -0.25095234773832203, 0.0494425892084502, -0.2965407587936242, -0.12618933196125967, 0.12922962611246344, 0.026019334801466024, 0.03268382630123348, -0.02009408838340088, 0.030576693676345103, -0.1098717306225507, -0.14223371917154076, 0.2724426683078674, -0.02903219663036364, 0.29419912851462476, 0.03701664745161082, 0.06721232670339213, 0.0010421673110652741, 0.10748024082494725, 0.10443072816986831, -0.1813713987885029, -0.046598559774780016, 0.24256327805920042, -0.03041261558508058, 0.23060588799283016, -0.38519307254083296, -0.24773775250818447, 0.10377359235233781, 0.12104049566195166, 0.05879624465668051, -0.056000048224311726, -0.2290250798486334, 0.006878661336846274, -0.1560609215642694, -0.17276959513521772, -0.06795385439056072, 0.07407915085326318, 0.009222855751248572, -0.23739920463413, 0.13802588730380475, 0.08749251614162269, 0.08773130672923524, -0.06248661690130294, -0.0759969826121044, -0.04535123208041886, 0.07150968537237093, 0.02441773532551425, 0.07528807122089477, 0.1947410278932674, -0.17614247687428974, -0.050294778949627986, 0.38359536745806605, -0.08845857095070478, -0.08333522684054731, 0.2625275561653024, -0.20424179263453154, -0.10605944004981853, 0.2147092763384764, 0.13642305304068508, 0.10866341863175948, -0.12354428448761218, 0.014281292173763564, -0.010038876135518654, 0.19409065651405844, -0.0037867599920697994, -0.04386527341348287, 0.26347331809911795, 0.25406493230809946, 0.008305203176284437, 0.19189027339645506, -0.07481771658623604, -0.13586307985359708, -0.2490492935473327, -0.1400276267324849, -0.1933382622656419, 0.05485973477350186, -0.1367728281579828, -0.1978526520576301, 0.3496900572585572, 0.09565102970629609, 0.228266508325184, 0.06622841237648892, 0.22072495482342733, 0.06845001397795118, 0.028822117267350712, 0.105007106143472, 0.2522338722504193, 0.13977856651156229, 0.14603441148969554, -0.2610675694467835, 0.058998094459580215, 0.06263646792298813]
|
1,803.05032
|
Understanding Interface Design and Mobile Money Perceptions in Latin
America
|
Mobile money can facilitate financial inclusion in developing countries,
which usually have high mobile phone use and steady remittance activity. Many
countries in Latin America meet the minimum technological requirements to use
mobile money, however, the adoption in this region is relatively low. This
paper investigates the different factors that lead people in Latin America to
distrust and therefore not adopt mobile money. For this purpose, we analyzed 27
mobile money applications on the market and investigated the perceptions that
people in Latin America have of such interfaces. From our study, we singled out
the interface features that have the greatest influence in user adoption in
developing countries. We identified that for the Latin America market it is
crucial to create mobile applications that allow the user to visualize and
understand the workflow through which their money is traveling to recipients.
We examined the significance of these findings in the design of future mobile
money applications that can effectively improve the use of electronic financial
transactions in Latin America.
|
cs.HC
|
mobile money can facilitate financial inclusion in developing countries which usually have high mobile phone use and steady remittance activity many countries in latin america meet the minimum technological requirements to use mobile money however the adoption in this region is relatively low this paper investigates the different factors that lead people in latin america to distrust and therefore not adopt mobile money for this purpose we analyzed 27 mobile money applications on the market and investigated the perceptions that people in latin america have of such interfaces from our study we singled out the interface features that have the greatest influence in user adoption in developing countries we identified that for the latin america market it is crucial to create mobile applications that allow the user to visualize and understand the workflow through which their money is traveling to recipients we examined the significance of these findings in the design of future mobile money applications that can effectively improve the use of electronic financial transactions in latin america
|
[['mobile', 'money', 'can', 'facilitate', 'financial', 'inclusion', 'in', 'developing', 'countries', 'which', 'usually', 'have', 'high', 'mobile', 'phone', 'use', 'and', 'steady', 'remittance', 'activity', 'many', 'countries', 'in', 'latin', 'america', 'meet', 'the', 'minimum', 'technological', 'requirements', 'to', 'use', 'mobile', 'money', 'however', 'the', 'adoption', 'in', 'this', 'region', 'is', 'relatively', 'low', 'this', 'paper', 'investigates', 'the', 'different', 'factors', 'that', 'lead', 'people', 'in', 'latin', 'america', 'to', 'distrust', 'and', 'therefore', 'not', 'adopt', 'mobile', 'money', 'for', 'this', 'purpose', 'we', 'analyzed', '27', 'mobile', 'money', 'applications', 'on', 'the', 'market', 'and', 'investigated', 'the', 'perceptions', 'that', 'people', 'in', 'latin', 'america', 'have', 'of', 'such', 'interfaces', 'from', 'our', 'study', 'we', 'singled', 'out', 'the', 'interface', 'features', 'that', 'have', 'the', 'greatest', 'influence', 'in', 'user', 'adoption', 'in', 'developing', 'countries', 'we', 'identified', 'that', 'for', 'the', 'latin', 'america', 'market', 'it', 'is', 'crucial', 'to', 'create', 'mobile', 'applications', 'that', 'allow', 'the', 'user', 'to', 'visualize', 'and', 'understand', 'the', 'workflow', 'through', 'which', 'their', 'money', 'is', 'traveling', 'to', 'recipients', 'we', 'examined', 'the', 'significance', 'of', 'these', 'findings', 'in', 'the', 'design', 'of', 'future', 'mobile', 'money', 'applications', 'that', 'can', 'effectively', 'improve', 'the', 'use', 'of', 'electronic', 'financial', 'transactions', 'in', 'latin', 'america']]
|
[-0.12166090914979577, 0.06653932608752208, -0.04294583827433501, 0.1075915547539673, -0.09897809564246185, -0.13730642483046157, 0.10971696338183715, 0.40450087584659855, -0.24072011733240278, -0.2998683941522999, 0.15215822291276665, -0.3254195762324263, -0.18621343683958405, 0.1609239432982792, -0.17743109672391627, -0.015329500131264946, 0.0551107853944496, -0.014972473947281711, 0.05171446653204204, -0.311660825835607, 0.2559671860612576, 0.04567104969559425, 0.3751356606674794, 0.09593408293477894, 0.031713495831440626, -0.028888968359568768, -0.032958960183000624, -0.018047190233431317, -0.10845245541076481, 0.1689143477182714, 0.40805169278700676, 0.20273718939675295, 0.3898103598549345, -0.49592521542010926, -0.13216663857910937, 0.10083436942797087, 0.13857371784256187, 0.054481578942597704, -0.053770826224939616, -0.30433363121928725, 0.07189625835000708, -0.2987714288976683, -0.12433000026717121, -0.05095444725462671, 0.027925273370460645, 0.031684627491614326, -0.19982465346152314, -0.022976066501116787, -0.0595637045211032, 0.11049464348284803, 0.013191147718424275, -0.11073362306531893, -0.0246184406948094, 0.251404329893295, 0.09501305067933788, -0.06932611997961205, 0.15109284677867882, -0.14179625807566976, -0.15607216561863407, 0.38475540311202494, 0.04884383003723383, -0.1468339565502116, 0.16430188989757213, -0.14838362907847533, -0.15919629383843237, 0.0891173143579057, 0.25558119977565386, -0.004458053161516874, -0.19615181146972102, -0.002557547514832485, -0.04631372464038211, 0.13924026055145766, 0.11274412633801574, 0.01643141462280244, 0.21161989643536067, 0.17302436832911694, 0.1021341703285893, 0.07948367707651748, -0.04599707673810775, -0.1648906574818063, -0.1613021047356037, -0.211376155307792, -0.15440382711732617, 0.019262822875398287, -0.06526591822872842, -0.14899394350379883, 0.3768042919650321, 0.24277899411545525, 0.04791804955109469, -0.02182657823115367, 0.28650926192395787, 0.012497725404010942, 0.09964904701612758, 0.11996657413722583, 0.18340718796402325, -0.043962632322452476, 0.23751699002514753, -0.13610807375172318, 0.1478668794410645, -0.033131117105880785]
|
1,803.05033
|
Limiting probabilities for vertices of a given rank in rooted trees
|
We consider two varieties of labeled rooted trees, and the probability that a
vertex chosen from all vertices of all trees of a given size uniformly at
random has a given rank. We prove that this probability converges to a limit as
the tree size goes to infinity.
|
math.CO
|
we consider two varieties of labeled rooted trees and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank we prove that this probability converges to a limit as the tree size goes to infinity
|
[['we', 'consider', 'two', 'varieties', 'of', 'labeled', 'rooted', 'trees', 'and', 'the', 'probability', 'that', 'a', 'vertex', 'chosen', 'from', 'all', 'vertices', 'of', 'all', 'trees', 'of', 'a', 'given', 'size', 'uniformly', 'at', 'random', 'has', 'a', 'given', 'rank', 'we', 'prove', 'that', 'this', 'probability', 'converges', 'to', 'a', 'limit', 'as', 'the', 'tree', 'size', 'goes', 'to', 'infinity']]
|
[-0.11936101705456774, 0.18623037195842093, -0.04645499359079016, 0.051530713979445864, -0.04753536867792718, -0.1217436915030703, 0.14774525491520762, 0.3335542812710628, -0.28313864558003843, -0.18513773862893382, 0.075284873804776, -0.3420298385899514, -0.11097322210359077, 0.07033037506820013, -0.10822499379476842, 0.03491712788430353, 0.10834264157650371, 0.17987580958288163, -0.003240805420015628, -0.305809057574758, 0.35866426353459246, -0.0011115731516232092, 0.2141523938626051, -0.009612236773439994, 0.20431825969353667, 0.04559823079034686, 0.004260947306950887, 0.12077395412294815, -0.13590471728972867, 0.03571484338802596, 0.27858852862846106, 0.18171650308552975, 0.297385564694802, -0.3422996891895309, -0.14629720306644836, 0.2375139604943494, 0.13618446943776993, 0.1344494873774238, 0.018850746850754756, -0.18095284491816224, 0.15509823197983982, -0.14681737198649594, -0.1773361099185422, 0.04111317750842621, 0.050382909697267074, 0.06633045438987513, -0.29631482526504743, -0.08265399096611266, 0.0930843986182784, -0.007907711085863411, 0.04191897937562317, -0.18229527860724679, -0.07862781967075232, 0.16185780734910318, 0.012014077091104506, 0.09222818573471159, 0.07073459050540502, -0.08072153749041415, -0.15682775364257395, 0.32595809471483034, -0.035413437096091606, -0.21538225168478675, 0.198990639745413, -0.18399172152082124, -0.17999536027006494, 0.11989813640442055, 0.1778381194647712, 0.15943650912049634, -0.08894345336981739, 0.15796012576781018, -0.12436928927976017, 0.11834726038311298, 0.16908116512543833, -0.02983585011679679, 0.14846480494209877, 0.16543330873052278, 0.14613342110533267, 0.19377191174620143, -0.06535676116861093, -0.019374182214960456, -0.3149767047725618, -0.09627815122560908, -0.2499527170099706, 0.11466732429107651, -0.20290559298367347, -0.2736936709843576, 0.3806655250955373, 0.16167034395039082, 0.32425470227220404, 0.2479576589151596, 0.21734798008886477, 0.10529484279444053, 0.013699023557516435, 0.15483105208841152, 0.062296556139093205, 0.15179761043206477, -0.027386251837015152, -0.08685309843228121, 0.07503785407364678, 0.1637237298224742]
|
1,803.05034
|
Pechukas-Yukawa formalism for Landau-Zener transitions in the presence
of external noise
|
Quantum systems are prone to decoherence due to both intrinsic interactions
as well as random fluctuations from the environment. Using the Pechukas-Yukawa
formalism, we investigate the influence of noise on the dynamics of an
adiabatically evolving Hamiltonian which can describe a quantum computer. Under
this description, the level dynamics of a parametrically perturbed quantum
Hamiltonian are mapped to the dynamics of 1D classical gas. We show that our
framework coincides with the results of the classical Landau-Zener transitions
upon linearisation. Furthermore, we determine the effects of external noise on
the level dynamics and its impact on Landau-Zener transitions.
|
cond-mat.stat-mech quant-ph
|
quantum systems are prone to decoherence due to both intrinsic interactions as well as random fluctuations from the environment using the pechukasyukawa formalism we investigate the influence of noise on the dynamics of an adiabatically evolving hamiltonian which can describe a quantum computer under this description the level dynamics of a parametrically perturbed quantum hamiltonian are mapped to the dynamics of 1d classical gas we show that our framework coincides with the results of the classical landauzener transitions upon linearisation furthermore we determine the effects of external noise on the level dynamics and its impact on landauzener transitions
|
[['quantum', 'systems', 'are', 'prone', 'to', 'decoherence', 'due', 'to', 'both', 'intrinsic', 'interactions', 'as', 'well', 'as', 'random', 'fluctuations', 'from', 'the', 'environment', 'using', 'the', 'pechukasyukawa', 'formalism', 'we', 'investigate', 'the', 'influence', 'of', 'noise', 'on', 'the', 'dynamics', 'of', 'an', 'adiabatically', 'evolving', 'hamiltonian', 'which', 'can', 'describe', 'a', 'quantum', 'computer', 'under', 'this', 'description', 'the', 'level', 'dynamics', 'of', 'a', 'parametrically', 'perturbed', 'quantum', 'hamiltonian', 'are', 'mapped', 'to', 'the', 'dynamics', 'of', '1d', 'classical', 'gas', 'we', 'show', 'that', 'our', 'framework', 'coincides', 'with', 'the', 'results', 'of', 'the', 'classical', 'landauzener', 'transitions', 'upon', 'linearisation', 'furthermore', 'we', 'determine', 'the', 'effects', 'of', 'external', 'noise', 'on', 'the', 'level', 'dynamics', 'and', 'its', 'impact', 'on', 'landauzener', 'transitions']]
|
[-0.14196222170543552, 0.16774430804620424, -0.08580531393075647, 0.069631523455075, 0.023255523184625603, -0.10052505425861752, 0.03591462105218017, 0.3258181908072866, -0.28531065973339187, -0.2756247992760369, 0.06852896823975428, -0.26073674798696017, -0.19977484314645433, 0.18519937048419094, -0.02142863479271835, 0.047739955661366976, 0.05195276559881714, 0.03734819224218325, -0.06530412082318027, -0.2011468472310855, 0.32458533913049165, 0.07515311842827051, 0.24875345051868306, 0.021952368059475924, 0.08304047097014833, 0.010639132686079317, 0.04168476390044148, 0.009189319948912884, -0.13243977671136606, 0.050217238501930724, 0.1666869526819269, 0.03917971317542299, 0.24448432279180507, -0.46284015248624644, -0.24108441550835816, 0.052607905002054284, 0.11636404995331351, 0.20090761692952175, 0.007200662252179594, -0.3609176985254245, -0.016081243629890437, -0.15024011020729205, -0.1165398907210982, -0.1143321035030697, -0.03266315017137866, 0.03808146536977468, -0.210189274288904, 0.06484726590237447, 0.09684405537269895, 0.03676448151355191, -0.03644146109403738, -0.01774456942149875, -0.010445191467903098, 0.14402543767105921, -0.026573706484798874, -0.007797447443649895, 0.21442737348605784, -0.13636645347554693, -0.13966048095964503, 0.42612368244753807, -0.10693242101055779, -0.2189221890187081, 0.22278122721734095, -0.11838643303217024, -0.10223937570354996, 0.10084506428363371, 0.17163583928034926, 0.07656786494831345, -0.138140947581744, 0.12202514960770305, 0.041997606390897106, 0.16196015000115244, -0.018667504792481814, 0.06120475626322536, 0.2074496894124515, 0.13900641330080676, 0.02868471644362625, 0.18893627274771962, -0.08093142671016407, -0.2271994594627117, -0.2799933316395143, -0.0820352585689056, -0.1884760037135827, 0.12725217577203043, -0.03622590536925061, -0.17637109951287203, 0.42032563967193115, 0.2040537254953441, 0.19934040910507345, 0.028334636254264613, 0.29122801838746787, 0.17703047189837778, -9.267074436101378e-05, 0.04077809568665618, 0.22728125487777348, 0.16458378379632319, 0.03368063049143827, -0.33848463446234484, 0.03823047176915772, 0.028186849413477644]
|
1,803.05035
|
Autonomous data-driven design of inorganic materials with AFLOW
|
The expansion of programmatically-accessible materials data has cultivated
opportunities for data-driven approaches. Highly-automated frameworks like
AFLOW not only manage the generation, storage, and dissemination of materials
data, but also leverage the information for thermodynamic formability modeling,
such as the prediction of phase diagrams and properties of disordered
materials. In combination with standardized parameter sets, the wealth of data
is ideal for training machine learning algorithms, which have already been
employed for property prediction, descriptor development, design rule
discovery, and the identification of candidate functional materials. These
methods promise to revolutionize the path to synthesis and, ultimately,
transform the practice of traditional materials discovery to one of rational
and autonomous materials design.
|
cond-mat.mtrl-sci
|
the expansion of programmaticallyaccessible materials data has cultivated opportunities for datadriven approaches highlyautomated frameworks like aflow not only manage the generation storage and dissemination of materials data but also leverage the information for thermodynamic formability modeling such as the prediction of phase diagrams and properties of disordered materials in combination with standardized parameter sets the wealth of data is ideal for training machine learning algorithms which have already been employed for property prediction descriptor development design rule discovery and the identification of candidate functional materials these methods promise to revolutionize the path to synthesis and ultimately transform the practice of traditional materials discovery to one of rational and autonomous materials design
|
[['the', 'expansion', 'of', 'programmaticallyaccessible', 'materials', 'data', 'has', 'cultivated', 'opportunities', 'for', 'datadriven', 'approaches', 'highlyautomated', 'frameworks', 'like', 'aflow', 'not', 'only', 'manage', 'the', 'generation', 'storage', 'and', 'dissemination', 'of', 'materials', 'data', 'but', 'also', 'leverage', 'the', 'information', 'for', 'thermodynamic', 'formability', 'modeling', 'such', 'as', 'the', 'prediction', 'of', 'phase', 'diagrams', 'and', 'properties', 'of', 'disordered', 'materials', 'in', 'combination', 'with', 'standardized', 'parameter', 'sets', 'the', 'wealth', 'of', 'data', 'is', 'ideal', 'for', 'training', 'machine', 'learning', 'algorithms', 'which', 'have', 'already', 'been', 'employed', 'for', 'property', 'prediction', 'descriptor', 'development', 'design', 'rule', 'discovery', 'and', 'the', 'identification', 'of', 'candidate', 'functional', 'materials', 'these', 'methods', 'promise', 'to', 'revolutionize', 'the', 'path', 'to', 'synthesis', 'and', 'ultimately', 'transform', 'the', 'practice', 'of', 'traditional', 'materials', 'discovery', 'to', 'one', 'of', 'rational', 'and', 'autonomous', 'materials', 'design']]
|
[-0.0536336628429126, 0.05146577623249455, -0.0833593260158192, 0.02557023435682905, -0.1386955902721225, -0.16662095820197878, 0.08067079047587784, 0.3921982209452174, -0.3107243050482463, -0.32068102469413795, 0.14980314416620372, -0.3062518259256401, -0.17178783876059409, 0.2231157511472702, -0.040086818600750786, 0.1362738419535824, 0.06922754063694314, -0.02727415218991651, -0.05766874689778144, -0.23188477580181577, 0.24851404258304022, 0.057375059340318495, 0.3862263111397624, 0.017887690460140056, 0.0811458471855572, 0.004438413213938475, -0.013062464619394053, -0.008652375545352697, -0.12745269233022224, 0.19280579582026058, 0.3513883181085641, 0.17930369445788197, 0.2961871116972444, -0.41019007551737807, -0.2707587133246389, 0.10764474089003422, 0.1298460776197978, 0.07977516197874635, -0.10439242747696963, -0.2430199888788841, 0.05918183850166811, -0.17157228913539174, -0.10985226024958221, -0.19373389489271425, 0.014376586381430653, 0.034531203032979234, -0.263321013989943, -0.022332079186030154, 0.03772399551658468, 0.08104452717710625, -0.09147323910146951, -0.14070721404118972, 0.014877115206962282, 0.14171337691474367, 0.025582450448366052, -0.0014791757132942703, 0.1339723450338087, -0.20026276470585302, -0.1783053355693648, 0.41475052980875426, 0.0150344537592239, -0.13264945198527792, 0.1970871865453029, -0.05944289833476597, -0.17791420528241855, 0.11329159923321144, 0.2060075795362619, 0.05437347596214915, -0.2135250838812102, 0.06044875702302141, 0.06492859261449088, 0.12619280438150532, -0.012642568989064205, 0.0897896227828989, 0.2167355197035332, 0.2555959558791735, 0.02133366111771796, 0.06676088227382437, -0.07106906185773286, -0.06556856370615688, -0.18658683119680394, -0.2088430814360353, -0.2005719273859127, -0.02887545913518724, -0.07677372424924132, -0.22588964114812288, 0.3661355813118545, 0.18979795108951458, 0.08832474064415279, 0.006494674976618791, 0.3026590428061106, 0.018198934111701832, 0.1571414176374674, 0.03424788197417828, 0.2218096253313971, 0.0647064184769988, 0.15431562665087933, -0.1404222045855766, 0.13371001765216617, 0.026464524755085057]
|
1,803.05036
|
Variational zero-inflated Gaussian processes with sparse kernels
|
Zero-inflated datasets, which have an excess of zero outputs, are commonly
encountered in problems such as climate or rare event modelling. Conventional
machine learning approaches tend to overestimate the non-zeros leading to poor
performance. We propose a novel model family of zero-inflated Gaussian
processes (ZiGP) for such zero-inflated datasets, produced by sparse kernels
through learning a latent probit Gaussian process that can zero out kernel rows
and columns whenever the signal is absent. The ZiGPs are particularly useful
for making the powerful Gaussian process networks more interpretable. We
introduce sparse GP networks where variable-order latent modelling is achieved
through sparse mixing signals. We derive the non-trivial stochastic variational
inference tractably for scalable learning of the sparse kernels in both models.
The novel output-sparse approach improves both prediction of zero-inflated data
and interpretability of latent mixing models.
|
stat.ML
|
zeroinflated datasets which have an excess of zero outputs are commonly encountered in problems such as climate or rare event modelling conventional machine learning approaches tend to overestimate the nonzeros leading to poor performance we propose a novel model family of zeroinflated gaussian processes zigp for such zeroinflated datasets produced by sparse kernels through learning a latent probit gaussian process that can zero out kernel rows and columns whenever the signal is absent the zigps are particularly useful for making the powerful gaussian process networks more interpretable we introduce sparse gp networks where variableorder latent modelling is achieved through sparse mixing signals we derive the nontrivial stochastic variational inference tractably for scalable learning of the sparse kernels in both models the novel outputsparse approach improves both prediction of zeroinflated data and interpretability of latent mixing models
|
[['zeroinflated', 'datasets', 'which', 'have', 'an', 'excess', 'of', 'zero', 'outputs', 'are', 'commonly', 'encountered', 'in', 'problems', 'such', 'as', 'climate', 'or', 'rare', 'event', 'modelling', 'conventional', 'machine', 'learning', 'approaches', 'tend', 'to', 'overestimate', 'the', 'nonzeros', 'leading', 'to', 'poor', 'performance', 'we', 'propose', 'a', 'novel', 'model', 'family', 'of', 'zeroinflated', 'gaussian', 'processes', 'zigp', 'for', 'such', 'zeroinflated', 'datasets', 'produced', 'by', 'sparse', 'kernels', 'through', 'learning', 'a', 'latent', 'probit', 'gaussian', 'process', 'that', 'can', 'zero', 'out', 'kernel', 'rows', 'and', 'columns', 'whenever', 'the', 'signal', 'is', 'absent', 'the', 'zigps', 'are', 'particularly', 'useful', 'for', 'making', 'the', 'powerful', 'gaussian', 'process', 'networks', 'more', 'interpretable', 'we', 'introduce', 'sparse', 'gp', 'networks', 'where', 'variableorder', 'latent', 'modelling', 'is', 'achieved', 'through', 'sparse', 'mixing', 'signals', 'we', 'derive', 'the', 'nontrivial', 'stochastic', 'variational', 'inference', 'tractably', 'for', 'scalable', 'learning', 'of', 'the', 'sparse', 'kernels', 'in', 'both', 'models', 'the', 'novel', 'outputsparse', 'approach', 'improves', 'both', 'prediction', 'of', 'zeroinflated', 'data', 'and', 'interpretability', 'of', 'latent', 'mixing', 'models']]
|
[-0.021274171548167287, 0.06457099186607086, -0.05419855518091498, 0.138557310078843, -0.14571266719035075, -0.21573778729766777, 0.043737791918036076, 0.4441418511779013, -0.3145525931972394, -0.24822025076675236, 0.0936584588563896, -0.25790651266540127, -0.19799604820554964, 0.15784834750535848, -0.09742082533237517, 0.1364608492870304, 0.11847686822197043, -0.0024448591109393234, -0.057233075579782404, -0.24148575558775293, 0.28601276424286287, 0.0685748971659074, 0.32059925420671925, -0.07298613798671535, 0.12565375156648093, -0.016850486863404512, -0.07015112020544484, -0.04505957994098894, -0.03090773064309873, 0.14227712926405825, 0.34245234305159183, 0.21208172550606996, 0.34261584326036665, -0.42250022713683155, -0.31798556228553443, 0.18524149997874087, 0.156308087099937, 0.0629429677273742, -0.0059291023076765755, -0.2931993677721996, 0.026294224218052244, -0.17893610983960948, 0.012260186079805507, -0.20612484290915772, -0.06977959432730213, -0.007457565558247997, -0.3920187212586319, 0.1369938181951306, 0.09497168064782661, 0.03993052613214219, 0.020203467623918857, -0.20824042834075435, 0.03353960905136555, 0.07062255687612508, 0.05437655603605904, -0.02293600617291728, 0.11409344949892589, -0.17054146780681453, -0.1532731845001585, 0.33102491120343913, -0.09585389829524338, -0.24413123918711244, 0.20463213744517275, -0.050871017163171245, -0.18567447648847588, 0.14777821096542634, 0.2740750718858317, 0.08780947050274021, -0.18999547493483002, 0.036167158142145356, -0.024941368322623402, 0.11159686062526994, 0.011223246245399901, -0.04482495937762516, 0.17843520567626378, 0.23400940339928283, 0.0225650933886269, 0.12382190463070135, -0.1462649724348203, -0.10732486664625655, -0.20633755989076877, -0.07309345118316325, -0.19547499648883546, -0.03287537900216289, -0.19380344944998196, -0.23670061885316232, 0.34630749419224766, 0.20396203702819862, 0.22780073203034418, 0.10950174104926505, 0.30837875461079794, 0.10751315498202899, 0.05909373101260149, 0.10655559032378172, 0.1033676255886492, 0.12589517590953947, 0.06416510059533262, -0.1168314005699905, 0.15693581780187674, -0.015568322579103304]
|
1,803.05037
|
The conformal, complex and non-commutative structures of the
Schwarzschild solution
|
The generic null geodesic of the Schwarzschild--Kruskal--Szekeres geometry
has a natural complexification, an elliptic curve with a cusp at the
singularity. To realize that complexification as a Riemann surface without a
cusp, and also to ensure conservation of energy at the singularity, requires a
branched cover of the space-time over the singularity, with the geodesic being
doubled as well to obtain a genus two hyperelliptic curve with an extra
involution. Furthermore, the resulting space-time obtained from this branch
cover has a Hamiltonian that is null geodesically complete. The full complex
null geodesic can be realized in a natural complexification of the
Kruskal--Szekeres metric.
|
math-ph gr-qc math.MP
|
the generic null geodesic of the schwarzschildkruskalszekeres geometry has a natural complexification an elliptic curve with a cusp at the singularity to realize that complexification as a riemann surface without a cusp and also to ensure conservation of energy at the singularity requires a branched cover of the spacetime over the singularity with the geodesic being doubled as well to obtain a genus two hyperelliptic curve with an extra involution furthermore the resulting spacetime obtained from this branch cover has a hamiltonian that is null geodesically complete the full complex null geodesic can be realized in a natural complexification of the kruskalszekeres metric
|
[['the', 'generic', 'null', 'geodesic', 'of', 'the', 'schwarzschildkruskalszekeres', 'geometry', 'has', 'a', 'natural', 'complexification', 'an', 'elliptic', 'curve', 'with', 'a', 'cusp', 'at', 'the', 'singularity', 'to', 'realize', 'that', 'complexification', 'as', 'a', 'riemann', 'surface', 'without', 'a', 'cusp', 'and', 'also', 'to', 'ensure', 'conservation', 'of', 'energy', 'at', 'the', 'singularity', 'requires', 'a', 'branched', 'cover', 'of', 'the', 'spacetime', 'over', 'the', 'singularity', 'with', 'the', 'geodesic', 'being', 'doubled', 'as', 'well', 'to', 'obtain', 'a', 'genus', 'two', 'hyperelliptic', 'curve', 'with', 'an', 'extra', 'involution', 'furthermore', 'the', 'resulting', 'spacetime', 'obtained', 'from', 'this', 'branch', 'cover', 'has', 'a', 'hamiltonian', 'that', 'is', 'null', 'geodesically', 'complete', 'the', 'full', 'complex', 'null', 'geodesic', 'can', 'be', 'realized', 'in', 'a', 'natural', 'complexification', 'of', 'the', 'kruskalszekeres', 'metric']]
|
[-0.18427209945979947, 0.05670446418619523, -0.16428495631735845, 0.07435796386105757, -0.1584520648763168, -0.1341650833686193, -0.03301069942558659, 0.3009932431684551, -0.27067027957002887, -0.2305237416397123, 0.10510432666199573, -0.2708307594407861, -0.1421690071092955, 0.20431857717716517, -0.12190363645626634, 0.03625524437452173, 0.07800744434900801, 0.13269782867100016, -0.13839058627776218, -0.24185369262590492, 0.4113743835147105, 0.03234328010904731, 0.2250067785669885, 0.06156952423728345, 0.16119098183972871, 0.006374341666278448, 0.06031204663233046, 0.0272227509732486, -0.10716355373633811, 0.07253405850782406, 0.2476794978548937, 0.09405968451470721, 0.13817237185054076, -0.3982196066199857, -0.2702226351270927, 0.16701002205338547, 0.16026359104423546, 0.040793069014006166, -0.001591312452493345, -0.24840255284353213, 0.07710677929058232, -0.10399998386627902, -0.25085203560964003, -0.03610905870457417, 0.023263674512432487, -0.05527021962345815, -0.18580729535360838, -0.012163960518984251, 0.0868463746064306, 0.10423660884593047, -0.017920651838329492, -0.00421165815536298, -0.11605048344205773, 0.04603884899623546, 0.06250603903511849, 0.12919724576503916, 0.06967353537751764, -0.0831474899063252, -0.07775367258399651, 0.38834965611150596, -0.08161906265041918, -0.27063309346490044, 0.11354954578621569, -0.14977357286375528, -0.09311980110885319, 0.1793860842236409, 0.09685132193707806, 0.1408838872779526, -0.10287655363151547, 0.19061356704332866, -0.050168615656302255, 0.058818204188034594, 0.13838218227394072, -0.06474094973950117, 0.23562813044397854, 0.11203435534730043, 0.12329205123744175, 0.11598427333371422, -0.06842508548231539, -0.0762920473273113, -0.4113490824751994, -0.242321587268117, -0.15380766783274857, 0.1607452285448637, -0.17596344677625822, -0.23747612775175594, 0.4152171254276718, -0.015609673946278681, 0.23468743863643385, 0.08031186213095982, 0.2470970107242465, 0.09986668049732186, 0.08840152951340903, 0.0918302152388017, 0.1952709499746561, 0.104775019647444, 0.014877895435418788, -0.18083453624207965, -0.06141929593229411, 0.10556013871659982]
|
1,803.05038
|
Ultrafast light switching of ferromagnetism in EuSe
|
We demonstrate that light resonant with the bandgap forces the
antiferromagnetic semiconducor EuSe to enter ferromagnetic alignment in the
picosecond time scale. A photon generates an electron-hole pair, whose electron
forms a supergiant spin polaron of magnetic moment of nearly 6,000 Bohr
magnetons. By increasing the light intensity, the whole of the sample can be
fully magnetized. The key to the novel large photoinduced magnetization
mechanism is the huge enhancement of the magnetic susceptibility when both
antiferromagnetic and ferromagnetic interactions are present in the material,
and are of nearly equal magnitude, as is the case in EuSe.
|
cond-mat.mtrl-sci
|
we demonstrate that light resonant with the bandgap forces the antiferromagnetic semiconducor euse to enter ferromagnetic alignment in the picosecond time scale a photon generates an electronhole pair whose electron forms a supergiant spin polaron of magnetic moment of nearly 6000 bohr magnetons by increasing the light intensity the whole of the sample can be fully magnetized the key to the novel large photoinduced magnetization mechanism is the huge enhancement of the magnetic susceptibility when both antiferromagnetic and ferromagnetic interactions are present in the material and are of nearly equal magnitude as is the case in euse
|
[['we', 'demonstrate', 'that', 'light', 'resonant', 'with', 'the', 'bandgap', 'forces', 'the', 'antiferromagnetic', 'semiconducor', 'euse', 'to', 'enter', 'ferromagnetic', 'alignment', 'in', 'the', 'picosecond', 'time', 'scale', 'a', 'photon', 'generates', 'an', 'electronhole', 'pair', 'whose', 'electron', 'forms', 'a', 'supergiant', 'spin', 'polaron', 'of', 'magnetic', 'moment', 'of', 'nearly', '6000', 'bohr', 'magnetons', 'by', 'increasing', 'the', 'light', 'intensity', 'the', 'whole', 'of', 'the', 'sample', 'can', 'be', 'fully', 'magnetized', 'the', 'key', 'to', 'the', 'novel', 'large', 'photoinduced', 'magnetization', 'mechanism', 'is', 'the', 'huge', 'enhancement', 'of', 'the', 'magnetic', 'susceptibility', 'when', 'both', 'antiferromagnetic', 'and', 'ferromagnetic', 'interactions', 'are', 'present', 'in', 'the', 'material', 'and', 'are', 'of', 'nearly', 'equal', 'magnitude', 'as', 'is', 'the', 'case', 'in', 'euse']]
|
[-0.17675302447363114, 0.26227682814002645, 0.0022647528482290604, 0.024972630802949425, -0.05482679147826275, -0.08160781565675279, 0.03279917487028191, 0.3958133524283767, -0.2629338007730742, -0.31947462386839715, 0.000794684588375579, -0.33772258981965325, -0.05378762564699476, 0.20277881985142207, 0.07599393808292614, -0.03095084326923825, -0.022792458929567754, -0.002568507237204661, -0.06757795703742886, -0.20964966328271353, 0.28037822756838676, 0.015167428685041765, 0.2755475809390191, 0.10270000708502873, 0.07271399827732239, 0.01299388885187606, 0.12398031288951945, -0.022296281085194398, -0.07540647710546484, 0.05715571421508988, 0.21463736147658588, -0.08760054543381557, 0.21832970100998259, -0.43099607367632115, -0.14233246063425517, 0.036881786169639476, 0.1587560549766446, 0.14899142588789496, -0.06598238587806311, -0.27138611047848826, 0.04625167888298165, -0.14569970812105262, -0.1190565314621684, -0.09817386604845524, 0.004155415192750904, 0.03228650383243803, -0.284502762980992, 0.11621805454099861, 0.09411972696640684, 0.06637731755836285, -0.10213092094636522, -0.06504663195422229, -0.06929296895881028, 0.053265907029526716, 0.08649738031090237, 0.09453075814720553, 0.16156828814807037, -0.10781916203753401, -0.09768865081423428, 0.3746197687833046, -0.08311698483400203, -0.0665211647186273, 0.10260230660787784, -0.2287730384026266, -0.00018204345057408014, 0.21734551250119694, 0.126558741137463, 0.13094541116606706, -0.15165804045030504, 0.0466062188243086, -0.01760884221099938, 0.2163759077581441, 0.021494605956831947, 0.07836025419965154, 0.2772735143468405, 0.2321223723871905, 0.03701304258963015, 0.15129845591218327, -0.16386529432202224, -0.05501133676928779, -0.20860433728861003, -0.15650974135981718, -0.23076323348019892, 0.07305554673075676, -0.10956203207964184, -0.1852518339874223, 0.4122590205794647, 0.14982624625554308, 0.17897769925184548, -0.05837281457691764, 0.2878068042142938, 0.11688342245057963, 0.09846202758490108, 0.03266061467002146, 0.2994369466905482, 0.16725494212247818, 0.11424394525238313, -0.2954712257972763, 0.055331213564689584, -0.014752865739865229]
|
1,803.05039
|
Android Inter-App Communication Threats, Solutions, and Challenges
|
Researchers and commercial companies have made a lot of efforts on detecting
malware in Android platform. However, a recent malware threat, App collusion,
makes malware detection challenging. In App collusion, two or more Apps
collaborate to perform malicious actions by communicating with each other,
which makes single App analysis insufficient. In this paper, we first introduce
Android security mechanism and communication channels used by android
Applications. Then we summarize the security vulnerabilities and potential
threats introduced by App communication. Finally, we discuss state of art
researches and challenges on App collusion detection.
|
cs.CR
|
researchers and commercial companies have made a lot of efforts on detecting malware in android platform however a recent malware threat app collusion makes malware detection challenging in app collusion two or more apps collaborate to perform malicious actions by communicating with each other which makes single app analysis insufficient in this paper we first introduce android security mechanism and communication channels used by android applications then we summarize the security vulnerabilities and potential threats introduced by app communication finally we discuss state of art researches and challenges on app collusion detection
|
[['researchers', 'and', 'commercial', 'companies', 'have', 'made', 'a', 'lot', 'of', 'efforts', 'on', 'detecting', 'malware', 'in', 'android', 'platform', 'however', 'a', 'recent', 'malware', 'threat', 'app', 'collusion', 'makes', 'malware', 'detection', 'challenging', 'in', 'app', 'collusion', 'two', 'or', 'more', 'apps', 'collaborate', 'to', 'perform', 'malicious', 'actions', 'by', 'communicating', 'with', 'each', 'other', 'which', 'makes', 'single', 'app', 'analysis', 'insufficient', 'in', 'this', 'paper', 'we', 'first', 'introduce', 'android', 'security', 'mechanism', 'and', 'communication', 'channels', 'used', 'by', 'android', 'applications', 'then', 'we', 'summarize', 'the', 'security', 'vulnerabilities', 'and', 'potential', 'threats', 'introduced', 'by', 'app', 'communication', 'finally', 'we', 'discuss', 'state', 'of', 'art', 'researches', 'and', 'challenges', 'on', 'app', 'collusion', 'detection']]
|
[-0.19770954589172185, -0.03742506086785832, -0.029012193245327344, 0.059678724616431915, -0.1699308204241907, -0.33862168484610383, 0.14629943192172187, 0.38564840380264365, -0.1884962747015221, -0.3572514576169298, 0.14278030465989697, -0.3845769396638903, -0.19288060324691722, 0.21954578943499972, -0.19578651460545624, 0.13748568542929285, 0.060402593980340855, 0.01838439046000333, 0.043970881004655814, -0.38066666618586803, 0.3407892679046515, 0.03002452211069834, 0.3117440620376526, 0.1285835676396306, -0.016353193457926744, 0.018052670593454462, -0.08588547154289225, -0.10223267842894015, -0.08511775042659239, 0.13479896559400242, 0.4286969886161387, 0.2678892881680361, 0.4108091968962032, -0.4436204473123602, -0.15673059531052233, 0.07080245245774479, 0.14720791423409854, 0.10600601747738318, -0.12565904174018372, -0.4423039733108295, 0.16723018635378178, -0.3705799881692814, -0.051818321264126214, -0.10296292541897856, 0.05622986688420339, -0.01749045992619358, -0.1602618571613794, -0.09160272731526714, -0.036907983721112425, 0.1302999954483391, 0.043535751751219126, -0.04712188861120249, 0.033277350498120424, 0.20238855632234606, 0.13282310011740978, -0.09477927806564486, 0.27679819364161434, -0.17080810795406529, -0.2398148980092905, 0.2774516904483671, 0.0009768275542781971, -0.11352822269343407, 0.19945309568965572, 0.09154368631298775, -0.17751462667492096, 0.06828710101747318, 0.2681190673383358, 0.09489265889050844, -0.20830065608227058, 0.008979394809221443, 0.032821802047850644, 0.24042125157606992, 0.04345962629936959, 0.023509006431002333, 0.184301433932927, 0.22734544137885046, 0.08704716710971021, 0.11607701435707934, -0.08592975174542516, -0.03357434370959907, -0.1331963750297133, -0.18386856260274173, -0.09904355596265067, 0.02912738523572562, -0.007847872106535562, -0.11947918926876888, 0.39809628918200085, 0.3231248876950501, 0.02677263721884431, 0.0058217504195889214, 0.44427376707418537, -0.10851122595815231, 0.0997037771107305, 0.1725737937503373, 0.1494240191835991, -0.06969082303112373, 0.20249293972333166, -0.07836641566293269, 0.19362763579018696, -0.06661631879694102]
|
1,803.0504
|
Isogeometric Methods for Free Boundary Problems
|
We present in detail three different quasi-Newton isogeometric algorithms for
the treatment of free boundary problems. Two algorithms are based on standard
Galerkin formulations, while the third is a fully-collocated scheme. With
respect to standard approaches, isogeometric analysis enables the accurate
description of curved geometries, and is thus particularly suitable for free
boundary numerical simulation. We apply the algorithms and compare their
performances to several benchmark tests, considering both Dirichlet and
periodic boundary conditions. In this context, iogeometric collocation turns
out to be robust and computationally more efficient than Galerkin. Our results
constitute a starting point of an in-depth analysis of the Euler equations for
incompressible fluids.
|
math.NA
|
we present in detail three different quasinewton isogeometric algorithms for the treatment of free boundary problems two algorithms are based on standard galerkin formulations while the third is a fullycollocated scheme with respect to standard approaches isogeometric analysis enables the accurate description of curved geometries and is thus particularly suitable for free boundary numerical simulation we apply the algorithms and compare their performances to several benchmark tests considering both dirichlet and periodic boundary conditions in this context iogeometric collocation turns out to be robust and computationally more efficient than galerkin our results constitute a starting point of an indepth analysis of the euler equations for incompressible fluids
|
[['we', 'present', 'in', 'detail', 'three', 'different', 'quasinewton', 'isogeometric', 'algorithms', 'for', 'the', 'treatment', 'of', 'free', 'boundary', 'problems', 'two', 'algorithms', 'are', 'based', 'on', 'standard', 'galerkin', 'formulations', 'while', 'the', 'third', 'is', 'a', 'fullycollocated', 'scheme', 'with', 'respect', 'to', 'standard', 'approaches', 'isogeometric', 'analysis', 'enables', 'the', 'accurate', 'description', 'of', 'curved', 'geometries', 'and', 'is', 'thus', 'particularly', 'suitable', 'for', 'free', 'boundary', 'numerical', 'simulation', 'we', 'apply', 'the', 'algorithms', 'and', 'compare', 'their', 'performances', 'to', 'several', 'benchmark', 'tests', 'considering', 'both', 'dirichlet', 'and', 'periodic', 'boundary', 'conditions', 'in', 'this', 'context', 'iogeometric', 'collocation', 'turns', 'out', 'to', 'be', 'robust', 'and', 'computationally', 'more', 'efficient', 'than', 'galerkin', 'our', 'results', 'constitute', 'a', 'starting', 'point', 'of', 'an', 'indepth', 'analysis', 'of', 'the', 'euler', 'equations', 'for', 'incompressible', 'fluids']]
|
[-0.09389529637438024, -0.005335893737944952, -0.13137569033895574, 0.060099059144877606, -0.09389703442076487, -0.18054613383220774, -0.01889994502333658, 0.398416193539188, -0.2157416410611144, -0.2494576334914503, 0.15445382166432128, -0.2453326979319432, -0.10971116318943955, 0.26478008578221, -0.07415224946148338, 0.13070578880253292, 0.13035515409317755, -0.05060189340618395, -0.15704001871248086, -0.22081787859400112, 0.3121772387242388, 0.029314073827117683, 0.3015923643662106, 0.013526571213844277, 0.06579638859478845, -0.07583139630123263, -0.08298520081499149, 0.06052520191740422, -0.13396509840330553, 0.13248059136482576, 0.2653434930812745, 0.050716168251598165, 0.313887901825919, -0.4682185265634741, -0.22381152817535968, 0.06413187716777126, 0.14470214566127176, 0.10931258093166564, -0.03187479521328073, -0.2607771203720144, 0.09329603255859444, -0.11188533817684011, -0.1367186423213709, -0.14225793014324847, -0.059703923478012996, 0.009460140312910967, -0.32610258311476736, 0.08513307374946419, 0.01875449237191961, 0.06736432310371172, -0.10664417651881064, -0.14288006160807395, 0.04329082921723879, 0.0729564223926337, 0.03810585991457282, -0.04401981713738115, 0.05936127281969502, -0.08888839108736388, -0.11317888565716289, 0.4388956349165667, -0.021864337745882083, -0.3232510998933798, 0.24613112790864847, -0.03935686080228715, -0.1201304766127751, 0.12337504408011833, 0.17619488885005316, 0.21765305527618953, -0.15477400583082013, 0.07776119355334057, -0.007303385646082461, 0.11305066548603852, 0.041511511319272575, -0.051158528074267365, 0.115829850875196, 0.21176688211659592, 0.1064843680487857, 0.1346123732615351, -0.0620504255118292, -0.1724539435535137, -0.32549052325387795, -0.16254136893507426, -0.11817987080486048, -0.03399340868927538, -0.14537129704119814, -0.23190657087557373, 0.38896763949953655, 0.21125342700453031, 0.09146481103130749, 0.060793051017182215, 0.3307151175636266, 0.09825023996000666, -0.01993499284477106, 0.09477639116701625, 0.20888094094448856, 0.1386010202956164, 0.08535212032009093, -0.20281780644852135, -0.010588353956561714, 0.14710606618651323]
|
1,803.05041
|
Metal-Poor Type II Cepheids with Periods Less Than Three Days
|
We have analysed 10 high resolution spectra of Type II Cepheids with periods
less than 3 days. We find that they clearly separate into two groups: those
with near or slightly below solar metallicities, and those with [Fe/H] between
--1.5 and --2.0. While the former are usually called BL~Her stars, we suggest
that the latter be called UY~Eri stars. The UY~Eri subclass appears to be
similar to the short period variables in globular clusters of the Galactic
Halo. Globular clusters with [Fe/H] $\textgreater$ --1.0 almost never have Type
II Cepheids.
|
astro-ph.SR
|
we have analysed 10 high resolution spectra of type ii cepheids with periods less than 3 days we find that they clearly separate into two groups those with near or slightly below solar metallicities and those with feh between 15 and 20 while the former are usually called blher stars we suggest that the latter be called uyeri stars the uyeri subclass appears to be similar to the short period variables in globular clusters of the galactic halo globular clusters with feh textgreater 10 almost never have type ii cepheids
|
[['we', 'have', 'analysed', '10', 'high', 'resolution', 'spectra', 'of', 'type', 'ii', 'cepheids', 'with', 'periods', 'less', 'than', '3', 'days', 'we', 'find', 'that', 'they', 'clearly', 'separate', 'into', 'two', 'groups', 'those', 'with', 'near', 'or', 'slightly', 'below', 'solar', 'metallicities', 'and', 'those', 'with', 'feh', 'between', '15', 'and', '20', 'while', 'the', 'former', 'are', 'usually', 'called', 'blher', 'stars', 'we', 'suggest', 'that', 'the', 'latter', 'be', 'called', 'uyeri', 'stars', 'the', 'uyeri', 'subclass', 'appears', 'to', 'be', 'similar', 'to', 'the', 'short', 'period', 'variables', 'in', 'globular', 'clusters', 'of', 'the', 'galactic', 'halo', 'globular', 'clusters', 'with', 'feh', 'textgreater', '10', 'almost', 'never', 'have', 'type', 'ii', 'cepheids']]
|
[-0.03262594600754051, 0.19768392712937605, -0.0482502354672928, 0.10701546647543109, -0.08725306127841274, -0.12995658031311527, 0.07259984041467824, 0.4488649235545904, -0.1758027296598958, -0.39962591143089465, 0.03832515751830591, -0.316781037585106, -0.006572876160364898, 0.22418464453430612, -0.07965092491572616, -0.12728034786012923, 0.09430667597013687, -0.00036566648043520833, -0.048236173176174534, -0.31402410063678504, 0.27269855117286157, -0.02418783183969643, 0.12267040591901061, -0.14574928459144015, -0.01905910362457407, -0.1304212976434407, -0.017714489247695402, 0.026253162947451246, -0.13098257822978135, 0.023641978787932675, 0.24806564183498936, 0.10796059500533102, 0.2075131580222869, -0.34056512302258746, -0.17031037548407055, 0.0985024115873565, 0.24698071392124582, 0.026873820672753727, -0.03153467581382599, -0.23954856130374788, 0.15100151368606857, -0.149690761418221, -0.17191828809807014, 0.06641379939228291, 0.06765159336186347, 0.06476827993408252, -0.15416621995939947, 0.14656998023615572, 0.03762537060605212, 0.15747846515271172, -0.12433216382412175, -0.2003209675694334, -0.023247509718412298, 0.06207645124884258, 0.012359007807641193, 0.04557292812621628, 0.07687544931347172, -0.05658867436022252, -0.011766267350296778, 0.3959494373793232, -0.060926906248834255, -0.01717862694781145, 0.25862546248934176, -0.22072016110579515, -0.18972653826570202, 0.10257285182503448, 0.0942999061689466, 0.12923710712167466, -0.18331944782971993, -0.016880972098141652, 0.0221048840990654, 0.25138790532946587, 0.12195408807253871, 0.07429610886985714, 0.24961032171736353, 0.08437223920876953, 0.04888111370851168, 0.01077669762321159, -0.22583694637207122, -0.085723417377549, -0.19378666077130313, -0.09975883980206716, -0.029912156406147725, 0.08692852227852263, -0.15803697046886692, -0.12704924830428227, 0.31673960363085585, 0.049698567290886723, 0.23617968740926562, 0.08525035702676952, 0.21256343973265296, 0.09633618333355534, 0.18291538977816876, 0.16430902915696302, 0.3187422238975421, 0.15974526045223078, 0.0847990745865879, -0.16862058451120882, 0.06750686391224635, -0.005481593744379693]
|
1,803.05042
|
Controlled Islanding via Weak Submodularity
|
Cascading failures typically occur following a large disturbance in power
systems, such as tripping of a generating unit or a transmission line. Such
failures can propagate and destabilize the entire power system, potentially
leading to widespread outages. One approach to mitigate impending cascading
failures is through controlled islanding, in which a set of transmission lines
is deliberately tripped to partition the unstable system into several disjoint,
internally stable islands. Selecting such a set of transmission lines is
inherently a combinatorial optimization problem. Current approaches address
this problem in two steps: first classify coherent generators into groups and
then separate generator groups into different islands with minimal
load-generation imbalance. These methods, however, are based on computationally
expensive heuristics that do not provide optimality guarantees. In this paper,
we propose a novel approach to controlled islanding based on weak
submodularity. Our formulation jointly captures the minimal generator
non-coherency and minimal load-generation imbalance in one objective function.
We relax the problem to a formulation with bounded submodularity ratio and a
matroid constraint, and propose an approximation algorithm which achieves a
provable optimality bound on non-coherency and load-generation imbalance. The
proposed framework is tested on IEEE 39-bus and 118-bus power systems.
|
math.OC
|
cascading failures typically occur following a large disturbance in power systems such as tripping of a generating unit or a transmission line such failures can propagate and destabilize the entire power system potentially leading to widespread outages one approach to mitigate impending cascading failures is through controlled islanding in which a set of transmission lines is deliberately tripped to partition the unstable system into several disjoint internally stable islands selecting such a set of transmission lines is inherently a combinatorial optimization problem current approaches address this problem in two steps first classify coherent generators into groups and then separate generator groups into different islands with minimal loadgeneration imbalance these methods however are based on computationally expensive heuristics that do not provide optimality guarantees in this paper we propose a novel approach to controlled islanding based on weak submodularity our formulation jointly captures the minimal generator noncoherency and minimal loadgeneration imbalance in one objective function we relax the problem to a formulation with bounded submodularity ratio and a matroid constraint and propose an approximation algorithm which achieves a provable optimality bound on noncoherency and loadgeneration imbalance the proposed framework is tested on ieee 39bus and 118bus power systems
|
[['cascading', 'failures', 'typically', 'occur', 'following', 'a', 'large', 'disturbance', 'in', 'power', 'systems', 'such', 'as', 'tripping', 'of', 'a', 'generating', 'unit', 'or', 'a', 'transmission', 'line', 'such', 'failures', 'can', 'propagate', 'and', 'destabilize', 'the', 'entire', 'power', 'system', 'potentially', 'leading', 'to', 'widespread', 'outages', 'one', 'approach', 'to', 'mitigate', 'impending', 'cascading', 'failures', 'is', 'through', 'controlled', 'islanding', 'in', 'which', 'a', 'set', 'of', 'transmission', 'lines', 'is', 'deliberately', 'tripped', 'to', 'partition', 'the', 'unstable', 'system', 'into', 'several', 'disjoint', 'internally', 'stable', 'islands', 'selecting', 'such', 'a', 'set', 'of', 'transmission', 'lines', 'is', 'inherently', 'a', 'combinatorial', 'optimization', 'problem', 'current', 'approaches', 'address', 'this', 'problem', 'in', 'two', 'steps', 'first', 'classify', 'coherent', 'generators', 'into', 'groups', 'and', 'then', 'separate', 'generator', 'groups', 'into', 'different', 'islands', 'with', 'minimal', 'loadgeneration', 'imbalance', 'these', 'methods', 'however', 'are', 'based', 'on', 'computationally', 'expensive', 'heuristics', 'that', 'do', 'not', 'provide', 'optimality', 'guarantees', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'approach', 'to', 'controlled', 'islanding', 'based', 'on', 'weak', 'submodularity', 'our', 'formulation', 'jointly', 'captures', 'the', 'minimal', 'generator', 'noncoherency', 'and', 'minimal', 'loadgeneration', 'imbalance', 'in', 'one', 'objective', 'function', 'we', 'relax', 'the', 'problem', 'to', 'a', 'formulation', 'with', 'bounded', 'submodularity', 'ratio', 'and', 'a', 'matroid', 'constraint', 'and', 'propose', 'an', 'approximation', 'algorithm', 'which', 'achieves', 'a', 'provable', 'optimality', 'bound', 'on', 'noncoherency', 'and', 'loadgeneration', 'imbalance', 'the', 'proposed', 'framework', 'is', 'tested', 'on', 'ieee', '39bus', 'and', '118bus', 'power', 'systems']]
|
[-0.1823587244585491, 0.040621536066949675, -0.04760588480231281, 0.07318373080701208, -0.06866765145498972, -0.19470097859843802, 0.08601833474105941, 0.3616864272655967, -0.2890151885362008, -0.2903470736904404, 0.11045117504933538, -0.24958770503409397, -0.16849776782596915, 0.1569977412185369, -0.1296228253378127, 0.08385454563376231, 0.07478678915172052, -0.03498055935249282, -0.017802485227786328, -0.24550537132681943, 0.296798152404909, 0.03736136025773027, 0.3291162263554258, 0.04449059029635138, 0.11368838205205228, -0.007325137500018359, 0.02610107695636077, 0.0644832200033423, -0.07845542411822139, 0.11171939688531729, 0.25872966459809016, 0.18556262918580801, 0.3310864973287934, -0.4545453127951194, -0.1983126083102364, 0.13384743746704397, 0.14004689614804916, 0.07853009728834225, -0.027527374686607615, -0.23333874074980998, 0.11986140952302286, -0.18780195299201669, -0.047782695283874486, -0.06351574276072475, -0.04205293693484213, 0.014141636533447756, -0.3391689905896783, -0.0013753792175497765, 0.061818350166177906, 0.03947166883362792, -0.03232398538623387, -0.05564610697209644, 0.006650655019359711, 0.08903656450864406, 0.022465381050148073, -0.0055262040215520525, 0.13487734890136963, -0.06423370444144194, -0.15679476061023964, 0.36962257630836504, 0.0017527407321792383, -0.22452811966530786, 0.16772193108350994, -0.040681622234152226, -0.16113539590046574, 0.1534196589476405, 0.25035744563389856, 0.11824398301989557, -0.14426608809556526, 0.02570797711616764, -0.028034740146727133, 0.1726045466087854, 0.05685731359064961, 0.006588511638200054, 0.1846227316842534, 0.17827805794375495, 0.14311864845669614, 0.15588923028897111, -0.03858642933699183, -0.09434432393620507, -0.26545437815515566, -0.09677480670701091, -0.1651785184775527, 0.03155353800192153, -0.055919128008715166, -0.19643161394036351, 0.39791041447136266, 0.1638834412042529, 0.1950218342913267, 0.08566944978247659, 0.3782648236323626, 0.12130777258202076, 0.0575662545238932, 0.09849380903328077, 0.17486924139114143, 0.05942047922573506, 0.0474967544973016, -0.2015609221986662, 0.09207967444418523, 0.07990957279592598]
|
1,803.05043
|
Dynamics of Janus motors with microscopically reversible kinetics
|
Janus motors with chemically active and inactive hemispheres can operate only
under nonequilibrium conditions where detailed balance is broken by fluxes of
chemical species that establish a nonequilibrium state. A microscopic model for
reversible reactive collisions on a Janus motor surface is constructed and
shown to satisfy detailed balance. The model is used to study Janus particle
reactive dynamics in systems at equilibrium where generalized chemical rate
laws that include time-dependent rate coefficients with power-law behavior are
shown to describe reaction rates. While maintaining reversible reactions on the
Janus catalytic hemisphere, the system is then driven into a nonequilibrium
steady state by fluxes of chemical species that control the chemical affinity.
The statistical properties of the self-propelled Janus motor in this
nonequilibrium steady state are investigated and compared with predictions of a
fluctuating thermodynamics theory. The model has utility beyond the examples
presented here, since it allows one to explore various aspects of
nonequilibrium fluctuations in systems with self-diffusiophoretic motors from a
microscopic perspective.
|
cond-mat.soft
|
janus motors with chemically active and inactive hemispheres can operate only under nonequilibrium conditions where detailed balance is broken by fluxes of chemical species that establish a nonequilibrium state a microscopic model for reversible reactive collisions on a janus motor surface is constructed and shown to satisfy detailed balance the model is used to study janus particle reactive dynamics in systems at equilibrium where generalized chemical rate laws that include timedependent rate coefficients with powerlaw behavior are shown to describe reaction rates while maintaining reversible reactions on the janus catalytic hemisphere the system is then driven into a nonequilibrium steady state by fluxes of chemical species that control the chemical affinity the statistical properties of the selfpropelled janus motor in this nonequilibrium steady state are investigated and compared with predictions of a fluctuating thermodynamics theory the model has utility beyond the examples presented here since it allows one to explore various aspects of nonequilibrium fluctuations in systems with selfdiffusiophoretic motors from a microscopic perspective
|
[['janus', 'motors', 'with', 'chemically', 'active', 'and', 'inactive', 'hemispheres', 'can', 'operate', 'only', 'under', 'nonequilibrium', 'conditions', 'where', 'detailed', 'balance', 'is', 'broken', 'by', 'fluxes', 'of', 'chemical', 'species', 'that', 'establish', 'a', 'nonequilibrium', 'state', 'a', 'microscopic', 'model', 'for', 'reversible', 'reactive', 'collisions', 'on', 'a', 'janus', 'motor', 'surface', 'is', 'constructed', 'and', 'shown', 'to', 'satisfy', 'detailed', 'balance', 'the', 'model', 'is', 'used', 'to', 'study', 'janus', 'particle', 'reactive', 'dynamics', 'in', 'systems', 'at', 'equilibrium', 'where', 'generalized', 'chemical', 'rate', 'laws', 'that', 'include', 'timedependent', 'rate', 'coefficients', 'with', 'powerlaw', 'behavior', 'are', 'shown', 'to', 'describe', 'reaction', 'rates', 'while', 'maintaining', 'reversible', 'reactions', 'on', 'the', 'janus', 'catalytic', 'hemisphere', 'the', 'system', 'is', 'then', 'driven', 'into', 'a', 'nonequilibrium', 'steady', 'state', 'by', 'fluxes', 'of', 'chemical', 'species', 'that', 'control', 'the', 'chemical', 'affinity', 'the', 'statistical', 'properties', 'of', 'the', 'selfpropelled', 'janus', 'motor', 'in', 'this', 'nonequilibrium', 'steady', 'state', 'are', 'investigated', 'and', 'compared', 'with', 'predictions', 'of', 'a', 'fluctuating', 'thermodynamics', 'theory', 'the', 'model', 'has', 'utility', 'beyond', 'the', 'examples', 'presented', 'here', 'since', 'it', 'allows', 'one', 'to', 'explore', 'various', 'aspects', 'of', 'nonequilibrium', 'fluctuations', 'in', 'systems', 'with', 'selfdiffusiophoretic', 'motors', 'from', 'a', 'microscopic', 'perspective']]
|
[-0.09904188691729271, 0.1816904719396517, -0.09861282854239461, 0.021340277828929218, 0.02775615587455743, -0.1929633478895284, 0.05201666692496141, 0.342263873496161, -0.25394204361704975, -0.2839108179493739, -0.003247812870895581, -0.26360689503825396, -0.12450926150933544, 0.1734731029484864, -0.010773478214992437, 0.05877258348926084, 0.03283664143485267, -0.005141146238268603, 0.025240017228231697, -0.14309117070785382, 0.2429498232526296, 0.06235988809735651, 0.29992219794075936, 0.03819454329978481, 0.13891465556396104, -0.07777136044219, 0.04246072668196043, 0.04092216552462338, -0.1862569786259949, 0.05717181591136046, 0.20456467237232662, 0.03218785470646874, 0.19303067025115214, -0.504249341944914, -0.27682965118210856, 0.08737896130386195, 0.11905633125570603, 0.13422049778916806, -0.08374380676726038, -0.21705771159954232, 0.026696667344899984, -0.1684933574330743, -0.1370709935975511, -0.11610045131131234, 0.03378277352624914, 0.10129664727542038, -0.2369135884658956, 0.09463742147370173, 0.046770779647376026, 0.09844606419565247, -0.09735440078408673, -0.07900863660076383, -0.11443576658579022, 0.13231157297949966, 0.03987887278007537, -0.025839338691517562, 0.2912807231314662, -0.14396998528944804, -0.10060019699413693, 0.39687013594581316, -0.033789995681528545, -0.2262521351108373, 0.28406620075324235, -0.13566347645459378, -0.16202016933764354, 0.16008698931191026, 0.17114122358162137, 0.12201055251459432, -0.2718573192066354, 0.050336791583260224, 0.007328244900081034, 0.1584349408541329, 0.005544281273614615, -0.03865123426800071, 0.2332891930894154, 0.202347277527357, 0.0542509815564788, 0.16727733983737758, -0.019817167112217624, -0.2277994989758221, -0.24714116291029425, -0.1371441712012378, -0.14362917320303073, 0.0787556804759178, -0.023979983632981625, -0.11023444617727897, 0.35880586762753564, 0.10709350484014465, 0.1467228468320128, 0.04185389768241382, 0.2510686251391634, 0.08330167849866174, -0.00438874171728768, 0.04746953205052173, 0.24743416570922042, 0.14541367482374104, 0.15157199346761377, -0.30392151451052063, 0.1109060773818694, 0.08375468406621821]
|
1,803.05044
|
Learning to Explore with Meta-Policy Gradient
|
The performance of off-policy learning, including deep Q-learning and deep
deterministic policy gradient (DDPG), critically depends on the choice of the
exploration policy. Existing exploration methods are mostly based on adding
noise to the on-going actor policy and can only explore \emph{local} regions
close to what the actor policy dictates. In this work, we develop a simple
meta-policy gradient algorithm that allows us to adaptively learn the
exploration policy in DDPG. Our algorithm allows us to train flexible
exploration behaviors that are independent of the actor policy, yielding a
\emph{global exploration} that significantly speeds up the learning process.
With an extensive study, we show that our method significantly improves the
sample-efficiency of DDPG on a variety of reinforcement learning tasks.
|
cs.LG cs.AI
|
the performance of offpolicy learning including deep qlearning and deep deterministic policy gradient ddpg critically depends on the choice of the exploration policy existing exploration methods are mostly based on adding noise to the ongoing actor policy and can only explore emphlocal regions close to what the actor policy dictates in this work we develop a simple metapolicy gradient algorithm that allows us to adaptively learn the exploration policy in ddpg our algorithm allows us to train flexible exploration behaviors that are independent of the actor policy yielding a emphglobal exploration that significantly speeds up the learning process with an extensive study we show that our method significantly improves the sampleefficiency of ddpg on a variety of reinforcement learning tasks
|
[['the', 'performance', 'of', 'offpolicy', 'learning', 'including', 'deep', 'qlearning', 'and', 'deep', 'deterministic', 'policy', 'gradient', 'ddpg', 'critically', 'depends', 'on', 'the', 'choice', 'of', 'the', 'exploration', 'policy', 'existing', 'exploration', 'methods', 'are', 'mostly', 'based', 'on', 'adding', 'noise', 'to', 'the', 'ongoing', 'actor', 'policy', 'and', 'can', 'only', 'explore', 'emphlocal', 'regions', 'close', 'to', 'what', 'the', 'actor', 'policy', 'dictates', 'in', 'this', 'work', 'we', 'develop', 'a', 'simple', 'metapolicy', 'gradient', 'algorithm', 'that', 'allows', 'us', 'to', 'adaptively', 'learn', 'the', 'exploration', 'policy', 'in', 'ddpg', 'our', 'algorithm', 'allows', 'us', 'to', 'train', 'flexible', 'exploration', 'behaviors', 'that', 'are', 'independent', 'of', 'the', 'actor', 'policy', 'yielding', 'a', 'emphglobal', 'exploration', 'that', 'significantly', 'speeds', 'up', 'the', 'learning', 'process', 'with', 'an', 'extensive', 'study', 'we', 'show', 'that', 'our', 'method', 'significantly', 'improves', 'the', 'sampleefficiency', 'of', 'ddpg', 'on', 'a', 'variety', 'of', 'reinforcement', 'learning', 'tasks']]
|
[-0.027259797897810738, 0.012110403332553688, -0.15744228491093964, 0.028370390496350713, -0.18929813095989326, -0.16471272696508094, 0.14224031808941315, 0.5043751907534897, -0.2917865411650079, -0.32112500690855084, 0.060905271782151736, -0.18454932845609923, -0.21365303808512787, 0.20289664389565587, -0.15487794776757557, 0.05343258690554649, 0.10712878531776368, 0.02417836652700013, -0.050618969524900116, -0.27598322298629985, 0.2858626288633483, 0.07802269003538337, 0.34005738667134816, -0.02641014939484497, 0.16359028302443523, -0.0026681105800283452, -0.016974385625993214, -0.018971104647304553, -0.1143953109094582, 0.1716535113499655, 0.28408024930395187, 0.24002833219171105, 0.3875388119214525, -0.3744277987939616, -0.197219345284005, 0.11669704609084874, 0.1380496963315333, 0.09397910610617449, -0.025780375679945185, -0.3212675961510589, 0.04487096365094961, -0.1784946541612347, -0.0002427853517777597, -0.19170138040402282, -0.07955082978781623, 0.020012287568533793, -0.34672631975263357, -0.04446009227540344, 0.0873128497468618, -0.004758354625664651, -0.04580809296361015, -0.12117046116618439, 0.05598819200337554, 0.14150189641707886, 0.0597947680776997, 0.09533649083265724, 0.2273588824008281, -0.16995422535304291, -0.17483539952275653, 0.28562778919076665, -0.06298434236086906, -0.16667566417406002, 0.23221406415298892, -0.01926489205410083, -0.14476076507320007, 0.10347700793451318, 0.2712406199503069, 0.16509156067622827, -0.11648272188225141, 0.054959484347879575, -0.03682981707340029, 0.15175263551451887, -0.0218243264593184, -0.044610674670548175, 0.08900021563943786, 0.26371030069421975, 0.15815121073586244, 0.12300847801507189, -0.06664398699261559, -0.18796268733373533, -0.19808621078846045, -0.1077933173549051, -0.13648450472586168, -0.02192628601139101, -0.14889723806772964, -0.12855580421322277, 0.38400718363312386, 0.27991000898570445, 0.1988711319223512, 0.1571910763081784, 0.3459805390719945, 0.0489971042086836, 0.08461299352153825, 0.18113157514793177, 0.24653600654564797, -0.021947646342838804, 0.14514701920173442, -0.27637917067234713, 0.16364984729249651, 0.05665401971782558]
|
1,803.05045
|
Analysis of Nonautonomous Adversarial Systems
|
Generative adversarial networks are used to generate images but still their
convergence properties are not well understood. There have been a few studies
who intended to investigate the stability properties of GANs as a dynamical
system. This short writing can be seen in that direction. Among the proposed
methods for stabilizing training of GANs, {\ss}-GAN was the first who proposed
a complete annealing strategy to change high-level conditions of the GAN
objective. In this note, we show by a simple example how annealing strategy
works in GANs. The theoretical analysis is supported by simple simulations.
|
stat.ML cs.LG
|
generative adversarial networks are used to generate images but still their convergence properties are not well understood there have been a few studies who intended to investigate the stability properties of gans as a dynamical system this short writing can be seen in that direction among the proposed methods for stabilizing training of gans ssgan was the first who proposed a complete annealing strategy to change highlevel conditions of the gan objective in this note we show by a simple example how annealing strategy works in gans the theoretical analysis is supported by simple simulations
|
[['generative', 'adversarial', 'networks', 'are', 'used', 'to', 'generate', 'images', 'but', 'still', 'their', 'convergence', 'properties', 'are', 'not', 'well', 'understood', 'there', 'have', 'been', 'a', 'few', 'studies', 'who', 'intended', 'to', 'investigate', 'the', 'stability', 'properties', 'of', 'gans', 'as', 'a', 'dynamical', 'system', 'this', 'short', 'writing', 'can', 'be', 'seen', 'in', 'that', 'direction', 'among', 'the', 'proposed', 'methods', 'for', 'stabilizing', 'training', 'of', 'gans', 'ssgan', 'was', 'the', 'first', 'who', 'proposed', 'a', 'complete', 'annealing', 'strategy', 'to', 'change', 'highlevel', 'conditions', 'of', 'the', 'gan', 'objective', 'in', 'this', 'note', 'we', 'show', 'by', 'a', 'simple', 'example', 'how', 'annealing', 'strategy', 'works', 'in', 'gans', 'the', 'theoretical', 'analysis', 'is', 'supported', 'by', 'simple', 'simulations']]
|
[-0.05233770294948236, 0.03198228112765049, -0.1418373572395036, 0.12392778779306499, -0.07549376339455577, -0.15086123359659195, 0.02048113029695263, 0.5089257490478064, -0.2513428268856124, -0.32537797491409276, 0.07787675989522158, -0.21212142642195286, -0.2301041373492856, 0.18111191995282608, -0.16176096137220922, 0.08666325627188934, 0.0929997170736131, -0.010671846779357445, -0.0450701147048293, -0.3366366730904893, 0.25411032583368454, 0.07545957656479195, 0.29640742941318377, 0.009261396693948067, 0.06245418371216051, -0.07670796599674137, 0.03802391850438557, 0.04436410137109066, -0.11443420266035613, 0.10338052140830672, 0.29550325378383463, 0.1729749036242107, 0.36146604817262606, -0.4435404760861083, -0.2580934829715835, 0.0934351702171721, 0.1179878657879798, 0.14654427694254799, -0.12419839485695487, -0.28591755141357056, 0.13529519826958053, -0.13466100976067155, -0.059207034405124814, -0.14239574830586973, -0.056547622001533834, 0.03273958647562387, -0.2620470132727764, 0.0017068896736753614, 0.12625392782716324, 0.07747181702013078, -0.03769727364721659, -0.08385275736524675, -0.023298961750084633, 0.14844187213058926, 0.06395067854686395, 0.02879000785025327, 0.10433738105685303, -0.12146509472268487, -0.15311493294215517, 0.3453037289804534, -0.044517289861840635, -0.18724242278258316, 0.1972799524762913, -0.05214100952603315, -0.13846517667468441, 0.09789374289347937, 0.17935619366502292, 0.18340213657601884, -0.20363260596794516, 0.020259111158941922, -0.0416418522584105, 0.1370661383102599, 0.036218024947141346, -0.005952253741653342, 0.15904935329760375, 0.21814431631447453, 0.024492590876884365, 0.1422155398373051, -0.02117414368610633, -0.08370557247514003, -0.23809527002618108, -0.09298665622543348, -0.22556490245226182, 0.06442508266298223, 0.017660596088114145, -0.13293276432117349, 0.4104151051883635, 0.19206959969903292, 0.2013917281243362, 0.056090598416171575, 0.3194091880203862, 0.05255600229322322, 0.0883754180523714, 0.07556162311842567, 0.249264819076971, 0.08961180835276057, 0.1257470045630869, -0.16268196205461496, 0.14114881974988078, 0.030903087181382273]
|
1,803.05046
|
Caveat Emptor, Computational Social Science: Large-Scale Missing Data in
a Widely-Published Reddit Corpus
|
As researchers use computational methods to study complex social behaviors at
scale, the validity of this computational social science depends on the
integrity of the data. On July 2, 2015, Jason Baumgartner published a dataset
advertised to include ``every publicly available Reddit comment'' which was
quickly shared on Bittorrent and the Internet Archive. This data quickly became
the basis of many academic papers on topics including machine learning, social
behavior, politics, breaking news, and hate speech. We have discovered
substantial gaps and limitations in this dataset which may contribute to bias
in the findings of that research. In this paper, we document the dataset,
substantial missing observations in the dataset, and the risks to research
validity from those gaps. In summary, we identify strong risks to research that
considers user histories or network analysis, moderate risks to research that
compares counts of participation, and lesser risk to machine learning research
that avoids making representative claims about behavior and participation on
Reddit.
|
cs.SI
|
as researchers use computational methods to study complex social behaviors at scale the validity of this computational social science depends on the integrity of the data on july 2 2015 jason baumgartner published a dataset advertised to include every publicly available reddit comment which was quickly shared on bittorrent and the internet archive this data quickly became the basis of many academic papers on topics including machine learning social behavior politics breaking news and hate speech we have discovered substantial gaps and limitations in this dataset which may contribute to bias in the findings of that research in this paper we document the dataset substantial missing observations in the dataset and the risks to research validity from those gaps in summary we identify strong risks to research that considers user histories or network analysis moderate risks to research that compares counts of participation and lesser risk to machine learning research that avoids making representative claims about behavior and participation on reddit
|
[['as', 'researchers', 'use', 'computational', 'methods', 'to', 'study', 'complex', 'social', 'behaviors', 'at', 'scale', 'the', 'validity', 'of', 'this', 'computational', 'social', 'science', 'depends', 'on', 'the', 'integrity', 'of', 'the', 'data', 'on', 'july', '2', '2015', 'jason', 'baumgartner', 'published', 'a', 'dataset', 'advertised', 'to', 'include', 'every', 'publicly', 'available', 'reddit', 'comment', 'which', 'was', 'quickly', 'shared', 'on', 'bittorrent', 'and', 'the', 'internet', 'archive', 'this', 'data', 'quickly', 'became', 'the', 'basis', 'of', 'many', 'academic', 'papers', 'on', 'topics', 'including', 'machine', 'learning', 'social', 'behavior', 'politics', 'breaking', 'news', 'and', 'hate', 'speech', 'we', 'have', 'discovered', 'substantial', 'gaps', 'and', 'limitations', 'in', 'this', 'dataset', 'which', 'may', 'contribute', 'to', 'bias', 'in', 'the', 'findings', 'of', 'that', 'research', 'in', 'this', 'paper', 'we', 'document', 'the', 'dataset', 'substantial', 'missing', 'observations', 'in', 'the', 'dataset', 'and', 'the', 'risks', 'to', 'research', 'validity', 'from', 'those', 'gaps', 'in', 'summary', 'we', 'identify', 'strong', 'risks', 'to', 'research', 'that', 'considers', 'user', 'histories', 'or', 'network', 'analysis', 'moderate', 'risks', 'to', 'research', 'that', 'compares', 'counts', 'of', 'participation', 'and', 'lesser', 'risk', 'to', 'machine', 'learning', 'research', 'that', 'avoids', 'making', 'representative', 'claims', 'about', 'behavior', 'and', 'participation', 'on', 'reddit']]
|
[-0.07709747912240741, 0.018452251846294686, -0.0585783048625457, 0.09422806924590783, -0.18946204373254355, -0.11561818955240552, 0.09322466737206053, 0.3928380744265659, -0.2133668185738118, -0.37419948489614907, 0.10592659805418334, -0.38982481657533175, -0.15691278968150987, 0.19979909778665172, -0.142939865571788, 0.005757253564986753, 0.12244015869898547, 0.001306511641057752, 0.004510910180831177, -0.3628606772381431, 0.3011333266481387, 0.09922712909994844, 0.37913520007122375, 0.1175282356468093, 0.009502437979457264, -0.022767717709261576, -0.11606329811956756, -0.03634301989602492, -0.1254477984865228, 0.17124908132281919, 0.36853194427069114, 0.2641432003598221, 0.4098774510991083, -0.381419848583267, -0.17778559193674545, 0.07128877895855293, 0.12083476209746939, 0.07521732295979022, -0.020618296639779755, -0.35140648895226745, 0.03208121362283988, -0.2194559635270549, -0.050365662092331405, -0.09016592835324892, 0.04338320542664863, -0.0053455811872447825, -0.181503977710439, 0.05793894606682917, 0.008874083021713525, 0.1635121181867554, -0.012545336700212326, -0.13011851470905894, 0.008670518316490494, 0.17767419673427245, 0.16542709890213617, -0.0004780957307550848, 0.1657963859156694, -0.1804337219526031, -0.1566332933602866, 0.3530578604893562, -0.017238874322451327, -0.07788840118471695, 0.2042586169936275, -0.08346695988294409, -0.22089457836707835, 0.050331533441980957, 0.29079439801378004, 0.01982630934184475, -0.17566326087028344, 0.01528439327845963, -0.05620427228371549, 0.19331382354142965, 0.04915959695759027, -0.028188896431986774, 0.16196030968661357, 0.1945978724426642, 0.009806593985264971, 0.09181931639605011, -0.05183760982486911, -0.09417739051816441, -0.21115766855836007, -0.1082510740484649, -0.1734031860757133, 0.018355145537791925, -0.0411282653816591, -0.1404753723254092, 0.40800213447905015, 0.24997310881338064, 0.13081376596139918, 0.0244807091661619, 0.27920668236969143, -0.05305425013106039, 0.10983795506347503, 0.09743090314929437, 0.16549375623295384, -0.021865627711048777, 0.20580710911753108, -0.14081810576615636, 0.11592573608287686, -0.041897608556745645]
|
1,803.05047
|
Canonical forms for single-qutrit Clifford+T operators
|
We introduce canonical forms for single qutrit Clifford+T circuits and prove
that every single-qutrit Clifford+T operator admits a unique such canonical
form. We show that our canonical forms are T-optimal in the sense that among
all the single-qutrit Clifford+T circuits implementing a given operator our
canonical form uses the least number of T gates. Finally, we provide an
algorithm which inputs the description of an operator (as a matrix or a
circuit) and constructs the canonical form for this operator. The algorithm
runs in time linear in the number of T gates. Our results provide a
higher-dimensional generalization of prior work by Matsumoto and Amano who
introduced similar canonical forms for single-qubit Clifford+T circuits.
|
quant-ph
|
we introduce canonical forms for single qutrit cliffordt circuits and prove that every singlequtrit cliffordt operator admits a unique such canonical form we show that our canonical forms are toptimal in the sense that among all the singlequtrit cliffordt circuits implementing a given operator our canonical form uses the least number of t gates finally we provide an algorithm which inputs the description of an operator as a matrix or a circuit and constructs the canonical form for this operator the algorithm runs in time linear in the number of t gates our results provide a higherdimensional generalization of prior work by matsumoto and amano who introduced similar canonical forms for singlequbit cliffordt circuits
|
[['we', 'introduce', 'canonical', 'forms', 'for', 'single', 'qutrit', 'cliffordt', 'circuits', 'and', 'prove', 'that', 'every', 'singlequtrit', 'cliffordt', 'operator', 'admits', 'a', 'unique', 'such', 'canonical', 'form', 'we', 'show', 'that', 'our', 'canonical', 'forms', 'are', 'toptimal', 'in', 'the', 'sense', 'that', 'among', 'all', 'the', 'singlequtrit', 'cliffordt', 'circuits', 'implementing', 'a', 'given', 'operator', 'our', 'canonical', 'form', 'uses', 'the', 'least', 'number', 'of', 't', 'gates', 'finally', 'we', 'provide', 'an', 'algorithm', 'which', 'inputs', 'the', 'description', 'of', 'an', 'operator', 'as', 'a', 'matrix', 'or', 'a', 'circuit', 'and', 'constructs', 'the', 'canonical', 'form', 'for', 'this', 'operator', 'the', 'algorithm', 'runs', 'in', 'time', 'linear', 'in', 'the', 'number', 'of', 't', 'gates', 'our', 'results', 'provide', 'a', 'higherdimensional', 'generalization', 'of', 'prior', 'work', 'by', 'matsumoto', 'and', 'amano', 'who', 'introduced', 'similar', 'canonical', 'forms', 'for', 'singlequbit', 'cliffordt', 'circuits']]
|
[-0.14775327354538859, 0.08649738098463051, -0.06329481274281677, 0.026269700348565125, -0.021928833817997782, -0.1818807086654073, 0.05510787902759355, 0.33362849857331367, -0.23724874360650255, -0.26238398180392225, 0.010746220458123278, -0.243555304496304, -0.21559746551384593, 0.24762159141327925, -0.06670060474221316, 0.08216872955917527, 0.07086587387030911, 0.06781472933627747, -0.12946513355832154, -0.27195253599590313, 0.3000158306636047, -0.0015516171738374652, 0.1847971599309587, -0.04617224190498523, 0.15992002863040716, 0.018510799810061592, 0.03864579573845524, -0.017778263443656135, -0.08518073894791948, 0.09649229412204013, 0.27650024738007534, 0.19852280347779588, 0.2622202000695101, -0.4563847810074405, -0.1150663984988473, 0.14107282214650982, 0.06607959056763273, 0.11487254682670985, -0.05506932150302945, -0.22957453380028406, 0.07047362049164357, -0.1624253757150942, -0.08010841996956355, -0.14893704519827702, 0.03198308701496245, -0.04106174090779141, -0.30173400555443214, -0.016256442293524742, 0.17618224173457475, 0.04345184322837189, 0.0007935558249683757, -0.11876978065712344, 0.019264290221607347, 0.07143946644531465, -0.1480182960972582, 0.038798160875510225, 0.11420284204436221, -0.057521330658346415, -0.19814356237654002, 0.3022031568056136, -0.051903786556897355, -0.2322445919230711, 0.06983179440966954, -0.07686207652614828, -0.16159107978251486, 0.01674733923854339, 0.07241087838223106, 0.13645538443438054, -0.1383014727269479, 0.15247289008683557, -0.11559298733380019, 0.1729542741699046, 0.08614777459501567, 0.06114958595941987, 0.09284017356357684, 0.09933244420640301, 0.09438013999820932, 0.1742228607161036, 0.05014310117908999, -0.09008478957816567, -0.3796865460217783, -0.24442676128206872, -0.15361695587655463, 0.10893181317665598, -0.09760528918636019, -0.20482889327563739, 0.4109831239493041, 0.09442242919549085, 0.20202568063375606, 0.1431663220823873, 0.27558216726480933, 0.13718568797329472, 0.10540821102627537, 0.14197229473900638, 0.12216386337061985, 0.1810224020441079, -0.0024449583224690798, -0.201024953084957, 0.01815050305275802, 0.13309417329238435]
|
1,803.05048
|
On the pros and cons of using temporal derivatives to assess brain
functional connectivity
|
The study of correlations between brain regions is an important chapter of
the analysis of large-scale brain spatiotemporal dynamics. In particular, novel
methods suited to extract dynamic changes in mutual correlations are needed.
Here we scrutinize a recently reported metric dubbed "Multiplication of
Temporal Derivatives" (MTD) which is based on the temporal derivative of each
time series. The formal comparison of the MTD formula with the Pearson
correlation of the derivatives reveals only minor differences, which we find
negligible in practice. A comparison with the sliding window Pearson
correlation of the raw time series in several stationary and non-stationary
set-ups, including a realistic stationary network detection, reveals lower
sensitivity of derivatives to low frequency drifts and to autocorrelations but
also lower signal-to-noise ratio. It does not indicate any evident mathematical
advantages of the proposed metric over commonly used correlation methods.
|
q-bio.NC
|
the study of correlations between brain regions is an important chapter of the analysis of largescale brain spatiotemporal dynamics in particular novel methods suited to extract dynamic changes in mutual correlations are needed here we scrutinize a recently reported metric dubbed multiplication of temporal derivatives mtd which is based on the temporal derivative of each time series the formal comparison of the mtd formula with the pearson correlation of the derivatives reveals only minor differences which we find negligible in practice a comparison with the sliding window pearson correlation of the raw time series in several stationary and nonstationary setups including a realistic stationary network detection reveals lower sensitivity of derivatives to low frequency drifts and to autocorrelations but also lower signaltonoise ratio it does not indicate any evident mathematical advantages of the proposed metric over commonly used correlation methods
|
[['the', 'study', 'of', 'correlations', 'between', 'brain', 'regions', 'is', 'an', 'important', 'chapter', 'of', 'the', 'analysis', 'of', 'largescale', 'brain', 'spatiotemporal', 'dynamics', 'in', 'particular', 'novel', 'methods', 'suited', 'to', 'extract', 'dynamic', 'changes', 'in', 'mutual', 'correlations', 'are', 'needed', 'here', 'we', 'scrutinize', 'a', 'recently', 'reported', 'metric', 'dubbed', 'multiplication', 'of', 'temporal', 'derivatives', 'mtd', 'which', 'is', 'based', 'on', 'the', 'temporal', 'derivative', 'of', 'each', 'time', 'series', 'the', 'formal', 'comparison', 'of', 'the', 'mtd', 'formula', 'with', 'the', 'pearson', 'correlation', 'of', 'the', 'derivatives', 'reveals', 'only', 'minor', 'differences', 'which', 'we', 'find', 'negligible', 'in', 'practice', 'a', 'comparison', 'with', 'the', 'sliding', 'window', 'pearson', 'correlation', 'of', 'the', 'raw', 'time', 'series', 'in', 'several', 'stationary', 'and', 'nonstationary', 'setups', 'including', 'a', 'realistic', 'stationary', 'network', 'detection', 'reveals', 'lower', 'sensitivity', 'of', 'derivatives', 'to', 'low', 'frequency', 'drifts', 'and', 'to', 'autocorrelations', 'but', 'also', 'lower', 'signaltonoise', 'ratio', 'it', 'does', 'not', 'indicate', 'any', 'evident', 'mathematical', 'advantages', 'of', 'the', 'proposed', 'metric', 'over', 'commonly', 'used', 'correlation', 'methods']]
|
[-0.115081117360387, 0.03506678931641675, -0.10821449234665903, 0.11737675462417038, -0.05476436215353065, -0.11642387999288206, -0.005561692716686853, 0.3932963195190366, -0.2379628881778834, -0.2979623025017125, 0.08541040800711407, -0.26398501430386595, -0.19748020480786052, 0.17859564889721305, -0.0418038947856985, 0.07805844829916687, 0.025604489217844924, 0.05147345261315682, -0.12513257186593754, -0.20783289829352206, 0.27072147528940277, 0.09219766778405755, 0.3386429393431172, 0.03591988037140774, 0.11821729416842572, -0.00923084973972956, -0.11364076962927357, 0.03658504068901363, -0.10254088118339756, 0.10062389511778227, 0.25346058109509095, 0.10928226447597678, 0.3003842480081533, -0.40427663906344347, -0.2285202981970672, 0.10520256619035666, 0.12035503751498514, 0.05712710555609582, -0.0143000021502043, -0.27715633596027534, 0.034341009112540635, -0.14536455473280513, -0.05675149244655456, -0.10673111148976853, 0.04918409033811518, 0.03912274272879586, -0.2816569851478562, 0.14525923475718758, 0.031242617425907934, 0.07851924626821918, -0.037448388825370264, -0.1064317421621776, 0.01270228006261667, 0.13791240452722248, 0.06105775757293616, -0.002398859618032085, 0.10491116169640528, -0.09440453780948051, -0.11588953701055808, 0.338248487295849, -0.09205471966083029, -0.1890775077244533, 0.1964506053914582, -0.19404495669129704, -0.15425512901440794, 0.13414903837655012, 0.17298660429660231, 0.12247484963653343, -0.15352431675751826, 0.004677001787058543, 0.03477612882852554, 0.22416730473882385, 0.06881846221097346, 0.07028387881915218, 0.16377413512340613, 0.16637359508146932, 0.05371399177404653, 0.1304579570623381, -0.15066000342069727, -0.12395831140955645, -0.2786326375058187, -0.14270733308845332, -0.18083352409885264, -0.02485268160557358, -0.13656483498281366, -0.18576353860553355, 0.4271332937093186, 0.1677179722913674, 0.1754872913488985, 0.0722116435994394, 0.3119359854475728, 0.11942889839078166, 0.0744007598209594, 0.041274440277889624, 0.21500285595123256, 0.11471212549534227, 0.12240823500573501, -0.20995412129954535, 0.132140776974016, 0.012029398611879774]
|
1,803.05049
|
Fractal AI: A fragile theory of intelligence
|
Fractal AI is a theory for general artificial intelligence. It allows
deriving new mathematical tools that constitute the foundations for a new kind
of stochastic calculus, by modelling information using cellular automaton-like
structures instead of smooth functions. In the repository included we are
presenting a new Agent, derived from the first principles of the theory, which
is capable of solving Atari games several orders of magnitude more efficiently
than other similar techniques, like Monte Carlo Tree Search. The code provided
shows how it is now possible to beat some of the current State of The Art
benchmarks on Atari games, without previous learning and using less than 1000
samples to calculate each one of the actions when standard MCTS uses 3 Million
samples. Among other things, Fractal AI makes it possible to generate a huge
database of top performing examples with a very little amount of computation
required, transforming Reinforcement Learning into a supervised problem. The
algorithm presented is capable of solving the exploration vs exploitation
dilemma on both the discrete and continuous cases, while maintaining control
over any aspect of the behaviour of the Agent. From a general approach, new
techniques presented here have direct applications to other areas such as
Non-equilibrium thermodynamics, chemistry, quantum physics, economics,
information theory, and non-linear control theory.
|
cs.AI
|
fractal ai is a theory for general artificial intelligence it allows deriving new mathematical tools that constitute the foundations for a new kind of stochastic calculus by modelling information using cellular automatonlike structures instead of smooth functions in the repository included we are presenting a new agent derived from the first principles of the theory which is capable of solving atari games several orders of magnitude more efficiently than other similar techniques like monte carlo tree search the code provided shows how it is now possible to beat some of the current state of the art benchmarks on atari games without previous learning and using less than 1000 samples to calculate each one of the actions when standard mcts uses 3 million samples among other things fractal ai makes it possible to generate a huge database of top performing examples with a very little amount of computation required transforming reinforcement learning into a supervised problem the algorithm presented is capable of solving the exploration vs exploitation dilemma on both the discrete and continuous cases while maintaining control over any aspect of the behaviour of the agent from a general approach new techniques presented here have direct applications to other areas such as nonequilibrium thermodynamics chemistry quantum physics economics information theory and nonlinear control theory
|
[['fractal', 'ai', 'is', 'a', 'theory', 'for', 'general', 'artificial', 'intelligence', 'it', 'allows', 'deriving', 'new', 'mathematical', 'tools', 'that', 'constitute', 'the', 'foundations', 'for', 'a', 'new', 'kind', 'of', 'stochastic', 'calculus', 'by', 'modelling', 'information', 'using', 'cellular', 'automatonlike', 'structures', 'instead', 'of', 'smooth', 'functions', 'in', 'the', 'repository', 'included', 'we', 'are', 'presenting', 'a', 'new', 'agent', 'derived', 'from', 'the', 'first', 'principles', 'of', 'the', 'theory', 'which', 'is', 'capable', 'of', 'solving', 'atari', 'games', 'several', 'orders', 'of', 'magnitude', 'more', 'efficiently', 'than', 'other', 'similar', 'techniques', 'like', 'monte', 'carlo', 'tree', 'search', 'the', 'code', 'provided', 'shows', 'how', 'it', 'is', 'now', 'possible', 'to', 'beat', 'some', 'of', 'the', 'current', 'state', 'of', 'the', 'art', 'benchmarks', 'on', 'atari', 'games', 'without', 'previous', 'learning', 'and', 'using', 'less', 'than', '1000', 'samples', 'to', 'calculate', 'each', 'one', 'of', 'the', 'actions', 'when', 'standard', 'mcts', 'uses', '3', 'million', 'samples', 'among', 'other', 'things', 'fractal', 'ai', 'makes', 'it', 'possible', 'to', 'generate', 'a', 'huge', 'database', 'of', 'top', 'performing', 'examples', 'with', 'a', 'very', 'little', 'amount', 'of', 'computation', 'required', 'transforming', 'reinforcement', 'learning', 'into', 'a', 'supervised', 'problem', 'the', 'algorithm', 'presented', 'is', 'capable', 'of', 'solving', 'the', 'exploration', 'vs', 'exploitation', 'dilemma', 'on', 'both', 'the', 'discrete', 'and', 'continuous', 'cases', 'while', 'maintaining', 'control', 'over', 'any', 'aspect', 'of', 'the', 'behaviour', 'of', 'the', 'agent', 'from', 'a', 'general', 'approach', 'new', 'techniques', 'presented', 'here', 'have', 'direct', 'applications', 'to', 'other', 'areas', 'such', 'as', 'nonequilibrium', 'thermodynamics', 'chemistry', 'quantum', 'physics', 'economics', 'information', 'theory', 'and', 'nonlinear', 'control', 'theory']]
|
[-0.02869788541460723, 0.06186613232271624, -0.09844540138881236, 0.09439438544148492, -0.11215083156581794, -0.17714861748418032, 0.06607495325021272, 0.3517884742599155, -0.29264038842319395, -0.35174444635511837, 0.09251235534271626, -0.27950906939267356, -0.1684666141980789, 0.2599404862827282, -0.054055112494437556, 0.06475722209972581, 0.07048644742680382, 0.02713791575831161, -0.031301940713517336, -0.25908058670362477, 0.28749010321209817, 0.020288203495595968, 0.2702295932783876, -0.014396495063937156, 0.11409573502142023, 0.014533388736292232, -0.05227792300784386, 0.022555625664073174, -0.09646290005854506, 0.17348499202863618, 0.29448387302484397, 0.20230293859701567, 0.35007816779418527, -0.432966023509469, -0.22983220457447537, 0.09248976361998748, 0.10515088666647686, 0.13885181677956396, -0.06564556811230364, -0.28153771974981945, 0.0669040404021888, -0.15863255011766417, -0.07997113578326165, -0.11900264304620867, 0.0013630803060831031, -0.015171187796257871, -0.23550059616339403, -0.001921235658794154, 0.03278322087135166, 0.09273231439684108, -0.034524371895654056, -0.1435050250860105, 0.02069688570428918, 0.14859580747942575, -0.003110137894841033, 0.02904517897600569, 0.15107719067954153, -0.18012160988754122, -0.2038378132179175, 0.39275615796377167, -0.02470999459910672, -0.1810934188499368, 0.21930982532832666, -0.06001504350270832, -0.1572557038967019, 0.11296750772657378, 0.1661234643728098, 0.16410537485673013, -0.16026631116174286, 0.07817335684036306, -0.022157217547837123, 0.18232302536217443, 0.027291865085053615, 0.010870529595483965, 0.16294493793866763, 0.23563839170633527, 0.07754839778057447, 0.11912848723690007, -0.03302939449791648, -0.20464161654257554, -0.24727005929747056, -0.13756968388682075, -0.15151999843476566, 0.03382442354999274, -0.09822477195671679, -0.15301239203931502, 0.3674357340744018, 0.1900602175601732, 0.11044513579092433, 0.06733830200201422, 0.33553572248876373, 0.0675525534152767, 0.09038805217856419, 0.07646805427045883, 0.19253541480178105, 0.0926210147640929, 0.13058756623323572, -0.1565071667332929, 0.08431880435009843, 0.050436912666572145]
|
1,803.0505
|
A hierarchical random compression method for kernel matrices
|
In this paper, we propose a hierarchical random compression method (HRCM) for
kernel matrices in fast kernel summations. The HRCM combines the hierarchical
framework of the H-matrix and a randomized sampling technique of the column and
row spaces for far-field interaction kernel matrices. We show that a uniform
column/row sampling (with a given sample size) of a far-field kernel matrix,
with- out the need and associated cost to pre-compute a costly sampling
distribution, will give a low-rank compression of such low-rank matrices,
independent of the matrix sizes and only dependent on the separation of the
source and target locations. This far-field random compression technique is
then implemented at each level of the hierarchical decomposition for general
kernel matrices, resulting in an O(N logN) random compression method. Error and
complexity analysis for the HRCM are included. Numerical results for
electrostatic and Helmholtz wave kernels have vali- dated the efficiency and
accuracy of the proposed method with a cross-over matrix size, in comparison of
direct O(N^2) summations, in the order of thousands for a 3-4 digits relative
accuracy.
|
math.NA
|
in this paper we propose a hierarchical random compression method hrcm for kernel matrices in fast kernel summations the hrcm combines the hierarchical framework of the hmatrix and a randomized sampling technique of the column and row spaces for farfield interaction kernel matrices we show that a uniform columnrow sampling with a given sample size of a farfield kernel matrix with out the need and associated cost to precompute a costly sampling distribution will give a lowrank compression of such lowrank matrices independent of the matrix sizes and only dependent on the separation of the source and target locations this farfield random compression technique is then implemented at each level of the hierarchical decomposition for general kernel matrices resulting in an on logn random compression method error and complexity analysis for the hrcm are included numerical results for electrostatic and helmholtz wave kernels have vali dated the efficiency and accuracy of the proposed method with a crossover matrix size in comparison of direct on2 summations in the order of thousands for a 34 digits relative accuracy
|
[['in', 'this', 'paper', 'we', 'propose', 'a', 'hierarchical', 'random', 'compression', 'method', 'hrcm', 'for', 'kernel', 'matrices', 'in', 'fast', 'kernel', 'summations', 'the', 'hrcm', 'combines', 'the', 'hierarchical', 'framework', 'of', 'the', 'hmatrix', 'and', 'a', 'randomized', 'sampling', 'technique', 'of', 'the', 'column', 'and', 'row', 'spaces', 'for', 'farfield', 'interaction', 'kernel', 'matrices', 'we', 'show', 'that', 'a', 'uniform', 'columnrow', 'sampling', 'with', 'a', 'given', 'sample', 'size', 'of', 'a', 'farfield', 'kernel', 'matrix', 'with', 'out', 'the', 'need', 'and', 'associated', 'cost', 'to', 'precompute', 'a', 'costly', 'sampling', 'distribution', 'will', 'give', 'a', 'lowrank', 'compression', 'of', 'such', 'lowrank', 'matrices', 'independent', 'of', 'the', 'matrix', 'sizes', 'and', 'only', 'dependent', 'on', 'the', 'separation', 'of', 'the', 'source', 'and', 'target', 'locations', 'this', 'farfield', 'random', 'compression', 'technique', 'is', 'then', 'implemented', 'at', 'each', 'level', 'of', 'the', 'hierarchical', 'decomposition', 'for', 'general', 'kernel', 'matrices', 'resulting', 'in', 'an', 'on', 'logn', 'random', 'compression', 'method', 'error', 'and', 'complexity', 'analysis', 'for', 'the', 'hrcm', 'are', 'included', 'numerical', 'results', 'for', 'electrostatic', 'and', 'helmholtz', 'wave', 'kernels', 'have', 'vali', 'dated', 'the', 'efficiency', 'and', 'accuracy', 'of', 'the', 'proposed', 'method', 'with', 'a', 'crossover', 'matrix', 'size', 'in', 'comparison', 'of', 'direct', 'on2', 'summations', 'in', 'the', 'order', 'of', 'thousands', 'for', 'a', '34', 'digits', 'relative', 'accuracy']]
|
[-0.07983224828918041, 0.059029161840871064, -0.05821629471029155, 0.048035028942897705, -0.03878144537818364, -0.09316105311154388, 0.08174620726905149, 0.4207375069699166, -0.2894552740670571, -0.25205362728527025, 0.1143330585083194, -0.23673731473867188, -0.1441911447234981, 0.1532368747152346, -0.03035117854597047, 0.12273081130247605, 0.11417753757665526, 0.017248756739056924, -0.12830917873039158, -0.25438644061267207, 0.2878529896816789, 0.07760319172997367, 0.28029133046088234, 0.006854574831033295, 0.14187704283341934, 0.027499358715100574, -0.07541722210854376, -0.015162785817996006, -0.04192007972286857, 0.13800249819310426, 0.2386453379086478, 0.1402101220065891, 0.2943392389411615, -0.4035663356134633, -0.16353155347777912, 0.08783777603159913, 0.14406725648388435, 0.09134141436185349, -0.05727505442667858, -0.2522092509766067, 0.10186519064551579, -0.175031598249916, -0.06774585711801509, -0.10488094207936559, -0.011542304313148965, 0.03084089492437091, -0.3699422101807696, 0.08578780120329942, 0.061253624848384126, 0.01507717627629807, -0.0024850549102252858, -0.18663781720136863, 0.11192569438505663, 0.08584260431201653, -0.028289753849755718, 0.009437975998397715, 0.10063380076528781, -0.08127109480185689, -0.08172135583431968, 0.34438238179692154, -0.04486754265500084, -0.24540000699397008, 0.14521117579451212, -0.10908682691429435, -0.12272883225655691, 0.17223797024185347, 0.2180506850848112, 0.0985943519467996, -0.11115242745621469, 0.08424005364808677, -0.04324115197885641, 0.18764401490162444, 0.10326544624364363, -0.014245964899931674, 0.09259607159236277, 0.153036361955773, 0.09575354675524234, 0.1479221557793525, -0.1194993355764547, -0.055556555361611325, -0.2630389555997681, -0.1572590998945419, -0.2756498418536715, -0.007621584284606797, -0.21919874595435182, -0.21444308963096279, 0.39562454568328, 0.1371576707976849, 0.22110256205566906, 0.1180133209841601, 0.3195553560296751, 0.10877885823455555, 0.0576030182631009, 0.09579355351954953, 0.12476330551593988, 0.15096860326990613, 0.07450001850173232, -0.19430191525977783, 0.058846517153803936, 0.1293440116807522]
|
1,803.05051
|
Monochromatic loose paths in multicolored $k$-uniform cliques
|
For integers $k\ge 2$ and $\ell\ge 0$, a $k$-uniform hypergraph is called a
loose path of length $\ell$, and denoted by $P_\ell^{(k)}$, if it consists of
$\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and
$e_i\cap e_j=\emptyset$ if $|i-j|\ge2$. In other words, each pair of
consecutive edges intersects on a single vertex, while all other pairs are
disjoint. Let $R(P_\ell^{(k)};r)$ be the minimum integer $n$ such that every
$r$-edge-coloring of the complete $k$-uniform hypergraph $K_n^{(k)}$ yields a
monochromatic copy of $P_\ell^{(k)}$. In this paper we are mostly interested in
constructive upper bounds on $R(P_\ell^{(k)};r)$, meaning that on the cost of
possibly enlarging the order of the complete hypergraph, we would like to
efficiently find a monochromatic copy of $P_\ell^{(k)}$ in every coloring. In
particular, we show that there is a constant $c>0$ such that for all $k\ge 2$,
$\ell\ge3$, $2\le r\le k-1$, and $n\ge k(\ell+1)r(1+\ln(r))$, there is an
algorithm such that for every $r$-edge-coloring of the edges of $K_n^{(k)}$, it
finds a monochromatic copy of $P_\ell^{(k)}$ in time at most $cn^k$. We also
prove a non-constructive upper bound $R(P_\ell^{(k)};r)\le(k-1)\ell r$.
|
math.CO
|
for integers kge 2 and ellge 0 a kuniform hypergraph is called a loose path of length ell and denoted by p_ellk if it consists of ell edges e_1dotse_ell such that e_icap e_j1 if ij1 and e_icap e_jemptyset if ijge2 in other words each pair of consecutive edges intersects on a single vertex while all other pairs are disjoint let rp_ellkr be the minimum integer n such that every redgecoloring of the complete kuniform hypergraph k_nk yields a monochromatic copy of p_ellk in this paper we are mostly interested in constructive upper bounds on rp_ellkr meaning that on the cost of possibly enlarging the order of the complete hypergraph we would like to efficiently find a monochromatic copy of p_ellk in every coloring in particular we show that there is a constant c0 such that for all kge 2 ellge3 2le rle k1 and nge kell1r1lnr there is an algorithm such that for every redgecoloring of the edges of k_nk it finds a monochromatic copy of p_ellk in time at most cnk we also prove a nonconstructive upper bound rp_ellkrlek1ell r
|
[['for', 'integers', 'kge', '2', 'and', 'ellge', '0', 'a', 'kuniform', 'hypergraph', 'is', 'called', 'a', 'loose', 'path', 'of', 'length', 'ell', 'and', 'denoted', 'by', 'p_ellk', 'if', 'it', 'consists', 'of', 'ell', 'edges', 'e_1dotse_ell', 'such', 'that', 'e_icap', 'e_j1', 'if', 'ij1', 'and', 'e_icap', 'e_jemptyset', 'if', 'ijge2', 'in', 'other', 'words', 'each', 'pair', 'of', 'consecutive', 'edges', 'intersects', 'on', 'a', 'single', 'vertex', 'while', 'all', 'other', 'pairs', 'are', 'disjoint', 'let', 'rp_ellkr', 'be', 'the', 'minimum', 'integer', 'n', 'such', 'that', 'every', 'redgecoloring', 'of', 'the', 'complete', 'kuniform', 'hypergraph', 'k_nk', 'yields', 'a', 'monochromatic', 'copy', 'of', 'p_ellk', 'in', 'this', 'paper', 'we', 'are', 'mostly', 'interested', 'in', 'constructive', 'upper', 'bounds', 'on', 'rp_ellkr', 'meaning', 'that', 'on', 'the', 'cost', 'of', 'possibly', 'enlarging', 'the', 'order', 'of', 'the', 'complete', 'hypergraph', 'we', 'would', 'like', 'to', 'efficiently', 'find', 'a', 'monochromatic', 'copy', 'of', 'p_ellk', 'in', 'every', 'coloring', 'in', 'particular', 'we', 'show', 'that', 'there', 'is', 'a', 'constant', 'c0', 'such', 'that', 'for', 'all', 'kge', '2', 'ellge3', '2le', 'rle', 'k1', 'and', 'nge', 'kell1r1lnr', 'there', 'is', 'an', 'algorithm', 'such', 'that', 'for', 'every', 'redgecoloring', 'of', 'the', 'edges', 'of', 'k_nk', 'it', 'finds', 'a', 'monochromatic', 'copy', 'of', 'p_ellk', 'in', 'time', 'at', 'most', 'cnk', 'we', 'also', 'prove', 'a', 'nonconstructive', 'upper', 'bound', 'rp_ellkrlek1ell', 'r']]
|
[-0.2063797811433845, 0.1730899050532513, -0.01868221835863125, 0.013293314521938476, -0.05332001295570564, -0.19493846032860004, 0.04087799464317437, 0.3662721141291287, -0.24442264047448625, -0.2606900974952029, 0.05430328636194682, -0.38284649545558314, -0.12330020322582841, 0.1352061749778478, -0.08177265361478994, -0.02700527321555345, 0.11333671489170608, 0.1416258121210802, 0.05898521283011099, -0.25947457770049853, 0.26829129671799073, -0.11040231025363238, 0.12253355171606806, 0.07947061336034036, 0.0875969295136932, 0.06331756941683461, 0.03651238898235249, 0.06032136468569387, -0.20268860824715354, 0.043685249603391124, 0.2682968401511582, 0.2079590254535931, 0.2802232853594543, -0.3696895649421468, -0.1261771470860099, 0.24982945211877713, 0.16338697508666555, 0.026132981015659997, -0.013003626473603307, -0.15549358027291382, 0.19734810613569498, -0.06076927329723136, -0.061048700751446056, 0.028988183673869582, 0.15381967443219155, 0.0003930891058515391, -0.3243572373263473, -0.028084160268980998, 0.14624881291105224, 0.02043597267185623, 0.05903746915921956, -0.19656176908975306, -0.06371938176937617, 0.06158166216831719, -0.07430995765917348, 0.10685930727318876, -0.017705420256562725, -0.09865173166671584, -0.14480002692259977, 0.3517016215913396, -0.07548591524774392, -0.15220766971049282, 0.09297199455773555, -0.1487409778329109, -0.21041792484990865, 0.12046735738054176, 0.07091045550829758, 0.17269045792417761, -0.056064530709123164, 0.15569215609168505, -0.15012755134072953, 0.1744165711987742, 0.1677657858861578, 0.06628173083939046, 0.1286091252263838, 0.0881629740385974, 0.18390133521368868, 0.13799082057959686, 0.0008200333114562696, 0.07497773709238609, -0.35082922806435757, -0.1690865290957514, -0.2312681033057995, 0.09893339759982434, -0.15053955515856032, -0.17548945617681702, 0.35325521881008426, 0.09696204442533563, 0.19306304848973635, 0.10223651088900713, 0.25669984635762394, 0.06891811684559966, 0.03512726556859652, 0.19950008048605972, 0.10035640889014295, 0.09291688561092287, -0.09175032064603976, -0.12965142372941782, 0.030426964142246743, 0.1271727499578988]
|
1,803.05052
|
The weighted Property (A) and the greedy algorithm
|
We investigate various aspects of the "weighted" greedy algorithm with
respect to a Schauder basis. For a weight w, we describe w-greedy,
w-almost-greedy and w-partially-greedy bases, and show some properties of
w-semi-greedy bases. To achieve these goals, we introduce and study the
w-Property (A).
|
math.FA
|
we investigate various aspects of the weighted greedy algorithm with respect to a schauder basis for a weight w we describe wgreedy walmostgreedy and wpartiallygreedy bases and show some properties of wsemigreedy bases to achieve these goals we introduce and study the wproperty a
|
[['we', 'investigate', 'various', 'aspects', 'of', 'the', 'weighted', 'greedy', 'algorithm', 'with', 'respect', 'to', 'a', 'schauder', 'basis', 'for', 'a', 'weight', 'w', 'we', 'describe', 'wgreedy', 'walmostgreedy', 'and', 'wpartiallygreedy', 'bases', 'and', 'show', 'some', 'properties', 'of', 'wsemigreedy', 'bases', 'to', 'achieve', 'these', 'goals', 'we', 'introduce', 'and', 'study', 'the', 'wproperty', 'a']]
|
[-0.09923649266457711, 0.028011089883362636, -0.08262866983811061, 0.06642204238913763, -0.05576606687062826, -0.057820607896130055, 0.08434294374325337, 0.47385824357087797, -0.3249115376518323, -0.21987721958728984, 0.09656288385247955, -0.24246356220772633, -0.18347257261092847, 0.16409566082681218, -0.07474282472275007, 0.06493868893728806, 0.09004041896416591, 0.0501494013155118, -0.13936748260106796, -0.2460527032888375, 0.3668621052534152, 0.038892117149841324, 0.2514575321513873, -0.0077984905682313135, 0.14226594935051906, 0.0014306209647120573, -0.07889010900488266, 0.012137443280945986, -0.2323266910866667, 0.22249102742912677, 0.24702438244070762, 0.18789679924838054, 0.3137568743565144, -0.37024356252872026, -0.11569188828938283, 0.16870213698786804, 0.06232586431985673, 0.09136688383893134, -0.03340413352140249, -0.17868968936352012, 0.13664527755612746, -0.15946740408738455, -0.15445039316844672, -0.18643434579149845, -0.0639701475126621, 0.09857382034906784, -0.3131125422958762, -0.045523131337876506, 0.06055552832400187, 0.06276747247634026, -0.07716905867728667, -0.15803874783122387, 0.05096123937983066, 0.08500747007723802, -0.025557842272787522, 0.01494635958582736, 0.02266007550777151, -0.11738682137085842, -0.21195062956748864, 0.3910104397397775, -0.04729538449110129, -0.2467552930033073, 0.18660991271145833, -0.127523538011771, -0.15779394556123477, -0.019321598924505405, 0.2000159406198714, 0.12777250638613716, -0.11725105978070925, 0.05917022374416821, -0.05076281525767767, 0.1428571937677379, 0.07528352075351928, 0.1243852321536113, 0.10795459705285537, 0.14723713290041837, 0.09001931385734142, 0.18822646215080452, -0.02343458831549073, -0.01671759033193573, -0.2936603360069104, -0.24140487365329114, -0.11327752620817567, 0.0116923794341393, -0.046090152614991754, -0.1638144279997318, 0.44922118395184857, 0.1711026968028492, 0.2672683012027007, 0.09073629471449515, 0.19839830617778575, 0.0547984489836754, -0.0002690298148454764, 0.0785897602327168, 0.19646580671691574, 0.1453159183072738, 0.010626381621337853, -0.1832913194472591, 0.005708832387030363, 0.1536808733183604]
|
1,803.05053
|
Blind Identification of SFBC-OFDM Signals Using Subspace Decompositions
and Random Matrix Theory
|
Blind signal identification has important applications in both civilian and
military communications. Previous investigations on blind identification of
space-frequency block codes (SFBCs) only considered identifying Alamouti and
spatial multiplexing transmission schemes. In this paper, we propose a novel
algorithm to identify SFBCs by analyzing discriminating features for different
SFBCs, calculated by separating the signal subspace and noise subspace of the
received signals at different adjacent OFDM subcarriers. Relying on random
matrix theory, this algorithm utilizes a serial hypothesis test to determine
the decision boundary according to the maximum eigenvalue in the noise
subspace. Then, a decision tree of a special distance metric is employed for
decision making. The proposed algorithm does not require prior knowledge of the
signal parameters such as the number of transmit antennas, channel
coefficients, modulation mode and noise power. Simulation results verify the
viability of the proposed algorithm for a reduced observation period with an
acceptable computational complexity.
|
eess.SP
|
blind signal identification has important applications in both civilian and military communications previous investigations on blind identification of spacefrequency block codes sfbcs only considered identifying alamouti and spatial multiplexing transmission schemes in this paper we propose a novel algorithm to identify sfbcs by analyzing discriminating features for different sfbcs calculated by separating the signal subspace and noise subspace of the received signals at different adjacent ofdm subcarriers relying on random matrix theory this algorithm utilizes a serial hypothesis test to determine the decision boundary according to the maximum eigenvalue in the noise subspace then a decision tree of a special distance metric is employed for decision making the proposed algorithm does not require prior knowledge of the signal parameters such as the number of transmit antennas channel coefficients modulation mode and noise power simulation results verify the viability of the proposed algorithm for a reduced observation period with an acceptable computational complexity
|
[['blind', 'signal', 'identification', 'has', 'important', 'applications', 'in', 'both', 'civilian', 'and', 'military', 'communications', 'previous', 'investigations', 'on', 'blind', 'identification', 'of', 'spacefrequency', 'block', 'codes', 'sfbcs', 'only', 'considered', 'identifying', 'alamouti', 'and', 'spatial', 'multiplexing', 'transmission', 'schemes', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'algorithm', 'to', 'identify', 'sfbcs', 'by', 'analyzing', 'discriminating', 'features', 'for', 'different', 'sfbcs', 'calculated', 'by', 'separating', 'the', 'signal', 'subspace', 'and', 'noise', 'subspace', 'of', 'the', 'received', 'signals', 'at', 'different', 'adjacent', 'ofdm', 'subcarriers', 'relying', 'on', 'random', 'matrix', 'theory', 'this', 'algorithm', 'utilizes', 'a', 'serial', 'hypothesis', 'test', 'to', 'determine', 'the', 'decision', 'boundary', 'according', 'to', 'the', 'maximum', 'eigenvalue', 'in', 'the', 'noise', 'subspace', 'then', 'a', 'decision', 'tree', 'of', 'a', 'special', 'distance', 'metric', 'is', 'employed', 'for', 'decision', 'making', 'the', 'proposed', 'algorithm', 'does', 'not', 'require', 'prior', 'knowledge', 'of', 'the', 'signal', 'parameters', 'such', 'as', 'the', 'number', 'of', 'transmit', 'antennas', 'channel', 'coefficients', 'modulation', 'mode', 'and', 'noise', 'power', 'simulation', 'results', 'verify', 'the', 'viability', 'of', 'the', 'proposed', 'algorithm', 'for', 'a', 'reduced', 'observation', 'period', 'with', 'an', 'acceptable', 'computational', 'complexity']]
|
[-0.17810734561767036, 0.024925034206094814, -0.052721774775387815, 0.024502468018908985, -0.09726966512205668, -0.23026449715804406, 0.08425964787296068, 0.37866855288953766, -0.2522002654579027, -0.2889918968706441, 0.13057662255672958, -0.2136095955180568, -0.1771392167490711, 0.15653866414274825, -0.10623986376633279, 0.10624687155704075, 0.05586154528780179, 0.054694211179402805, -0.042830609691966524, -0.23704330889679687, 0.2628630667911095, 0.12309108080808073, 0.35750084174919483, -0.035850921256688276, 0.11733829299306595, 0.06558971190947648, -0.10797003921106807, -0.05635782699051848, -0.07712248227816369, 0.05764563245211799, 0.33456464953671555, 0.2108002802997362, 0.2798220593126883, -0.37293685937765986, -0.25181082931445226, 0.13107618506182916, 0.1563684035568976, 0.09123854793152102, -0.04433327593295345, -0.28023259879371737, 0.10352949555932642, -0.15052943421515488, -0.028047414827405623, -0.03128940879067063, -0.04221030856531702, -0.012362705990917197, -0.33678122860146686, 0.026995595556830888, 0.02693587346125002, 0.040174272487332165, -0.020400860389743588, -0.1494773026114624, 0.06386340838722199, 0.12194343745757483, 0.026552489202003926, -0.014943703466805777, 0.11609249159779497, -0.06707751044795211, -0.15543742936498156, 0.33866273524166135, -0.0052277205456783505, -0.2356960859982983, 0.15271609610193226, -0.07398287740101009, -0.13399946708599791, 0.15811781940053488, 0.23285897926689358, 0.06207161261945179, -0.15688723570814259, 0.0426044574537388, 0.0034912328035141783, 0.20812097087496353, 0.09936582510616924, 0.07821368756336405, 0.14500531524582153, 0.16646322821524287, 0.09224231520477731, 0.11736718474084658, -0.1397060058784279, -0.05308341921160096, -0.2227297743524296, -0.11397658023519111, -0.2474535929142899, -0.031261396099484716, -0.13240546003056042, -0.1346185095240607, 0.41390689387672436, 0.17055144249216506, 0.13578017317310073, 0.071971660293026, 0.38332430069720813, 0.08602661624440532, 0.04722103887625532, 0.09569022406542085, 0.1869901134693799, 0.14844537887869305, 0.05826699023907024, -0.21910138369544016, 0.07841571606542475, 0.04992484548864396]
|
1,803.05054
|
Optical weak measurements without removing the Goos-Haenchen phase
|
Optical weak measurements are a powerful tool for measuring small shifts of
optical paths. When applied to the measurement of the Goos-Haenchen shift, in
particular, a special step must be added to its protocol: the removal of the
relative Goos-Haenchen phase, since its presence generates a destructive
influence on the measurement. There is, however, a lack of description in the
literature of the precise effect of the Goos-Haenchen phase on weak
measurements. In this paper we address this issue, developing an analytic study
for a Gaussian beam transmitted through a dielectric structure. We obtain
analytic expressions for weak measurements as a function of the relative
Goos-Haenchen phase and show how to remove it without the aid of waveplates.
|
physics.optics
|
optical weak measurements are a powerful tool for measuring small shifts of optical paths when applied to the measurement of the gooshaenchen shift in particular a special step must be added to its protocol the removal of the relative gooshaenchen phase since its presence generates a destructive influence on the measurement there is however a lack of description in the literature of the precise effect of the gooshaenchen phase on weak measurements in this paper we address this issue developing an analytic study for a gaussian beam transmitted through a dielectric structure we obtain analytic expressions for weak measurements as a function of the relative gooshaenchen phase and show how to remove it without the aid of waveplates
|
[['optical', 'weak', 'measurements', 'are', 'a', 'powerful', 'tool', 'for', 'measuring', 'small', 'shifts', 'of', 'optical', 'paths', 'when', 'applied', 'to', 'the', 'measurement', 'of', 'the', 'gooshaenchen', 'shift', 'in', 'particular', 'a', 'special', 'step', 'must', 'be', 'added', 'to', 'its', 'protocol', 'the', 'removal', 'of', 'the', 'relative', 'gooshaenchen', 'phase', 'since', 'its', 'presence', 'generates', 'a', 'destructive', 'influence', 'on', 'the', 'measurement', 'there', 'is', 'however', 'a', 'lack', 'of', 'description', 'in', 'the', 'literature', 'of', 'the', 'precise', 'effect', 'of', 'the', 'gooshaenchen', 'phase', 'on', 'weak', 'measurements', 'in', 'this', 'paper', 'we', 'address', 'this', 'issue', 'developing', 'an', 'analytic', 'study', 'for', 'a', 'gaussian', 'beam', 'transmitted', 'through', 'a', 'dielectric', 'structure', 'we', 'obtain', 'analytic', 'expressions', 'for', 'weak', 'measurements', 'as', 'a', 'function', 'of', 'the', 'relative', 'gooshaenchen', 'phase', 'and', 'show', 'how', 'to', 'remove', 'it', 'without', 'the', 'aid', 'of', 'waveplates']]
|
[-0.14470154612119926, 0.11718358106674899, -0.09913560471071278, 0.0403174490813892, -0.06869043889692274, -0.10689311509683602, 0.09066791229159177, 0.3887124919979754, -0.2693030558195028, -0.26674241802292104, 0.09774974342218552, -0.2494338574499618, -0.13867696896155948, 0.2125349324196577, -0.045188169853398734, 0.03304284404059556, 0.06212379392710025, 0.013702496898092203, -0.08696971766619106, -0.13899456387409403, 0.31358110170198017, 0.06771197900475966, 0.2801088474698807, 0.08668635143124956, 0.0921323886772586, 0.06661009664205297, -0.046255758963525295, 0.026483156647280615, -0.11711610192571119, 0.10357833509254506, 0.20514070370280918, 0.06299323027053753, 0.2563121613545217, -0.39543742854621705, -0.2020470949079273, 0.13386010032904855, 0.11549649344780877, 0.17272380311673474, -0.09493845924774533, -0.2666636074624829, 0.06446249829605222, -0.12326482872841722, -0.1391714846683761, -0.06741768750362098, 0.0065580738739947145, -0.0006225877510525791, -0.2637136789631706, 0.04768498416721695, 0.06393283123006922, 0.0843550508320963, -0.028824120383094048, -0.03928449590516798, 0.018624143564473776, 0.15533665639582145, 0.01048777400717234, 0.056097782263334964, 0.10912677914819728, -0.13145987522567354, -0.051976213547385346, 0.3894582513909219, -0.08347316508149823, -0.19659518152159655, 0.11638788535788466, -0.15284330583319572, -0.09770945216907914, 0.1119001804410985, 0.1724013435512276, 0.1144536478697496, -0.13984797274118183, 0.037033355114606634, 0.0033439034043606054, 0.17818085634804695, 0.07506481924694094, 0.074702498092616, 0.17964488540192025, 0.13193764406556296, 0.07290515641018874, 0.176519806168271, -0.10942971819648677, -0.037739972939114956, -0.30573961631221286, -0.15657439089964253, -0.17257457223160477, 0.039626040261128315, -0.05112437914523703, -0.1919994574608439, 0.3958694216700555, 0.149674778804183, 0.218995830892601, -0.013835074095907857, 0.3668789224130875, 0.1383959525817279, 0.04826467616830842, -0.03414819531055893, 0.3071027499765663, 0.1796559055308196, 0.10086453928201759, -0.2434930886394518, 0.12470605769747142, 0.012068173749435503]
|
1,803.05055
|
Magnetic Fields Recorded by Chondrules Formed in Nebular Shocks
|
Recent laboratory efforts (Fu et al., 2014) have constrained the remanent
magnetizations of chondrules and the magnetic field strengths at which the
chondrules were exposed to as they cooled below their Curie points. An
outstanding question is whether the inferred paleofields represent the
background magnetic field of the solar nebula or were unique to the
chondrule-forming environment. We investigate the amplification of the magnetic
field above background values for two proposed chondrule formation mechanisms,
large-scale nebular shocks and planetary bow shocks. Behind large-scale shocks,
the magnetic field parallel to the shock front is amplified by factors $\sim
10-30$, regardless of the magnetic diffusivity. Therefore, chondrules melted in
these shocks probably recorded an amplified magnetic field. Behind planetary
bow shocks, the field amplification is sensitive to the magnetic diffusivity.
We compute the gas properties behind a bow shock around a 3000 km-radius
planetary embryo, with and without atmospheres, using hydrodynamics models. We
calculate the ionization state of the hot, shocked gas, including thermionic
emission from dust, and thermal ionization of gas-phase potassium atoms, and
the magnetic diffusivity due to Ohmic dissipation and ambipolar diffusion. We
find that the diffusivity is sufficiently large that magnetic fields have
already relaxed to background values in the shock downstream where chondrules
acquire magnetizations, and that these locations are sufficiently far from the
planetary embryos that chondrules should not have recorded a significant
putative dynamo field generated on these bodies. We conclude that, if melted in
planetary bow shocks, chondrules probably recorded the background nebular
field.
|
astro-ph.EP
|
recent laboratory efforts fu et al 2014 have constrained the remanent magnetizations of chondrules and the magnetic field strengths at which the chondrules were exposed to as they cooled below their curie points an outstanding question is whether the inferred paleofields represent the background magnetic field of the solar nebula or were unique to the chondruleforming environment we investigate the amplification of the magnetic field above background values for two proposed chondrule formation mechanisms largescale nebular shocks and planetary bow shocks behind largescale shocks the magnetic field parallel to the shock front is amplified by factors sim 1030 regardless of the magnetic diffusivity therefore chondrules melted in these shocks probably recorded an amplified magnetic field behind planetary bow shocks the field amplification is sensitive to the magnetic diffusivity we compute the gas properties behind a bow shock around a 3000 kmradius planetary embryo with and without atmospheres using hydrodynamics models we calculate the ionization state of the hot shocked gas including thermionic emission from dust and thermal ionization of gasphase potassium atoms and the magnetic diffusivity due to ohmic dissipation and ambipolar diffusion we find that the diffusivity is sufficiently large that magnetic fields have already relaxed to background values in the shock downstream where chondrules acquire magnetizations and that these locations are sufficiently far from the planetary embryos that chondrules should not have recorded a significant putative dynamo field generated on these bodies we conclude that if melted in planetary bow shocks chondrules probably recorded the background nebular field
|
[['recent', 'laboratory', 'efforts', 'fu', 'et', 'al', '2014', 'have', 'constrained', 'the', 'remanent', 'magnetizations', 'of', 'chondrules', 'and', 'the', 'magnetic', 'field', 'strengths', 'at', 'which', 'the', 'chondrules', 'were', 'exposed', 'to', 'as', 'they', 'cooled', 'below', 'their', 'curie', 'points', 'an', 'outstanding', 'question', 'is', 'whether', 'the', 'inferred', 'paleofields', 'represent', 'the', 'background', 'magnetic', 'field', 'of', 'the', 'solar', 'nebula', 'or', 'were', 'unique', 'to', 'the', 'chondruleforming', 'environment', 'we', 'investigate', 'the', 'amplification', 'of', 'the', 'magnetic', 'field', 'above', 'background', 'values', 'for', 'two', 'proposed', 'chondrule', 'formation', 'mechanisms', 'largescale', 'nebular', 'shocks', 'and', 'planetary', 'bow', 'shocks', 'behind', 'largescale', 'shocks', 'the', 'magnetic', 'field', 'parallel', 'to', 'the', 'shock', 'front', 'is', 'amplified', 'by', 'factors', 'sim', '1030', 'regardless', 'of', 'the', 'magnetic', 'diffusivity', 'therefore', 'chondrules', 'melted', 'in', 'these', 'shocks', 'probably', 'recorded', 'an', 'amplified', 'magnetic', 'field', 'behind', 'planetary', 'bow', 'shocks', 'the', 'field', 'amplification', 'is', 'sensitive', 'to', 'the', 'magnetic', 'diffusivity', 'we', 'compute', 'the', 'gas', 'properties', 'behind', 'a', 'bow', 'shock', 'around', 'a', '3000', 'kmradius', 'planetary', 'embryo', 'with', 'and', 'without', 'atmospheres', 'using', 'hydrodynamics', 'models', 'we', 'calculate', 'the', 'ionization', 'state', 'of', 'the', 'hot', 'shocked', 'gas', 'including', 'thermionic', 'emission', 'from', 'dust', 'and', 'thermal', 'ionization', 'of', 'gasphase', 'potassium', 'atoms', 'and', 'the', 'magnetic', 'diffusivity', 'due', 'to', 'ohmic', 'dissipation', 'and', 'ambipolar', 'diffusion', 'we', 'find', 'that', 'the', 'diffusivity', 'is', 'sufficiently', 'large', 'that', 'magnetic', 'fields', 'have', 'already', 'relaxed', 'to', 'background', 'values', 'in', 'the', 'shock', 'downstream', 'where', 'chondrules', 'acquire', 'magnetizations', 'and', 'that', 'these', 'locations', 'are', 'sufficiently', 'far', 'from', 'the', 'planetary', 'embryos', 'that', 'chondrules', 'should', 'not', 'have', 'recorded', 'a', 'significant', 'putative', 'dynamo', 'field', 'generated', 'on', 'these', 'bodies', 'we', 'conclude', 'that', 'if', 'melted', 'in', 'planetary', 'bow', 'shocks', 'chondrules', 'probably', 'recorded', 'the', 'background', 'nebular', 'field']]
|
[-0.09775944790970008, 0.21559060758626136, 0.001331129515047876, 0.07967364782844895, -0.08324555021094819, -0.04218276832140081, -0.027023347389859415, 0.39198593344659577, -0.2749127119445362, -0.3348337953850146, 0.03440442388326177, -0.2548843658686007, -0.025640808181994924, 0.17000097064057276, 0.010775245992737192, -0.0507013935438731, 0.0374986614765329, -0.05563395002841829, 0.026447638067345965, -0.22732855081924372, 0.29528657150184434, 0.10902561795815165, 0.16219711861753416, 0.04511017985679509, 0.0752225566876962, -0.17537272021124203, 0.054181840829363455, 0.012916141107956308, -0.16902476779142167, 0.013849207941788219, 0.18655586854861067, 0.06712892432466516, 0.21874357732726382, -0.5270778884840829, -0.2520662904604368, 0.02691283097708712, 0.18013917791352968, 0.08264920748760848, -0.06631083753252882, -0.2626401719471981, 0.061035085987720276, -0.1398154873900386, -0.14900298488341393, 0.012268284136699814, 0.051530955954090574, 0.01792018679853138, -0.2883356961481754, 0.10061863976560774, 0.06205068664501361, 0.12908690138306889, -0.14345368602681124, -0.09615634451244748, -0.08066187484843296, 0.04418561104290758, 0.10068576586819554, 0.06617236255495358, 0.3009465159209926, -0.18523170966317035, -0.03508550170555545, 0.37313210805540065, -0.055106206537945374, -0.02171406348145777, 0.27173844340910774, -0.2521724581414263, -0.08613247289688461, 0.2699751785013735, 0.15771383515769435, 0.08037046940937158, -0.13504112065364157, -0.003275300174972208, -0.036652879615787476, 0.13325473938734392, 0.10454046029049242, -0.012468111934140325, 0.3314950343694598, 0.10023179932332207, -0.04767503851044533, 0.0998286077839082, -0.20229229984444477, -0.014416448555317813, -0.2099664249540036, -0.13083351984988117, -0.15276442265472254, 0.05438131096144066, -0.10621519317816908, -0.1785617135593648, 0.30011552860566054, 0.22615816881091544, 0.1528784372945196, -0.09484202720763747, 0.29710120281332264, 0.0838282567354092, 0.05675620536766796, 0.19299209246134025, 0.320279257426474, 0.21443012936299877, 0.16835759566897796, -0.27060312695328087, 0.14963134833575872, 0.014613279548939317]
|
1,803.05056
|
Three small planets transiting the bright young field star K2-233
|
We report the detection of three small transiting planets around the young K3
dwarf K2-233 (2MASS J15215519-2013539) from observations during Campaign 15 of
the K2 mission. The star is relatively nearby ($d$ = 69 pc) and bright ($V$ =
10.7 mag, $K_s$ = 8.4 mag), making the planetary system an attractive target
for radial velocity follow-up and atmospheric characterization with the James
Webb Space Telescope. The inner two planets are hot super-Earths ($R_b$ = 1.40
$\pm$ 0.06 R$_\oplus$, $R_c$ = 1.34 $\pm$ 0.08 R$_\oplus$), while the outer
planet is a warm sub-Neptune ($R_d$ = 2.6 $\pm$ 0.1 R$_\oplus$). We estimate
the stellar age to be 360$^{+490}_{-140}$ Myr based on rotation, activity, and
kinematic indicators. The K2-233 system is particularly interesting given
recent evidence for inflated radii in planets around similarly-aged stars, a
trend potentially related to photo-evaporation, core-cooling, or both
mechanisms.
|
astro-ph.EP
|
we report the detection of three small transiting planets around the young k3 dwarf k2233 2mass j152155192013539 from observations during campaign 15 of the k2 mission the star is relatively nearby d 69 pc and bright v 107 mag k_s 84 mag making the planetary system an attractive target for radial velocity followup and atmospheric characterization with the james webb space telescope the inner two planets are hot superearths r_b 140 pm 006 r_oplus r_c 134 pm 008 r_oplus while the outer planet is a warm subneptune r_d 26 pm 01 r_oplus we estimate the stellar age to be 360490_140 myr based on rotation activity and kinematic indicators the k2233 system is particularly interesting given recent evidence for inflated radii in planets around similarlyaged stars a trend potentially related to photoevaporation corecooling or both mechanisms
|
[['we', 'report', 'the', 'detection', 'of', 'three', 'small', 'transiting', 'planets', 'around', 'the', 'young', 'k3', 'dwarf', 'k2233', '2mass', 'j152155192013539', 'from', 'observations', 'during', 'campaign', '15', 'of', 'the', 'k2', 'mission', 'the', 'star', 'is', 'relatively', 'nearby', 'd', '69', 'pc', 'and', 'bright', 'v', '107', 'mag', 'k_s', '84', 'mag', 'making', 'the', 'planetary', 'system', 'an', 'attractive', 'target', 'for', 'radial', 'velocity', 'followup', 'and', 'atmospheric', 'characterization', 'with', 'the', 'james', 'webb', 'space', 'telescope', 'the', 'inner', 'two', 'planets', 'are', 'hot', 'superearths', 'r_b', '140', 'pm', '006', 'r_oplus', 'r_c', '134', 'pm', '008', 'r_oplus', 'while', 'the', 'outer', 'planet', 'is', 'a', 'warm', 'subneptune', 'r_d', '26', 'pm', '01', 'r_oplus', 'we', 'estimate', 'the', 'stellar', 'age', 'to', 'be', '360490_140', 'myr', 'based', 'on', 'rotation', 'activity', 'and', 'kinematic', 'indicators', 'the', 'k2233', 'system', 'is', 'particularly', 'interesting', 'given', 'recent', 'evidence', 'for', 'inflated', 'radii', 'in', 'planets', 'around', 'similarlyaged', 'stars', 'a', 'trend', 'potentially', 'related', 'to', 'photoevaporation', 'corecooling', 'or', 'both', 'mechanisms']]
|
[-0.12674086857658193, 0.20100983657497817, -0.0522343230838994, 0.05752241953706212, -0.14479859810294085, -0.10112221799933045, 0.1267387888266328, 0.3562627589296308, -0.10517523536558142, -0.4136566684389387, 0.10838182985992349, -0.34849893582899494, -0.03074163563402, 0.2076345135480919, -0.13292418276350804, 0.007945178238362188, 0.14218273907473297, -0.10844411060057638, -0.028558860380088782, -0.2832118396199387, 0.1764873079702308, 0.05588806519739842, -0.02334876117147221, -0.034068109556492275, -0.01990267733966875, -0.12240094887776982, -0.0783255894149419, -0.12579375482008806, -0.26813470186196436, -0.010736503140673837, 0.22734388485835252, 0.10394994897113843, 0.22266228141917185, -0.2466972950661114, -0.14196195447717913, 0.06192508088211522, 0.16172151782777416, -0.10417188533212109, 0.0013858212668178532, -0.33341165297870873, 0.0911665815710737, -0.21767729383943077, -0.21447351231694733, 0.10736340285769401, 0.20043741423238554, -0.0740082235673606, -0.2782746559823863, 0.17677108867836847, -0.007453840304137641, 0.23005691799690647, -0.20674427443020443, -0.2115938961736943, -0.06376993935644086, 0.026396313484914544, -0.01875746033495676, 0.14032131605532788, 0.19167319675978586, -0.05852097206045198, 0.055090924075321214, 0.42185012057764837, -0.11769637772955625, 0.07594370300248834, 0.23623998503143837, -0.25045787635835187, -0.1261182421025685, 0.15437648061108383, 0.16139139007232223, 0.1696636320326392, -0.17518223821405918, -0.03658728381993875, -0.0058056602133651275, 0.2423021829409795, 0.08853941064199987, 0.06048652924462186, 0.4471422039640655, 0.13447859381922728, 0.08288259061679017, -0.013981465869654283, -0.3486514559978946, -0.011581156529016963, -0.17518884663377668, -0.10012954162639914, -0.1130074082592943, 0.08679160194912257, -0.20174382047921877, -0.04642662891712864, 0.2641286007288616, 0.0975595574288581, 0.20199243774289222, 0.04461536916925479, 0.28172466148913816, -0.0028480924097181275, 0.10500263058729754, 0.15223305768027673, 0.3472954878611988, 0.21077763190393456, 0.054606680425047474, -0.2230850050593762, 0.06282246149525417, -0.03267736507060703]
|
1,803.05057
|
Low-regularity global well-posedness for the Klein-Gordon-Schr\"odinger
system on $\mathbb R^{+}$
|
In this paper we establish an almost optimal well-posedness and regularity
theory for the Klein-Gordon-Schr\"odinger system on the half line. In
particular we prove local-in-time well-posedness for rough initial data in
Sobolev spaces of negative indices. Our results are consistent with the sharp
well-posedness results that exist in the full line case and in this sense
appear to be sharp. Finally we prove a global well-posedness result by
combining the $L^2$ conservation law of the Schr\"odinger part with a careful
iteration of the rough wave part in lower order Sobolev norms.
|
math.AP
|
in this paper we establish an almost optimal wellposedness and regularity theory for the kleingordonschrodinger system on the half line in particular we prove localintime wellposedness for rough initial data in sobolev spaces of negative indices our results are consistent with the sharp wellposedness results that exist in the full line case and in this sense appear to be sharp finally we prove a global wellposedness result by combining the l2 conservation law of the schrodinger part with a careful iteration of the rough wave part in lower order sobolev norms
|
[['in', 'this', 'paper', 'we', 'establish', 'an', 'almost', 'optimal', 'wellposedness', 'and', 'regularity', 'theory', 'for', 'the', 'kleingordonschrodinger', 'system', 'on', 'the', 'half', 'line', 'in', 'particular', 'we', 'prove', 'localintime', 'wellposedness', 'for', 'rough', 'initial', 'data', 'in', 'sobolev', 'spaces', 'of', 'negative', 'indices', 'our', 'results', 'are', 'consistent', 'with', 'the', 'sharp', 'wellposedness', 'results', 'that', 'exist', 'in', 'the', 'full', 'line', 'case', 'and', 'in', 'this', 'sense', 'appear', 'to', 'be', 'sharp', 'finally', 'we', 'prove', 'a', 'global', 'wellposedness', 'result', 'by', 'combining', 'the', 'l2', 'conservation', 'law', 'of', 'the', 'schrodinger', 'part', 'with', 'a', 'careful', 'iteration', 'of', 'the', 'rough', 'wave', 'part', 'in', 'lower', 'order', 'sobolev', 'norms']]
|
[-0.13345593741102205, 0.028288466518311146, -0.07034457228300008, 0.11154271509488123, -0.034781964014765326, -0.0539179267975819, 0.0004508332042330569, 0.3277266438804812, -0.26818190819512194, -0.22248763799831106, 0.17125266367456987, -0.3004149868879672, -0.12702555295366508, 0.17992435810143373, -0.11034441232978069, 0.10770556284626434, 0.08384381223388099, -0.011596488748462154, -0.08178239476682803, -0.2647761916076498, 0.4158644033800606, -0.037106412718748, 0.24321324972865674, 0.05023187859454653, 0.04538991301868029, -0.0019007755039198385, -0.007887846109672235, -0.002247955624505386, -0.23486079782150637, 0.15371289746938172, 0.2526397203085023, 0.020197055568652495, 0.3070359494803207, -0.4412988252006471, -0.20173261244781315, 0.11705738423740143, 0.12064614136713547, 0.09029035833101351, -0.06999962288850489, -0.30528925911646215, 0.09584060484789066, -0.059936387587215874, -0.24026852964351958, -0.06760935606127912, 0.007155119124185908, 0.0642650786705397, -0.32044305609395873, 0.15625567682622166, 0.1207600050147848, 0.07118318725254509, -0.22007769047395215, -0.04018637855347901, -0.021898998303216073, 0.06501628588475697, 0.07188960041973617, 0.03166093129490676, -0.012678513615545664, -0.09584003906430942, -0.060883376362303704, 0.29775137946030106, -0.11803000559198804, -0.21991286802381932, 0.1422451058873436, -0.18488114620149546, -0.150723783498896, 0.08850408527631681, 0.16274586220170822, 0.13262731747378423, -0.07460963130406625, 0.13040837979553124, -0.09579347334990845, 0.16435608930967666, 0.09170437969042214, 0.03605041059839365, 0.015231244245564544, 0.12746013816865673, 0.23471851588564588, 0.1159887666760299, -0.015145226553783517, -0.09415738275057155, -0.4164973048718421, -0.1763294820192751, -0.1716463083687883, 0.07690682515017765, -0.1295635774216722, -0.1514101985760115, 0.3344694331881928, 0.15575682412792038, 0.19836277217901016, 0.13614804050015225, 0.21443268415200842, 0.18415679385153844, -0.026068670667482766, 0.1197420984179109, 0.27486961044289254, 0.1403483452587542, 0.21372491693901982, -0.1462847069974037, 0.014758152482330103, 0.18853685190225697]
|
1,803.05058
|
Investigating the Effect of Music and Lyrics on Spoken-Word Recognition
|
Background music in social interaction settings can hinder conversation. Yet,
little is known of how specific properties of music impact speech processing.
This paper addresses this knowledge gap by investigating 1) whether the masking
effect of background music with lyrics is larger than that of music without
lyrics, and 2) whether the masking effect is larger for more complex music. To
answer these questions, a word identification experiment was run in which Dutch
participants listened to Dutch CVC words embedded in stretches of background
music in two conditions, with and without lyrics, and at three SNRs. Three
songs were used of different genres and complexities. Music stretches with and
without lyrics were sampled from the same song in order to control for factors
beyond the presence of lyrics. The results showed a clear negative impact of
the presence of lyrics in background music on spoken-word recognition. This
impact is independent of complexity. The results suggest that social spaces
(e.g., restaurants, caf\'es and bars) should make careful choices of music to
promote conversation, and open a path for future work.
|
cs.SD cs.CL eess.AS
|
background music in social interaction settings can hinder conversation yet little is known of how specific properties of music impact speech processing this paper addresses this knowledge gap by investigating 1 whether the masking effect of background music with lyrics is larger than that of music without lyrics and 2 whether the masking effect is larger for more complex music to answer these questions a word identification experiment was run in which dutch participants listened to dutch cvc words embedded in stretches of background music in two conditions with and without lyrics and at three snrs three songs were used of different genres and complexities music stretches with and without lyrics were sampled from the same song in order to control for factors beyond the presence of lyrics the results showed a clear negative impact of the presence of lyrics in background music on spokenword recognition this impact is independent of complexity the results suggest that social spaces eg restaurants cafes and bars should make careful choices of music to promote conversation and open a path for future work
|
[['background', 'music', 'in', 'social', 'interaction', 'settings', 'can', 'hinder', 'conversation', 'yet', 'little', 'is', 'known', 'of', 'how', 'specific', 'properties', 'of', 'music', 'impact', 'speech', 'processing', 'this', 'paper', 'addresses', 'this', 'knowledge', 'gap', 'by', 'investigating', '1', 'whether', 'the', 'masking', 'effect', 'of', 'background', 'music', 'with', 'lyrics', 'is', 'larger', 'than', 'that', 'of', 'music', 'without', 'lyrics', 'and', '2', 'whether', 'the', 'masking', 'effect', 'is', 'larger', 'for', 'more', 'complex', 'music', 'to', 'answer', 'these', 'questions', 'a', 'word', 'identification', 'experiment', 'was', 'run', 'in', 'which', 'dutch', 'participants', 'listened', 'to', 'dutch', 'cvc', 'words', 'embedded', 'in', 'stretches', 'of', 'background', 'music', 'in', 'two', 'conditions', 'with', 'and', 'without', 'lyrics', 'and', 'at', 'three', 'snrs', 'three', 'songs', 'were', 'used', 'of', 'different', 'genres', 'and', 'complexities', 'music', 'stretches', 'with', 'and', 'without', 'lyrics', 'were', 'sampled', 'from', 'the', 'same', 'song', 'in', 'order', 'to', 'control', 'for', 'factors', 'beyond', 'the', 'presence', 'of', 'lyrics', 'the', 'results', 'showed', 'a', 'clear', 'negative', 'impact', 'of', 'the', 'presence', 'of', 'lyrics', 'in', 'background', 'music', 'on', 'spokenword', 'recognition', 'this', 'impact', 'is', 'independent', 'of', 'complexity', 'the', 'results', 'suggest', 'that', 'social', 'spaces', 'eg', 'restaurants', 'cafes', 'and', 'bars', 'should', 'make', 'careful', 'choices', 'of', 'music', 'to', 'promote', 'conversation', 'and', 'open', 'a', 'path', 'for', 'future', 'work']]
|
[-0.06865901814504223, 0.09403062684872199, -0.06249766632014613, 0.10672300277353694, -0.14455993170719175, -0.12324759972365468, 0.01876041714397646, 0.41552983635638874, -0.23174102419285558, -0.3683065765035689, 0.07702140283137769, -0.33780092315675087, -0.17576263404943132, 0.19232007289034567, -0.09045993069479807, -0.0027017562618751206, 0.10213587306220126, 0.04890825636057037, -0.0319190239638425, -0.3024824270808525, 0.3305018049209598, 0.0746982316329573, 0.3041844892582406, 0.0354142403648643, 0.05611745827815631, -0.03296474321598836, -0.12516398593950806, -0.018820965665214684, -0.06276328448201936, 0.09974847031820021, 0.3233738182393149, 0.19372316972731732, 0.3138620160072728, -0.4021901883436053, -0.19752444804834432, 0.059469839953686626, 0.14624457882762706, 0.08450985946914892, -0.04135730139509934, -0.3397485039254462, 0.11293791440574535, -0.12329423558123911, -0.007153332424402404, -0.01670625465765093, 0.03646661950997339, 0.003282371598421439, -0.21291422034388804, 0.055586585608896996, 0.09497574902024497, 0.13062955225095824, -0.030664124039493586, -0.13483255035034641, 0.04786715964954137, 0.25538784722023217, 0.08781027407346474, 0.04202190677248192, 0.13625474717059916, -0.21243767463994537, -0.15985932149741214, 0.4036325946282805, -0.08672338859362887, -0.1960251071160722, 0.18239369703289332, -0.11716439504192075, -0.12901840510966486, 0.08412634996890896, 0.19584599886549992, 0.0278244490285268, -0.14610917604622548, -0.02951818212652265, -0.0365231676456215, 0.27220988847227673, 0.15899697175312244, -0.012591987220423945, 0.20317739535900903, 0.18462209826534132, -0.011629219297738223, 0.11213793247425405, -0.06480895529508988, -0.03054930395387856, -0.1833533076569438, -0.11951677228868259, -0.11265552066936252, 0.015821568265830668, -0.08657768032236582, -0.14142214544536022, 0.3935629613174314, 0.19278246607623925, 0.1392269954189993, 0.02367474352273818, 0.27203793840461904, -0.0448497580102739, 0.06555360258201116, 0.04569329710133123, 0.1720776628314392, -0.0173547381202931, 0.1572340418024805, -0.16303624023959365, 0.11358031129014542, -0.0066023354753433315]
|
1,803.05059
|
Quest for a 'direct' observation of the Unruh effect with classical
electrodynamics: In honor of Atsushi Higuchi 60th anniversary
|
The Unruh effect is essential to keep the consistency of quantum field theory
in inertial and uniformly accelerated frames. Thus, the Unruh effect must be
considered as well tested as quantum field theory itself. In spite of it, it
would be nice to realize an experiment whose output could be directly
interpreted in terms of the Unruh effect. This is not easy because the linear
acceleration needed to reach a temperature 1 K is of order $10^{20} {\rm
m/s}^2$. We discuss here a conceptually simple experiment reachable under
present technology which may accomplish this goal. The inspiration for this
proposal can be traced back to Atsushi Higuchi's Ph.D. thesis, which makes it
particularly suitable to pay tribute to him on occasion of his $60^{\rm th}$
anniversary.
|
gr-qc hep-th quant-ph
|
the unruh effect is essential to keep the consistency of quantum field theory in inertial and uniformly accelerated frames thus the unruh effect must be considered as well tested as quantum field theory itself in spite of it it would be nice to realize an experiment whose output could be directly interpreted in terms of the unruh effect this is not easy because the linear acceleration needed to reach a temperature 1 k is of order 1020 rm ms2 we discuss here a conceptually simple experiment reachable under present technology which may accomplish this goal the inspiration for this proposal can be traced back to atsushi higuchis phd thesis which makes it particularly suitable to pay tribute to him on occasion of his 60rm th anniversary
|
[['the', 'unruh', 'effect', 'is', 'essential', 'to', 'keep', 'the', 'consistency', 'of', 'quantum', 'field', 'theory', 'in', 'inertial', 'and', 'uniformly', 'accelerated', 'frames', 'thus', 'the', 'unruh', 'effect', 'must', 'be', 'considered', 'as', 'well', 'tested', 'as', 'quantum', 'field', 'theory', 'itself', 'in', 'spite', 'of', 'it', 'it', 'would', 'be', 'nice', 'to', 'realize', 'an', 'experiment', 'whose', 'output', 'could', 'be', 'directly', 'interpreted', 'in', 'terms', 'of', 'the', 'unruh', 'effect', 'this', 'is', 'not', 'easy', 'because', 'the', 'linear', 'acceleration', 'needed', 'to', 'reach', 'a', 'temperature', '1', 'k', 'is', 'of', 'order', '1020', 'rm', 'ms2', 'we', 'discuss', 'here', 'a', 'conceptually', 'simple', 'experiment', 'reachable', 'under', 'present', 'technology', 'which', 'may', 'accomplish', 'this', 'goal', 'the', 'inspiration', 'for', 'this', 'proposal', 'can', 'be', 'traced', 'back', 'to', 'atsushi', 'higuchis', 'phd', 'thesis', 'which', 'makes', 'it', 'particularly', 'suitable', 'to', 'pay', 'tribute', 'to', 'him', 'on', 'occasion', 'of', 'his', '60rm', 'th', 'anniversary']]
|
[-0.060922862526029346, 0.17524940939724912, -0.129856207691133, 0.07299041633773595, -0.1289169724173844, -0.16497971457242966, 0.01775348858162761, 0.33816031178832057, -0.26735304985940456, -0.30402359801530837, 0.08192140970379114, -0.20640301307663322, -0.10612532717362046, 0.18716355510056018, -0.15509786355495453, 0.0035726158991456034, 0.01819211975019425, 0.08522864627838135, -0.018771652054972946, -0.29746469455584884, 0.21544514944963158, 0.1723447331096977, 0.2643013721369207, 0.07755805930122733, 0.11331647429615259, -0.03613311360776424, 0.015098985005170106, 0.02589964308217168, -0.09138086542859673, 0.050323225870728495, 0.30649033373221757, 0.1256488547362387, 0.30030172020196916, -0.4201221003383398, -0.16033408045209943, 0.0962705933302641, 0.11534602864738554, 0.1378704091962427, -0.00732919265050441, -0.2885246859975159, 0.07304044286906719, -0.1818517325911671, -0.1501335347518325, -0.04803151862323284, 0.02101983571238816, -0.08937881397176534, -0.22483583093807102, 0.009556300342082977, 0.07701240771729499, 0.024979938130825757, 0.002533217329531908, -0.07440577556192875, 0.05516391167603433, 0.11226268051564693, 0.06419415398873389, 0.10307306885533035, 0.14342496998980642, -0.06997354868985713, -0.08441758000850677, 0.4330767659288831, -0.07376043688785285, -0.15416549332626164, 0.16819990661367773, -0.1455354401739314, -0.0928592401733622, 0.07394069267809392, 0.1279954799534753, 0.11780357296019793, -0.1512029542539967, 0.09363088731141761, 0.0026677367482334374, 0.13976534960791467, 0.07298702960461378, 0.05282197665050626, 0.2537117677852511, 0.10687761917710305, 0.042244886346161366, 0.1235567049793899, -0.02365994159108959, -0.0798460174817592, -0.336452822140418, -0.2120832097325474, -0.18488879848271608, 0.11401609280903358, 0.02339495659957174, -0.10894740703515708, 0.3378130844049156, 0.21192017737496643, 0.178567529768683, -0.017523414811119437, 0.27773832698073236, 0.10770844674296677, 0.05692652716767043, 0.04007066988945007, 0.2776683327425271, 0.1469318869933486, 0.12545808814466, -0.20147829985059798, 0.06492753215972334, 0.05803942634165287]
|
1,803.0506
|
Split objects with respect to a fully invariant short exact sequence in
abelian categories
|
We introduce and investigate (dual) relative split objects with respect to a
fully invariant short exact sequence in abelian categories. We compare them
with (dual) relative Rickart objects, and we study their behaviour with respect
to direct sums and classes all of whose objects are (dual) relative split. We
also introduce and study (dual) strongly relative split objects. Applications
are given to Grothendieck categories, module and comodule categories.
|
math.CT math.RA
|
we introduce and investigate dual relative split objects with respect to a fully invariant short exact sequence in abelian categories we compare them with dual relative rickart objects and we study their behaviour with respect to direct sums and classes all of whose objects are dual relative split we also introduce and study dual strongly relative split objects applications are given to grothendieck categories module and comodule categories
|
[['we', 'introduce', 'and', 'investigate', 'dual', 'relative', 'split', 'objects', 'with', 'respect', 'to', 'a', 'fully', 'invariant', 'short', 'exact', 'sequence', 'in', 'abelian', 'categories', 'we', 'compare', 'them', 'with', 'dual', 'relative', 'rickart', 'objects', 'and', 'we', 'study', 'their', 'behaviour', 'with', 'respect', 'to', 'direct', 'sums', 'and', 'classes', 'all', 'of', 'whose', 'objects', 'are', 'dual', 'relative', 'split', 'we', 'also', 'introduce', 'and', 'study', 'dual', 'strongly', 'relative', 'split', 'objects', 'applications', 'are', 'given', 'to', 'grothendieck', 'categories', 'module', 'and', 'comodule', 'categories']]
|
[-0.11597536805578891, 0.06874351252746932, -0.043136190376518405, 0.11074151360320256, -0.11974223203929689, -0.13494118903626634, -0.030585845401647556, 0.48491744894315214, -0.35564009009805675, -0.2584445341712768, 0.08589899951338713, -0.21724223767352455, -0.11641746275948689, 0.13704113721135347, -0.18844028795138001, -0.09156223381561336, 0.08086209520286716, 0.07023052558960284, -0.11134899388108511, -0.2799635682022199, 0.4235246023711036, -0.0216368241372573, 0.25423394670874316, -0.038004572859362644, 0.12495701581321876, 0.009724573786918293, -0.10520759750815, 0.09026562577277861, -0.1518514101010035, 0.20805801024578294, 0.2800340931314756, 0.05604183927318766, 0.16161019179066094, -0.3342893546556725, -0.0177480605951346, 0.1983997874400195, 0.07950458342812079, 0.030955517746727255, 0.010651656029307666, -0.31625478903708215, 0.18211264385429196, -0.2517531207156614, -0.04813149878892171, -0.11577008157858953, 0.07158056882155292, 0.10148405185763669, -0.20335181655964868, -0.04073292218698257, 0.023634259002231855, 0.07822267416700282, -0.11502970157958128, -0.05431016092188656, -0.002517221755731632, 0.13959779132239739, 0.013551596209735554, -0.02909101709476946, 0.11629828134113375, -0.12638156213934587, -0.16623237364761093, 0.3851043410900542, -0.052178332508500555, -0.21404181012664647, 0.300053948577603, -0.1205140747513403, -0.11251725249595064, 0.09239801708334948, 0.11657559243030846, 0.212349732817315, -0.049272298607427406, 0.0869757116161054, -0.09776298352859586, 0.08432116144617527, 0.07579558671397321, 0.12573960009852753, 0.23369749652449492, 0.049812612815431374, 0.04905697590370169, 0.2441518817042165, -0.008179061317230877, -0.07730496444684617, -0.3374608605004409, -0.19677687036934965, -0.009403453751206946, 0.03149303744601853, -0.04126277402653667, -0.16615678170038498, 0.4115449453923194, 0.11460459604859352, 0.24676869939738774, 0.145017794223831, 0.2211740441236864, 0.06766565371414318, 0.056808981328846556, 0.02866711008006378, 0.13413291583385537, 0.23981292896411, -0.04236719780601561, -0.1424918012583957, -0.05125679451670936, 0.18083650911884272]
|
1,803.05061
|
Theory of nonreciprocal spin waves excitation in spin-Hall oscillators
with Dzyaloshinkii-Moriya interaction
|
A two-dimensional analytical model for the description of the excitation of
nonreciprocal spin waves by spin current in spin-Hall oscillators in the
presence of the interfacial Dzyaloshinskii-Moriya interaction (i-DMI) is
developed. The theory allows one to calculate the threshold current for the
excitation of spin waves, as well as the frequencies and spatial profiles of
the excited spin wave modes. It is found, that the frequency of the excited
spin waves exhibits a quadratic red shift with the i-DMI strength. At the same
time, in the range of small and moderate values of the i-DMI constant, the
averaged wave number of the excited spin waves is almost independent of the
i-DMI, which results in a rather weak dependence on the i-DMI of the threshold
current of the spin wave excitation. The obtained analytical results are
confirmed by the results of micromagnetic simulations.
|
cond-mat.mes-hall cond-mat.mtrl-sci
|
a twodimensional analytical model for the description of the excitation of nonreciprocal spin waves by spin current in spinhall oscillators in the presence of the interfacial dzyaloshinskiimoriya interaction idmi is developed the theory allows one to calculate the threshold current for the excitation of spin waves as well as the frequencies and spatial profiles of the excited spin wave modes it is found that the frequency of the excited spin waves exhibits a quadratic red shift with the idmi strength at the same time in the range of small and moderate values of the idmi constant the averaged wave number of the excited spin waves is almost independent of the idmi which results in a rather weak dependence on the idmi of the threshold current of the spin wave excitation the obtained analytical results are confirmed by the results of micromagnetic simulations
|
[['a', 'twodimensional', 'analytical', 'model', 'for', 'the', 'description', 'of', 'the', 'excitation', 'of', 'nonreciprocal', 'spin', 'waves', 'by', 'spin', 'current', 'in', 'spinhall', 'oscillators', 'in', 'the', 'presence', 'of', 'the', 'interfacial', 'dzyaloshinskiimoriya', 'interaction', 'idmi', 'is', 'developed', 'the', 'theory', 'allows', 'one', 'to', 'calculate', 'the', 'threshold', 'current', 'for', 'the', 'excitation', 'of', 'spin', 'waves', 'as', 'well', 'as', 'the', 'frequencies', 'and', 'spatial', 'profiles', 'of', 'the', 'excited', 'spin', 'wave', 'modes', 'it', 'is', 'found', 'that', 'the', 'frequency', 'of', 'the', 'excited', 'spin', 'waves', 'exhibits', 'a', 'quadratic', 'red', 'shift', 'with', 'the', 'idmi', 'strength', 'at', 'the', 'same', 'time', 'in', 'the', 'range', 'of', 'small', 'and', 'moderate', 'values', 'of', 'the', 'idmi', 'constant', 'the', 'averaged', 'wave', 'number', 'of', 'the', 'excited', 'spin', 'waves', 'is', 'almost', 'independent', 'of', 'the', 'idmi', 'which', 'results', 'in', 'a', 'rather', 'weak', 'dependence', 'on', 'the', 'idmi', 'of', 'the', 'threshold', 'current', 'of', 'the', 'spin', 'wave', 'excitation', 'the', 'obtained', 'analytical', 'results', 'are', 'confirmed', 'by', 'the', 'results', 'of', 'micromagnetic', 'simulations']]
|
[-0.22613640356166156, 0.21422380057793164, -0.015409084578031595, 0.017388736781611725, -0.041763073646686445, -0.048380131429900795, 0.0015808413925082227, 0.33867076308217264, -0.23247505021019196, -0.28487049656408564, 0.027211698905145094, -0.271339947694005, -0.10115906228901635, 0.22952748194802552, 0.1433233916415164, 0.02398414712886631, -0.010037009487859905, 0.03373404101035755, -0.03911623229357925, -0.1244084416875537, 0.29758195793846437, 0.04326575686564853, 0.30054600652254804, 0.08726428137947871, 0.07630240895562398, 0.029326468673337932, 0.05183485850796733, -0.007607167888380272, -0.15341317409209448, 0.04703547458597262, 0.23784935413769603, -0.03916242808431697, 0.19815174136704333, -0.4438557918413057, -0.21273533555246155, 0.0027507561157313243, 0.13691237051708913, 0.21994342697164515, -0.028977568790113265, -0.2918550838572039, 0.02623191072923643, -0.15886400960726846, -0.19208311554434723, -0.021446544755722434, 0.050223723152311335, 0.05870583303220255, -0.2640827554573213, 0.1362515736213872, 0.0839794095774496, 0.03759337242194254, -0.09953561428857272, -0.11660014033238862, -0.11870759044459063, 0.07502951746245741, 0.10521675546040339, 0.033341589498556624, 0.1319135044157033, -0.1492811443618643, -0.12884105651140948, 0.32475395372111193, -0.12857601478774572, -0.17157473285275865, 0.15772363736661493, -0.19817745394129174, -0.021212610110319153, 0.166439668227866, 0.12683334072369715, 0.09868395073391811, -0.08500916403505138, 0.054222724950564107, -0.013863509202488324, 0.17840433267640396, 0.08549445309236803, 0.05755097888947897, 0.2374337897308066, 0.15637952369362326, 0.04432875960147087, 0.12314218308278163, -0.14204562101086837, -0.0625957605743807, -0.25127787158732684, -0.08904540779488818, -0.24346429854631424, 0.03362064979305166, -0.09669106481838677, -0.1608138679900587, 0.48396577673610036, 0.14618261479510283, 0.13920815984889026, 0.0446847219776008, 0.2908873844098195, 0.19327038385360962, 0.05706448102874918, 0.01993466853032964, 0.3373035962535987, 0.21877028716032879, 0.10807944530896632, -0.33807156244161685, 0.05641275243899247, -0.03336062891618677]
|
1,803.05062
|
On the magnitude homology of metric spaces
|
Magnitude homology of enriched categories, and in particular of metric
spaces, was recently introduced by T. Leinster and M. Shulman. In this article,
we prove that metric spaces satisfying a reasonably mild condition have
vanishing magnitude homology groups in nonzero degrees.
|
math.MG math.AG
|
magnitude homology of enriched categories and in particular of metric spaces was recently introduced by t leinster and m shulman in this article we prove that metric spaces satisfying a reasonably mild condition have vanishing magnitude homology groups in nonzero degrees
|
[['magnitude', 'homology', 'of', 'enriched', 'categories', 'and', 'in', 'particular', 'of', 'metric', 'spaces', 'was', 'recently', 'introduced', 'by', 't', 'leinster', 'and', 'm', 'shulman', 'in', 'this', 'article', 'we', 'prove', 'that', 'metric', 'spaces', 'satisfying', 'a', 'reasonably', 'mild', 'condition', 'have', 'vanishing', 'magnitude', 'homology', 'groups', 'in', 'nonzero', 'degrees']]
|
[-0.21786571623439469, 0.14948543316752808, -0.09480408243494244, 0.09513873687275208, -0.049603941123478296, -0.11397375310657591, -0.015455054914260783, 0.36281773457076494, -0.25007031235571314, -0.28984539260769765, 0.0731656710622923, -0.20619440260456828, -0.16699487636456403, 0.09565858476477243, -0.2346173561428015, -0.04211025866793423, 0.06477607221047325, 0.0745077016990541, -0.12441571544651396, -0.36090497009274436, 0.46698312697614114, -0.0008553709017067421, 0.22071883082389832, 0.055726675293976215, 0.14943343411177035, -0.05017572710653994, -0.06285674965417967, 0.1085577801085736, -0.22576777162914102, 0.0852346560213624, 0.28871984784377785, -0.004200138498052228, 0.21722078773124917, -0.30141893081457877, -0.17251839426987828, 0.20335625971826474, 0.064747068031532, -0.04624544391862866, -0.029307917197711947, -0.33844361397460465, 0.17382630276516442, -0.23593457838202395, -0.11978888810362394, -0.11024102432335295, 0.1266886716844832, 0.009145492437954357, -0.22064852798584758, 0.0198560593899612, 0.10707533561692732, 0.129231770954481, -0.09510483801728342, -0.10249884541305464, -0.034542882178978225, 0.05906027548651143, 0.04673747597943719, 0.10023282727272045, 0.04805883287066003, -0.058239060743689175, -0.11993563463684262, 0.29583449575414017, -0.11760723300096465, -0.19160684797821975, 0.10905074373614497, -0.1721785820086441, -0.2164052215223087, 0.098003868274845, 0.014880746784733563, 0.1867486477216206, -0.07886616340497644, 0.21891799775554185, -0.09388713749897916, 0.05990527320380618, 0.19289005032127224, 0.04530849745042804, 0.05286288322744573, 0.09605664218685067, 0.13687073948747683, 0.1307392016325782, 0.038518677090817105, -0.03300793458446406, -0.2835460145753331, -0.20501922707005246, -0.08860048530169012, 0.10828613380265491, -0.11763209968779759, -0.13116869726218283, 0.3350978306971672, 0.07822181425261789, 0.1610870015603013, 0.13403273280709982, 0.21958583911948995, 0.015865846446192846, 0.07429107841922016, 0.03759973741522649, 0.17651942908400442, 0.26710201132610983, 0.060381531897114545, -0.03491710185459474, 0.045986664708612894, 0.2599403321879303]
|
1,803.05063
|
Geometry of horospherical varieties of Picard rank one
|
We study the geometry of non-homogeneous horospherical varieties. These have
been classified by Pasquier and include the well-known odd symplectic
Grassmannians. We focus our study on quantum cohomology, with a view towards
Dubrovin's conjecture. In particular, we describe the cohomology groups of
these varieties as well as a Chevalley formula, and prove that many
Gromov-Witten invariants are enumerative. This enables us to prove that in many
cases the quantum cohomology is semisimple. We give a presentation of the
quantum cohomology ring for odd symplectic Grassmannians. The final section is
devoted to the derived categories of coherent sheaves on horospherical
varieties. We first discuss a general construction of exceptional bundles on
these varieties. We then study in detail the case of the horospherical variety
associated to the exceptional group $G_2$, and construct a full rectangular
Lefschetz exceptional collection in the derived category.
|
math.AG math.RT
|
we study the geometry of nonhomogeneous horospherical varieties these have been classified by pasquier and include the wellknown odd symplectic grassmannians we focus our study on quantum cohomology with a view towards dubrovins conjecture in particular we describe the cohomology groups of these varieties as well as a chevalley formula and prove that many gromovwitten invariants are enumerative this enables us to prove that in many cases the quantum cohomology is semisimple we give a presentation of the quantum cohomology ring for odd symplectic grassmannians the final section is devoted to the derived categories of coherent sheaves on horospherical varieties we first discuss a general construction of exceptional bundles on these varieties we then study in detail the case of the horospherical variety associated to the exceptional group g_2 and construct a full rectangular lefschetz exceptional collection in the derived category
|
[['we', 'study', 'the', 'geometry', 'of', 'nonhomogeneous', 'horospherical', 'varieties', 'these', 'have', 'been', 'classified', 'by', 'pasquier', 'and', 'include', 'the', 'wellknown', 'odd', 'symplectic', 'grassmannians', 'we', 'focus', 'our', 'study', 'on', 'quantum', 'cohomology', 'with', 'a', 'view', 'towards', 'dubrovins', 'conjecture', 'in', 'particular', 'we', 'describe', 'the', 'cohomology', 'groups', 'of', 'these', 'varieties', 'as', 'well', 'as', 'a', 'chevalley', 'formula', 'and', 'prove', 'that', 'many', 'gromovwitten', 'invariants', 'are', 'enumerative', 'this', 'enables', 'us', 'to', 'prove', 'that', 'in', 'many', 'cases', 'the', 'quantum', 'cohomology', 'is', 'semisimple', 'we', 'give', 'a', 'presentation', 'of', 'the', 'quantum', 'cohomology', 'ring', 'for', 'odd', 'symplectic', 'grassmannians', 'the', 'final', 'section', 'is', 'devoted', 'to', 'the', 'derived', 'categories', 'of', 'coherent', 'sheaves', 'on', 'horospherical', 'varieties', 'we', 'first', 'discuss', 'a', 'general', 'construction', 'of', 'exceptional', 'bundles', 'on', 'these', 'varieties', 'we', 'then', 'study', 'in', 'detail', 'the', 'case', 'of', 'the', 'horospherical', 'variety', 'associated', 'to', 'the', 'exceptional', 'group', 'g_2', 'and', 'construct', 'a', 'full', 'rectangular', 'lefschetz', 'exceptional', 'collection', 'in', 'the', 'derived', 'category']]
|
[-0.21575997559789648, -0.01133135025404354, -0.10382349524277111, 0.11158251790544481, -0.08691580121319556, -0.14235685567919773, -0.04739761139028408, 0.3392509656912046, -0.29682777438590185, -0.2006617869772281, 0.10889310628862668, -0.195567575691215, -0.1847675346954336, 0.22126236441710317, -0.20898260896095228, -0.033169944935762294, 0.05656023195066245, 0.0739365736260376, -0.09503865978145536, -0.3290372954694726, 0.4785473206813665, -0.06738098164118747, 0.2549540126161214, 0.07154178566874024, 0.09210330847954602, 0.033394568361976046, -0.0287821371874488, -0.05624477875142423, -0.15516162109992662, 0.15884475995198633, 0.3717693538530499, 0.029894713363577182, 0.12492657969425043, -0.3981726552683411, -0.10764009532900956, 0.19568949476122222, 0.14886734809033764, 0.09642378887795705, -0.014017766112864599, -0.29861093575550995, 0.0851509259247505, -0.19761594080907816, -0.20066356512632036, -0.1322163401488611, 0.049468040776749454, 0.04010147097560161, -0.13952426408939328, -0.062196124236079606, 0.08389667574240305, 0.1618151859857525, -0.05471642990431464, -0.09944212567705185, -0.04722443579180919, 0.07787124908047048, -0.020189581547883598, -0.010482276898828592, 0.10161886619839897, -0.10020413576519606, -0.16237528052293293, 0.40538611219442905, -0.008523545802590694, -0.20330521384756087, 0.11726201533386153, -0.18014044797787745, -0.23276914097698972, 0.11692834884037283, 0.10242376044055725, 0.1850033508075388, 0.026039508666763914, 0.17202777588444412, -0.15700393234518298, -0.022828164551710935, 0.09475900608128109, -0.0072340163421249085, 0.14367073364159527, 0.09001849046974371, 0.018695020800702445, 0.1588176127741153, -0.007802586327554618, -0.07403068118299364, -0.37195998947020514, -0.23370005780973815, -0.053946558338200265, 0.21069335376064405, -0.09101344112949594, -0.16453322718342675, 0.42767338596073023, 0.07874673618835971, 0.17790159290484714, 0.14257837650993616, 0.22839906822942885, 0.023804524460153534, 0.023769064202032824, -0.012257287750212172, 0.15395059669720576, 0.28824780733615213, -0.03420827108772194, -0.11748717508959115, -0.08378820413895322, 0.2393333090878759]
|
1,803.05064
|
Non-virtually nilpotent groups have infinite conjugacy class quotients
|
We offer in this note a self-contained proof of the fact that a finitely
generated group is not virtually nilpotent if and only if it has a quotient
with the infinite conjugacy class (ICC) propoerty. This proof is a modern
presentation of the original proof, by McLain (1956) and Duguid and McLain
(1956).
|
math.GR
|
we offer in this note a selfcontained proof of the fact that a finitely generated group is not virtually nilpotent if and only if it has a quotient with the infinite conjugacy class icc propoerty this proof is a modern presentation of the original proof by mclain 1956 and duguid and mclain 1956
|
[['we', 'offer', 'in', 'this', 'note', 'a', 'selfcontained', 'proof', 'of', 'the', 'fact', 'that', 'a', 'finitely', 'generated', 'group', 'is', 'not', 'virtually', 'nilpotent', 'if', 'and', 'only', 'if', 'it', 'has', 'a', 'quotient', 'with', 'the', 'infinite', 'conjugacy', 'class', 'icc', 'propoerty', 'this', 'proof', 'is', 'a', 'modern', 'presentation', 'of', 'the', 'original', 'proof', 'by', 'mclain', '1956', 'and', 'duguid', 'and', 'mclain', '1956']]
|
[-0.09655667534645866, 0.10656895819028803, -0.17602218442833892, 0.013272131501021339, -0.1394692977306013, -0.14583657444546036, 0.026202056356066584, 0.30999211835510593, -0.31488365154055986, -0.23508201313077234, 0.16014130498675228, -0.24536817864167923, -0.16226812826433018, 0.21807594845692316, -0.17935786405395643, -0.1128062440411133, 0.11452004912437178, 0.07274710777781758, -0.03608896544513603, -0.30667542593151914, 0.3008999506961189, -0.02637476937881872, 0.2240966679163131, 0.09699454827818509, 0.16547936984216885, 0.028702624671745534, -0.06119230274549302, -0.012820167752329772, -0.10493621088215721, 0.11645913429046963, 0.29165745101978674, 0.0938492325196207, 0.30983845386471526, -0.2840047896492715, -0.1308353061367776, 0.19892779367008045, 0.14310477966187046, 0.08427231934140711, -0.10585404771800135, -0.2500447426721746, 0.1490094418838328, -0.23350057411281502, -0.12612315292890167, -0.008135895043903706, 0.1156234259844995, -0.0395159364550137, -0.18716881928198478, 0.003916624440428089, 0.21885368326569304, 0.13592566452993482, 0.01582388413668263, -0.035927087218356864, -0.0005370955092503744, 0.051326030171385, 0.031163324665862555, 0.0276757947388379, 0.042973728010467456, -0.017368765136993983, -0.07518347202772822, 0.3957291700530286, -0.022882527283703286, -0.1957606839417827, 0.17595997529433055, -0.13530886922871657, -0.18699155581713306, 0.12235720068508503, 0.01957750911185262, 0.13661287699406052, -0.10014326948964712, 0.21608463504611897, -0.20813617378692417, 0.14696301708874457, 0.08657730578937951, -0.028485517063196384, 0.09239291315715686, 0.11458968852678605, 0.06575607499290331, 0.09119959570029203, 0.11379983991512335, 0.024746430234289636, -0.38124271029350804, -0.22646382395360692, -0.19837492390298375, 0.152001322525857, 0.00527783528092436, -0.20366914340240114, 0.39033636469028743, 0.0803908453797739, 0.06805230503646183, 0.13374565496091165, 0.265225018465928, 0.07680151876354334, 0.07031833092275751, 0.1332770315017186, 0.1444892244157838, 0.17539412839173832, 0.0019899914041161537, -0.07503923214058958, 0.035054004897235654, 0.22293916390295707]
|
1,803.05065
|
Surface and Temporal Biosignatures
|
Recent discoveries of potentially habitable exoplanets have ignited the
prospect of spectroscopic investigations of exoplanet surfaces and atmospheres
for signs of life. This chapter provides an overview of potential surface and
temporal exoplanet biosignatures, reviewing Earth analogues and proposed
applications based on observations and models. The vegetation red-edge (VRE)
remains the most well-studied surface biosignature. Extensions of the VRE,
spectral "edges" produced in part by photosynthetic or nonphotosynthetic
pigments, may likewise present potential evidence of life. Polarization
signatures have the capacity to discriminate between biotic and abiotic "edge"
features in the face of false positives from band-gap generating material.
Temporal biosignatures -- modulations in measurable quantities such as gas
abundances (e.g., CO2), surface features, or emission of light (e.g.,
fluorescence, bioluminescence) that can be directly linked to the actions of a
biosphere -- are in general less well studied than surface or gaseous
biosignatures. However, remote observations of Earth's biosphere nonetheless
provide proofs of concept for these techniques and are reviewed here. Surface
and temporal biosignatures provide complementary information to gaseous
biosignatures, and while likely more challenging to observe, would contribute
information inaccessible from study of the time-averaged atmospheric
composition alone.
|
astro-ph.EP
|
recent discoveries of potentially habitable exoplanets have ignited the prospect of spectroscopic investigations of exoplanet surfaces and atmospheres for signs of life this chapter provides an overview of potential surface and temporal exoplanet biosignatures reviewing earth analogues and proposed applications based on observations and models the vegetation rededge vre remains the most wellstudied surface biosignature extensions of the vre spectral edges produced in part by photosynthetic or nonphotosynthetic pigments may likewise present potential evidence of life polarization signatures have the capacity to discriminate between biotic and abiotic edge features in the face of false positives from bandgap generating material temporal biosignatures modulations in measurable quantities such as gas abundances eg co2 surface features or emission of light eg fluorescence bioluminescence that can be directly linked to the actions of a biosphere are in general less well studied than surface or gaseous biosignatures however remote observations of earths biosphere nonetheless provide proofs of concept for these techniques and are reviewed here surface and temporal biosignatures provide complementary information to gaseous biosignatures and while likely more challenging to observe would contribute information inaccessible from study of the timeaveraged atmospheric composition alone
|
[['recent', 'discoveries', 'of', 'potentially', 'habitable', 'exoplanets', 'have', 'ignited', 'the', 'prospect', 'of', 'spectroscopic', 'investigations', 'of', 'exoplanet', 'surfaces', 'and', 'atmospheres', 'for', 'signs', 'of', 'life', 'this', 'chapter', 'provides', 'an', 'overview', 'of', 'potential', 'surface', 'and', 'temporal', 'exoplanet', 'biosignatures', 'reviewing', 'earth', 'analogues', 'and', 'proposed', 'applications', 'based', 'on', 'observations', 'and', 'models', 'the', 'vegetation', 'rededge', 'vre', 'remains', 'the', 'most', 'wellstudied', 'surface', 'biosignature', 'extensions', 'of', 'the', 'vre', 'spectral', 'edges', 'produced', 'in', 'part', 'by', 'photosynthetic', 'or', 'nonphotosynthetic', 'pigments', 'may', 'likewise', 'present', 'potential', 'evidence', 'of', 'life', 'polarization', 'signatures', 'have', 'the', 'capacity', 'to', 'discriminate', 'between', 'biotic', 'and', 'abiotic', 'edge', 'features', 'in', 'the', 'face', 'of', 'false', 'positives', 'from', 'bandgap', 'generating', 'material', 'temporal', 'biosignatures', 'modulations', 'in', 'measurable', 'quantities', 'such', 'as', 'gas', 'abundances', 'eg', 'co2', 'surface', 'features', 'or', 'emission', 'of', 'light', 'eg', 'fluorescence', 'bioluminescence', 'that', 'can', 'be', 'directly', 'linked', 'to', 'the', 'actions', 'of', 'a', 'biosphere', 'are', 'in', 'general', 'less', 'well', 'studied', 'than', 'surface', 'or', 'gaseous', 'biosignatures', 'however', 'remote', 'observations', 'of', 'earths', 'biosphere', 'nonetheless', 'provide', 'proofs', 'of', 'concept', 'for', 'these', 'techniques', 'and', 'are', 'reviewed', 'here', 'surface', 'and', 'temporal', 'biosignatures', 'provide', 'complementary', 'information', 'to', 'gaseous', 'biosignatures', 'and', 'while', 'likely', 'more', 'challenging', 'to', 'observe', 'would', 'contribute', 'information', 'inaccessible', 'from', 'study', 'of', 'the', 'timeaveraged', 'atmospheric', 'composition', 'alone']]
|
[-0.056208808095780785, 0.16042624120595902, -0.04466026397077022, 0.09408683328527129, -0.09967095810037954, -0.10604322015766114, 0.05251140003345128, 0.36607406365749223, -0.20656519450269462, -0.3480771045106902, 0.13121324085948308, -0.312765922318533, -0.18397215124658214, 0.21641625822509428, -0.10011649137072108, 0.025347164697161625, 0.09672091727110523, -0.045419653688826, 0.009506447198825381, -0.22114510022143208, 0.27604963951965883, 0.08145748846548259, 0.14321431650647096, 0.10646336803227545, 0.004199972331878685, -0.05831653537492332, -0.09513364323764724, -0.06252889449476565, -0.13496553305205894, 0.14922104028955416, 0.3047305041903215, 0.19281554477604687, 0.1988862250839476, -0.469625749928315, -0.3269180677518268, 0.11466480422981833, 0.11210216800408147, 0.061816921392357144, -0.09172257055411738, -0.28608604955176514, 0.018277707876189164, -0.130591457790976, -0.15051533137669876, -0.057461427397183365, 0.04948878335882294, -0.0070910727418589566, -0.20622816835357635, 0.06397421504543335, 0.05407619442225301, 0.17629903468344035, -0.13571687126852494, -0.15867129988936343, -0.08794104154024608, 0.1314942147102325, 0.036597690479731354, -0.03927353888296734, 0.2192280934680076, -0.1462405140760537, -0.08670173598965876, 0.4191062802833224, -0.11033487763594917, -0.06353451495512177, 0.27974383943103176, -0.1805659943831858, -0.11663633821748946, 0.15591574701660427, 0.18320248376703746, 0.13544314787797038, -0.17275881089969838, -0.018646422700917042, 0.028349011892541534, 0.15538516314453865, 0.10192752931089628, 0.1472771438987428, 0.38600700716217046, 0.17458591742007426, 0.07843626180365583, 0.05350391570633898, -0.16895128869717674, -0.005451841080295188, -0.16875637521555834, -0.20442741990049995, -0.155839318424345, 0.015047541833679788, -0.013349311598133119, -0.15970827481049119, 0.3837893786224187, 0.17696315888130654, 0.11709631362772256, -0.01893217504891769, 0.30171227633519465, 0.006468451423595152, 0.08192724878308437, 0.005924411087848798, 0.24138538385975475, 0.10754602256036369, 0.07837729903908752, -0.1987060295613778, 0.1654630403050404, -0.027421398487474238]
|
1,803.05066
|
Discussion on Bayesian Cluster Analysis: Point Estimation and Credible
Balls by Sara Wade and Zoubin Ghahramani
|
I begin my discussion by giving an overview of the main results. Then I
proceed to touch upon issues about whether the credible ball constructed can be
interpreted as a confidence ball, suggestions on reducing computational costs,
and posterior consistency or contraction rates.
|
stat.ME
|
i begin my discussion by giving an overview of the main results then i proceed to touch upon issues about whether the credible ball constructed can be interpreted as a confidence ball suggestions on reducing computational costs and posterior consistency or contraction rates
|
[['i', 'begin', 'my', 'discussion', 'by', 'giving', 'an', 'overview', 'of', 'the', 'main', 'results', 'then', 'i', 'proceed', 'to', 'touch', 'upon', 'issues', 'about', 'whether', 'the', 'credible', 'ball', 'constructed', 'can', 'be', 'interpreted', 'as', 'a', 'confidence', 'ball', 'suggestions', 'on', 'reducing', 'computational', 'costs', 'and', 'posterior', 'consistency', 'or', 'contraction', 'rates']]
|
[-0.038625985551842074, 0.09136475646783067, -0.050292804956349524, 0.10500753200937842, -0.14179100013922813, -0.1361882366608222, 0.16448371840077777, 0.3819236661805663, -0.24477769118235554, -0.28113824616424565, 0.20084325605353645, -0.26604036326238584, -0.06082331296597976, 0.16031581413563947, -0.19051634262554173, -0.00018353989012106212, 0.09681552544582722, 0.024652837266669024, -0.07380614323584839, -0.3275230869131033, 0.29287623889137837, 0.15907817050208187, 0.21988349366759838, 0.07858609781752146, 0.02667797255048225, -0.01119933049952568, -0.09207051351319911, 0.0161562561122484, -0.22317692546477153, 0.12015224932043185, 0.24948688466535057, 0.2664917169658597, 0.35587193998833033, -0.47606725003137146, -0.15668549315346036, 0.010511071876037953, 0.16054947074329437, 0.04439765103377922, -0.04730320085370696, -0.33898194771541584, 0.021432799547044343, -0.16434318566732758, -0.15103885142652448, -0.058047733951879794, 0.0005325763811205709, 0.0017638523456488932, -0.2064857962866162, 0.03415902660683144, 0.1328692590427953, 0.04506566080394699, -0.04848545891514351, -0.1835004062240207, 0.005073558885690777, 0.10261501252196382, 0.10356126686688079, 0.06082800528451497, 0.16345906734120014, -0.08547744822016982, -0.13774303769216287, 0.31679274975647065, -0.0021425177841339, -0.19319746296766194, 0.16212905884915313, -0.07585137210743026, -0.11865838149259257, 0.07488838186877411, 0.16874678604044888, 0.04750391695821701, -0.1340437576304688, 0.051347540668482614, 0.059083817653942765, 0.14145380471898025, 0.10128725380745045, -0.0431107379019607, 0.2754677843632783, 0.1306753473053145, 0.05986022165175094, 0.10045721369178229, 0.01074535644959745, -0.0924280825569186, -0.3978219604076341, -0.14120482969595943, -0.14322410008415234, 0.06808384352493597, -0.08498799882058954, -0.08284332046588493, 0.35051316217800904, 0.16781903711299218, 0.2700899928756773, 0.08075837537559659, 0.24367299840547318, 0.09117532750797393, -0.03361273734819491, 0.04713442950877686, 0.17489938814799452, 0.06767763532589861, 0.0026111852399311785, -0.13161885394135403, 0.0729320909026577, 0.06896499203258129]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.