id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0696 | Agile Amulet: Real-Time Salient Object Detection with Contextual
Attention | This paper proposes an Agile Aggregating Multi-Level feaTure framework (Agile
Amulet) for salient object detection. The Agile Amulet builds on previous works
to predict saliency maps using multi-level convolutional features. Compared to
previous works, Agile Amulet employs some key innovations to improve training
and testing speed while also increase prediction accuracy. More specifically,
we first introduce a contextual attention module that can rapidly highlight
most salient objects or regions with contextual pyramids. Thus, it effectively
guides the learning of low-layer convolutional features and tells the backbone
network where to look. The contextual attention module is a fully convolutional
mechanism that simultaneously learns complementary features and predicts
saliency scores at each pixel. In addition, we propose a novel method to
aggregate multi-level deep convolutional features. As a result, we are able to
use the integrated side-output features of pre-trained convolutional networks
alone, which significantly reduces the model parameters leading to a model size
of 67 MB, about half of Amulet. Compared to other deep learning based saliency
methods, Agile Amulet is of much lighter-weight, runs faster (30 fps in
real-time) and achieves higher performance on seven public benchmarks in terms
of both quantitative and qualitative evaluation.
| cs.CV | this paper proposes an agile aggregating multilevel feature framework agile amulet for salient object detection the agile amulet builds on previous works to predict saliency maps using multilevel convolutional features compared to previous works agile amulet employs some key innovations to improve training and testing speed while also increase prediction accuracy more specifically we first introduce a contextual attention module that can rapidly highlight most salient objects or regions with contextual pyramids thus it effectively guides the learning of lowlayer convolutional features and tells the backbone network where to look the contextual attention module is a fully convolutional mechanism that simultaneously learns complementary features and predicts saliency scores at each pixel in addition we propose a novel method to aggregate multilevel deep convolutional features as a result we are able to use the integrated sideoutput features of pretrained convolutional networks alone which significantly reduces the model parameters leading to a model size of 67 mb about half of amulet compared to other deep learning based saliency methods agile amulet is of much lighterweight runs faster 30 fps in realtime and achieves higher performance on seven public benchmarks in terms of both quantitative and qualitative evaluation | [['this', 'paper', 'proposes', 'an', 'agile', 'aggregating', 'multilevel', 'feature', 'framework', 'agile', 'amulet', 'for', 'salient', 'object', 'detection', 'the', 'agile', 'amulet', 'builds', 'on', 'previous', 'works', 'to', 'predict', 'saliency', 'maps', 'using', 'multilevel', 'convolutional', 'features', 'compared', 'to', 'previous', 'works', 'agile', 'amulet', 'employs', 'some', 'key', 'innovations', 'to', 'improve', 'training', 'and', 'testing', 'speed', 'while', 'also', 'increase', 'prediction', 'accuracy', 'more', 'specifically', 'we', 'first', 'introduce', 'a', 'contextual', 'attention', 'module', 'that', 'can', 'rapidly', 'highlight', 'most', 'salient', 'objects', 'or', 'regions', 'with', 'contextual', 'pyramids', 'thus', 'it', 'effectively', 'guides', 'the', 'learning', 'of', 'lowlayer', 'convolutional', 'features', 'and', 'tells', 'the', 'backbone', 'network', 'where', 'to', 'look', 'the', 'contextual', 'attention', 'module', 'is', 'a', 'fully', 'convolutional', 'mechanism', 'that', 'simultaneously', 'learns', 'complementary', 'features', 'and', 'predicts', 'saliency', 'scores', 'at', 'each', 'pixel', 'in', 'addition', 'we', 'propose', 'a', 'novel', 'method', 'to', 'aggregate', 'multilevel', 'deep', 'convolutional', 'features', 'as', 'a', 'result', 'we', 'are', 'able', 'to', 'use', 'the', 'integrated', 'sideoutput', 'features', 'of', 'pretrained', 'convolutional', 'networks', 'alone', 'which', 'significantly', 'reduces', 'the', 'model', 'parameters', 'leading', 'to', 'a', 'model', 'size', 'of', '67', 'mb', 'about', 'half', 'of', 'amulet', 'compared', 'to', 'other', 'deep', 'learning', 'based', 'saliency', 'methods', 'agile', 'amulet', 'is', 'of', 'much', 'lighterweight', 'runs', 'faster', '30', 'fps', 'in', 'realtime', 'and', 'achieves', 'higher', 'performance', 'on', 'seven', 'public', 'benchmarks', 'in', 'terms', 'of', 'both', 'quantitative', 'and', 'qualitative', 'evaluation']] | [-0.008319415077063035, -0.021451296586559525, -0.07085858506616205, 0.06350066621917463, -0.13663258009047738, -0.21162860147107737, 0.01823548693629942, 0.479366952025322, -0.23697274828572115, -0.3231278502876803, 0.03564791305749149, -0.28248072215884, -0.20472757724118562, 0.1651743484850608, -0.1476267628952592, 0.08974556553780015, 0.12817705351650505, 0.041085661354129076, -0.07367636058533554, -0.2732601839318132, 0.28096655801241044, 0.12277326903026312, 0.3544900859706104, 0.0030646750405814846, 0.1429069184952598, -0.04466891915389797, -0.07581777765281192, -0.04366015025340117, -0.04958826550512068, 0.22023263920552202, 0.31806565801128167, 0.17956677201136792, 0.3376477069579084, -0.40752709161528605, -0.24939259773866781, 0.029217445906059642, 0.1539849803201523, 0.08699012319581371, 0.00948058751784685, -0.36799486853859203, 0.09292150536172822, -0.2044820878234663, 0.02808070143555128, -0.1405458310090927, -0.03914904268698517, -0.030630747103864403, -0.26581141998338487, 0.011017940821907407, 0.08276294338872138, 0.03554682128164994, -0.04458244849589279, -0.10817136280010599, 0.021940386621281505, 0.15599841851448237, -0.007601285690547342, 0.08479299848435984, 0.16449358657340893, -0.20085503104906144, -0.16093359618794567, 0.3210525515047622, -0.07516953852459711, -0.15412723611243376, 0.19893539268835495, -0.03511138954295863, -0.1755191064271692, 0.13509758559449278, 0.2254264266512203, 0.10515328394891166, -0.1487571487260848, -0.05209699334347496, -0.022505081513147687, 0.23124945931347837, 0.034448931524146, 0.007758667087662466, 0.16569738631189523, 0.29380092725455376, 0.035968291143569905, 0.13601932258341587, -0.18689006271522454, -0.09802336335427023, -0.1882368056565648, -0.11504439693592373, -0.10715921563318374, -0.07358738233469733, -0.09928847454719608, -0.10738324893868922, 0.457038553954899, 0.26551673838091033, 0.2495374728711898, 0.13453333659071148, 0.3428774904747753, 0.008369340344701806, 0.16406089768831417, 0.13102758841195442, 0.1958561108680742, -0.016431562064849223, 0.1299851871561859, -0.10758209946930178, 0.0984089101938358, 0.09763572790006478] |
1,802.06961 | On classification of (n+5)-dimensional nilpotent n-Lie algebra of class
two | In this paper, we classify (n+5)-dimensional nilpotent n-Lie algebras of
class two over the arbitrary field, when $n\ge 3$.
| math.RA math.GR | in this paper we classify n5dimensional nilpotent nlie algebras of class two over the arbitrary field when nge 3 | [['in', 'this', 'paper', 'we', 'classify', 'n5dimensional', 'nilpotent', 'nlie', 'algebras', 'of', 'class', 'two', 'over', 'the', 'arbitrary', 'field', 'when', 'nge', '3']] | [-0.2003757607502242, 0.11295293990729584, 0.0750116566196084, -0.003141373014336245, -0.08181477607124382, -0.18840396694011158, -0.14776735736652175, 0.4213329172796673, -0.3213728724254502, -0.23175134965115124, 0.15523382062221774, -0.20341135871907076, -0.16789539973251522, 0.15188545464641517, -0.14974887762218714, -0.12320258809874456, -0.0018989578303363589, 0.1629164076099793, -0.13714045907060304, -0.3763454622692532, 0.5385768339037895, -0.19973929745093402, 0.15430949307564232, -0.01957989287459188, 0.1296485177655187, 0.07810747620856597, -0.0013498967616922325, 0.04400939271888799, -0.16264228289946914, 0.12188741078393327, 0.37117775219182175, 0.023592920870416693, 0.22820648447506958, -0.3297531319161256, -0.1160929799079895, 0.2826118316087458, 0.2539191960046689, 0.085198273571829, 0.02098929545091879, -0.23222862225439814, 0.14334786548796627, -0.268056967192226, -0.16921784402802587, -0.012885561937259303, 0.13169744122488838, -0.08368134953909451, -0.25308964248850113, -0.03043747688126233, 0.14516450017173257, 0.19192349036327666, -0.21430367164106834, -0.07257088186856385, 0.02453948019279374, 0.044517268499475904, -0.11145697254687548, -0.0019925159350451496, 0.03486180680596994, -0.07434215304803932, -0.17969621241920525, 0.27417084554003346, 0.001960198006903132, -0.27726486325263977, 0.10602194469215141, -0.23941262770030233, -0.23084733573098978, 0.10549830660844843, 0.14900340057081646, 0.23227781106510925, -0.09890133063971815, 0.23641767451125714, -0.08819456160482433, -0.00519885029643774, 0.13782254684095582, -0.03434465587553051, 0.09826319395667976, 0.11649945276116745, 0.02921370572100083, 0.14586549066007137, 0.040979229741626315, 0.07495474039266507, -0.3978468386663331, -0.21843404203860295, -0.03761963929153151, 0.19570942802561653, -0.11817960109975603, -0.11900287529634726, 0.49057965270347065, 0.19098847633641627, 0.10546345305111673, 0.19726277147937152, 0.15789911523461342, -0.009705366980698373, 0.04490777995023462, 0.13654518665538895, 0.08841934681145681, 0.22332764944682518, -0.019551721330369927, -0.10250180535432366, -0.17603448951720363, 0.14427092521347934] |
1,802.06962 | Laurent phenomenon algebras arising from surfaces II: Laminated surfaces | It was shown by Fock, Goncharov and Fomin, Shapiro, Thurston that some
cluster algebras arise from triangulated orientable suraces. Subsequently
Dupont and Palesi generalised this construction to include unpunctured
non-orientable surfaces, giving birth to quasi-cluster algebras. Previously we
linked this framework to Lam and Pylyavskyy's Laurent phenomenon algebras,
showing that unpunctured surfaces admit an LP structure. In this paper we
extend quasi-cluster algebras to include punctured surfaces. Moreover, by
adding laminations to the surface we demonstrate that all punctured and
unpunctured surfaces admit LP structures.
| math.CO math.GT math.RA | it was shown by fock goncharov and fomin shapiro thurston that some cluster algebras arise from triangulated orientable suraces subsequently dupont and palesi generalised this construction to include unpunctured nonorientable surfaces giving birth to quasicluster algebras previously we linked this framework to lam and pylyavskyys laurent phenomenon algebras showing that unpunctured surfaces admit an lp structure in this paper we extend quasicluster algebras to include punctured surfaces moreover by adding laminations to the surface we demonstrate that all punctured and unpunctured surfaces admit lp structures | [['it', 'was', 'shown', 'by', 'fock', 'goncharov', 'and', 'fomin', 'shapiro', 'thurston', 'that', 'some', 'cluster', 'algebras', 'arise', 'from', 'triangulated', 'orientable', 'suraces', 'subsequently', 'dupont', 'and', 'palesi', 'generalised', 'this', 'construction', 'to', 'include', 'unpunctured', 'nonorientable', 'surfaces', 'giving', 'birth', 'to', 'quasicluster', 'algebras', 'previously', 'we', 'linked', 'this', 'framework', 'to', 'lam', 'and', 'pylyavskyys', 'laurent', 'phenomenon', 'algebras', 'showing', 'that', 'unpunctured', 'surfaces', 'admit', 'an', 'lp', 'structure', 'in', 'this', 'paper', 'we', 'extend', 'quasicluster', 'algebras', 'to', 'include', 'punctured', 'surfaces', 'moreover', 'by', 'adding', 'laminations', 'to', 'the', 'surface', 'we', 'demonstrate', 'that', 'all', 'punctured', 'and', 'unpunctured', 'surfaces', 'admit', 'lp', 'structures']] | [-0.14005384499246412, 0.08575902073184752, -0.1230592653604157, 0.11900333846015967, -0.153708057876407, -0.1783193985045136, -0.031907873871983086, 0.3699722290936723, -0.3592870802315603, -0.2456949968339808, 0.07328517022346293, -0.20427727376122073, -0.2567727698170277, 0.2081841933260481, -0.2685464276561895, -0.02698024900921856, 0.07452286092609346, -0.04866936931902745, -0.08736144671923514, -0.39119630887913687, 0.43112118221280804, 0.02092083529267651, 0.146578314747796, 0.07720608899021993, 0.06609813647389591, -0.001956294947836817, -0.011402224319571832, 0.0089139638704259, -0.24127388967568242, 0.12283017141155404, 0.32748506436719144, 0.01764328642018947, 0.07945736764975071, -0.4221939720123647, -0.18349452970615387, 0.14621695487602918, 0.13278783259756236, 0.06307601727859442, -0.028754308631823183, -0.3060494759849396, 0.02405453162514661, -0.17055166574932792, -0.17430594107921582, -0.07107218595906105, 0.04097466383982135, -0.019311733204445028, -0.11919696450427017, 0.010570766270323375, 0.15290742241833583, 0.06872961616300675, -0.11320599253816777, -0.12167491841954683, -0.125080419569669, 0.050774404577103006, -0.08425071704235063, 0.09555560077192733, 0.07113696424380304, 0.0310645627099123, -0.19439157159123793, 0.25605902041824735, -0.0077684694348486615, -0.2440376439984223, 0.16315777469650808, -0.17726776434995054, -0.18409286218930979, 0.15596848900194268, 0.04094074229451727, 0.14142059967628715, -0.07083658973969721, 0.2068347485865051, -0.12285318912963483, -0.02987146785998919, 0.23076277962291097, -0.06285062687561276, 0.13221212671733046, 0.03007302368171962, 0.027921976813350815, 0.19405053855559554, 0.01410711595104132, -0.04796451078279011, -0.3120034457105829, -0.18844650340503563, -0.05833506452463882, 0.12742423405309758, -0.042342752840297, -0.19817497236450787, 0.3355928633224601, 0.04160837707648345, 0.19442231818495026, 0.15192476400813784, 0.12611536042980784, -0.002000871804509177, 0.16993405259248004, 0.10063414822096925, 0.08930947563887282, 0.2822964659510517, -0.04378742891285254, -0.1304396813292146, -0.07330285991171756, 0.27490124669408494] |
1,802.06963 | Neural Network Ensembles to Real-time Identification of Plug-level
Appliance Measurements | The problem of identifying end-use electrical appliances from their
individual consumption profiles, known as the appliance identification problem,
is a primary stage in both Non-Intrusive Load Monitoring (NILM) and automated
plug-wise metering. Therefore, appliance identification has received dedicated
studies with various electric appliance signatures, classification models, and
evaluation datasets. In this paper, we propose a neural network ensembles
approach to address this problem using high resolution measurements. The models
are trained on the raw current and voltage waveforms, and thus, eliminating the
need for well engineered appliance signatures. We evaluate the proposed model
on a publicly available appliance dataset from 55 residential buildings, 11
appliance categories, and over 1000 measurements. We further study the
stability of the trained models with respect to training dataset, sampling
frequency, and variations in the steady-state operation of appliances.
| cs.LG cs.AI eess.SP | the problem of identifying enduse electrical appliances from their individual consumption profiles known as the appliance identification problem is a primary stage in both nonintrusive load monitoring nilm and automated plugwise metering therefore appliance identification has received dedicated studies with various electric appliance signatures classification models and evaluation datasets in this paper we propose a neural network ensembles approach to address this problem using high resolution measurements the models are trained on the raw current and voltage waveforms and thus eliminating the need for well engineered appliance signatures we evaluate the proposed model on a publicly available appliance dataset from 55 residential buildings 11 appliance categories and over 1000 measurements we further study the stability of the trained models with respect to training dataset sampling frequency and variations in the steadystate operation of appliances | [['the', 'problem', 'of', 'identifying', 'enduse', 'electrical', 'appliances', 'from', 'their', 'individual', 'consumption', 'profiles', 'known', 'as', 'the', 'appliance', 'identification', 'problem', 'is', 'a', 'primary', 'stage', 'in', 'both', 'nonintrusive', 'load', 'monitoring', 'nilm', 'and', 'automated', 'plugwise', 'metering', 'therefore', 'appliance', 'identification', 'has', 'received', 'dedicated', 'studies', 'with', 'various', 'electric', 'appliance', 'signatures', 'classification', 'models', 'and', 'evaluation', 'datasets', 'in', 'this', 'paper', 'we', 'propose', 'a', 'neural', 'network', 'ensembles', 'approach', 'to', 'address', 'this', 'problem', 'using', 'high', 'resolution', 'measurements', 'the', 'models', 'are', 'trained', 'on', 'the', 'raw', 'current', 'and', 'voltage', 'waveforms', 'and', 'thus', 'eliminating', 'the', 'need', 'for', 'well', 'engineered', 'appliance', 'signatures', 'we', 'evaluate', 'the', 'proposed', 'model', 'on', 'a', 'publicly', 'available', 'appliance', 'dataset', 'from', '55', 'residential', 'buildings', '11', 'appliance', 'categories', 'and', 'over', '1000', 'measurements', 'we', 'further', 'study', 'the', 'stability', 'of', 'the', 'trained', 'models', 'with', 'respect', 'to', 'training', 'dataset', 'sampling', 'frequency', 'and', 'variations', 'in', 'the', 'steadystate', 'operation', 'of', 'appliances']] | [-0.10188576823478579, 0.005696619743537298, -0.018245937421749858, 0.013533909677324775, -0.07228507075276702, -0.19712506022122234, 0.08789270471420867, 0.42800324370986537, -0.24366761788837893, -0.4001479026799342, 0.1455648220643135, -0.30339037712411326, -0.09140539613965534, 0.23756151205047796, -0.12326849852093405, 0.08228919837147669, 0.13555519778589556, 0.01943057301433239, -0.014949414577979343, -0.23564801666591512, 0.2675984414098294, 0.07868682603785922, 0.3950197529467873, 0.019529783615100205, 0.12094053404433723, -0.031924215084247295, -0.08514326740987599, -0.017559916975372295, -0.042217576335345335, 0.13015410558695212, 0.31049401129096904, 0.18569539036580773, 0.28477244488754894, -0.433740671212904, -0.23086415341866195, 0.12915190794379136, 0.10640044229173388, 0.08148001209857673, -0.023957124911248684, -0.2944806598484012, 0.08070944188183692, -0.246328455016115, -0.033073658998915574, -0.10531718989736155, -0.03216651928982228, 0.0451520573036199, -0.2605572553015405, 0.033831440726351136, -0.027007166241099567, 0.13899498011328673, -0.13262226438513935, -0.08348756295075654, -0.010281223144655334, 0.18363468997426421, 0.03052762604959281, -0.03761917804507889, 0.20466551811721428, -0.17536569602871305, -0.13832474258532257, 0.34982809354201017, -0.045115446587814426, -0.17862150611537964, 0.15990342212319233, -0.039658496429429466, -0.10948955401939277, 0.057108891546670204, 0.2617276515986742, 0.1199610768222159, -0.20793410249429062, -0.01867929091799612, 0.02891353414835114, 0.18314640340220212, 0.035033173192138396, -0.04315240788658647, 0.206555008770954, 0.2670378502024184, 0.0437978922032324, 0.15758076825186162, -0.1560574374231685, 0.01504287059432862, -0.23132148906728603, -0.06744064780694425, -0.15698801686189004, 0.026787231270139825, -0.06068500175418269, -0.11798198688845325, 0.46752890700796496, 0.24313866727306208, 0.14847466131826317, 0.08493826878204577, 0.4085018094751592, 0.04749667183478552, 0.09159852080292215, 0.07518075621875941, 0.13377413089926304, 0.018164416510054644, 0.2051907500446445, -0.2135594209404032, 0.0696169448757362, -0.020124338798336965] |
1,802.06964 | Co-occurrence matrix analysis-based semi-supervised training for object
detection | One of the most important factors in training object recognition networks
using convolutional neural networks (CNNs) is the provision of annotated data
accompanying human judgment. Particularly, in object detection or semantic
segmentation, the annotation process requires considerable human effort. In
this paper, we propose a semi-supervised learning (SSL)-based training
methodology for object detection, which makes use of automatic labeling of
un-annotated data by applying a network previously trained from an annotated
dataset. Because an inferred label by the trained network is dependent on the
learned parameters, it is often meaningless for re-training the network. To
transfer a valuable inferred label to the unlabeled data, we propose a
re-alignment method based on co-occurrence matrix analysis that takes into
account one-hot-vector encoding of the estimated label and the correlation
between the objects in the image. We used an MS-COCO detection dataset to
verify the performance of the proposed SSL method and deformable neural
networks (D-ConvNets) as an object detector for basic training. The performance
of the existing state-of-the-art detectors (DConvNets, YOLO v2, and single shot
multi-box detector (SSD)) can be improved by the proposed SSL method without
using the additional model parameter or modifying the network architecture.
| cs.CV | one of the most important factors in training object recognition networks using convolutional neural networks cnns is the provision of annotated data accompanying human judgment particularly in object detection or semantic segmentation the annotation process requires considerable human effort in this paper we propose a semisupervised learning sslbased training methodology for object detection which makes use of automatic labeling of unannotated data by applying a network previously trained from an annotated dataset because an inferred label by the trained network is dependent on the learned parameters it is often meaningless for retraining the network to transfer a valuable inferred label to the unlabeled data we propose a realignment method based on cooccurrence matrix analysis that takes into account onehotvector encoding of the estimated label and the correlation between the objects in the image we used an mscoco detection dataset to verify the performance of the proposed ssl method and deformable neural networks dconvnets as an object detector for basic training the performance of the existing stateoftheart detectors dconvnets yolo v2 and single shot multibox detector ssd can be improved by the proposed ssl method without using the additional model parameter or modifying the network architecture | [['one', 'of', 'the', 'most', 'important', 'factors', 'in', 'training', 'object', 'recognition', 'networks', 'using', 'convolutional', 'neural', 'networks', 'cnns', 'is', 'the', 'provision', 'of', 'annotated', 'data', 'accompanying', 'human', 'judgment', 'particularly', 'in', 'object', 'detection', 'or', 'semantic', 'segmentation', 'the', 'annotation', 'process', 'requires', 'considerable', 'human', 'effort', 'in', 'this', 'paper', 'we', 'propose', 'a', 'semisupervised', 'learning', 'sslbased', 'training', 'methodology', 'for', 'object', 'detection', 'which', 'makes', 'use', 'of', 'automatic', 'labeling', 'of', 'unannotated', 'data', 'by', 'applying', 'a', 'network', 'previously', 'trained', 'from', 'an', 'annotated', 'dataset', 'because', 'an', 'inferred', 'label', 'by', 'the', 'trained', 'network', 'is', 'dependent', 'on', 'the', 'learned', 'parameters', 'it', 'is', 'often', 'meaningless', 'for', 'retraining', 'the', 'network', 'to', 'transfer', 'a', 'valuable', 'inferred', 'label', 'to', 'the', 'unlabeled', 'data', 'we', 'propose', 'a', 'realignment', 'method', 'based', 'on', 'cooccurrence', 'matrix', 'analysis', 'that', 'takes', 'into', 'account', 'onehotvector', 'encoding', 'of', 'the', 'estimated', 'label', 'and', 'the', 'correlation', 'between', 'the', 'objects', 'in', 'the', 'image', 'we', 'used', 'an', 'mscoco', 'detection', 'dataset', 'to', 'verify', 'the', 'performance', 'of', 'the', 'proposed', 'ssl', 'method', 'and', 'deformable', 'neural', 'networks', 'dconvnets', 'as', 'an', 'object', 'detector', 'for', 'basic', 'training', 'the', 'performance', 'of', 'the', 'existing', 'stateoftheart', 'detectors', 'dconvnets', 'yolo', 'v2', 'and', 'single', 'shot', 'multibox', 'detector', 'ssd', 'can', 'be', 'improved', 'by', 'the', 'proposed', 'ssl', 'method', 'without', 'using', 'the', 'additional', 'model', 'parameter', 'or', 'modifying', 'the', 'network', 'architecture']] | [-0.028397218954471472, -0.02798209327891108, -0.036978728552373295, 0.07119634221538211, -0.1259871608631305, -0.18940818527742675, 0.027041016254422904, 0.4613833898502885, -0.2406618388288006, -0.3802470794698487, 0.0535273720090965, -0.2758024108147551, -0.1772996929318142, 0.17560262565442522, -0.16310796497331162, 0.10982959574949075, 0.20788430010763373, 0.0940385474628374, -0.04940532650054964, -0.27329105289082445, 0.31907816897682767, 0.07915226645592152, 0.3610685642282064, 0.009304294955102405, 0.1660879584735123, -0.03313653107917824, -0.05375875285899764, -0.03437042757941907, -0.008906633065501776, 0.2032921044241286, 0.3058020403360002, 0.23950518024548967, 0.2974982440047434, -0.42054670517020787, -0.2319360239167956, 0.08865349786005626, 0.14427217824447958, 0.12001764943261865, -0.022139482932769895, -0.4317316962844882, 0.08057768272445659, -0.19924996470964235, 0.085133172559469, -0.13812245418200592, -0.030076478618923673, -0.06974581590029581, -0.29687288168486187, 0.0315082007921569, 0.10213689416334891, 0.06341866915801744, -0.04864772132424765, -0.09554674044246565, 0.004429253078485152, 0.1889102028896764, 0.012665013414996564, 0.07262801229514923, 0.16809781190831974, -0.2455401986664288, -0.12925270198770014, 0.328930556998437, -0.04883330024983636, -0.23338044867533897, 0.15595428875393932, 0.02053527641768387, -0.1407820426624912, 0.12804891756389544, 0.24539093401938852, 0.1220154013577361, -0.19743194278812337, -0.03530702273652728, -0.0436115978702876, 0.23832848221453698, 0.027703870960672176, -0.04640536917451554, 0.1476197017012993, 0.33011325372685313, -0.005570351725495396, 0.1758332120416764, -0.22740731983938064, 0.007310085548380516, -0.219610582330113, -0.08185270926256845, -0.2524518790893764, -0.029305647164510066, -0.1349299231892926, -0.1487018939885384, 0.39889422568970445, 0.2656448634989872, 0.20950482778753401, 0.09396105787304782, 0.3710942385493929, -0.006012158916351332, 0.1893262768856674, 0.07634376915639841, 0.18914357540794985, -0.025301088192573314, 0.12518527882212666, -0.17004990280137752, 0.13716237971325118, 0.09341345498026275] |
1,802.06965 | Constant Regret, Generalized Mixability, and Mirror Descent | We consider the setting of prediction with expert advice; a learner makes
predictions by aggregating those of a group of experts. Under this setting, and
for the right choice of loss function and "mixing" algorithm, it is possible
for the learner to achieve a constant regret regardless of the number of
prediction rounds. For example, a constant regret can be achieved for
\emph{mixable} losses using the \emph{aggregating algorithm}. The
\emph{Generalized Aggregating Algorithm} (GAA) is a name for a family of
algorithms parameterized by convex functions on simplices (entropies), which
reduce to the aggregating algorithm when using the \emph{Shannon entropy}
$\operatorname{S}$. For a given entropy $\Phi$, losses for which a constant
regret is possible using the \textsc{GAA} are called $\Phi$-mixable. Which
losses are $\Phi$-mixable was previously left as an open question. We fully
characterize $\Phi$-mixability and answer other open questions posed by
\cite{Reid2015}. We show that the Shannon entropy $\operatorname{S}$ is
fundamental in nature when it comes to mixability; any $\Phi$-mixable loss is
necessarily $\operatorname{S}$-mixable, and the lowest worst-case regret of the
\textsc{GAA} is achieved using the Shannon entropy. Finally, by leveraging the
connection between the \emph{mirror descent algorithm} and the update step of
the GAA, we suggest a new \emph{adaptive} generalized aggregating algorithm and
analyze its performance in terms of the regret bound.
| cs.LG | we consider the setting of prediction with expert advice a learner makes predictions by aggregating those of a group of experts under this setting and for the right choice of loss function and mixing algorithm it is possible for the learner to achieve a constant regret regardless of the number of prediction rounds for example a constant regret can be achieved for emphmixable losses using the emphaggregating algorithm the emphgeneralized aggregating algorithm gaa is a name for a family of algorithms parameterized by convex functions on simplices entropies which reduce to the aggregating algorithm when using the emphshannon entropy operatornames for a given entropy phi losses for which a constant regret is possible using the textscgaa are called phimixable which losses are phimixable was previously left as an open question we fully characterize phimixability and answer other open questions posed by citereid2015 we show that the shannon entropy operatornames is fundamental in nature when it comes to mixability any phimixable loss is necessarily operatornamesmixable and the lowest worstcase regret of the textscgaa is achieved using the shannon entropy finally by leveraging the connection between the emphmirror descent algorithm and the update step of the gaa we suggest a new emphadaptive generalized aggregating algorithm and analyze its performance in terms of the regret bound | [['we', 'consider', 'the', 'setting', 'of', 'prediction', 'with', 'expert', 'advice', 'a', 'learner', 'makes', 'predictions', 'by', 'aggregating', 'those', 'of', 'a', 'group', 'of', 'experts', 'under', 'this', 'setting', 'and', 'for', 'the', 'right', 'choice', 'of', 'loss', 'function', 'and', 'mixing', 'algorithm', 'it', 'is', 'possible', 'for', 'the', 'learner', 'to', 'achieve', 'a', 'constant', 'regret', 'regardless', 'of', 'the', 'number', 'of', 'prediction', 'rounds', 'for', 'example', 'a', 'constant', 'regret', 'can', 'be', 'achieved', 'for', 'emphmixable', 'losses', 'using', 'the', 'emphaggregating', 'algorithm', 'the', 'emphgeneralized', 'aggregating', 'algorithm', 'gaa', 'is', 'a', 'name', 'for', 'a', 'family', 'of', 'algorithms', 'parameterized', 'by', 'convex', 'functions', 'on', 'simplices', 'entropies', 'which', 'reduce', 'to', 'the', 'aggregating', 'algorithm', 'when', 'using', 'the', 'emphshannon', 'entropy', 'operatornames', 'for', 'a', 'given', 'entropy', 'phi', 'losses', 'for', 'which', 'a', 'constant', 'regret', 'is', 'possible', 'using', 'the', 'textscgaa', 'are', 'called', 'phimixable', 'which', 'losses', 'are', 'phimixable', 'was', 'previously', 'left', 'as', 'an', 'open', 'question', 'we', 'fully', 'characterize', 'phimixability', 'and', 'answer', 'other', 'open', 'questions', 'posed', 'by', 'citereid2015', 'we', 'show', 'that', 'the', 'shannon', 'entropy', 'operatornames', 'is', 'fundamental', 'in', 'nature', 'when', 'it', 'comes', 'to', 'mixability', 'any', 'phimixable', 'loss', 'is', 'necessarily', 'operatornamesmixable', 'and', 'the', 'lowest', 'worstcase', 'regret', 'of', 'the', 'textscgaa', 'is', 'achieved', 'using', 'the', 'shannon', 'entropy', 'finally', 'by', 'leveraging', 'the', 'connection', 'between', 'the', 'emphmirror', 'descent', 'algorithm', 'and', 'the', 'update', 'step', 'of', 'the', 'gaa', 'we', 'suggest', 'a', 'new', 'emphadaptive', 'generalized', 'aggregating', 'algorithm', 'and', 'analyze', 'its', 'performance', 'in', 'terms', 'of', 'the', 'regret', 'bound']] | [-0.08502463838628051, 0.0700510074413473, -0.06896774630735909, 0.09130831527381285, -0.07416990924246826, -0.1862774577389643, 0.12087566765857119, 0.3804424713666379, -0.2937379819476633, -0.3095428567081328, 0.10186138076739368, -0.2777264182889852, -0.1520338483545839, 0.1908274444014521, -0.14077408959098991, 0.09172374353878589, 0.054116466340328594, 0.08310537487810966, -0.025314202938495584, -0.3211968594956329, 0.31164512716604453, 0.07966402838926635, 0.23987449412754042, 0.05527117588411501, 0.13059760240930612, -0.0043924995381565924, 0.012920571100057184, 0.04866049499296158, -0.1292608349135971, 0.1286855910427742, 0.2397748340187974, 0.20057807778668346, 0.3487806931630826, -0.3294917279221479, -0.16761343591977634, 0.11907130807131819, 0.0964085365271476, 0.07857003707712226, -0.02860994645376301, -0.2652975067008034, 0.0819458700962324, -0.15260558744589572, -0.035750975622117376, -0.08186391160317055, -0.018284811965501822, -0.010202164305102767, -0.33793773933413246, 0.05775527094120105, 0.07493546415907014, 0.012576750133783348, -0.0428834928236947, -0.10313181803014708, 0.055768086172604155, 0.11652388418679921, 0.04236004131781971, 0.04863211285160149, 0.09069193032280841, -0.12461550974793442, -0.17057383957870523, 0.33841659944336094, -0.062242217037829034, -0.2134096889035523, 0.10441696316962248, -0.06639306606652523, -0.09173182065788547, 0.0822437571596752, 0.17133704071538974, 0.13671657087923325, -0.1353014013624029, 0.10185990047028505, -0.0700672768195978, 0.13962787933516524, 0.09565343130470334, 0.026269382858214882, 0.09276128429761246, 0.16941037427100525, 0.11099645846949448, 0.180859219002282, -0.01036101989606305, -0.1056499073956641, -0.272216704163194, -0.1764708782648792, -0.20363851345948947, 0.023048206087887328, -0.11421816890397521, -0.13646103904805218, 0.3376852130942336, 0.12006659551017276, 0.22010410318006446, 0.15188634723992295, 0.3025317951422004, 0.10734039097877436, 0.03683957553048193, 0.16247366145999143, 0.20344883907988703, 0.08921972042496669, 0.023485544697410942, -0.21580126373892994, 0.14535029938905636, 0.10514756823094218] |
1,802.06966 | Computing the Cumulative Distribution Function and Quantiles of the
One-sided Kolmogorov-Smirnov Statistic | The cumulative distribution and quantile functions for the one-sided one
sample Kolmogorov-Smirnov probability distributions are used for
goodness-of-fit testing. While the Smirnov-Birnbaum-Tingey formula for the CDF
appears straight forward, its numerical evaluation generates intermediate
results spanning many hundreds of orders of magnitude and at times requires
very precise accurate representations. Computing the quantile function for any
specific probability may require evaluating both the CDF and its derivative,
both of which are computationally expensive. To work around avoid these issues,
different algorithms can be used across different parts of the domain, and
approximations can be used to reduce the computational requirements. We show
here that straight forward implementation incurs accuracy loss for sample sizes
of well under 1000. Further the approximations in use inside the open source
SciPy python software often result in increased computation, not just reduced
accuracy, and at times suffer catastrophic loss of accuracy for any sample
size. Then we provide alternate algorithms which restore accuracy and
efficiency across the whole domain.
| stat.CO | the cumulative distribution and quantile functions for the onesided one sample kolmogorovsmirnov probability distributions are used for goodnessoffit testing while the smirnovbirnbaumtingey formula for the cdf appears straight forward its numerical evaluation generates intermediate results spanning many hundreds of orders of magnitude and at times requires very precise accurate representations computing the quantile function for any specific probability may require evaluating both the cdf and its derivative both of which are computationally expensive to work around avoid these issues different algorithms can be used across different parts of the domain and approximations can be used to reduce the computational requirements we show here that straight forward implementation incurs accuracy loss for sample sizes of well under 1000 further the approximations in use inside the open source scipy python software often result in increased computation not just reduced accuracy and at times suffer catastrophic loss of accuracy for any sample size then we provide alternate algorithms which restore accuracy and efficiency across the whole domain | [['the', 'cumulative', 'distribution', 'and', 'quantile', 'functions', 'for', 'the', 'onesided', 'one', 'sample', 'kolmogorovsmirnov', 'probability', 'distributions', 'are', 'used', 'for', 'goodnessoffit', 'testing', 'while', 'the', 'smirnovbirnbaumtingey', 'formula', 'for', 'the', 'cdf', 'appears', 'straight', 'forward', 'its', 'numerical', 'evaluation', 'generates', 'intermediate', 'results', 'spanning', 'many', 'hundreds', 'of', 'orders', 'of', 'magnitude', 'and', 'at', 'times', 'requires', 'very', 'precise', 'accurate', 'representations', 'computing', 'the', 'quantile', 'function', 'for', 'any', 'specific', 'probability', 'may', 'require', 'evaluating', 'both', 'the', 'cdf', 'and', 'its', 'derivative', 'both', 'of', 'which', 'are', 'computationally', 'expensive', 'to', 'work', 'around', 'avoid', 'these', 'issues', 'different', 'algorithms', 'can', 'be', 'used', 'across', 'different', 'parts', 'of', 'the', 'domain', 'and', 'approximations', 'can', 'be', 'used', 'to', 'reduce', 'the', 'computational', 'requirements', 'we', 'show', 'here', 'that', 'straight', 'forward', 'implementation', 'incurs', 'accuracy', 'loss', 'for', 'sample', 'sizes', 'of', 'well', 'under', '1000', 'further', 'the', 'approximations', 'in', 'use', 'inside', 'the', 'open', 'source', 'scipy', 'python', 'software', 'often', 'result', 'in', 'increased', 'computation', 'not', 'just', 'reduced', 'accuracy', 'and', 'at', 'times', 'suffer', 'catastrophic', 'loss', 'of', 'accuracy', 'for', 'any', 'sample', 'size', 'then', 'we', 'provide', 'alternate', 'algorithms', 'which', 'restore', 'accuracy', 'and', 'efficiency', 'across', 'the', 'whole', 'domain']] | [-0.03775013229049788, 0.02898145089942985, -0.06558215206537533, 0.10735495683331431, -0.07245272687390629, -0.12951579571135938, 0.08068203288873235, 0.4350957611541441, -0.24326653076397434, -0.3688646356398068, 0.12180072728378778, -0.24958763467262218, -0.03864975636710693, 0.23892344506971674, -0.06897092115207563, 0.1209581240810214, 0.10158442559457767, -0.013483984924194352, -0.12972001786103782, -0.2797007260878393, 0.2248275141428836, 0.054356849181003, 0.30158182880069856, 0.047874925707744015, 0.08745188859971298, -0.008695084137407823, -0.05405412865459828, -0.002485810261951085, -0.08651168388908227, 0.10236569298388425, 0.2811352704932693, 0.17816986718309324, 0.30943349557585925, -0.430798152969492, -0.16945044908306897, 0.11407665105499441, 0.174004631716918, 0.06828761097769384, -0.002378763418153294, -0.24147990815258624, 0.1057549695487197, -0.17112503804700688, -0.12692865987016927, -0.09450323156060071, -0.0032003264148588195, 0.02796639131197843, -0.30050927118335397, 0.10313071813605772, 0.012585598713306972, 0.047590952167506015, 0.012732577931558702, -0.15971106822471037, 0.022588779314198285, 0.1466380101185795, 0.04510508835932777, 0.031046871261591193, 0.1401011173304833, -0.133649971590026, -0.10691766137188655, 0.32977315227563947, -0.01941735405429192, -0.2327807722041852, 0.21256399850869562, -0.11549399024378394, -0.11546377147450769, 0.16329327709401273, 0.2092200306364181, 0.11026887112994181, -0.13573707845861926, 0.04930273591229361, 0.05742413657888816, 0.15533685924890994, 0.10499354519029977, 0.04124377068257862, 0.1538831223533746, 0.1498345827221002, 0.05555886246708216, 0.1269352265799338, -0.11213629325977498, -0.08550576742972744, -0.30634694924132405, -0.13921634472991937, -0.18584035944187888, -0.015796116297472514, -0.14118315339994766, -0.1731683508167329, 0.37163615860959137, 0.18501291096439382, 0.187085041862004, 0.130779317906912, 0.32713084977028745, 0.12884218902241415, 0.09066831925598208, 0.12035146696161639, 0.1733394123619548, 0.025361362699007878, 0.07071722375566106, -0.17615837399259301, 0.13472498466255017, 0.009729209875950783] |
1,802.06967 | Recovery of simultaneous low rank and two-way sparse coefficient
matrices, a nonconvex approach | We study the problem of recovery of matrices that are simultaneously low rank
and row and/or column sparse. Such matrices appear in recent applications in
cognitive neuroscience, imaging, computer vision, macroeconomics, and genetics.
We propose a GDT (Gradient Descent with hard Thresholding) algorithm to
efficiently recover matrices with such structure, by minimizing a bi-convex
function over a nonconvex set of constraints. We show linear convergence of the
iterates obtained by GDT to a region within statistical error of an optimal
solution. As an application of our method, we consider multi-task learning
problems and show that the statistical error rate obtained by GDT is near
optimal compared to minimax rate. Experiments demonstrate competitive
performance and much faster running speed compared to existing methods, on both
simulations and real data sets.
| stat.ML | we study the problem of recovery of matrices that are simultaneously low rank and row andor column sparse such matrices appear in recent applications in cognitive neuroscience imaging computer vision macroeconomics and genetics we propose a gdt gradient descent with hard thresholding algorithm to efficiently recover matrices with such structure by minimizing a biconvex function over a nonconvex set of constraints we show linear convergence of the iterates obtained by gdt to a region within statistical error of an optimal solution as an application of our method we consider multitask learning problems and show that the statistical error rate obtained by gdt is near optimal compared to minimax rate experiments demonstrate competitive performance and much faster running speed compared to existing methods on both simulations and real data sets | [['we', 'study', 'the', 'problem', 'of', 'recovery', 'of', 'matrices', 'that', 'are', 'simultaneously', 'low', 'rank', 'and', 'row', 'andor', 'column', 'sparse', 'such', 'matrices', 'appear', 'in', 'recent', 'applications', 'in', 'cognitive', 'neuroscience', 'imaging', 'computer', 'vision', 'macroeconomics', 'and', 'genetics', 'we', 'propose', 'a', 'gdt', 'gradient', 'descent', 'with', 'hard', 'thresholding', 'algorithm', 'to', 'efficiently', 'recover', 'matrices', 'with', 'such', 'structure', 'by', 'minimizing', 'a', 'biconvex', 'function', 'over', 'a', 'nonconvex', 'set', 'of', 'constraints', 'we', 'show', 'linear', 'convergence', 'of', 'the', 'iterates', 'obtained', 'by', 'gdt', 'to', 'a', 'region', 'within', 'statistical', 'error', 'of', 'an', 'optimal', 'solution', 'as', 'an', 'application', 'of', 'our', 'method', 'we', 'consider', 'multitask', 'learning', 'problems', 'and', 'show', 'that', 'the', 'statistical', 'error', 'rate', 'obtained', 'by', 'gdt', 'is', 'near', 'optimal', 'compared', 'to', 'minimax', 'rate', 'experiments', 'demonstrate', 'competitive', 'performance', 'and', 'much', 'faster', 'running', 'speed', 'compared', 'to', 'existing', 'methods', 'on', 'both', 'simulations', 'and', 'real', 'data', 'sets']] | [-0.04802581849110912, -0.022685401081856585, -0.028079073901410945, 0.06289984589503977, -0.02705947679193156, -0.14385450149113818, 0.04728860774821089, 0.43907571970954423, -0.3346315832129976, -0.3024367304778723, 0.16249546719996563, -0.2557795852956961, -0.21083491327883602, 0.22429004576519246, -0.1294883589024291, 0.14257051776228255, 0.11191351987537025, 0.017416265627094942, -0.12459207893269815, -0.2845682232792294, 0.2297880402332995, 0.07565368612318538, 0.2926896939184083, -0.0014429582362315914, 0.1422690030470736, -0.00664538276100228, 0.0014875115819506404, 0.02613117466428021, -0.08772190812446787, 0.149800912097147, 0.3219019457979431, 0.21750814591122922, 0.3417866218910921, -0.40933597914499137, -0.20057628085374718, 0.12590639272979062, 0.13933940845101264, 0.08148485256084638, -0.0791244031058249, -0.2654673946053945, 0.10739250714861781, -0.13665047336311997, -0.028114854914042378, -0.11263122194078426, -0.060895375155684967, 0.03684444963578279, -0.35684501007063923, 0.09054182541859877, 0.0011793775050792583, 0.04584309649328853, -0.0636532709811085, -0.1742253351321285, 0.08935981156853165, 0.06978734680938772, 0.07361964614386851, 0.04505921948823876, 0.160369401007111, -0.13883826454520196, -0.1535572988999098, 0.32862464020880616, -0.06397401238611156, -0.19230448767947134, 0.19089809580987624, -0.08535710998355996, -0.1190057161549294, 0.12497488885049442, 0.24812053969895193, 0.12694882246680997, -0.1116959764951544, 0.08342637866712897, -0.05309096006171186, 0.16692338856442493, 0.0371125089618298, -0.022530069737153692, 0.09530032841604232, 0.1652679708100451, 0.15680049481808908, 0.14670705807110107, -0.07339481093790816, -0.09133632333819257, -0.21302313308498655, -0.09728959314308541, -0.21754082132044228, -0.009223474713056817, -0.15414776398866642, -0.13766573671280413, 0.3644455794548226, 0.15524736099493827, 0.21954022636709286, 0.15438891183440537, 0.3284758646916526, 0.08934492247764386, 0.031114077022255854, 0.1312996526284851, 0.20195313509871332, 0.12150769166525656, 0.07788640137873734, -0.22488634995466403, 0.04506526864720364, 0.07930437533921281] |
1,802.06968 | Semi-stable models of modular Curves $X_0(p^2)$ and some arithmetic
applications | In this paper, we compute the semi-stable models of modular curves $X_0(p^2)$
for odd primes $p > 3$ and compute the Arakelov self-intersection numbers of
the relative dualising sheaves for these models. We give two arithmetic
applications of our computations. In particular, we give an effective version
of the Bogomolov conjecture following the strategy outlined by Zhang and find
the stable Faltings heights of the arithmetic surfaces corresponding to these
modular curves.
| math.NT | in this paper we compute the semistable models of modular curves x_0p2 for odd primes p 3 and compute the arakelov selfintersection numbers of the relative dualising sheaves for these models we give two arithmetic applications of our computations in particular we give an effective version of the bogomolov conjecture following the strategy outlined by zhang and find the stable faltings heights of the arithmetic surfaces corresponding to these modular curves | [['in', 'this', 'paper', 'we', 'compute', 'the', 'semistable', 'models', 'of', 'modular', 'curves', 'x_0p2', 'for', 'odd', 'primes', 'p', '3', 'and', 'compute', 'the', 'arakelov', 'selfintersection', 'numbers', 'of', 'the', 'relative', 'dualising', 'sheaves', 'for', 'these', 'models', 'we', 'give', 'two', 'arithmetic', 'applications', 'of', 'our', 'computations', 'in', 'particular', 'we', 'give', 'an', 'effective', 'version', 'of', 'the', 'bogomolov', 'conjecture', 'following', 'the', 'strategy', 'outlined', 'by', 'zhang', 'and', 'find', 'the', 'stable', 'faltings', 'heights', 'of', 'the', 'arithmetic', 'surfaces', 'corresponding', 'to', 'these', 'modular', 'curves']] | [-0.20513450789173515, 0.07013549878689113, -0.16506773462965035, 0.1499420254291232, -0.004174076001041792, -0.14542381658914014, 0.014699981969282766, 0.2766366484902904, -0.3066950622998493, -0.2835210600316944, 0.06357889130226219, -0.1905878496546508, -0.17502450958733828, 0.2732207573241961, -0.1846699148521457, 0.031657159957267395, 0.0113796227231202, 0.017117266215279068, -0.0652741598044063, -0.3931264233919726, 0.3932944009946266, -0.03047414397506017, 0.19237988252146826, 0.09148073423666958, 0.05338902935438173, 0.04930076313296884, -0.01143265828411554, -0.09839852842253069, -0.20821929220634866, 0.24275543149823034, 0.3031806674484421, 0.05088491461725092, 0.17155341613172015, -0.4224428542378083, -0.10993743619986508, 0.20425500354768944, 0.0968554093384407, 0.05679982604170349, -0.006836615660240952, -0.17834774381153182, 0.12894379522021807, -0.13811055528865734, -0.2070728572229789, -0.1110379363961098, 0.10037460928441773, 0.06553429658409916, -0.19790550821106617, -0.0251404587855779, 0.09169070723740808, 0.1866250732179049, -0.08617083114755511, -0.1507150557574252, -0.0052454114504630715, 0.0263752665265765, 0.03079051501107399, -0.0030889674089848995, 0.06464577869603962, -0.11481735353730291, -0.1465895225385755, 0.32085819629637496, -0.050552517293729414, -0.14388007004286202, 0.0921229942583702, -0.09713815788174389, -0.16796919084350828, 0.11125836310199869, 0.11444181644252803, 0.18549522345649525, 0.056215482331077815, 0.14535054940776243, -0.11073836795723355, 0.07697298051133541, 0.13182685777387568, -0.05329152207139512, 0.11526339383743389, 0.03151187611232236, 0.03069551661282673, 0.12661294671575682, -0.0717436343326535, -0.029172325251020596, -0.38428570256686545, -0.23569575964774883, -0.06867863752380748, 0.09982514830017594, -0.11216821316851001, -0.18799720890164165, 0.45331611148488354, 0.12984677819981122, 0.19736767991800125, 0.19767402732928455, 0.23842948246222567, 0.10567044018944857, 0.005057452434286947, 0.08157982273292924, 0.1550734448443416, 0.19934500693868268, -0.026284521157053153, -0.13421235139101323, -0.02817086079223475, 0.20430748241389513] |
1,802.06969 | Geometry of Discrete Copulas | Multivariate distributions are fundamental to modeling. Discrete copulas can
be used to construct diverse multivariate joint distributions over random
variables from estimated univariate marginals. The space of discrete copulas
admits a representation as a convex polytope which can be exploited in
entropy-copula methods relevant to hydrology and climatology. To allow for an
extensive use of such methods in a wide range of applied fields, it is
important to have a geometric representation of discrete copulas with desirable
stochastic properties. In this paper, we show that the families of ultramodular
discrete copulas and their generalization to convex discrete quasi-copulas
admit representations as polytopes. We draw connections to the prominent
Birkhoff polytope, alternating sign matrix polytope, and their most extensive
generalizations in the discrete geometry literature. In doing so, we generalize
some well-known results on these polytopes from both the statistics literature
and the discrete geometry literature.
| math.ST stat.TH | multivariate distributions are fundamental to modeling discrete copulas can be used to construct diverse multivariate joint distributions over random variables from estimated univariate marginals the space of discrete copulas admits a representation as a convex polytope which can be exploited in entropycopula methods relevant to hydrology and climatology to allow for an extensive use of such methods in a wide range of applied fields it is important to have a geometric representation of discrete copulas with desirable stochastic properties in this paper we show that the families of ultramodular discrete copulas and their generalization to convex discrete quasicopulas admit representations as polytopes we draw connections to the prominent birkhoff polytope alternating sign matrix polytope and their most extensive generalizations in the discrete geometry literature in doing so we generalize some wellknown results on these polytopes from both the statistics literature and the discrete geometry literature | [['multivariate', 'distributions', 'are', 'fundamental', 'to', 'modeling', 'discrete', 'copulas', 'can', 'be', 'used', 'to', 'construct', 'diverse', 'multivariate', 'joint', 'distributions', 'over', 'random', 'variables', 'from', 'estimated', 'univariate', 'marginals', 'the', 'space', 'of', 'discrete', 'copulas', 'admits', 'a', 'representation', 'as', 'a', 'convex', 'polytope', 'which', 'can', 'be', 'exploited', 'in', 'entropycopula', 'methods', 'relevant', 'to', 'hydrology', 'and', 'climatology', 'to', 'allow', 'for', 'an', 'extensive', 'use', 'of', 'such', 'methods', 'in', 'a', 'wide', 'range', 'of', 'applied', 'fields', 'it', 'is', 'important', 'to', 'have', 'a', 'geometric', 'representation', 'of', 'discrete', 'copulas', 'with', 'desirable', 'stochastic', 'properties', 'in', 'this', 'paper', 'we', 'show', 'that', 'the', 'families', 'of', 'ultramodular', 'discrete', 'copulas', 'and', 'their', 'generalization', 'to', 'convex', 'discrete', 'quasicopulas', 'admit', 'representations', 'as', 'polytopes', 'we', 'draw', 'connections', 'to', 'the', 'prominent', 'birkhoff', 'polytope', 'alternating', 'sign', 'matrix', 'polytope', 'and', 'their', 'most', 'extensive', 'generalizations', 'in', 'the', 'discrete', 'geometry', 'literature', 'in', 'doing', 'so', 'we', 'generalize', 'some', 'wellknown', 'results', 'on', 'these', 'polytopes', 'from', 'both', 'the', 'statistics', 'literature', 'and', 'the', 'discrete', 'geometry', 'literature']] | [-0.010594811153734897, 0.020295827357376065, -0.14869746096249853, 0.13306167751055706, -0.14086532024210774, -0.1031173632408564, 0.005798880487087776, 0.4289248917720743, -0.34927769443362144, -0.24743918761923597, 0.13051105008568042, -0.2472921159196567, -0.18211228166009996, 0.19235791673011088, -0.15772133791767112, 0.11233578236216771, 0.01677886234580904, -0.0064220877325201365, -0.11629971296370185, -0.27285328725600366, 0.2770917282237873, -0.00682212418707257, 0.2784332458411793, -0.006308860042170293, 0.1316237754589012, 0.03131750366696111, -0.05499315649023527, 0.030722597936922162, -0.13014621151004913, 0.16245662096816188, 0.3347919756624769, 0.15110879795222015, 0.25660767050466493, -0.4203592731480624, -0.2196050121064682, 0.1975697906088683, 0.13326814666148634, 0.06832816992182988, -0.00808178532259682, -0.26250097222326624, 0.023756626479724957, -0.15369436050231172, -0.09667364069239491, -0.14812121965753083, -0.000613017836455386, 0.06810422913803087, -0.2803679698837231, 0.05959482011271289, 0.07936769573529205, 0.08239550957380114, -0.03238895066062939, -0.1679776160411172, -0.006803906278463302, 0.07685940692175205, 0.057853950537623954, -0.0034088549778920475, 0.06109025296462062, -0.0697248558712459, -0.18049645718265248, 0.3683697437261837, 0.005158509823031255, -0.30409700916443017, 0.21193698020098353, -0.14482623703087438, -0.20747007830459233, 0.10452326692940368, 0.23642987638412344, 0.1317928918389851, -0.13475893952369272, 0.1067329338976423, -0.13379592355666356, 0.05800944642844395, 0.06383897988386192, 0.018026567959728148, 0.17511845846706026, 0.08096675842453341, 0.08933149838260004, 0.1746860715410822, -0.03775543937462844, -0.14362507932200716, -0.2677063811790211, -0.1038093274993288, -0.20698905190928363, 0.01940680076400717, -0.14939963955625932, -0.20214250475051, 0.3974697425590268, 0.13078836289253185, 0.1910400167237837, 0.08455874255314548, 0.2091065161841941, 0.09458023122629033, 0.038252727887300136, 0.05676534370408504, 0.11582337231704985, 0.20047180845004903, 0.042516569527992785, -0.08903448562336422, 0.07410850415414955, 0.07493333356989014] |
1,802.0697 | ISA-Based Trusted Network Functions And Server Applications In The
Untrusted Cloud | Nowadays, enterprises widely deploy Network Functions (NFs) and server
applications in the cloud. However, processing of sensitive data and trusted
execution cannot be securely deployed in the untrusted cloud. Cloud providers
themselves could accidentally leak private information (e.g., due to
misconfigurations) or rogue users could exploit vulnerabilities of the
providers' systems to compromise execution integrity, posing a threat to the
confidentiality of internal enterprise and customer data. In this paper, we
identify (i) a number of NF and server application use-cases that trusted
execution can be applied to, (ii) the assets and impact of compromising the
private data and execution integrity of each use-case, and (iii) we leverage
Intel's Software Guard Extensions (SGX) architecture to design Trusted
Execution Environments (TEEs) for cloud-based NFs and server applications. We
combine SGX with the Data Plane Development KIT (DPDK) to prototype and
evaluate our TEEs for a number of application scenarios (Layer 2 frame and
Layer 3 packet processing for plain and encrypted traffic, traffic
load-balancing and back-end server processing). Our results indicate that NFs
involving plain traffic can achieve almost native performance (e.g., ~22
Million Packets Per Second for Layer 3 forwarding for 64-byte frames), while
NFs involving encrypted traffic and server processing can still achieve
competitive performance (e.g., ~12 Million Packets Per Second for server
processing for 64-byte frames).
| cs.NI cs.CR | nowadays enterprises widely deploy network functions nfs and server applications in the cloud however processing of sensitive data and trusted execution cannot be securely deployed in the untrusted cloud cloud providers themselves could accidentally leak private information eg due to misconfigurations or rogue users could exploit vulnerabilities of the providers systems to compromise execution integrity posing a threat to the confidentiality of internal enterprise and customer data in this paper we identify i a number of nf and server application usecases that trusted execution can be applied to ii the assets and impact of compromising the private data and execution integrity of each usecase and iii we leverage intels software guard extensions sgx architecture to design trusted execution environments tees for cloudbased nfs and server applications we combine sgx with the data plane development kit dpdk to prototype and evaluate our tees for a number of application scenarios layer 2 frame and layer 3 packet processing for plain and encrypted traffic traffic loadbalancing and backend server processing our results indicate that nfs involving plain traffic can achieve almost native performance eg 22 million packets per second for layer 3 forwarding for 64byte frames while nfs involving encrypted traffic and server processing can still achieve competitive performance eg 12 million packets per second for server processing for 64byte frames | [['nowadays', 'enterprises', 'widely', 'deploy', 'network', 'functions', 'nfs', 'and', 'server', 'applications', 'in', 'the', 'cloud', 'however', 'processing', 'of', 'sensitive', 'data', 'and', 'trusted', 'execution', 'can', 'not', 'be', 'securely', 'deployed', 'in', 'the', 'untrusted', 'cloud', 'cloud', 'providers', 'themselves', 'could', 'accidentally', 'leak', 'private', 'information', 'eg', 'due', 'to', 'misconfigurations', 'or', 'rogue', 'users', 'could', 'exploit', 'vulnerabilities', 'of', 'the', 'providers', 'systems', 'to', 'compromise', 'execution', 'integrity', 'posing', 'a', 'threat', 'to', 'the', 'confidentiality', 'of', 'internal', 'enterprise', 'and', 'customer', 'data', 'in', 'this', 'paper', 'we', 'identify', 'i', 'a', 'number', 'of', 'nf', 'and', 'server', 'application', 'usecases', 'that', 'trusted', 'execution', 'can', 'be', 'applied', 'to', 'ii', 'the', 'assets', 'and', 'impact', 'of', 'compromising', 'the', 'private', 'data', 'and', 'execution', 'integrity', 'of', 'each', 'usecase', 'and', 'iii', 'we', 'leverage', 'intels', 'software', 'guard', 'extensions', 'sgx', 'architecture', 'to', 'design', 'trusted', 'execution', 'environments', 'tees', 'for', 'cloudbased', 'nfs', 'and', 'server', 'applications', 'we', 'combine', 'sgx', 'with', 'the', 'data', 'plane', 'development', 'kit', 'dpdk', 'to', 'prototype', 'and', 'evaluate', 'our', 'tees', 'for', 'a', 'number', 'of', 'application', 'scenarios', 'layer', '2', 'frame', 'and', 'layer', '3', 'packet', 'processing', 'for', 'plain', 'and', 'encrypted', 'traffic', 'traffic', 'loadbalancing', 'and', 'backend', 'server', 'processing', 'our', 'results', 'indicate', 'that', 'nfs', 'involving', 'plain', 'traffic', 'can', 'achieve', 'almost', 'native', 'performance', 'eg', '22', 'million', 'packets', 'per', 'second', 'for', 'layer', '3', 'forwarding', 'for', '64byte', 'frames', 'while', 'nfs', 'involving', 'encrypted', 'traffic', 'and', 'server', 'processing', 'can', 'still', 'achieve', 'competitive', 'performance', 'eg', '12', 'million', 'packets', 'per', 'second', 'for', 'server', 'processing', 'for', '64byte', 'frames']] | [-0.2167645796429589, -0.04972827921016356, -0.011219434668406553, 0.04226665217955146, -0.10992999632375032, -0.2632384610207846, 0.15271379083259812, 0.3984753376533908, -0.2951449743957014, -0.36058055811179673, 0.1567866161861564, -0.3207610271171525, -0.048550883548394326, 0.18879875430326548, -0.14422248061832196, 0.11952152525070488, 0.09466115899613634, 0.020377418272034157, 0.03556817557559722, -0.33989978656559017, 0.24222988745815674, 0.03815600070952167, 0.3423176818840583, 0.09421328653705903, 0.045991035356950274, 0.011291350136631198, -0.02004322997393078, -0.10189247118525877, 0.025280658317360198, 0.13226015630316565, 0.37199116190079995, 0.2645741920416085, 0.2855752982920216, -0.5056933980362173, -0.145271435807017, 0.060152072435854353, 0.16365742286371363, 0.03827845746509662, -0.04721511838193725, -0.32500937307674077, 0.15103961710071337, -0.2958414667513445, -0.04614783561260607, -0.09972314242260694, -0.0175492599695569, 0.05114242396653256, -0.2814071723517494, -0.044987010839824405, -0.05490360510200777, 0.06288936564673064, 0.023943033751769822, -0.03638394682535103, -0.029190870895681363, 0.20097640292688965, -0.00497278940331723, 0.005682629121098376, 0.265483692103851, -0.12263662649142477, -0.15144213042350718, 0.4076661290085879, 0.013717930335851928, -0.1191404052121642, 0.16489190349896107, 0.023343459232002154, -0.1828053359281323, 0.06586999451732993, 0.29091192482886696, -0.014063149005011549, -0.20113012356434687, 0.014915068202929932, 0.042237505445488585, 0.2502537737643423, 0.13167981672651147, 0.08690490815595377, 0.17381229694537853, 0.18733332995491633, 0.06645545875117148, 0.1305374965277685, -0.08288865765633946, -0.11134427609050879, -0.20554307610341585, -0.2054533635583719, -0.16323334350699156, -0.02488105682851178, -0.11152305794161721, -0.10101895619608668, 0.33184091099602286, 0.22981771867516265, 0.08898963921055335, 0.07801907291648746, 0.45181562927066593, -0.03835048307965119, 0.16127096085856382, 0.23441736984832753, 0.07829479579942533, -0.06863355310419188, 0.25944554065525843, -0.11205943402472651, 0.1465063722662559, -0.061221412686665415] |
1,802.06971 | A survey on trajectory clustering analysis | This paper comprehensively surveys the development of trajectory clustering.
Considering the critical role of trajectory data mining in modern intelligent
systems for surveillance security, abnormal behavior detection, crowd behavior
analysis, and traffic control, trajectory clustering has attracted growing
attention. Existing trajectory clustering methods can be grouped into three
categories: unsupervised, supervised and semi-supervised algorithms. In spite
of achieving a certain level of development, trajectory clustering is limited
in its success by complex conditions such as application scenarios and data
dimensions. This paper provides a holistic understanding and deep insight into
trajectory clustering, and presents a comprehensive analysis of representative
methods and promising future directions.
| cs.CV | this paper comprehensively surveys the development of trajectory clustering considering the critical role of trajectory data mining in modern intelligent systems for surveillance security abnormal behavior detection crowd behavior analysis and traffic control trajectory clustering has attracted growing attention existing trajectory clustering methods can be grouped into three categories unsupervised supervised and semisupervised algorithms in spite of achieving a certain level of development trajectory clustering is limited in its success by complex conditions such as application scenarios and data dimensions this paper provides a holistic understanding and deep insight into trajectory clustering and presents a comprehensive analysis of representative methods and promising future directions | [['this', 'paper', 'comprehensively', 'surveys', 'the', 'development', 'of', 'trajectory', 'clustering', 'considering', 'the', 'critical', 'role', 'of', 'trajectory', 'data', 'mining', 'in', 'modern', 'intelligent', 'systems', 'for', 'surveillance', 'security', 'abnormal', 'behavior', 'detection', 'crowd', 'behavior', 'analysis', 'and', 'traffic', 'control', 'trajectory', 'clustering', 'has', 'attracted', 'growing', 'attention', 'existing', 'trajectory', 'clustering', 'methods', 'can', 'be', 'grouped', 'into', 'three', 'categories', 'unsupervised', 'supervised', 'and', 'semisupervised', 'algorithms', 'in', 'spite', 'of', 'achieving', 'a', 'certain', 'level', 'of', 'development', 'trajectory', 'clustering', 'is', 'limited', 'in', 'its', 'success', 'by', 'complex', 'conditions', 'such', 'as', 'application', 'scenarios', 'and', 'data', 'dimensions', 'this', 'paper', 'provides', 'a', 'holistic', 'understanding', 'and', 'deep', 'insight', 'into', 'trajectory', 'clustering', 'and', 'presents', 'a', 'comprehensive', 'analysis', 'of', 'representative', 'methods', 'and', 'promising', 'future', 'directions']] | [-0.12679846048390922, -0.021595337143830527, -0.12395600017267637, 0.05024015965766292, -0.11486192746759535, -0.1637863319617911, 0.012767041032650294, 0.3960320079772478, -0.2547476221046124, -0.33349585872089776, 0.11853832971022572, -0.2872064070453724, -0.19592323944044227, 0.19760583207691804, -0.13118001169417626, 0.10737970106408913, 0.1514573749513007, 0.019942775373168003, -0.009656643121091362, -0.24551390337113005, 0.28363431271282025, 0.04885627197458794, 0.43227930180056806, 0.03007021313533187, 0.07302483775772718, 0.03744707260361443, -0.07001022389606358, 0.05136305934865959, -0.09290022242063199, 0.1893704485757133, 0.38820510074639547, 0.25817695234526095, 0.3854999551549554, -0.37645805505151375, -0.2774886076602762, 0.11753489559767051, 0.2384236435710381, 0.07823178029278867, -0.10744706760697927, -0.34867101597886246, 0.06612460564792855, -0.15690134414650786, -0.07494218343904671, -0.16398377277745077, 0.00935583303306395, -0.011490585492888035, -0.22782122190647686, 0.04575191819234393, 0.04515765600193005, 0.11390426321528278, -0.07316558167915971, -0.09254611783007231, 0.0657949204189488, 0.1859641057358553, 0.08160096521337087, 0.026433566635835, 0.1787722574590589, -0.2001373743495116, -0.1658764754090673, 0.39708562177391005, 0.011751663154707504, -0.1592946876312803, 0.19576705769913344, -0.01994480511236291, -0.2297187879180106, 0.10338925493236345, 0.28034029995447224, 0.09758857549884571, -0.18586959508964077, 0.02805792758926355, 0.04252949188902186, 0.11198716346049108, -0.009373905061063571, 0.02720640282272003, 0.24208666842325607, 0.3660837169020222, 0.08422355229805152, 0.09503430913453205, -0.1159384947095532, -0.12449640650839473, -0.1906358615446012, -0.11376445647329092, -0.12162074331158343, -0.007474561730095257, -0.11575786574086613, -0.12661718050591075, 0.43027241840564573, 0.20834014515947694, 0.20659469291254376, 0.022190574903596334, 0.3926983377538048, 0.027673247855720826, 0.04609950322460813, 0.047881282637648, 0.1768153863712751, -0.009231684194394173, 0.16735411620286939, -0.13414588305973807, 0.09270473178744745, 0.021476150279900488] |
1,802.06972 | Base sizes of primitive groups: bounds with explicit constants | We show that the minimal base size $b(G)$ of a finite primitive permutation
group $G$ of degree $n$ is at most $2 (\log |G|/\log n) + 24$. This bound is
asymptotically best possible since there exists a sequence of primitive
permutation groups $G$ of degrees $n$ such that $b(G) = \lfloor 2 (\log
|G|/\log n) \rceil - 2$ and $b(G)$ is unbounded. As a corollary we show that a
primitive permutation group of degree $n$ that does not contain the alternating
group $\mathrm{Alt}(n)$ has a base of size at most $\max\{\sqrt{n} , \ 25\}$.
| math.GR | we show that the minimal base size bg of a finite primitive permutation group g of degree n is at most 2 log glog n 24 this bound is asymptotically best possible since there exists a sequence of primitive permutation groups g of degrees n such that bg lfloor 2 log glog n rceil 2 and bg is unbounded as a corollary we show that a primitive permutation group of degree n that does not contain the alternating group mathrmaltn has a base of size at most maxsqrtn 25 | [['we', 'show', 'that', 'the', 'minimal', 'base', 'size', 'bg', 'of', 'a', 'finite', 'primitive', 'permutation', 'group', 'g', 'of', 'degree', 'n', 'is', 'at', 'most', '2', 'log', 'glog', 'n', '24', 'this', 'bound', 'is', 'asymptotically', 'best', 'possible', 'since', 'there', 'exists', 'a', 'sequence', 'of', 'primitive', 'permutation', 'groups', 'g', 'of', 'degrees', 'n', 'such', 'that', 'bg', 'lfloor', '2', 'log', 'glog', 'n', 'rceil', '2', 'and', 'bg', 'is', 'unbounded', 'as', 'a', 'corollary', 'we', 'show', 'that', 'a', 'primitive', 'permutation', 'group', 'of', 'degree', 'n', 'that', 'does', 'not', 'contain', 'the', 'alternating', 'group', 'mathrmaltn', 'has', 'a', 'base', 'of', 'size', 'at', 'most', 'maxsqrtn', '25']] | [-0.23318264059188745, 0.1990592135116458, -0.06526412296872795, 0.0004026456500581476, -0.04308160591158974, -0.18575555129562704, 0.09033535112328618, 0.3211650167215155, -0.2485560375616331, -0.3074509246965473, 0.06414860212296415, -0.31403303506334174, -0.1331925827701147, 0.13919865304415815, -0.08657004647780984, -0.044909461383744444, -0.010071967341256946, 0.19400186161772254, -0.03278868876101993, -0.3174073248578424, 0.25329118204208906, -0.058334471605550706, 0.19143471319040054, -0.027417753331279486, 0.07898138624778164, -0.0024637499761380505, 0.033915563177819665, 0.004253795945995979, -0.10060665773370386, 0.024419154417230172, 0.2825023466407248, 0.14898583359932632, 0.24303408608421306, -0.3139917656381646, -0.14422705896156893, 0.21799437860759457, 0.18651919962649935, -0.011971464192264535, -0.015953046353429222, -0.08376397513208932, 0.2287055278796012, -0.17788781777313345, -0.15029014064668772, 0.039447433168717315, 0.16231026330941847, -0.03618915190690019, -0.28971525939348874, -0.016204573456041014, 0.13384619491237604, 0.11020379726973813, 0.09938236570320605, -0.20968629878139897, -0.05663332551046735, 0.11102887809151009, -0.06145861725783331, 0.09568089370490208, 0.04104366650009591, -0.06603445791053388, -0.06646546449386671, 0.3768252297775464, -0.06764249330951591, -0.1459223441334881, 0.12553346483821698, -0.18102755820315874, -0.21274244448881638, 0.14683083227176344, 0.0737974408679129, 0.19938654564530328, 0.01680321738207608, 0.19037162930000928, -0.17920578097443232, 0.2606939228063219, 0.11979761191256595, 0.0013859759534845192, 0.06197748998745104, 0.1265769126207641, 0.12906919361688615, 0.08304633319461613, -0.02198433294222596, 0.05822519338467378, -0.36154268903846154, -0.18683995636967482, -0.2200785450155983, 0.15135655216522792, -0.19173686092786799, -0.14451933773810022, 0.3034141788656792, 0.05787003806823592, 0.17894163204545385, 0.14832789457162446, 0.1783039818839641, 0.021134303609338285, 0.05897584062571941, 0.1696812301884625, 0.059278655655975086, 0.14269381036375012, -0.13390042455971576, -0.1785243428416885, 0.026583135305914316, 0.14635035351933806] |
1,802.06973 | Bases of quasisimple linear groups | Let $V$ be a vector space of dimension $d$ over $F_q$, a finite field of $q$
elements, and let $G \le GL(V) \cong GL_d(q)$ be a linear group. A base of $G$
is a set of vectors whose pointwise stabiliser in $G$ is trivial. We prove that
if $G$ is a quasisimple group (i.e. $G$ is perfect and $G/Z(G)$ is simple)
acting irreducibly on $V$, then excluding two natural families, $G$ has a base
of size at most 6. The two families consist of alternating groups ${\rm Alt}_m$
acting on the natural module of dimension $d = m-1$ or $m-2$, and classical
groups with natural module of dimension $d$ over subfields of $F_q$.
| math.GR | let v be a vector space of dimension d over f_q a finite field of q elements and let g le glv cong gl_dq be a linear group a base of g is a set of vectors whose pointwise stabiliser in g is trivial we prove that if g is a quasisimple group ie g is perfect and gzg is simple acting irreducibly on v then excluding two natural families g has a base of size at most 6 the two families consist of alternating groups rm alt_m acting on the natural module of dimension d m1 or m2 and classical groups with natural module of dimension d over subfields of f_q | [['let', 'v', 'be', 'a', 'vector', 'space', 'of', 'dimension', 'd', 'over', 'f_q', 'a', 'finite', 'field', 'of', 'q', 'elements', 'and', 'let', 'g', 'le', 'glv', 'cong', 'gl_dq', 'be', 'a', 'linear', 'group', 'a', 'base', 'of', 'g', 'is', 'a', 'set', 'of', 'vectors', 'whose', 'pointwise', 'stabiliser', 'in', 'g', 'is', 'trivial', 'we', 'prove', 'that', 'if', 'g', 'is', 'a', 'quasisimple', 'group', 'ie', 'g', 'is', 'perfect', 'and', 'gzg', 'is', 'simple', 'acting', 'irreducibly', 'on', 'v', 'then', 'excluding', 'two', 'natural', 'families', 'g', 'has', 'a', 'base', 'of', 'size', 'at', 'most', '6', 'the', 'two', 'families', 'consist', 'of', 'alternating', 'groups', 'rm', 'alt_m', 'acting', 'on', 'the', 'natural', 'module', 'of', 'dimension', 'd', 'm1', 'or', 'm2', 'and', 'classical', 'groups', 'with', 'natural', 'module', 'of', 'dimension', 'd', 'over', 'subfields', 'of', 'f_q']] | [-0.2584471631258189, 0.17768933406405923, -0.06375321319016318, -0.073969897563435, -0.10164378405976537, -0.15429986328744488, -0.013160772364678885, 0.366044290145641, -0.305737625451985, -0.2059780781132144, 0.053451644667835384, -0.2608377479503418, -0.0743478464617117, 0.2157480616000825, -0.08488361544902898, -0.10661688836203334, 0.020624573373965716, 0.22113485953158085, -0.06602396480193748, -0.29926443338679437, 0.3439149012147273, -0.12668211216123793, 0.18441977397631015, -0.04150372007358316, 0.12906601023231004, 0.020578157492317596, 0.02098497484080695, 0.03315820890192471, -0.11295026980650134, 0.08120035817259336, 0.28952871131299585, 0.09151091824310857, 0.268052891433776, -0.30388328750189897, -0.19570554349454003, 0.25649996402228736, 0.12101006198271706, -0.06423172416786353, 0.015144178081673008, -0.21096033310341472, 0.19400506574861906, -0.17942908145293282, -0.09839185751001309, 0.009264296965321174, 0.19867317668510484, -0.02116014655293511, -0.34572814512360206, -0.032051626247823706, 0.09674776626408922, 0.16983563108537514, 0.028345765950795902, -0.18319285287614073, -0.08801625947770034, 0.07360657019989549, -0.08682917588105139, 0.12124909103957114, 0.06860606382424767, -0.04589033380427675, -0.09441411368934824, 0.4207486095334831, -0.10658119252236846, -0.1986316849817396, 0.14279888804083238, -0.17792711788704535, -0.10191771201579622, 0.10336809557954874, 0.1518548975388209, 0.17736886503795782, 0.0343746858825152, 0.26603416666264756, -0.1694520754941009, 0.1257138711542965, 0.08119826166059922, -0.026405166507371375, 0.11746263406674697, 0.09510600113368652, 0.13349756255257153, 0.07208763186920535, 0.01978149626253022, 0.13132618448218783, -0.3697810188472808, -0.15507929451629385, -0.15896789055435104, 0.15847133588557644, -0.13635666627682816, -0.13577987786449558, 0.3856310283740026, -0.015592831223133347, 0.1852991037062361, 0.07258190361044563, 0.19304208542631418, 0.03415533095540013, 0.0791358048062738, 0.12914678625141582, 0.022338112144991085, 0.2699352869730409, -0.15804372931755073, -0.14766456440997286, -0.04866755347770244, 0.20093823069924707] |
1,802.06974 | The Weyl-Kac weight formula | We provide the first formulae for the weights of all simple highest weight
modules over Kac-Moody algebras. For generic highest weights, we present a
formula for the weights of simple modules similar to the Weyl-Kac character
formula. For the remaining highest weights, the formula fails in a striking
way, suggesting the existence of 'multiplicity-free' Macdonald identities for
affine root systems.
| math.RT math.CO math.QA | we provide the first formulae for the weights of all simple highest weight modules over kacmoody algebras for generic highest weights we present a formula for the weights of simple modules similar to the weylkac character formula for the remaining highest weights the formula fails in a striking way suggesting the existence of multiplicityfree macdonald identities for affine root systems | [['we', 'provide', 'the', 'first', 'formulae', 'for', 'the', 'weights', 'of', 'all', 'simple', 'highest', 'weight', 'modules', 'over', 'kacmoody', 'algebras', 'for', 'generic', 'highest', 'weights', 'we', 'present', 'a', 'formula', 'for', 'the', 'weights', 'of', 'simple', 'modules', 'similar', 'to', 'the', 'weylkac', 'character', 'formula', 'for', 'the', 'remaining', 'highest', 'weights', 'the', 'formula', 'fails', 'in', 'a', 'striking', 'way', 'suggesting', 'the', 'existence', 'of', 'multiplicityfree', 'macdonald', 'identities', 'for', 'affine', 'root', 'systems']] | [-0.15042282242017488, 0.028375995961080966, -0.05632504178211093, 0.07689498115796596, -0.13343535892199726, -0.18981891574027637, 0.03247646654684407, 0.3614966952241957, -0.3155997014294068, -0.15973798471192518, 0.047927356874182196, -0.2083081832776467, -0.18344721142202616, 0.2363935092308869, -0.09561760739112894, -0.009505632892251014, 0.07376579878618941, 0.11063351969205541, -0.12937461899903913, -0.2926911209089061, 0.3562763118495544, 0.06773857948913549, 0.25461777260837454, 0.04753453191951849, 0.1617142041194408, 0.048121404841852684, 0.0062083413048336904, -0.10182692655362188, -0.15525187271026272, 0.1633084675918023, 0.31432843105867503, 0.044514086951191224, 0.207606684587275, -0.3354700264210502, -0.07260741020242373, 0.19690936227949957, 0.14574602857852975, 0.09706042278558016, -0.0033886922523379327, -0.16319058757896224, 0.1287700470847388, -0.27305660041359564, -0.17625069584076603, -0.07939267922192812, 0.0772588268853724, 0.019655346435805163, -0.25575737554269534, 0.08028029867758353, 0.0873312105735143, 0.08814980322495103, -0.1943379499949515, -0.2241197838758429, -0.0027460802346467974, 0.13602185452667376, -0.09992505380262931, -0.06103538014770796, 0.017158590986703835, -0.19069964911711093, -0.17349511981010438, 0.31571163355062404, -0.016034471740325292, -0.2097857444236676, 0.10926884946723779, -0.19285043383327624, -0.18434535978982847, 0.11448926950494448, 0.044709490759608644, 0.09580170884534406, -0.0923104756201307, 0.05548649811341117, -0.10335078511076669, -0.014879106683656574, 0.08791115127969533, 0.004975169353807966, 0.18964221811232468, 0.028282089872906604, 0.03251794218085706, 0.17334688083889585, 0.02032153878050546, -0.015095465638053914, -0.37596102568010487, -0.22524829698571314, -0.14373246055911296, 0.03771305611977974, -0.18312191951554269, -0.17697977141166726, 0.44960154020227494, 0.11108831673433693, 0.24145767061660686, 0.2187580826343037, 0.17780420824807758, 0.15577110213538012, 0.1896492190969487, 0.04316928256303072, 0.10482615078023325, 0.22738393942515056, 0.007255883663068137, -0.11924680880426118, 0.06506631426212456, 0.2066110137073944] |
1,802.06975 | New polarimetric and spectroscopic evidence of anomalous enrichment in
spinel-bearing Calcium-Aluminium-rich Inclusions among L-type asteroids | Asteroids can be classified into several groups based on their spectral
reflectance. Among these groups, the one belonging to the L-class in the
taxonomic classification based on visible and near-infrared spectra exhibit
several peculiar properties. First, their near-infrared spectrum is
characterized by a strong absorption band interpreted as the diagnostic of a
high content of the FeO bearing spinel mineral. This mineral is one of the main
constituents of Calcium-Aluminum-rich Inclusions (CAI) the oldest mineral
compounds found in the solar system. In polarimetry, they possess an uncommonly
large value of the inversion angle incompatible with all known asteroid
belonging to other taxonomical classes. Asteroids found to possess such a high
inversion angle are commonly called Barbarians based on the first asteroid on
which this property was first identified, (234)~Barbara. In this paper we
present the results of an extensive campaign of polarimetric and spectroscopic
observations of L-class objects. We have derived phase-polarization curves for
a sample of 7 Barbarians, finding a variety of inversion angles ranging between
25 and 30$^{\circ}$. Spectral reflectance data exhibit variations in terms of
spectral slope and absorption features in the near-infrared. We analyzed these
data using a Hapke model to obtain some inferences about the relative abundance
of CAI and other mineral compounds. By combining spectroscopic and polarimetric
results, we find evidence that the polarimetric inversion angle is directly
correlated with the presence of CAI, and the peculiar polarimetric properties
of Barbarians are primarily a consequence of their anomalous composition.
| astro-ph.EP | asteroids can be classified into several groups based on their spectral reflectance among these groups the one belonging to the lclass in the taxonomic classification based on visible and nearinfrared spectra exhibit several peculiar properties first their nearinfrared spectrum is characterized by a strong absorption band interpreted as the diagnostic of a high content of the feo bearing spinel mineral this mineral is one of the main constituents of calciumaluminumrich inclusions cai the oldest mineral compounds found in the solar system in polarimetry they possess an uncommonly large value of the inversion angle incompatible with all known asteroid belonging to other taxonomical classes asteroids found to possess such a high inversion angle are commonly called barbarians based on the first asteroid on which this property was first identified 234barbara in this paper we present the results of an extensive campaign of polarimetric and spectroscopic observations of lclass objects we have derived phasepolarization curves for a sample of 7 barbarians finding a variety of inversion angles ranging between 25 and 30circ spectral reflectance data exhibit variations in terms of spectral slope and absorption features in the nearinfrared we analyzed these data using a hapke model to obtain some inferences about the relative abundance of cai and other mineral compounds by combining spectroscopic and polarimetric results we find evidence that the polarimetric inversion angle is directly correlated with the presence of cai and the peculiar polarimetric properties of barbarians are primarily a consequence of their anomalous composition | [['asteroids', 'can', 'be', 'classified', 'into', 'several', 'groups', 'based', 'on', 'their', 'spectral', 'reflectance', 'among', 'these', 'groups', 'the', 'one', 'belonging', 'to', 'the', 'lclass', 'in', 'the', 'taxonomic', 'classification', 'based', 'on', 'visible', 'and', 'nearinfrared', 'spectra', 'exhibit', 'several', 'peculiar', 'properties', 'first', 'their', 'nearinfrared', 'spectrum', 'is', 'characterized', 'by', 'a', 'strong', 'absorption', 'band', 'interpreted', 'as', 'the', 'diagnostic', 'of', 'a', 'high', 'content', 'of', 'the', 'feo', 'bearing', 'spinel', 'mineral', 'this', 'mineral', 'is', 'one', 'of', 'the', 'main', 'constituents', 'of', 'calciumaluminumrich', 'inclusions', 'cai', 'the', 'oldest', 'mineral', 'compounds', 'found', 'in', 'the', 'solar', 'system', 'in', 'polarimetry', 'they', 'possess', 'an', 'uncommonly', 'large', 'value', 'of', 'the', 'inversion', 'angle', 'incompatible', 'with', 'all', 'known', 'asteroid', 'belonging', 'to', 'other', 'taxonomical', 'classes', 'asteroids', 'found', 'to', 'possess', 'such', 'a', 'high', 'inversion', 'angle', 'are', 'commonly', 'called', 'barbarians', 'based', 'on', 'the', 'first', 'asteroid', 'on', 'which', 'this', 'property', 'was', 'first', 'identified', '234barbara', 'in', 'this', 'paper', 'we', 'present', 'the', 'results', 'of', 'an', 'extensive', 'campaign', 'of', 'polarimetric', 'and', 'spectroscopic', 'observations', 'of', 'lclass', 'objects', 'we', 'have', 'derived', 'phasepolarization', 'curves', 'for', 'a', 'sample', 'of', '7', 'barbarians', 'finding', 'a', 'variety', 'of', 'inversion', 'angles', 'ranging', 'between', '25', 'and', '30circ', 'spectral', 'reflectance', 'data', 'exhibit', 'variations', 'in', 'terms', 'of', 'spectral', 'slope', 'and', 'absorption', 'features', 'in', 'the', 'nearinfrared', 'we', 'analyzed', 'these', 'data', 'using', 'a', 'hapke', 'model', 'to', 'obtain', 'some', 'inferences', 'about', 'the', 'relative', 'abundance', 'of', 'cai', 'and', 'other', 'mineral', 'compounds', 'by', 'combining', 'spectroscopic', 'and', 'polarimetric', 'results', 'we', 'find', 'evidence', 'that', 'the', 'polarimetric', 'inversion', 'angle', 'is', 'directly', 'correlated', 'with', 'the', 'presence', 'of', 'cai', 'and', 'the', 'peculiar', 'polarimetric', 'properties', 'of', 'barbarians', 'are', 'primarily', 'a', 'consequence', 'of', 'their', 'anomalous', 'composition']] | [-0.07358681400531719, 0.09869900677454768, -0.08716367038547015, 0.03798272114888322, -0.06902096286219483, -0.08229200645220146, 0.024599371377052356, 0.4157781513640657, -0.2401628220491073, -0.3721415366248426, 0.1057564062133172, -0.2990743474515735, -0.1321502844230501, 0.19010838747814635, -0.08424366870895028, 0.01702142627976575, 0.02820549399561447, -0.0537386844504804, -0.05888262078820606, -0.19608149123778873, 0.29240017910831473, 0.02802511132093238, 0.21335819438786902, -0.007903869407915617, 0.048361942333314326, -0.05329628006200169, -0.06095879424180164, 0.007054420243414333, -0.12776689020240872, 0.14849072206692893, 0.24575902513117667, 0.09244538707559409, 0.13546372893396155, -0.3297416186145949, -0.20559193876755164, 0.07394600047235621, 0.10337023468643759, 0.03805061144950861, -0.0742890757926526, -0.27976074865179473, 0.07307986211275956, -0.12380861802232741, -0.13885331897210085, -0.03723281713920172, 0.0177198049257372, 0.04622157002736234, -0.2116269323379412, 0.06748226652834106, 0.0367716463039914, 0.17508579232562027, -0.15052169802709345, -0.18820079602825943, -0.07791205247116016, 0.11763121923679852, 0.04760244202496652, -0.05756270143814856, 0.08070466327519141, -0.09865533413277695, -0.07465232647506932, 0.41357925254279043, -0.0691848733857442, -0.043595763280239626, 0.2119999188609177, -0.1739665561996889, -0.1756544384712231, 0.1709596971298003, 0.15511226252133606, 0.15106588437939522, -0.15712006362231418, 0.01203027422579013, -0.07741215013227136, 0.20206962132322617, 0.06005762222501617, 0.10408167373656188, 0.23666634199545397, 0.13040635462842698, 0.00038327861168864567, 0.11756716606438114, -0.20765367625319384, 0.0047078896762390975, -0.21852418703583382, -0.16937919700189996, -0.17500344615622393, 0.04440284443668044, -0.09596602067969917, -0.15993070217292207, 0.38304888293505873, 0.11233184689304745, 0.22048014439795105, -0.009156913786160866, 0.238728513456423, 0.05417459963040319, 0.10380179711024003, 0.024287700069091114, 0.3068562254036985, 0.15169258486120732, 0.09592920965915851, -0.20556212021381456, 0.12257186365962701, 0.013561046340686009] |
1,802.06976 | The critical exponent: a novel graph invariant | A surprising result of FitzGerald and Horn (1977) shows that $A^{\circ
\alpha} := (a_{ij}^\alpha)$ is positive semidefinite (p.s.d.) for every
entrywise nonnegative $n \times n$ p.s.d. matrix $A = (a_{ij})$ if and only if
$\alpha$ is a positive integer or $\alpha \geq n-2$. Given a graph $G$, we
consider the refined problem of characterizing the set $\mathcal{H}_G$ of
entrywise powers preserving positivity for matrices with a zero pattern encoded
by $G$. Using algebraic and combinatorial methods, we study how the geometry of
$G$ influences the set $\mathcal{H}_G$. Our treatment provides new and exciting
connections between combinatorics and analysis, and leads us to introduce and
compute a new graph invariant called the critical exponent.
| math.CO math.FA | a surprising result of fitzgerald and horn 1977 shows that acirc alpha a_ijalpha is positive semidefinite psd for every entrywise nonnegative n times n psd matrix a a_ij if and only if alpha is a positive integer or alpha geq n2 given a graph g we consider the refined problem of characterizing the set mathcalh_g of entrywise powers preserving positivity for matrices with a zero pattern encoded by g using algebraic and combinatorial methods we study how the geometry of g influences the set mathcalh_g our treatment provides new and exciting connections between combinatorics and analysis and leads us to introduce and compute a new graph invariant called the critical exponent | [['a', 'surprising', 'result', 'of', 'fitzgerald', 'and', 'horn', '1977', 'shows', 'that', 'acirc', 'alpha', 'a_ijalpha', 'is', 'positive', 'semidefinite', 'psd', 'for', 'every', 'entrywise', 'nonnegative', 'n', 'times', 'n', 'psd', 'matrix', 'a', 'a_ij', 'if', 'and', 'only', 'if', 'alpha', 'is', 'a', 'positive', 'integer', 'or', 'alpha', 'geq', 'n2', 'given', 'a', 'graph', 'g', 'we', 'consider', 'the', 'refined', 'problem', 'of', 'characterizing', 'the', 'set', 'mathcalh_g', 'of', 'entrywise', 'powers', 'preserving', 'positivity', 'for', 'matrices', 'with', 'a', 'zero', 'pattern', 'encoded', 'by', 'g', 'using', 'algebraic', 'and', 'combinatorial', 'methods', 'we', 'study', 'how', 'the', 'geometry', 'of', 'g', 'influences', 'the', 'set', 'mathcalh_g', 'our', 'treatment', 'provides', 'new', 'and', 'exciting', 'connections', 'between', 'combinatorics', 'and', 'analysis', 'and', 'leads', 'us', 'to', 'introduce', 'and', 'compute', 'a', 'new', 'graph', 'invariant', 'called', 'the', 'critical', 'exponent']] | [-0.15531713169872421, 0.10058229221877726, -0.07559229413216764, 0.0429947486972775, -0.09178871094429103, -0.22042625020681458, 0.05038343716772612, 0.309778790760108, -0.2851191504096443, -0.2653396514625373, 0.0946897848805582, -0.2999443897469477, -0.21207376929973676, 0.12385819430750086, -0.05911379653791135, 0.033211225559088314, 0.03265425216575915, 0.0655724952082065, -0.10152705309757783, -0.20800139508263038, 0.3491258930372582, -0.02850413451987234, 0.16007197099653156, 0.08684805702750137, 0.14448328486813064, 0.03916713516227901, -0.051099749603732064, 0.0378377644831992, -0.1676295471677308, 0.10369225891878489, 0.2522560699239627, 0.19942723919891497, 0.2672173800200901, -0.3501718596669062, -0.12176513404331424, 0.1992880003484474, 0.09368467027406123, -0.018618902293118564, -0.018884708220139147, -0.2186958661641587, 0.15857068411794237, -0.11294091432778673, -0.1115471926364328, -0.07730610430113632, 0.13522660976953127, -0.04265851741021669, -0.34129796865480866, 0.02897671524604613, 0.10255126631818712, 0.046225973828272385, 0.02147982510399412, -0.18957167053066024, 0.021828221585813233, 0.09713783298238096, -0.010946352484593675, 0.04659412449479781, 0.07441221609055489, -0.05101310861381617, -0.09554631877267225, 0.3267320713705637, -0.043639798648655415, -0.22048524191433733, 0.08634609037332915, -0.16130163031630218, -0.16961949156935918, 0.11916607164523818, 0.12659069036387585, 0.163547149639238, -0.015783586619760502, 0.18427791006662037, -0.11646378913640298, 0.1843074769628319, 0.0969738421453671, -0.018626787026666782, 0.14047727152197198, 0.07200928367462686, 0.1495603268077089, 0.1600825246920894, 0.014255956615406004, 0.03146341495977884, -0.3011038549752398, -0.12974774606779896, -0.20685016017364846, 0.14358200287044218, -0.16782321367235536, -0.16849594153040512, 0.40746069741858676, 0.044728639793836254, 0.19933907441445625, 0.13633217088539493, 0.2122165905227038, 0.12511704989460254, -0.02381992236372422, 0.09725335838103837, 0.08002540734173222, 0.2389791558941149, 0.02441411336714571, -0.2094715412071144, 0.053282201108099385, 0.14956604363396764] |
1,802.06977 | Multiband Gravitational-Wave Astronomy: Observing binary inspirals with
a decihertz detector, B-DECIGO | An evolving Japanese gravitational-wave (GW) mission in the deci-Hz band:
B-DECIGO (DECihertz laser Interferometer Gravitational wave Observatory) will
enable us to detect GW150914-like binary black holes, GW170817-like binary
neutron stars, and intermediate-mass binary black holes out to cosmological
distances. The B-DECIGO band slots in between the aLIGO-Virgo-KAGRA-IndIGO
(hecto-Hz) and LISA (milli-Hz) bands for broader bandwidth; the sources
described emit GWs for weeks to years across the multiband to accumulate high
signal-to-noise ratios. This suggests the possibility that joint detection
would greatly improve the parameter estimation of the binaries. We examine
B-DECIGO's ability to measure binary parameters and assess to what extent
multiband analysis could improve such measurement. Using non-precessing
post-Newtonian waveforms with the Fisher matrix approach, we find for systems
like GW150914 and GW170817 that B-DECIGO can measure the mass ratio to within
$< 0.1\%$, the individual black-hole spins to within $< 10\%$, and the
coalescence time to within $< 5\,$s about a week before alerting aLIGO and
electromagnetic facilities. Prior information from B-DECIGO for aLIGO can
further reduce the uncertainty in the measurement of, e.g., certain neutron
star tidally-induced deformations by factor of $\sim 6$, and potentially
determine the spin-induced neutron star quadrupole moment. Joint LISA and
B-DECIGO measurement will also be able to recover the masses and spins of
intermediate-mass binary black holes at percent-level precision. However, there
will be a large systematic bias in these results due to post-Newtonian
approximation of exact GW signals.
| gr-qc astro-ph.HE | an evolving japanese gravitationalwave gw mission in the decihz band bdecigo decihertz laser interferometer gravitational wave observatory will enable us to detect gw150914like binary black holes gw170817like binary neutron stars and intermediatemass binary black holes out to cosmological distances the bdecigo band slots in between the aligovirgokagraindigo hectohz and lisa millihz bands for broader bandwidth the sources described emit gws for weeks to years across the multiband to accumulate high signaltonoise ratios this suggests the possibility that joint detection would greatly improve the parameter estimation of the binaries we examine bdecigos ability to measure binary parameters and assess to what extent multiband analysis could improve such measurement using nonprecessing postnewtonian waveforms with the fisher matrix approach we find for systems like gw150914 and gw170817 that bdecigo can measure the mass ratio to within 01 the individual blackhole spins to within 10 and the coalescence time to within 5s about a week before alerting aligo and electromagnetic facilities prior information from bdecigo for aligo can further reduce the uncertainty in the measurement of eg certain neutron star tidallyinduced deformations by factor of sim 6 and potentially determine the spininduced neutron star quadrupole moment joint lisa and bdecigo measurement will also be able to recover the masses and spins of intermediatemass binary black holes at percentlevel precision however there will be a large systematic bias in these results due to postnewtonian approximation of exact gw signals | [['an', 'evolving', 'japanese', 'gravitationalwave', 'gw', 'mission', 'in', 'the', 'decihz', 'band', 'bdecigo', 'decihertz', 'laser', 'interferometer', 'gravitational', 'wave', 'observatory', 'will', 'enable', 'us', 'to', 'detect', 'gw150914like', 'binary', 'black', 'holes', 'gw170817like', 'binary', 'neutron', 'stars', 'and', 'intermediatemass', 'binary', 'black', 'holes', 'out', 'to', 'cosmological', 'distances', 'the', 'bdecigo', 'band', 'slots', 'in', 'between', 'the', 'aligovirgokagraindigo', 'hectohz', 'and', 'lisa', 'millihz', 'bands', 'for', 'broader', 'bandwidth', 'the', 'sources', 'described', 'emit', 'gws', 'for', 'weeks', 'to', 'years', 'across', 'the', 'multiband', 'to', 'accumulate', 'high', 'signaltonoise', 'ratios', 'this', 'suggests', 'the', 'possibility', 'that', 'joint', 'detection', 'would', 'greatly', 'improve', 'the', 'parameter', 'estimation', 'of', 'the', 'binaries', 'we', 'examine', 'bdecigos', 'ability', 'to', 'measure', 'binary', 'parameters', 'and', 'assess', 'to', 'what', 'extent', 'multiband', 'analysis', 'could', 'improve', 'such', 'measurement', 'using', 'nonprecessing', 'postnewtonian', 'waveforms', 'with', 'the', 'fisher', 'matrix', 'approach', 'we', 'find', 'for', 'systems', 'like', 'gw150914', 'and', 'gw170817', 'that', 'bdecigo', 'can', 'measure', 'the', 'mass', 'ratio', 'to', 'within', '01', 'the', 'individual', 'blackhole', 'spins', 'to', 'within', '10', 'and', 'the', 'coalescence', 'time', 'to', 'within', '5s', 'about', 'a', 'week', 'before', 'alerting', 'aligo', 'and', 'electromagnetic', 'facilities', 'prior', 'information', 'from', 'bdecigo', 'for', 'aligo', 'can', 'further', 'reduce', 'the', 'uncertainty', 'in', 'the', 'measurement', 'of', 'eg', 'certain', 'neutron', 'star', 'tidallyinduced', 'deformations', 'by', 'factor', 'of', 'sim', '6', 'and', 'potentially', 'determine', 'the', 'spininduced', 'neutron', 'star', 'quadrupole', 'moment', 'joint', 'lisa', 'and', 'bdecigo', 'measurement', 'will', 'also', 'be', 'able', 'to', 'recover', 'the', 'masses', 'and', 'spins', 'of', 'intermediatemass', 'binary', 'black', 'holes', 'at', 'percentlevel', 'precision', 'however', 'there', 'will', 'be', 'a', 'large', 'systematic', 'bias', 'in', 'these', 'results', 'due', 'to', 'postnewtonian', 'approximation', 'of', 'exact', 'gw', 'signals']] | [-0.1097082159614808, 0.13805497383664656, -0.0274953025676634, 0.1327690120270152, -0.12401135198205061, -0.0702432064683703, 0.09480625799295249, 0.3567126707933114, -0.18639543382248477, -0.366477407693215, 0.06466039772469388, -0.3207479376750796, -0.06096406516545634, 0.22795460435622575, -0.026859107798815746, 0.04486496508040506, 0.11530265715783057, -0.019754301043956177, -0.1401244749861729, -0.21625722354105875, 0.2777073286016947, 0.17514356806590828, 0.1472483027341735, -0.05056529406701093, 0.06003030640751367, 0.024481717671227195, -0.031555478590662066, -0.058022978689278595, -0.14726781800582894, 0.015148718247149626, 0.32895563731511607, 0.18902085647290653, 0.1898019864993251, -0.3874574259358823, -0.22128021836321315, 0.0922481445868945, 0.1228485969023693, 0.11959227336590866, -0.015215861180837712, -0.3449053669393913, 0.08551063274954566, -0.28103836710038393, -0.12717715298514004, -0.03670832934870344, 0.056215215466521765, 0.03890943375527454, -0.24145328486540718, 0.08132543824549825, 0.004311708888322439, -0.0929662846200897, -0.09868679979168203, -0.07567795333654984, 0.01729083390015623, 0.09565154646634651, 0.06266474198226048, 0.09225032742530026, 0.15543591006679217, -0.07340649765278415, -0.1036241435587568, 0.36613445582840104, -0.07638902332046596, -0.08233503130588518, 0.1521147956231447, -0.2677256761361723, -0.15797404946111468, 0.14146470714552814, 0.22939664278946229, 0.115732899797149, -0.16177637477040938, -0.009991387535189026, 0.12742547096852871, 0.28014067340358767, 0.14217585706779653, 0.09005142309419487, 0.4024077034474391, 0.131451579745044, 0.028226123487009952, 0.06514982386573177, -0.21899281308540833, 0.005334082495866586, -0.1907060938834152, -0.07359880508966339, -0.1549343454778073, 0.1036615601018876, -0.1510696561125097, -0.09825498672776714, 0.33247516799475185, 0.1701789775893659, 0.11011939095839372, 0.026879658145986942, 0.2675844820423663, 0.07175138407493131, 0.06684169244203393, 0.04605977742568306, 0.38867450855348423, 0.12345492045557045, 0.07437832024879754, -0.22013389634616348, 0.011400767391466575, -0.022793239621324058] |
1,802.06978 | Inner cohomology of $GL_n$ | We give an explicit description of the inner cohomology of an adelic locally
symmetric space of a given level structure attached to the general linear group
of prime rank $n$, with coefficients in a locally constant sheaf of complex
vector spaces. We show that for all prime $n$ the inner cohomology vanishes in
all degrees for nonconstant sheaves, otherwise the quotient module of the inner
cohomology classes that are not cuspidal is trivial in all degrees for primes
$n = 2,3$, and for all primes $n \geq 5$ it is trivial in all but finitely many
degrees where it has a `simple' description in terms of algebraic Hecke
characters.
| math.NT | we give an explicit description of the inner cohomology of an adelic locally symmetric space of a given level structure attached to the general linear group of prime rank n with coefficients in a locally constant sheaf of complex vector spaces we show that for all prime n the inner cohomology vanishes in all degrees for nonconstant sheaves otherwise the quotient module of the inner cohomology classes that are not cuspidal is trivial in all degrees for primes n 23 and for all primes n geq 5 it is trivial in all but finitely many degrees where it has a simple description in terms of algebraic hecke characters | [['we', 'give', 'an', 'explicit', 'description', 'of', 'the', 'inner', 'cohomology', 'of', 'an', 'adelic', 'locally', 'symmetric', 'space', 'of', 'a', 'given', 'level', 'structure', 'attached', 'to', 'the', 'general', 'linear', 'group', 'of', 'prime', 'rank', 'n', 'with', 'coefficients', 'in', 'a', 'locally', 'constant', 'sheaf', 'of', 'complex', 'vector', 'spaces', 'we', 'show', 'that', 'for', 'all', 'prime', 'n', 'the', 'inner', 'cohomology', 'vanishes', 'in', 'all', 'degrees', 'for', 'nonconstant', 'sheaves', 'otherwise', 'the', 'quotient', 'module', 'of', 'the', 'inner', 'cohomology', 'classes', 'that', 'are', 'not', 'cuspidal', 'is', 'trivial', 'in', 'all', 'degrees', 'for', 'primes', 'n', '23', 'and', 'for', 'all', 'primes', 'n', 'geq', '5', 'it', 'is', 'trivial', 'in', 'all', 'but', 'finitely', 'many', 'degrees', 'where', 'it', 'has', 'a', 'simple', 'description', 'in', 'terms', 'of', 'algebraic', 'hecke', 'characters']] | [-0.2529864006878429, 0.12032501148213567, -0.07347475912387448, 0.03587611716163034, -0.082293686582017, -0.14744530700974995, -0.06939640661908521, 0.3089498107632001, -0.3411387858882167, -0.20949070128025832, 0.053630971452178156, -0.23464351290129815, -0.12848291498246706, 0.2018179370055872, -0.10412033801656906, -0.03951847855501843, 0.011807066190090997, 0.17548210064759823, -0.07553813816479373, -0.3464675263514639, 0.39886890525964125, -0.03286398778221122, 0.16859982087690797, 0.009930825076514372, 0.09894071812137824, 0.02689579541846696, 0.036457338439369644, -0.060100552242484236, -0.11504711738975688, 0.11329097321463956, 0.40613184949055453, 0.031629444720844425, 0.2025303120306624, -0.38394678841965896, -0.09631227385640766, 0.21804343710687976, 0.13411769199323048, -0.002719994780986949, 0.011090827752249661, -0.1922584759088716, 0.14502457138237165, -0.1980347302224901, -0.1682605848526927, -0.10408281802234275, 0.12110982382674357, -0.022443368927472167, -0.26219757698331875, -0.013649313201851867, 0.09712872946962577, 0.17422989291932295, -0.0901757348781555, -0.15439332507473105, -0.03887349893166511, 0.10324934802095716, -0.042187898889770384, 0.021250788779138087, 0.07054744972588702, -0.12828458920638594, -0.08140982364097403, 0.3508987411192653, -0.04281098251575949, -0.24749837432884508, 0.11262834035463769, -0.22142390187622774, -0.1791099737833806, 0.1867167609571307, 0.05930743247477545, 0.162699060967565, 0.023026697742386238, 0.2291249313420849, -0.1578353527907489, 0.11717205700201534, 0.11171499955795568, 0.022385911440963996, 0.13804757788225455, 0.03406071281750445, 0.08979241316653012, 0.0775948924322923, 0.02309017341704694, -0.024080433086729264, -0.40512857517158546, -0.21778465612981193, -0.13419035135841653, 0.13356230499589905, -0.13643383688314417, -0.19030283975276957, 0.40955775399709604, 0.015627240022122686, 0.20846590655855834, 0.1421888196254494, 0.23870362578546284, 0.030743547879090463, 0.05522256120996274, 0.12445447397746008, 0.10888851258938236, 0.18072170419273553, -0.11742647175884081, -0.09827366623924011, -0.01190571934502158, 0.17475040447553275] |
1,802.06979 | Electrical Control of 2D Magnetism in Bilayer CrI3 | The challenge of controlling magnetism using electric fields raises
fundamental questions and addresses technological needs such as low-dissipation
magnetic memory. The recently reported two-dimensional (2D) magnets provide a
new system for studying this problem owing to their unique magnetic properties.
For instance, bilayer chromium triiodide (CrI3) behaves as a layered
antiferromagnet with a magnetic field-driven metamagnetic transition. Here, we
demonstrate electrostatic gate control of magnetism in CrI3 bilayers, probed by
magneto-optical Kerr effect (MOKE) microscopy. At fixed magnetic fields near
the metamagnetic transition, we realize voltage-controlled switching between
antiferromagnetic and ferromagnetic states. At zero magnetic field, we
demonstrate a time-reversal pair of layered antiferromagnetic states which
exhibit spin-layer locking, leading to a remarkable linear dependence of their
MOKE signals on gate voltage with opposite slopes. Our results pave the way for
exploring new magnetoelectric phenomena and van der Waals spintronics based on
2D materials.
| cond-mat.mes-hall | the challenge of controlling magnetism using electric fields raises fundamental questions and addresses technological needs such as lowdissipation magnetic memory the recently reported twodimensional 2d magnets provide a new system for studying this problem owing to their unique magnetic properties for instance bilayer chromium triiodide cri3 behaves as a layered antiferromagnet with a magnetic fielddriven metamagnetic transition here we demonstrate electrostatic gate control of magnetism in cri3 bilayers probed by magnetooptical kerr effect moke microscopy at fixed magnetic fields near the metamagnetic transition we realize voltagecontrolled switching between antiferromagnetic and ferromagnetic states at zero magnetic field we demonstrate a timereversal pair of layered antiferromagnetic states which exhibit spinlayer locking leading to a remarkable linear dependence of their moke signals on gate voltage with opposite slopes our results pave the way for exploring new magnetoelectric phenomena and van der waals spintronics based on 2d materials | [['the', 'challenge', 'of', 'controlling', 'magnetism', 'using', 'electric', 'fields', 'raises', 'fundamental', 'questions', 'and', 'addresses', 'technological', 'needs', 'such', 'as', 'lowdissipation', 'magnetic', 'memory', 'the', 'recently', 'reported', 'twodimensional', '2d', 'magnets', 'provide', 'a', 'new', 'system', 'for', 'studying', 'this', 'problem', 'owing', 'to', 'their', 'unique', 'magnetic', 'properties', 'for', 'instance', 'bilayer', 'chromium', 'triiodide', 'cri3', 'behaves', 'as', 'a', 'layered', 'antiferromagnet', 'with', 'a', 'magnetic', 'fielddriven', 'metamagnetic', 'transition', 'here', 'we', 'demonstrate', 'electrostatic', 'gate', 'control', 'of', 'magnetism', 'in', 'cri3', 'bilayers', 'probed', 'by', 'magnetooptical', 'kerr', 'effect', 'moke', 'microscopy', 'at', 'fixed', 'magnetic', 'fields', 'near', 'the', 'metamagnetic', 'transition', 'we', 'realize', 'voltagecontrolled', 'switching', 'between', 'antiferromagnetic', 'and', 'ferromagnetic', 'states', 'at', 'zero', 'magnetic', 'field', 'we', 'demonstrate', 'a', 'timereversal', 'pair', 'of', 'layered', 'antiferromagnetic', 'states', 'which', 'exhibit', 'spinlayer', 'locking', 'leading', 'to', 'a', 'remarkable', 'linear', 'dependence', 'of', 'their', 'moke', 'signals', 'on', 'gate', 'voltage', 'with', 'opposite', 'slopes', 'our', 'results', 'pave', 'the', 'way', 'for', 'exploring', 'new', 'magnetoelectric', 'phenomena', 'and', 'van', 'der', 'waals', 'spintronics', 'based', 'on', '2d', 'materials']] | [-0.2361496785904617, 0.19457645619533853, 0.007962766355679681, -0.009575186771851603, -0.09822112622269843, -0.20960485664545558, 0.07916527617918392, 0.4106316153645619, -0.2728170118967278, -0.308336948380909, -0.053040657998887276, -0.30375373511601034, -0.20070122627981213, 0.26744695955292425, 0.06689873921439154, 0.058105413656448945, -0.09367042358887072, -0.12110169510944818, -0.09890744228808519, -0.16718261771731907, 0.24308884656703514, -0.028297539097062934, 0.3438402452512592, 0.0898235180551031, 0.0851642575321926, -0.004759767311043106, 0.22217268706946117, 0.026813871819791127, -0.17007407647745115, 0.03192723301051754, 0.2581000706502689, -0.1899953021638794, 0.23031479919639727, -0.4833078954123064, -0.20052281831158325, -0.020606163358024787, 0.10975526503494216, 0.19131398157090493, -0.17523975264339242, -0.3298637293224197, 0.055287512433197766, -0.1138653672436097, -0.11204649345988098, -0.17853259799368162, -0.02825351803443886, 0.014468007879461058, -0.255870706325772, 0.0732117584751298, 0.10318124291208935, 0.16163944449499468, -0.09382873057297224, -0.09930107281009744, -0.037880119817499586, 0.06134245331910885, 0.018636548032292113, 0.07731373867459802, 0.19433324350393377, -0.1405304278563967, -0.20862626699252157, 0.34773557126754895, -0.03486832189082634, -0.037465175768981375, 0.1455841271591554, -0.20325858497300134, -0.07315280520480075, 0.08251581243328271, 0.15184894084167253, 0.0843388034453609, -0.12165247504081991, 0.08777507287393543, 0.021502902744234435, 0.1571483405552701, 0.08003551402362064, 0.12148515620437036, 0.35064360580872744, 0.24106211291250979, 0.04940011978356375, 0.19190583685768717, -0.10060041016388116, -0.01240816226022111, -0.1580502473787217, -0.19488767247983357, -0.23443897592369467, 0.09768415267656867, -0.049062077502235804, -0.2462778439447801, 0.399721809468853, 0.19274204104052237, 0.13309903448033664, -0.1097651180453896, 0.25571321579466005, 0.07425329645371272, 0.07509717439340118, -0.008930169156681385, 0.2792211646446958, 0.21581630709018404, 0.19106277932749233, -0.29445927245413056, 0.06682959308899525, 0.0004616148782790535] |
1,802.0698 | Low-virtuality leptoproduction of open-charm as a probe of the gluon
Sivers function | We propose low-virtuality leptoproduction of open-charm, $p^\uparrow l\to
D^0+X$, as a probe of the gluon Sivers function (GSF). At leading-order, this
process directly probes the gluon content of the proton, making detection of a
trasverse single-spin asymmetry in the process a clear indication of a non-zero
GSF. Considering the kinematics of the proposed future Electron-Ion Collider
(EIC), we present predictions for asymmetry using fits of the GSF available in
literature. We also study the asymmetry at the level of muons produced in
D-meson decays and find that the asymmetry is preserved therein as well.
| hep-ph | we propose lowvirtuality leptoproduction of opencharm puparrow lto d0x as a probe of the gluon sivers function gsf at leadingorder this process directly probes the gluon content of the proton making detection of a trasverse singlespin asymmetry in the process a clear indication of a nonzero gsf considering the kinematics of the proposed future electronion collider eic we present predictions for asymmetry using fits of the gsf available in literature we also study the asymmetry at the level of muons produced in dmeson decays and find that the asymmetry is preserved therein as well | [['we', 'propose', 'lowvirtuality', 'leptoproduction', 'of', 'opencharm', 'puparrow', 'lto', 'd0x', 'as', 'a', 'probe', 'of', 'the', 'gluon', 'sivers', 'function', 'gsf', 'at', 'leadingorder', 'this', 'process', 'directly', 'probes', 'the', 'gluon', 'content', 'of', 'the', 'proton', 'making', 'detection', 'of', 'a', 'trasverse', 'singlespin', 'asymmetry', 'in', 'the', 'process', 'a', 'clear', 'indication', 'of', 'a', 'nonzero', 'gsf', 'considering', 'the', 'kinematics', 'of', 'the', 'proposed', 'future', 'electronion', 'collider', 'eic', 'we', 'present', 'predictions', 'for', 'asymmetry', 'using', 'fits', 'of', 'the', 'gsf', 'available', 'in', 'literature', 'we', 'also', 'study', 'the', 'asymmetry', 'at', 'the', 'level', 'of', 'muons', 'produced', 'in', 'dmeson', 'decays', 'and', 'find', 'that', 'the', 'asymmetry', 'is', 'preserved', 'therein', 'as', 'well']] | [-0.07952924348634258, 0.15927002646069052, -0.16426413886309152, 0.15996522116569473, -0.031432111837690874, -0.04599314402996672, 0.012917417165402683, 0.3555015371211113, -0.22332103883626028, -0.19876204705947348, -0.03807142657673447, -0.3180340336415396, 0.001882432714625392, 0.12599732148991796, 0.11540601483605031, 0.07148796908703874, 0.10263500335596261, -0.036442399836115295, -0.04421367116963431, -0.1577591469651589, 0.3044744992969177, 0.11533963732341285, 0.24561942253081548, 0.19824096181189582, 0.08228602870217254, 0.0817161656125018, -0.09358242043964965, -0.04063479076089558, -0.13053177151791764, 0.03821560519156597, 0.2539890986011033, 0.11634281991420173, 0.09803505006536681, -0.3506933765345684, -0.10567068810805037, 0.09842348737161487, 0.1791415960097345, 0.14654615793567433, -0.08650720860528689, -0.2526134822357406, 0.06394096939781961, -0.2523727563099675, -0.15275610565277997, -0.07686163830040123, 0.0008298230247311695, -0.045132187862319734, -0.37171348380375535, 0.12102139064440033, -0.028517182836914935, 0.033923409829136504, 0.002850935764370426, -0.20676051984511076, -0.060510070055663105, 0.029916011420409044, 0.09369163416133272, 0.13272053994625177, 0.1907924737490874, -0.18458418859048717, -0.1614438913967861, 0.36855027524213635, -0.07628517169305073, -0.15722630063061832, 0.08764077288409074, -0.25810195536663133, -0.1492564657562843, 0.08526275507224504, 0.22815154166062868, 0.13105776843925318, -0.17966374643747846, 0.07106705098500556, -0.035723230245733456, 0.1306506851037103, 0.08297780289888002, 0.07349739423001646, 0.2280374371762117, 0.2239438446378836, -0.01744401208575695, 0.11526954062883893, -0.13807308897175777, -0.019684767543328225, -0.4151297990903659, -0.12105545729038215, -0.09320847705815248, 0.06664058254025276, -0.027349431662143067, -0.09633940249250861, 0.3885480987248562, 0.12291143875148508, 0.2722350137323261, -0.031998752045535275, 0.3768786367189179, 0.11076673525585844, 0.054612170265529364, 0.0228251577234484, 0.2753593628595193, 0.13084334273502152, 0.159542477579527, -0.28357797116541894, 0.1139943876193576, -0.002426452283817594] |
1,802.06981 | Reachable Set Estimation and Safety Verification for Piecewise Linear
Systems with Neural Network Controllers | In this work, the reachable set estimation and safety verification problems
for a class of piecewise linear systems equipped with neural network
controllers are addressed. The neural network is considered to consist of
Rectified Linear Unit (ReLU) activation functions. A layer-by-layer approach is
developed for the output reachable set computation of ReLU neural networks. The
computation is formulated in the form of a set of manipulations for a union of
polytopes. Based on the output reachable set for neural network controllers,
the output reachable set for a piecewise linear feedback control system can be
estimated iteratively for a given finite-time interval. With the estimated
output reachable set, the safety verification for piecewise linear systems with
neural network controllers can be performed by checking the existence of
intersections of unsafe regions and output reach set. A numerical example is
presented to illustrate the effectiveness of our approach.
| cs.SY | in this work the reachable set estimation and safety verification problems for a class of piecewise linear systems equipped with neural network controllers are addressed the neural network is considered to consist of rectified linear unit relu activation functions a layerbylayer approach is developed for the output reachable set computation of relu neural networks the computation is formulated in the form of a set of manipulations for a union of polytopes based on the output reachable set for neural network controllers the output reachable set for a piecewise linear feedback control system can be estimated iteratively for a given finitetime interval with the estimated output reachable set the safety verification for piecewise linear systems with neural network controllers can be performed by checking the existence of intersections of unsafe regions and output reach set a numerical example is presented to illustrate the effectiveness of our approach | [['in', 'this', 'work', 'the', 'reachable', 'set', 'estimation', 'and', 'safety', 'verification', 'problems', 'for', 'a', 'class', 'of', 'piecewise', 'linear', 'systems', 'equipped', 'with', 'neural', 'network', 'controllers', 'are', 'addressed', 'the', 'neural', 'network', 'is', 'considered', 'to', 'consist', 'of', 'rectified', 'linear', 'unit', 'relu', 'activation', 'functions', 'a', 'layerbylayer', 'approach', 'is', 'developed', 'for', 'the', 'output', 'reachable', 'set', 'computation', 'of', 'relu', 'neural', 'networks', 'the', 'computation', 'is', 'formulated', 'in', 'the', 'form', 'of', 'a', 'set', 'of', 'manipulations', 'for', 'a', 'union', 'of', 'polytopes', 'based', 'on', 'the', 'output', 'reachable', 'set', 'for', 'neural', 'network', 'controllers', 'the', 'output', 'reachable', 'set', 'for', 'a', 'piecewise', 'linear', 'feedback', 'control', 'system', 'can', 'be', 'estimated', 'iteratively', 'for', 'a', 'given', 'finitetime', 'interval', 'with', 'the', 'estimated', 'output', 'reachable', 'set', 'the', 'safety', 'verification', 'for', 'piecewise', 'linear', 'systems', 'with', 'neural', 'network', 'controllers', 'can', 'be', 'performed', 'by', 'checking', 'the', 'existence', 'of', 'intersections', 'of', 'unsafe', 'regions', 'and', 'output', 'reach', 'set', 'a', 'numerical', 'example', 'is', 'presented', 'to', 'illustrate', 'the', 'effectiveness', 'of', 'our', 'approach']] | [-0.13298663254572105, -0.0043779987720645045, 0.005091477542707365, 0.012259936924985521, -0.04489238473446402, -0.19155564338083647, 0.06821644790980914, 0.37113546563491023, -0.3342244082596153, -0.25933677558978535, 0.14277291866912417, -0.23092380431735862, -0.1578047113391022, 0.24354406693481445, -0.08949131633383095, 0.234032923240878, 0.11916380784672059, 0.029822334254874964, -0.029278547427304447, -0.27976591365845643, 0.3069410070933223, -0.01942310361701944, 0.2461509171311986, -0.05940950359536769, 0.18039868060461156, -0.036661131817397774, 0.032579618112235136, 0.05293494187556973, -0.04426987324155587, 0.17642723245877925, 0.3245214429007818, 0.2216090268506477, 0.3490855363644149, -0.4331852318591451, -0.21647851498899598, 0.12415718200635675, 0.09439274035266614, 0.08292311182475254, 0.027263513401833247, -0.28523621847215175, 0.12571119090019126, -0.1681211959099802, -0.05010067288164202, -0.1057892953147729, -0.01719096559099853, 0.042257204886021235, -0.3518575326769217, -0.04669709987172933, 0.044263931627589445, 0.07325102141356632, -0.05563188712622919, -0.0824640161375362, -0.06889377492926504, 0.1145792484350426, -0.10767301559856493, 0.05249194965110964, 0.1773024183795277, -0.11165952384758945, -0.16683711927569128, 0.3048528511753331, -0.010970586998554023, -0.2670547697272101, 0.14697106154826917, -0.04233226656980736, -0.12254446025695397, 0.11855767911606252, 0.2655260697683345, 0.10046568537156468, -0.1728655811756441, 0.04941739339288962, -0.05622318653670484, 0.1668280429583145, 0.06054473768166994, -0.0024705052197183646, 0.1829204884970127, 0.28140027466077, 0.0975350102039743, 0.18280173723158516, -0.014891897569600276, -0.08270466473345861, -0.35070923177448854, -0.053786715320375274, -0.19569990318268538, -0.019850967786823437, -0.07810404199260855, -0.18201672089962315, 0.4109054026560705, 0.11080473957404699, 0.19436604215776268, 0.20573350922714867, 0.31397018115249886, 0.14719493186955696, 0.07814938389562223, 0.11115727666446505, 0.20315297329415605, 0.09934916298944911, 0.07120725768817628, -0.20289232025452417, 0.13361152293469936, 0.12805676277350533] |
1,802.06982 | Switching Purcell effect with nonlinear epsilon-near-zero media | An optical topological transition is defined as the change in the photonic
isofrequency surface around epsilon-near-zero (ENZ) frequencies which can
considerably change the spontaneous emission of a quantum emitter placed near a
metamaterial slab. Here, we show that due to the strong Kerr nonlinearity at
ENZ frequencies, a high power pulse can induce a sudden transition in the
topology of the iso-frequency dispersion curve, leading to a significant change
in the transmission of propagating as well as evanescent waves through the
metamaterial slab. This evanescent wave switch effect allows for the control of
spontaneous emission through modulation of the Purcell effect. We develop a
theory of the enhanced nonlinear response of ENZ media to s and p polarized
inputs and show that this nonlinear effect is stronger for p polarization and
is almost independent of the incident angle. We perform finite-difference
time-domain (FDTD) simulations to demonstrate the transient response of the
metamaterial slab to an ultrafast pulse and fast switching of the Purcell
effect at the sub-picosecond scale. The Purcell factor changes at ENZ by almost
a factor of three which is an order of magnitude stronger than that away from
ENZ. We also show that due to the inhomogeneous spatial field distribution
inside the multilayer metal-dielectric super-lattice, a unique spatial
topological transition metamaterial can be achieved by the control pulse
induced nonlinearity. Our work can lead to ultra-fast control of quantum
phenomena in ENZ metamaterials.
| physics.optics | an optical topological transition is defined as the change in the photonic isofrequency surface around epsilonnearzero enz frequencies which can considerably change the spontaneous emission of a quantum emitter placed near a metamaterial slab here we show that due to the strong kerr nonlinearity at enz frequencies a high power pulse can induce a sudden transition in the topology of the isofrequency dispersion curve leading to a significant change in the transmission of propagating as well as evanescent waves through the metamaterial slab this evanescent wave switch effect allows for the control of spontaneous emission through modulation of the purcell effect we develop a theory of the enhanced nonlinear response of enz media to s and p polarized inputs and show that this nonlinear effect is stronger for p polarization and is almost independent of the incident angle we perform finitedifference timedomain fdtd simulations to demonstrate the transient response of the metamaterial slab to an ultrafast pulse and fast switching of the purcell effect at the subpicosecond scale the purcell factor changes at enz by almost a factor of three which is an order of magnitude stronger than that away from enz we also show that due to the inhomogeneous spatial field distribution inside the multilayer metaldielectric superlattice a unique spatial topological transition metamaterial can be achieved by the control pulse induced nonlinearity our work can lead to ultrafast control of quantum phenomena in enz metamaterials | [['an', 'optical', 'topological', 'transition', 'is', 'defined', 'as', 'the', 'change', 'in', 'the', 'photonic', 'isofrequency', 'surface', 'around', 'epsilonnearzero', 'enz', 'frequencies', 'which', 'can', 'considerably', 'change', 'the', 'spontaneous', 'emission', 'of', 'a', 'quantum', 'emitter', 'placed', 'near', 'a', 'metamaterial', 'slab', 'here', 'we', 'show', 'that', 'due', 'to', 'the', 'strong', 'kerr', 'nonlinearity', 'at', 'enz', 'frequencies', 'a', 'high', 'power', 'pulse', 'can', 'induce', 'a', 'sudden', 'transition', 'in', 'the', 'topology', 'of', 'the', 'isofrequency', 'dispersion', 'curve', 'leading', 'to', 'a', 'significant', 'change', 'in', 'the', 'transmission', 'of', 'propagating', 'as', 'well', 'as', 'evanescent', 'waves', 'through', 'the', 'metamaterial', 'slab', 'this', 'evanescent', 'wave', 'switch', 'effect', 'allows', 'for', 'the', 'control', 'of', 'spontaneous', 'emission', 'through', 'modulation', 'of', 'the', 'purcell', 'effect', 'we', 'develop', 'a', 'theory', 'of', 'the', 'enhanced', 'nonlinear', 'response', 'of', 'enz', 'media', 'to', 's', 'and', 'p', 'polarized', 'inputs', 'and', 'show', 'that', 'this', 'nonlinear', 'effect', 'is', 'stronger', 'for', 'p', 'polarization', 'and', 'is', 'almost', 'independent', 'of', 'the', 'incident', 'angle', 'we', 'perform', 'finitedifference', 'timedomain', 'fdtd', 'simulations', 'to', 'demonstrate', 'the', 'transient', 'response', 'of', 'the', 'metamaterial', 'slab', 'to', 'an', 'ultrafast', 'pulse', 'and', 'fast', 'switching', 'of', 'the', 'purcell', 'effect', 'at', 'the', 'subpicosecond', 'scale', 'the', 'purcell', 'factor', 'changes', 'at', 'enz', 'by', 'almost', 'a', 'factor', 'of', 'three', 'which', 'is', 'an', 'order', 'of', 'magnitude', 'stronger', 'than', 'that', 'away', 'from', 'enz', 'we', 'also', 'show', 'that', 'due', 'to', 'the', 'inhomogeneous', 'spatial', 'field', 'distribution', 'inside', 'the', 'multilayer', 'metaldielectric', 'superlattice', 'a', 'unique', 'spatial', 'topological', 'transition', 'metamaterial', 'can', 'be', 'achieved', 'by', 'the', 'control', 'pulse', 'induced', 'nonlinearity', 'our', 'work', 'can', 'lead', 'to', 'ultrafast', 'control', 'of', 'quantum', 'phenomena', 'in', 'enz', 'metamaterials']] | [-0.18469856675295948, 0.17814726925866187, -0.06533802577128665, -0.02025356141900174, -0.10871501551877896, -0.12188724124255607, 0.036133353971832795, 0.47602770861901217, -0.27749022846781035, -0.2618538349347931, 0.014450958627818736, -0.26917988013569116, -0.20590795026066067, 0.22776629036031978, 0.00754582681949645, 0.06253836650679567, -0.05746343417262848, -0.0633108853816323, -0.02443539207580231, -0.12190122238135408, 0.28600751332765034, 0.05826849344662998, 0.341375938802045, 0.08148952892002792, 0.07643173328774461, -0.01894724243754616, 0.09628718651602265, 0.0033783835454615054, -0.08855096796506294, 0.06670693367583627, 0.24917608631826085, -0.04807476457916876, 0.23951967768232985, -0.4324962480656676, -0.26765601501910613, 0.013657899655330673, 0.16772650393767882, 0.1456293958876582, -0.06358045871839148, -0.2915808327330308, 0.04345619870138639, -0.10955166101447796, -0.1710072471937796, -0.02018809617276035, 0.005496320763101675, -0.005916276759215457, -0.27462738807613063, 0.034982567172476796, 0.09034409167953387, 0.04911465312638399, -0.021623018499852504, 0.008160658460899682, -0.025800938942958995, 0.04578765968730973, 0.009944127079876835, 0.009036960652476903, 0.17031649778344496, -0.13408677259921806, -0.11031735875107096, 0.38136960895953037, -0.10936531645606688, -0.11862317656913686, 0.11323358514987453, -0.21355893575760015, 0.0601775811144577, 0.2313846205242799, 0.22932027069303224, 0.09598028825737054, -0.058946256646176136, 0.03014233278927504, -0.0030837545448976324, 0.23046585999555508, 0.14663494580772596, 0.09767012949441008, 0.2107587607214385, 0.1681415905620532, 0.05534235510375288, 0.16819874247510413, -0.0949308987474069, 0.01355793392206779, -0.27148790676857076, -0.13598858234492303, -0.1900751266896851, 0.09685280403012303, -0.12299730329970647, -0.20535709746409492, 0.42047210216672176, 0.13362934020292647, 0.14159138402995314, -0.021825074509251863, 0.29087597903621903, 0.1924706879081757, 0.07650195869569809, 0.03092559253978464, 0.33644591711493116, 0.14895461153996697, 0.10638826741773824, -0.3048144636727017, 0.017924727043294807, -0.04962177593083421] |
1,802.06983 | Unsupervised Band Selection of Hyperspectral Images via Multi-dictionary
Sparse Representation | Hyperspectral images have far more spectral bands than ordinary multispectral
images. Rich band information provides more favorable conditions for the
tremendous applications. However, significant increase in the dimensionality of
spectral bands may lead to the curse of dimensionality, especially for
classification applications. Furthermore, there are a large amount of redundant
information among the raw image cubes due to water absorptions, sensor noises
and other influence factors. Band selection is a direct and effective method to
remove redundant information and reduce the spectral dimension for decreasing
computational complexity and avoiding the curse of dimensionality. In this
paper, we present a novel learning framework for band selection based on the
idea of sparse representation. More specifically, first each band is
approximately represented by the linear combination of other bands, then the
original band image can be represented by a multi-dictionary learning
mechanism. As a result, a group of weights can be obtained by sparse
optimization for all bands. Finally, the specific bands will be selected, if
they get higher weights than other bands in the representation of the original
image. Experimental results on three widely used hyperspectral datasets show
that our proposed algorithm achieves better performance in hyperspectral image
classification, when compared with other state-of-art band selection methods.
| cs.CV | hyperspectral images have far more spectral bands than ordinary multispectral images rich band information provides more favorable conditions for the tremendous applications however significant increase in the dimensionality of spectral bands may lead to the curse of dimensionality especially for classification applications furthermore there are a large amount of redundant information among the raw image cubes due to water absorptions sensor noises and other influence factors band selection is a direct and effective method to remove redundant information and reduce the spectral dimension for decreasing computational complexity and avoiding the curse of dimensionality in this paper we present a novel learning framework for band selection based on the idea of sparse representation more specifically first each band is approximately represented by the linear combination of other bands then the original band image can be represented by a multidictionary learning mechanism as a result a group of weights can be obtained by sparse optimization for all bands finally the specific bands will be selected if they get higher weights than other bands in the representation of the original image experimental results on three widely used hyperspectral datasets show that our proposed algorithm achieves better performance in hyperspectral image classification when compared with other stateofart band selection methods | [['hyperspectral', 'images', 'have', 'far', 'more', 'spectral', 'bands', 'than', 'ordinary', 'multispectral', 'images', 'rich', 'band', 'information', 'provides', 'more', 'favorable', 'conditions', 'for', 'the', 'tremendous', 'applications', 'however', 'significant', 'increase', 'in', 'the', 'dimensionality', 'of', 'spectral', 'bands', 'may', 'lead', 'to', 'the', 'curse', 'of', 'dimensionality', 'especially', 'for', 'classification', 'applications', 'furthermore', 'there', 'are', 'a', 'large', 'amount', 'of', 'redundant', 'information', 'among', 'the', 'raw', 'image', 'cubes', 'due', 'to', 'water', 'absorptions', 'sensor', 'noises', 'and', 'other', 'influence', 'factors', 'band', 'selection', 'is', 'a', 'direct', 'and', 'effective', 'method', 'to', 'remove', 'redundant', 'information', 'and', 'reduce', 'the', 'spectral', 'dimension', 'for', 'decreasing', 'computational', 'complexity', 'and', 'avoiding', 'the', 'curse', 'of', 'dimensionality', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'learning', 'framework', 'for', 'band', 'selection', 'based', 'on', 'the', 'idea', 'of', 'sparse', 'representation', 'more', 'specifically', 'first', 'each', 'band', 'is', 'approximately', 'represented', 'by', 'the', 'linear', 'combination', 'of', 'other', 'bands', 'then', 'the', 'original', 'band', 'image', 'can', 'be', 'represented', 'by', 'a', 'multidictionary', 'learning', 'mechanism', 'as', 'a', 'result', 'a', 'group', 'of', 'weights', 'can', 'be', 'obtained', 'by', 'sparse', 'optimization', 'for', 'all', 'bands', 'finally', 'the', 'specific', 'bands', 'will', 'be', 'selected', 'if', 'they', 'get', 'higher', 'weights', 'than', 'other', 'bands', 'in', 'the', 'representation', 'of', 'the', 'original', 'image', 'experimental', 'results', 'on', 'three', 'widely', 'used', 'hyperspectral', 'datasets', 'show', 'that', 'our', 'proposed', 'algorithm', 'achieves', 'better', 'performance', 'in', 'hyperspectral', 'image', 'classification', 'when', 'compared', 'with', 'other', 'stateofart', 'band', 'selection', 'methods']] | [-0.03301007721754836, 0.010878255194416497, -0.05331948474503872, 0.061519417019629076, -0.10727823309872936, -0.16722439791916346, 0.04783285375764003, 0.43642997758054153, -0.28974614047967806, -0.32898382022181843, 0.13384526441464337, -0.28340177678662104, -0.17197063644303054, 0.19034003102470462, -0.13112563055076795, 0.03512602668119277, 0.13199692779992958, -0.013443211497875248, -0.08912337279776339, -0.2809140897713738, 0.3038492924329348, 0.058684421482882124, 0.33001675935371255, 0.005281726284543189, 0.05481944076813439, 0.01568465480439311, -0.05527848521951677, 0.02768267061924789, -0.048557282540352346, 0.17496026875451207, 0.3402530024555035, 0.12444998377638801, 0.2948909472719562, -0.38663620949018657, -0.26624085361183414, 0.1068527514921365, 0.15479217768737638, 0.10814369511740884, -0.03717658119553007, -0.29469775961848294, 0.08685703672377801, -0.11899554820819304, -0.02259523395190538, -0.13345418891687763, -0.013888243557430985, -0.04106150104482545, -0.2843993766324186, 0.06853744424581414, 0.033445969923603824, 0.053078316660915933, -0.078458269231771, -0.1833756472745047, -0.04016449975145118, 0.12303158007462782, 0.03191495726066755, 0.017030658747819137, 0.10541951550943096, -0.1528354484644696, -0.11668980285218666, 0.40996155907604387, -0.05062011641027156, -0.18590750627946562, 0.21395427532971087, -0.0774104038321572, -0.1329218000775521, 0.2013565397480639, 0.1825218938813522, 0.07230373828830879, -0.11826307505245673, 0.028945129456725425, -0.025057970371279048, 0.2012923638268215, 0.07106056725152018, 0.1106677442334774, 0.15123111282407148, 0.19943096882425157, 0.10143812584418167, 0.12956991970323298, -0.17136524971801698, 0.025092130133927595, -0.1864877193984462, -0.12344428513698825, -0.251092885691877, -0.04069821276224968, -0.14512671821810327, -0.1217266376766308, 0.41362225571420136, 0.16789967672985967, 0.19600923758272717, 0.041452549782967786, 0.3292462562733307, 0.10354903485943995, 0.11980118411422776, 0.07272150661205737, 0.1937243062275939, 0.05054408269025749, 0.08099442721690937, -0.1632680980096821, 0.02649056982567034, 0.026740529674400642] |
1,802.06984 | Fitting New Speakers Based on a Short Untranscribed Sample | Learning-based Text To Speech systems have the potential to generalize from
one speaker to the next and thus require a relatively short sample of any new
voice. However, this promise is currently largely unrealized. We present a
method that is designed to capture a new speaker from a short untranscribed
audio sample. This is done by employing an additional network that given an
audio sample, places the speaker in the embedding space. This network is
trained as part of the speech synthesis system using various consistency
losses. Our results demonstrate a greatly improved performance on both the
dataset speakers, and, more importantly, when fitting new voices, even from
very short samples.
| cs.LG cs.SD eess.AS | learningbased text to speech systems have the potential to generalize from one speaker to the next and thus require a relatively short sample of any new voice however this promise is currently largely unrealized we present a method that is designed to capture a new speaker from a short untranscribed audio sample this is done by employing an additional network that given an audio sample places the speaker in the embedding space this network is trained as part of the speech synthesis system using various consistency losses our results demonstrate a greatly improved performance on both the dataset speakers and more importantly when fitting new voices even from very short samples | [['learningbased', 'text', 'to', 'speech', 'systems', 'have', 'the', 'potential', 'to', 'generalize', 'from', 'one', 'speaker', 'to', 'the', 'next', 'and', 'thus', 'require', 'a', 'relatively', 'short', 'sample', 'of', 'any', 'new', 'voice', 'however', 'this', 'promise', 'is', 'currently', 'largely', 'unrealized', 'we', 'present', 'a', 'method', 'that', 'is', 'designed', 'to', 'capture', 'a', 'new', 'speaker', 'from', 'a', 'short', 'untranscribed', 'audio', 'sample', 'this', 'is', 'done', 'by', 'employing', 'an', 'additional', 'network', 'that', 'given', 'an', 'audio', 'sample', 'places', 'the', 'speaker', 'in', 'the', 'embedding', 'space', 'this', 'network', 'is', 'trained', 'as', 'part', 'of', 'the', 'speech', 'synthesis', 'system', 'using', 'various', 'consistency', 'losses', 'our', 'results', 'demonstrate', 'a', 'greatly', 'improved', 'performance', 'on', 'both', 'the', 'dataset', 'speakers', 'and', 'more', 'importantly', 'when', 'fitting', 'new', 'voices', 'even', 'from', 'very', 'short', 'samples']] | [-0.045395156013074554, 0.02080618108749633, -0.090442629333854, 0.05249074392696121, -0.12173934051817334, -0.1744418141331423, 0.0522179276753754, 0.4232631466049399, -0.24304391700891895, -0.31547066387783335, 0.092058918693707, -0.2681959450395929, -0.1390281621500984, 0.27219745085515956, -0.1397495979342509, 0.06023552964298843, 0.13551771669304585, 0.05087072300506538, -0.03997056633611587, -0.2859584845031972, 0.2992808158018601, 0.04077025818395185, 0.3229440788923016, -0.0017557550863539044, 0.10995804358206622, -0.02029283552733145, -0.012344910939400261, -0.0506019280903012, -0.004676867473208731, 0.15254079299320275, 0.31414687713012435, 0.18423881735400977, 0.29290416937841623, -0.38535232012070186, -0.21740684473702498, 0.08316429438665174, 0.15198917041935428, 0.16730059378860132, -0.09481521468016482, -0.376349646463856, 0.10338425360250848, -0.1783869583956763, 0.027974135380842396, -0.08358398121823599, 0.006692834176450364, -0.01715729029551316, -0.2625933076750051, 0.022046384389033995, 0.1311768332311699, 0.09136652616733634, -0.041904526206807374, -0.10757505937651438, 0.05710083035320077, 0.1889978139947047, 0.053666204734294266, 0.07667625729028169, 0.09345188475557947, -0.16122845322237694, -0.06709197841937074, 0.37230863633590777, -0.08709541450019691, -0.20709841944243726, 0.22700494093199572, -0.032377057406749274, -0.13844106746166274, 0.12150414230150951, 0.22568572814752524, 0.11071653052040183, -0.2452975463627907, 0.00013297317897783474, -0.02252547944862362, 0.2922791930939163, 0.03679033659130066, 0.0019764119155100874, 0.17402051018261527, 0.2540948946922514, 0.022180659107566048, 0.159463762207091, -0.1275825885623727, 0.05038329129744959, -0.21904676645020912, -0.1018078238745262, -0.2250560762671133, 0.00048306348590968965, -0.0722322222430087, -0.11528841413448455, 0.41769127145426366, 0.2229457584352375, 0.18986039433779345, 0.137891123975367, 0.3368224138981319, 0.025987239382523404, 0.12065890266849483, 0.04247257949129955, 0.19315539085230715, -0.010790596625910283, 0.14671630170280198, -0.15411010320164129, 0.10651028815547826, -0.00652563957883431] |
1,802.06985 | Binary linear complementary dual codes | Linear complementary dual codes (or codes with complementary duals) are codes
whose intersections with their dual codes are trivial. We study binary linear
complementary dual $[n,k]$ codes with the largest minimum weight among all
binary linear complementary dual $[n,k]$ codes. We characterize binary linear
complementary dual codes with the largest minimum weight for small dimensions.
A complete classification of binary linear complementary dual $[n,k]$ codes
with the largest minimum weight is also given for $1 \le k \le n \le 16$.
| math.CO cs.IT math.IT | linear complementary dual codes or codes with complementary duals are codes whose intersections with their dual codes are trivial we study binary linear complementary dual nk codes with the largest minimum weight among all binary linear complementary dual nk codes we characterize binary linear complementary dual codes with the largest minimum weight for small dimensions a complete classification of binary linear complementary dual nk codes with the largest minimum weight is also given for 1 le k le n le 16 | [['linear', 'complementary', 'dual', 'codes', 'or', 'codes', 'with', 'complementary', 'duals', 'are', 'codes', 'whose', 'intersections', 'with', 'their', 'dual', 'codes', 'are', 'trivial', 'we', 'study', 'binary', 'linear', 'complementary', 'dual', 'nk', 'codes', 'with', 'the', 'largest', 'minimum', 'weight', 'among', 'all', 'binary', 'linear', 'complementary', 'dual', 'nk', 'codes', 'we', 'characterize', 'binary', 'linear', 'complementary', 'dual', 'codes', 'with', 'the', 'largest', 'minimum', 'weight', 'for', 'small', 'dimensions', 'a', 'complete', 'classification', 'of', 'binary', 'linear', 'complementary', 'dual', 'nk', 'codes', 'with', 'the', 'largest', 'minimum', 'weight', 'is', 'also', 'given', 'for', '1', 'le', 'k', 'le', 'n', 'le', '16']] | [-0.19062726780266306, 0.15348926915522712, 0.01909666729481592, 0.08816937671796085, -0.049336825848131635, -0.3148799070134115, -0.027124304207973182, 0.3286476215997274, -0.35208788157705173, -0.196744751472624, 0.11455301856507122, -0.3405976794016214, -0.12958243333038955, 0.1399301147910502, -0.03844408490867526, 0.10810083037448535, 0.05930452855924765, 0.08797942003074252, -0.20491071712271666, -0.38377971080258305, 0.28867716107655456, 0.19515453154842058, 0.1787827985568179, -0.1003562948482548, 0.08132407929242393, 0.08089430812447343, -0.0499615316612669, 0.028497440004606307, -0.28435733912075745, 0.11047321156725104, 0.3580656514192621, 0.19884324741814238, 0.14384614179531732, -0.2776275248853145, -0.16253374461774472, 0.15474301450138475, 0.10270807681961652, 0.08845622274150819, -0.0038202754106878498, -0.03994768921193885, 0.2135218466390614, -0.14370319531241685, -0.004065207320690891, 0.025585142734610003, 0.03806796893017528, 0.06630224508900241, -0.30457030506919563, -0.044919490101704096, 0.05132990155690982, 0.11292451039462546, -0.04877660061336226, -0.27625804357690575, -0.005798425352959721, 0.08959128593819009, -0.12267284461205112, 0.06869688848849892, -0.06183472336097448, -0.062184268640308286, -0.14407792531045865, 0.2651895970382072, -0.03221639129045753, -0.17287163023066557, 0.20269138985715898, -0.09444558941241768, -0.1208388166082448, 0.13232989395382228, 0.19504891777192646, 0.19169150343463745, -0.0560829135140887, 0.147245408443987, -0.13477999050699083, 0.1856974026096272, 0.10939375493951418, 0.1647035895363876, 0.24992350378522166, 0.032502589448366634, 0.07309311594207553, 0.20060781026144087, -0.020225899774052293, -0.04880815656441781, -0.28941692872961733, -0.11105841748922328, -0.20575127705937413, 0.07094130891570706, -0.23154412132952315, -0.1485538978451564, 0.33140950672972347, -0.00799487848524694, 0.1874405348236546, 0.14556422509988884, 0.1700598861516258, -0.0155043422738895, 0.13009447903073404, 0.2198228002755822, 0.14268337852425045, 0.2137707111161248, -0.13680152981369584, -0.2486728242782439, -0.03403072533762531, 0.17684323270517735] |
1,802.06986 | Hollow density formation in magnetically expanding helicon plasma | Measurement of radial density profile in both the source and expansion
chambers of a helicon plasma device have revealed that it is always centrally
peaked in the source chamber, whereas in the expansion chamber near the
diverging magnetic field it becomes hollow above a critical value of the
magnetic field. This value corresponds to that above which both electrons and
ions become magnetized. The temperature profile is always peaked off- axis and
tail electrons are found at the peak location in both the source and expansion
chambers. Rotation of the tail electrons in the azimuthal direction in the
expansion chamber due to gradient-B drift produces more ionization off-axis and
creates a hollow density profile; however, if the ions are not magnetized, the
additional ionization does not cause hollowness.
| physics.plasm-ph | measurement of radial density profile in both the source and expansion chambers of a helicon plasma device have revealed that it is always centrally peaked in the source chamber whereas in the expansion chamber near the diverging magnetic field it becomes hollow above a critical value of the magnetic field this value corresponds to that above which both electrons and ions become magnetized the temperature profile is always peaked off axis and tail electrons are found at the peak location in both the source and expansion chambers rotation of the tail electrons in the azimuthal direction in the expansion chamber due to gradientb drift produces more ionization offaxis and creates a hollow density profile however if the ions are not magnetized the additional ionization does not cause hollowness | [['measurement', 'of', 'radial', 'density', 'profile', 'in', 'both', 'the', 'source', 'and', 'expansion', 'chambers', 'of', 'a', 'helicon', 'plasma', 'device', 'have', 'revealed', 'that', 'it', 'is', 'always', 'centrally', 'peaked', 'in', 'the', 'source', 'chamber', 'whereas', 'in', 'the', 'expansion', 'chamber', 'near', 'the', 'diverging', 'magnetic', 'field', 'it', 'becomes', 'hollow', 'above', 'a', 'critical', 'value', 'of', 'the', 'magnetic', 'field', 'this', 'value', 'corresponds', 'to', 'that', 'above', 'which', 'both', 'electrons', 'and', 'ions', 'become', 'magnetized', 'the', 'temperature', 'profile', 'is', 'always', 'peaked', 'off', 'axis', 'and', 'tail', 'electrons', 'are', 'found', 'at', 'the', 'peak', 'location', 'in', 'both', 'the', 'source', 'and', 'expansion', 'chambers', 'rotation', 'of', 'the', 'tail', 'electrons', 'in', 'the', 'azimuthal', 'direction', 'in', 'the', 'expansion', 'chamber', 'due', 'to', 'gradientb', 'drift', 'produces', 'more', 'ionization', 'offaxis', 'and', 'creates', 'a', 'hollow', 'density', 'profile', 'however', 'if', 'the', 'ions', 'are', 'not', 'magnetized', 'the', 'additional', 'ionization', 'does', 'not', 'cause', 'hollowness']] | [-0.10322373952385533, 0.19431992790441655, -0.0941995737975958, 0.024942009521510045, -0.02867190632969141, -0.13431901299009041, -0.02856361419253517, 0.42082548250618856, -0.20987477822927758, -0.2840282487886725, 0.07106046127046284, -0.2995833970926469, 0.04301949671207694, 0.1824683944141725, 0.01881760363903595, -0.05684570787707344, 0.0014764269180886913, 0.0199231435690308, -0.06162467746162292, -0.14179576378592174, 0.2545679783397645, 0.12702606559469132, 0.31107010924461065, 0.10367078964191023, 0.08022946312121348, -0.049765012256102636, 0.026553534629783826, 0.03671990631119115, -0.051527832815736474, 0.0039413684062310494, 0.1839448651735438, 0.021623069149427465, 0.2239788764709374, -0.4312108452722896, -0.1773852741544033, 0.05982755909644766, 0.20248406748578418, 0.09355818361200363, -0.08510155125316032, -0.21367980782542872, 0.017461037936300272, -0.14818458713125437, -0.23150962345607695, 0.038387912696634885, 0.048485429524816936, 0.03336949272761558, -0.25649893311492633, 0.1260728757509355, 0.06647241008613491, -0.0006793365246267058, -0.08362904938985594, -0.0783534745023644, -0.04167081531340955, 0.017052183400664944, 0.09296355560582015, 0.10028110308849136, 0.232846450748184, -0.15849013397019007, 0.007454129234247375, 0.34157113477704115, -0.05196355066709657, -0.12497362134490686, 0.14720921858679503, -0.3064428893776494, -0.03549883829327882, 0.2528813644166803, 0.12034224262606585, 0.09282466358672536, -0.09617441894806689, 0.03944387907313285, -0.0190752752678236, 0.15851963005843572, 0.14991815237226547, -0.008142101032717619, 0.2765303232445149, 0.08953675858356291, 0.09891529384367459, 0.09976423969783355, -0.18147936254536035, -0.04874325328273699, -0.29901770647848025, -0.13717376107524615, -0.15778946659338544, 0.006874887807725827, -0.04479709187160097, -0.23214439868024783, 0.39331679503811756, 0.09455967602843884, 0.1834570953506045, -0.08176106715779952, 0.30224365767935524, 0.12714163017517421, 0.07426853384822607, 0.14377615246894493, 0.2624693190737162, 0.16454328657346196, 0.17395185724399198, -0.2605553562534624, 0.11168784936671727, -0.0007991007150849327] |
1,802.06987 | On Kronecker terms over global function fields | We establish a general Kronecker limit formula of arbitrary rank over global
function fields with Drinfeld period domains playing the role of upper-half
plane. The Drinfeld-Siegel units come up as equal characteristic modular forms
replacing the classical $\Delta$. This leads to analytic means of deriving a
Colmez-type formula for "stable Taguchi height" of CM Drinfeld modules having
arbitrary rank. A Lerch-Type formula for "totally real" function fields is also
obtained, with the Heegner cycle on the Bruhat-Tits buildings intervene. Also
our limit formula is naturally applied to the special values of both the
Rankin-Selberg $L$-functions and the Godement-Jacquet $L$-functions associated
to automorphic cuspidal representations over global function fields.
| math.NT | we establish a general kronecker limit formula of arbitrary rank over global function fields with drinfeld period domains playing the role of upperhalf plane the drinfeldsiegel units come up as equal characteristic modular forms replacing the classical delta this leads to analytic means of deriving a colmeztype formula for stable taguchi height of cm drinfeld modules having arbitrary rank a lerchtype formula for totally real function fields is also obtained with the heegner cycle on the bruhattits buildings intervene also our limit formula is naturally applied to the special values of both the rankinselberg lfunctions and the godementjacquet lfunctions associated to automorphic cuspidal representations over global function fields | [['we', 'establish', 'a', 'general', 'kronecker', 'limit', 'formula', 'of', 'arbitrary', 'rank', 'over', 'global', 'function', 'fields', 'with', 'drinfeld', 'period', 'domains', 'playing', 'the', 'role', 'of', 'upperhalf', 'plane', 'the', 'drinfeldsiegel', 'units', 'come', 'up', 'as', 'equal', 'characteristic', 'modular', 'forms', 'replacing', 'the', 'classical', 'delta', 'this', 'leads', 'to', 'analytic', 'means', 'of', 'deriving', 'a', 'colmeztype', 'formula', 'for', 'stable', 'taguchi', 'height', 'of', 'cm', 'drinfeld', 'modules', 'having', 'arbitrary', 'rank', 'a', 'lerchtype', 'formula', 'for', 'totally', 'real', 'function', 'fields', 'is', 'also', 'obtained', 'with', 'the', 'heegner', 'cycle', 'on', 'the', 'bruhattits', 'buildings', 'intervene', 'also', 'our', 'limit', 'formula', 'is', 'naturally', 'applied', 'to', 'the', 'special', 'values', 'of', 'both', 'the', 'rankinselberg', 'lfunctions', 'and', 'the', 'godementjacquet', 'lfunctions', 'associated', 'to', 'automorphic', 'cuspidal', 'representations', 'over', 'global', 'function', 'fields']] | [-0.21257090920587957, 0.045369275610539175, -0.1317927649422061, 0.09532203850269849, -0.10137568493151948, -0.11714185169853625, 0.01283032944581161, 0.25858213840540323, -0.2914909204068993, -0.22574840342359884, 0.0939559619929198, -0.19806407689382988, -0.15064099402987355, 0.28601662690440816, -0.08679876644164324, 0.010709794563895446, 0.004944640970123666, 0.12603517094006142, -0.12248820162134334, -0.30970869210681745, 0.3857811564934396, 0.011121816808978717, 0.25457767105711226, 0.01511776826255733, 0.10675393399516386, 0.06957963266606731, 0.02672400152216488, -0.10327769396826625, -0.10633373498207047, 0.17372810162958643, 0.3342332424640301, 0.007432209460863045, 0.18785044807896373, -0.3987022701118674, -0.12404875645325297, 0.2318713523979698, 0.10762118445154989, 0.004942555344175725, 0.033032124182431115, -0.24693381613386528, 0.08026508796250537, -0.20454375107462208, -0.22167355435057765, -0.06761740595989284, 0.05709515894053593, 0.03399033191658202, -0.3056319164733092, 0.028578248455388738, 0.05968471796451402, 0.18356897099209682, -0.13228017070907214, -0.17691599611702952, -0.0070953016280240954, 0.11563922691025905, 0.061543559642242535, 0.0817199153204759, 0.13089196428745276, -0.1275686078416627, -0.08831019700017004, 0.2995745711339017, -0.05123093278102932, -0.1972049187336649, 0.0907598327401848, -0.17366421506296667, -0.12162880744075491, 0.09977167086520543, 0.10636480247513169, 0.11672846054092847, -0.007221802616758006, 0.17575822254044138, -0.10800904513868903, 0.04521350011650828, 0.17515250739774535, -0.07522070577445751, 0.19568010470164673, 0.018895047601489794, 0.09160690928720647, 0.1631089049613192, -0.024639464364320574, -0.08156473352795555, -0.34870931465356125, -0.18710373694165833, -0.11669843627827331, 0.11119891493359492, -0.17567214236159565, -0.19695403545740106, 0.42161950398059117, 0.064245339650439, 0.19082125135741773, 0.19389428181485052, 0.2185011466876382, 0.1832942436271835, 0.14245455400821463, 0.022287117060096492, 0.09428330074463571, 0.26957026305206544, 0.010446723158072149, -0.10785528537041197, -0.0033199582160228776, 0.17858759592109846] |
1,802.06988 | Rotational motion of triaxially deformed nuclei studied by microscopic
angular-momentum-projection method I: Nuclear wobbling motion | Rotation of triaxially deformed nucleus has been an interesting subject in
the study of nuclear structure. In the present series of work, we investigate
wobbling motion and chiral rotation by employing the microscopic framework of
angular-momentum projection from cranked triaxially deformed mean-field states.
In this first part the wobbling motion is studied in detail. The consequences
of the three dimensional cranking are investigated. It is demonstrated that the
multiple wobbling rotational bands naturally appear as a result of fully
microscopic calculation. They have the characteristic properties, that are
expected from the macroscopic triaxial-rotor model or the phenomenological
particle-triaxial-rotor model, although quantitative agreement with the
existing data is not achieved. It is also found that the excitation spectrum
reflects dynamics of the angular-momentum vector in the intrinsic frame of the
mean-field (transverse vs. longitudinal wobbling). The results obtained by
using the Woods-Saxon potential and the schematic separable interaction are
mainly discussed, while some results with the Gogny D1S interaction are also
presented.
| nucl-th | rotation of triaxially deformed nucleus has been an interesting subject in the study of nuclear structure in the present series of work we investigate wobbling motion and chiral rotation by employing the microscopic framework of angularmomentum projection from cranked triaxially deformed meanfield states in this first part the wobbling motion is studied in detail the consequences of the three dimensional cranking are investigated it is demonstrated that the multiple wobbling rotational bands naturally appear as a result of fully microscopic calculation they have the characteristic properties that are expected from the macroscopic triaxialrotor model or the phenomenological particletriaxialrotor model although quantitative agreement with the existing data is not achieved it is also found that the excitation spectrum reflects dynamics of the angularmomentum vector in the intrinsic frame of the meanfield transverse vs longitudinal wobbling the results obtained by using the woodssaxon potential and the schematic separable interaction are mainly discussed while some results with the gogny d1s interaction are also presented | [['rotation', 'of', 'triaxially', 'deformed', 'nucleus', 'has', 'been', 'an', 'interesting', 'subject', 'in', 'the', 'study', 'of', 'nuclear', 'structure', 'in', 'the', 'present', 'series', 'of', 'work', 'we', 'investigate', 'wobbling', 'motion', 'and', 'chiral', 'rotation', 'by', 'employing', 'the', 'microscopic', 'framework', 'of', 'angularmomentum', 'projection', 'from', 'cranked', 'triaxially', 'deformed', 'meanfield', 'states', 'in', 'this', 'first', 'part', 'the', 'wobbling', 'motion', 'is', 'studied', 'in', 'detail', 'the', 'consequences', 'of', 'the', 'three', 'dimensional', 'cranking', 'are', 'investigated', 'it', 'is', 'demonstrated', 'that', 'the', 'multiple', 'wobbling', 'rotational', 'bands', 'naturally', 'appear', 'as', 'a', 'result', 'of', 'fully', 'microscopic', 'calculation', 'they', 'have', 'the', 'characteristic', 'properties', 'that', 'are', 'expected', 'from', 'the', 'macroscopic', 'triaxialrotor', 'model', 'or', 'the', 'phenomenological', 'particletriaxialrotor', 'model', 'although', 'quantitative', 'agreement', 'with', 'the', 'existing', 'data', 'is', 'not', 'achieved', 'it', 'is', 'also', 'found', 'that', 'the', 'excitation', 'spectrum', 'reflects', 'dynamics', 'of', 'the', 'angularmomentum', 'vector', 'in', 'the', 'intrinsic', 'frame', 'of', 'the', 'meanfield', 'transverse', 'vs', 'longitudinal', 'wobbling', 'the', 'results', 'obtained', 'by', 'using', 'the', 'woodssaxon', 'potential', 'and', 'the', 'schematic', 'separable', 'interaction', 'are', 'mainly', 'discussed', 'while', 'some', 'results', 'with', 'the', 'gogny', 'd1s', 'interaction', 'are', 'also', 'presented']] | [-0.10718924223603506, 0.13685746248615627, -0.11499763973776263, 0.08320148903276162, -0.02364786134435321, -0.08632035797415008, -0.05298993070082704, 0.3986262961850156, -0.22616687646346553, -0.25294009254917316, 0.018880792447576684, -0.2454114079697983, -0.13163492833439894, 0.15027604564737365, 0.0062104009689306315, 0.030537681132789304, 0.03672565276655456, 0.05066601245491267, -0.06406017239044462, -0.14469186803208864, 0.3138470340420568, 0.05554909587093869, 0.27725604744686644, 0.025584453023553156, 0.05910030780490063, 0.02119264983039045, 0.003604581067045717, 0.0270972240865582, -0.1294677911498624, 0.10169518427775423, 0.19573598452214058, 0.023024052848641133, 0.20642789791092137, -0.44744320497291645, -0.2192990790537131, 0.00019060586631860374, 0.16496161197029557, 0.16652508291310436, -0.06870537924685709, -0.30631055419315706, 0.009265675133316772, -0.23124285994987911, -0.1896247325945388, -0.13153070006182757, 0.045995922425304946, 0.037249197065757016, -0.18281987243597014, 0.1205155011994981, 0.06512292889503282, 0.08580557664024567, -0.14569984342750608, -0.16245985499132168, -0.07265313236780886, 0.0675698072391814, 0.11849489604685244, 0.05323982666797186, 0.11349457400739661, -0.08766740858877911, -0.09454761971221687, 0.4294034857537199, -0.01635069412958322, -0.21308731656732424, 0.1475290611105145, -0.1630951704431044, -0.12712922179266084, 0.13273297348674737, 0.1160095227221847, 0.1005725046918499, -0.15996838465469168, 0.10171542375761453, -0.053462121380879635, 0.1179497183480669, 0.025149775427361985, 0.02337433563199578, 0.1749725524136949, 0.17321213081028056, -0.05118385069335828, 0.09639647390888184, -0.14029054958431883, -0.16262237541670413, -0.30937952909994954, -0.03805507290464059, -0.18570273187386352, -0.0015804371165965374, -0.029693581913444126, -0.10002069252267855, 0.4267710909633985, 0.07483964218816071, 0.19702583527391623, -0.009363071746983618, 0.28400409713668645, 0.1358574791364782, 0.06754336215895396, 0.034930312639957516, 0.33764073057718863, 0.18097179217202553, 0.053670363588574924, -0.30034249248685985, 0.02329739545722369, 0.04477697361550593] |
1,802.06989 | Smooth affine group schemes over the dual numbers | We provide an equivalence between the category of affine, smooth group
schemes over the ring of generalized dual numbers $k[I]$, and the category of
extensions of the form $1 \rightarrow \text{Lie}(G, I) \rightarrow E
\rightarrow G \rightarrow 1$ where G is an affine, smooth group scheme over k.
Here k is an arbitrary commutative ring and $k[I] = k \oplus I$ with $I^2 = 0$.
The equivalence is given by Weil restriction, and we provide a quasi-inverse
which we call Weil extension. It is compatible with the exact structures and
the $\mathbb{O}_k$-module stack structures on both categories. Our
constructions rely on the use of the group algebra scheme of an affine group
scheme; we introduce this object and establish its main properties. As an
application, we establish a Dieudonn\'e classification for smooth, commutative,
unipotent group schemes over $k[I]$.
| math.AG math.NT math.RT | we provide an equivalence between the category of affine smooth group schemes over the ring of generalized dual numbers ki and the category of extensions of the form 1 rightarrow textlieg i rightarrow e rightarrow g rightarrow 1 where g is an affine smooth group scheme over k here k is an arbitrary commutative ring and ki k oplus i with i2 0 the equivalence is given by weil restriction and we provide a quasiinverse which we call weil extension it is compatible with the exact structures and the mathbbo_kmodule stack structures on both categories our constructions rely on the use of the group algebra scheme of an affine group scheme we introduce this object and establish its main properties as an application we establish a dieudonne classification for smooth commutative unipotent group schemes over ki | [['we', 'provide', 'an', 'equivalence', 'between', 'the', 'category', 'of', 'affine', 'smooth', 'group', 'schemes', 'over', 'the', 'ring', 'of', 'generalized', 'dual', 'numbers', 'ki', 'and', 'the', 'category', 'of', 'extensions', 'of', 'the', 'form', '1', 'rightarrow', 'textlieg', 'i', 'rightarrow', 'e', 'rightarrow', 'g', 'rightarrow', '1', 'where', 'g', 'is', 'an', 'affine', 'smooth', 'group', 'scheme', 'over', 'k', 'here', 'k', 'is', 'an', 'arbitrary', 'commutative', 'ring', 'and', 'ki', 'k', 'oplus', 'i', 'with', 'i2', '0', 'the', 'equivalence', 'is', 'given', 'by', 'weil', 'restriction', 'and', 'we', 'provide', 'a', 'quasiinverse', 'which', 'we', 'call', 'weil', 'extension', 'it', 'is', 'compatible', 'with', 'the', 'exact', 'structures', 'and', 'the', 'mathbbo_kmodule', 'stack', 'structures', 'on', 'both', 'categories', 'our', 'constructions', 'rely', 'on', 'the', 'use', 'of', 'the', 'group', 'algebra', 'scheme', 'of', 'an', 'affine', 'group', 'scheme', 'we', 'introduce', 'this', 'object', 'and', 'establish', 'its', 'main', 'properties', 'as', 'an', 'application', 'we', 'establish', 'a', 'dieudonne', 'classification', 'for', 'smooth', 'commutative', 'unipotent', 'group', 'schemes', 'over', 'ki']] | [-0.18201873172764424, 0.00586341439576009, -0.08714465079484163, -0.01326316023176467, -0.08732529791347958, -0.15666872957307432, 0.0044993836863863245, 0.407878957633619, -0.3615977854226474, -0.1626984083818065, 0.06830576315729155, -0.20954860544039144, -0.12340540909725758, 0.17968693354201537, -0.1347950594447967, -0.08744651263674583, -0.012952444079780467, 0.11484541609512504, -0.10040275804974415, -0.2521971713113426, 0.3882229997052087, -0.03320834881332876, 0.2375313055028932, 0.007275184592301095, 0.11097381257762512, 0.026602099808277907, 0.0014065192115527612, -0.04218670420900539, -0.1831801409126018, 0.09116321467725491, 0.28443242116934725, 0.08939047032208354, 0.194025606063574, -0.3412314697203261, -0.10159629541276782, 0.19871218716035838, 0.12209638043272275, -0.00011802008289291902, -0.0005617669007430474, -0.3163892938789946, 0.14546884539433652, -0.2302555178878484, -0.07705977927651946, -0.06296222542447072, 0.08951555800675932, 0.00022549583335165625, -0.29469288378540015, -0.04945064541642313, 0.08810985113873526, 0.17734712196548505, -0.06239298193767253, -0.12699533816151046, -0.022065422544255853, 0.06494865836230693, -0.06525600589121934, 0.059390787556077594, 0.07880232280327214, -0.07523506970696703, -0.12463239273056388, 0.37778175174500106, -0.10231370827252115, -0.18740363145867983, 0.14751244124232066, -0.09724844986986783, -0.13377720946790994, 0.134473318334117, 0.06156888121256122, 0.17122762951034087, 0.033929300832527653, 0.23133684139897082, -0.17122607785255511, 0.10893467649196585, 0.03189851502991385, 0.01225560980124606, 0.09217739755943141, 0.10528558922103709, 0.08244583884435189, 0.08235616792786729, -0.016896982177126187, 0.017011080206268365, -0.405487092004882, -0.21255187195191091, -0.0671540961359386, 0.14927448668965587, -0.08897299574358233, -0.11659402473381272, 0.33871499084357143, 0.07286612219004719, 0.21534732014492705, 0.12488025686341442, 0.22724984237165363, 0.06818301889148576, 0.0463732173424904, 0.0661277820666631, 0.08531954091352721, 0.25117593947280614, -0.06062500138715324, -0.1573385890726328, -0.030485848292570422, 0.18807621058766488] |
1,802.0699 | Multiplicity distribution and normalized moments in p$-$p collisions at
LHC in forward rapidity using Weibull model | The measured charged particle multiplicity distribution in the forward
rapidity region of the p$-$p collisions at $\sqrt{s}$ = 0.9 TeV, 7 TeV and 8
TeV at the LHC have been described using the Weibull distribution function. The
higher order (up to $5^{th}$ order ) normalized moments and the factorial
moments are also calculated using the extracted parameters. The multiplicity
distributions in forward region are observed to be well described by the
Weibull regularity and the higher order moment calculations confirm the
violation of KNO scaling that has been observed at mid-rapidity and lower
energies. The Weibull parameters and moments for p$-$p collisions at $\sqrt{s}$
= 13 TeV are also estimated for the forward region.
| hep-ph nucl-th | the measured charged particle multiplicity distribution in the forward rapidity region of the pp collisions at sqrts 09 tev 7 tev and 8 tev at the lhc have been described using the weibull distribution function the higher order up to 5th order normalized moments and the factorial moments are also calculated using the extracted parameters the multiplicity distributions in forward region are observed to be well described by the weibull regularity and the higher order moment calculations confirm the violation of kno scaling that has been observed at midrapidity and lower energies the weibull parameters and moments for pp collisions at sqrts 13 tev are also estimated for the forward region | [['the', 'measured', 'charged', 'particle', 'multiplicity', 'distribution', 'in', 'the', 'forward', 'rapidity', 'region', 'of', 'the', 'pp', 'collisions', 'at', 'sqrts', '09', 'tev', '7', 'tev', 'and', '8', 'tev', 'at', 'the', 'lhc', 'have', 'been', 'described', 'using', 'the', 'weibull', 'distribution', 'function', 'the', 'higher', 'order', 'up', 'to', '5th', 'order', 'normalized', 'moments', 'and', 'the', 'factorial', 'moments', 'are', 'also', 'calculated', 'using', 'the', 'extracted', 'parameters', 'the', 'multiplicity', 'distributions', 'in', 'forward', 'region', 'are', 'observed', 'to', 'be', 'well', 'described', 'by', 'the', 'weibull', 'regularity', 'and', 'the', 'higher', 'order', 'moment', 'calculations', 'confirm', 'the', 'violation', 'of', 'kno', 'scaling', 'that', 'has', 'been', 'observed', 'at', 'midrapidity', 'and', 'lower', 'energies', 'the', 'weibull', 'parameters', 'and', 'moments', 'for', 'pp', 'collisions', 'at', 'sqrts', '13', 'tev', 'are', 'also', 'estimated', 'for', 'the', 'forward', 'region']] | [-0.014422308223590523, 0.20210282089239037, -0.12151181192749792, 0.20097312022856362, 0.034326548117573734, -0.07319557948692425, -0.07226664978782185, 0.355233225447067, -0.212574306552441, -0.38213374234131864, -0.008757210212868747, -0.3764537013060338, 0.1139646446718289, 0.14079705251040994, 0.10651749738430193, 0.14180742289875173, 0.04583989421266492, 0.01842044609355497, -0.05687702447385737, -0.23585892873103018, 0.2479879812563996, 0.1506326636299491, 0.26687080718509787, 0.12295942477512735, 0.07087871986063751, 0.018323655467824423, -0.008918654416931106, -0.026458901562937745, -0.16499388013445396, 0.06759618735832355, 0.25461036214281946, -0.013046740684322678, 0.13151524062813805, -0.3038494930778806, -0.11001956272400445, 0.12937313818314053, 0.16689221468242305, -0.00021540218343337378, -0.027945737346067086, -0.3058763042109104, 0.20912931348524383, -0.24532948164185425, -0.18984808287423877, -0.01180302841706319, 0.023064032637489004, 0.06649546442670864, -0.3178769796730128, 0.15110475061039716, -0.020064517896546907, 0.10983545481806006, -0.023278522804413025, -0.2536846613679249, -0.08957537431647447, -0.010332437618090226, 0.11293239748055064, 0.058776586341696815, 0.13689611266107038, -0.1130868923149768, -0.17445505271153944, 0.2948957348896845, 0.04186549983805398, -0.13714496947422222, 0.16328193114751632, -0.3005100168195461, -0.13426868166556363, 0.19600156067056698, 0.2630681458835465, 0.07274042627866473, -0.2149706158266814, 0.08920059116257811, 0.035320372069002806, 0.15709009884672054, 0.13364059308141069, 0.0105755291019172, 0.1386869095920308, 0.13885070198018373, -0.008287934794065517, 0.07590304809488221, -0.20825295078962505, -0.09055756664255986, -0.43136264591872153, -0.05649768994902974, -0.1811789305343687, -0.02512756047082377, -0.1257478200555475, 0.028078642531155464, 0.353885006302179, 0.0804656050230905, 0.30840136171192734, 0.041443157957883565, 0.2106300812332077, 0.2078923262857102, 0.054973978570217755, 0.1328399441863603, 0.31237950694520733, 0.1320392562722502, 0.24320879665220174, -0.16759160399302706, 0.08309707105126199, 0.08370699614353545] |
1,802.06991 | Rotational motion of triaxially deformed nuclei studied by microscopic
angular-momentum-projection method II: Chiral doublet band | In the sequel of the present study, we have investigated the rotational
motion of triaxially deformed nucleus by using the microscopic framework of
angular-momentum projection. The Woods-Saxon potential and the schematic
separable-type interaction are employed as a microscopic Hamiltonian. As the
first example nuclear wobbling motion was studied in detail in the part~I of
the series. This second part reports on another interesting rotational mode,
chiral doublet bands: two prototype examples, $^{128}$Cs and $^{104}$Rh, are
investigated. It is demonstrated that the doublet bands naturally appear as a
result of the calculation in this fully microscopic framework without any kind
of core, and they have the characteristic properties of the $B(E2)$ and $B(M1)$
transition probabilities, which are expected from the phenomenological triaxial
particle-rotor coupling model.
| nucl-th | in the sequel of the present study we have investigated the rotational motion of triaxially deformed nucleus by using the microscopic framework of angularmomentum projection the woodssaxon potential and the schematic separabletype interaction are employed as a microscopic hamiltonian as the first example nuclear wobbling motion was studied in detail in the parti of the series this second part reports on another interesting rotational mode chiral doublet bands two prototype examples 128cs and 104rh are investigated it is demonstrated that the doublet bands naturally appear as a result of the calculation in this fully microscopic framework without any kind of core and they have the characteristic properties of the be2 and bm1 transition probabilities which are expected from the phenomenological triaxial particlerotor coupling model | [['in', 'the', 'sequel', 'of', 'the', 'present', 'study', 'we', 'have', 'investigated', 'the', 'rotational', 'motion', 'of', 'triaxially', 'deformed', 'nucleus', 'by', 'using', 'the', 'microscopic', 'framework', 'of', 'angularmomentum', 'projection', 'the', 'woodssaxon', 'potential', 'and', 'the', 'schematic', 'separabletype', 'interaction', 'are', 'employed', 'as', 'a', 'microscopic', 'hamiltonian', 'as', 'the', 'first', 'example', 'nuclear', 'wobbling', 'motion', 'was', 'studied', 'in', 'detail', 'in', 'the', 'parti', 'of', 'the', 'series', 'this', 'second', 'part', 'reports', 'on', 'another', 'interesting', 'rotational', 'mode', 'chiral', 'doublet', 'bands', 'two', 'prototype', 'examples', '128cs', 'and', '104rh', 'are', 'investigated', 'it', 'is', 'demonstrated', 'that', 'the', 'doublet', 'bands', 'naturally', 'appear', 'as', 'a', 'result', 'of', 'the', 'calculation', 'in', 'this', 'fully', 'microscopic', 'framework', 'without', 'any', 'kind', 'of', 'core', 'and', 'they', 'have', 'the', 'characteristic', 'properties', 'of', 'the', 'be2', 'and', 'bm1', 'transition', 'probabilities', 'which', 'are', 'expected', 'from', 'the', 'phenomenological', 'triaxial', 'particlerotor', 'coupling', 'model']] | [-0.09715141425458867, 0.11940634640155086, -0.0719031662848152, 0.08386203646564429, -0.025002331913784755, -0.10616125604595805, -0.015569905309602007, 0.3794202333274221, -0.2042887062979404, -0.2847643860932592, 0.03776793079985092, -0.23609421731232375, -0.14406067798043923, 0.10712538167765578, 0.023331692041523876, 0.024451838153582373, 0.008182852269440401, 0.04171811253191201, -0.053486918002847945, -0.12604398628292207, 0.3175512969600739, 0.029300014908257566, 0.23569829807021334, 0.028474304917686884, 0.05305148085167051, -0.006445808061322228, 0.04002569934551711, -0.012984738122198547, -0.14279666438644617, 0.08094287103377894, 0.21447762970471007, 0.0302764101633344, 0.20500199310481548, -0.4312608520668305, -0.20734837869579187, 0.019538882885082456, 0.15577163197268107, 0.1668119639507495, -0.04728602993466174, -0.3235071673378593, -0.005188132037950649, -0.2389835844495807, -0.17545854893024462, -0.11980283638790677, 0.03149213621270706, 0.02005241480923151, -0.18301469715861757, 0.08560978303297011, 0.060992436048376265, 0.07654747973028266, -0.11960337226676038, -0.1665628870155235, -0.05960321636320871, 0.07760538577880294, 0.08442699681436948, 0.006705548471129942, 0.11768221281865826, -0.07086278368398304, -0.10333786014520914, 0.4339066592701634, -0.04178356626796246, -0.16450180349963123, 0.1348624423940162, -0.14914414305697943, -0.15258592347706074, 0.13518501653671874, 0.134533196426241, 0.13073867297593933, -0.1609877426593305, 0.0865359205359471, -0.04040574432793455, 0.11304525585871832, 0.024764184133897794, 0.01100295450496411, 0.19644074374046483, 0.17583842268289968, -0.05801890155331033, 0.12144912537340014, -0.13096878723981867, -0.1287696980031543, -0.34859755816945776, -0.10879553773928984, -0.19772814894471982, -0.0035373807224429775, -0.018193267243360855, -0.1106975748877377, 0.44830844357426536, 0.06593652746685949, 0.19043777461858374, -0.021753526387209468, 0.2676429915448009, 0.12061990689596955, 0.06635067741325522, -0.005290482956372186, 0.3235775693930441, 0.17129565837037306, 0.07288246202763536, -0.2561944156208125, 0.019576366684975897, 0.0673065733634027] |
1,802.06992 | Sublinear Algorithms for MAXCUT and Correlation Clustering | We study sublinear algorithms for two fundamental graph problems, MAXCUT and
correlation clustering. Our focus is on constructing core-sets as well as
developing streaming algorithms for these problems. Constant space algorithms
are known for dense graphs for these problems, while $\Omega(n)$ lower bounds
exist (in the streaming setting) for sparse graphs.
Our goal in this paper is to bridge the gap between these extremes. Our first
result is to construct core-sets of size $\tilde{O}(n^{1-\delta})$ for both the
problems, on graphs with average degree $n^{\delta}$ (for any $\delta >0$).
This turns out to be optimal, under the exponential time hypothesis (ETH). Our
core-set analysis is based on studying random-induced sub-problems of
optimization problems. To the best of our knowledge, all the known results in
our parameter range rely crucially on near-regularity assumptions. We avoid
these by using a biased sampling approach, which we analyze using recent
results on concentration of quadratic functions. We then show that our
construction yields a 2-pass streaming $(1+\epsilon)$-approximation for both
problems; the algorithm uses $\tilde{O}(n^{1-\delta})$ space, for graphs of
average degree $n^\delta$.
| cs.DS | we study sublinear algorithms for two fundamental graph problems maxcut and correlation clustering our focus is on constructing coresets as well as developing streaming algorithms for these problems constant space algorithms are known for dense graphs for these problems while omegan lower bounds exist in the streaming setting for sparse graphs our goal in this paper is to bridge the gap between these extremes our first result is to construct coresets of size tildeon1delta for both the problems on graphs with average degree ndelta for any delta 0 this turns out to be optimal under the exponential time hypothesis eth our coreset analysis is based on studying randominduced subproblems of optimization problems to the best of our knowledge all the known results in our parameter range rely crucially on nearregularity assumptions we avoid these by using a biased sampling approach which we analyze using recent results on concentration of quadratic functions we then show that our construction yields a 2pass streaming 1epsilonapproximation for both problems the algorithm uses tildeon1delta space for graphs of average degree ndelta | [['we', 'study', 'sublinear', 'algorithms', 'for', 'two', 'fundamental', 'graph', 'problems', 'maxcut', 'and', 'correlation', 'clustering', 'our', 'focus', 'is', 'on', 'constructing', 'coresets', 'as', 'well', 'as', 'developing', 'streaming', 'algorithms', 'for', 'these', 'problems', 'constant', 'space', 'algorithms', 'are', 'known', 'for', 'dense', 'graphs', 'for', 'these', 'problems', 'while', 'omegan', 'lower', 'bounds', 'exist', 'in', 'the', 'streaming', 'setting', 'for', 'sparse', 'graphs', 'our', 'goal', 'in', 'this', 'paper', 'is', 'to', 'bridge', 'the', 'gap', 'between', 'these', 'extremes', 'our', 'first', 'result', 'is', 'to', 'construct', 'coresets', 'of', 'size', 'tildeon1delta', 'for', 'both', 'the', 'problems', 'on', 'graphs', 'with', 'average', 'degree', 'ndelta', 'for', 'any', 'delta', '0', 'this', 'turns', 'out', 'to', 'be', 'optimal', 'under', 'the', 'exponential', 'time', 'hypothesis', 'eth', 'our', 'coreset', 'analysis', 'is', 'based', 'on', 'studying', 'randominduced', 'subproblems', 'of', 'optimization', 'problems', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'all', 'the', 'known', 'results', 'in', 'our', 'parameter', 'range', 'rely', 'crucially', 'on', 'nearregularity', 'assumptions', 'we', 'avoid', 'these', 'by', 'using', 'a', 'biased', 'sampling', 'approach', 'which', 'we', 'analyze', 'using', 'recent', 'results', 'on', 'concentration', 'of', 'quadratic', 'functions', 'we', 'then', 'show', 'that', 'our', 'construction', 'yields', 'a', '2pass', 'streaming', '1epsilonapproximation', 'for', 'both', 'problems', 'the', 'algorithm', 'uses', 'tildeon1delta', 'space', 'for', 'graphs', 'of', 'average', 'degree', 'ndelta']] | [-0.09706206417417731, 0.04503905242268831, -0.07152763836021567, 0.08375635957104507, -0.08178785972928779, -0.11612355747078171, 0.07003403615123517, 0.39718417893966723, -0.26238828037876166, -0.33895982048292267, 0.123528824272785, -0.24210638593582587, -0.16113463253981766, 0.2525565025621447, -0.05866012434560763, 0.10662371360418525, 0.08765545850833771, 0.01069969741691803, -0.048297959394570995, -0.30694886787086, 0.3238210251900078, 0.017958910895267972, 0.2409269791471119, 0.07270692740988532, 0.07262880271889441, 0.009482393490857092, -0.015059929129656875, 0.03564622368223312, -0.16390443878702787, 0.12973970208509727, 0.2866880135642814, 0.17820733188432053, 0.3009657212961251, -0.3847501201705001, -0.1974717356281652, 0.15918913999192374, 0.14648914490438378, 0.10116519901336803, -0.03520249083555228, -0.2293491562060348, 0.12276277698418554, -0.057264788444428276, -0.05376339815931673, -0.07945789248500576, 0.003179740358743517, 0.028403090501415554, -0.32567635518043764, 0.052546866115680414, 0.09192479524196757, -0.002291050521474888, -0.03695491423038231, -0.18728368427475978, 0.11118666320000829, 0.10024363711615489, 0.018885912433207763, 0.0409397548907597, 0.0698105815969322, -0.10258430076345544, -0.17183915935369776, 0.35890468488843447, -0.04597533707662175, -0.19741086665629248, 0.170261387282383, -0.0665494669375984, -0.21829156806135827, 0.07161290946298804, 0.2224985831149522, 0.17625426018781876, -0.08422739195487537, 0.125512151673487, -0.0997476765883273, 0.1660879427599239, 0.06528415425744807, 0.012473678310005658, 0.07043947993065819, 0.18559064153560448, 0.17953188686856422, 0.1397506669377801, -0.007236667968273891, -0.10508411037521544, -0.28061849421596735, -0.10061303713113397, -0.22525427474883844, -0.015413477735850832, -0.18471968750428908, -0.18342002999270335, 0.36561950289740647, 0.1669028352560668, 0.2120196346793024, 0.17005925407250486, 0.2868597397109729, 0.09016195238345763, 0.022271649305837166, 0.1697678160098908, 0.18735575539142899, 0.0930961442257588, 0.04878477226734033, -0.17611408091769767, 0.08143224387266405, 0.09810597722247329] |
1,802.06993 | A Survey on the Security of Blockchain Systems | Since its inception, the blockchain technology has shown promising
application prospects. From the initial cryptocurrency to the current smart
contract, blockchain has been applied to many fields. Although there are some
studies on the security and privacy issues of blockchain, there lacks a
systematic examination on the security of blockchain systems. In this paper, we
conduct a systematic study on the security threats to blockchain and survey the
corresponding real attacks by examining popular blockchain systems. We also
review the security enhancement solutions for blockchain, which could be used
in the development of various blockchain systems, and suggest some future
directions to stir research efforts into this area.
| cs.CR | since its inception the blockchain technology has shown promising application prospects from the initial cryptocurrency to the current smart contract blockchain has been applied to many fields although there are some studies on the security and privacy issues of blockchain there lacks a systematic examination on the security of blockchain systems in this paper we conduct a systematic study on the security threats to blockchain and survey the corresponding real attacks by examining popular blockchain systems we also review the security enhancement solutions for blockchain which could be used in the development of various blockchain systems and suggest some future directions to stir research efforts into this area | [['since', 'its', 'inception', 'the', 'blockchain', 'technology', 'has', 'shown', 'promising', 'application', 'prospects', 'from', 'the', 'initial', 'cryptocurrency', 'to', 'the', 'current', 'smart', 'contract', 'blockchain', 'has', 'been', 'applied', 'to', 'many', 'fields', 'although', 'there', 'are', 'some', 'studies', 'on', 'the', 'security', 'and', 'privacy', 'issues', 'of', 'blockchain', 'there', 'lacks', 'a', 'systematic', 'examination', 'on', 'the', 'security', 'of', 'blockchain', 'systems', 'in', 'this', 'paper', 'we', 'conduct', 'a', 'systematic', 'study', 'on', 'the', 'security', 'threats', 'to', 'blockchain', 'and', 'survey', 'the', 'corresponding', 'real', 'attacks', 'by', 'examining', 'popular', 'blockchain', 'systems', 'we', 'also', 'review', 'the', 'security', 'enhancement', 'solutions', 'for', 'blockchain', 'which', 'could', 'be', 'used', 'in', 'the', 'development', 'of', 'various', 'blockchain', 'systems', 'and', 'suggest', 'some', 'future', 'directions', 'to', 'stir', 'research', 'efforts', 'into', 'this', 'area']] | [-0.18288621283890852, -0.0533437220610385, -0.0625933109247988, 0.047503059962225425, -0.10366323622616215, -0.16163756290916353, 0.06312331331449698, 0.3656453604559862, -0.27122275422206493, -0.27650604599276213, 0.20858693176113, -0.31401305759317, -0.14904465158987376, 0.23155727599644, -0.1474726510717085, 0.1130784624250804, 0.04011288728819367, -0.014839513964640597, 0.007825201696336822, -0.33726241667668716, 0.3019347270536754, 0.03388258971325639, 0.3774221463719624, 0.1586738171711288, 0.009216504149932277, -0.05231646884284499, -0.037269133531178035, -0.026022073254420387, -0.1463892795918919, 0.16787613246210473, 0.3290527928103175, 0.24664812720665294, 0.4106435788864339, -0.4384925574003891, -0.1427779881525095, 0.09453432969059106, 0.15378830398010365, 0.12847625922855782, -0.1492531876914048, -0.36041882833362454, 0.1087770845117996, -0.27972752788897465, -0.11754162932521905, -0.09767406687347426, 0.025734193213456484, 0.032602260982255556, -0.13677851430623345, -0.07359517943270341, -0.0010347200107019118, 0.09735244282314347, 0.0016273687694963344, -0.09980048608310797, -0.012915382697462553, 0.1139187317220839, 0.10980531940650609, -0.007977817561132488, 0.19539674962612075, -0.12659058480575267, -0.1798536006309506, 0.36801945990710344, 0.05164122729803677, -0.12613140432922929, 0.15419224135715653, -0.02826531688872449, -0.23173123122951775, 0.019779336902838958, 0.23098089238326927, -0.00029716784720895467, -0.21885693881281273, 0.053603277050704626, 0.005413876762354953, 0.16589210896873502, 0.013476100409644897, 0.0749267636694842, 0.24633826930463934, 0.2451253042629644, 0.10254815641598759, 0.09864298172652963, -0.020884031837340444, -0.15379497836585398, -0.23009706437975788, -0.1526547410025227, -0.11330146264043395, 0.06627159524295065, -0.019314649932682556, -0.13666937693482464, 0.42413496053605165, 0.2811345390682281, 0.07695829095879432, -0.04194341354067782, 0.3827583832769758, -0.0014078017125871997, 0.14841454308178206, 0.10252155981854433, 0.2557719177377833, 0.03756129045117026, 0.22709138088868241, -0.10352784259184436, 0.1793582807381258, -0.053477689468612276] |
1,802.06994 | Low-Mass Dark Matter Search with the DarkSide-50 Experiment | We present the results of a search for dark matter WIMPs in the mass range
below 20 GeV/c^2 using a target of low-radioactivity argon. The data were
obtained using the DarkSide-50 apparatus at Laboratori Nazionali del Gran Sasso
(LNGS). The analysis is based on the ionization signal, for which the
DarkSide-50 time projection chamber is fully efficient at 0.1 keVee. The
observed rate in the detector at 0.5 keVee is about 1.5 events/keVee/kg/day and
is almost entirely accounted for by known background sources. We obtain a 90%
C.L. exclusion limit above 1.8 GeV/c^2 for the spin-independent cross section
of dark matter WIMPs on nucleons, extending the exclusion region for dark
matter below previous limits in the range 1.8-6 GeV/c^2.
| astro-ph.HE astro-ph.CO | we present the results of a search for dark matter wimps in the mass range below 20 gevc2 using a target of lowradioactivity argon the data were obtained using the darkside50 apparatus at laboratori nazionali del gran sasso lngs the analysis is based on the ionization signal for which the darkside50 time projection chamber is fully efficient at 01 kevee the observed rate in the detector at 05 kevee is about 15 eventskeveekgday and is almost entirely accounted for by known background sources we obtain a 90 cl exclusion limit above 18 gevc2 for the spinindependent cross section of dark matter wimps on nucleons extending the exclusion region for dark matter below previous limits in the range 186 gevc2 | [['we', 'present', 'the', 'results', 'of', 'a', 'search', 'for', 'dark', 'matter', 'wimps', 'in', 'the', 'mass', 'range', 'below', '20', 'gevc2', 'using', 'a', 'target', 'of', 'lowradioactivity', 'argon', 'the', 'data', 'were', 'obtained', 'using', 'the', 'darkside50', 'apparatus', 'at', 'laboratori', 'nazionali', 'del', 'gran', 'sasso', 'lngs', 'the', 'analysis', 'is', 'based', 'on', 'the', 'ionization', 'signal', 'for', 'which', 'the', 'darkside50', 'time', 'projection', 'chamber', 'is', 'fully', 'efficient', 'at', '01', 'kevee', 'the', 'observed', 'rate', 'in', 'the', 'detector', 'at', '05', 'kevee', 'is', 'about', '15', 'eventskeveekgday', 'and', 'is', 'almost', 'entirely', 'accounted', 'for', 'by', 'known', 'background', 'sources', 'we', 'obtain', 'a', '90', 'cl', 'exclusion', 'limit', 'above', '18', 'gevc2', 'for', 'the', 'spinindependent', 'cross', 'section', 'of', 'dark', 'matter', 'wimps', 'on', 'nucleons', 'extending', 'the', 'exclusion', 'region', 'for', 'dark', 'matter', 'below', 'previous', 'limits', 'in', 'the', 'range', '186', 'gevc2']] | [-0.05659109985029672, 0.2054638410405398, -0.07942506510338163, 0.12258755356878422, 0.006100116771156505, -0.08913001498223234, 0.08491529738806756, 0.297950862875303, -0.0933880824122136, -0.42557265868378896, 0.04723107245044341, -0.36359799064506415, 0.11628289118219735, 0.21651180710454107, 0.06139679656189401, 0.04171963935023395, 0.035994144119085525, 0.03216437003930431, -0.058798396789224154, -0.2540544238951752, 0.21511113005927054, 0.14491700543232766, 0.23539549472220875, 0.12927980161808683, 0.19064000962495456, 0.012138248957946138, -0.020121402047984932, -0.16359086051559613, -0.16118441871762024, 0.0007768366959387973, 0.31530744110636605, 0.06348223713131905, 0.07912696320247853, -0.34034805522710715, -0.13376396921980274, 0.14336923979147795, 0.1042471033027958, 0.016656510345440485, -0.09500109032462391, -0.40056019609446747, 0.11239031565935999, -0.19946988413240602, -0.11140560461316747, 0.0749503016586305, -0.040046842062403845, -0.05682826806964763, -0.22187362447523085, 0.13125142082571983, -0.026798751856342465, 0.022137437489325718, -0.0738645527369769, -0.230958558082328, 0.06716852036099565, -0.06116203768810226, -0.02476937852610471, 0.04696271969084391, 0.2660728316335797, -0.13111323791050936, -0.0460551339073375, 0.3677995292690851, -0.14336129423957003, -0.07428227235973513, 0.1510195892750112, -0.22002513325078635, -0.11721868050122886, 0.2644441870940944, 0.17981785017739532, 0.10921702880641225, -0.2384892420515702, 0.14907679013400812, -0.03843732070477711, 0.2395949266787808, 0.1539930325924908, -0.051258887416856774, 0.28002137236960106, 0.3021085851083873, 0.10692057627158523, -0.029350927350174447, -0.2311544479581259, -0.022712003786937666, -0.3929504480023505, -0.12430889195352161, -0.08083893357128916, -0.010233588456531387, -0.015601468966929518, -0.0017302357507830138, 0.29237810624921223, 0.07380058865804794, 0.18925172145975658, 0.05620446300303753, 0.31267916644781324, 0.03809546928663375, 0.014743319546835403, 0.01333713429729391, 0.38902489285347824, 0.16425126036865859, 0.13059728050020414, -0.14292021312403602, 0.01950064876069457, -0.00431017658941574] |
1,802.06995 | How to analyze data in a factorial design? An extensive simulation study | Factorial designs are frequently used in different fields of science, e.g.
psychological, medical or biometric studies. Standard approaches, as the ANOVA
$F$-test, make different assumptions on the distribution of the error terms,
the variances or the sample sizes in the different groups. Because of time
constraints or a lack of statistical background, many users do not check these
assumptions; enhancing the risk of potentially inflated type-$I$ error rates or
a substantial loss of power. It is the aim of the present paper, to give an
overview of different methods without such restrictive assumptions and to
identify situations in which one method is superior compared to others. In
particular, after summarizing their underlying assumptions, the different
approaches are compared within extensive simulations. To also address the
current discussion about redefining the statistical significance level, we also
included simulations for the 0.5\% level.
| stat.ME | factorial designs are frequently used in different fields of science eg psychological medical or biometric studies standard approaches as the anova ftest make different assumptions on the distribution of the error terms the variances or the sample sizes in the different groups because of time constraints or a lack of statistical background many users do not check these assumptions enhancing the risk of potentially inflated typei error rates or a substantial loss of power it is the aim of the present paper to give an overview of different methods without such restrictive assumptions and to identify situations in which one method is superior compared to others in particular after summarizing their underlying assumptions the different approaches are compared within extensive simulations to also address the current discussion about redefining the statistical significance level we also included simulations for the 05 level | [['factorial', 'designs', 'are', 'frequently', 'used', 'in', 'different', 'fields', 'of', 'science', 'eg', 'psychological', 'medical', 'or', 'biometric', 'studies', 'standard', 'approaches', 'as', 'the', 'anova', 'ftest', 'make', 'different', 'assumptions', 'on', 'the', 'distribution', 'of', 'the', 'error', 'terms', 'the', 'variances', 'or', 'the', 'sample', 'sizes', 'in', 'the', 'different', 'groups', 'because', 'of', 'time', 'constraints', 'or', 'a', 'lack', 'of', 'statistical', 'background', 'many', 'users', 'do', 'not', 'check', 'these', 'assumptions', 'enhancing', 'the', 'risk', 'of', 'potentially', 'inflated', 'typei', 'error', 'rates', 'or', 'a', 'substantial', 'loss', 'of', 'power', 'it', 'is', 'the', 'aim', 'of', 'the', 'present', 'paper', 'to', 'give', 'an', 'overview', 'of', 'different', 'methods', 'without', 'such', 'restrictive', 'assumptions', 'and', 'to', 'identify', 'situations', 'in', 'which', 'one', 'method', 'is', 'superior', 'compared', 'to', 'others', 'in', 'particular', 'after', 'summarizing', 'their', 'underlying', 'assumptions', 'the', 'different', 'approaches', 'are', 'compared', 'within', 'extensive', 'simulations', 'to', 'also', 'address', 'the', 'current', 'discussion', 'about', 'redefining', 'the', 'statistical', 'significance', 'level', 'we', 'also', 'included', 'simulations', 'for', 'the', '05', 'level']] | [-0.059630460492236186, 0.03133946362024599, -0.06537141640346947, 0.14485084505731913, -0.07181970296255874, -0.13524183037142593, 0.07564150588834619, 0.3871153675165054, -0.23742133058634, -0.3482368646031873, 0.15647882236339522, -0.2633650721651865, -0.09428545870283182, 0.2122473173406543, -0.1124168740542513, 0.06044995664546253, 0.06654911560950973, 0.048065984084152004, -0.10823702976456018, -0.28121204909221237, 0.3114935201295513, 0.08799156145083699, 0.3183131372054101, 0.008860636274627548, 0.033504934803126975, -0.03517142643967102, -0.09244355035892932, 0.013570773369031595, -0.11881225311332745, 0.11769820500746475, 0.2571144227783942, 0.15820813613303059, 0.3417079971561618, -0.44992007312490995, -0.22538946365528073, 0.12415379743547515, 0.1046407076364824, 0.08985328738964064, -0.015342991895716083, -0.2597580612356385, 0.10274026191137824, -0.16694144465372707, -0.09803011290174216, -0.07819380239292101, -0.04527805688467326, 0.03883725519668549, -0.2617513088002497, 0.09531223169215856, 0.0684662853005996, 0.11381652355458297, -0.01883491388429617, -0.18627255456191852, 0.027714415750604994, 0.1467748867721026, 0.12709351458936824, -0.0400082525869019, 0.16614110233486756, -0.15744401746370057, -0.1306255375140789, 0.38219465140306147, 0.0032648697548301507, -0.22201693418983978, 0.24555535317920413, -0.12386021371402428, -0.1507370453790253, 0.09805785331227784, 0.1943405729739973, 0.07062751861858423, -0.175947943484371, 0.02209548749226139, 0.01724435110305641, 0.1738545141770696, 0.051668939783389795, 0.0613821042331715, 0.1760214917916567, 0.13834658146056458, 0.014227089876266103, 0.07574957435131602, -0.08263443670473358, -0.08172297591990824, -0.29604162827319075, -0.11827110188702743, -0.1292280139176981, 0.022152376186258673, -0.10376455341224271, -0.1533315328184304, 0.3888819486774663, 0.22962957520222832, 0.15501794033413027, 0.039644915523446754, 0.33441889785388684, 0.07123946363489467, 0.05732002499486907, 0.03652467436804469, 0.22843590097052727, 0.06547481260850285, 0.037118242931360686, -0.15419688147116214, 0.11951042540331787, -0.0350908861868744] |
1,802.06996 | Wavelength convertible quantum memory satisfying ultralong photon
storage and near perfect retrieval efficiency | Quantum coherence control is presented for wavelength convertible quantum
memory in a double-lambda-type solid ensemble whose spin states are
inhomogeneously broadened. Unlike typical atomic media whose spin decay is
homogeneous, a spin inhomogeneously broadened solid ensemble requires a
counter-intuitive access in the quantum coherence control to avoid spontaneous
emission-caused quantum noises. Such quantum coherence control in a solid
ensemble results in a near perfect retrieval efficiency and is applicable to
ultralong photon storage up to the spin phase relaxation time. Here, the basic
physics of the counter-intuitive quantum coherence control is presented not
only for two-photon (Raman) coherent transients, but also for a detailed
coherence transfer mechanism resulting in frequency up-/down-conversion. This
work sheds light on potential applications of quantum optical memories
satisfying noise free, near perfect, ultralong, and multimode photon storage,
where quantum repeaters, scalable entangled qubits, and magnetometry would be
imminent beneficiaries.
| quant-ph | quantum coherence control is presented for wavelength convertible quantum memory in a doublelambdatype solid ensemble whose spin states are inhomogeneously broadened unlike typical atomic media whose spin decay is homogeneous a spin inhomogeneously broadened solid ensemble requires a counterintuitive access in the quantum coherence control to avoid spontaneous emissioncaused quantum noises such quantum coherence control in a solid ensemble results in a near perfect retrieval efficiency and is applicable to ultralong photon storage up to the spin phase relaxation time here the basic physics of the counterintuitive quantum coherence control is presented not only for twophoton raman coherent transients but also for a detailed coherence transfer mechanism resulting in frequency updownconversion this work sheds light on potential applications of quantum optical memories satisfying noise free near perfect ultralong and multimode photon storage where quantum repeaters scalable entangled qubits and magnetometry would be imminent beneficiaries | [['quantum', 'coherence', 'control', 'is', 'presented', 'for', 'wavelength', 'convertible', 'quantum', 'memory', 'in', 'a', 'doublelambdatype', 'solid', 'ensemble', 'whose', 'spin', 'states', 'are', 'inhomogeneously', 'broadened', 'unlike', 'typical', 'atomic', 'media', 'whose', 'spin', 'decay', 'is', 'homogeneous', 'a', 'spin', 'inhomogeneously', 'broadened', 'solid', 'ensemble', 'requires', 'a', 'counterintuitive', 'access', 'in', 'the', 'quantum', 'coherence', 'control', 'to', 'avoid', 'spontaneous', 'emissioncaused', 'quantum', 'noises', 'such', 'quantum', 'coherence', 'control', 'in', 'a', 'solid', 'ensemble', 'results', 'in', 'a', 'near', 'perfect', 'retrieval', 'efficiency', 'and', 'is', 'applicable', 'to', 'ultralong', 'photon', 'storage', 'up', 'to', 'the', 'spin', 'phase', 'relaxation', 'time', 'here', 'the', 'basic', 'physics', 'of', 'the', 'counterintuitive', 'quantum', 'coherence', 'control', 'is', 'presented', 'not', 'only', 'for', 'twophoton', 'raman', 'coherent', 'transients', 'but', 'also', 'for', 'a', 'detailed', 'coherence', 'transfer', 'mechanism', 'resulting', 'in', 'frequency', 'updownconversion', 'this', 'work', 'sheds', 'light', 'on', 'potential', 'applications', 'of', 'quantum', 'optical', 'memories', 'satisfying', 'noise', 'free', 'near', 'perfect', 'ultralong', 'and', 'multimode', 'photon', 'storage', 'where', 'quantum', 'repeaters', 'scalable', 'entangled', 'qubits', 'and', 'magnetometry', 'would', 'be', 'imminent', 'beneficiaries']] | [-0.1503594454810758, 0.314143199490016, -0.05599206361040788, 0.03541042493954694, -0.023669449895338326, -0.23998577549765018, 0.08528949735640273, 0.43148684784979885, -0.27918060345273515, -0.2186360327021914, 0.048040206715444914, -0.27371299382246717, -0.06213525493430879, 0.254355739467633, -0.05198666432701891, 0.1328296206012683, 0.01914625241368694, 0.0027216356378835693, -0.03480373770260895, -0.1808058853444814, 0.2091323572119147, 0.06092658371362888, 0.35625700323029197, 0.036806899378679585, 0.10122929267506574, 0.05063634448435525, 0.055143111690380414, -0.07122857532460689, -0.07662378645725024, 0.09642005761434376, 0.3120624239058037, 0.03301782596817004, 0.23368087264013962, -0.4330382833755772, -0.265239062873943, 0.0882597655831823, 0.1551328542936203, 0.21527556070961995, -0.07459933540298486, -0.28662380349861694, -0.0101670587212372, -0.1640259049911524, -0.1062451395481615, -0.10668022647946024, 0.023185417156102478, -0.02875269860239096, -0.22525788483892004, 0.09139026057210417, 0.09496514167977681, 0.052727618871230474, -0.0016829043571037097, 0.00136952176952446, 0.08237789286805552, 0.04860927410502459, -0.12180938507745069, -0.01829377300774967, 0.20618223337272942, -0.13321038482966505, -0.1928033398064247, 0.37102730986727794, -0.023286870218367433, -0.11117030795939056, 0.12902798305075405, -0.09576830819157332, -0.057906552542551934, 0.14776047767126854, 0.13929152367374217, 0.10322155702439412, -0.13429080813870647, 0.028970563969932313, 0.025618296736379116, 0.24232550121804464, 0.08245782692864223, 0.260706186642162, 0.23604807022854057, 0.1603354843297291, 0.0754983972653117, 0.16954675332633254, -0.08465839308214335, -0.20866981335968093, -0.263089482580692, -0.1872105342270413, -0.2501283904347359, 0.18437204127124934, -0.04282279077781656, -0.15123301056462904, 0.36146774081329647, 0.12259161488635098, 0.09767854760046786, -0.04723849807354346, 0.32138106935250926, 0.08821042728098766, 0.054884947095276186, 0.0488490808417391, 0.24607849679887295, 0.18939619675003203, 0.12011116534851911, -0.3171257613223492, 0.045228193553400714, -0.07806889052686453] |
1,802.06997 | Categorizing the Content of GitHub README Files | README files play an essential role in shaping a developer's first impression
of a software repository and in documenting the software project that the
repository hosts. Yet, we lack a systematic understanding of the content of a
typical README file as well as tools that can process these files
automatically. To close this gap, we conduct a qualitative study involving the
manual annotation of 4,226 README file sections from 393 randomly sampled
GitHub repositories and we design and evaluate a classifier and a set of
features that can categorize these sections automatically. We find that
information discussing the `What' and `How' of a repository is very common,
while many README files lack information regarding the purpose and status of a
repository. Our multi-label classifier which can predict eight different
categories achieves an F1 score of 0.746. To evaluate the usefulness of the
classification, we used the automatically determined classes to label sections
in GitHub README files using badges and showed files with and without these
badges to twenty software professionals. The majority of participants perceived
the automated labeling of sections based on our classifier to ease information
discovery. This work enables the owners of software repositories to improve the
quality of their documentation and it has the potential to make it easier for
the software development community to discover relevant information in GitHub
README files.
| cs.SE | readme files play an essential role in shaping a developers first impression of a software repository and in documenting the software project that the repository hosts yet we lack a systematic understanding of the content of a typical readme file as well as tools that can process these files automatically to close this gap we conduct a qualitative study involving the manual annotation of 4226 readme file sections from 393 randomly sampled github repositories and we design and evaluate a classifier and a set of features that can categorize these sections automatically we find that information discussing the what and how of a repository is very common while many readme files lack information regarding the purpose and status of a repository our multilabel classifier which can predict eight different categories achieves an f1 score of 0746 to evaluate the usefulness of the classification we used the automatically determined classes to label sections in github readme files using badges and showed files with and without these badges to twenty software professionals the majority of participants perceived the automated labeling of sections based on our classifier to ease information discovery this work enables the owners of software repositories to improve the quality of their documentation and it has the potential to make it easier for the software development community to discover relevant information in github readme files | [['readme', 'files', 'play', 'an', 'essential', 'role', 'in', 'shaping', 'a', 'developers', 'first', 'impression', 'of', 'a', 'software', 'repository', 'and', 'in', 'documenting', 'the', 'software', 'project', 'that', 'the', 'repository', 'hosts', 'yet', 'we', 'lack', 'a', 'systematic', 'understanding', 'of', 'the', 'content', 'of', 'a', 'typical', 'readme', 'file', 'as', 'well', 'as', 'tools', 'that', 'can', 'process', 'these', 'files', 'automatically', 'to', 'close', 'this', 'gap', 'we', 'conduct', 'a', 'qualitative', 'study', 'involving', 'the', 'manual', 'annotation', 'of', '4226', 'readme', 'file', 'sections', 'from', '393', 'randomly', 'sampled', 'github', 'repositories', 'and', 'we', 'design', 'and', 'evaluate', 'a', 'classifier', 'and', 'a', 'set', 'of', 'features', 'that', 'can', 'categorize', 'these', 'sections', 'automatically', 'we', 'find', 'that', 'information', 'discussing', 'the', 'what', 'and', 'how', 'of', 'a', 'repository', 'is', 'very', 'common', 'while', 'many', 'readme', 'files', 'lack', 'information', 'regarding', 'the', 'purpose', 'and', 'status', 'of', 'a', 'repository', 'our', 'multilabel', 'classifier', 'which', 'can', 'predict', 'eight', 'different', 'categories', 'achieves', 'an', 'f1', 'score', 'of', '0746', 'to', 'evaluate', 'the', 'usefulness', 'of', 'the', 'classification', 'we', 'used', 'the', 'automatically', 'determined', 'classes', 'to', 'label', 'sections', 'in', 'github', 'readme', 'files', 'using', 'badges', 'and', 'showed', 'files', 'with', 'and', 'without', 'these', 'badges', 'to', 'twenty', 'software', 'professionals', 'the', 'majority', 'of', 'participants', 'perceived', 'the', 'automated', 'labeling', 'of', 'sections', 'based', 'on', 'our', 'classifier', 'to', 'ease', 'information', 'discovery', 'this', 'work', 'enables', 'the', 'owners', 'of', 'software', 'repositories', 'to', 'improve', 'the', 'quality', 'of', 'their', 'documentation', 'and', 'it', 'has', 'the', 'potential', 'to', 'make', 'it', 'easier', 'for', 'the', 'software', 'development', 'community', 'to', 'discover', 'relevant', 'information', 'in', 'github', 'readme', 'files']] | [-0.05832852442645364, -0.029197273961552937, -0.08100363983255293, 0.08448052874847943, -0.12925244101012748, -0.1477038225510882, 0.08421387002699905, 0.408467655264669, -0.24352434055258831, -0.3820911940932274, 0.09348658822683824, -0.33175404717938767, -0.08304982718552412, 0.18660669774858332, -0.09751488739417659, 0.05309661419027382, 0.13115173781911532, 0.05636546716094017, -0.02026819810685184, -0.32076112933146456, 0.3101904083436562, 0.1000782339523236, 0.32325057208124136, 0.07669426641116539, 0.027023931294679643, -0.002748300884332922, -0.10709606079332945, -0.061604212706701626, -0.09913833846092328, 0.17354073446761403, 0.38076506465156046, 0.27034779630808364, 0.2989616282367044, -0.369606291843423, -0.11220222646008349, 0.045054923382898175, 0.14575473450227744, 0.1051909890320773, -0.04339906933458729, -0.32692562098718353, 0.10729206655226234, -0.22627582869802912, -0.05882464295460118, -0.10962866276088688, -0.001166563133139991, 0.026346583806961362, -0.23046633380361728, -0.05361903018421597, 0.014146069333526409, 0.11265448421757254, -0.036148202506204444, -0.1129940278419397, -0.05530654684123066, 0.25427425399215686, 0.05501080361828725, 0.044352768677183324, 0.1724898026138544, -0.1602623035132031, -0.11153051818617517, 0.3988002086720533, -0.008534096686376466, -0.1539918275781545, 0.18266140757852958, -0.02303196700031145, -0.15825537973187037, 0.09645557807758451, 0.2354082761435873, 0.06306978246404064, -0.24244336499062935, -0.011981444626063523, -0.010481676515191794, 0.250828352579847, 0.04649048047243721, 0.004484660343991385, 0.20898898245973718, 0.21001863857200886, -0.056210275197453384, 0.14081082848935492, -0.053106332868855036, -0.031580816449390516, -0.2582276576674647, -0.17151060998232828, -0.1196673133275989, 0.009237359140404603, -0.05390482695715036, -0.17626451985703576, 0.39366276332487665, 0.22507935701765946, 0.15351160143864237, 0.033510100229436325, 0.3076628361394008, -0.0659106969734421, 0.13063588546278576, 0.1266149433112393, 0.12639259050910673, -0.024944553325573604, 0.15320237115982713, -0.13678977925330402, 0.11791484029756652, -3.177170124318864e-05] |
1,802.06998 | Constraints on Sub-GeV Dark Matter-Electron Scattering from the
DarkSide-50 Experiment | We present new constraints on sub-GeV dark matter particles scattering off
electrons in argon based on an analysis of ionization signal data from the
DarkSide-50 detector.
| astro-ph.CO | we present new constraints on subgev dark matter particles scattering off electrons in argon based on an analysis of ionization signal data from the darkside50 detector | [['we', 'present', 'new', 'constraints', 'on', 'subgev', 'dark', 'matter', 'particles', 'scattering', 'off', 'electrons', 'in', 'argon', 'based', 'on', 'an', 'analysis', 'of', 'ionization', 'signal', 'data', 'from', 'the', 'darkside50', 'detector']] | [-0.031929597115287416, 0.1860922904771332, -0.20134700104021108, 0.09324900204172501, -0.04179431025225382, -0.11067581792863515, 0.028181074679685898, 0.30163136396843654, -0.16432213392825082, -0.37790345235799366, -0.03741985538419193, -0.40606439486145973, 0.05194063198107939, 0.21017982317313838, 0.08408416940185887, 0.032565113730155505, 0.04527326354470391, -0.042447551941642396, -0.05380843869016434, -0.18632541338984782, 0.2676389413491751, 0.14628638611891523, 0.23000917816534638, 0.12614171411125705, 0.15425119699928194, 0.08691905483675118, -0.08859359388812803, -0.16150130725537354, -0.1296204969000358, 0.01923305863657823, 0.20081310934172228, 0.12671124197256106, 0.06629711612521742, -0.5825375395898635, -0.16160620834741096, 0.13483194465963885, 0.16511160876745215, 0.06976359796065551, -0.2195957062783866, -0.41184874294468987, -0.09687358890033256, -0.16332121626832163, -0.021688600822996635, 0.03657372774054798, -0.08403026584822398, 0.026374117757838506, -0.22773513462967598, 0.057712825713679194, -0.06404261500574648, -0.05424934399958987, -0.1086478137339537, -0.14700965153483245, 0.09090284566180064, -0.11014675232581794, 0.057046406938192934, -0.06040235238078122, 0.32090219276813936, -0.18425691733136773, -0.07108658808283508, 0.3658105839903538, -0.17738122009457305, -0.13403031423401374, 0.18692148219829854, -0.13428584260579485, -0.14407994460242873, 0.2859661994645229, 0.30756908683822703, 0.10939059277566579, -0.2031498489758143, 0.10482804976905194, -0.06164685722727042, 0.24517927483583873, 0.0385538951243059, 0.028917552903294563, 0.3034451906211101, 0.3312783499893088, 0.11455902339030917, 0.04827471972944645, -0.23358772070003817, 0.03934249360687458, -0.3709601345830239, -0.11066545460086602, -0.17345906142145395, -0.01839070404933479, -0.009469018102838444, -0.07805215560186368, 0.3392270798436724, 0.12503715640363786, 0.1526727996265086, -0.06813557533762203, 0.40210589222036874, 0.03842655232606026, -0.01318527921102941, 0.012246662732930137, 0.34035589517309117, 0.12849605964640012, 0.11509730176140483, -0.24515723296476957, -0.030354123687944733, -0.037251596786798194] |
1,802.06999 | Proton acceleration by a pair of successive ultraintense femtosecond
laser pulses | We investigate the target normal sheath acceleration of protons in thin
aluminum targets irradiated at relativistic intensity by two time-separated
ultrashort (35 fs) laser pulses. For identical laser pulses and target
thicknesses of 3 and 6 $\mu$m, we observe experimentally that the second pulse
boosts the maximum energy and charge of the proton beam produced by the first
pulse for time delays below $\sim0.6-1$ ps. By using two-dimensional
particle-in-cell simulations we examine the variation of the proton energy
spectra with respect to the time-delay between the two pulses. We demonstrate
that the expansion of the target front surface caused by the first pulse
significantly enhances the hot-electron generation by the second pulse arriving
after a few hundreds of fs time delay. This enhancement, however, does not
suffice to further accelerate the fastest protons driven by the first pulse
once three-dimensional quenching effects have set in. This implies a limit to
the maximum time delay that leads to proton energy enhancement, which we
theoretically determine.
| physics.plasm-ph | we investigate the target normal sheath acceleration of protons in thin aluminum targets irradiated at relativistic intensity by two timeseparated ultrashort 35 fs laser pulses for identical laser pulses and target thicknesses of 3 and 6 mum we observe experimentally that the second pulse boosts the maximum energy and charge of the proton beam produced by the first pulse for time delays below sim061 ps by using twodimensional particleincell simulations we examine the variation of the proton energy spectra with respect to the timedelay between the two pulses we demonstrate that the expansion of the target front surface caused by the first pulse significantly enhances the hotelectron generation by the second pulse arriving after a few hundreds of fs time delay this enhancement however does not suffice to further accelerate the fastest protons driven by the first pulse once threedimensional quenching effects have set in this implies a limit to the maximum time delay that leads to proton energy enhancement which we theoretically determine | [['we', 'investigate', 'the', 'target', 'normal', 'sheath', 'acceleration', 'of', 'protons', 'in', 'thin', 'aluminum', 'targets', 'irradiated', 'at', 'relativistic', 'intensity', 'by', 'two', 'timeseparated', 'ultrashort', '35', 'fs', 'laser', 'pulses', 'for', 'identical', 'laser', 'pulses', 'and', 'target', 'thicknesses', 'of', '3', 'and', '6', 'mum', 'we', 'observe', 'experimentally', 'that', 'the', 'second', 'pulse', 'boosts', 'the', 'maximum', 'energy', 'and', 'charge', 'of', 'the', 'proton', 'beam', 'produced', 'by', 'the', 'first', 'pulse', 'for', 'time', 'delays', 'below', 'sim061', 'ps', 'by', 'using', 'twodimensional', 'particleincell', 'simulations', 'we', 'examine', 'the', 'variation', 'of', 'the', 'proton', 'energy', 'spectra', 'with', 'respect', 'to', 'the', 'timedelay', 'between', 'the', 'two', 'pulses', 'we', 'demonstrate', 'that', 'the', 'expansion', 'of', 'the', 'target', 'front', 'surface', 'caused', 'by', 'the', 'first', 'pulse', 'significantly', 'enhances', 'the', 'hotelectron', 'generation', 'by', 'the', 'second', 'pulse', 'arriving', 'after', 'a', 'few', 'hundreds', 'of', 'fs', 'time', 'delay', 'this', 'enhancement', 'however', 'does', 'not', 'suffice', 'to', 'further', 'accelerate', 'the', 'fastest', 'protons', 'driven', 'by', 'the', 'first', 'pulse', 'once', 'threedimensional', 'quenching', 'effects', 'have', 'set', 'in', 'this', 'implies', 'a', 'limit', 'to', 'the', 'maximum', 'time', 'delay', 'that', 'leads', 'to', 'proton', 'energy', 'enhancement', 'which', 'we', 'theoretically', 'determine']] | [-0.09961814771297793, 0.22770007502321907, -0.037567438560600845, 0.03688239740876287, 0.0228456566053117, -0.09704834676491943, 0.04361918389702936, 0.47034911956478115, -0.25364346698246487, -0.3373982842680941, -0.008281860304882099, -0.2547692504948565, -0.0028177482287393757, 0.2187112326122409, 0.019041757425007643, 0.04855053224515147, 0.05526347568921425, -0.032818771013133, -0.06354353342782364, -0.18392302215590708, 0.28045795827624076, 0.12388766371856438, 0.2775430864785895, 0.05848030002067791, 0.13058766233020583, 0.0017831340714992007, 0.0251726002540965, -0.055339570581824434, -0.11540042545407707, 0.05527978239615271, 0.19115349414838376, 0.03444024085415744, 0.24240369316293325, -0.49702542562586216, -0.24195236383017404, 0.06072432967688477, 0.13096555938195734, 0.11284405799179789, -0.07148305548960629, -0.23090281304360533, 0.08601518138454645, -0.14522602315135072, -0.13768861690776113, 0.022603082246335646, 0.03438055435726933, 0.12275249523787754, -0.23635459845804216, 0.059774738210796215, 0.05786436954348925, -0.010809954124405706, -0.0412327932433848, -0.026584019558789907, -0.009700223502125934, 0.04708684522992834, 0.0702113323442158, 0.06052833720127498, 0.1597120786641733, -0.11064912901371375, -0.0780709588877354, 0.3595681806477758, -0.11143758306079801, -0.06553065627127704, 0.10987621493654702, -0.22375752041944835, -0.01987105683263597, 0.2572030041229688, 0.15217063383933477, 0.13946829946923064, -0.1399781406768512, -0.03386314807315443, 0.03582735469441952, 0.2562515138779864, 0.18547344204906854, 0.019207126670231344, 0.16713885352175478, 0.19430250979022928, 0.034536316569471745, 0.13667765876815363, -0.19462239430885922, -0.00902402378401599, -0.28090482452552923, -0.10929162591996465, -0.1526533262061378, 0.045100562846623046, -0.053200726668465384, -0.0604536363717877, 0.4578009841198022, 0.14661103068776657, 0.14825693123253988, 0.009901516905848645, 0.3028381370190828, 0.1462548365238861, 0.027059093173421873, 0.07115907480146028, 0.2937301738499064, 0.1239319923708781, 0.10388414807872279, -0.2965391719448837, 0.04837625278474226, 0.0008700079815976458] |
1,802.07 | CASPaxos: Replicated State Machines without logs | CASPaxos is a wait-free, linearizable, multi-writer multi-reader register in
unreliable, asynchronous networks supporting arbitrary update operations
including compare-and-set (CAS). The register acts as a replicated state
machine providing an interface for changing its value by applying an arbitrary
user-provided function (a command). Unlike Multi-Paxos and Raft which replicate
the log of commands, CASPaxos replicates state, thus avoiding associated
complexity, reducing write amplification, increasing concurrency of disk
operations and hardware utilization. The paper describes CASPaxos, proves its
safety properties and evaluates the characteristics of a CASPaxos-based
prototype of key-value storage.
| cs.DC | caspaxos is a waitfree linearizable multiwriter multireader register in unreliable asynchronous networks supporting arbitrary update operations including compareandset cas the register acts as a replicated state machine providing an interface for changing its value by applying an arbitrary userprovided function a command unlike multipaxos and raft which replicate the log of commands caspaxos replicates state thus avoiding associated complexity reducing write amplification increasing concurrency of disk operations and hardware utilization the paper describes caspaxos proves its safety properties and evaluates the characteristics of a caspaxosbased prototype of keyvalue storage | [['caspaxos', 'is', 'a', 'waitfree', 'linearizable', 'multiwriter', 'multireader', 'register', 'in', 'unreliable', 'asynchronous', 'networks', 'supporting', 'arbitrary', 'update', 'operations', 'including', 'compareandset', 'cas', 'the', 'register', 'acts', 'as', 'a', 'replicated', 'state', 'machine', 'providing', 'an', 'interface', 'for', 'changing', 'its', 'value', 'by', 'applying', 'an', 'arbitrary', 'userprovided', 'function', 'a', 'command', 'unlike', 'multipaxos', 'and', 'raft', 'which', 'replicate', 'the', 'log', 'of', 'commands', 'caspaxos', 'replicates', 'state', 'thus', 'avoiding', 'associated', 'complexity', 'reducing', 'write', 'amplification', 'increasing', 'concurrency', 'of', 'disk', 'operations', 'and', 'hardware', 'utilization', 'the', 'paper', 'describes', 'caspaxos', 'proves', 'its', 'safety', 'properties', 'and', 'evaluates', 'the', 'characteristics', 'of', 'a', 'caspaxosbased', 'prototype', 'of', 'keyvalue', 'storage']] | [-0.2486572770894259, 0.06329913129100051, -0.018085924643573576, 0.008857524077322376, -0.08914678171277046, -0.26250883886569193, 0.11709475743279246, 0.32730204734453483, -0.2862658978964405, -0.32428106671850193, 0.1096800028496347, -0.2234294258443446, -0.07785306616161747, 0.18380864793113594, -0.14198036912036524, 0.08793635726183781, 0.05211077383371477, 0.010508941968196425, -0.039961071936520695, -0.24169357463546182, 0.20307862426785903, 0.08278360385608313, 0.27372357937314645, -0.0250558460923447, 0.1203699760545773, 0.06603205053071523, -0.021240640014822156, -0.058997026136166406, 0.01009415393566777, 0.08514883156180725, 0.28634892017634095, 0.24335940828782388, 0.2686879127018753, -0.47765881446158065, -0.10328090532372396, 0.04916708074221066, 0.13690863977903608, 0.09009250193357939, -0.022886733378647644, -0.26935462330350246, 0.08370893869024498, -0.23888694529218235, -0.09351007802272751, -0.08630717092932298, 0.016092883827748185, 0.046729310641825283, -0.2613108913232198, -0.05790443410133493, 0.08364761759387865, 0.10262677078831127, -0.04020425853929643, -0.028134352832647234, -0.0148099341092567, 0.1374876387684938, -0.08477794149109087, 0.058022188429517306, 0.2187039602772686, -0.128517702628655, -0.15316584849751544, 0.3500818869462986, 0.01182719697940281, -0.1514547725325857, 0.17647731428345045, 0.05245560315041535, -0.13647908611817222, 0.07457439859943657, 0.14419589716213188, 0.06228202738231797, -0.13026176054758587, 0.12362320637450842, -0.002059402682914816, 0.25717828915208235, 0.07374325779470048, 0.04533964590619093, 0.13211576714469442, 0.2016123990132206, 0.07858225656673312, 0.20996986088428604, 0.010349247644082696, -0.12013737507560558, -0.24419762833771863, -0.20790767742604574, -0.15964237840353757, -0.003653002383679837, -0.06497337057836616, -0.1955363406403654, 0.3662862512657697, 0.15701601240548424, 0.164608070103655, 0.13234140902313393, 0.3905993285160726, 0.07536715727122821, 0.11341525925772972, 0.17755664701455798, 0.04706350894880363, 0.05326166260323819, 0.17876916046885924, -0.24517446759975806, 0.19788635075734606, 0.01318187695317741] |
1,802.07001 | Endoscopic optical coherence tomography with a flexible fiber bundle | We demonstrate in vivo endoscopic optical coherence tomography (OCT) imaging
in the forward direction using a flexible fiber bundle. In comparison to
current conventional forward looking probe schemes, our approach simplifies the
endoscope design by avoiding the integration of any beam steering components in
the distal probe end due to 2D scanning of a focused light beam over the
proximal fiber bundle surface. We describe the challenges that arise when OCT
imaging with a fiber bundle is performed, such as multimoding or
cross-coupling. The performance of different fiber bundles with varying
parameters such as numerical aperture, core size and core structure was
consequently compared and artifacts that degrade the image quality were
described in detail. Based on our findings, we propose an optimal fiber bundle
design for endoscopic OCT imaging.
| physics.med-ph physics.optics | we demonstrate in vivo endoscopic optical coherence tomography oct imaging in the forward direction using a flexible fiber bundle in comparison to current conventional forward looking probe schemes our approach simplifies the endoscope design by avoiding the integration of any beam steering components in the distal probe end due to 2d scanning of a focused light beam over the proximal fiber bundle surface we describe the challenges that arise when oct imaging with a fiber bundle is performed such as multimoding or crosscoupling the performance of different fiber bundles with varying parameters such as numerical aperture core size and core structure was consequently compared and artifacts that degrade the image quality were described in detail based on our findings we propose an optimal fiber bundle design for endoscopic oct imaging | [['we', 'demonstrate', 'in', 'vivo', 'endoscopic', 'optical', 'coherence', 'tomography', 'oct', 'imaging', 'in', 'the', 'forward', 'direction', 'using', 'a', 'flexible', 'fiber', 'bundle', 'in', 'comparison', 'to', 'current', 'conventional', 'forward', 'looking', 'probe', 'schemes', 'our', 'approach', 'simplifies', 'the', 'endoscope', 'design', 'by', 'avoiding', 'the', 'integration', 'of', 'any', 'beam', 'steering', 'components', 'in', 'the', 'distal', 'probe', 'end', 'due', 'to', '2d', 'scanning', 'of', 'a', 'focused', 'light', 'beam', 'over', 'the', 'proximal', 'fiber', 'bundle', 'surface', 'we', 'describe', 'the', 'challenges', 'that', 'arise', 'when', 'oct', 'imaging', 'with', 'a', 'fiber', 'bundle', 'is', 'performed', 'such', 'as', 'multimoding', 'or', 'crosscoupling', 'the', 'performance', 'of', 'different', 'fiber', 'bundles', 'with', 'varying', 'parameters', 'such', 'as', 'numerical', 'aperture', 'core', 'size', 'and', 'core', 'structure', 'was', 'consequently', 'compared', 'and', 'artifacts', 'that', 'degrade', 'the', 'image', 'quality', 'were', 'described', 'in', 'detail', 'based', 'on', 'our', 'findings', 'we', 'propose', 'an', 'optimal', 'fiber', 'bundle', 'design', 'for', 'endoscopic', 'oct', 'imaging']] | [-0.11496074628012702, 0.051504767282036595, -0.06746323076221197, -0.021718234277705757, -0.07492998705873656, -0.1715511305568119, -0.011185334298701943, 0.4931122303305035, -0.26946718378584517, -0.23839830118050986, 0.12966374240999737, -0.217229499001518, -0.17936331836701652, 0.2672730039772686, -0.13842664148600758, 0.08605084276592084, 0.10851321746089836, -0.04618839228294732, -0.0803961023695536, -0.15788170292904932, 0.2961103685611729, 0.05115995635531207, 0.3690090156918348, 0.03271277411840856, 0.14365827424220232, 0.07794206787501787, -0.040120229587074396, -0.0023079607563540917, -0.09506747349719932, 0.13412947734355812, 0.2812116351754715, 0.10798806437948184, 0.23892078674831535, -0.447417036926215, -0.2354591754517814, 0.06170678693916677, 0.143223361263788, 0.058282253751170264, -0.04408470124399737, -0.2748738174568573, 0.03995294425755653, -0.10283498416199933, -0.12057793474496277, -0.06406617268392917, -0.052810100782590436, 0.03629446380217596, -0.2368803413159777, -0.01988546947845756, -0.015149738567397576, 0.11667443450915721, -0.04021749089204872, -0.046494949580162995, -0.006934049795562214, 0.10982897329119813, -0.015246947283329542, 0.06448310789428363, 0.2046367938110475, -0.14866759072512734, -0.09298489057971526, 0.3589917686623485, -0.05111391000474926, -0.19666318694317295, 0.13062946852693666, -0.1142445502309995, -0.0484311361472274, 0.187713390140426, 0.1724772592284536, 0.10593880556321653, -0.0694474996630032, -0.012741582050263907, -0.00047609121394307576, 0.19990384223502736, 0.11094565623324336, 0.0409087129966031, 0.13948655304816632, 0.2558163334200404, 0.03716089865033715, 0.13198485677383204, -0.19591469062643863, -0.02581400167586845, -0.26014287083756266, -0.21508036933608296, -0.1233974394565376, 0.05128358739659248, -0.051923362588529774, -0.08530807893817104, 0.410731882867656, 0.13909598077510216, 0.2017232512607593, 0.012168174555395232, 0.38767555106229096, 0.03101248385803413, 0.11623962800191759, -0.01020664670897193, 0.2891648427164543, 0.12376320670727034, 0.09531658446206892, -0.22412622980990035, -0.023775734971169124, 0.040967080980366055] |
1,802.07002 | Interplay of confinement and density on the heat transfer
characteristics of nanoscale-confined gas | The effect of changing the Knudsen number on the thermal properties of static
argon gas within nanoscale confinement is investigated by three-dimensional
molecular dynamics simulations. Utilizing thermalized channel walls, it is
observed that regardless of the channel height and the gas density, the wall
force field affects the density and temperature distributions within
approximately 1 nm from each channel wall. As the gas density is increased for
constant channel height, the relative effect of the wall force field on the
motion of argon gas atoms and, consequently, the maximum normalized gas density
near the walls is decreased. Therefore, for the same Knudsen number, the
temperature jump for this case is higher than what is observed for the case in
which the channel height changes at a constant gas density. The normalized
effective thermal conductivity of the argon gas based on the heat flux that is
obtained by implementation of the Irving-Kirkwood method reveals that the two
cases give the same normalized effective thermal conductivity. For the constant
density case, the total thermal resistance increases as the Knudsen number
decreases while for the constant height case, it reduces considerably.
Meanwhile, it is observed that regardless of the method used to change the
Knudsen number, a considerable portion of the total thermal resistance refers
to interfacial and wall force field thermal resistance even for near micrometer
sized channels.
| physics.flu-dyn physics.comp-ph | the effect of changing the knudsen number on the thermal properties of static argon gas within nanoscale confinement is investigated by threedimensional molecular dynamics simulations utilizing thermalized channel walls it is observed that regardless of the channel height and the gas density the wall force field affects the density and temperature distributions within approximately 1 nm from each channel wall as the gas density is increased for constant channel height the relative effect of the wall force field on the motion of argon gas atoms and consequently the maximum normalized gas density near the walls is decreased therefore for the same knudsen number the temperature jump for this case is higher than what is observed for the case in which the channel height changes at a constant gas density the normalized effective thermal conductivity of the argon gas based on the heat flux that is obtained by implementation of the irvingkirkwood method reveals that the two cases give the same normalized effective thermal conductivity for the constant density case the total thermal resistance increases as the knudsen number decreases while for the constant height case it reduces considerably meanwhile it is observed that regardless of the method used to change the knudsen number a considerable portion of the total thermal resistance refers to interfacial and wall force field thermal resistance even for near micrometer sized channels | [['the', 'effect', 'of', 'changing', 'the', 'knudsen', 'number', 'on', 'the', 'thermal', 'properties', 'of', 'static', 'argon', 'gas', 'within', 'nanoscale', 'confinement', 'is', 'investigated', 'by', 'threedimensional', 'molecular', 'dynamics', 'simulations', 'utilizing', 'thermalized', 'channel', 'walls', 'it', 'is', 'observed', 'that', 'regardless', 'of', 'the', 'channel', 'height', 'and', 'the', 'gas', 'density', 'the', 'wall', 'force', 'field', 'affects', 'the', 'density', 'and', 'temperature', 'distributions', 'within', 'approximately', '1', 'nm', 'from', 'each', 'channel', 'wall', 'as', 'the', 'gas', 'density', 'is', 'increased', 'for', 'constant', 'channel', 'height', 'the', 'relative', 'effect', 'of', 'the', 'wall', 'force', 'field', 'on', 'the', 'motion', 'of', 'argon', 'gas', 'atoms', 'and', 'consequently', 'the', 'maximum', 'normalized', 'gas', 'density', 'near', 'the', 'walls', 'is', 'decreased', 'therefore', 'for', 'the', 'same', 'knudsen', 'number', 'the', 'temperature', 'jump', 'for', 'this', 'case', 'is', 'higher', 'than', 'what', 'is', 'observed', 'for', 'the', 'case', 'in', 'which', 'the', 'channel', 'height', 'changes', 'at', 'a', 'constant', 'gas', 'density', 'the', 'normalized', 'effective', 'thermal', 'conductivity', 'of', 'the', 'argon', 'gas', 'based', 'on', 'the', 'heat', 'flux', 'that', 'is', 'obtained', 'by', 'implementation', 'of', 'the', 'irvingkirkwood', 'method', 'reveals', 'that', 'the', 'two', 'cases', 'give', 'the', 'same', 'normalized', 'effective', 'thermal', 'conductivity', 'for', 'the', 'constant', 'density', 'case', 'the', 'total', 'thermal', 'resistance', 'increases', 'as', 'the', 'knudsen', 'number', 'decreases', 'while', 'for', 'the', 'constant', 'height', 'case', 'it', 'reduces', 'considerably', 'meanwhile', 'it', 'is', 'observed', 'that', 'regardless', 'of', 'the', 'method', 'used', 'to', 'change', 'the', 'knudsen', 'number', 'a', 'considerable', 'portion', 'of', 'the', 'total', 'thermal', 'resistance', 'refers', 'to', 'interfacial', 'and', 'wall', 'force', 'field', 'thermal', 'resistance', 'even', 'for', 'near', 'micrometer', 'sized', 'channels']] | [-0.12362507272684799, 0.19037600073229885, -0.04701893825487819, 0.004151743251018523, 0.017372823359477704, -0.09407317650759905, 0.05295363219714501, 0.32824206581355725, -0.269993239900394, -0.3225519374606356, 0.06295619069328696, -0.2738046211219368, -0.02740377924339104, 0.17211679299568047, 0.006513106219462259, 0.02816119437534527, -0.01137605769481444, 0.0410741448352954, -0.03757354184733786, -0.21403841851938482, 0.2780385925913584, 0.10041029210510433, 0.32955318463521194, 0.12545434538217312, 0.08384530754512397, -0.027887278456916718, 0.010140329070875536, 0.07493869580521599, -0.15811887777689124, 0.014775627076120242, 0.15795893085073778, -0.04462028249883942, 0.21519198987748375, -0.43338399263412025, -0.2521029573585014, 0.06451630489352758, 0.12733998640174607, 0.10791423954986513, -0.009287422523932713, -0.19145903014990015, 0.045863524881352265, -0.13396084726689203, -0.16778045338454894, 0.03323900198617505, 0.068645649671501, 0.008745550917434728, -0.24766983571091453, 0.1711943843450904, 0.008997002263318806, 0.04469248981717809, -0.07151625230001797, -0.15395248465990005, -0.05814975251204672, 0.09764201894445773, 0.056490614432305825, 0.04288526132818213, 0.28230839514223016, -0.17584883149783334, 0.019387890403447426, 0.35946549239477754, -0.1197525786653298, -0.1633432403853806, 0.17734258819759857, -0.17981155504126398, -0.0006329044397040558, 0.22960702175237402, 0.13266637476070461, 0.09030469000932917, -0.09583363405519486, 0.04671516552241931, -0.04182147062527824, 0.18481904102192648, 0.11209697634253683, 0.009520164113986282, 0.20960787814151727, 0.1714410443555366, 0.07696459105442303, 0.1660659494109254, -0.15858727365225322, -0.08568965972079771, -0.27318265597723357, -0.182097600847153, -0.22815032517722916, 0.02866041060924464, -0.11849812207103756, -0.15611215489834085, 0.3449133677836672, 0.13886035074772463, 0.18147774291661592, 0.03174480002330188, 0.33542306697103236, 0.14063976629558886, 0.08291793978913167, 0.09876365073239513, 0.23928962719618482, 0.19031613060392735, 0.13540273412816903, -0.3249028227807113, 0.09533867739404725, 0.014835414120235143] |
1,802.07003 | Double Field Theory and Membrane Sigma-Models | We investigate geometric aspects of double field theory (DFT) and its
formulation as a doubled membrane sigma-model. Starting from the standard
Courant algebroid over the phase space of an open membrane, we determine a
splitting and a projection to a subbundle that sends the Courant algebroid
operations to the corresponding operations in DFT. This describes precisely how
the geometric structure of DFT lies in between two Courant algebroids and is
reconciled with generalized geometry. We construct the membrane sigma-model
that corresponds to DFT, and demonstrate how the standard T-duality orbit of
geometric and non-geometric flux backgrounds is captured by its action
functional in a unified way. This also clarifies the appearence of
noncommutative and nonassociative deformations of geometry in non-geometric
closed string theory. Gauge invariance of the DFT membrane sigma-model is
compatible with the flux formulation of DFT and its strong constraint, whose
geometric origin is explained. Our approach leads to a new generalization of a
Courant algebroid, that we call a DFT algebroid and relate to other known
generalizations, such as pre-Courant algebroids and symplectic nearly Lie
2-algebroids. We also describe the construction of a gauge-invariant doubled
membrane sigma-model that does not require imposing the strong constraint.
| hep-th math-ph math.DG math.MP math.SG | we investigate geometric aspects of double field theory dft and its formulation as a doubled membrane sigmamodel starting from the standard courant algebroid over the phase space of an open membrane we determine a splitting and a projection to a subbundle that sends the courant algebroid operations to the corresponding operations in dft this describes precisely how the geometric structure of dft lies in between two courant algebroids and is reconciled with generalized geometry we construct the membrane sigmamodel that corresponds to dft and demonstrate how the standard tduality orbit of geometric and nongeometric flux backgrounds is captured by its action functional in a unified way this also clarifies the appearence of noncommutative and nonassociative deformations of geometry in nongeometric closed string theory gauge invariance of the dft membrane sigmamodel is compatible with the flux formulation of dft and its strong constraint whose geometric origin is explained our approach leads to a new generalization of a courant algebroid that we call a dft algebroid and relate to other known generalizations such as precourant algebroids and symplectic nearly lie 2algebroids we also describe the construction of a gaugeinvariant doubled membrane sigmamodel that does not require imposing the strong constraint | [['we', 'investigate', 'geometric', 'aspects', 'of', 'double', 'field', 'theory', 'dft', 'and', 'its', 'formulation', 'as', 'a', 'doubled', 'membrane', 'sigmamodel', 'starting', 'from', 'the', 'standard', 'courant', 'algebroid', 'over', 'the', 'phase', 'space', 'of', 'an', 'open', 'membrane', 'we', 'determine', 'a', 'splitting', 'and', 'a', 'projection', 'to', 'a', 'subbundle', 'that', 'sends', 'the', 'courant', 'algebroid', 'operations', 'to', 'the', 'corresponding', 'operations', 'in', 'dft', 'this', 'describes', 'precisely', 'how', 'the', 'geometric', 'structure', 'of', 'dft', 'lies', 'in', 'between', 'two', 'courant', 'algebroids', 'and', 'is', 'reconciled', 'with', 'generalized', 'geometry', 'we', 'construct', 'the', 'membrane', 'sigmamodel', 'that', 'corresponds', 'to', 'dft', 'and', 'demonstrate', 'how', 'the', 'standard', 'tduality', 'orbit', 'of', 'geometric', 'and', 'nongeometric', 'flux', 'backgrounds', 'is', 'captured', 'by', 'its', 'action', 'functional', 'in', 'a', 'unified', 'way', 'this', 'also', 'clarifies', 'the', 'appearence', 'of', 'noncommutative', 'and', 'nonassociative', 'deformations', 'of', 'geometry', 'in', 'nongeometric', 'closed', 'string', 'theory', 'gauge', 'invariance', 'of', 'the', 'dft', 'membrane', 'sigmamodel', 'is', 'compatible', 'with', 'the', 'flux', 'formulation', 'of', 'dft', 'and', 'its', 'strong', 'constraint', 'whose', 'geometric', 'origin', 'is', 'explained', 'our', 'approach', 'leads', 'to', 'a', 'new', 'generalization', 'of', 'a', 'courant', 'algebroid', 'that', 'we', 'call', 'a', 'dft', 'algebroid', 'and', 'relate', 'to', 'other', 'known', 'generalizations', 'such', 'as', 'precourant', 'algebroids', 'and', 'symplectic', 'nearly', 'lie', '2algebroids', 'we', 'also', 'describe', 'the', 'construction', 'of', 'a', 'gaugeinvariant', 'doubled', 'membrane', 'sigmamodel', 'that', 'does', 'not', 'require', 'imposing', 'the', 'strong', 'constraint']] | [-0.166775376658247, 0.058800256076210644, -0.11464885956751221, 0.13483890533950557, -0.1496335859716202, -0.13744072675366292, 0.024823794677627808, 0.3609319444595262, -0.32030188172792246, -0.26723053945096753, 0.029114858016860905, -0.20820589686245328, -0.2607775376850946, 0.13210628651796294, -0.17551991463206107, -0.03291597070655729, 0.027371996143512954, 0.07214707351346134, -0.17524271982373915, -0.18151928469329376, 0.3469240550337491, 0.06653399377146435, 0.2592779855229751, 0.02086260545566076, 0.1438039761046042, -0.011109253151737379, 0.01265217687210275, 0.016123798968490317, -0.1350074439420367, 0.14278356786911386, 0.24093990584816596, 0.035596321741438876, 0.1364313094145289, -0.4631734362596439, -0.1893529196849241, 0.04014687141170725, 0.11014477342056732, 0.09370435407265287, 0.013567817547932418, -0.2847067077915805, 0.05087271922343232, -0.17375498926361102, -0.12582764092590565, -0.12074223057263428, -0.004584542926603157, -0.04822771885723929, -0.17230289148765315, 0.044416384785283224, 0.07641741727017845, 0.057825156890788945, -0.09649112381951207, -0.05681046024858575, -0.08437150994179338, 0.0372988163126689, 0.04295570617044848, 0.09479278770764593, 0.1732938866380301, -0.0851540002334543, -0.1454603320476834, 0.40727957226147854, -0.061866252231552746, -0.2569362626733221, 0.09780172000855508, -0.11435450263664766, -0.19752999440522281, 0.1029147243649332, 0.04402470924171873, 0.10406724644608495, -0.12231960700092263, 0.22728333209912913, -0.05186277226253291, 0.0997472196844444, 0.10078924368464887, 0.021294531219573032, 0.2075929067596191, 0.15636677305905544, 0.08772458685232759, 0.0842925194040002, -0.039317731435100235, -0.1414569695221467, -0.40613422309509434, -0.1515596233312137, -0.08644938668985193, 0.12767416418353955, -0.09025098367309317, -0.22308520249307456, 0.4023725497606916, 0.104555618741098, 0.1653987352308262, 0.07638566478654141, 0.187567332002212, 0.08823452560840213, 0.09384870596201808, 0.017689690301065437, 0.19641441757546155, 0.26686464040069796, 0.02803582675000088, -0.202518497390856, -0.13961365621894448, 0.1512638165079283] |
1,802.07004 | Cross-over between collective and independent-particle excitations in
quasi-2D electron gas with one filled miniband | While it has been recently demonstrated that, for quasi-2D electron gas
(Q2DEG) with one filled miniband, the dynamic exchange $f_x$ and Hartree $f_H$
kernels cancel each other in the low-density regime $r_s\rightarrow \infty$ (by
half and completely, for the spin-neutral and fully spin-polarized cases,
respectively), here we analytically show that the same happens at arbitrary
densities at short distances. This motivates us to study the confinement
dependence of the excitations in Q2DEG. Our calculations unambiguously confirm
that, at strong confinements, the time-dependent exact exchange excitation
energies approach the single-particle Kohn-Sham ones for the spin-polarized
case, while the same, but less pronounced, tendency is observed for
spin-neutral Q2DEG.
| cond-mat.mes-hall | while it has been recently demonstrated that for quasi2d electron gas q2deg with one filled miniband the dynamic exchange f_x and hartree f_h kernels cancel each other in the lowdensity regime r_srightarrow infty by half and completely for the spinneutral and fully spinpolarized cases respectively here we analytically show that the same happens at arbitrary densities at short distances this motivates us to study the confinement dependence of the excitations in q2deg our calculations unambiguously confirm that at strong confinements the timedependent exact exchange excitation energies approach the singleparticle kohnsham ones for the spinpolarized case while the same but less pronounced tendency is observed for spinneutral q2deg | [['while', 'it', 'has', 'been', 'recently', 'demonstrated', 'that', 'for', 'quasi2d', 'electron', 'gas', 'q2deg', 'with', 'one', 'filled', 'miniband', 'the', 'dynamic', 'exchange', 'f_x', 'and', 'hartree', 'f_h', 'kernels', 'cancel', 'each', 'other', 'in', 'the', 'lowdensity', 'regime', 'r_srightarrow', 'infty', 'by', 'half', 'and', 'completely', 'for', 'the', 'spinneutral', 'and', 'fully', 'spinpolarized', 'cases', 'respectively', 'here', 'we', 'analytically', 'show', 'that', 'the', 'same', 'happens', 'at', 'arbitrary', 'densities', 'at', 'short', 'distances', 'this', 'motivates', 'us', 'to', 'study', 'the', 'confinement', 'dependence', 'of', 'the', 'excitations', 'in', 'q2deg', 'our', 'calculations', 'unambiguously', 'confirm', 'that', 'at', 'strong', 'confinements', 'the', 'timedependent', 'exact', 'exchange', 'excitation', 'energies', 'approach', 'the', 'singleparticle', 'kohnsham', 'ones', 'for', 'the', 'spinpolarized', 'case', 'while', 'the', 'same', 'but', 'less', 'pronounced', 'tendency', 'is', 'observed', 'for', 'spinneutral', 'q2deg']] | [-0.11356729517069224, 0.18266545431161263, -0.04854445279365019, 0.11378068275275235, 0.02170408569838641, -0.18166168562997626, 0.037852092782246334, 0.4006205989083029, -0.21198494238163926, -0.2608902922497605, -0.019992820173941273, -0.32757445321449097, -0.07124889493955053, 0.13436486560385674, 0.09234610992870382, 0.0029477997428192845, 0.011857285576143285, -0.018910484195177286, -0.09001036911965611, -0.20840986126392447, 0.27230442978687724, 0.043282347494068577, 0.29258139626087865, 0.13333201077590995, 0.06086329423453448, 0.03239948235294026, 0.08821595997004858, 0.007970197476733686, -0.13175720230664978, 0.04385147536753343, 0.24563683253133073, -0.11427363501817761, 0.24513680047689462, -0.44764989345633194, -0.20558222881430444, 0.032752112432752015, 0.18916554208669178, 0.14588282244139403, -0.024838858095155854, -0.25702677833856485, 0.04831201728776027, -0.1751182492304031, -0.18078585091499472, -0.09494988849597438, 0.03472338914695495, 0.009487368181273166, -0.24690213119435422, 0.13638418479734715, 0.043834711537028684, -0.006891096141016361, -0.08277580766490537, -0.11034439915334279, -0.04591369218816805, 0.06607022963218251, 0.03392483423450135, 0.035332560611730617, 0.09434875043302353, -0.09655393583410121, -0.04151205736089428, 0.35278056102435823, -0.06096110400691066, -0.14536057310266737, 0.2032822348300438, -0.24067829484735034, -0.11261088859821441, 0.19686168997618808, 0.062351806944275695, 0.10275183588196084, -0.12534695181925343, 0.10719616262885777, -0.04289850225575479, 0.14506835822468483, 0.08599624079037106, 0.050447260780822276, 0.20074784851694516, 0.089434587565813, 0.06589781824951851, 0.10071952943305731, -0.11475317517541489, -0.10215952391033324, -0.23265252227209648, -0.11013927747701945, -0.1978798198408254, 0.029875121281464707, -0.017592474198400456, -0.12704126816133107, 0.3817854717962514, 0.13054730132538475, 0.16605362212197539, 0.03261778148040527, 0.293386991412537, 0.15227197863398786, 0.07400200275357215, 0.09830432017729178, 0.2582407596450791, 0.14148063902668478, 0.08534990161926956, -0.28326092720391965, 0.02978821290340626, 0.015153541018799791] |
1,802.07005 | Signature of a highly spin polarized resonance state at
Co2MnSi(001)/Ag(001) interfaces | We investigated interfaces of halfmetallic Co2MnSi(100) Heusler thin films
with Ag(100), Cr(100), Cu and Al layers relevant for spin valves by high energy
x-ray photoemission spectroscopy (HAXPES). Experiments on Co2MnSi samples with
an Ag(100) interface showed a characteristic spectral shoulder feature close to
the Fermi edge, which is strongly diminished or suppressed at Co2MnSi (100)
interfaces with the other metallic layers. This feature is found to be directly
related to the Co2MnSi(100) layer, as reflected by control experiments with
reference non-magnetic films, i.e. without Heusler layer. By comparison with
HAXPES calculations, the shoulder feature is identified as originating from an
interface state related to a highly spin polarized surface resonance of Co2MnSi
(100).
| cond-mat.mtrl-sci | we investigated interfaces of halfmetallic co2mnsi100 heusler thin films with ag100 cr100 cu and al layers relevant for spin valves by high energy xray photoemission spectroscopy haxpes experiments on co2mnsi samples with an ag100 interface showed a characteristic spectral shoulder feature close to the fermi edge which is strongly diminished or suppressed at co2mnsi 100 interfaces with the other metallic layers this feature is found to be directly related to the co2mnsi100 layer as reflected by control experiments with reference nonmagnetic films ie without heusler layer by comparison with haxpes calculations the shoulder feature is identified as originating from an interface state related to a highly spin polarized surface resonance of co2mnsi 100 | [['we', 'investigated', 'interfaces', 'of', 'halfmetallic', 'co2mnsi100', 'heusler', 'thin', 'films', 'with', 'ag100', 'cr100', 'cu', 'and', 'al', 'layers', 'relevant', 'for', 'spin', 'valves', 'by', 'high', 'energy', 'xray', 'photoemission', 'spectroscopy', 'haxpes', 'experiments', 'on', 'co2mnsi', 'samples', 'with', 'an', 'ag100', 'interface', 'showed', 'a', 'characteristic', 'spectral', 'shoulder', 'feature', 'close', 'to', 'the', 'fermi', 'edge', 'which', 'is', 'strongly', 'diminished', 'or', 'suppressed', 'at', 'co2mnsi', '100', 'interfaces', 'with', 'the', 'other', 'metallic', 'layers', 'this', 'feature', 'is', 'found', 'to', 'be', 'directly', 'related', 'to', 'the', 'co2mnsi100', 'layer', 'as', 'reflected', 'by', 'control', 'experiments', 'with', 'reference', 'nonmagnetic', 'films', 'ie', 'without', 'heusler', 'layer', 'by', 'comparison', 'with', 'haxpes', 'calculations', 'the', 'shoulder', 'feature', 'is', 'identified', 'as', 'originating', 'from', 'an', 'interface', 'state', 'related', 'to', 'a', 'highly', 'spin', 'polarized', 'surface', 'resonance', 'of', 'co2mnsi', '100']] | [-0.07769968956043678, 0.17473734132181562, 0.01426573229504616, -0.011785791353239412, -0.05272816522171654, -0.21817430390677015, 0.059592311549100226, 0.48023479202363106, -0.31195312878948506, -0.3295853532825796, 0.023526850900712555, -0.39447367427055724, -0.06656118714558293, 0.1855843682174704, 0.06216864386702322, 0.0348817808156647, 0.01653507656218218, -0.1238471031039288, -0.10463273742269459, -0.1585235151932076, 0.31997428138856776, 0.0916534860651674, 0.3285337606794201, 0.10865656347388201, 0.010208469191898726, 0.012505200879136933, 0.12569040437561593, 0.013682492439069651, -0.11545293141222958, 0.0667728190892376, 0.31864203975003746, -0.16722274323443084, 0.13557487271360255, -0.4805682705815083, -0.21253686863929033, -0.09400106744474865, 0.08905580859780977, 0.06890727666385439, -0.09212113604319581, -0.299168573249647, 0.11818785186603366, -0.10723540455884566, -0.09865177441887292, -0.06389423548327093, -0.050126074314383526, -0.026680539001452935, -0.2162321125906601, 0.06496773110588297, 0.05563762721015207, 0.107021302699325, -0.12097183120619905, -0.14788003864565066, -0.1645609583647456, -0.011223917059916337, 0.05282514040300157, 0.09782474601940651, 0.19813880527258984, -0.1057415990487373, -0.10923680051928386, 0.2962002753712503, -0.06217077462601343, -0.06280151998258329, 0.2262896332207934, -0.18294007869553752, 0.0012941397705747346, 0.19782111028741514, 0.08309799653943628, 0.13923775116148004, -0.12778661872393318, 0.03276570961575739, -0.016989732265106534, 0.2523698312662808, 0.056495295376017954, 0.031678058315135, 0.231352382194018, 0.20920413086111825, 0.004236545297317207, 0.15401401731183537, -0.19556568140147387, 0.0462289683070724, -0.14104902962987712, -0.1826835625854853, -0.24123195947114645, 0.033096086233854294, -0.03135629970750285, -0.20765768204208662, 0.37446854136734536, 0.07466748656484665, 0.22152800999798014, -0.09318753702661654, 0.22222906633812403, 0.07049687464729816, 0.11648330309045767, 0.02291876996085713, 0.23399842255249886, 0.14789294820470136, 0.13251968669659878, -0.23526490642897052, 0.16039104127308487, -0.04307228750050334] |
1,802.07006 | Tight neighborhoods of contact submanifolds | We prove that any small enough neighborhood of a closed contact submanifold
is always tight under a mild assumption on its normal bundle. The non-existence
of $C^0$--small positive loops of contactomorphisms in general overtwisted
manifolds is shown as a corollary.
| math.SG | we prove that any small enough neighborhood of a closed contact submanifold is always tight under a mild assumption on its normal bundle the nonexistence of c0small positive loops of contactomorphisms in general overtwisted manifolds is shown as a corollary | [['we', 'prove', 'that', 'any', 'small', 'enough', 'neighborhood', 'of', 'a', 'closed', 'contact', 'submanifold', 'is', 'always', 'tight', 'under', 'a', 'mild', 'assumption', 'on', 'its', 'normal', 'bundle', 'the', 'nonexistence', 'of', 'c0small', 'positive', 'loops', 'of', 'contactomorphisms', 'in', 'general', 'overtwisted', 'manifolds', 'is', 'shown', 'as', 'a', 'corollary']] | [-0.3112897628656356, 0.062014068872667846, -0.07820754717104136, 0.1347041157365311, -0.09108294032048433, -0.19850592939183115, 0.031108849926386028, 0.36591461654752494, -0.22718790741637349, -0.17589842448942364, 0.10497580829251092, -0.22107253689318895, -0.22121348598739132, 0.19237479334697127, -0.1670263768872246, -0.029918764533067587, 0.1592180187581107, 0.17170565744745545, -0.11011936857539695, -0.23997863619879353, 0.4416483137261821, -0.05797140883514658, 0.2049953669833485, 0.1614265759169939, 0.1734920899674762, -0.05795778316678479, 0.10644249857869, 0.083552945239353, -0.17653366085814923, 0.026933954353444277, 0.19057655609212815, 0.05636160481371917, 0.23172610020264983, -0.3994361707009375, -0.16253140773042105, 0.21099101642612367, 0.12327328583342023, -0.00039677714230492713, -0.036209126008907334, -0.2557658742647618, 0.15733421084005386, -0.052142684906721117, -0.230911204428412, -0.08139519526594086, 0.06778174492064863, -0.008994561666622759, -0.24959854817716404, -0.010784491337835789, 0.20733803985640406, 0.08685916273389012, -0.09163568702351768, -0.03651233934506308, -0.08744109654799104, 0.08438395842676982, 0.05302363316295668, 0.07655641210440081, 0.133796714667551, -0.010140892351046205, -0.015217180084437131, 0.32230939380824564, -0.1421654227655381, -0.31312451949343084, 0.16236985828727485, -0.1603199686156586, -0.19000452854670585, 0.17975409813225268, 0.08477536414284259, 0.1800431247567758, -0.08697669059038163, 0.1959176678210497, -0.1960861770901829, 0.09851214252412319, 0.11905541223241016, -0.05826968314795522, 0.1298696187674068, 0.12499180723680184, 0.22475508044008166, 0.12378538087941707, 0.009323460777522996, -0.05344426910160109, -0.4193601243197918, -0.2104613186675124, -0.11940635449718684, 0.25132359233684837, -0.13432140906807036, -0.2580642998473195, 0.281434362847358, -0.05470070394221693, 0.2283165474422276, 0.17077579908072948, 0.2542468664178159, 0.015974332459154538, 0.05922047198982909, 0.12813387499190868, 0.18150771097280086, 0.21809890172444285, -0.04130071700783446, -0.07953249572310597, 0.08201011467026546, 0.0839655672898516] |
1,802.07007 | Traffic Graph Convolutional Recurrent Neural Network: A Deep Learning
Framework for Network-Scale Traffic Learning and Forecasting | Traffic forecasting is a particularly challenging application of
spatiotemporal forecasting, due to the time-varying traffic patterns and the
complicated spatial dependencies on road networks. To address this challenge,
we learn the traffic network as a graph and propose a novel deep learning
framework, Traffic Graph Convolutional Long Short-Term Memory Neural Network
(TGC-LSTM), to learn the interactions between roadways in the traffic network
and forecast the network-wide traffic state. We define the traffic graph
convolution based on the physical network topology. The relationship between
the proposed traffic graph convolution and the spectral graph convolution is
also discussed. An L1-norm on graph convolution weights and an L2-norm on graph
convolution features are added to the model's loss function to enhance the
interpretability of the proposed model. Experimental results show that the
proposed model outperforms baseline methods on two real-world traffic state
datasets. The visualization of the graph convolution weights indicates that the
proposed framework can recognize the most influential road segments in
real-world traffic networks.
| cs.LG stat.ML | traffic forecasting is a particularly challenging application of spatiotemporal forecasting due to the timevarying traffic patterns and the complicated spatial dependencies on road networks to address this challenge we learn the traffic network as a graph and propose a novel deep learning framework traffic graph convolutional long shortterm memory neural network tgclstm to learn the interactions between roadways in the traffic network and forecast the networkwide traffic state we define the traffic graph convolution based on the physical network topology the relationship between the proposed traffic graph convolution and the spectral graph convolution is also discussed an l1norm on graph convolution weights and an l2norm on graph convolution features are added to the models loss function to enhance the interpretability of the proposed model experimental results show that the proposed model outperforms baseline methods on two realworld traffic state datasets the visualization of the graph convolution weights indicates that the proposed framework can recognize the most influential road segments in realworld traffic networks | [['traffic', 'forecasting', 'is', 'a', 'particularly', 'challenging', 'application', 'of', 'spatiotemporal', 'forecasting', 'due', 'to', 'the', 'timevarying', 'traffic', 'patterns', 'and', 'the', 'complicated', 'spatial', 'dependencies', 'on', 'road', 'networks', 'to', 'address', 'this', 'challenge', 'we', 'learn', 'the', 'traffic', 'network', 'as', 'a', 'graph', 'and', 'propose', 'a', 'novel', 'deep', 'learning', 'framework', 'traffic', 'graph', 'convolutional', 'long', 'shortterm', 'memory', 'neural', 'network', 'tgclstm', 'to', 'learn', 'the', 'interactions', 'between', 'roadways', 'in', 'the', 'traffic', 'network', 'and', 'forecast', 'the', 'networkwide', 'traffic', 'state', 'we', 'define', 'the', 'traffic', 'graph', 'convolution', 'based', 'on', 'the', 'physical', 'network', 'topology', 'the', 'relationship', 'between', 'the', 'proposed', 'traffic', 'graph', 'convolution', 'and', 'the', 'spectral', 'graph', 'convolution', 'is', 'also', 'discussed', 'an', 'l1norm', 'on', 'graph', 'convolution', 'weights', 'and', 'an', 'l2norm', 'on', 'graph', 'convolution', 'features', 'are', 'added', 'to', 'the', 'models', 'loss', 'function', 'to', 'enhance', 'the', 'interpretability', 'of', 'the', 'proposed', 'model', 'experimental', 'results', 'show', 'that', 'the', 'proposed', 'model', 'outperforms', 'baseline', 'methods', 'on', 'two', 'realworld', 'traffic', 'state', 'datasets', 'the', 'visualization', 'of', 'the', 'graph', 'convolution', 'weights', 'indicates', 'that', 'the', 'proposed', 'framework', 'can', 'recognize', 'the', 'most', 'influential', 'road', 'segments', 'in', 'realworld', 'traffic', 'networks']] | [-0.11683792801125457, -0.013655215360757459, -0.06625906417302983, 0.1083492969441584, -0.12815994525293786, -0.15461248683708687, 0.0422481531061715, 0.4622977693553692, -0.3220775008846914, -0.28943792216617753, 0.0718080907482309, -0.2843925604728959, -0.2703608336777967, 0.14236734305611914, -0.17197396404420337, 0.1386080062427173, 0.17257980035939885, 0.06453147053684073, -0.0032412448098860036, -0.253014539859982, 0.3190976927217878, 0.02058803215518703, 0.39971452582351585, 0.09594671786935241, 0.12756002681109951, -0.029804438648653436, -0.0628806159028174, -0.026731853376223164, -0.024840886368761902, 0.1647632787188078, 0.29981826833423886, 0.18133257429279317, 0.29295613640562895, -0.48932112718322945, -0.32324275165296124, 0.13776214646152507, 0.0878009877331486, 0.016929117584098735, 0.061784478826419575, -0.3733078003573565, 0.08694727331928817, -0.20466011180254964, 0.042436544932884936, -0.11810895084564424, -0.016362853995006945, 0.025975050237949614, -0.29838609197004523, -0.01305163837627962, 0.03005492988180507, 0.026833227220462795, -0.003203228068606997, -0.06570703182139515, -0.025649871310667583, 0.16971340642115215, 0.034215465577514724, 0.022419198099983696, 0.12948642095642876, -0.18964705895695383, -0.1537739347356061, 0.3425315047418814, -0.04001448099374955, -0.19286200019565444, 0.1504681682354989, 0.014844155582932778, -0.1543581648586019, 0.05950118570852979, 0.28877061623275097, 0.043357923463055933, -0.17023455874166554, -0.04279646507276073, -0.06885776951633117, 0.17105294023582965, 0.035631488563124966, -0.020249643173344708, 0.11867133601148969, 0.31748584293139476, 0.13240095139423638, 0.1391796481832977, -0.1673820830901717, -0.09738132427733989, -0.19485838534770372, -0.04622477321327882, -0.23461189007754496, -0.04684778445480782, -0.2067908537569621, -0.14954068951749236, 0.5026524137751556, 0.21770437116688693, 0.2079291388530422, 0.1516557516541654, 0.343473366098076, 0.05335117639674817, 0.09179599406082689, 0.16569102537116887, 0.10365536342156523, 0.07264393297409248, 0.2099103797651126, -0.20423163596201505, 0.1358568445523557, 0.0872959233087453] |
1,802.07008 | Segmentation hi\'erarchique faiblement supervis\'ee | Image segmentation is the process of partitioning an image into a set of
meaningful regions according to some criteria. Hierarchical segmentation has
emerged as a major trend in this regard as it favors the emergence of important
regions at different scales. On the other hand, many methods allow us to have
prior information on the position of structures of interest in the images. In
this paper, we present a versatile hierarchical segmentation method that takes
into account any prior spatial information and outputs a hierarchical
segmentation that emphasizes the contours or regions of interest while
preserving the important structures in the image. An application of this method
to the weakly-supervised segmentation problem is presented.
| stat.ML cs.CV cs.LG cs.NE | image segmentation is the process of partitioning an image into a set of meaningful regions according to some criteria hierarchical segmentation has emerged as a major trend in this regard as it favors the emergence of important regions at different scales on the other hand many methods allow us to have prior information on the position of structures of interest in the images in this paper we present a versatile hierarchical segmentation method that takes into account any prior spatial information and outputs a hierarchical segmentation that emphasizes the contours or regions of interest while preserving the important structures in the image an application of this method to the weaklysupervised segmentation problem is presented | [['image', 'segmentation', 'is', 'the', 'process', 'of', 'partitioning', 'an', 'image', 'into', 'a', 'set', 'of', 'meaningful', 'regions', 'according', 'to', 'some', 'criteria', 'hierarchical', 'segmentation', 'has', 'emerged', 'as', 'a', 'major', 'trend', 'in', 'this', 'regard', 'as', 'it', 'favors', 'the', 'emergence', 'of', 'important', 'regions', 'at', 'different', 'scales', 'on', 'the', 'other', 'hand', 'many', 'methods', 'allow', 'us', 'to', 'have', 'prior', 'information', 'on', 'the', 'position', 'of', 'structures', 'of', 'interest', 'in', 'the', 'images', 'in', 'this', 'paper', 'we', 'present', 'a', 'versatile', 'hierarchical', 'segmentation', 'method', 'that', 'takes', 'into', 'account', 'any', 'prior', 'spatial', 'information', 'and', 'outputs', 'a', 'hierarchical', 'segmentation', 'that', 'emphasizes', 'the', 'contours', 'or', 'regions', 'of', 'interest', 'while', 'preserving', 'the', 'important', 'structures', 'in', 'the', 'image', 'an', 'application', 'of', 'this', 'method', 'to', 'the', 'weaklysupervised', 'segmentation', 'problem', 'is', 'presented']] | [-0.05139124855039674, -0.006203875033207352, -0.11980807809200007, 0.06160368517676193, -0.08341889919941886, -0.08315644000264767, 0.005457749311493612, 0.42465904038072677, -0.25359548219855416, -0.3262606984200446, 0.10324324309017117, -0.24077582117496876, -0.14817838768858724, 0.166999908537898, -0.11815335925897225, 0.033440694444212375, 0.09345151368005757, 0.05657185323992994, -0.03028304332748807, -0.20951710790068956, 0.32586461792520266, 0.05242722580340086, 0.3387746753481527, 0.03780024054280499, 0.1367562411745128, -0.00985058699734509, -0.06974338122496479, 0.011458640631628856, -0.10243526544167125, 0.17643573763678178, 0.28222950005479025, 0.17943366241065392, 0.3384852294703913, -0.4137870375916623, -0.2580333230118349, 0.08243089262396097, 0.19522224482671732, 0.10825273480160129, -0.07012018570962378, -0.31864938237132473, 0.06356275907162119, -0.11522747635874048, 0.0025414742259798864, -0.08374722039719161, 0.00990054854641162, -0.06837915042016998, -0.2700551002972612, 0.07325280436494372, 0.11638314876370459, 0.008325804866392884, -0.10353181729697737, -0.09887851886818871, 0.00955702362912952, 0.21822388462207623, 0.01909449606242369, 0.05496890750803511, 0.12592435779311417, -0.18989893899650492, -0.10582782444952611, 0.38665510208362286, 0.02572136788359402, -0.22630187387071682, 0.2020849467238836, -0.08973738402454999, -0.21635921297823651, 0.14287040244150712, 0.19397118940067135, 0.1182558924008749, -0.12866060405544805, 0.018016023850864975, -0.040188251675939875, 0.17389346477820686, 0.046292330555029605, 0.01450521620235553, 0.24237469442621723, 0.25095826090035733, 0.09788248563091385, 0.16468671555763617, -0.16817865836466744, -0.06679030416100368, -0.23512446962852487, -0.15700188836720036, -0.14964328138484506, -0.07140288117398884, -0.12721917158584498, -0.1958031752105933, 0.43316787894684494, 0.21821082853957227, 0.27151258332295375, -0.023192248045744605, 0.34495107816499576, 0.03749715504269708, 0.1330510341802501, 0.0070172486124200776, 0.1604484971298677, 0.05781601004612943, 0.09462780798499457, -0.12376546232323897, 0.11194537581647174, 0.06448356208407827] |
1,802.07009 | Analytical Validation Formulas for Best Estimate Calculation in
Traditional Life Insurance | Within the context of traditional life insurance, a model-independent
relationship about how the market value of assets is attributed to the best
estimate, the value of in-force business and tax is established. This
relationship holds true for any portfolio under run-off assumptions and can be
used for the validation of models set up for Solvency~II best estimate
calculation. Furthermore, we derive a lower bound for the value of future
discretionary benefits. This lower bound formula is applied to publicly
available insurance data to show how it can be used for practical validation
purposes.
| q-fin.RM | within the context of traditional life insurance a modelindependent relationship about how the market value of assets is attributed to the best estimate the value of inforce business and tax is established this relationship holds true for any portfolio under runoff assumptions and can be used for the validation of models set up for solvencyii best estimate calculation furthermore we derive a lower bound for the value of future discretionary benefits this lower bound formula is applied to publicly available insurance data to show how it can be used for practical validation purposes | [['within', 'the', 'context', 'of', 'traditional', 'life', 'insurance', 'a', 'modelindependent', 'relationship', 'about', 'how', 'the', 'market', 'value', 'of', 'assets', 'is', 'attributed', 'to', 'the', 'best', 'estimate', 'the', 'value', 'of', 'inforce', 'business', 'and', 'tax', 'is', 'established', 'this', 'relationship', 'holds', 'true', 'for', 'any', 'portfolio', 'under', 'runoff', 'assumptions', 'and', 'can', 'be', 'used', 'for', 'the', 'validation', 'of', 'models', 'set', 'up', 'for', 'solvencyii', 'best', 'estimate', 'calculation', 'furthermore', 'we', 'derive', 'a', 'lower', 'bound', 'for', 'the', 'value', 'of', 'future', 'discretionary', 'benefits', 'this', 'lower', 'bound', 'formula', 'is', 'applied', 'to', 'publicly', 'available', 'insurance', 'data', 'to', 'show', 'how', 'it', 'can', 'be', 'used', 'for', 'practical', 'validation', 'purposes']] | [-0.01538755151105451, 0.01739028313678208, -0.10751315549906384, 0.1534867600274303, -0.12275810930161522, -0.13651588960335806, 0.1408285971290872, 0.3582867329919731, -0.22886967445866993, -0.3284624665412683, 0.19292025081813335, -0.24419018487026403, -0.09389571433728254, 0.26464920833062094, -0.11654257272104067, 0.05177172162866855, 0.06544658354647294, 0.027678713182007875, 0.006107240301239622, -0.3039445258359742, 0.26287478672156295, 0.07604979946799986, 0.32811585651035163, 0.11837507641278106, 0.07076337815973661, -0.006799887451292067, 0.012272625061386561, -0.03457755254642977, -0.18212487023537416, 0.17419159435603132, 0.3200799692747171, 0.21196496672928333, 0.3154060037315383, -0.3875962055114272, -0.15252590322723755, 0.151944438353754, 0.08445954846811819, 0.07337121637845105, 0.014844056121636551, -0.22291619160754994, 0.08174684766749084, -0.21775843460716635, -0.1465800234863719, -0.09928935313863414, 0.043282320543837086, -0.018969307658723095, -0.3520357322643746, 0.06973072375774711, -0.0022934037772426893, 0.03364515028238951, -0.08906468657960931, -0.1617449213965581, -0.013333908371770611, 0.18554773494846874, 0.10492892811269305, -0.012187618424522352, 0.148182836934351, -0.10629128806477228, -0.14080977517661158, 0.3882207163804016, -0.11690804235391565, -0.1709035373968328, 0.09508444886183837, -0.08379041860750007, -0.11057361051476058, 0.05996230537337916, 0.2073946633238018, 0.06345033506443212, -0.22116535554696284, 0.04866624670486979, -0.049565787601110696, 0.18059461393935994, 0.06674567653393311, -0.024294213489066442, 0.15916548552603083, 0.19466530351520894, 0.1278126834185569, 0.13127667383945824, -0.050587758872207705, -0.10151356330735016, -0.3072730562762245, -0.16427530325081835, -0.19295800331939053, 0.04695492812974767, -0.12567370779432388, -0.11178591337750901, 0.3265663523349788, 0.2379845987984931, 0.11357625110259095, 0.10375111147756227, 0.2811413313988801, 0.15622582202562985, 0.03918806533073331, 0.09123712951563052, 0.24331885506143117, 0.03711540362500882, 0.07426199443883948, -0.12794109298796444, 0.1977410671137437, -0.006244982664401715] |
1,802.0701 | Capacity-achieving Guessing Random Additive Noise Decoding (GRAND) | We introduce a new algorithm for realizing Maximum Likelihood (ML) decoding
in discrete channels with or without memory. In it, the receiver rank orders
noise sequences from most likely to least likely. Subtracting noise from the
received signal in that order, the first instance that results in a member of
the code-book is the ML decoding. We name this algorithm GRAND for Guessing
Random Additive Noise Decoding.
We establish that GRAND is capacity-achieving when used with random
code-books. For rates below capacity we identify error exponents, and for rates
beyond capacity we identify success exponents. We determine the scheme's
complexity in terms of the number of computations the receiver performs. For
rates beyond capacity, this reveals thresholds for the number of guesses by
which if a member of the code-book is identified it is likely to be the
transmitted code-word.
We introduce an approximate ML decoding scheme where the receiver abandons
the search after a fixed number of queries, an approach we dub GRANDAB, for
GRAND with ABandonment. While not an ML decoder, we establish that the
algorithm GRANDAB is also capacity-achieving for an appropriate choice of
abandonment threshold, and characterize its complexity, error and success
exponents. Worked examples are presented for Markovian noise that indicate
these decoding schemes substantially out-perform the brute force decoding
approach.
| cs.IT math.IT | we introduce a new algorithm for realizing maximum likelihood ml decoding in discrete channels with or without memory in it the receiver rank orders noise sequences from most likely to least likely subtracting noise from the received signal in that order the first instance that results in a member of the codebook is the ml decoding we name this algorithm grand for guessing random additive noise decoding we establish that grand is capacityachieving when used with random codebooks for rates below capacity we identify error exponents and for rates beyond capacity we identify success exponents we determine the schemes complexity in terms of the number of computations the receiver performs for rates beyond capacity this reveals thresholds for the number of guesses by which if a member of the codebook is identified it is likely to be the transmitted codeword we introduce an approximate ml decoding scheme where the receiver abandons the search after a fixed number of queries an approach we dub grandab for grand with abandonment while not an ml decoder we establish that the algorithm grandab is also capacityachieving for an appropriate choice of abandonment threshold and characterize its complexity error and success exponents worked examples are presented for markovian noise that indicate these decoding schemes substantially outperform the brute force decoding approach | [['we', 'introduce', 'a', 'new', 'algorithm', 'for', 'realizing', 'maximum', 'likelihood', 'ml', 'decoding', 'in', 'discrete', 'channels', 'with', 'or', 'without', 'memory', 'in', 'it', 'the', 'receiver', 'rank', 'orders', 'noise', 'sequences', 'from', 'most', 'likely', 'to', 'least', 'likely', 'subtracting', 'noise', 'from', 'the', 'received', 'signal', 'in', 'that', 'order', 'the', 'first', 'instance', 'that', 'results', 'in', 'a', 'member', 'of', 'the', 'codebook', 'is', 'the', 'ml', 'decoding', 'we', 'name', 'this', 'algorithm', 'grand', 'for', 'guessing', 'random', 'additive', 'noise', 'decoding', 'we', 'establish', 'that', 'grand', 'is', 'capacityachieving', 'when', 'used', 'with', 'random', 'codebooks', 'for', 'rates', 'below', 'capacity', 'we', 'identify', 'error', 'exponents', 'and', 'for', 'rates', 'beyond', 'capacity', 'we', 'identify', 'success', 'exponents', 'we', 'determine', 'the', 'schemes', 'complexity', 'in', 'terms', 'of', 'the', 'number', 'of', 'computations', 'the', 'receiver', 'performs', 'for', 'rates', 'beyond', 'capacity', 'this', 'reveals', 'thresholds', 'for', 'the', 'number', 'of', 'guesses', 'by', 'which', 'if', 'a', 'member', 'of', 'the', 'codebook', 'is', 'identified', 'it', 'is', 'likely', 'to', 'be', 'the', 'transmitted', 'codeword', 'we', 'introduce', 'an', 'approximate', 'ml', 'decoding', 'scheme', 'where', 'the', 'receiver', 'abandons', 'the', 'search', 'after', 'a', 'fixed', 'number', 'of', 'queries', 'an', 'approach', 'we', 'dub', 'grandab', 'for', 'grand', 'with', 'abandonment', 'while', 'not', 'an', 'ml', 'decoder', 'we', 'establish', 'that', 'the', 'algorithm', 'grandab', 'is', 'also', 'capacityachieving', 'for', 'an', 'appropriate', 'choice', 'of', 'abandonment', 'threshold', 'and', 'characterize', 'its', 'complexity', 'error', 'and', 'success', 'exponents', 'worked', 'examples', 'are', 'presented', 'for', 'markovian', 'noise', 'that', 'indicate', 'these', 'decoding', 'schemes', 'substantially', 'outperform', 'the', 'brute', 'force', 'decoding', 'approach']] | [-0.1495096503101968, 0.05014542665220492, -0.06894416703242008, 0.10072810452041939, -0.018984221415942377, -0.24955220414743384, 0.15061383870869297, 0.3995404028389211, -0.26515181255842357, -0.2615250296647025, 0.10390201641549139, -0.2241675636718032, -0.1945018131268498, 0.18801102815761675, -0.12502489527513352, 0.07766369952429651, 0.019339507835194746, 0.08058927448414197, -0.08317398786366369, -0.3388726975557734, 0.2746935046721842, 0.13223358463478563, 0.27310515093839094, -0.03846887173457506, 0.09549976107512087, 0.003510767550460089, 0.01102828837617814, -0.047026490124604, -0.13312153915729005, 0.05091484218278778, 0.281852576899055, 0.2079060102103574, 0.2825593090241897, -0.3305137368162798, -0.19634962357824373, 0.11970475874623615, 0.13567798927798433, 0.15565732632552612, -0.05694201359934409, -0.24038775968169532, 0.16440042774475866, -0.16818523184596518, -0.031714187939346675, -0.055138373166479376, -0.04298657692139794, 0.023706209697601795, -0.3360424375267064, 0.043263623383082234, 0.05479330416533783, 0.03827694048408732, -0.01031548484113224, -0.16502135907186666, 0.07328648296202246, 0.130932593567076, 0.054256579572644695, 0.021112716479866688, 0.10265986219692592, -0.11887891752808301, -0.14439213760066602, 0.3336408342861475, -0.02376648405007583, -0.20339067917856796, 0.1287809839411247, -0.0857099738346291, -0.13845153379898134, 0.20989966516548367, 0.20753767101581547, 0.06665424041019723, -0.13571931777020674, 0.037203112500991724, 0.007342536918760199, 0.21648059633046945, 0.06744199859578963, 0.07988700209289928, 0.13368136887482115, 0.14345779926755475, 0.10247852071841186, 0.16405951694822565, -0.12617612567732425, -0.09845150468836182, -0.2806904920742403, -0.14735662065354985, -0.23680234605350714, 0.003178323084386784, -0.1125590018403774, -0.128896039653848, 0.3463347649336084, 0.18265087770898697, 0.16193900097196348, 0.18136532353204632, 0.3160280774229981, 0.12066803445221386, 0.0738518154808912, 0.16985592131000274, 0.19907028909998936, 0.11022280134961322, 0.01302535844820978, -0.1900471167107957, 0.10340997587593499, 0.08398703082516859] |
1,802.07011 | Photopolarimetrical Study of Blazar-type AGN OJ287 in 2012-2015 with the
2m RCC Telescope at NAO Rozhen | We present the results of a photopolarimetric study of the blazar OJ287 in
the period November 2012-January 2015. Observations were conducted using the
Focal Reductor FoReRo-2 of the 2-meter RCC telescope of the National
Astronomical Observatory (NAO) Rozhen. The observed change of the position
angle (P.A.) corresponds to mean rotation of the plane of polarization of 6.23
deg/day, in good agreement with previous measurements. An indication of a
correlation between the change of brightness in R-band and the change in the
degree of polarization is also observed.
| astro-ph.GA | we present the results of a photopolarimetric study of the blazar oj287 in the period november 2012january 2015 observations were conducted using the focal reductor forero2 of the 2meter rcc telescope of the national astronomical observatory nao rozhen the observed change of the position angle pa corresponds to mean rotation of the plane of polarization of 623 degday in good agreement with previous measurements an indication of a correlation between the change of brightness in rband and the change in the degree of polarization is also observed | [['we', 'present', 'the', 'results', 'of', 'a', 'photopolarimetric', 'study', 'of', 'the', 'blazar', 'oj287', 'in', 'the', 'period', 'november', '2012january', '2015', 'observations', 'were', 'conducted', 'using', 'the', 'focal', 'reductor', 'forero2', 'of', 'the', '2meter', 'rcc', 'telescope', 'of', 'the', 'national', 'astronomical', 'observatory', 'nao', 'rozhen', 'the', 'observed', 'change', 'of', 'the', 'position', 'angle', 'pa', 'corresponds', 'to', 'mean', 'rotation', 'of', 'the', 'plane', 'of', 'polarization', 'of', '623', 'degday', 'in', 'good', 'agreement', 'with', 'previous', 'measurements', 'an', 'indication', 'of', 'a', 'correlation', 'between', 'the', 'change', 'of', 'brightness', 'in', 'rband', 'and', 'the', 'change', 'in', 'the', 'degree', 'of', 'polarization', 'is', 'also', 'observed']] | [-0.1314877379576073, 0.07369773443942369, -0.11269032687825316, 0.01942585545783753, -0.04007937473190181, -0.026877401243237887, 0.026355290968957192, 0.40960155385820307, -0.1428362642579219, -0.3879549841451294, 0.06887991474393536, -0.31687495281152867, -0.08924334177692585, 0.2203036322587115, -0.05409306577023338, 0.008331762648680631, 0.08720820526428083, -0.016026069497799174, -0.07330520242890891, -0.21248926695655374, 0.23005338803974582, 0.1511653732508421, 0.26081152722677764, 0.0022250858724445982, 0.12340332677259165, 0.018131220609168795, -0.09442277424968779, 0.01058621492017718, -0.10107253300683464, 0.0789229016751051, 0.23732562120729947, 0.10290900082875262, 0.15562716754194458, -0.32795424989479427, -0.12314121902865523, 0.048815864460159314, 0.028236796926049624, 0.012491681393893325, 0.012046349949806053, -0.29130694868371765, -0.023412502124248183, -0.11263671140066649, -0.22311827492188005, 0.1077694455271258, 0.05937030581647859, 0.04215523128616897, -0.21711226627230645, 0.10049048849237699, -0.016710060040178873, 0.20774736458106952, -0.1207026131779832, -0.10431257390471942, -0.07710625472999014, 0.15007763913668254, 0.03939774964169106, 0.11934561023132546, 0.04735047927345423, -0.07899028603809283, -0.11690992694279617, 0.3599664621493396, -0.11135185850263737, 0.014356850742307655, 0.1048383425702067, -0.2793262071578818, -0.16389950111179669, 0.1271771126837634, 0.21366893306155416, 0.10656200480811737, -0.10661844679099672, 0.03434943516725017, -0.09018085492665277, 0.23983956251074287, 0.09953754350323887, 0.008032745368665713, 0.2355056267012568, 0.13176570829031442, 0.0051871680736760885, 0.10592124038375914, -0.3093172810314333, -0.046708729381070416, -0.2930145380032413, -0.12103622302632122, -0.13111156547880348, 0.02568009892369018, -0.09267765627061154, -0.09322151611833011, 0.4326118015629404, 0.10523672765120864, 0.19127260477227323, -0.0065973197383915674, 0.2345878763781751, 0.06906904119806474, 0.04936894092328764, 0.04120392665499821, 0.40259085713940507, 0.13629265221328857, 0.17165915269185514, -0.2812911271994166, 0.09501534062163795, -0.03586464487016201] |
1,802.07012 | Producing long-lived $2^3\text{S}$ Ps via $3^3\text{P}$ laser excitation
in magnetic and electric fields | Producing positronium (Ps) in the metastable $2^3\text{S}$ state is of
interest for various applications in fundamental physics. We report here about
an experiment in which Ps atoms are produced in this long-lived state by
spontaneous radiative decay of Ps excited to the $3^3\text{P}$ level manifold.
The Ps cloud excitation is obtained with a UV laser pulse in an experimental
vacuum chamber in presence of guiding magnetic field of 25 mT and an average
electric field of 300 V/cm. The indication of the $2^3\text{S}$ state
production is obtained from a novel analysis technique of single-shot
positronium annihilation lifetime spectra. Its production efficiency relative
to the total amount of formed Ps is evaluated by fitting a simple rate
equations model to the experimental data and found to be $ (2.1 \pm 1.3) \, \%
$.
| physics.atom-ph | producing positronium ps in the metastable 23texts state is of interest for various applications in fundamental physics we report here about an experiment in which ps atoms are produced in this longlived state by spontaneous radiative decay of ps excited to the 33textp level manifold the ps cloud excitation is obtained with a uv laser pulse in an experimental vacuum chamber in presence of guiding magnetic field of 25 mt and an average electric field of 300 vcm the indication of the 23texts state production is obtained from a novel analysis technique of singleshot positronium annihilation lifetime spectra its production efficiency relative to the total amount of formed ps is evaluated by fitting a simple rate equations model to the experimental data and found to be 21 pm 13 | [['producing', 'positronium', 'ps', 'in', 'the', 'metastable', '23texts', 'state', 'is', 'of', 'interest', 'for', 'various', 'applications', 'in', 'fundamental', 'physics', 'we', 'report', 'here', 'about', 'an', 'experiment', 'in', 'which', 'ps', 'atoms', 'are', 'produced', 'in', 'this', 'longlived', 'state', 'by', 'spontaneous', 'radiative', 'decay', 'of', 'ps', 'excited', 'to', 'the', '33textp', 'level', 'manifold', 'the', 'ps', 'cloud', 'excitation', 'is', 'obtained', 'with', 'a', 'uv', 'laser', 'pulse', 'in', 'an', 'experimental', 'vacuum', 'chamber', 'in', 'presence', 'of', 'guiding', 'magnetic', 'field', 'of', '25', 'mt', 'and', 'an', 'average', 'electric', 'field', 'of', '300', 'vcm', 'the', 'indication', 'of', 'the', '23texts', 'state', 'production', 'is', 'obtained', 'from', 'a', 'novel', 'analysis', 'technique', 'of', 'singleshot', 'positronium', 'annihilation', 'lifetime', 'spectra', 'its', 'production', 'efficiency', 'relative', 'to', 'the', 'total', 'amount', 'of', 'formed', 'ps', 'is', 'evaluated', 'by', 'fitting', 'a', 'simple', 'rate', 'equations', 'model', 'to', 'the', 'experimental', 'data', 'and', 'found', 'to', 'be', '21', 'pm', '13']] | [-0.09353894939912218, 0.19751558136063285, -0.053243864549412614, 0.01626840954838646, 0.03911174464202116, -0.08038319136193466, 0.03884659300277394, 0.38863516810335336, -0.23740783237135185, -0.3595221896788904, 0.03526964856843863, -0.2584893644495409, 0.030494000747918137, 0.1985647755227835, 0.03132909141288745, 0.042259502516124425, 0.06599266452544797, 0.04466149291496665, -0.021692215686752683, -0.1852244913193678, 0.2481301508415195, 0.10397435975305382, 0.29836508261209854, 0.099632852636869, 0.08505429447183223, -0.04399095403607048, 0.02505686780574569, -0.06446510355269151, -0.10076675130172617, 0.11759829220347225, 0.2091030167149646, 0.10545826640113123, 0.1901661267851494, -0.4188178951837241, -0.17545465268896862, 0.07394308741721842, 0.13395246637002048, 0.13630177565695098, -0.10325971213243311, -0.3165142548728793, 0.08662046596134407, -0.16267403982125134, -0.12336040379124738, -0.023567448802558438, 0.04755341871974191, -0.018761882199979728, -0.29386649057564757, 0.08596800857164438, -0.015419189290812013, 0.07689824640854365, -0.10645436282391615, -0.11540140188668692, -0.0036150199178207132, 0.04240957875588229, 0.04940913192325434, 0.06697963117293844, 0.19144475694361424, -0.15664095742746242, -0.14673528223139573, 0.3631466142094088, -0.1303767241936709, -0.08286451626687295, 0.11953766720132931, -0.15518787911250478, -0.05405870059390538, 0.24669954385091034, 0.1520686799444125, 0.14487555034695163, -0.15297819557045364, 0.020759025979454497, 0.027963346912569943, 0.24621879475261454, 0.07629611712348248, 0.0606323579836282, 0.1962474791484604, 0.2128121639335794, -0.0178467702556638, 0.1298501904719391, -0.1400799050849552, -0.09923004653925697, -0.3047329391101523, -0.1710907029586711, -0.15329549838936637, 0.11587406476102179, -0.014245530678881407, -0.063116736865292, 0.40679251350137213, 0.09571702869993354, 0.1906241460736575, -0.040739962155745914, 0.28237898650741766, 0.12956956663863764, 0.021486375819049067, 0.008339393721331679, 0.2962469935143692, 0.1712541410455569, 0.1147768642561185, -0.2688482182436726, 0.006057222059647005, -0.026038668735603256] |
1,802.07013 | Quantum Interference in Silicon 1D Quasi-Ballistic Junctionless Nanowire
Field Effect Transistors | We investigate the low temperature transport in 8 nm diameter Si junctionless
nanowire field effect transistors fabricated by top down techniques with a
wrap-around gate and two different activated doping densities. First we extract
the intrinsic gate capacitance of the device geometry from a device that shows
Coulomb blockade at 13 mK with over 500 Coulomb peaks across a gate voltage
range of 6 V indicating the formation of a single island in the entire nanowire
channel. In two other devices, doped Si:P $4\times10^{19}\,\text{cm}^{-3}$ and
$2\times10^{20}\,\text{cm}^{-3}$, we observe quantum interference and use the
extracted gate coupling to determine the dominant energy scale and the
corresponding mean-free paths. For the higher doped device the analysis yields
a mean free path of $4\pm2\,\text{nm}$, which is on the order of the average
dopant spacing and suggests scattering on unactivated or activated dopants. For
the device with an activated dopant density of $4\times10^{19}\,\text{cm}^{-3}$
the quantum interference effects suggest a mean free path of
$10\pm2\,\text{nm}$, which is comparable to the nanowire width, and thus
quasi-ballistic transport. A temperature dependent analysis of Universal
Conductance Fluctuations suggests a coherence length above the nanowire length
for temperatures below 1.9 K and decoherence from 1D electron-electron
interactions for higher temperatures. The mobility is limited by scattering on
impurities rather than the expected surface roughness scattering for nanowires
with diameters larger or comparable to the Fermi wavelength. Our measurements
therefore provide insight into the performance limitations from dominant
scattering and dephasing mechanisms in technologically relevant silicon device
geometries.
| cond-mat.mes-hall | we investigate the low temperature transport in 8 nm diameter si junctionless nanowire field effect transistors fabricated by top down techniques with a wraparound gate and two different activated doping densities first we extract the intrinsic gate capacitance of the device geometry from a device that shows coulomb blockade at 13 mk with over 500 coulomb peaks across a gate voltage range of 6 v indicating the formation of a single island in the entire nanowire channel in two other devices doped sip 4times1019textcm3 and 2times1020textcm3 we observe quantum interference and use the extracted gate coupling to determine the dominant energy scale and the corresponding meanfree paths for the higher doped device the analysis yields a mean free path of 4pm2textnm which is on the order of the average dopant spacing and suggests scattering on unactivated or activated dopants for the device with an activated dopant density of 4times1019textcm3 the quantum interference effects suggest a mean free path of 10pm2textnm which is comparable to the nanowire width and thus quasiballistic transport a temperature dependent analysis of universal conductance fluctuations suggests a coherence length above the nanowire length for temperatures below 19 k and decoherence from 1d electronelectron interactions for higher temperatures the mobility is limited by scattering on impurities rather than the expected surface roughness scattering for nanowires with diameters larger or comparable to the fermi wavelength our measurements therefore provide insight into the performance limitations from dominant scattering and dephasing mechanisms in technologically relevant silicon device geometries | [['we', 'investigate', 'the', 'low', 'temperature', 'transport', 'in', '8', 'nm', 'diameter', 'si', 'junctionless', 'nanowire', 'field', 'effect', 'transistors', 'fabricated', 'by', 'top', 'down', 'techniques', 'with', 'a', 'wraparound', 'gate', 'and', 'two', 'different', 'activated', 'doping', 'densities', 'first', 'we', 'extract', 'the', 'intrinsic', 'gate', 'capacitance', 'of', 'the', 'device', 'geometry', 'from', 'a', 'device', 'that', 'shows', 'coulomb', 'blockade', 'at', '13', 'mk', 'with', 'over', '500', 'coulomb', 'peaks', 'across', 'a', 'gate', 'voltage', 'range', 'of', '6', 'v', 'indicating', 'the', 'formation', 'of', 'a', 'single', 'island', 'in', 'the', 'entire', 'nanowire', 'channel', 'in', 'two', 'other', 'devices', 'doped', 'sip', '4times1019textcm3', 'and', '2times1020textcm3', 'we', 'observe', 'quantum', 'interference', 'and', 'use', 'the', 'extracted', 'gate', 'coupling', 'to', 'determine', 'the', 'dominant', 'energy', 'scale', 'and', 'the', 'corresponding', 'meanfree', 'paths', 'for', 'the', 'higher', 'doped', 'device', 'the', 'analysis', 'yields', 'a', 'mean', 'free', 'path', 'of', '4pm2textnm', 'which', 'is', 'on', 'the', 'order', 'of', 'the', 'average', 'dopant', 'spacing', 'and', 'suggests', 'scattering', 'on', 'unactivated', 'or', 'activated', 'dopants', 'for', 'the', 'device', 'with', 'an', 'activated', 'dopant', 'density', 'of', '4times1019textcm3', 'the', 'quantum', 'interference', 'effects', 'suggest', 'a', 'mean', 'free', 'path', 'of', '10pm2textnm', 'which', 'is', 'comparable', 'to', 'the', 'nanowire', 'width', 'and', 'thus', 'quasiballistic', 'transport', 'a', 'temperature', 'dependent', 'analysis', 'of', 'universal', 'conductance', 'fluctuations', 'suggests', 'a', 'coherence', 'length', 'above', 'the', 'nanowire', 'length', 'for', 'temperatures', 'below', '19', 'k', 'and', 'decoherence', 'from', '1d', 'electronelectron', 'interactions', 'for', 'higher', 'temperatures', 'the', 'mobility', 'is', 'limited', 'by', 'scattering', 'on', 'impurities', 'rather', 'than', 'the', 'expected', 'surface', 'roughness', 'scattering', 'for', 'nanowires', 'with', 'diameters', 'larger', 'or', 'comparable', 'to', 'the', 'fermi', 'wavelength', 'our', 'measurements', 'therefore', 'provide', 'insight', 'into', 'the', 'performance', 'limitations', 'from', 'dominant', 'scattering', 'and', 'dephasing', 'mechanisms', 'in', 'technologically', 'relevant', 'silicon', 'device', 'geometries']] | [-0.145597098519788, 0.21371788377860426, -0.029555159403679993, 0.02980717458357889, 0.03403537252385154, -0.21642075388790769, 0.09714479710036743, 0.4051682462095601, -0.24633602434271035, -0.3276687046003225, -0.019816440110930353, -0.3245677947653113, -0.06478016773514726, 0.23198005418894896, 0.017408547083628767, 0.005088459124018289, 0.0024992021992649317, -0.019938226119847968, -0.07773946890456089, -0.19082924768849902, 0.25049283359549607, 0.06198900698783803, 0.351671047041139, 0.1434268902684466, 0.06063373342497512, 0.023607375030310004, 0.07417210129208464, 0.02458296430013583, -0.15897264979783193, 0.05341953612239303, 0.2289397774001683, -0.11189668557947739, 0.19685656176841676, -0.4527348419459759, -0.21733217488844025, -0.03476623251675839, 0.14949322131188364, 0.13544445648337158, -0.033550913531406025, -0.2522083124061548, 0.06737740159896106, -0.1109924572443306, -0.07863630405084639, 0.037559400928453945, 0.02853977970573898, -0.013702057861558203, -0.22864110461280993, 0.07143195481192888, 0.03217678633231072, 0.06938301488182722, -0.037762473617910804, -0.14456130599951825, -0.03927753588430001, 0.081799244946621, -0.027179432109212923, -0.006707269530705035, 0.2613816301323044, -0.1026297672771477, -0.1008345103667428, 0.30693904450354875, -0.06361158368104174, -0.0924324235982365, 0.15191100220748802, -0.18457270441423534, 0.014582418925761257, 0.20719027249075456, 0.13080944504216122, 0.0880265132046914, -0.15576661194755156, 0.04773641209639781, 0.06271092664405374, 0.21204630274386932, 0.08866341872746317, 0.12527683656662703, 0.226712645551608, 0.2291390351575527, 0.0782824804535813, 0.11661486790554766, -0.17810003832844948, -0.03063678254043768, -0.26334027638824165, -0.15373289609067295, -0.19935717626950042, 0.12830125142574894, -0.11794788262532802, -0.17543667840001023, 0.39021951218788153, 0.180009980781824, 0.19044327142805537, 0.011999850453489839, 0.2637551355754397, 0.11732324721375978, 0.14122676634931086, 0.03848299632421905, 0.21015122392810803, 0.177145307487904, 0.09025981912241843, -0.31302617882318995, 0.05645602478822042, -0.04235366076435089] |
1,802.07014 | Electromechanical coupling of waves in nerve fibres | The propagation of an action potential (AP) in a nerve fibre is accompanied
by mechanical and thermal effects. In this paper an attempt is made to build up
a mathematical model which couples the AP with a possible pressure wave (PW) in
the axoplasm and waves in the nerve fibre wall (longitudinal - LW and
transverse - TW) made of a lipid bilayer (biomembrane). A system of
differential equations includes the governing equations of single waves with
coupling forces between them. The single equations are kept as simple as
possible in order to carry out the proof of concept. An assumption based on
earlier studies is made that the coupling forces depend on changes (the
gradient, time derivative) of the voltage. In addition it is assumed that the
transverse displacement of the biomembrane can be calculated from the gradient
of the LW in the biomembrane. The computational simulation is focused to
determining the influence of possible coupling forces on the emergence of
mechanical waves from the AP. As a result, an ensemble of waves (AP, PW, LW,
TW) emerges. The further experiments should verify assumptions about coupling
forces. In the Appendix, the numerical scheme used for simulations, is
presented.
| physics.bio-ph math.NA | the propagation of an action potential ap in a nerve fibre is accompanied by mechanical and thermal effects in this paper an attempt is made to build up a mathematical model which couples the ap with a possible pressure wave pw in the axoplasm and waves in the nerve fibre wall longitudinal lw and transverse tw made of a lipid bilayer biomembrane a system of differential equations includes the governing equations of single waves with coupling forces between them the single equations are kept as simple as possible in order to carry out the proof of concept an assumption based on earlier studies is made that the coupling forces depend on changes the gradient time derivative of the voltage in addition it is assumed that the transverse displacement of the biomembrane can be calculated from the gradient of the lw in the biomembrane the computational simulation is focused to determining the influence of possible coupling forces on the emergence of mechanical waves from the ap as a result an ensemble of waves ap pw lw tw emerges the further experiments should verify assumptions about coupling forces in the appendix the numerical scheme used for simulations is presented | [['the', 'propagation', 'of', 'an', 'action', 'potential', 'ap', 'in', 'a', 'nerve', 'fibre', 'is', 'accompanied', 'by', 'mechanical', 'and', 'thermal', 'effects', 'in', 'this', 'paper', 'an', 'attempt', 'is', 'made', 'to', 'build', 'up', 'a', 'mathematical', 'model', 'which', 'couples', 'the', 'ap', 'with', 'a', 'possible', 'pressure', 'wave', 'pw', 'in', 'the', 'axoplasm', 'and', 'waves', 'in', 'the', 'nerve', 'fibre', 'wall', 'longitudinal', 'lw', 'and', 'transverse', 'tw', 'made', 'of', 'a', 'lipid', 'bilayer', 'biomembrane', 'a', 'system', 'of', 'differential', 'equations', 'includes', 'the', 'governing', 'equations', 'of', 'single', 'waves', 'with', 'coupling', 'forces', 'between', 'them', 'the', 'single', 'equations', 'are', 'kept', 'as', 'simple', 'as', 'possible', 'in', 'order', 'to', 'carry', 'out', 'the', 'proof', 'of', 'concept', 'an', 'assumption', 'based', 'on', 'earlier', 'studies', 'is', 'made', 'that', 'the', 'coupling', 'forces', 'depend', 'on', 'changes', 'the', 'gradient', 'time', 'derivative', 'of', 'the', 'voltage', 'in', 'addition', 'it', 'is', 'assumed', 'that', 'the', 'transverse', 'displacement', 'of', 'the', 'biomembrane', 'can', 'be', 'calculated', 'from', 'the', 'gradient', 'of', 'the', 'lw', 'in', 'the', 'biomembrane', 'the', 'computational', 'simulation', 'is', 'focused', 'to', 'determining', 'the', 'influence', 'of', 'possible', 'coupling', 'forces', 'on', 'the', 'emergence', 'of', 'mechanical', 'waves', 'from', 'the', 'ap', 'as', 'a', 'result', 'an', 'ensemble', 'of', 'waves', 'ap', 'pw', 'lw', 'tw', 'emerges', 'the', 'further', 'experiments', 'should', 'verify', 'assumptions', 'about', 'coupling', 'forces', 'in', 'the', 'appendix', 'the', 'numerical', 'scheme', 'used', 'for', 'simulations', 'is', 'presented']] | [-0.1674075076228887, 0.13429575226521404, -0.0999750782065519, -0.0005369181904308309, -0.07370364189509605, -0.08938581982939528, 0.029302692382955724, 0.3481044655873766, -0.2687654318382519, -0.25872533781652524, 0.044368620898082925, -0.24825050408342086, -0.14226130705780637, 0.20284716887186816, -0.006766386973071219, 0.03530442586102461, 0.034379503069938776, 0.04321258151927386, -0.00773381767055814, -0.18002736141082598, 0.29438284189005376, 0.08459284688643923, 0.2745254797114031, 0.05940386001493422, 0.1165681151332816, -0.006517393005123068, -0.02697756834952208, 0.00728233494774585, -0.12859282654695045, 0.06621343581935038, 0.17540820604804808, 0.019388081245880744, 0.2616730597919695, -0.4703099979513188, -0.23314980717510608, 0.03871413174340606, 0.11433964043259999, 0.13143576904457668, -0.02645376002650027, -0.24415617016248103, 0.04789802218612454, -0.14441114885089587, -0.15210628485174726, -0.020267477881300455, 0.008074897083780033, 0.06196452325049239, -0.27568205556865344, 0.07616914628513233, 0.047563789454926994, 0.047429706641297954, -0.05884787330385014, -0.059585563320226895, -0.06630470800960465, 0.100848065129733, 0.07477920543376432, 0.0630518243397553, 0.1550352581384294, -0.14384640399768456, -0.09600735465206471, 0.4072162847266282, -0.09302030412449507, -0.2266662393219126, 0.17302321575831403, -0.10366046513465639, -0.0586086456559901, 0.13996733025207855, 0.15933254762046833, 0.10679326943939713, -0.14172226242806177, 0.053535625852968276, -0.000450915023421533, 0.18607466826321756, 0.09315542459279903, -0.02074996420527397, 0.18942752703646112, 0.177904729880298, 0.004474736103045797, 0.12669979798345152, -0.08574368896540184, -0.08625975838917908, -0.33142019475474577, -0.13778067929764765, -0.13927270906982084, 0.05184436623539792, -0.06314575626270498, -0.15338354459420073, 0.38481073931921705, 0.15705813217937248, 0.1367831642191082, 0.018351739864006903, 0.28337535074070513, 0.13091182360498868, 0.07452435678031843, 0.03172768626201349, 0.3185056199267658, 0.19639479888598363, 0.11270812616404619, -0.24964567971874388, 0.04263671391482848, 0.03326372734181167] |
1,802.07015 | Generalized nil-Coxeter algebras | Motivated by work of Coxeter (1957), we study a class of algebras associated
to Coxeter groups, which we term 'generalized nil-Coxeter algebras'. We
construct the first finite-dimensional examples other than usual nil-Coxeter
algebras; these form a $2$-parameter type $A$ family that we term $NC_A(n,d)$.
We explore the combinatorial properties of these algebras, including the
Coxeter word basis, length function, maximal words, and their connection to
Khovanov's categorification of the Weyl algebra.
Our broader motivation arises from complex reflection groups and the
Broue-Malle-Rouquier freeness conjecture (1998). With generic Hecke algebras
over real and complex groups in mind, we show that the 'first'
finite-dimensional examples $NC_A(n,d)$ are in fact the only ones, outside of
the usual nil-Coxeter algebras. The proofs use a diagrammatic calculus akin to
crystal theory.
| math.RA math.CO math.GR math.RT | motivated by work of coxeter 1957 we study a class of algebras associated to coxeter groups which we term generalized nilcoxeter algebras we construct the first finitedimensional examples other than usual nilcoxeter algebras these form a 2parameter type a family that we term nc_and we explore the combinatorial properties of these algebras including the coxeter word basis length function maximal words and their connection to khovanovs categorification of the weyl algebra our broader motivation arises from complex reflection groups and the brouemallerouquier freeness conjecture 1998 with generic hecke algebras over real and complex groups in mind we show that the first finitedimensional examples nc_and are in fact the only ones outside of the usual nilcoxeter algebras the proofs use a diagrammatic calculus akin to crystal theory | [['motivated', 'by', 'work', 'of', 'coxeter', '1957', 'we', 'study', 'a', 'class', 'of', 'algebras', 'associated', 'to', 'coxeter', 'groups', 'which', 'we', 'term', 'generalized', 'nilcoxeter', 'algebras', 'we', 'construct', 'the', 'first', 'finitedimensional', 'examples', 'other', 'than', 'usual', 'nilcoxeter', 'algebras', 'these', 'form', 'a', '2parameter', 'type', 'a', 'family', 'that', 'we', 'term', 'nc_and', 'we', 'explore', 'the', 'combinatorial', 'properties', 'of', 'these', 'algebras', 'including', 'the', 'coxeter', 'word', 'basis', 'length', 'function', 'maximal', 'words', 'and', 'their', 'connection', 'to', 'khovanovs', 'categorification', 'of', 'the', 'weyl', 'algebra', 'our', 'broader', 'motivation', 'arises', 'from', 'complex', 'reflection', 'groups', 'and', 'the', 'brouemallerouquier', 'freeness', 'conjecture', '1998', 'with', 'generic', 'hecke', 'algebras', 'over', 'real', 'and', 'complex', 'groups', 'in', 'mind', 'we', 'show', 'that', 'the', 'first', 'finitedimensional', 'examples', 'nc_and', 'are', 'in', 'fact', 'the', 'only', 'ones', 'outside', 'of', 'the', 'usual', 'nilcoxeter', 'algebras', 'the', 'proofs', 'use', 'a', 'diagrammatic', 'calculus', 'akin', 'to', 'crystal', 'theory']] | [-0.13711719814131762, 0.06908328388448036, -0.06109028876507803, 0.10982394864457468, -0.19661733457848193, -0.13904031534634886, -0.01062181871107203, 0.34222463958172333, -0.38379682292644346, -0.19895245271941853, 0.07511628858952059, -0.24683908694460693, -0.22973428550915467, 0.19134136738804436, -0.17495900955021618, -0.0581885467963441, 0.058600931474569413, 0.07850732925599294, -0.14250212512804808, -0.27064577456922195, 0.4360706678643409, -0.02163480603716351, 0.2239027096047288, -0.021853623483034355, 0.06925442556865395, 0.04989886304570569, -0.04268399575015619, -0.011359574026539036, -0.18558258213722315, 0.1478312698817472, 0.30988292761206154, 0.050769244464823886, 0.22370680494766151, -0.34984543841583504, -0.11482019766556313, 0.17615725658094836, 0.14462252101622566, 0.07820075785090762, -0.03909389515285425, -0.3072821340738012, 0.03929581463943043, -0.2674919336531607, -0.1729485611763916, -0.054758832472125214, 0.03911362396227935, -0.015432169758862564, -0.18044156071707784, 0.03833322011170879, 0.12705460942483374, 0.13975221365098917, -0.08924661910841389, -0.11368248265214442, -0.03875867033281201, 0.0662021477455421, -0.04983535496931937, -0.04773526793781904, 0.09130906424899068, -0.06994121694856043, -0.2198382700083866, 0.36074586890569504, 0.03126530380425734, -0.19544647828424497, 0.1710081929267044, -0.1839562502120518, -0.21589192543880983, 0.06966249188519127, 0.06929388439000052, 0.13226058357025658, -0.04878429604309892, 0.17936605236507833, -0.17162505909061385, 0.018948676301598816, 0.10972309935586674, 0.008476972048695658, 0.10065965393617277, 0.0499695974572133, -0.024137751672357793, 0.14885869326988338, 0.1005578344989945, -0.08159332346939852, -0.3507465732889989, -0.21272575865233584, -0.0832530674487648, 0.10032704333582568, -0.11185762522123581, -0.1957929126554749, 0.41576141053034615, 0.12197313904170952, 0.13557476200725113, 0.16130548025322486, 0.1551913918616871, 0.06690792254235092, 0.1535674472143578, -0.001806354978018337, 0.10088128293494857, 0.27503664390320726, -0.012706336902550585, -0.11594747829746219, -0.04660872391070284, 0.24934145310036246] |
1,802.07016 | Nanosecond-precision Time-of-Arrival Estimation for Aircraft Signals
with low-cost SDR Receivers | Precise Time-of-Arrival (TOA) estimations of aircraft and drone signals are
important for a wide set of applications including aircraft/drone tracking, air
traffic data verification, or self-localization. Our focus in this work is on
TOA estimation methods that can run on low-cost software-defined radio (SDR)
receivers, as widely deployed in Mode S / ADS-B crowdsourced sensor networks
such as the OpenSky Network. We evaluate experimentally classical TOA
estimation methods which are based on a cross-correlation with a reconstructed
message template and find that these methods are not optimal for such signals.
We propose two alternative methods that provide superior results for real-world
Mode S / ADS-B signals captured with low-cost SDR receivers. The best method
achieves a standard deviation error of 1.5 ns.
| eess.SP cs.NI | precise timeofarrival toa estimations of aircraft and drone signals are important for a wide set of applications including aircraftdrone tracking air traffic data verification or selflocalization our focus in this work is on toa estimation methods that can run on lowcost softwaredefined radio sdr receivers as widely deployed in mode s adsb crowdsourced sensor networks such as the opensky network we evaluate experimentally classical toa estimation methods which are based on a crosscorrelation with a reconstructed message template and find that these methods are not optimal for such signals we propose two alternative methods that provide superior results for realworld mode s adsb signals captured with lowcost sdr receivers the best method achieves a standard deviation error of 15 ns | [['precise', 'timeofarrival', 'toa', 'estimations', 'of', 'aircraft', 'and', 'drone', 'signals', 'are', 'important', 'for', 'a', 'wide', 'set', 'of', 'applications', 'including', 'aircraftdrone', 'tracking', 'air', 'traffic', 'data', 'verification', 'or', 'selflocalization', 'our', 'focus', 'in', 'this', 'work', 'is', 'on', 'toa', 'estimation', 'methods', 'that', 'can', 'run', 'on', 'lowcost', 'softwaredefined', 'radio', 'sdr', 'receivers', 'as', 'widely', 'deployed', 'in', 'mode', 's', 'adsb', 'crowdsourced', 'sensor', 'networks', 'such', 'as', 'the', 'opensky', 'network', 'we', 'evaluate', 'experimentally', 'classical', 'toa', 'estimation', 'methods', 'which', 'are', 'based', 'on', 'a', 'crosscorrelation', 'with', 'a', 'reconstructed', 'message', 'template', 'and', 'find', 'that', 'these', 'methods', 'are', 'not', 'optimal', 'for', 'such', 'signals', 'we', 'propose', 'two', 'alternative', 'methods', 'that', 'provide', 'superior', 'results', 'for', 'realworld', 'mode', 's', 'adsb', 'signals', 'captured', 'with', 'lowcost', 'sdr', 'receivers', 'the', 'best', 'method', 'achieves', 'a', 'standard', 'deviation', 'error', 'of', '15', 'ns']] | [-0.13957296680471226, 0.0020717638603435094, -0.04417445581062, 0.04654318606676612, -0.0721982226510407, -0.22516545507775135, 0.03695818701242449, 0.44959955905102383, -0.20276237204044806, -0.328707014412537, 0.15435106127166792, -0.27543993242585857, -0.17230381154330024, 0.291318729275274, -0.11476284100775834, 0.12755982526147566, 0.14184491759158296, 0.019882067926707405, -0.06896886679328226, -0.18862981107888133, 0.1961152762851576, 0.05338567356038995, 0.3440628913035538, 0.008111341375106272, 0.14018560937965804, 0.0048060180196742045, -0.03377991370825457, -0.025433771943227396, -0.07092990799303932, 0.10786567015589035, 0.33847296411467975, 0.2242734141553901, 0.22652656851168096, -0.4052260139988375, -0.2548941836668914, 0.10759410585038082, 0.14424537965722634, 0.08621645388056469, -0.06267864367349402, -0.3515138064066981, 0.1106699232785853, -0.1984486690988498, 0.01075882839132883, -0.057299300067580675, -0.04323527717790684, 0.05200032312266466, -0.3194226180594571, 0.046238232294426244, -0.03174229069151172, 0.060891371815144514, -0.012993282528922838, -0.14065420343501478, 0.07395570488850109, 0.15877369247149958, 0.020469759474263893, -0.005025859469226992, 0.16891485975053505, -0.035319368640083657, -0.18625262360472014, 0.3637238326873787, -0.09043297587557375, -0.20298712470318278, 0.1895043460061351, -0.04644519704229692, -0.12326090892839457, 0.12048430780747107, 0.27095152000200096, 0.10963476984174687, -0.1849619728677413, -0.003434091412164897, -0.009088162583212893, 0.20275478560023574, 0.041068656988072154, 0.053763352831465605, 0.15118045952296308, 0.2278389928064176, 0.13244821548368, 0.052382576273472495, -0.20349027991427907, -0.0027873960847989853, -0.214331330724174, -0.0910499235967315, -0.2337657678300053, -0.008672567927586736, -0.10144473894420002, -0.1158843145494451, 0.39095296456376794, 0.2141445161312028, 0.12432340851851872, 0.11304398911844689, 0.4374168121858555, 0.03545706108529923, 0.04801033964740629, 0.10095605229911934, 0.2464002829138972, 0.025585493327220196, 0.11591290562861685, -0.14698326896422176, 0.08608018718425091, -0.0012318781604442526] |
1,802.07017 | Diode-like asymmetric transmission in ultrathin hyperbolic
epsilon-near-zero slabs: extreme anisotropy mimicking chirality | We demonstrate that a strong asymmetric transmission for forward and backward
propagation of tilted circular polarized optical waves is supported by
ultrathin epsilon-near-zero hyperbolic slabs. We find that, remarkably, this
effect is solely triggered by anisotropy without resorting to any breaking of
reciprocity and chiral symmetries or spatial nonlocal effects. In addition, we
show that the asymmetric transmission undergoes a dramatic enhancement if the
slab is hyperbolic in the epsilon-near-zero regime. This happens since, close
to epsilon-near-zero point, the hyperbolic dispersion activates etalon
resonances where extraordinary waves accumulate propagation phase even though
the slab is ultrathin. The proposed strategy holds promise for realizing
ultra-compact and efficient polarization devices at different frequency bands.
| physics.optics | we demonstrate that a strong asymmetric transmission for forward and backward propagation of tilted circular polarized optical waves is supported by ultrathin epsilonnearzero hyperbolic slabs we find that remarkably this effect is solely triggered by anisotropy without resorting to any breaking of reciprocity and chiral symmetries or spatial nonlocal effects in addition we show that the asymmetric transmission undergoes a dramatic enhancement if the slab is hyperbolic in the epsilonnearzero regime this happens since close to epsilonnearzero point the hyperbolic dispersion activates etalon resonances where extraordinary waves accumulate propagation phase even though the slab is ultrathin the proposed strategy holds promise for realizing ultracompact and efficient polarization devices at different frequency bands | [['we', 'demonstrate', 'that', 'a', 'strong', 'asymmetric', 'transmission', 'for', 'forward', 'and', 'backward', 'propagation', 'of', 'tilted', 'circular', 'polarized', 'optical', 'waves', 'is', 'supported', 'by', 'ultrathin', 'epsilonnearzero', 'hyperbolic', 'slabs', 'we', 'find', 'that', 'remarkably', 'this', 'effect', 'is', 'solely', 'triggered', 'by', 'anisotropy', 'without', 'resorting', 'to', 'any', 'breaking', 'of', 'reciprocity', 'and', 'chiral', 'symmetries', 'or', 'spatial', 'nonlocal', 'effects', 'in', 'addition', 'we', 'show', 'that', 'the', 'asymmetric', 'transmission', 'undergoes', 'a', 'dramatic', 'enhancement', 'if', 'the', 'slab', 'is', 'hyperbolic', 'in', 'the', 'epsilonnearzero', 'regime', 'this', 'happens', 'since', 'close', 'to', 'epsilonnearzero', 'point', 'the', 'hyperbolic', 'dispersion', 'activates', 'etalon', 'resonances', 'where', 'extraordinary', 'waves', 'accumulate', 'propagation', 'phase', 'even', 'though', 'the', 'slab', 'is', 'ultrathin', 'the', 'proposed', 'strategy', 'holds', 'promise', 'for', 'realizing', 'ultracompact', 'and', 'efficient', 'polarization', 'devices', 'at', 'different', 'frequency', 'bands']] | [-0.2256161040859297, 0.18822508782302197, -0.06280693834664167, 0.01707287514208084, -0.14717720273100504, -0.18951652060994612, 0.031357909744006714, 0.4830754802096635, -0.26053706378609476, -0.22635728069846145, 0.039047388461767696, -0.26875401884899475, -0.20577220327062865, 0.17622601602800256, 0.014233135668161725, 0.024572551631406116, 0.005828660729873393, -0.08175016722608623, -0.044053871487579145, -0.11231201753876771, 0.29191896176364807, 0.027959389208782732, 0.362565293334358, 0.08361471166738609, 0.10254961397939562, 0.03915589197244377, 0.0863623862138151, -0.0051172190079731604, -0.0920358978400405, 0.04108501060077937, 0.23736901313532144, -0.08658811357599916, 0.2005394278904922, -0.4519970131181513, -0.2703516898660122, 0.06345494638247016, 0.1885604302660795, 0.14819407921666944, -0.14546738976995194, -0.27329821033137186, 0.06968660035012622, -0.10282898007426411, -0.21505916743717535, 0.0007195783702107812, 0.015305546008416318, -0.01989803354808828, -0.27980281581195804, 0.08176608499655101, 0.1055789953555047, 0.035073462599289736, -0.02228207674969391, -0.006670020379325641, -0.08662765480195438, 0.03193860638982317, 0.003362871265770601, -0.029661671464314816, 0.12157416995198998, -0.11124527526927912, -0.08686072905714225, 0.3843172274646349, -0.07799647344212904, -0.13722135939834906, 0.14188570383495452, -0.2047416537051114, -0.0028613142536154817, 0.20917162920315086, 0.18684672684841125, 0.07600510590626593, -0.047079996865899636, 0.07192758841899506, -0.011208889332400369, 0.1809430863860533, 0.16663715582399163, 0.07646197611964974, 0.2591113950391965, 0.15357369528750756, 0.04735481084519831, 0.13063285748337097, -0.10484207663934544, -0.019980952848397595, -0.25460779034100206, -0.13242322398166703, -0.16986693591544672, 0.05814097453341154, -0.09174646403451854, -0.1675869700016587, 0.34485752022841815, 0.11724792138141181, 0.12531280734609546, -0.017775694550696892, 0.3102455484955239, 0.16491260347486655, 0.0745018516858441, 0.086918420461838, 0.35663880097646533, 0.1206210074441125, 0.10362183882638679, -0.2637359038781142, 0.04267564636601102, -0.036134979812361835] |
1,802.07018 | Hermite-Hadamard type inequalities for operator geometrically convex
functions II | In this paper, we prove some Hermite-Hadamard type inequalities for operator
geometrically convex functions for non-commutative operators. Keywords:
Operator geometrically convex function, Hermite-Hadamard inequality.
| math.FA | in this paper we prove some hermitehadamard type inequalities for operator geometrically convex functions for noncommutative operators keywords operator geometrically convex function hermitehadamard inequality | [['in', 'this', 'paper', 'we', 'prove', 'some', 'hermitehadamard', 'type', 'inequalities', 'for', 'operator', 'geometrically', 'convex', 'functions', 'for', 'noncommutative', 'operators', 'keywords', 'operator', 'geometrically', 'convex', 'function', 'hermitehadamard', 'inequality']] | [-0.09596073382999748, 0.007523736256795625, -0.04970220767427236, 0.23936617170208288, -0.16903080986230634, -0.2713814356053869, -0.017923029639253702, 0.336574530073752, -0.4414935192714135, -0.040376640701045595, 0.2166823929437669, -0.4120734925381839, -0.22740756502995887, 0.25073486267744255, -0.25499720533844084, 0.09679635164017479, 0.004753119816693167, -0.05868442558373014, -0.2084741936705541, -0.2266138809888313, 0.4706528037786484, -0.2099039532088985, 0.09992017360248913, 0.1909225999067227, 0.06467458586363743, 0.036156779465576015, 0.03317370259901509, -0.06560861241693298, -0.24777628217513362, 0.20193362310722782, 0.37458538403734565, 0.1682546490628738, 0.34232260659337044, -0.43932358858486015, -0.10822068259585649, 0.21940374614981314, 0.12225827706667285, -0.14740537983986238, -0.09277101296659869, -0.26837128043795627, -0.0815632666926831, -0.11822481856991847, -0.26732350296030444, -0.08986247982829809, -0.02278790776229774, 0.08622629063514371, -0.38790518262734014, 0.16320099256699905, 0.11379339165675144, 0.1007234653661726, -0.1697262420396631, -0.1021380436917146, 0.12986889774523055, -0.16236231877701357, -0.012270197505131364, 0.07148005774555106, 0.06532804157662515, 0.055829364040012784, -0.17997949353108803, 0.15274545655120164, 0.03469565413737049, -0.4284585209873815, -0.017602928176832695, -0.207494309618293, -0.2534045355084042, -0.11233183563066025, 0.15754509965578714, 0.3065476992633194, -0.22463223648567995, 0.21865390702926865, -0.1672021843260154, 0.007252340825895469, 0.06973829097114503, 0.17878122239684066, -0.026474534960774083, -0.0694400379434228, 0.2753288395470008, 0.26967488566879183, 0.14656942407600582, -0.12228601262904704, -0.4389241977284352, -0.22809827669213215, -0.1936199706979096, 0.12403830179634194, -0.24586655498327067, -0.24136763159185648, 0.3356613178427021, -0.08984487624062847, 0.05151638823250929, 0.17622160782229912, 0.1486008952682217, 0.18770500280273458, 0.10847763383450608, 0.060865176764006414, 0.12092523655762004, 0.22864421578318192, 0.10049915337003767, -0.057588152354583144, 0.03902844750943283, 0.43390589498449117] |
1,802.07019 | Monte-Carlo simulations of the detailed iron absorption line profiles
from thermal winds in X-ray binaries | Blue shifted absorption lines from highly ionised iron are seen in some high
inclination X-ray binary systems, indicating the presence of an equatorial disc
wind. This launch mechanism is under debate, but thermal driving should be
ubiquitous. X-ray irradiation from the central source heats disc surface,
forming a wind from the outer disc where the local escape velocity is lower
than the sound speed. The mass loss rate from each part of the disc is
determined by the luminosity and spectral shape of the central source. We use
these together with an assumed density and velocity structure of the wind to
predict the column density and ionisation state, then combine this with a Monte
Carlo radiation transfer to predict the detailed shape of the absorption (and
emission) line profiles. We test this on the persistent wind seen in the bright
neutron star binary GX 13+1, with luminosity L/LEdd ~ 0.5. We approximately
include the effect of radiation pressure because of high luminosity, and
compute line features. We compare these to the highest resolution data, the
Chandra third order grating spectra, which we show here for the first time.
This is the first physical model for the wind in this system, and it succeeds
in reproducing many of the features seen in the data, showing that the wind in
GX13+1 is most likely a thermal-radiation driven wind. This approach, combined
with better streamline structures derived from full radiation hydrodynamic
simulations, will allow future calorimeter data to explore the detail wind
structure.
| astro-ph.HE | blue shifted absorption lines from highly ionised iron are seen in some high inclination xray binary systems indicating the presence of an equatorial disc wind this launch mechanism is under debate but thermal driving should be ubiquitous xray irradiation from the central source heats disc surface forming a wind from the outer disc where the local escape velocity is lower than the sound speed the mass loss rate from each part of the disc is determined by the luminosity and spectral shape of the central source we use these together with an assumed density and velocity structure of the wind to predict the column density and ionisation state then combine this with a monte carlo radiation transfer to predict the detailed shape of the absorption and emission line profiles we test this on the persistent wind seen in the bright neutron star binary gx 131 with luminosity lledd 05 we approximately include the effect of radiation pressure because of high luminosity and compute line features we compare these to the highest resolution data the chandra third order grating spectra which we show here for the first time this is the first physical model for the wind in this system and it succeeds in reproducing many of the features seen in the data showing that the wind in gx131 is most likely a thermalradiation driven wind this approach combined with better streamline structures derived from full radiation hydrodynamic simulations will allow future calorimeter data to explore the detail wind structure | [['blue', 'shifted', 'absorption', 'lines', 'from', 'highly', 'ionised', 'iron', 'are', 'seen', 'in', 'some', 'high', 'inclination', 'xray', 'binary', 'systems', 'indicating', 'the', 'presence', 'of', 'an', 'equatorial', 'disc', 'wind', 'this', 'launch', 'mechanism', 'is', 'under', 'debate', 'but', 'thermal', 'driving', 'should', 'be', 'ubiquitous', 'xray', 'irradiation', 'from', 'the', 'central', 'source', 'heats', 'disc', 'surface', 'forming', 'a', 'wind', 'from', 'the', 'outer', 'disc', 'where', 'the', 'local', 'escape', 'velocity', 'is', 'lower', 'than', 'the', 'sound', 'speed', 'the', 'mass', 'loss', 'rate', 'from', 'each', 'part', 'of', 'the', 'disc', 'is', 'determined', 'by', 'the', 'luminosity', 'and', 'spectral', 'shape', 'of', 'the', 'central', 'source', 'we', 'use', 'these', 'together', 'with', 'an', 'assumed', 'density', 'and', 'velocity', 'structure', 'of', 'the', 'wind', 'to', 'predict', 'the', 'column', 'density', 'and', 'ionisation', 'state', 'then', 'combine', 'this', 'with', 'a', 'monte', 'carlo', 'radiation', 'transfer', 'to', 'predict', 'the', 'detailed', 'shape', 'of', 'the', 'absorption', 'and', 'emission', 'line', 'profiles', 'we', 'test', 'this', 'on', 'the', 'persistent', 'wind', 'seen', 'in', 'the', 'bright', 'neutron', 'star', 'binary', 'gx', '131', 'with', 'luminosity', 'lledd', '05', 'we', 'approximately', 'include', 'the', 'effect', 'of', 'radiation', 'pressure', 'because', 'of', 'high', 'luminosity', 'and', 'compute', 'line', 'features', 'we', 'compare', 'these', 'to', 'the', 'highest', 'resolution', 'data', 'the', 'chandra', 'third', 'order', 'grating', 'spectra', 'which', 'we', 'show', 'here', 'for', 'the', 'first', 'time', 'this', 'is', 'the', 'first', 'physical', 'model', 'for', 'the', 'wind', 'in', 'this', 'system', 'and', 'it', 'succeeds', 'in', 'reproducing', 'many', 'of', 'the', 'features', 'seen', 'in', 'the', 'data', 'showing', 'that', 'the', 'wind', 'in', 'gx131', 'is', 'most', 'likely', 'a', 'thermalradiation', 'driven', 'wind', 'this', 'approach', 'combined', 'with', 'better', 'streamline', 'structures', 'derived', 'from', 'full', 'radiation', 'hydrodynamic', 'simulations', 'will', 'allow', 'future', 'calorimeter', 'data', 'to', 'explore', 'the', 'detail', 'wind', 'structure']] | [-0.06802658137447391, 0.09040867037854688, -0.06489049926041121, 0.08412123352371485, -0.07454887697712545, -0.06366748307236886, 0.0030556428835289665, 0.4345085179642681, -0.2538096655359357, -0.326557072636907, 0.08004097841459375, -0.2929530783769596, -0.025102131926159125, 0.2104985828438482, -0.022333182347751404, 0.010088535938337147, 0.049473785603583516, -0.03458138884056405, -0.05886513681055596, -0.1826701437765508, 0.3143088436885606, 0.13145602339818835, 0.19713446172515312, 0.0125876611417036, 0.06616400683768109, -0.062021316341442395, -0.041359288877916026, -0.01635263383530649, -0.11719766141752451, 0.09089664744968755, 0.20136390499635992, 0.10941418129614139, 0.2103839640984364, -0.4038309760459037, -0.243352792611024, 0.040781877317791246, 0.14955187762173894, 0.051980308161199425, -0.05795481797339522, -0.21191291178269947, 0.03073065118825841, -0.22291122597967644, -0.16488539504381008, 0.030216366600340615, 0.020143757263819378, 0.03662256670163862, -0.23449392737418667, 0.08952485859379113, 0.031041083304327446, 0.056988837376955044, -0.12395949778801586, -0.05941368135704049, -0.08718266998217572, 0.06488162004641336, 0.04334390739513838, 0.04954148234096337, 0.1860188260200166, -0.154283652876889, -0.024104334637485295, 0.3877782389656248, -0.06646691069707515, -0.056943403073866104, 0.21494879145418336, -0.25044169394396637, -0.12640213538110856, 0.20837672189229642, 0.17074311429112926, 0.10953937883836677, -0.13136054462160407, -0.018402656119730115, -0.026615804003319705, 0.2257558783491976, 0.03827795077930672, 0.012835314797974345, 0.3001563913192615, 0.12442881182064283, 0.010636688000557618, 0.15118206952241284, -0.21669137662736676, -0.03385063967327157, -0.25192548633725137, -0.10729620251598876, -0.13249636180586663, 0.05589647594293258, -0.10268317050747966, -0.145363059316586, 0.35070955615311145, 0.17634052907614164, 0.23382700722193323, 0.0043941470406328636, 0.33130306571751955, 0.14940888991571932, 0.04781180801034632, 0.1540602833597386, 0.2906628517761507, 0.1472854686435312, 0.12817098001900865, -0.26093833011866785, 0.10407608305197583, 0.0018657762618047226] |
1,802.0702 | First-order derivative of cluster size as a new signature of phase
transition in heavy ion collisions at intermediate energies | The phenomenon of liquid-gas phase transition occurring in heavy ion
collisions at intermediate energies is a subject of contemporary interest.
Phase transition is usually characterized by the specific behaviour of state
variables like pressure, density, energy etc. In heavy ion collisions there is
no direct way of accessing these state variables and hence unambiguous
detection of phase transition becomes difficult. This work establishes that
signatures of phase transition can be extracted from the observables which are
easily accessible in experiments and these have similar behaviour as the state
variables. The temperature dependence of the first order derivative of the
order parameters related to the largest and second largest cluster size
(produced in heavy ion collisions) exhibit similar behavior as that of the
variation of specific heat at constant volume Cv which is an established
signature of first order phase transition. This motivates us to propose these
derivatives as confirmatory signals of liquid-gas phase transition. The
measurement of these signals in easily feasible in most experiments as compared
to the other signatures like specific heat, caloric curve or bimodality. This
temperature where the peak appears is designated to be the transition
temperature and the effect of certain parameters on this has also been
examined.
| nucl-th hep-ph | the phenomenon of liquidgas phase transition occurring in heavy ion collisions at intermediate energies is a subject of contemporary interest phase transition is usually characterized by the specific behaviour of state variables like pressure density energy etc in heavy ion collisions there is no direct way of accessing these state variables and hence unambiguous detection of phase transition becomes difficult this work establishes that signatures of phase transition can be extracted from the observables which are easily accessible in experiments and these have similar behaviour as the state variables the temperature dependence of the first order derivative of the order parameters related to the largest and second largest cluster size produced in heavy ion collisions exhibit similar behavior as that of the variation of specific heat at constant volume cv which is an established signature of first order phase transition this motivates us to propose these derivatives as confirmatory signals of liquidgas phase transition the measurement of these signals in easily feasible in most experiments as compared to the other signatures like specific heat caloric curve or bimodality this temperature where the peak appears is designated to be the transition temperature and the effect of certain parameters on this has also been examined | [['the', 'phenomenon', 'of', 'liquidgas', 'phase', 'transition', 'occurring', 'in', 'heavy', 'ion', 'collisions', 'at', 'intermediate', 'energies', 'is', 'a', 'subject', 'of', 'contemporary', 'interest', 'phase', 'transition', 'is', 'usually', 'characterized', 'by', 'the', 'specific', 'behaviour', 'of', 'state', 'variables', 'like', 'pressure', 'density', 'energy', 'etc', 'in', 'heavy', 'ion', 'collisions', 'there', 'is', 'no', 'direct', 'way', 'of', 'accessing', 'these', 'state', 'variables', 'and', 'hence', 'unambiguous', 'detection', 'of', 'phase', 'transition', 'becomes', 'difficult', 'this', 'work', 'establishes', 'that', 'signatures', 'of', 'phase', 'transition', 'can', 'be', 'extracted', 'from', 'the', 'observables', 'which', 'are', 'easily', 'accessible', 'in', 'experiments', 'and', 'these', 'have', 'similar', 'behaviour', 'as', 'the', 'state', 'variables', 'the', 'temperature', 'dependence', 'of', 'the', 'first', 'order', 'derivative', 'of', 'the', 'order', 'parameters', 'related', 'to', 'the', 'largest', 'and', 'second', 'largest', 'cluster', 'size', 'produced', 'in', 'heavy', 'ion', 'collisions', 'exhibit', 'similar', 'behavior', 'as', 'that', 'of', 'the', 'variation', 'of', 'specific', 'heat', 'at', 'constant', 'volume', 'cv', 'which', 'is', 'an', 'established', 'signature', 'of', 'first', 'order', 'phase', 'transition', 'this', 'motivates', 'us', 'to', 'propose', 'these', 'derivatives', 'as', 'confirmatory', 'signals', 'of', 'liquidgas', 'phase', 'transition', 'the', 'measurement', 'of', 'these', 'signals', 'in', 'easily', 'feasible', 'in', 'most', 'experiments', 'as', 'compared', 'to', 'the', 'other', 'signatures', 'like', 'specific', 'heat', 'caloric', 'curve', 'or', 'bimodality', 'this', 'temperature', 'where', 'the', 'peak', 'appears', 'is', 'designated', 'to', 'be', 'the', 'transition', 'temperature', 'and', 'the', 'effect', 'of', 'certain', 'parameters', 'on', 'this', 'has', 'also', 'been', 'examined']] | [-0.11339605342495838, 0.20683814369388936, -0.10354849720417333, 0.043599516800788274, -0.06053714651449267, -0.11201885711456755, 0.04989558297411305, 0.33929304853356973, -0.25718149547912456, -0.315671567341744, 0.10666328253742913, -0.3134319185384829, -0.07563144565110319, 0.151928139968633, 0.021215817148985315, 0.051390925239515835, -0.007078947075596767, 0.08898115685218808, -0.09192635587203257, -0.16480206182969762, 0.32476774812446624, 0.06821057008274858, 0.2697069428796912, 0.07466110797671216, 0.032109604049657514, -0.05581062002534166, 0.03691927794357899, 0.03500464276910709, -0.1290406844641909, 0.008367260077737703, 0.29241815199524973, 0.05718187313971885, 0.19580639157847965, -0.38726177773085135, -0.22104000889299336, 0.1472912186015801, 0.11529858534859741, 0.10717911068281259, -0.09064987428506992, -0.25492675921001146, 0.01511869599969296, -0.15306255207144714, -0.12081358069496624, -0.07923403059987161, 0.019734451441745748, 0.01686283589221464, -0.25503467459213264, 0.14529718506007153, 0.03422877653140639, 0.05844637304269181, -0.02672400876186935, -0.11970157973844503, -0.033758655844228755, 0.11612604703327521, 0.05686315816055509, 0.0385546316702396, 0.14282275309437528, -0.11877082856291712, -0.07796173728084917, 0.39348774569870654, -0.057845069572049664, -0.0803711639737723, 0.22299279437946348, -0.18602291371110194, -0.132873436663153, 0.17021317764235655, 0.1750152542833881, 0.12408044973842507, -0.15220334005583389, 0.00081964570620634, 0.035262904558307835, 0.17988744030046444, 0.06088889079349657, 0.06838431251246775, 0.2148313477561979, 0.16742062368177868, 0.011361052838424817, 0.15813937072383796, -0.09876873256670761, -0.1080796771815845, -0.3155880494271474, -0.16111807874977369, -0.19783418030097275, -0.006683908036469569, -0.0619266168135528, -0.1561406186593724, 0.38436201275005166, 0.16228810120556042, 0.24301440190418344, -0.05645498759893178, 0.260666395429742, 0.15831511126821998, 0.07171708230775657, 0.028398004644940345, 0.2664647576137643, 0.11026534340986661, 0.14205428085110972, -0.24114280582415376, 0.152141366995816, 0.022352093064542767] |
1,802.07021 | Fusing Video and Inertial Sensor Data for Walking Person Identification | An autonomous computer system (such as a robot) typically needs to identify,
locate, and track persons appearing in its sight. However, most solutions have
their limitations regarding efficiency, practicability, or environmental
constraints. In this paper, we propose an effective and practical system which
combines video and inertial sensors for person identification (PID). Persons
who do different activities are easy to identify. To show the robustness and
potential of our system, we propose a walking person identification (WPID)
method to identify persons walking at the same time. By comparing features
derived from both video and inertial sensor data, we can associate sensors in
smartphones with human objects in videos. Results show that the correctly
identified rate of our WPID method can up to 76% in 2 seconds.
| cs.CV | an autonomous computer system such as a robot typically needs to identify locate and track persons appearing in its sight however most solutions have their limitations regarding efficiency practicability or environmental constraints in this paper we propose an effective and practical system which combines video and inertial sensors for person identification pid persons who do different activities are easy to identify to show the robustness and potential of our system we propose a walking person identification wpid method to identify persons walking at the same time by comparing features derived from both video and inertial sensor data we can associate sensors in smartphones with human objects in videos results show that the correctly identified rate of our wpid method can up to 76 in 2 seconds | [['an', 'autonomous', 'computer', 'system', 'such', 'as', 'a', 'robot', 'typically', 'needs', 'to', 'identify', 'locate', 'and', 'track', 'persons', 'appearing', 'in', 'its', 'sight', 'however', 'most', 'solutions', 'have', 'their', 'limitations', 'regarding', 'efficiency', 'practicability', 'or', 'environmental', 'constraints', 'in', 'this', 'paper', 'we', 'propose', 'an', 'effective', 'and', 'practical', 'system', 'which', 'combines', 'video', 'and', 'inertial', 'sensors', 'for', 'person', 'identification', 'pid', 'persons', 'who', 'do', 'different', 'activities', 'are', 'easy', 'to', 'identify', 'to', 'show', 'the', 'robustness', 'and', 'potential', 'of', 'our', 'system', 'we', 'propose', 'a', 'walking', 'person', 'identification', 'wpid', 'method', 'to', 'identify', 'persons', 'walking', 'at', 'the', 'same', 'time', 'by', 'comparing', 'features', 'derived', 'from', 'both', 'video', 'and', 'inertial', 'sensor', 'data', 'we', 'can', 'associate', 'sensors', 'in', 'smartphones', 'with', 'human', 'objects', 'in', 'videos', 'results', 'show', 'that', 'the', 'correctly', 'identified', 'rate', 'of', 'our', 'wpid', 'method', 'can', 'up', 'to', '76', 'in', '2', 'seconds']] | [-0.0928259577692276, 0.029736907980188864, -0.07747529866173863, -0.008839447285056175, -0.09198125541931199, -0.1983355801109405, 0.02727141774976776, 0.43534654562151237, -0.24147726952627813, -0.40129191682001786, 0.0862271623195885, -0.293205774678368, -0.1630817660752068, 0.1817284477264395, -0.21147324414097615, 0.0805625530347536, 0.07979756286705754, 0.10482356635921244, 0.014555526080526291, -0.24801911172201677, 0.24978983514912187, 0.010006682902214027, 0.2638288482051012, 0.02589205426779846, 0.1488005917513698, -0.02407467724086957, -0.03944640256269204, -0.005734292752740364, -0.06130206314540579, 0.10602209711777827, 0.33563419345075324, 0.17214529331578243, 0.3082506450338124, -0.41249137848705775, -0.19873397915263571, 0.06870879845753793, 0.17400290384783498, 0.10857781583927723, -0.04116412251436662, -0.38284342773371344, 0.1480679820111442, -0.1816542414617875, -0.08927695886907919, -0.1119161621637402, 0.025818579221865343, 0.014437278844378587, -0.2495903123448032, 0.02787383402122237, -0.023658129431667826, 0.08876220509973204, -0.09185632658773102, -0.04679795495523591, 0.044502334888919345, 0.25324508140141505, 0.08561825406016602, -0.0030247495986611373, 0.21708407625555992, -0.1798944887385944, -0.14459364305836178, 0.4158691565596288, -0.002586654612734433, -0.18043258088507555, 0.265659537915546, -0.08277180222907074, -0.11298742852429108, 0.09297124233196355, 0.237811404587363, 0.1353158142132264, -0.19795933858990938, -0.043459471458317564, -0.005287691950798035, 0.18879512784581992, 0.0494042988002841, 0.017320929091393707, 0.1888779404633228, 0.1597634957382275, 0.07929007913691984, 0.08152812487265516, -0.13262658319886653, -0.03650901036997957, -0.2403423020450939, -0.14183084741835633, -0.14732933964865702, -0.035724760040700916, -0.06819059024130711, -0.08415491841808562, 0.3946078585445761, 0.27501967557585766, 0.20184146234345052, 0.06786816368243777, 0.3235204497412328, 0.02450800610184219, 0.08501970288982134, 0.07190701202489436, 0.20714755844880617, -0.03407692345753012, 0.1596729592683034, -0.19880708341389114, 0.0590466950952466, 0.027449060094377566] |
1,802.07022 | Discovering Hidden Topical Hubs and Authorities in Online Social
Networks | Finding influential users in online social networks is an important problem
with many possible useful applications. HITS and other link analysis methods,
in particular, have been often used to identify hub and authority users in web
graphs and online social networks. These works, however, have not considered
topical aspect of links in their analysis. A straightforward approach to
overcome this limitation is to first apply topic models to learn the user
topics before applying the HITS algorithm. In this paper, we instead propose a
novel topic model known as Hub and Authority Topic (HAT) model to combine the
two process so as to jointly learn the hub, authority and topical interests. We
evaluate HAT against several existing state-of-the-art methods in two aspects:
(i) modeling of topics, and (ii) link recommendation. We conduct experiments on
two real-world datasets from Twitter and Instagram. Our experiment results show
that HAT is comparable to state-of-the-art topic models in learning topics and
it outperforms the state-of-the-art in link recommendation task.
| cs.SI cs.IR | finding influential users in online social networks is an important problem with many possible useful applications hits and other link analysis methods in particular have been often used to identify hub and authority users in web graphs and online social networks these works however have not considered topical aspect of links in their analysis a straightforward approach to overcome this limitation is to first apply topic models to learn the user topics before applying the hits algorithm in this paper we instead propose a novel topic model known as hub and authority topic hat model to combine the two process so as to jointly learn the hub authority and topical interests we evaluate hat against several existing stateoftheart methods in two aspects i modeling of topics and ii link recommendation we conduct experiments on two realworld datasets from twitter and instagram our experiment results show that hat is comparable to stateoftheart topic models in learning topics and it outperforms the stateoftheart in link recommendation task | [['finding', 'influential', 'users', 'in', 'online', 'social', 'networks', 'is', 'an', 'important', 'problem', 'with', 'many', 'possible', 'useful', 'applications', 'hits', 'and', 'other', 'link', 'analysis', 'methods', 'in', 'particular', 'have', 'been', 'often', 'used', 'to', 'identify', 'hub', 'and', 'authority', 'users', 'in', 'web', 'graphs', 'and', 'online', 'social', 'networks', 'these', 'works', 'however', 'have', 'not', 'considered', 'topical', 'aspect', 'of', 'links', 'in', 'their', 'analysis', 'a', 'straightforward', 'approach', 'to', 'overcome', 'this', 'limitation', 'is', 'to', 'first', 'apply', 'topic', 'models', 'to', 'learn', 'the', 'user', 'topics', 'before', 'applying', 'the', 'hits', 'algorithm', 'in', 'this', 'paper', 'we', 'instead', 'propose', 'a', 'novel', 'topic', 'model', 'known', 'as', 'hub', 'and', 'authority', 'topic', 'hat', 'model', 'to', 'combine', 'the', 'two', 'process', 'so', 'as', 'to', 'jointly', 'learn', 'the', 'hub', 'authority', 'and', 'topical', 'interests', 'we', 'evaluate', 'hat', 'against', 'several', 'existing', 'stateoftheart', 'methods', 'in', 'two', 'aspects', 'i', 'modeling', 'of', 'topics', 'and', 'ii', 'link', 'recommendation', 'we', 'conduct', 'experiments', 'on', 'two', 'realworld', 'datasets', 'from', 'twitter', 'and', 'instagram', 'our', 'experiment', 'results', 'show', 'that', 'hat', 'is', 'comparable', 'to', 'stateoftheart', 'topic', 'models', 'in', 'learning', 'topics', 'and', 'it', 'outperforms', 'the', 'stateoftheart', 'in', 'link', 'recommendation', 'task']] | [-0.0368784830369281, -0.03664590560850532, -0.059036649997825874, 0.0925442867796488, -0.1798074235039001, -0.20558609560583577, 0.06811486683630695, 0.4707328804514625, -0.25073609974404626, -0.347812032476632, 0.060895837569665726, -0.34668446432121774, -0.231942684317685, 0.18363102834855177, -0.12489354354752735, 0.04601079001458305, 0.1124782720407838, 0.08665673147999879, -0.001700313275355394, -0.31010815743356945, 0.31237714062162647, 0.055098372901027856, 0.3571397595446218, 0.08527891359602412, 0.06398355932553497, -0.028208806151241966, -0.11669788108362505, 0.02212561190297658, -0.11338837681162686, 0.14401776729024607, 0.4012247906622537, 0.22480460858875603, 0.3700400555901455, -0.41135802516205744, -0.21328185123363227, 0.0901814900684368, 0.15719193063789244, 0.07404774875939245, -0.03136255061042241, -0.3184921476369103, 0.06741757957885662, -0.23053272080353715, -0.006495299850675193, -0.10356495265961822, 0.00017088244415142318, 0.017764049581477814, -0.2383596692283666, 0.027110635688189756, 0.047651005039259675, 0.043121932689664945, 0.0166175205048851, -0.11494758396945667, 0.06315633458593352, 0.2169889080084183, 0.11693977900678433, 0.020801152585243638, 0.15567803440446204, -0.17951361478097336, -0.21725631123690894, 0.3832761985334483, -0.03092414333668509, -0.1774305543326067, 0.21052231794561851, 0.010690412018448114, -0.22681749958375638, 0.02683889123074936, 0.2523575734290661, 0.1180384463009735, -0.17913025213179715, 0.0019076071086932312, -0.07736295060903738, 0.16053879084912212, 0.024038986194257934, -0.023200766341478534, 0.1634647193393021, 0.23305619764141738, 0.05976313073717227, 0.09023162562181383, -0.06689426945099099, -0.11089238221369063, -0.143828765816535, -0.08926480410225464, -0.18840174501140913, -0.042362529712386965, -0.07465807133368357, -0.11639543030301645, 0.4062834690353184, 0.265177166557899, 0.17702759765652995, 0.009737928372553804, 0.3284822878060919, -0.024554695099394657, 0.06789816904559054, 0.12029675330762102, 0.15380923610575722, 0.026165087808939544, 0.18685335197995742, -0.11112022661519322, 0.10045794529000748, 0.034023663971686005] |
1,802.07023 | BAN-GZKP: Optimal Zero Knowledge Proof based Scheme for Wireless Body
Area Networks | BANZKP is the best to date Zero Knowledge Proof (ZKP) based secure
lightweight and energy efficient authentication scheme designed for Wireless
Area Network (WBAN). It is vulnerable to several security attacks such as the
replay attack, Distributed Denial-of-Service (DDoS) attacks at sink and
redundancy information crack. However, BANZKP needs an end-to-end
authentication which is not compliant with the human body postural mobility. We
propose a new scheme BAN-GZKP. Our scheme improves both the security and
postural mobility resilience of BANZKP. Moreover, BAN-GZKP uses only a
three-phase authentication which is optimal in the class of ZKP protocols. To
fix the security vulnerabilities of BANZKP, BAN-GZKP uses a novel random key
allocation and a Hop-by-Hop authentication definition. We further prove the
reliability of our scheme to various attacks including those to which BANZKP is
vulnerable. Furthermore, via extensive simulations we prove that our scheme,
BAN-GZKP, outperforms BANZKP in terms of reliability to human body postural
mobility for various network parameters (end-to-end delay, number of packets
exchanged in the network, number of transmissions). We compared both schemes
using representative convergecast strategies with various transmission rates
and human postural mobility. Finally, it is important to mention that BAN-GZKP
has no additional cost compared to BANZKP in terms memory, computational
complexity or energy consumption.
| cs.NI cs.CR | banzkp is the best to date zero knowledge proof zkp based secure lightweight and energy efficient authentication scheme designed for wireless area network wban it is vulnerable to several security attacks such as the replay attack distributed denialofservice ddos attacks at sink and redundancy information crack however banzkp needs an endtoend authentication which is not compliant with the human body postural mobility we propose a new scheme bangzkp our scheme improves both the security and postural mobility resilience of banzkp moreover bangzkp uses only a threephase authentication which is optimal in the class of zkp protocols to fix the security vulnerabilities of banzkp bangzkp uses a novel random key allocation and a hopbyhop authentication definition we further prove the reliability of our scheme to various attacks including those to which banzkp is vulnerable furthermore via extensive simulations we prove that our scheme bangzkp outperforms banzkp in terms of reliability to human body postural mobility for various network parameters endtoend delay number of packets exchanged in the network number of transmissions we compared both schemes using representative convergecast strategies with various transmission rates and human postural mobility finally it is important to mention that bangzkp has no additional cost compared to banzkp in terms memory computational complexity or energy consumption | [['banzkp', 'is', 'the', 'best', 'to', 'date', 'zero', 'knowledge', 'proof', 'zkp', 'based', 'secure', 'lightweight', 'and', 'energy', 'efficient', 'authentication', 'scheme', 'designed', 'for', 'wireless', 'area', 'network', 'wban', 'it', 'is', 'vulnerable', 'to', 'several', 'security', 'attacks', 'such', 'as', 'the', 'replay', 'attack', 'distributed', 'denialofservice', 'ddos', 'attacks', 'at', 'sink', 'and', 'redundancy', 'information', 'crack', 'however', 'banzkp', 'needs', 'an', 'endtoend', 'authentication', 'which', 'is', 'not', 'compliant', 'with', 'the', 'human', 'body', 'postural', 'mobility', 'we', 'propose', 'a', 'new', 'scheme', 'bangzkp', 'our', 'scheme', 'improves', 'both', 'the', 'security', 'and', 'postural', 'mobility', 'resilience', 'of', 'banzkp', 'moreover', 'bangzkp', 'uses', 'only', 'a', 'threephase', 'authentication', 'which', 'is', 'optimal', 'in', 'the', 'class', 'of', 'zkp', 'protocols', 'to', 'fix', 'the', 'security', 'vulnerabilities', 'of', 'banzkp', 'bangzkp', 'uses', 'a', 'novel', 'random', 'key', 'allocation', 'and', 'a', 'hopbyhop', 'authentication', 'definition', 'we', 'further', 'prove', 'the', 'reliability', 'of', 'our', 'scheme', 'to', 'various', 'attacks', 'including', 'those', 'to', 'which', 'banzkp', 'is', 'vulnerable', 'furthermore', 'via', 'extensive', 'simulations', 'we', 'prove', 'that', 'our', 'scheme', 'bangzkp', 'outperforms', 'banzkp', 'in', 'terms', 'of', 'reliability', 'to', 'human', 'body', 'postural', 'mobility', 'for', 'various', 'network', 'parameters', 'endtoend', 'delay', 'number', 'of', 'packets', 'exchanged', 'in', 'the', 'network', 'number', 'of', 'transmissions', 'we', 'compared', 'both', 'schemes', 'using', 'representative', 'convergecast', 'strategies', 'with', 'various', 'transmission', 'rates', 'and', 'human', 'postural', 'mobility', 'finally', 'it', 'is', 'important', 'to', 'mention', 'that', 'bangzkp', 'has', 'no', 'additional', 'cost', 'compared', 'to', 'banzkp', 'in', 'terms', 'memory', 'computational', 'complexity', 'or', 'energy', 'consumption']] | [-0.228642165051488, -0.032743819712359866, -0.03395911159760288, 0.0206822466721277, -0.07316889229306336, -0.2646523116058425, 0.12277526998531484, 0.38407545718787744, -0.23987180672799857, -0.3044029560617425, 0.10979587364937379, -0.2636874421013956, -0.19127024580394786, 0.1937502494993125, -0.2137554904310095, 0.15385466881773688, 0.019848166285394625, 0.03356769388044725, 0.024806284483685936, -0.3054599151840772, 0.28247761467814836, 0.09033394300793275, 0.3745774228847697, 0.10070878709332225, 0.10061804168193676, 0.01206866648876995, -0.009731807979502639, -0.04735187913066124, -0.08641367759222764, 0.12650950717445658, 0.3144314747034131, 0.18801031149389072, 0.33014056124862584, -0.40969179250282106, -0.24404312547242812, 0.06257508253415771, 0.13454297935238116, 0.11364873839374053, -0.04147806717862674, -0.29018725603974854, 0.16358366963769974, -0.28816428023466223, -0.038396651738514885, -0.08804190606346719, -0.03511796065530423, 0.037488511078946435, -0.2878988836802827, 0.004034355715024129, -0.00035339935892150163, 0.05393577619950381, -0.023786366734493292, -0.05434216552360527, -0.007864959490636996, 0.1682664373768137, 0.054041250011745534, -0.012638331750189467, 0.1886921029038834, -0.09647275751588073, -0.14707278379720398, 0.3489075898188367, 0.034110306400937165, -0.1965897565241903, 0.17688876810777737, 0.04762395566583357, -0.13561166425427182, 0.1369789744408146, 0.22282608651498145, 0.06975301271349049, -0.16479326603916344, -0.029967330449926957, -0.007956904387012409, 0.22154646298210873, 0.06648309348356068, 0.10148512491116381, 0.07026509348855635, 0.2106753729412479, 0.12948860158741643, 0.1044816349268509, -0.09299907006231987, -0.09115244451749838, -0.2201764051686598, -0.145331492113912, -0.17268637690746613, 0.0038741761841504883, -0.0895562933010253, -0.10771367945663773, 0.35983465400463654, 0.22588015004043338, 0.1059447947319187, 0.12490660756654841, 0.431367341874604, 0.0015399842133130611, 0.08172133178717532, 0.18883043401495833, 0.1639020990214921, -0.0011158991498097278, 0.13641948773303963, -0.19363100367373204, 0.18017804627774647, 0.033777626397302064] |
1,802.07024 | A General Framework for Abstention Under Label Shift | In safety-critical applications of machine learning, it is often important to
abstain from making predictions on low confidence examples. Standard abstention
methods tend to be focused on optimizing top-k accuracy, but in many
applications, accuracy is not the metric of interest. Further, label shift (a
shift in class proportions between training time and prediction time) is
ubiquitous in practical settings, and existing abstention methods do not handle
label shift well. In this work, we present a general framework for abstention
that can be applied to optimize any metric of interest, that is adaptable to
label shift at test time, and that works out-of-the-box with any classifier
that can be calibrated. Our approach leverages recent reports that calibrated
probability estimates can be used as a proxy for the true class labels, thereby
allowing us to estimate the change in an arbitrary metric if an example were
abstained on. We present computationally efficient algorithms under our
framework to optimize sensitivity at a target specificity, auROC, and the
weighted Cohen's Kappa, and introduce a novel strong baseline based on JS
divergence from prior class probabilities. Experiments on synthetic,
biological, and clinical data support our findings.
| stat.ML cs.LG | in safetycritical applications of machine learning it is often important to abstain from making predictions on low confidence examples standard abstention methods tend to be focused on optimizing topk accuracy but in many applications accuracy is not the metric of interest further label shift a shift in class proportions between training time and prediction time is ubiquitous in practical settings and existing abstention methods do not handle label shift well in this work we present a general framework for abstention that can be applied to optimize any metric of interest that is adaptable to label shift at test time and that works outofthebox with any classifier that can be calibrated our approach leverages recent reports that calibrated probability estimates can be used as a proxy for the true class labels thereby allowing us to estimate the change in an arbitrary metric if an example were abstained on we present computationally efficient algorithms under our framework to optimize sensitivity at a target specificity auroc and the weighted cohens kappa and introduce a novel strong baseline based on js divergence from prior class probabilities experiments on synthetic biological and clinical data support our findings | [['in', 'safetycritical', 'applications', 'of', 'machine', 'learning', 'it', 'is', 'often', 'important', 'to', 'abstain', 'from', 'making', 'predictions', 'on', 'low', 'confidence', 'examples', 'standard', 'abstention', 'methods', 'tend', 'to', 'be', 'focused', 'on', 'optimizing', 'topk', 'accuracy', 'but', 'in', 'many', 'applications', 'accuracy', 'is', 'not', 'the', 'metric', 'of', 'interest', 'further', 'label', 'shift', 'a', 'shift', 'in', 'class', 'proportions', 'between', 'training', 'time', 'and', 'prediction', 'time', 'is', 'ubiquitous', 'in', 'practical', 'settings', 'and', 'existing', 'abstention', 'methods', 'do', 'not', 'handle', 'label', 'shift', 'well', 'in', 'this', 'work', 'we', 'present', 'a', 'general', 'framework', 'for', 'abstention', 'that', 'can', 'be', 'applied', 'to', 'optimize', 'any', 'metric', 'of', 'interest', 'that', 'is', 'adaptable', 'to', 'label', 'shift', 'at', 'test', 'time', 'and', 'that', 'works', 'outofthebox', 'with', 'any', 'classifier', 'that', 'can', 'be', 'calibrated', 'our', 'approach', 'leverages', 'recent', 'reports', 'that', 'calibrated', 'probability', 'estimates', 'can', 'be', 'used', 'as', 'a', 'proxy', 'for', 'the', 'true', 'class', 'labels', 'thereby', 'allowing', 'us', 'to', 'estimate', 'the', 'change', 'in', 'an', 'arbitrary', 'metric', 'if', 'an', 'example', 'were', 'abstained', 'on', 'we', 'present', 'computationally', 'efficient', 'algorithms', 'under', 'our', 'framework', 'to', 'optimize', 'sensitivity', 'at', 'a', 'target', 'specificity', 'auroc', 'and', 'the', 'weighted', 'cohens', 'kappa', 'and', 'introduce', 'a', 'novel', 'strong', 'baseline', 'based', 'on', 'js', 'divergence', 'from', 'prior', 'class', 'probabilities', 'experiments', 'on', 'synthetic', 'biological', 'and', 'clinical', 'data', 'support', 'our', 'findings']] | [-0.0034365875010149483, 0.04513755014074201, -0.06075159934134813, 0.09316197771479068, -0.13834951814210422, -0.18024432133268858, 0.08826624248566896, 0.47156551314508105, -0.22408564165780073, -0.3232417131349912, 0.08957962929490583, -0.2514255529815692, -0.1504901916081822, 0.24874139887410893, -0.15730377627507397, 0.08904200773783691, 0.11597352579762642, 0.06389883406343261, -0.05962868228052494, -0.2694315526083463, 0.27112714763906304, 0.06971572293456234, 0.34159958051000744, 0.05852099673862749, 0.08117351954234812, -0.009029049097184891, -0.019498284681851327, 0.0461940944380083, -0.08154444133650898, 0.15144180857298495, 0.33441473064817373, 0.20115348295654847, 0.32985432637478734, -0.36429734637287897, -0.24706992830018176, 0.14601219222632222, 0.09761262333986023, 0.11502311673961307, -0.030373976351961453, -0.2994356119312853, 0.08531796704631553, -0.15612224965839017, -0.036360683242658745, -0.15689926083365466, -0.006198204100541576, 0.0005657873997167338, -0.34138697774164106, 0.04139009511210415, 0.05341487193293626, 0.03902602353235658, -0.05566171788231406, -0.10746338129889571, 0.05485099297887231, 0.15234322333708405, 0.04862300807327344, 0.08052637625524667, 0.11748652188692496, -0.10004755421005268, -0.14701547240228904, 0.36710326643709423, -0.07626791942513582, -0.25023456275248557, 0.20389653813625389, -0.0590319258419319, -0.1623280986793661, 0.09513659903496816, 0.24960361669968853, 0.14298093108538323, -0.1400054979938965, 0.04091079431632899, -0.0033895947741276306, 0.19789292758662272, 0.03637049389522796, -0.009355383237390486, 0.16551554548012884, 0.17803551077949986, 0.07118869592229646, 0.09843668731673699, -0.09625349294135825, -0.05381472309559452, -0.25868221783903256, -0.12748814244505935, -0.19702793798697088, 0.007653971425902479, -0.09530428809638583, -0.14609475474907035, 0.3581977762033217, 0.24293980525845554, 0.2084824344940503, 0.10262790138964878, 0.31513938024220745, 0.06769855864740987, 0.08220033225461996, 0.06586491135656053, 0.19455288069356838, 0.02855885510713213, 0.0653450686596724, -0.14261856062474285, 0.15671393952603058, 0.014225196829602044] |
1,802.07025 | A geometry for the shell model | A geometric interpretation is given of matrix elements of a short-range
interaction between states that are written in terms of aligned neutron-proton
pairs.
| nucl-th | a geometric interpretation is given of matrix elements of a shortrange interaction between states that are written in terms of aligned neutronproton pairs | [['a', 'geometric', 'interpretation', 'is', 'given', 'of', 'matrix', 'elements', 'of', 'a', 'shortrange', 'interaction', 'between', 'states', 'that', 'are', 'written', 'in', 'terms', 'of', 'aligned', 'neutronproton', 'pairs']] | [-0.24130022489344297, 0.19206994431822197, -0.050956728301294475, 0.07127851525665788, -0.01264845008921364, -0.07665763856114252, -0.05452942589054937, 0.35430590030939685, -0.2552977605196445, -0.2540256261582608, -0.07405823844221784, -0.3385209424988083, -0.12420927490229192, 0.10169618026069972, 0.02215298378597135, -0.070988271344939, 0.11692229540937621, 0.06119507397322551, -0.1827231495054034, -0.1941395822264578, 0.3510823960456511, -0.04638101298200047, 0.20076456580958937, 0.11435276711784789, 0.10750665240313696, 0.05144833068808784, 0.008403720334172249, 0.02370225654348083, 0.03916907463186046, 0.18827694144008844, 0.2982710507197265, 0.08966639200630395, 0.15098043531179428, -0.4078732496532409, -0.10943758827836617, 0.09614625605552093, 0.1237257583188298, 0.09121003042420615, -0.03271029905780502, -0.2894309562347505, 0.06857419593016738, -0.215248951283486, -0.10288715196530455, -0.05790676509597055, 0.09209347289541493, 0.0662326470989248, -0.3369524758309126, 0.10283657139086205, 0.06344865594545136, 0.09333376286794311, -0.03723838016309816, -0.14967396527366794, -0.0036526249478692594, 0.1180502737507872, 0.031703845855941916, 0.03452511504292488, 0.0773764280197413, -0.13369814099986915, -0.10914135295087876, 0.4162982625319906, -0.03490766980077909, -0.2646287382863786, 0.1424805323957749, -0.06636844283101433, -0.04519772333214465, 0.1151112697046736, 0.1670874153547313, 0.06869009833620943, -0.16996552584611851, 0.07219083534310693, -0.07952244223459908, 0.18604439027283504, 0.0724361740741069, 0.10322037049690666, 0.24110819544622916, 0.09393252788678459, -0.009552178114814602, 0.10003905796000491, 0.03377476204996523, -0.13375002712659215, -0.3809819537336412, -0.1487058258574942, -0.26826283183839655, 0.014040544851804558, -0.05737243135176275, -0.20374986322839622, 0.3817881223462198, 0.0200223319394433, 0.27632414266143157, -0.0295477497857064, 0.20854020952854468, 0.08544657067598208, 0.05085606237306543, -0.012145980828158234, 0.2134070298836931, 0.2483863410256479, -0.0018082183340321417, -0.20143926825941258, 0.1265815664285227, 0.12396330949242997] |
1,802.07026 | The damped wave equation with unbounded damping | We analyze new phenomena arising in linear damped wave equations on unbounded
domains when the damping is allowed to become unbounded at infinity. We prove
the generation of a contraction semigroup, study the relation between the
spectra of the semigroup generator and the associated quadratic operator
function, the convergence of non-real eigenvalues in the asymptotic regime of
diverging damping on a subdomain, and we investigate the appearance of
essential spectrum on the negative real axis. We further show that the presence
of the latter prevents exponential estimates for the semigroup and turns out to
be a robust effect that cannot be easily canceled by adding a positive
potential. These analytic results are illustrated by examples.
| math.SP math-ph math.AP math.FA math.MP | we analyze new phenomena arising in linear damped wave equations on unbounded domains when the damping is allowed to become unbounded at infinity we prove the generation of a contraction semigroup study the relation between the spectra of the semigroup generator and the associated quadratic operator function the convergence of nonreal eigenvalues in the asymptotic regime of diverging damping on a subdomain and we investigate the appearance of essential spectrum on the negative real axis we further show that the presence of the latter prevents exponential estimates for the semigroup and turns out to be a robust effect that cannot be easily canceled by adding a positive potential these analytic results are illustrated by examples | [['we', 'analyze', 'new', 'phenomena', 'arising', 'in', 'linear', 'damped', 'wave', 'equations', 'on', 'unbounded', 'domains', 'when', 'the', 'damping', 'is', 'allowed', 'to', 'become', 'unbounded', 'at', 'infinity', 'we', 'prove', 'the', 'generation', 'of', 'a', 'contraction', 'semigroup', 'study', 'the', 'relation', 'between', 'the', 'spectra', 'of', 'the', 'semigroup', 'generator', 'and', 'the', 'associated', 'quadratic', 'operator', 'function', 'the', 'convergence', 'of', 'nonreal', 'eigenvalues', 'in', 'the', 'asymptotic', 'regime', 'of', 'diverging', 'damping', 'on', 'a', 'subdomain', 'and', 'we', 'investigate', 'the', 'appearance', 'of', 'essential', 'spectrum', 'on', 'the', 'negative', 'real', 'axis', 'we', 'further', 'show', 'that', 'the', 'presence', 'of', 'the', 'latter', 'prevents', 'exponential', 'estimates', 'for', 'the', 'semigroup', 'and', 'turns', 'out', 'to', 'be', 'a', 'robust', 'effect', 'that', 'can', 'not', 'be', 'easily', 'canceled', 'by', 'adding', 'a', 'positive', 'potential', 'these', 'analytic', 'results', 'are', 'illustrated', 'by', 'examples']] | [-0.15052786695867262, 0.11752588940174158, -0.07146628033890151, 0.09252001669615154, -0.10058126531155973, -0.11678317398964909, 0.019488924704813237, 0.31967220084484793, -0.3095880090901307, -0.2031248744320253, 0.15100408013376151, -0.31873044333067435, -0.1749733679984086, 0.23424419765521226, -0.014736127838941997, 0.041065388700346754, 0.0661011388453109, 0.04246963985697848, -0.07071124449179604, -0.18987254901580383, 0.37473645340651274, 0.03496890136137091, 0.22580497381718959, 0.08082722298297149, 0.09344869189151032, -0.03214719573413182, -0.037396266020770216, 0.01988181188413552, -0.12591558385523466, 0.06596943553023298, 0.21010519163522484, 0.04473254449200387, 0.2977833399564306, -0.4177170386698482, -0.18248158746403, 0.14695101415192516, 0.1747925323273601, 0.08787266144946475, -0.04622896980787306, -0.28738337485440846, 0.10923107206953914, -0.13176330042890563, -0.18050198334847287, -0.09817816533854809, 0.009439598263395903, 0.02747261475827866, -0.3030330831995876, 0.08190858721781265, 0.11828440725642803, 0.04108503069487754, -0.06761833622345123, -0.06669522577832485, -0.04726886829152575, 0.09050448141627793, 0.08036090113656146, -0.036407639323693605, 0.09169912419697382, -0.0824898543430428, -0.06998870751403015, 0.31637745398771144, -0.1053591536735345, -0.23735555775206665, 0.16000781262670805, -0.19518678564004247, -0.07473138092559409, 0.1249407685104886, 0.16902643843485718, 0.12112081094628907, -0.08478837239353793, 0.12907496316946546, -0.021088689469189407, 0.12293866605915386, 0.06640476028932708, 0.014598312711439514, 0.16227679443645998, 0.07481170124334187, 0.10617746031393521, 0.1917689256500533, -0.010915411480176584, -0.1023981632456055, -0.35113183980614976, -0.11525261652623785, -0.18161011275289388, 0.06945234534866578, -0.11438792974827108, -0.17923448946134285, 0.41426086274842766, 0.1278832233029193, 0.21414353356572222, 0.0714509538535414, 0.25162528908072873, 0.21302952501794387, 0.05110290287672702, 0.04899803386791158, 0.21505866999384657, 0.1352900153704405, 0.07032591373667699, -0.2774794571832272, 0.06165273580700159, 0.08376769089252399] |
1,802.07027 | How Quantum is a "Quantum Walk"? | We characterize quantumness of the so-called quantum walks (whose dynamics is
governed by quantum mechanics) by introducing two computable measures which are
stronger than the variance of the walker's position probability distribution.
The first measure is based on comparing probability distributions of a quantum
walk and all classical random walks (through the classical relative entropy of
the distributions), and it quantifies non-Gaussianity of the probability
distribution of the walk. Next, after assigning a density matrix to classical
walks, we introduce a more powerful measure by employing quantum relative
entropy. We show that this measure exceeds the first one by the quantum
coherence of the walk. There are walks labeled classical by the variance
whereas our measures identify some quantumness therein. As an application, we
study a model of quantum (energy) transport on a simple lattice, and compare
the behavior of its relative transport efficiencies with that of the
quantumness. Our measures help partly explain why in some quantum transport
phenomena a considerably high efficiency may appear---this is where quantumness
is appreciable.
| quant-ph | we characterize quantumness of the socalled quantum walks whose dynamics is governed by quantum mechanics by introducing two computable measures which are stronger than the variance of the walkers position probability distribution the first measure is based on comparing probability distributions of a quantum walk and all classical random walks through the classical relative entropy of the distributions and it quantifies nongaussianity of the probability distribution of the walk next after assigning a density matrix to classical walks we introduce a more powerful measure by employing quantum relative entropy we show that this measure exceeds the first one by the quantum coherence of the walk there are walks labeled classical by the variance whereas our measures identify some quantumness therein as an application we study a model of quantum energy transport on a simple lattice and compare the behavior of its relative transport efficiencies with that of the quantumness our measures help partly explain why in some quantum transport phenomena a considerably high efficiency may appearthis is where quantumness is appreciable | [['we', 'characterize', 'quantumness', 'of', 'the', 'socalled', 'quantum', 'walks', 'whose', 'dynamics', 'is', 'governed', 'by', 'quantum', 'mechanics', 'by', 'introducing', 'two', 'computable', 'measures', 'which', 'are', 'stronger', 'than', 'the', 'variance', 'of', 'the', 'walkers', 'position', 'probability', 'distribution', 'the', 'first', 'measure', 'is', 'based', 'on', 'comparing', 'probability', 'distributions', 'of', 'a', 'quantum', 'walk', 'and', 'all', 'classical', 'random', 'walks', 'through', 'the', 'classical', 'relative', 'entropy', 'of', 'the', 'distributions', 'and', 'it', 'quantifies', 'nongaussianity', 'of', 'the', 'probability', 'distribution', 'of', 'the', 'walk', 'next', 'after', 'assigning', 'a', 'density', 'matrix', 'to', 'classical', 'walks', 'we', 'introduce', 'a', 'more', 'powerful', 'measure', 'by', 'employing', 'quantum', 'relative', 'entropy', 'we', 'show', 'that', 'this', 'measure', 'exceeds', 'the', 'first', 'one', 'by', 'the', 'quantum', 'coherence', 'of', 'the', 'walk', 'there', 'are', 'walks', 'labeled', 'classical', 'by', 'the', 'variance', 'whereas', 'our', 'measures', 'identify', 'some', 'quantumness', 'therein', 'as', 'an', 'application', 'we', 'study', 'a', 'model', 'of', 'quantum', 'energy', 'transport', 'on', 'a', 'simple', 'lattice', 'and', 'compare', 'the', 'behavior', 'of', 'its', 'relative', 'transport', 'efficiencies', 'with', 'that', 'of', 'the', 'quantumness', 'our', 'measures', 'help', 'partly', 'explain', 'why', 'in', 'some', 'quantum', 'transport', 'phenomena', 'a', 'considerably', 'high', 'efficiency', 'may', 'appearthis', 'is', 'where', 'quantumness', 'is', 'appreciable']] | [-0.10318738759606967, 0.21125824036893956, -0.12971063103929859, 0.10205674303725515, 0.02061438556128775, -0.1510316335857568, 0.07604647905100137, 0.3379328865666836, -0.2678091636210767, -0.23697425721060725, 0.05094916688221131, -0.2919303019944992, -0.1539673397932964, 0.18927351600416986, -0.0859882337795516, 0.0903861668183501, 0.02778713129616032, 0.06397679668840305, -0.037694534725286284, -0.23020841556938898, 0.3233478012173409, 0.08243849313183421, 0.28608924360286814, 0.050010445895359704, 0.10931168355548765, 0.006660615857853962, -0.018811646237225973, 0.04514950083851901, -0.14611390905840424, 0.1284890746601111, 0.15608020249906687, 0.12390154402986256, 0.28723640746997986, -0.3658642032407006, -0.23457057360690414, 0.15032928693244418, 0.09278874012794106, 0.11990800967823975, -0.016597733789750605, -0.317245941358613, 0.041831637255449874, -0.1601336123830263, -0.09497425344511214, -0.06721059907342128, 0.015088939461966006, 0.04925301839592077, -0.187783747318484, 0.10946985354854001, 0.05853484670847909, 0.05119116590712328, 0.04500097525101809, -0.0678211216929189, 0.0257823737283722, 0.11808652379304956, -0.026316326052326252, -0.0088992515233024, 0.15464244721108797, -0.11799658022069356, -0.20690464431267472, 0.38570309759319177, -0.0637396855327629, -0.22741501126744734, 0.16136287744647185, -0.1876922221064611, -0.1043766353126855, 0.07026810667679062, 0.11475876117484611, 0.10505139108267966, -0.14829465643807765, 0.04856362477883054, -0.02995146131782918, 0.12885470165631446, 0.029098772879537434, 0.09143377122147912, 0.1938197951565077, 0.11101540849048491, 0.10334292688673874, 0.1735994448416937, -0.08431379637294258, -0.21355840250065453, -0.3059169297155581, -0.21266810012687193, -0.27264513321185474, 0.12546596515989095, -0.14150988007665882, -0.16180742814679416, 0.40636492790708767, 0.18302202281577523, 0.23167473332509153, 0.09176064123690934, 0.2571364513772665, 0.16716458606029921, -0.0014909971648369704, 0.06716867559589446, 0.18918615212692602, 0.1842027774723301, 0.02977251896787195, -0.23075613722869615, 0.13648224112506935, 0.06318209976725803] |
1,802.07028 | High-Dimensional Bayesian Optimization via Additive Models with
Overlapping Groups | Bayesian optimization (BO) is a popular technique for sequential black-box
function optimization, with applications including parameter tuning, robotics,
environmental monitoring, and more. One of the most important challenges in BO
is the development of algorithms that scale to high dimensions, which remains a
key open problem despite recent progress. In this paper, we consider the
approach of Kandasamy et al. (2015), in which the high-dimensional function
decomposes as a sum of lower-dimensional functions on subsets of the underlying
variables. In particular, we significantly generalize this approach by lifting
the assumption that the subsets are disjoint, and consider additive models with
arbitrary overlap among the subsets. By representing the dependencies via a
graph, we deduce an efficient message passing algorithm for optimizing the
acquisition function. In addition, we provide an algorithm for learning the
graph from samples based on Gibbs sampling. We empirically demonstrate the
effectiveness of our methods on both synthetic and real-world data.
| cs.LG stat.ML | bayesian optimization bo is a popular technique for sequential blackbox function optimization with applications including parameter tuning robotics environmental monitoring and more one of the most important challenges in bo is the development of algorithms that scale to high dimensions which remains a key open problem despite recent progress in this paper we consider the approach of kandasamy et al 2015 in which the highdimensional function decomposes as a sum of lowerdimensional functions on subsets of the underlying variables in particular we significantly generalize this approach by lifting the assumption that the subsets are disjoint and consider additive models with arbitrary overlap among the subsets by representing the dependencies via a graph we deduce an efficient message passing algorithm for optimizing the acquisition function in addition we provide an algorithm for learning the graph from samples based on gibbs sampling we empirically demonstrate the effectiveness of our methods on both synthetic and realworld data | [['bayesian', 'optimization', 'bo', 'is', 'a', 'popular', 'technique', 'for', 'sequential', 'blackbox', 'function', 'optimization', 'with', 'applications', 'including', 'parameter', 'tuning', 'robotics', 'environmental', 'monitoring', 'and', 'more', 'one', 'of', 'the', 'most', 'important', 'challenges', 'in', 'bo', 'is', 'the', 'development', 'of', 'algorithms', 'that', 'scale', 'to', 'high', 'dimensions', 'which', 'remains', 'a', 'key', 'open', 'problem', 'despite', 'recent', 'progress', 'in', 'this', 'paper', 'we', 'consider', 'the', 'approach', 'of', 'kandasamy', 'et', 'al', '2015', 'in', 'which', 'the', 'highdimensional', 'function', 'decomposes', 'as', 'a', 'sum', 'of', 'lowerdimensional', 'functions', 'on', 'subsets', 'of', 'the', 'underlying', 'variables', 'in', 'particular', 'we', 'significantly', 'generalize', 'this', 'approach', 'by', 'lifting', 'the', 'assumption', 'that', 'the', 'subsets', 'are', 'disjoint', 'and', 'consider', 'additive', 'models', 'with', 'arbitrary', 'overlap', 'among', 'the', 'subsets', 'by', 'representing', 'the', 'dependencies', 'via', 'a', 'graph', 'we', 'deduce', 'an', 'efficient', 'message', 'passing', 'algorithm', 'for', 'optimizing', 'the', 'acquisition', 'function', 'in', 'addition', 'we', 'provide', 'an', 'algorithm', 'for', 'learning', 'the', 'graph', 'from', 'samples', 'based', 'on', 'gibbs', 'sampling', 'we', 'empirically', 'demonstrate', 'the', 'effectiveness', 'of', 'our', 'methods', 'on', 'both', 'synthetic', 'and', 'realworld', 'data']] | [-0.07212854250161849, 0.029321964888556786, -0.06478048149230224, 0.04309998182942728, -0.06641991919680655, -0.10369291000503611, 0.05887728285077693, 0.40227029528226943, -0.2867475102524055, -0.33515620900789733, 0.11353290813306782, -0.22794569181217872, -0.20902971406134643, 0.21277793946784812, -0.09865967709837216, 0.08727000425524356, 0.08855106151820004, -0.023009171740978943, -0.06216376038667347, -0.2867113684433325, 0.331169436135414, 0.006899510631216811, 0.29740451074314195, 0.018292822946141197, 0.13185674740022726, 0.0775406881180356, -0.038902041045706964, 0.009868153302125971, -0.10973671849489336, 0.16282538986120784, 0.27239973125964656, 0.21779108852716525, 0.3350884236044601, -0.3829604456890616, -0.23445505668505928, 0.13854869318424495, 0.13291274688422813, 0.08791909203978025, -0.04852666527661419, -0.26375590971150953, 0.06799652520567179, -0.1363556081816167, -0.044248833937884924, -0.11582181331181488, 0.009152515371051896, 0.0241687850627516, -0.3098229067037245, 0.036722400274079345, 0.04239472570260624, 0.044507978604985524, -0.04539752644358215, -0.13739337631827825, 0.05074428046551569, 0.09890493407978543, 0.034369601481049866, 0.05224997754580668, 0.10606767235674544, -0.12403420248528482, -0.16938127668774022, 0.3452107190236135, -0.030778825026029695, -0.2125243581241819, 0.19884407983990024, -0.04230560568947868, -0.19687285404289503, 0.07885857267522967, 0.20873052525400584, 0.14947780864857524, -0.14120206823451564, 0.13334629931918032, -0.058088694947058116, 0.14413905145174086, 0.030293520582331854, 0.007032119741590766, 0.13592521881067812, 0.21158944583020184, 0.10681511056397787, 0.17553824760842246, -0.06741168853439777, -0.10532649280465595, -0.24818979235148275, -0.13035960035971608, -0.21033808015673966, -0.012172059614858408, -0.12272741317769056, -0.17349218163494165, 0.40387457173753094, 0.19764244417030993, 0.23177381782405465, 0.058445794211531225, 0.349377994449785, 0.09067840411859963, 0.03275336104130687, 0.11190305099604869, 0.1590693574640658, 0.08330943254457618, 0.04229767795640056, -0.1794737555833485, 0.09054584169606134, 0.05322110406485955] |
1,802.07029 | On a fully fuzzy framework for minimax mixed integer linear programming | In this work, we present a modeling framework for minimax mixed 0-1 fuzzy
linear problems. It is based on extending the usual rewriting of crisp minimax
problems via auxiliary variables to model the maximum of a finite set of fuzzy
linear functions. We establish that the considered problem can be equivalently
formulated as a multiple objective mixed integer programming problem. The
framework is applied to a fully fuzzy version of the capacitated center
facility location problem.
| math.OC | in this work we present a modeling framework for minimax mixed 01 fuzzy linear problems it is based on extending the usual rewriting of crisp minimax problems via auxiliary variables to model the maximum of a finite set of fuzzy linear functions we establish that the considered problem can be equivalently formulated as a multiple objective mixed integer programming problem the framework is applied to a fully fuzzy version of the capacitated center facility location problem | [['in', 'this', 'work', 'we', 'present', 'a', 'modeling', 'framework', 'for', 'minimax', 'mixed', '01', 'fuzzy', 'linear', 'problems', 'it', 'is', 'based', 'on', 'extending', 'the', 'usual', 'rewriting', 'of', 'crisp', 'minimax', 'problems', 'via', 'auxiliary', 'variables', 'to', 'model', 'the', 'maximum', 'of', 'a', 'finite', 'set', 'of', 'fuzzy', 'linear', 'functions', 'we', 'establish', 'that', 'the', 'considered', 'problem', 'can', 'be', 'equivalently', 'formulated', 'as', 'a', 'multiple', 'objective', 'mixed', 'integer', 'programming', 'problem', 'the', 'framework', 'is', 'applied', 'to', 'a', 'fully', 'fuzzy', 'version', 'of', 'the', 'capacitated', 'center', 'facility', 'location', 'problem']] | [-0.06882616880006696, 0.011897469454101826, -0.09240804108987122, 0.11967437881149205, -0.1428397319426662, -0.15539893128075882, 0.0723197169840875, 0.3248680392035136, -0.3681036008362609, -0.27938138830818626, 0.16979833107631603, -0.2164658408023809, -0.1379100871762555, 0.13750354811782017, -0.1258629219557502, 0.13979538211500958, 0.03308057582839147, 0.04061616723131584, -0.06206658825364062, -0.2549495860002935, 0.3111719662372611, -0.004546475167827387, 0.2450630060813733, 0.028390847616767707, 0.15669876941645175, 0.08019611980278951, 0.02479633367252781, 0.1317299559320274, -0.09841076776702769, 0.15883724134887175, 0.3415109978890733, 0.2113385968167629, 0.3796138492363848, -0.39578269211281286, -0.20408948980529154, 0.12539003477860733, 0.07373451217733275, 0.03916611056468498, 0.007692088745228064, -0.22770585073158145, 0.10421131504086875, -0.1619652827074261, -0.0905237173183674, 0.013310690238875779, -0.05678922038886843, -0.027760176392468184, -0.36724843060303675, 0.02366638328193834, 0.06034320527320042, 0.04604394285400447, -0.11949298329847424, -0.134507876906642, 0.07540977609919776, 0.03205252073607162, -0.04303556811340202, 0.04637275304106113, 0.06356370594738492, -0.06910981705694116, -0.19578504241316727, 0.36348043034147276, -0.04911251752147157, -0.29734955396576734, 0.12446542628611879, -0.022056237598390954, -0.1554376551648602, 0.05469874598968186, 0.2208876066276724, 0.22879082621320299, -0.17715194858120462, 0.1343442019209952, -0.1371578959699132, 0.1727754795911575, 0.03941081728982298, -0.02540876036877499, 0.18951484166379823, 0.19744648128184245, 0.14229630874347335, 0.24180101413175611, -0.02934021573501492, -0.1324266408276009, -0.3034543828543974, -0.08630632926513881, -0.15298474372646428, -0.04231081405458482, -0.09420559301016558, -0.2035853602175944, 0.344270229609193, 0.12348904055665787, 0.15489017811150438, 0.11832599993795156, 0.2857615589654367, 0.20427079511960314, 0.02462367411996973, 0.05469084039673602, 0.1697116650420388, 0.15258076560291411, 0.07770049687180865, -0.20754224597782778, 0.04136018942747461, 0.1624368918495939] |
1,802.0703 | Algebraic cycles on certain hyperkaehler fourfolds with an order $3$
non-symplectic automorphism II | Let $X$ be a hyperk\"ahler variety, and assume that $X$ admits a
non-symplectic automorphism $\sigma$ of order $k>{1\over 2}\dim X$. Bloch's
conjecture predicts that the quotient $X/<\sigma>$ should have trivial Chow
group of $0$-cycles. We verify this for Fano varieties of lines on certain
cubic fourfolds having an order $3$ non-symplectic automorphism.
| math.AG | let x be a hyperkahler variety and assume that x admits a nonsymplectic automorphism sigma of order k1over 2dim x blochs conjecture predicts that the quotient xsigma should have trivial chow group of 0cycles we verify this for fano varieties of lines on certain cubic fourfolds having an order 3 nonsymplectic automorphism | [['let', 'x', 'be', 'a', 'hyperkahler', 'variety', 'and', 'assume', 'that', 'x', 'admits', 'a', 'nonsymplectic', 'automorphism', 'sigma', 'of', 'order', 'k1over', '2dim', 'x', 'blochs', 'conjecture', 'predicts', 'that', 'the', 'quotient', 'xsigma', 'should', 'have', 'trivial', 'chow', 'group', 'of', '0cycles', 'we', 'verify', 'this', 'for', 'fano', 'varieties', 'of', 'lines', 'on', 'certain', 'cubic', 'fourfolds', 'having', 'an', 'order', '3', 'nonsymplectic', 'automorphism']] | [-0.30804656306281686, 0.01650355101922357, -0.1208828710950911, 0.04043124690248918, -0.13245091254178148, -0.2218187868487663, -0.026929054122704726, 0.3508976496612796, -0.27313332008914304, -0.18387951625831753, 0.05459742539992126, -0.269846447416617, -0.14720292242530447, 0.14867889678750473, -0.21434450270876718, -0.10241175032793902, -0.024189631074058034, 0.12033208546031696, -0.15870395608138865, -0.425747915242727, 0.41891505893391484, -0.1302087065907052, 0.18617336748418614, 0.06924643960351554, 0.16565317518185252, -0.03358163080142381, 0.11730361064054215, -0.046013392351317, -0.1699127575593593, 0.04573265552216281, 0.386414231123546, -0.03980342726572417, 0.09113205859186845, -0.3283237738695999, -0.19739694809630656, 0.2978461301312424, 0.12273845621026479, -0.05901107913814485, 0.0019515796201840902, -0.22081047103095514, 0.17260841907969174, -0.19087390282836098, -0.24462192301423505, -0.13450589374854013, 0.06260696548717813, -0.02840506428709397, -0.18863415581962237, -0.08881814724120957, 0.12949757358560768, 0.2235676630292661, 0.018267283923565768, -0.12663269831906432, -0.1862793340562628, -0.009773174103779288, -0.03199058090551542, 0.14029297197703272, 0.06321803309345761, -0.028089117863251325, -0.10565570011161841, 0.43072754775102323, -0.08189818685283311, -0.2139418714751418, 0.04207161518458564, -0.19981178279536274, -0.2197596374182747, 0.24751460172522527, 0.07825224278852917, 0.1951541415630625, 0.11715666595130013, 0.2672491895847578, -0.1915258072818128, 0.14223024916226187, 0.11394983542581591, -0.09101326891015141, 0.06606904656375544, 0.07204492058819877, 0.08457938809610474, 0.04176580603570283, -0.0031104742038923386, 0.09840561565943062, -0.38903884847576803, -0.19984099520101714, -0.02891429847715279, 0.3312708267521185, -0.18185101709605078, -0.13207595356596777, 0.34986042002072704, -0.019806414072473463, 0.14241332145264515, 0.12189236041516639, 0.13751314322535807, -0.010495473406850718, 0.009599754837556528, 0.01593317902790239, 0.06718348160099524, 0.26488009272501445, -0.1935385873523326, -0.13415565587078723, -0.03946332312009942, 0.2604800371023325] |
1,802.07031 | Interfacially driven transport in narrow channels | When colloids flow in a narrow channel, the transport efficiency is
controlled by the non-equilibrium interplay between colloid-wall interactions
and hydrodynamics. In this paper, a general, unifying description of colloidal
dispersion flow in a confined system is proposed. A momentum and mass balance
founded framework implementing the colloid-interface interactions is
introduced. The framework allows us to depict how interfacial forces drive the
particles and the liquid flows. The interfacially driven flow (osmotic or
Marangoni flows for repulsive or attractive colloid-wall interactions
respectively) can be directly simulated in two-dimensional domains. The ability
of the model to describe the physics of transport in a narrow channel is
discussed in detail. The hydrodynamic nature of osmosis and the associated
counter-pressure are mechanically related to the colloid-interface
interactions. The simulation shows an unexpected transition from axial plug to
pillar accumulation for colloidal accumulation at a channel bottleneck. This
transition has important consequences in transport efficiencies. Existing
limiting cases, such as diffusio-osmosis, are recovered from the simulations,
showing that the framework is physically well-founded. The model generalizes
the existing approaches and proves the hydrodynamic character of osmosis, which
cannot be fully described by purely thermodynamic considerations.
| physics.flu-dyn cond-mat.soft | when colloids flow in a narrow channel the transport efficiency is controlled by the nonequilibrium interplay between colloidwall interactions and hydrodynamics in this paper a general unifying description of colloidal dispersion flow in a confined system is proposed a momentum and mass balance founded framework implementing the colloidinterface interactions is introduced the framework allows us to depict how interfacial forces drive the particles and the liquid flows the interfacially driven flow osmotic or marangoni flows for repulsive or attractive colloidwall interactions respectively can be directly simulated in twodimensional domains the ability of the model to describe the physics of transport in a narrow channel is discussed in detail the hydrodynamic nature of osmosis and the associated counterpressure are mechanically related to the colloidinterface interactions the simulation shows an unexpected transition from axial plug to pillar accumulation for colloidal accumulation at a channel bottleneck this transition has important consequences in transport efficiencies existing limiting cases such as diffusioosmosis are recovered from the simulations showing that the framework is physically wellfounded the model generalizes the existing approaches and proves the hydrodynamic character of osmosis which cannot be fully described by purely thermodynamic considerations | [['when', 'colloids', 'flow', 'in', 'a', 'narrow', 'channel', 'the', 'transport', 'efficiency', 'is', 'controlled', 'by', 'the', 'nonequilibrium', 'interplay', 'between', 'colloidwall', 'interactions', 'and', 'hydrodynamics', 'in', 'this', 'paper', 'a', 'general', 'unifying', 'description', 'of', 'colloidal', 'dispersion', 'flow', 'in', 'a', 'confined', 'system', 'is', 'proposed', 'a', 'momentum', 'and', 'mass', 'balance', 'founded', 'framework', 'implementing', 'the', 'colloidinterface', 'interactions', 'is', 'introduced', 'the', 'framework', 'allows', 'us', 'to', 'depict', 'how', 'interfacial', 'forces', 'drive', 'the', 'particles', 'and', 'the', 'liquid', 'flows', 'the', 'interfacially', 'driven', 'flow', 'osmotic', 'or', 'marangoni', 'flows', 'for', 'repulsive', 'or', 'attractive', 'colloidwall', 'interactions', 'respectively', 'can', 'be', 'directly', 'simulated', 'in', 'twodimensional', 'domains', 'the', 'ability', 'of', 'the', 'model', 'to', 'describe', 'the', 'physics', 'of', 'transport', 'in', 'a', 'narrow', 'channel', 'is', 'discussed', 'in', 'detail', 'the', 'hydrodynamic', 'nature', 'of', 'osmosis', 'and', 'the', 'associated', 'counterpressure', 'are', 'mechanically', 'related', 'to', 'the', 'colloidinterface', 'interactions', 'the', 'simulation', 'shows', 'an', 'unexpected', 'transition', 'from', 'axial', 'plug', 'to', 'pillar', 'accumulation', 'for', 'colloidal', 'accumulation', 'at', 'a', 'channel', 'bottleneck', 'this', 'transition', 'has', 'important', 'consequences', 'in', 'transport', 'efficiencies', 'existing', 'limiting', 'cases', 'such', 'as', 'diffusioosmosis', 'are', 'recovered', 'from', 'the', 'simulations', 'showing', 'that', 'the', 'framework', 'is', 'physically', 'wellfounded', 'the', 'model', 'generalizes', 'the', 'existing', 'approaches', 'and', 'proves', 'the', 'hydrodynamic', 'character', 'of', 'osmosis', 'which', 'can', 'not', 'be', 'fully', 'described', 'by', 'purely', 'thermodynamic', 'considerations']] | [-0.13335737659508595, 0.15638476256155323, -0.11544586969709296, 0.05260284037588766, -0.026310665787605103, -0.148059760419225, -0.01003694277642353, 0.3272178699165427, -0.30909369429233874, -0.2808313231750314, 0.036555997938194196, -0.2602448492023086, -0.14469432323191236, 0.16337497069131737, -0.02371812826944127, 0.047501841820727954, 0.027094443306850735, -0.060438753543470135, -0.012634303094576657, -0.14068766791024245, 0.2733044352644356, 0.06360327408765443, 0.3041773169291749, 0.12712512204113105, 0.08178620306231703, -0.015710179057350615, 0.022040277637036827, 0.06555921325774723, -0.16725848708441995, 0.0739412938382884, 0.2294194951788692, -0.005966127791907638, 0.22311004165385384, -0.44910631750826724, -0.265468778636811, 0.04492453602021366, 0.17287675173853737, 0.13034520774211464, -0.07414189493404895, -0.2606028062242937, 0.017955704365400987, -0.19274075020075543, -0.11671596914190256, -0.08899636260199865, -0.006874292598998484, 0.04190226961797331, -0.26044555769961636, 0.13802446900081122, 0.09459664903746064, 0.03595205300856227, -0.05894558896049299, -0.04840090759898885, -0.036912692214779476, 0.13241960423101773, 0.04118115861698849, -0.0034789323011257998, 0.1980400972655237, -0.16515098463512837, -0.09064477112648699, 0.42676015983064036, -0.02133808806077771, -0.22028028868953697, 0.25058259568929014, -0.10801755869276046, -0.04175822316998771, 0.15098763305771476, 0.1772158746268057, 0.08254991316789528, -0.18463218681389057, 0.04559784813776938, -0.025714248355749685, 0.12987194128800184, 0.024993015078507597, -0.04539918074533489, 0.25096165604433435, 0.2166203489553785, 0.002892452800855002, 0.1471002296984807, -0.05724593763231193, -0.15978246866628373, -0.27322975635130814, -0.15421012034736728, -0.16143677753401184, 0.023495900960142535, -0.04815837818227919, -0.12482824085236643, 0.35295180297786527, 0.15518963517145798, 0.15662685252997713, 0.0015556265940783003, 0.28589172617042397, 0.07726743880084541, 0.05512504288829708, 0.06674588128953474, 0.28040209240377106, 0.15275704837646722, 0.12483590574508223, -0.2565777642885223, 0.08248778294781307, 0.06423602704793059] |
1,802.07032 | A remark on the Chow ring of Sicilian surfaces | We propose a "Bloch type" conjecture for surfaces: if the cup product map in
coherent cohomology is zero, then all intersections of homologically trivial
divisors should be zero in the Chow group of zero-cycles. We prove this
conjecture for Sicilian surfaces.
| math.AG | we propose a bloch type conjecture for surfaces if the cup product map in coherent cohomology is zero then all intersections of homologically trivial divisors should be zero in the chow group of zerocycles we prove this conjecture for sicilian surfaces | [['we', 'propose', 'a', 'bloch', 'type', 'conjecture', 'for', 'surfaces', 'if', 'the', 'cup', 'product', 'map', 'in', 'coherent', 'cohomology', 'is', 'zero', 'then', 'all', 'intersections', 'of', 'homologically', 'trivial', 'divisors', 'should', 'be', 'zero', 'in', 'the', 'chow', 'group', 'of', 'zerocycles', 'we', 'prove', 'this', 'conjecture', 'for', 'sicilian', 'surfaces']] | [-0.29369122721254826, 0.09557152062472773, -0.16596973196762363, 0.06138538650986625, -0.0757237407833156, -0.17934068577454948, -0.009046354745628267, 0.30265818390904403, -0.35350576806359174, -0.1253335296925975, 0.0943057817781753, -0.2411637636378589, -0.16877130796087952, 0.17279113974513077, -0.24157303547850106, -0.06469470538516961, 0.04220933828321172, 0.06150221320368895, -0.06525749874460261, -0.3748576666523771, 0.4564015719948745, -0.13669333438866021, 0.2613482708565709, 0.14865832621367966, 0.06057563587659743, 0.008723489690299442, 0.08185219597752864, -0.05900981554352656, -0.18326045799909568, 0.11190022206183796, 0.3822697261121215, 0.016956667955283347, 0.1725793063368012, -0.4075614098096039, -0.10524151064228357, 0.238169021223013, 0.11979313630954272, 0.044664127025298955, 0.033827945561625244, -0.2218994539594505, 0.14870660354542295, -0.17157316189713595, -0.2052115655118009, -0.09558371129650169, 0.05287281729326379, -0.029894206877343538, -0.17871382662163274, -0.019965620348002852, 0.0725244811577041, 0.18758003068406406, -0.09276835388708406, -0.06504783143357533, -0.11608802179079049, 0.08856027774376476, -0.0040558629112727035, 0.008986919800319322, 0.06703751550124186, -0.0669135575739258, -0.11579361624970305, 0.346032369836438, -0.08809758430040192, -0.21714663555527605, 0.03983376225138583, -0.20046511326530358, -0.1946828377137824, 0.10858013453643496, 0.021188859805101302, 0.23215076322780875, 0.05753846443826106, 0.18722898792475462, -0.1707853577894772, 0.02132107971644983, 0.14630042552584555, -0.07526447351385908, 0.17017501267808965, 0.030833536418291126, 0.15231759964329442, 0.09376659150882738, -0.04116698786071161, 0.03758215289790093, -0.3672834156853397, -0.31638883156474773, -0.12662858284566914, 0.22984850463434692, -0.06830085402854331, -0.19597352243869043, 0.3584337590671167, 0.033377771243089584, 0.16206818614609358, 0.16714140516137932, 0.2345177462188209, 0.015205951725564352, 0.019250209556847083, 0.08400675821367924, 0.14174905707832516, 0.20640002007073746, -0.10933713923867155, -0.07913185712858671, -0.034645094933760605, 0.2870323656626591] |
1,802.07033 | The constraint algebra in Smolins' $G\rightarrow 0$ limit of 4d
Euclidean Gravity | Smolin's generally covariant $G_{\mathrm{Newton}}\rightarrow0$ limit of 4d
Euclidean gravity is a useful toy model for the study of the constraint algebra
in Loop Quantum Gravity. In particular, the commutator between its Hamiltonian
constraints has a metric dependent structure function. While a prior LQG like
construction of non-trivial anomaly free constraint commutators for the model
exists, that work suffers from two defects. First, Smolin's remarks on the
inability of the quantum dynamics to generate propagation effects apply.
Second, the construction only yields the action of a single Hamiltonian
constraint together with the action of its commutator through a continuum limit
of corresponding discrete approximants; the continuum limit of a product of 2
or more constraints does not exist. Here, we incorporate changes in the quantum
dynamics through structural modifications in the choice of discrete
approximants to the quantum Hamiltonian constraint. The new structure is
motivated by that responsible for propagation in an LQG like quantization of
Paramaterized Field Theory and significantly alters the space of physical
states. We study the off shell constraint algebra of the model in the context
of these structural changes and show that the continuum limit action of
multiple products of Hamiltonian constraints is (a) supported on an appropriate
domain of states (b) yields anomaly free commutators between pairs of
Hamiltonian constraints and (c) is diffeomorphism covariant. Many of our
considerations seem robust enough to be applied to the setting of 4d Euclidean
gravity.
| gr-qc hep-th | smolins generally covariant g_mathrmnewtonrightarrow0 limit of 4d euclidean gravity is a useful toy model for the study of the constraint algebra in loop quantum gravity in particular the commutator between its hamiltonian constraints has a metric dependent structure function while a prior lqg like construction of nontrivial anomaly free constraint commutators for the model exists that work suffers from two defects first smolins remarks on the inability of the quantum dynamics to generate propagation effects apply second the construction only yields the action of a single hamiltonian constraint together with the action of its commutator through a continuum limit of corresponding discrete approximants the continuum limit of a product of 2 or more constraints does not exist here we incorporate changes in the quantum dynamics through structural modifications in the choice of discrete approximants to the quantum hamiltonian constraint the new structure is motivated by that responsible for propagation in an lqg like quantization of paramaterized field theory and significantly alters the space of physical states we study the off shell constraint algebra of the model in the context of these structural changes and show that the continuum limit action of multiple products of hamiltonian constraints is a supported on an appropriate domain of states b yields anomaly free commutators between pairs of hamiltonian constraints and c is diffeomorphism covariant many of our considerations seem robust enough to be applied to the setting of 4d euclidean gravity | [['smolins', 'generally', 'covariant', 'g_mathrmnewtonrightarrow0', 'limit', 'of', '4d', 'euclidean', 'gravity', 'is', 'a', 'useful', 'toy', 'model', 'for', 'the', 'study', 'of', 'the', 'constraint', 'algebra', 'in', 'loop', 'quantum', 'gravity', 'in', 'particular', 'the', 'commutator', 'between', 'its', 'hamiltonian', 'constraints', 'has', 'a', 'metric', 'dependent', 'structure', 'function', 'while', 'a', 'prior', 'lqg', 'like', 'construction', 'of', 'nontrivial', 'anomaly', 'free', 'constraint', 'commutators', 'for', 'the', 'model', 'exists', 'that', 'work', 'suffers', 'from', 'two', 'defects', 'first', 'smolins', 'remarks', 'on', 'the', 'inability', 'of', 'the', 'quantum', 'dynamics', 'to', 'generate', 'propagation', 'effects', 'apply', 'second', 'the', 'construction', 'only', 'yields', 'the', 'action', 'of', 'a', 'single', 'hamiltonian', 'constraint', 'together', 'with', 'the', 'action', 'of', 'its', 'commutator', 'through', 'a', 'continuum', 'limit', 'of', 'corresponding', 'discrete', 'approximants', 'the', 'continuum', 'limit', 'of', 'a', 'product', 'of', '2', 'or', 'more', 'constraints', 'does', 'not', 'exist', 'here', 'we', 'incorporate', 'changes', 'in', 'the', 'quantum', 'dynamics', 'through', 'structural', 'modifications', 'in', 'the', 'choice', 'of', 'discrete', 'approximants', 'to', 'the', 'quantum', 'hamiltonian', 'constraint', 'the', 'new', 'structure', 'is', 'motivated', 'by', 'that', 'responsible', 'for', 'propagation', 'in', 'an', 'lqg', 'like', 'quantization', 'of', 'paramaterized', 'field', 'theory', 'and', 'significantly', 'alters', 'the', 'space', 'of', 'physical', 'states', 'we', 'study', 'the', 'off', 'shell', 'constraint', 'algebra', 'of', 'the', 'model', 'in', 'the', 'context', 'of', 'these', 'structural', 'changes', 'and', 'show', 'that', 'the', 'continuum', 'limit', 'action', 'of', 'multiple', 'products', 'of', 'hamiltonian', 'constraints', 'is', 'a', 'supported', 'on', 'an', 'appropriate', 'domain', 'of', 'states', 'b', 'yields', 'anomaly', 'free', 'commutators', 'between', 'pairs', 'of', 'hamiltonian', 'constraints', 'and', 'c', 'is', 'diffeomorphism', 'covariant', 'many', 'of', 'our', 'considerations', 'seem', 'robust', 'enough', 'to', 'be', 'applied', 'to', 'the', 'setting', 'of', '4d', 'euclidean', 'gravity']] | [-0.15599737231870245, 0.1225930256311539, -0.11790376708998693, 0.07310912112697517, -0.09985442826784831, -0.11973010216074033, 0.03198127298156131, 0.3127366083524174, -0.27009413289340306, -0.28103717526428845, 0.0898670163876239, -0.25304580714269465, -0.16377325270865586, 0.1554244055404817, -0.06596585514094933, 0.034831978806385264, 0.05451548381874306, 0.06972795142594851, -0.12838901208429518, -0.19152682812655566, 0.3521929680092568, 0.05381698691349287, 0.24962915342016997, 0.04680904247837488, 0.10445498158342316, 0.029530333792119903, -0.0022397796076848724, 0.019219562241494837, -0.10148401628985239, 0.12334238019949703, 0.171460035586556, 0.0985110596264318, 0.21707003020436771, -0.44109707569971807, -0.2439279008389873, 0.07747258945078178, 0.11175460440217186, 0.11334954909842178, -0.00797437424101853, -0.2748672883055899, 0.037736716201618684, -0.15600687312356876, -0.11555894939978686, -0.07599244743064677, 0.005390474808074818, -0.059422414825333406, -0.2502391391085516, 0.06943079086131085, 0.09690352723617067, 0.023571748720576702, -0.08016824670495086, -0.06312014142809025, -0.044510399789541515, 0.12171516223081537, 0.041790127501156085, 0.05212491151819527, 0.13190411433372332, -0.13370732178638287, -0.1293395693942715, 0.4273800736478672, -0.07843888057020919, -0.24522131386654988, 0.14654414093919035, -0.13616331702002554, -0.17778950723399156, 0.08786142754991996, 0.12802957034259402, 0.12656323474602996, -0.13566648246280422, 0.18746256621054302, -0.01878356873782912, 0.13518816937487257, 0.03453281449974846, 0.06339768570713636, 0.1969738131570551, 0.10490829140733202, 0.08521727389449814, 0.12195810816848603, -0.023386292123054233, -0.15186737902399342, -0.3616228957990504, -0.1382537335623549, -0.16509509308587256, 0.07600497186951728, -0.10673550785521896, -0.1926168348971691, 0.3689126932334502, 0.1353733972646296, 0.17882516845997612, 0.04956431854595193, 0.22867237766208207, 0.12871451090115626, 0.07887390925390132, 0.031879556021984605, 0.2291433191187364, 0.17269702866807643, 0.016976700664568946, -0.2392929125402342, -0.007798007622329613, 0.09010579516535025] |
1,802.07034 | Memetic Graph Clustering | It is common knowledge that there is no single best strategy for graph
clustering, which justifies a plethora of existing approaches. In this paper,
we present a general memetic algorithm, VieClus, to tackle the graph clustering
problem. This algorithm can be adapted to optimize different objective
functions. A key component of our contribution are natural recombine operators
that employ ensemble clusterings as well as multi-level techniques. Lastly, we
combine these techniques with a scalable communication protocol, producing a
system that is able to compute high-quality solutions in a short amount of
time. We instantiate our scheme with local search for modularity and show that
our algorithm successfully improves or reproduces all entries of the 10th
DIMACS implementation~challenge under consideration using a small amount of
time.
| cs.NE cs.IR | it is common knowledge that there is no single best strategy for graph clustering which justifies a plethora of existing approaches in this paper we present a general memetic algorithm vieclus to tackle the graph clustering problem this algorithm can be adapted to optimize different objective functions a key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multilevel techniques lastly we combine these techniques with a scalable communication protocol producing a system that is able to compute highquality solutions in a short amount of time we instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th dimacs implementationchallenge under consideration using a small amount of time | [['it', 'is', 'common', 'knowledge', 'that', 'there', 'is', 'no', 'single', 'best', 'strategy', 'for', 'graph', 'clustering', 'which', 'justifies', 'a', 'plethora', 'of', 'existing', 'approaches', 'in', 'this', 'paper', 'we', 'present', 'a', 'general', 'memetic', 'algorithm', 'vieclus', 'to', 'tackle', 'the', 'graph', 'clustering', 'problem', 'this', 'algorithm', 'can', 'be', 'adapted', 'to', 'optimize', 'different', 'objective', 'functions', 'a', 'key', 'component', 'of', 'our', 'contribution', 'are', 'natural', 'recombine', 'operators', 'that', 'employ', 'ensemble', 'clusterings', 'as', 'well', 'as', 'multilevel', 'techniques', 'lastly', 'we', 'combine', 'these', 'techniques', 'with', 'a', 'scalable', 'communication', 'protocol', 'producing', 'a', 'system', 'that', 'is', 'able', 'to', 'compute', 'highquality', 'solutions', 'in', 'a', 'short', 'amount', 'of', 'time', 'we', 'instantiate', 'our', 'scheme', 'with', 'local', 'search', 'for', 'modularity', 'and', 'show', 'that', 'our', 'algorithm', 'successfully', 'improves', 'or', 'reproduces', 'all', 'entries', 'of', 'the', '10th', 'dimacs', 'implementationchallenge', 'under', 'consideration', 'using', 'a', 'small', 'amount', 'of', 'time']] | [-0.09161033357183139, 0.011433726394306717, -0.11877380025277777, 0.07198131303359731, -0.08519252702192502, -0.154445645751477, 0.06592855811009289, 0.4197599789718302, -0.2833188579955358, -0.350453544741239, 0.08180597786625045, -0.23309375916023709, -0.1914065857526725, 0.19022096775669028, -0.08706531694870655, 0.06942155689939977, 0.11476618205708247, 0.011747413331915329, -0.03152437292690563, -0.28269543581522955, 0.31221362417639514, 0.036907941036728946, 0.29181944268445176, 0.019596312571282883, 0.11584675589830017, -0.0062566800535149205, -0.03027549639298785, 0.03933539393270858, -0.0782213751030272, 0.1466656729353713, 0.28327582141089186, 0.22701847728160096, 0.3113464206472282, -0.39819705181914133, -0.19717898061953304, 0.14074775887789523, 0.1499698147825079, 0.1634259690536277, -0.06808689917528593, -0.2134147397113767, 0.1262376088520315, -0.1632818642424465, -0.07302956278928048, -0.13961261452546692, -0.03728039232196241, 0.031403095079055886, -0.30526431868746273, 0.016307324545866832, 0.05214974440622893, -0.027989232204703052, -0.033877254524306066, -0.11041094576447778, 0.08570498776644832, 0.1264427322667183, 0.004018676711428092, 0.06638755917651351, 0.09478164780733546, -0.06402956061368066, -0.16920988465379166, 0.37621101454596934, -0.07446625759650961, -0.19012893827980368, 0.18243066557660337, -0.026963659221442733, -0.19895491984150396, 0.12561139181952893, 0.19110858167154426, 0.15847221995529726, -0.16654594196385242, 0.04728279199699182, -0.07704291900438143, 0.21488230912359355, 0.024884796016130264, 0.023854428395672467, 0.1352614599121053, 0.2059944271814169, 0.12112796217263715, 0.15182869556280443, -0.03893851744753074, -0.08539561021361287, -0.255602311221807, -0.13808103573766, -0.21465967648673984, -0.024102515479496763, -0.08729543726561435, -0.16888409479884658, 0.4118316926023243, 0.22120202253610502, 0.21610938721692297, 0.10883211839766188, 0.35660948734579045, 0.07202200684743759, 0.09413162101347877, 0.1059738287391762, 0.15978791623194588, 0.04550303577547666, 0.09668470525402363, -0.1702082205613, 0.07689249424483414, 0.06550950087167746] |
1,802.07035 | Hairy black hole solutions in $U(1)$ gauge-invariant
scalar-vector-tensor theories | In $U(1)$ gauge-invariant scalar-vector-tensor theories with second-order
equations of motion, we study the properties of black holes (BH) on a static
and spherically symmetric background. In shift-symmetric theories invariant
under the shift of scalar $\phi \to \phi+c$, we show the existence of new hairy
BH solutions where a cubic-order scalar-vector interaction gives rise to a
scalar hair manifesting itself around the event horizon. In the presence of a
quartic-order interaction besides the cubic coupling, there are also regular BH
solutions endowed with scalar and vector hairs.
| gr-qc hep-th | in u1 gaugeinvariant scalarvectortensor theories with secondorder equations of motion we study the properties of black holes bh on a static and spherically symmetric background in shiftsymmetric theories invariant under the shift of scalar phi to phic we show the existence of new hairy bh solutions where a cubicorder scalarvector interaction gives rise to a scalar hair manifesting itself around the event horizon in the presence of a quarticorder interaction besides the cubic coupling there are also regular bh solutions endowed with scalar and vector hairs | [['in', 'u1', 'gaugeinvariant', 'scalarvectortensor', 'theories', 'with', 'secondorder', 'equations', 'of', 'motion', 'we', 'study', 'the', 'properties', 'of', 'black', 'holes', 'bh', 'on', 'a', 'static', 'and', 'spherically', 'symmetric', 'background', 'in', 'shiftsymmetric', 'theories', 'invariant', 'under', 'the', 'shift', 'of', 'scalar', 'phi', 'to', 'phic', 'we', 'show', 'the', 'existence', 'of', 'new', 'hairy', 'bh', 'solutions', 'where', 'a', 'cubicorder', 'scalarvector', 'interaction', 'gives', 'rise', 'to', 'a', 'scalar', 'hair', 'manifesting', 'itself', 'around', 'the', 'event', 'horizon', 'in', 'the', 'presence', 'of', 'a', 'quarticorder', 'interaction', 'besides', 'the', 'cubic', 'coupling', 'there', 'are', 'also', 'regular', 'bh', 'solutions', 'endowed', 'with', 'scalar', 'and', 'vector', 'hairs']] | [-0.22763740043913902, 0.1582052383496058, -0.05533906533166246, 0.10103487722212882, -0.12580946991544997, -0.17252906186636105, -0.06268262975784235, 0.2900182569919284, -0.1370119139183919, -0.2354508444645204, 0.0629558120326269, -0.3291320410492115, -0.1516977472848064, 0.1074899633761582, -0.00047977509107007536, -0.0005417656326709791, -0.03809055029198007, 0.1251833596981542, -0.1180967161036638, -0.18790335699829253, 0.3816295925332883, -0.025609328311348205, 0.18337527831453224, 0.021835935049619917, 0.138224512165369, 0.013498964546205, 0.05902170234489753, 0.080568729894409, -0.16336899050944592, 0.0492163103785864, 0.14897684776359563, 0.09462387530068152, 0.17143578499793832, -0.3733719375504311, -0.1924922715569305, 0.12138913671464421, 0.12004104051414098, 0.13749488145701835, -0.1393792195703163, -0.3288586131015489, 0.08848658830555546, -0.22473768938636018, -0.1641231436109127, -0.08081653769138854, 0.04842483320511704, -0.041367221014509195, -0.28182122838645524, 0.14494879403778319, 0.07190195050058064, -0.037580478817311136, -0.15524722694765863, 0.019472028350804086, -0.0683870648228845, 0.013091488113236982, 0.17132123350436518, 0.041980379962275716, 0.13121712401639238, -0.18078930100945886, -0.1237436980130909, 0.3674046099619117, -0.13519959717035987, -0.25484736242634787, 0.14847626571196976, -0.19688281349548095, -0.12019788886983554, 0.11280211285677154, 0.18139538976775352, 0.20728089657157314, -0.12036276213434893, 0.209709832789972, 0.0064926181194307495, 0.1655433309240115, 0.107574604603267, 0.06308274323034078, 0.357245261824235, 0.0571733299794412, 0.05030414612143474, 0.17296627796320027, 0.035547861604691415, -0.18128946734873883, -0.3763910017171225, -0.11504892864112937, -0.05879233723105646, 0.13363979513713614, -0.16805727153692968, -0.2462156329433932, 0.37465647326479123, 0.06820468067429787, 0.16452989438115512, 0.03259079658079806, 0.17883860448946085, 0.08136085652594649, 0.06127225917352493, 0.08398661927623284, 0.3054853248908076, 0.1932129077721647, 0.11941122614540332, -0.2361635272932607, -0.10224909404141092, 0.11018573419125967] |
1,802.07036 | The Habitability of our Evolving Galaxy | The notion of a Galactic Habitable Zone (GHZ), or regions of the Milky Way
galaxy that preferentially maintain the conditions to sustain complex life, has
recently gained attention due to the detection of numerous exoplanets and
advances made in understanding habitability on the Earth and other
environments. We discuss what a habitable environment means on large spatial
and temporal scales, which necessarily requires an approximated definition of
habitability to make an assessment of the astrophysical conditions that may
sustain complex life. We discuss a few key exoplanet findings that directly
relate to estimating the distribution of Earth-size planets in the Milky Way.
With a broad notion of habitability defined and major observable properties of
the Milky Way described, we compare selected literature on the GHZ and
postulate why the models yield differing predictions of the most habitable
regions at the present day, which include: (1) the majority of the galactic
disk; (2) an annular ring between 7-9 kpc, and (3) the galactic outskirts. We
briefly discuss the habitability of other galaxies as influenced by these
studies. We note that the dangers to biospheres in the Galaxy taken into
account in these studies may be incomplete and we discuss the possible role of
Gamma-Ray Bursts and other dangers to life in the Milky Way. We speculate how
changing astrophysical properties may affect the GHZ over time, including
before the Earth formed, and describe how new observations and other related
research may fit into the bigger picture of the habitability of the Galaxy.
| astro-ph.EP | the notion of a galactic habitable zone ghz or regions of the milky way galaxy that preferentially maintain the conditions to sustain complex life has recently gained attention due to the detection of numerous exoplanets and advances made in understanding habitability on the earth and other environments we discuss what a habitable environment means on large spatial and temporal scales which necessarily requires an approximated definition of habitability to make an assessment of the astrophysical conditions that may sustain complex life we discuss a few key exoplanet findings that directly relate to estimating the distribution of earthsize planets in the milky way with a broad notion of habitability defined and major observable properties of the milky way described we compare selected literature on the ghz and postulate why the models yield differing predictions of the most habitable regions at the present day which include 1 the majority of the galactic disk 2 an annular ring between 79 kpc and 3 the galactic outskirts we briefly discuss the habitability of other galaxies as influenced by these studies we note that the dangers to biospheres in the galaxy taken into account in these studies may be incomplete and we discuss the possible role of gammaray bursts and other dangers to life in the milky way we speculate how changing astrophysical properties may affect the ghz over time including before the earth formed and describe how new observations and other related research may fit into the bigger picture of the habitability of the galaxy | [['the', 'notion', 'of', 'a', 'galactic', 'habitable', 'zone', 'ghz', 'or', 'regions', 'of', 'the', 'milky', 'way', 'galaxy', 'that', 'preferentially', 'maintain', 'the', 'conditions', 'to', 'sustain', 'complex', 'life', 'has', 'recently', 'gained', 'attention', 'due', 'to', 'the', 'detection', 'of', 'numerous', 'exoplanets', 'and', 'advances', 'made', 'in', 'understanding', 'habitability', 'on', 'the', 'earth', 'and', 'other', 'environments', 'we', 'discuss', 'what', 'a', 'habitable', 'environment', 'means', 'on', 'large', 'spatial', 'and', 'temporal', 'scales', 'which', 'necessarily', 'requires', 'an', 'approximated', 'definition', 'of', 'habitability', 'to', 'make', 'an', 'assessment', 'of', 'the', 'astrophysical', 'conditions', 'that', 'may', 'sustain', 'complex', 'life', 'we', 'discuss', 'a', 'few', 'key', 'exoplanet', 'findings', 'that', 'directly', 'relate', 'to', 'estimating', 'the', 'distribution', 'of', 'earthsize', 'planets', 'in', 'the', 'milky', 'way', 'with', 'a', 'broad', 'notion', 'of', 'habitability', 'defined', 'and', 'major', 'observable', 'properties', 'of', 'the', 'milky', 'way', 'described', 'we', 'compare', 'selected', 'literature', 'on', 'the', 'ghz', 'and', 'postulate', 'why', 'the', 'models', 'yield', 'differing', 'predictions', 'of', 'the', 'most', 'habitable', 'regions', 'at', 'the', 'present', 'day', 'which', 'include', '1', 'the', 'majority', 'of', 'the', 'galactic', 'disk', '2', 'an', 'annular', 'ring', 'between', '79', 'kpc', 'and', '3', 'the', 'galactic', 'outskirts', 'we', 'briefly', 'discuss', 'the', 'habitability', 'of', 'other', 'galaxies', 'as', 'influenced', 'by', 'these', 'studies', 'we', 'note', 'that', 'the', 'dangers', 'to', 'biospheres', 'in', 'the', 'galaxy', 'taken', 'into', 'account', 'in', 'these', 'studies', 'may', 'be', 'incomplete', 'and', 'we', 'discuss', 'the', 'possible', 'role', 'of', 'gammaray', 'bursts', 'and', 'other', 'dangers', 'to', 'life', 'in', 'the', 'milky', 'way', 'we', 'speculate', 'how', 'changing', 'astrophysical', 'properties', 'may', 'affect', 'the', 'ghz', 'over', 'time', 'including', 'before', 'the', 'earth', 'formed', 'and', 'describe', 'how', 'new', 'observations', 'and', 'other', 'related', 'research', 'may', 'fit', 'into', 'the', 'bigger', 'picture', 'of', 'the', 'habitability', 'of', 'the', 'galaxy']] | [-0.08928522173154346, 0.11693993982165797, -0.06157931745000391, 0.09699025668646302, -0.131923756426742, -0.033098728498035815, 0.061016568408507214, 0.37869753379679, -0.21038556726421212, -0.34269104262005046, 0.07345598688918682, -0.2470170386985271, -0.12078017152871832, 0.2276399674634282, -0.07341648382413019, -0.021539096185516388, 0.06435895234483677, -0.0402278862021626, -0.037048327052210686, -0.2695926533352428, 0.3088287120393711, 0.10214947511634949, 0.1470722288776382, 0.03540989981112683, 0.0321873286678697, -0.07772670074020961, -0.09109764556730708, -0.046130234781890156, -0.18062615149389616, 0.09127506614473474, 0.2770369920424174, 0.1958327418155189, 0.26827098798763704, -0.45742179939905514, -0.2550133141017411, 0.11003242044181348, 0.1713381353914144, 0.022361774701602846, -0.05435094051666008, -0.2930645132567214, 0.06523560957873678, -0.18579421377002422, -0.20214155819118618, 0.0057045017959052825, 0.04503369753052336, 0.005426471948807325, -0.1592515345177691, 0.048699208668830145, 0.0647851014964327, 0.07825746986758988, -0.12745468835049564, -0.11871415861618828, -0.022052529175205535, 0.13878320973919356, 0.044094179690151336, 0.006717245908457771, 0.22470190331517936, -0.1280026788738894, -0.059549148249452885, 0.4402558754561877, -0.04690489481923085, -0.07084530625961706, 0.25145322983839596, -0.22303566660182886, -0.16496663612862714, 0.03927935958205466, 0.1927924318539639, 0.10041090587257924, -0.1417167871259153, 0.015149464326859888, -0.015916988712761447, 0.1327609261720482, 0.06097060372492677, 0.0774556316244133, 0.34232169177858124, 0.13294802829660327, 0.08256446716917838, 0.0736408806139273, -0.16291096552824266, -0.09948005308179125, -0.2338879502385825, -0.14647375000269705, -0.11653831368868807, 0.05679373855728552, -0.0810552637557271, -0.12093381079904497, 0.40082396566496786, 0.20440067533418477, 0.21529929431255507, -0.0017685074483478568, 0.2845527111215005, 0.03799156787764908, 0.09883095766510443, 0.06664992354632136, 0.29627719263275304, 0.11237521804739309, 0.05911377111433141, -0.20745343525719595, 0.13017847918834818, -0.04299201139905657] |
1,802.07037 | Surface and interfacial tensions of Hofmeister electrolytes | We present a theory that is able to account quantitatively for the surface
and interfacial tensions of different electrolyte solutions. It is found that
near the interface, ions can be separated into two classes: the kosmotropes and
the chaotropes. While the kosmotropes remain hydrated near the interface and
are repelled from it, the chaotropes loose their hydration sheath and become
adsorbed to the surface. The anionic adsorption is strongly correlated with the
Jones-Dole viscosity B-coefficient. Both hydration and polarizability must be
taken into account to obtain a quantitative agreement with the experiments. To
calculate the excess interfacial tension of the oil-electrolyte interface, the
dispersion interactions must also be included. The theory can also be used to
calculate the surface and the interfacial tensions of acid solutions,
predicting a strong surface adsorption of hydronium ion.
| cond-mat.soft | we present a theory that is able to account quantitatively for the surface and interfacial tensions of different electrolyte solutions it is found that near the interface ions can be separated into two classes the kosmotropes and the chaotropes while the kosmotropes remain hydrated near the interface and are repelled from it the chaotropes loose their hydration sheath and become adsorbed to the surface the anionic adsorption is strongly correlated with the jonesdole viscosity bcoefficient both hydration and polarizability must be taken into account to obtain a quantitative agreement with the experiments to calculate the excess interfacial tension of the oilelectrolyte interface the dispersion interactions must also be included the theory can also be used to calculate the surface and the interfacial tensions of acid solutions predicting a strong surface adsorption of hydronium ion | [['we', 'present', 'a', 'theory', 'that', 'is', 'able', 'to', 'account', 'quantitatively', 'for', 'the', 'surface', 'and', 'interfacial', 'tensions', 'of', 'different', 'electrolyte', 'solutions', 'it', 'is', 'found', 'that', 'near', 'the', 'interface', 'ions', 'can', 'be', 'separated', 'into', 'two', 'classes', 'the', 'kosmotropes', 'and', 'the', 'chaotropes', 'while', 'the', 'kosmotropes', 'remain', 'hydrated', 'near', 'the', 'interface', 'and', 'are', 'repelled', 'from', 'it', 'the', 'chaotropes', 'loose', 'their', 'hydration', 'sheath', 'and', 'become', 'adsorbed', 'to', 'the', 'surface', 'the', 'anionic', 'adsorption', 'is', 'strongly', 'correlated', 'with', 'the', 'jonesdole', 'viscosity', 'bcoefficient', 'both', 'hydration', 'and', 'polarizability', 'must', 'be', 'taken', 'into', 'account', 'to', 'obtain', 'a', 'quantitative', 'agreement', 'with', 'the', 'experiments', 'to', 'calculate', 'the', 'excess', 'interfacial', 'tension', 'of', 'the', 'oilelectrolyte', 'interface', 'the', 'dispersion', 'interactions', 'must', 'also', 'be', 'included', 'the', 'theory', 'can', 'also', 'be', 'used', 'to', 'calculate', 'the', 'surface', 'and', 'the', 'interfacial', 'tensions', 'of', 'acid', 'solutions', 'predicting', 'a', 'strong', 'surface', 'adsorption', 'of', 'hydronium', 'ion']] | [-0.08611233729196895, 0.18046905189276413, -0.09833664887390428, 0.07786152204341094, -0.011874106148944089, -0.17504323212100767, 0.004814692196975413, 0.36469061025663424, -0.27033183886144396, -0.30149915465853994, 0.03128550246469956, -0.3412160041262361, -0.09627802663699801, 0.12481230000188027, 0.02924581089134055, -0.022201921962397664, 0.03945074604624616, -0.04384764348317806, -0.02421156314544772, -0.18549915799289884, 0.2339740237291146, 0.04660735726776652, 0.25081511617014957, 0.22714031681320385, 0.024617329719511413, -0.0583282347831567, 0.07214725106478409, 0.11611552682838269, -0.1868311945998672, 0.14760052784927247, 0.2602519799387993, -0.04334580562868737, 0.16562681861529896, -0.5104295923199532, -0.22716816543440396, 0.026945531574827163, 0.12829705196585073, 0.14187281199772947, -0.05097217525922714, -0.2654459960198492, 0.05235896781598974, -0.10427815457753473, -0.0935248205844397, -0.04328578050227318, -0.005397404488036059, 0.0397908148540471, -0.22214723823073887, 0.10205653161151838, 0.008799960242437297, 0.002199306523889527, -0.1597265985853886, -0.1398725071991969, -0.13941885085594385, 0.15664033475857145, 0.114980037504443, 0.02995999501773009, 0.22242574605222484, -0.09530885529851443, 0.035299050968308425, 0.41065407107423124, -0.05993137310462115, -0.1965080336317476, 0.2460184377667151, -0.15438048480274646, -0.052913221064954996, 0.20095763258159832, 0.12644580683033718, 0.08405836743015543, -0.1625257371189563, 0.04400233996601397, 0.014741358615955184, 0.19820443731947662, 0.0879878580720773, -0.03680169485782709, 0.2613492671932493, 0.13846205100347114, 0.02807324626167914, 0.12703739152356888, -0.10877127843187716, -0.05450356367772403, -0.24921038949203894, -0.21901036314386174, -0.14314805043999568, -0.026150595995464494, -0.07162758790935159, -0.192033194131533, 0.33472504091759375, 0.10607491014175173, 0.1420051581768977, 0.02013094257125701, 0.22085107678610524, 0.074913903853779, 0.06468814666579037, 0.04556895218110342, 0.27535950648773433, 0.13108628319534368, 0.06604461839835726, -0.2911164614781597, 0.13608780107635976, 0.03696169070829462] |
1,802.07038 | Higher-Dimensional Timed Automata | We introduce a new formalism of higher-dimensional timed automata, based on
van Glabbeek's higher-dimensional automata and Alur's timed automata. We prove
that their reachability is PSPACE-complete and can be decided using zone-based
algorithms. We also show how to use tensor products to combat state-space
explosion and how to extend the setting to higher-dimensional hybrid automata.
| cs.LO cs.SY | we introduce a new formalism of higherdimensional timed automata based on van glabbeeks higherdimensional automata and alurs timed automata we prove that their reachability is pspacecomplete and can be decided using zonebased algorithms we also show how to use tensor products to combat statespace explosion and how to extend the setting to higherdimensional hybrid automata | [['we', 'introduce', 'a', 'new', 'formalism', 'of', 'higherdimensional', 'timed', 'automata', 'based', 'on', 'van', 'glabbeeks', 'higherdimensional', 'automata', 'and', 'alurs', 'timed', 'automata', 'we', 'prove', 'that', 'their', 'reachability', 'is', 'pspacecomplete', 'and', 'can', 'be', 'decided', 'using', 'zonebased', 'algorithms', 'we', 'also', 'show', 'how', 'to', 'use', 'tensor', 'products', 'to', 'combat', 'statespace', 'explosion', 'and', 'how', 'to', 'extend', 'the', 'setting', 'to', 'higherdimensional', 'hybrid', 'automata']] | [-0.0724916546693388, 0.13093490931996196, -0.05504986267747744, 0.19663231772478265, -0.14568857651836467, -0.22105277262030626, 0.11561890308446479, 0.40345172541883756, -0.3293635741157352, -0.21583484454115606, 0.09013397026069041, -0.17878717967783506, -0.20768566327696703, 0.1730402263830293, -0.187373860950037, 0.0881869734950223, 0.07198921106052848, 0.0070253594093165304, -0.048310196426925515, -0.2770255443086531, 0.351696812857452, 0.027284068775908003, 0.19053631367267304, 0.016790408851965418, 0.02758727271882993, 0.040763735200085166, 0.025744996683777503, 0.10683822997336118, -0.12525986846306314, 0.13622747266770535, 0.3276585365584085, 0.27595877653110845, 0.23380605925647718, -0.49733625946320453, -0.16596398110729907, 0.2133117661336964, 0.14736836538913678, 0.17978348854911635, 0.05412158133013982, -0.34161396602274113, 0.09527657485900903, -0.27583975351925166, -0.03646917499267971, -0.15962825631195643, -0.010186131024416888, 0.051192835087554074, -0.18813093055812818, -0.07889195228103144, 0.14550367328074743, -0.0034415863876072865, -0.03782448058350468, -0.04172509699567871, 0.0073009451745816, 0.0573462113597483, -0.0747534002414641, -0.10069073235862097, 0.0904791809460324, 0.032286564274778905, -0.3168111306457025, 0.3597258931061007, -0.07939349559030302, -0.19656442842508867, 0.20205902718095425, -0.0179106644969785, -0.1997452788054943, 0.02650037602925638, 0.21722785200712816, 0.13962510170169035, -0.12402236651418344, 0.11805163000222682, -0.08699052791409898, 0.2272476133591724, 0.10779485688105507, 0.021812607086140592, 0.11657952106083339, 0.22368688712704857, 0.06251821884850287, 0.24862558242451963, 0.04760471861238398, -0.1197965465802348, -0.20270445376177723, -0.1506324037641121, -0.07905211496465611, 0.04686765045911636, -0.004819185278907788, -0.1980190468284319, 0.32583332877114135, 0.2565709147514459, 0.0543331907510775, 0.263422261132806, 0.28770203884462564, 0.1152084406887023, 0.02459375034437849, 0.08817012248701363, 0.13076475078573907, 0.16997862236468858, 0.13967723702519852, -0.1938623606034045, 0.0275206195348698, 0.2119949482961224] |
1,802.07039 | A multicriteria selection system based on player performance. Case
study: The Spanish ACB Basketball League | In this paper, we describe an approach to rank sport players based on their
efficiency. Although is extremely useful to analyze the performance of team
games there is no unanimity on the use of a single index to perform such a
ranking. We propose a method to summarize the huge amount of information
collected at different aspects of a sport team which is almost daily publicly
available. The tool will allow agents involved in a player's negotiation to
show the strengths (and weaknesses) of the player with respect to other
players. The approach is based on applying a multicriteria outranking
methodology using as alternatives the potential players and criteria different
efficiency indices. A novel automatic parameter tuning approach is detailed
that will allow coaches and sports managers to design templates and sports
strategies that improve the efficiency of their teams. We report the results
performed over the available information on the ACB Basketball League, and we
show how it can be easily implemented and interpreted in practice by
decision-makers non familiar with the mathematical side of the methodology.
| math.OC stat.AP | in this paper we describe an approach to rank sport players based on their efficiency although is extremely useful to analyze the performance of team games there is no unanimity on the use of a single index to perform such a ranking we propose a method to summarize the huge amount of information collected at different aspects of a sport team which is almost daily publicly available the tool will allow agents involved in a players negotiation to show the strengths and weaknesses of the player with respect to other players the approach is based on applying a multicriteria outranking methodology using as alternatives the potential players and criteria different efficiency indices a novel automatic parameter tuning approach is detailed that will allow coaches and sports managers to design templates and sports strategies that improve the efficiency of their teams we report the results performed over the available information on the acb basketball league and we show how it can be easily implemented and interpreted in practice by decisionmakers non familiar with the mathematical side of the methodology | [['in', 'this', 'paper', 'we', 'describe', 'an', 'approach', 'to', 'rank', 'sport', 'players', 'based', 'on', 'their', 'efficiency', 'although', 'is', 'extremely', 'useful', 'to', 'analyze', 'the', 'performance', 'of', 'team', 'games', 'there', 'is', 'no', 'unanimity', 'on', 'the', 'use', 'of', 'a', 'single', 'index', 'to', 'perform', 'such', 'a', 'ranking', 'we', 'propose', 'a', 'method', 'to', 'summarize', 'the', 'huge', 'amount', 'of', 'information', 'collected', 'at', 'different', 'aspects', 'of', 'a', 'sport', 'team', 'which', 'is', 'almost', 'daily', 'publicly', 'available', 'the', 'tool', 'will', 'allow', 'agents', 'involved', 'in', 'a', 'players', 'negotiation', 'to', 'show', 'the', 'strengths', 'and', 'weaknesses', 'of', 'the', 'player', 'with', 'respect', 'to', 'other', 'players', 'the', 'approach', 'is', 'based', 'on', 'applying', 'a', 'multicriteria', 'outranking', 'methodology', 'using', 'as', 'alternatives', 'the', 'potential', 'players', 'and', 'criteria', 'different', 'efficiency', 'indices', 'a', 'novel', 'automatic', 'parameter', 'tuning', 'approach', 'is', 'detailed', 'that', 'will', 'allow', 'coaches', 'and', 'sports', 'managers', 'to', 'design', 'templates', 'and', 'sports', 'strategies', 'that', 'improve', 'the', 'efficiency', 'of', 'their', 'teams', 'we', 'report', 'the', 'results', 'performed', 'over', 'the', 'available', 'information', 'on', 'the', 'acb', 'basketball', 'league', 'and', 'we', 'show', 'how', 'it', 'can', 'be', 'easily', 'implemented', 'and', 'interpreted', 'in', 'practice', 'by', 'decisionmakers', 'non', 'familiar', 'with', 'the', 'mathematical', 'side', 'of', 'the', 'methodology']] | [-0.05115931454700617, 0.0042202499888221254, -0.13756706201199317, 0.07026486190852155, -0.12579019371618966, -0.15755962786327504, 0.1042020126282541, 0.45232378091307335, -0.2140391059429123, -0.34139847858930583, 0.10383194003560256, -0.27795306765840627, -0.16386571869756397, 0.19441870526179117, -0.1281823006960867, 0.019503156188875437, 0.10978528602425469, 0.05206510979483386, 0.02733297810384224, -0.30681384701721287, 0.306668126905923, 0.06168925192951371, 0.30201886803581474, 0.05315009649748799, 0.09189511585085956, 0.014995284548573446, -0.07153534098120218, 0.043943588250431785, -0.13233354989724727, 0.14735593172732028, 0.3128075010988213, 0.21354081186601956, 0.3653935346271047, -0.3950589820664125, -0.13005967246070294, 0.11486352479158576, 0.08732879311997402, 0.07135449277872764, -0.011478929427253563, -0.2889620494202114, 0.0688660042046496, -0.21224689283774476, -0.07700303589841456, -0.11868079254152568, -0.029379570765454804, 0.020211265636921934, -0.29045196290368613, -0.030197959203270442, 0.0030435832250690653, 0.07939181136349321, -0.007183904225906629, -0.13544587276122544, 0.0016751052057004292, 0.21248097150335402, 0.055662303455330936, -0.020436702791883955, 0.1476742008601556, -0.13202257332355413, -0.20259723306654462, 0.39576500933617353, -0.04214400578332081, -0.18123960226062644, 0.19920617346769576, -0.06096169613305024, -0.1332827564224266, 0.04721083532589791, 0.21844533803673943, 0.13815890211010942, -0.1554102569483639, 0.0075937576828723295, -0.018942951643316264, 0.21613819944918197, 0.024326162200860594, -0.0027716075890341753, 0.18184397935872543, 0.1963697426515537, 0.0854870827981072, 0.11701423734828066, -0.025919603696616177, -0.10770955828824237, -0.243205043529108, -0.13244309792363115, -0.14013291634436112, -0.018855647733330393, -0.07187106801158345, -0.12862198790953902, 0.41157358290897056, 0.21591436698917676, 0.11167441289989655, 0.039147576629812046, 0.3242904799990356, 0.03789136341048321, 0.059223579306081374, 0.04536030157416891, 0.21819182124323724, -0.0012274369521568832, 0.13960721462983325, -0.18845970883672492, 0.10511609460122548, 0.01407154050022573] |
1,802.0704 | Scale Free Bounds on the Amplification of Disturbances in Mass Chains | We give a method for designing a mechanical impedance to suppress the
propagation of disturbances along a chain of masses. The key feature of our
method is that it is scale free. This means that it can be used to give a
single, fixed, design, with provable performance guarantees in mass chains of
any length. We illustrate the approach by designing a bidirectional control law
in a vehicle platoon in a manner that is independent of the number of vehicles
in the platoon.
| math.OC | we give a method for designing a mechanical impedance to suppress the propagation of disturbances along a chain of masses the key feature of our method is that it is scale free this means that it can be used to give a single fixed design with provable performance guarantees in mass chains of any length we illustrate the approach by designing a bidirectional control law in a vehicle platoon in a manner that is independent of the number of vehicles in the platoon | [['we', 'give', 'a', 'method', 'for', 'designing', 'a', 'mechanical', 'impedance', 'to', 'suppress', 'the', 'propagation', 'of', 'disturbances', 'along', 'a', 'chain', 'of', 'masses', 'the', 'key', 'feature', 'of', 'our', 'method', 'is', 'that', 'it', 'is', 'scale', 'free', 'this', 'means', 'that', 'it', 'can', 'be', 'used', 'to', 'give', 'a', 'single', 'fixed', 'design', 'with', 'provable', 'performance', 'guarantees', 'in', 'mass', 'chains', 'of', 'any', 'length', 'we', 'illustrate', 'the', 'approach', 'by', 'designing', 'a', 'bidirectional', 'control', 'law', 'in', 'a', 'vehicle', 'platoon', 'in', 'a', 'manner', 'that', 'is', 'independent', 'of', 'the', 'number', 'of', 'vehicles', 'in', 'the', 'platoon']] | [-0.18898595596771653, 0.11509708963693624, -0.10297672074086156, -0.00737377517879099, -0.06227181803895138, -0.14458293708725775, 0.058993003577981366, 0.4131274958511433, -0.2682816919881895, -0.2916495291493743, 0.08210115116079063, -0.209077427102006, -0.1446784800269181, 0.24359104611787452, -0.0954116872926972, 0.0772900577544807, 0.06291700908016548, 0.04232115953801626, -0.0013191648955311042, -0.19832620591329164, 0.26740390285625154, 0.046071575954556465, 0.28658989970628396, 0.049355896425444676, 0.11817683967346528, 0.004861101266894355, 0.05814302101533535, 0.05402681904743953, -0.09085287849258572, 0.13640199225754981, 0.2492281093307019, 0.1221514015144869, 0.30246886943119117, -0.3953442502856614, -0.23641163460820555, 0.08626191746667926, 0.14951866795589408, 0.13756213645753732, -0.07299442270613578, -0.24537519993911305, 0.13735996922814703, -0.16947096573884587, -0.1549285828663283, -0.05161747310860419, -0.034745524951582216, 0.05266580497284969, -0.3068068740350834, 0.015356227766767323, 0.07111942765852773, 0.025994050664355957, -0.02892882201164198, -0.024054710568119603, 0.02315337868710329, 0.1538565345108509, 0.046827107143352725, 0.022486070659101368, 0.13613857776599836, -0.09790064816093857, -0.12161179403606129, 0.3933830975992493, -0.04586639542536563, -0.25596876047461864, 0.1303125447200903, -0.04364545756203392, -0.09340193559112678, 0.1343361941861909, 0.20898942631411266, 0.11378688530911234, -0.1759445170019136, 0.027088371879724134, -0.058733924942831674, 0.2000845733087465, 0.0120799658253385, 0.0014587771904890437, 0.17568058664461664, 0.24384399041174407, 0.15722693982590213, 0.14041984440753214, -0.059313347119927765, -0.06276817319084363, -0.3166194629395403, -0.18402894541722195, -0.18270148978714484, 0.02028014112533216, -0.10109061911472131, -0.16351189877254418, 0.4029992493206119, 0.20578880441559913, 0.2055789156626147, 0.09696289970881743, 0.34565812488456804, 0.11734797315902065, 0.08011253654440663, 0.10128129901454212, 0.22956385319149233, 0.09924258731995676, 0.07019664380834045, -0.24604041646627417, 0.08528672063061182, 0.06740953690226538] |
1,802.07041 | Selection from heaps, row-sorted matrices and $X+Y$ using soft heaps | We use soft heaps to obtain simpler optimal algorithms for selecting the
$k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered
tree, from a collection of sorted lists, and from $X+Y$, where $X$ and $Y$ are
two unsorted sets. Our results match, and in some ways extend and improve,
classical results of Frederickson (1993) and Frederickson and Johnson (1982).
In particular, for selecting the $k$-th smallest item, or the set of~$k$
smallest items, from a collection of~$m$ sorted lists we obtain a new optimal
"output-sensitive" algorithm that performs only $O(m+\sum_{i=1}^m \log(k_i+1))$
comparisons, where $k_i$ is the number of items of the $i$-th list that belong
to the overall set of~$k$ smallest items.
| cs.DS | we use soft heaps to obtain simpler optimal algorithms for selecting the kth smallest item and the set ofk smallest items from a heapordered tree from a collection of sorted lists and from xy where x and y are two unsorted sets our results match and in some ways extend and improve classical results of frederickson 1993 and frederickson and johnson 1982 in particular for selecting the kth smallest item or the set ofk smallest items from a collection ofm sorted lists we obtain a new optimal outputsensitive algorithm that performs only omsum_i1m logk_i1 comparisons where k_i is the number of items of the ith list that belong to the overall set ofk smallest items | [['we', 'use', 'soft', 'heaps', 'to', 'obtain', 'simpler', 'optimal', 'algorithms', 'for', 'selecting', 'the', 'kth', 'smallest', 'item', 'and', 'the', 'set', 'ofk', 'smallest', 'items', 'from', 'a', 'heapordered', 'tree', 'from', 'a', 'collection', 'of', 'sorted', 'lists', 'and', 'from', 'xy', 'where', 'x', 'and', 'y', 'are', 'two', 'unsorted', 'sets', 'our', 'results', 'match', 'and', 'in', 'some', 'ways', 'extend', 'and', 'improve', 'classical', 'results', 'of', 'frederickson', '1993', 'and', 'frederickson', 'and', 'johnson', '1982', 'in', 'particular', 'for', 'selecting', 'the', 'kth', 'smallest', 'item', 'or', 'the', 'set', 'ofk', 'smallest', 'items', 'from', 'a', 'collection', 'ofm', 'sorted', 'lists', 'we', 'obtain', 'a', 'new', 'optimal', 'outputsensitive', 'algorithm', 'that', 'performs', 'only', 'omsum_i1m', 'logk_i1', 'comparisons', 'where', 'k_i', 'is', 'the', 'number', 'of', 'items', 'of', 'the', 'ith', 'list', 'that', 'belong', 'to', 'the', 'overall', 'set', 'ofk', 'smallest', 'items']] | [-0.06972333378430488, 0.04351177627830643, -0.0025566730677125463, 0.07401633535952727, -0.13950501183723718, -0.15968923556692569, 0.16836451216543144, 0.35085590182086535, -0.2865303386068713, -0.3356391951993965, 0.07917921054023741, -0.3917227614736926, -0.10971071557306676, 0.15815854998742254, -0.08946753305638522, 0.012696756581586283, 0.06185373003322598, 0.08682374272132869, 0.006436736971980571, -0.349200784352369, 0.2780336746863559, -0.019638892164272545, 0.19622108476665034, -0.06297745590666885, 0.0914085918411085, 0.020418958140916266, -0.08883467455604732, 0.06181252020538941, -0.14871490169463336, 0.1248747916249311, 0.29372836587604434, 0.1934688032967393, 0.2785848250892837, -0.31675183578534466, -0.035536336784654884, 0.16173133788943556, 0.10236789965672435, 0.04982533353685805, 0.011935654244657638, -0.2154333280580761, 0.16461403852021395, -0.12376469588401702, -0.017157307030649577, -0.019834449506504873, 0.09329762794664624, 0.0596488899946938, -0.3557682464113541, -0.042520912211652086, 0.04645707515950224, -0.006541616336928796, -0.018978408307034886, -0.26114013163703576, 0.02028808562266352, 0.1627507746209719, -0.010087927262529533, 0.04042397667365396, 0.06213670371479429, -0.06695881207778523, -0.17548201816255407, 0.39400496934252105, -0.013690318648530318, -0.16435440446752891, 0.11341590168102916, -0.108344596489209, -0.15027138409905333, 0.14030206363106792, 0.12874553465094846, 0.1303581769569917, -0.10000270968138249, 0.08336703686622605, -0.1871324519635038, 0.15857775400565788, 0.12940977860769604, 0.0106518472899246, 0.13561417920663293, 0.12379562950989775, 0.11497853702115537, 0.15260635680247064, -0.02505474373599333, -0.002145818088500373, -0.2940880225072986, -0.15408530931886846, -0.2507372937387729, 0.007167689493997435, -0.16495233311318377, -0.1772480109949654, 0.36011089963129667, 0.15275099562981734, 0.24488606154753834, 0.11928572620273428, 0.24240902745354492, 0.018982201957208747, 0.01157614290590637, 0.1597225907159788, 0.06641886937890441, 0.06032581230526609, 0.0047174038250098185, -0.14732350167958477, 0.0838378910304962, 0.1511119542997825] |
1,802.07042 | Do deep nets really need weight decay and dropout? | The impressive success of modern deep neural networks on computer vision
tasks has been achieved through models of very large capacity compared to the
number of available training examples. This overparameterization is often said
to be controlled with the help of different regularization techniques, mainly
weight decay and dropout. However, since these techniques reduce the effective
capacity of the model, typically even deeper and wider architectures are
required to compensate for the reduced capacity. Therefore, there seems to be a
waste of capacity in this practice. In this paper we build upon recent research
that suggests that explicit regularization may not be as important as widely
believed and carry out an ablation study that concludes that weight decay and
dropout may not be necessary for object recognition if enough data augmentation
is introduced.
| cs.CV | the impressive success of modern deep neural networks on computer vision tasks has been achieved through models of very large capacity compared to the number of available training examples this overparameterization is often said to be controlled with the help of different regularization techniques mainly weight decay and dropout however since these techniques reduce the effective capacity of the model typically even deeper and wider architectures are required to compensate for the reduced capacity therefore there seems to be a waste of capacity in this practice in this paper we build upon recent research that suggests that explicit regularization may not be as important as widely believed and carry out an ablation study that concludes that weight decay and dropout may not be necessary for object recognition if enough data augmentation is introduced | [['the', 'impressive', 'success', 'of', 'modern', 'deep', 'neural', 'networks', 'on', 'computer', 'vision', 'tasks', 'has', 'been', 'achieved', 'through', 'models', 'of', 'very', 'large', 'capacity', 'compared', 'to', 'the', 'number', 'of', 'available', 'training', 'examples', 'this', 'overparameterization', 'is', 'often', 'said', 'to', 'be', 'controlled', 'with', 'the', 'help', 'of', 'different', 'regularization', 'techniques', 'mainly', 'weight', 'decay', 'and', 'dropout', 'however', 'since', 'these', 'techniques', 'reduce', 'the', 'effective', 'capacity', 'of', 'the', 'model', 'typically', 'even', 'deeper', 'and', 'wider', 'architectures', 'are', 'required', 'to', 'compensate', 'for', 'the', 'reduced', 'capacity', 'therefore', 'there', 'seems', 'to', 'be', 'a', 'waste', 'of', 'capacity', 'in', 'this', 'practice', 'in', 'this', 'paper', 'we', 'build', 'upon', 'recent', 'research', 'that', 'suggests', 'that', 'explicit', 'regularization', 'may', 'not', 'be', 'as', 'important', 'as', 'widely', 'believed', 'and', 'carry', 'out', 'an', 'ablation', 'study', 'that', 'concludes', 'that', 'weight', 'decay', 'and', 'dropout', 'may', 'not', 'be', 'necessary', 'for', 'object', 'recognition', 'if', 'enough', 'data', 'augmentation', 'is', 'introduced']] | [-0.03983459060073347, 0.08110839924593438, -0.06760359612902753, 0.08976794040194691, -0.11127117116536413, -0.18576367478467581, 0.04339446479899291, 0.4250304618556249, -0.27165735581595646, -0.31668599434477046, 0.15085886412954896, -0.21938221909707986, -0.18628907765268832, 0.23709162624195723, -0.15314228645756953, 0.09202432981779785, 0.13315811891921034, 0.047871135588371215, -0.042721060160687545, -0.3286282589827153, 0.2734798692732251, 0.1217416124783817, 0.31963831663159725, 0.087606285733724, 0.044745079048907496, -0.06348495972622886, -0.020422925118749078, 0.0014790899743487064, -0.08143074284031938, 0.14695862698529785, 0.33316003346826756, 0.15691354959201825, 0.33151358198654607, -0.45082833685148926, -0.273362606553767, 0.15291985878860928, 0.20962285762652755, 0.09239496536118756, -0.048719163466756116, -0.23134503195664488, 0.1123476307524046, -0.18683691932014504, -0.023915801645445645, -0.15283841915302596, 0.004907249774139626, 0.000804506859363974, -0.27191971516572777, 0.005143940577211727, 0.06859402025216504, 0.06373934707380272, -0.006552123468145168, -0.13811236599642307, 0.03259742054458063, 0.14535605695966938, 0.07740272376975185, 0.08360516673122022, 0.0914261288751841, -0.19872247947456972, -0.08651103565637443, 0.3484729413587348, -0.019853377742762853, -0.1984614950492698, 0.22649160154422926, -0.05012526355606777, -0.1605322216217287, 0.13973142170256242, 0.20016131241266666, 0.08575027375797131, -0.17816051766906577, 0.026322801287559077, 0.007614956006295699, 0.1810234018892078, 0.03552430981938216, 0.0259123809961252, 0.1869896226947693, 0.20544543403683974, 0.046541746880831125, 0.1358537135638745, -0.06744748335751824, -0.07147303070081748, -0.22767601495510653, -0.11467966015093532, -0.2133986164703685, 0.060284161565806085, -0.035084953307107626, -0.12676023336169415, 0.3159716221875042, 0.20867815363234876, 0.19846033449179695, 0.04134781977609921, 0.3122139990389263, 0.08941020715204452, 0.20441537692134543, 0.06978727872238348, 0.24485243109485513, 0.07704781078124293, 0.11227484119537853, -0.16802280966745675, 0.11061234119535543, -0.011003566510219099] |
1,802.07043 | Subsonic islands within a high-mass star-forming IRDC | High-mass star forming regions are typically thought to be dominated by
supersonic motions. We present combined Very Large Array and Green Bank
Telescope (VLA+GBT) observations of NH$_3$ (1,1) and (2,2) in the infrared dark
cloud (IRDC) G035.39-00.33, tracing cold and dense gas down to scales of 0.07
pc. We find that, in contrast to previous similar studies of IRDCs, more than a
third of the fitted ammonia spectra show subsonic non-thermal motions (mean
line width of 0.71 $\mathrm{km~s^{-1}}$), and the sonic Mach number
distribution peaks around $\mathcal{M} = 1$. As possible observational and
instrumental biases would only broaden the line profiles, our results provide
strong upper limits to the actual value of $\mathcal{M}$, further strengthening
our findings of narrow line widths. This finding calls for a reevaluation of
the role of turbulent dissipation and subsonic regions in massive-star and
cluster formation. Based on our findings in G035.39, we further speculate that
the coarser spectral resolution used in the previous VLA NH$_3$ studies may
have inhibited the detection of subsonic turbulence in IRDCs. The reduced
turbulent support suggests that dynamically important magnetic fields of the 1
mG order would be required to support against possible gravitational collapse.
Our results offer valuable input into the theories and simulations that aim to
recreate the initial conditions of high-mass star and cluster formation.
| astro-ph.GA | highmass star forming regions are typically thought to be dominated by supersonic motions we present combined very large array and green bank telescope vlagbt observations of nh_3 11 and 22 in the infrared dark cloud irdc g035390033 tracing cold and dense gas down to scales of 007 pc we find that in contrast to previous similar studies of irdcs more than a third of the fitted ammonia spectra show subsonic nonthermal motions mean line width of 071 mathrmkms1 and the sonic mach number distribution peaks around mathcalm 1 as possible observational and instrumental biases would only broaden the line profiles our results provide strong upper limits to the actual value of mathcalm further strengthening our findings of narrow line widths this finding calls for a reevaluation of the role of turbulent dissipation and subsonic regions in massivestar and cluster formation based on our findings in g03539 we further speculate that the coarser spectral resolution used in the previous vla nh_3 studies may have inhibited the detection of subsonic turbulence in irdcs the reduced turbulent support suggests that dynamically important magnetic fields of the 1 mg order would be required to support against possible gravitational collapse our results offer valuable input into the theories and simulations that aim to recreate the initial conditions of highmass star and cluster formation | [['highmass', 'star', 'forming', 'regions', 'are', 'typically', 'thought', 'to', 'be', 'dominated', 'by', 'supersonic', 'motions', 'we', 'present', 'combined', 'very', 'large', 'array', 'and', 'green', 'bank', 'telescope', 'vlagbt', 'observations', 'of', 'nh_3', '11', 'and', '22', 'in', 'the', 'infrared', 'dark', 'cloud', 'irdc', 'g035390033', 'tracing', 'cold', 'and', 'dense', 'gas', 'down', 'to', 'scales', 'of', '007', 'pc', 'we', 'find', 'that', 'in', 'contrast', 'to', 'previous', 'similar', 'studies', 'of', 'irdcs', 'more', 'than', 'a', 'third', 'of', 'the', 'fitted', 'ammonia', 'spectra', 'show', 'subsonic', 'nonthermal', 'motions', 'mean', 'line', 'width', 'of', '071', 'mathrmkms1', 'and', 'the', 'sonic', 'mach', 'number', 'distribution', 'peaks', 'around', 'mathcalm', '1', 'as', 'possible', 'observational', 'and', 'instrumental', 'biases', 'would', 'only', 'broaden', 'the', 'line', 'profiles', 'our', 'results', 'provide', 'strong', 'upper', 'limits', 'to', 'the', 'actual', 'value', 'of', 'mathcalm', 'further', 'strengthening', 'our', 'findings', 'of', 'narrow', 'line', 'widths', 'this', 'finding', 'calls', 'for', 'a', 'reevaluation', 'of', 'the', 'role', 'of', 'turbulent', 'dissipation', 'and', 'subsonic', 'regions', 'in', 'massivestar', 'and', 'cluster', 'formation', 'based', 'on', 'our', 'findings', 'in', 'g03539', 'we', 'further', 'speculate', 'that', 'the', 'coarser', 'spectral', 'resolution', 'used', 'in', 'the', 'previous', 'vla', 'nh_3', 'studies', 'may', 'have', 'inhibited', 'the', 'detection', 'of', 'subsonic', 'turbulence', 'in', 'irdcs', 'the', 'reduced', 'turbulent', 'support', 'suggests', 'that', 'dynamically', 'important', 'magnetic', 'fields', 'of', 'the', '1', 'mg', 'order', 'would', 'be', 'required', 'to', 'support', 'against', 'possible', 'gravitational', 'collapse', 'our', 'results', 'offer', 'valuable', 'input', 'into', 'the', 'theories', 'and', 'simulations', 'that', 'aim', 'to', 'recreate', 'the', 'initial', 'conditions', 'of', 'highmass', 'star', 'and', 'cluster', 'formation']] | [-0.10004705476064744, 0.11853066775236382, -0.07902506756363437, 0.07816003909047814, -0.0758999586382911, -0.05265214785295366, 0.05785026394274879, 0.40855366853496955, -0.16008519272414828, -0.3303853960975108, 0.06539734679811066, -0.21467842344470597, -0.019633168223124272, 0.18397616910914183, 0.008809376717113925, -0.0020156278947575223, 0.08382084234337392, -0.10253797126467733, -0.005548736056274113, -0.208621898749024, 0.3022616407101008, 0.10349851599635763, 0.21049896764802892, 0.05099114218211508, 0.011752961320073356, -0.16180702122181645, -0.08052684891649901, 0.011083589922809214, -0.17870164272136646, 0.07499529301572626, 0.247435913496668, 0.11533936743594327, 0.24597064812756056, -0.4205878825806495, -0.23875529823851172, 0.05424581491819548, 0.21413447057905918, 0.05381479949304507, -0.03139492228641488, -0.30559496510411716, 0.09169130688058902, -0.14620171640907992, -0.1888754066161777, 0.014043123907564828, 0.046845004901384796, 0.043561017822530294, -0.24320299235491635, 0.13747614944953024, 0.030611618672588117, 0.04831969075072535, -0.10826510925242608, -0.13607824201796945, -0.0785650936956733, 0.0892336756207644, 0.015922193311982684, 0.06605837865040316, 0.21216398399782418, -0.15208353093744673, -0.041142927713398995, 0.39913554663804396, -0.08433777477875992, -0.05405130322280995, 0.252456620522059, -0.21106488303242563, -0.20839319651929178, 0.21466777747479715, 0.13962375588232168, 0.09358759809078442, -0.06136383318624684, -0.04149741031950624, -0.05988564519578143, 0.2103589093032362, 0.07100032178708783, 0.045660322553616156, 0.2945142646268424, 0.11715816007388101, 0.05224092049562993, 0.11272390876763018, -0.19436784266576138, -0.07945853074380904, -0.2649624246922839, -0.11218946599789585, -0.1215951171470806, 0.05947694784629642, -0.11904607020490705, -0.10505881476004746, 0.2801459837010717, 0.17699385717289126, 0.21595676906117997, 0.030563018090510416, 0.29015057204136, 0.06773311006044322, 0.08380441497407716, 0.11735662944260251, 0.274158836346706, 0.1806168042228954, 0.11279231939180237, -0.22740377793390373, 0.032444380083756254, -0.030809866779708064] |
1,802.07044 | The Description Length of Deep Learning Models | Solomonoff's general theory of inference and the Minimum Description Length
principle formalize Occam's razor, and hold that a good model of data is a
model that is good at losslessly compressing the data, including the cost of
describing the model itself. Deep neural networks might seem to go against this
principle given the large number of parameters to be encoded.
We demonstrate experimentally the ability of deep neural networks to compress
the training data even when accounting for parameter encoding. The compression
viewpoint originally motivated the use of variational methods in neural
networks. Unexpectedly, we found that these variational methods provide
surprisingly poor compression bounds, despite being explicitly built to
minimize such bounds. This might explain the relatively poor practical
performance of variational methods in deep learning. On the other hand, simple
incremental encoding methods yield excellent compression values on deep
networks, vindicating Solomonoff's approach.
| cs.LG | solomonoffs general theory of inference and the minimum description length principle formalize occams razor and hold that a good model of data is a model that is good at losslessly compressing the data including the cost of describing the model itself deep neural networks might seem to go against this principle given the large number of parameters to be encoded we demonstrate experimentally the ability of deep neural networks to compress the training data even when accounting for parameter encoding the compression viewpoint originally motivated the use of variational methods in neural networks unexpectedly we found that these variational methods provide surprisingly poor compression bounds despite being explicitly built to minimize such bounds this might explain the relatively poor practical performance of variational methods in deep learning on the other hand simple incremental encoding methods yield excellent compression values on deep networks vindicating solomonoffs approach | [['solomonoffs', 'general', 'theory', 'of', 'inference', 'and', 'the', 'minimum', 'description', 'length', 'principle', 'formalize', 'occams', 'razor', 'and', 'hold', 'that', 'a', 'good', 'model', 'of', 'data', 'is', 'a', 'model', 'that', 'is', 'good', 'at', 'losslessly', 'compressing', 'the', 'data', 'including', 'the', 'cost', 'of', 'describing', 'the', 'model', 'itself', 'deep', 'neural', 'networks', 'might', 'seem', 'to', 'go', 'against', 'this', 'principle', 'given', 'the', 'large', 'number', 'of', 'parameters', 'to', 'be', 'encoded', 'we', 'demonstrate', 'experimentally', 'the', 'ability', 'of', 'deep', 'neural', 'networks', 'to', 'compress', 'the', 'training', 'data', 'even', 'when', 'accounting', 'for', 'parameter', 'encoding', 'the', 'compression', 'viewpoint', 'originally', 'motivated', 'the', 'use', 'of', 'variational', 'methods', 'in', 'neural', 'networks', 'unexpectedly', 'we', 'found', 'that', 'these', 'variational', 'methods', 'provide', 'surprisingly', 'poor', 'compression', 'bounds', 'despite', 'being', 'explicitly', 'built', 'to', 'minimize', 'such', 'bounds', 'this', 'might', 'explain', 'the', 'relatively', 'poor', 'practical', 'performance', 'of', 'variational', 'methods', 'in', 'deep', 'learning', 'on', 'the', 'other', 'hand', 'simple', 'incremental', 'encoding', 'methods', 'yield', 'excellent', 'compression', 'values', 'on', 'deep', 'networks', 'vindicating', 'solomonoffs', 'approach']] | [-0.05593983755479085, 0.02357457264101711, -0.09255595820281526, 0.13535897122567583, -0.11618033617991826, -0.19820523113012314, 0.0670987133097289, 0.3998217071229913, -0.296334772309738, -0.3206312723778959, 0.0736745156877642, -0.21847296383488796, -0.1933158512997987, 0.20757105009277063, -0.12085477134919372, 0.07936785848628618, 0.1315623898524791, 0.03140155306820565, -0.08012615488239981, -0.28449222158785137, 0.2521187113156414, 0.0982301285482365, 0.37055944167719834, 0.03133417882410617, 0.12314739971630403, -0.02708765041516644, 0.006772700378847919, 0.0285007935812183, -0.10137112651994765, 0.20267687888799943, 0.2807032319974026, 0.20234650778744756, 0.29031323748159, -0.46162577345967293, -0.2704115207339155, 0.1256131735456714, 0.12137425254452332, 0.16533495292131756, -0.009764428882546531, -0.2598023202077582, 0.09682480491183955, -0.16216754068716846, -0.05232430893670896, -0.16312721396860635, -0.042555792758177065, 0.004641491328847819, -0.27621958251592926, 0.0520629843086775, 0.0780718296027646, 0.03817893450915139, -0.040156487060775015, -0.12961506532938702, 0.04312120429641599, 0.10564581600985297, 0.05033766991571234, 0.05378594816630257, 0.10678838854334478, -0.18317552309740207, -0.10112762251138238, 0.3365588074550033, -0.04451748066710244, -0.1807560529688309, 0.1967210510926289, -0.014657140818649324, -0.1805099930550004, 0.09817277753147585, 0.21042301332224803, 0.09006486420744451, -0.15013701108671676, 0.04242351065020494, -0.04075868704581055, 0.1686661256067776, 0.05046129803783421, 0.023801676674087627, 0.15168663795941092, 0.23579056054385827, 0.01686962175279342, 0.1198701240294934, -0.09740976234576826, -0.11568270657083084, -0.24313047027921883, -0.06851206321614506, -0.21419853282899692, 0.003702743186872324, -0.1451112095284645, -0.16094443599436561, 0.32509556230286074, 0.21719002584316607, 0.22155510963679387, 0.1305582471866289, 0.3351157376253656, 0.07383760538209101, 0.1270342468091383, 0.09134730232943748, 0.24318310394240863, 0.10877141577817885, 0.07836421430753222, -0.1622943359314753, 0.118325928189583, 0.05009795896195132] |
1,802.07045 | Latent RANSAC | We present a method that can evaluate a RANSAC hypothesis in constant time,
i.e. independent of the size of the data. A key observation here is that
correct hypotheses are tightly clustered together in the latent parameter
domain. In a manner similar to the generalized Hough transform we seek to find
this cluster, only that we need as few as two votes for a successful detection.
Rapidly locating such pairs of similar hypotheses is made possible by adapting
the recent "Random Grids" range-search technique. We only perform the usual
(costly) hypothesis verification stage upon the discovery of a close pair of
hypotheses. We show that this event rarely happens for incorrect hypotheses,
enabling a significant speedup of the RANSAC pipeline. The suggested approach
is applied and tested on three robust estimation problems: camera localization,
3D rigid alignment and 2D-homography estimation. We perform rigorous testing on
both synthetic and real datasets, demonstrating an improvement in efficiency
without a compromise in accuracy. Furthermore, we achieve state-of-the-art 3D
alignment results on the challenging "Redwood" loop-closure challenge.
| cs.CV | we present a method that can evaluate a ransac hypothesis in constant time ie independent of the size of the data a key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain in a manner similar to the generalized hough transform we seek to find this cluster only that we need as few as two votes for a successful detection rapidly locating such pairs of similar hypotheses is made possible by adapting the recent random grids rangesearch technique we only perform the usual costly hypothesis verification stage upon the discovery of a close pair of hypotheses we show that this event rarely happens for incorrect hypotheses enabling a significant speedup of the ransac pipeline the suggested approach is applied and tested on three robust estimation problems camera localization 3d rigid alignment and 2dhomography estimation we perform rigorous testing on both synthetic and real datasets demonstrating an improvement in efficiency without a compromise in accuracy furthermore we achieve stateoftheart 3d alignment results on the challenging redwood loopclosure challenge | [['we', 'present', 'a', 'method', 'that', 'can', 'evaluate', 'a', 'ransac', 'hypothesis', 'in', 'constant', 'time', 'ie', 'independent', 'of', 'the', 'size', 'of', 'the', 'data', 'a', 'key', 'observation', 'here', 'is', 'that', 'correct', 'hypotheses', 'are', 'tightly', 'clustered', 'together', 'in', 'the', 'latent', 'parameter', 'domain', 'in', 'a', 'manner', 'similar', 'to', 'the', 'generalized', 'hough', 'transform', 'we', 'seek', 'to', 'find', 'this', 'cluster', 'only', 'that', 'we', 'need', 'as', 'few', 'as', 'two', 'votes', 'for', 'a', 'successful', 'detection', 'rapidly', 'locating', 'such', 'pairs', 'of', 'similar', 'hypotheses', 'is', 'made', 'possible', 'by', 'adapting', 'the', 'recent', 'random', 'grids', 'rangesearch', 'technique', 'we', 'only', 'perform', 'the', 'usual', 'costly', 'hypothesis', 'verification', 'stage', 'upon', 'the', 'discovery', 'of', 'a', 'close', 'pair', 'of', 'hypotheses', 'we', 'show', 'that', 'this', 'event', 'rarely', 'happens', 'for', 'incorrect', 'hypotheses', 'enabling', 'a', 'significant', 'speedup', 'of', 'the', 'ransac', 'pipeline', 'the', 'suggested', 'approach', 'is', 'applied', 'and', 'tested', 'on', 'three', 'robust', 'estimation', 'problems', 'camera', 'localization', '3d', 'rigid', 'alignment', 'and', '2dhomography', 'estimation', 'we', 'perform', 'rigorous', 'testing', 'on', 'both', 'synthetic', 'and', 'real', 'datasets', 'demonstrating', 'an', 'improvement', 'in', 'efficiency', 'without', 'a', 'compromise', 'in', 'accuracy', 'furthermore', 'we', 'achieve', 'stateoftheart', '3d', 'alignment', 'results', 'on', 'the', 'challenging', 'redwood', 'loopclosure', 'challenge']] | [-0.10508584075645484, 0.016355995369386825, -0.08131246871658061, 0.07575780981593379, -0.08383475385513701, -0.15319400807918862, 0.08136620053787286, 0.4160272259243399, -0.22073564514768315, -0.35043087506895526, 0.11036601882599491, -0.2184122390228144, -0.15477724337394824, 0.2104922956215185, -0.10565226669055655, 0.10661249817417096, 0.13841089845753454, 0.02506315319837011, -0.06665415147473296, -0.28191887823815803, 0.27583134680719534, 0.051073458322803134, 0.3319277919485773, -0.0017129559688030453, 0.10514415469774922, 0.005705444119075498, -0.059493003012605655, 0.018437724998928824, -0.08474450763291135, 0.11790788366203332, 0.22805465523926924, 0.1695685232481875, 0.29929920547364053, -0.41547432502633647, -0.196505914661456, 0.10083497748424283, 0.1512691000876785, 0.1156844874973816, -0.07683421806731855, -0.2878121121184715, 0.11106627967347506, -0.13769346477235095, -0.07665574692777898, -0.10513334882265904, -0.008063290622194259, -0.029341782358807255, -0.3009912888601161, 0.0824130350909038, 0.0655817291617655, 0.032712191218041885, -0.04283453436699091, -0.08292476892231675, 0.06128353403325666, 0.12686411822922747, 0.033554868215738595, 0.04717277220521144, 0.10960078264902515, -0.13240377527312885, -0.14290481485829454, 0.36645273881697515, -0.06374901913042447, -0.2193008305189031, 0.21843232942829507, -0.07098573018736833, -0.18716897452740291, 0.10101743488659679, 0.1822915735738951, 0.1530290717335298, -0.13148369496873422, 0.016552948645160843, -0.048250902994203634, 0.20304534738959626, 0.043994499224085604, -0.049245262232592756, 0.19250802791606614, 0.21365547523839257, 0.0569942959704115, 0.12335506989892943, -0.15399234441152573, -0.061069842886481956, -0.254544851734209, -0.13995374956376558, -0.20369045922126927, -0.011461415758345559, -0.09341588608448445, -0.1491115912468287, 0.3780598626880531, 0.23667973833572534, 0.2172402657571178, 0.06597701671985332, 0.3418164643083225, 0.049426526703997054, 0.062208555363750424, 0.0319473851153529, 0.24127468098178287, 0.024091935308775403, 0.041544476872560576, -0.16149869176956733, 0.08982899443216469, 0.02005857004707799] |
1,802.07046 | Elementary Proofs of Some Stirling Bounds | We give elementary proofs of several Stirling's precise bounds. We first
improve all the precise bounds from the literature and give new precise bounds.
In particular, we show that for all $n\ge 8$ $$\sqrt{2\pi
n}\left(\frac{n}{e}\right)^n e^{\frac{1}{12n}-\frac{1}{360n^3+103n}} \ge n!\ge
\sqrt{2\pi n}\left(\frac{n}{e}\right)^n
e^{\frac{1}{12n}-\frac{1}{360n^3+102n}}$$ and for all $n\ge 3$ $$\sqrt{2\pi
n}\left(\frac{n}{e}\right)^n e^{\frac{1}{12n+\frac{2}{5n}-\frac{1.1}{10n^3}}}
\ge n!\ge \sqrt{2\pi n}\left(\frac{n}{e}\right)^n
e^{\frac{1}{12n+\frac{2}{5n}-\frac{0.9}{10n^3}}}.$$
| math.FA cs.CC | we give elementary proofs of several stirlings precise bounds we first improve all the precise bounds from the literature and give new precise bounds in particular we show that for all nge 8 sqrt2pi nleftfracnerightn efrac112nfrac1360n3103n ge nge sqrt2pi nleftfracnerightn efrac112nfrac1360n3102n and for all nge 3 sqrt2pi nleftfracnerightn efrac112nfrac25nfrac1110n3 ge nge sqrt2pi nleftfracnerightn efrac112nfrac25nfrac0910n3 | [['we', 'give', 'elementary', 'proofs', 'of', 'several', 'stirlings', 'precise', 'bounds', 'we', 'first', 'improve', 'all', 'the', 'precise', 'bounds', 'from', 'the', 'literature', 'and', 'give', 'new', 'precise', 'bounds', 'in', 'particular', 'we', 'show', 'that', 'for', 'all', 'nge', '8', 'sqrt2pi', 'nleftfracnerightn', 'efrac112nfrac1360n3103n', 'ge', 'nge', 'sqrt2pi', 'nleftfracnerightn', 'efrac112nfrac1360n3102n', 'and', 'for', 'all', 'nge', '3', 'sqrt2pi', 'nleftfracnerightn', 'efrac112nfrac25nfrac1110n3', 'ge', 'nge', 'sqrt2pi', 'nleftfracnerightn', 'efrac112nfrac25nfrac0910n3']] | [-0.12567659299238584, 0.11994994738139213, 0.03377650326117873, 0.07541585931554437, -0.02484903377480805, -0.2560146141634323, -0.00634486697614193, 0.31775334194302557, -0.12420069270767271, -0.3024735241383314, 0.13904013054212555, -0.33650418382138014, -0.10971567193046212, 0.2775494803674519, -0.05957477878779173, 0.02908924326300621, 0.012028439342975617, 0.0403862102329731, -0.11045439157169312, -0.3179137168079615, 0.24237118437886238, -0.12376807276159525, 0.12133000187575817, 0.1468288030847907, 0.046297680661082266, 0.05380469294264913, 0.04828470129519701, -0.12357166238129139, -0.37338376796411465, 0.11114930126816035, 0.21708183409937193, 0.14730907591059805, 0.13503840912133455, -0.4056614562869072, -0.09423435578122735, 0.1947065319493413, 0.2024333333969116, 0.03682047039270401, -0.03520295855589211, -0.23288188729435205, 0.236047474835068, -0.10580195412039757, -0.12853806180879473, -0.04915629394352436, 0.09843585535883903, -0.008834694046527147, -0.3443471165653318, 0.08459377680905163, 0.20542207481339575, 0.05411944070830941, -0.07077628899365664, -0.3283099536411464, 0.05723748356103897, 0.135532569848001, -0.10425654720515012, 0.018963092025369405, -0.02781469093170017, -0.026957546174526215, -0.12959702499210835, 0.22197972029447555, -0.01571595836430788, -0.1486472452059388, 0.07288391031324863, -0.2226538065262139, -0.22824748448096216, 0.10725319381803274, 0.08946413561701774, 0.19336274931207298, -0.06983628213405609, 0.20594510644441472, -0.06336391925811767, 0.16812605217099189, 0.1819646498374641, 0.04944519185461104, -0.03865723619237542, 0.09691902838181704, 0.113335976395756, 0.046274469466879964, 0.015952129475772382, 0.1224184846226126, -0.3756325149536133, -0.2099207396991551, -0.133721587236505, 0.15716369971632957, -0.20740155490057077, -0.008752561390865594, 0.2664295222610235, 0.13015040650963783, 0.10837074767798185, 0.18721096193417908, 0.19758387476205827, 0.005363457296043634, -0.06729446806013584, 0.15675926800817253, 0.15623600139282645, 0.12532631693407892, 0.016102930195629597, -0.06559470941778273, -0.04660873026587069, 0.1066288826148957] |
1,802.07047 | Temporal complexity in emission from Anderson localized lasers | Anderson localization lasers exploit resonant cavities formed due to
structural disorder. The inherent randomness in the structure of these cavities
realizes a probability distribution in all cavity parameters such as quality
factors, mode volumes, mode structures etc, implying resultant statistical
fluctuations in the temporal behavior. Here, we provide the first, direct
experimental measurements of temporal width distributions of Anderson
localization lasing pulses in intrinsically and extrinsically disordered
coupled-microresonator arrays. We first illustrate signature exponential decays
in the spatial intensity distributions of the lasing modes that quantify their
localized character, and then measure the temporal width distributions of the
pulsed emission over several configurations. We observe a hitherto-unreported
dependence of temporal widths on the disorder strength, wherein the widths show
a single-peaked, left-skewed distribution in extrinsic disorder and a
dual-peaked distribution in intrinsic disorder. We propose a model based on
coupled rate equations for an emitter and an Anderson cavity with a random mode
structure, which gives excellent quantitative and qualitative agreement with
the experimental observations. The experimental and theoretical analyses bring
to the fore the temporal complexity in Anderson localization based lasing
systems.
| physics.optics | anderson localization lasers exploit resonant cavities formed due to structural disorder the inherent randomness in the structure of these cavities realizes a probability distribution in all cavity parameters such as quality factors mode volumes mode structures etc implying resultant statistical fluctuations in the temporal behavior here we provide the first direct experimental measurements of temporal width distributions of anderson localization lasing pulses in intrinsically and extrinsically disordered coupledmicroresonator arrays we first illustrate signature exponential decays in the spatial intensity distributions of the lasing modes that quantify their localized character and then measure the temporal width distributions of the pulsed emission over several configurations we observe a hithertounreported dependence of temporal widths on the disorder strength wherein the widths show a singlepeaked leftskewed distribution in extrinsic disorder and a dualpeaked distribution in intrinsic disorder we propose a model based on coupled rate equations for an emitter and an anderson cavity with a random mode structure which gives excellent quantitative and qualitative agreement with the experimental observations the experimental and theoretical analyses bring to the fore the temporal complexity in anderson localization based lasing systems | [['anderson', 'localization', 'lasers', 'exploit', 'resonant', 'cavities', 'formed', 'due', 'to', 'structural', 'disorder', 'the', 'inherent', 'randomness', 'in', 'the', 'structure', 'of', 'these', 'cavities', 'realizes', 'a', 'probability', 'distribution', 'in', 'all', 'cavity', 'parameters', 'such', 'as', 'quality', 'factors', 'mode', 'volumes', 'mode', 'structures', 'etc', 'implying', 'resultant', 'statistical', 'fluctuations', 'in', 'the', 'temporal', 'behavior', 'here', 'we', 'provide', 'the', 'first', 'direct', 'experimental', 'measurements', 'of', 'temporal', 'width', 'distributions', 'of', 'anderson', 'localization', 'lasing', 'pulses', 'in', 'intrinsically', 'and', 'extrinsically', 'disordered', 'coupledmicroresonator', 'arrays', 'we', 'first', 'illustrate', 'signature', 'exponential', 'decays', 'in', 'the', 'spatial', 'intensity', 'distributions', 'of', 'the', 'lasing', 'modes', 'that', 'quantify', 'their', 'localized', 'character', 'and', 'then', 'measure', 'the', 'temporal', 'width', 'distributions', 'of', 'the', 'pulsed', 'emission', 'over', 'several', 'configurations', 'we', 'observe', 'a', 'hithertounreported', 'dependence', 'of', 'temporal', 'widths', 'on', 'the', 'disorder', 'strength', 'wherein', 'the', 'widths', 'show', 'a', 'singlepeaked', 'leftskewed', 'distribution', 'in', 'extrinsic', 'disorder', 'and', 'a', 'dualpeaked', 'distribution', 'in', 'intrinsic', 'disorder', 'we', 'propose', 'a', 'model', 'based', 'on', 'coupled', 'rate', 'equations', 'for', 'an', 'emitter', 'and', 'an', 'anderson', 'cavity', 'with', 'a', 'random', 'mode', 'structure', 'which', 'gives', 'excellent', 'quantitative', 'and', 'qualitative', 'agreement', 'with', 'the', 'experimental', 'observations', 'the', 'experimental', 'and', 'theoretical', 'analyses', 'bring', 'to', 'the', 'fore', 'the', 'temporal', 'complexity', 'in', 'anderson', 'localization', 'based', 'lasing', 'systems']] | [-0.13707863523159175, 0.14943745038876335, -0.09371621072318198, 0.0815125420405012, -0.0027170678238487905, -0.1378957756743249, 0.060243067691206104, 0.45998848613041143, -0.23791065445790688, -0.24647169535358746, 0.02307677670226743, -0.28788873330793446, -0.12492471663022621, 0.14710753235526175, -0.002858436037786305, 0.0810833587569909, 0.0369684926001355, -0.03867456096648109, -0.030173413008580813, -0.13921640521536272, 0.27523668461686207, 0.05556743804675837, 0.37516589426021607, 0.06444555991587954, 0.04935534513141546, 0.014944839806088971, 0.026428472713774277, -0.00038156191714935835, -0.12856219320500611, 0.09361519815865904, 0.18687325911596417, 0.02077306492913825, 0.2459736817723347, -0.41087976095991, -0.23684352275708484, 0.049243705574836996, 0.17094537295342888, 0.1329187542004446, -0.05388218334216314, -0.33732071947823794, 0.02868145843838445, -0.11236085733786846, -0.13044533905922434, -0.03900460086814645, 0.008899976377789345, 0.050372439065378985, -0.26750738794766626, 0.08331495359436505, 0.06683096097614098, 0.08538979213917627, -0.058625116173384915, -0.03554407791751954, -0.00850248311439322, 0.10234896850306541, 0.023651643887084597, -0.05803028628482328, 0.12870634609264217, -0.1418744661799994, -0.15932431795129862, 0.338139525033249, -0.08627391207394086, -0.15618610413641565, 0.18141465024608705, -0.20122454579816096, -0.08750782294405832, 0.17843620225580203, 0.17348922276546042, 0.0409975080518052, -0.09339726703053909, 0.02604811014413523, 0.0024915911205526855, 0.2682222774097075, 0.050475766235548586, 0.1565497042141942, 0.19677791451362686, 0.17972827992505497, 0.006303445040248335, 0.16218253441103217, -0.13488951206155536, -0.07959903888921771, -0.26182493495547937, -0.08566711518603067, -0.1684812887586304, 0.04902247263429065, -0.1041471873345371, -0.2115025825617421, 0.44892737033466495, 0.16835029584019343, 0.23630479710021365, 0.041352781282815464, 0.2597543664270132, 0.12545710417260933, 0.024231117523352927, 0.007170092224704503, 0.24535614410673992, 0.18850247573831844, 0.0733325791254174, -0.279229682433005, 0.06808222081745044, -0.0004709030682634976] |
1,802.07048 | Search for vector charmonium(-like) states in the $e^+e^- \rightarrow
\eta J/\psi$ line shape | The cross section of $e^+e^- \rightarrow \eta J/\psi$ has been measured by
BESIII and Belle experiments. Fit to the $e^+e^- \rightarrow \eta J/\psi$ line
shape, three resonant structures are evident. The parameters for the three
resonant structures are $M_{1}=(3980\pm17\pm7)$ MeV/$c^{2}$,
$\Gamma_{1}=(104\pm32\pm13)$ MeV; $M_{2}=(4219\pm5\pm4)$ MeV/$c^{2}$,
$\Gamma_{2}=(63\pm9\pm3)$ MeV; $M_{3}=(4401\pm12\pm4)$ MeV/$c^{2}$,
$\Gamma_{3}=(49\pm19\pm4)$ MeV, where the first uncertainties are statistical
and the second systematic. We attribute the three structures to $\psi(4040)$,
$Y(4220)$ and $\psi(4415)$ states. The branching fractions
$\mathcal{B}(\psi(4040) \rightarrow \eta J/\psi)$ and $\mathcal{B}(\psi(4415)
\rightarrow \eta J/\psi)$ are given. If $Y(4220)$ is taken as $\psi(4S)$ state,
the branching fraction $\mathcal{B}(\psi(4S) \rightarrow \eta J/\psi)$ is also
given. Combining all $Y(4220)$ parameters obtained from different decays, we
give average parameters for $Y(4220)$, which are $M_{Y(4220)}=(4220.8\pm2.4)$
MeV/$c^{2}$, $\Gamma_{Y(4220)}=(54.8\pm3.3)$ MeV.
| hep-ph | the cross section of ee rightarrow eta jpsi has been measured by besiii and belle experiments fit to the ee rightarrow eta jpsi line shape three resonant structures are evident the parameters for the three resonant structures are m_13980pm17pm7 mevc2 gamma_1104pm32pm13 mev m_24219pm5pm4 mevc2 gamma_263pm9pm3 mev m_34401pm12pm4 mevc2 gamma_349pm19pm4 mev where the first uncertainties are statistical and the second systematic we attribute the three structures to psi4040 y4220 and psi4415 states the branching fractions mathcalbpsi4040 rightarrow eta jpsi and mathcalbpsi4415 rightarrow eta jpsi are given if y4220 is taken as psi4s state the branching fraction mathcalbpsi4s rightarrow eta jpsi is also given combining all y4220 parameters obtained from different decays we give average parameters for y4220 which are m_y422042208pm24 mevc2 gamma_y4220548pm33 mev | [['the', 'cross', 'section', 'of', 'ee', 'rightarrow', 'eta', 'jpsi', 'has', 'been', 'measured', 'by', 'besiii', 'and', 'belle', 'experiments', 'fit', 'to', 'the', 'ee', 'rightarrow', 'eta', 'jpsi', 'line', 'shape', 'three', 'resonant', 'structures', 'are', 'evident', 'the', 'parameters', 'for', 'the', 'three', 'resonant', 'structures', 'are', 'm_13980pm17pm7', 'mevc2', 'gamma_1104pm32pm13', 'mev', 'm_24219pm5pm4', 'mevc2', 'gamma_263pm9pm3', 'mev', 'm_34401pm12pm4', 'mevc2', 'gamma_349pm19pm4', 'mev', 'where', 'the', 'first', 'uncertainties', 'are', 'statistical', 'and', 'the', 'second', 'systematic', 'we', 'attribute', 'the', 'three', 'structures', 'to', 'psi4040', 'y4220', 'and', 'psi4415', 'states', 'the', 'branching', 'fractions', 'mathcalbpsi4040', 'rightarrow', 'eta', 'jpsi', 'and', 'mathcalbpsi4415', 'rightarrow', 'eta', 'jpsi', 'are', 'given', 'if', 'y4220', 'is', 'taken', 'as', 'psi4s', 'state', 'the', 'branching', 'fraction', 'mathcalbpsi4s', 'rightarrow', 'eta', 'jpsi', 'is', 'also', 'given', 'combining', 'all', 'y4220', 'parameters', 'obtained', 'from', 'different', 'decays', 'we', 'give', 'average', 'parameters', 'for', 'y4220', 'which', 'are', 'm_y422042208pm24', 'mevc2', 'gamma_y4220548pm33', 'mev']] | [-0.07462085039786961, 0.25718154097898854, -0.049152290775767854, 0.11651705034488292, -0.03213481478044881, -0.10636609191964339, 0.06882930093608494, 0.3686234730774084, -0.13950080375883495, -0.1995504967834767, -0.13814619353863303, -0.4116645421211918, 0.08240883562478933, 0.16697623421278623, 0.13049306952906353, 0.1906065262333901, 0.169615467800549, 0.010681234635748304, -0.020211832958634372, -0.1350115933036012, 0.23878975554478463, 0.0006694925932196884, 0.18285359284916036, 0.1402024732617376, -0.04167871049664042, -0.03862066303908422, 0.03742627904389624, -0.14593518381048967, -0.25259490130754475, -0.028817879670060467, 0.2964242385670979, 0.11195139718443356, 0.08026162930554501, -0.2117806054014075, 0.006901269086410065, 0.19552657290084943, 0.17460373805852625, -0.031006479414540704, 0.06684203832703936, -0.4825855449916006, 0.21503674154597763, -0.16907913223127122, 0.017478644961138833, -0.05528240612296908, 0.06373790167439897, -0.09187590548986788, -0.325100654014596, 0.12779299963054852, -0.10990008345368814, 0.03708410695161637, -0.06731229540598285, -0.37767947334292773, -0.04900140462124401, 0.0005885122746631905, 0.10796070722800151, 0.09235371874544669, 0.21710393089918537, -0.054593268215555595, -0.19999829726713197, 0.39637813809210315, -0.014854336048367325, -0.13829566584060993, 0.040321686409984354, -0.20534486498742424, -0.1699441302303426, 0.2544860146385995, 0.1995811558303398, 0.03421329836747064, -0.17762606855280497, 0.10205088875902531, -0.02778248522883734, 0.24604109441441996, 0.14626431550100646, 0.07174231603674523, 0.09987707017409103, 0.18085134051098312, -0.07246254482684103, 0.03430664123912753, -0.14084068855253962, -0.028083212468101904, -0.401745012066713, -0.10092156561645302, -0.002786982478364161, 0.15864405914436322, 0.0024669313103774446, 0.01717340262808107, 0.31434984315555914, -0.057757524152596794, 0.41881534693813, 0.00022761816649722892, 0.3147398253046983, 0.16628673994234083, -0.019321936960877466, 0.030948445748386753, 0.3401917195669166, 0.2594656381055478, 0.11488875785636976, -0.2473863891731247, 0.06683402871796945, -0.028884771934433562] |
1,802.07049 | The Bieri-Neumann-Strebel invariants via Newton polytopes | We study the Newton polytopes of determinants of square matrices defined over
rings of twisted Laurent polynomials. We prove that such Newton polytopes are
single polytopes (rather than formal differences of two polytopes); this result
can be seen as analogous to the fact that determinants of matrices over
commutative Laurent polynomial rings are themselves polynomials, rather than
rational functions. We also exhibit a relationship between the Newton polytopes
and invertibility of the matrices over Novikov rings, thus establishing a
connection with the invariants of Bieri-Neumann-Strebel (BNS) via a theorem of
Sikorav.
We offer several applications: we reprove Thurston's theorem on the existence
of a polytope controlling the BNS invariants of a $3$-manifold group; we extend
this result to free-by-cyclic groups, and the more general descending HNN
extensions of free groups. We also show that the BNS invariants of Poincar\'e
duality groups of type $\mathtt{F}$ in dimension $3$ and groups of deficiency
one are determined by a polytope, when the groups are assumed to be agrarian,
that is their integral group rings embed in skew-fields. The latter result
partially confirms a conjecture of Friedl.
We also deduce the vanishing of the Newton polytopes associated to elements
of the Whitehead groups of many groups satisfying the Atiyah conjecture. We use
this to show that the $L^2$-torsion polytope of Friedl-L\"uck is invariant
under homotopy. We prove the vanishing of this polytope in the presence of
amenability, thus proving a conjecture of Friedl-L\"uck-Tillmann.
| math.GR math.GT math.RA | we study the newton polytopes of determinants of square matrices defined over rings of twisted laurent polynomials we prove that such newton polytopes are single polytopes rather than formal differences of two polytopes this result can be seen as analogous to the fact that determinants of matrices over commutative laurent polynomial rings are themselves polynomials rather than rational functions we also exhibit a relationship between the newton polytopes and invertibility of the matrices over novikov rings thus establishing a connection with the invariants of bierineumannstrebel bns via a theorem of sikorav we offer several applications we reprove thurstons theorem on the existence of a polytope controlling the bns invariants of a 3manifold group we extend this result to freebycyclic groups and the more general descending hnn extensions of free groups we also show that the bns invariants of poincare duality groups of type mathttf in dimension 3 and groups of deficiency one are determined by a polytope when the groups are assumed to be agrarian that is their integral group rings embed in skewfields the latter result partially confirms a conjecture of friedl we also deduce the vanishing of the newton polytopes associated to elements of the whitehead groups of many groups satisfying the atiyah conjecture we use this to show that the l2torsion polytope of friedlluck is invariant under homotopy we prove the vanishing of this polytope in the presence of amenability thus proving a conjecture of friedllucktillmann | [['we', 'study', 'the', 'newton', 'polytopes', 'of', 'determinants', 'of', 'square', 'matrices', 'defined', 'over', 'rings', 'of', 'twisted', 'laurent', 'polynomials', 'we', 'prove', 'that', 'such', 'newton', 'polytopes', 'are', 'single', 'polytopes', 'rather', 'than', 'formal', 'differences', 'of', 'two', 'polytopes', 'this', 'result', 'can', 'be', 'seen', 'as', 'analogous', 'to', 'the', 'fact', 'that', 'determinants', 'of', 'matrices', 'over', 'commutative', 'laurent', 'polynomial', 'rings', 'are', 'themselves', 'polynomials', 'rather', 'than', 'rational', 'functions', 'we', 'also', 'exhibit', 'a', 'relationship', 'between', 'the', 'newton', 'polytopes', 'and', 'invertibility', 'of', 'the', 'matrices', 'over', 'novikov', 'rings', 'thus', 'establishing', 'a', 'connection', 'with', 'the', 'invariants', 'of', 'bierineumannstrebel', 'bns', 'via', 'a', 'theorem', 'of', 'sikorav', 'we', 'offer', 'several', 'applications', 'we', 'reprove', 'thurstons', 'theorem', 'on', 'the', 'existence', 'of', 'a', 'polytope', 'controlling', 'the', 'bns', 'invariants', 'of', 'a', '3manifold', 'group', 'we', 'extend', 'this', 'result', 'to', 'freebycyclic', 'groups', 'and', 'the', 'more', 'general', 'descending', 'hnn', 'extensions', 'of', 'free', 'groups', 'we', 'also', 'show', 'that', 'the', 'bns', 'invariants', 'of', 'poincare', 'duality', 'groups', 'of', 'type', 'mathttf', 'in', 'dimension', '3', 'and', 'groups', 'of', 'deficiency', 'one', 'are', 'determined', 'by', 'a', 'polytope', 'when', 'the', 'groups', 'are', 'assumed', 'to', 'be', 'agrarian', 'that', 'is', 'their', 'integral', 'group', 'rings', 'embed', 'in', 'skewfields', 'the', 'latter', 'result', 'partially', 'confirms', 'a', 'conjecture', 'of', 'friedl', 'we', 'also', 'deduce', 'the', 'vanishing', 'of', 'the', 'newton', 'polytopes', 'associated', 'to', 'elements', 'of', 'the', 'whitehead', 'groups', 'of', 'many', 'groups', 'satisfying', 'the', 'atiyah', 'conjecture', 'we', 'use', 'this', 'to', 'show', 'that', 'the', 'l2torsion', 'polytope', 'of', 'friedlluck', 'is', 'invariant', 'under', 'homotopy', 'we', 'prove', 'the', 'vanishing', 'of', 'this', 'polytope', 'in', 'the', 'presence', 'of', 'amenability', 'thus', 'proving', 'a', 'conjecture', 'of', 'friedllucktillmann']] | [-0.2135684252376234, 0.056057962412369766, -0.13481500834005616, 0.09632043558137365, -0.08405219288976958, -0.11325647204451389, 0.004940785420269279, 0.3261083198269292, -0.35778830565859454, -0.21538765533625984, 0.1290248293460197, -0.24314992577804379, -0.18630737722732948, 0.1922925676325715, -0.1619327817234542, -0.04308103160021069, 0.03673582338980573, 0.04512009250248735, -0.13953720815420562, -0.3485641230679101, 0.38443177977924126, -0.01932702975750159, 0.17620832307858433, 0.06701784678369808, 0.08964663524411508, 0.011631972821413587, -0.026302127981503193, 0.012533715682921111, -0.13264672848240247, 0.16303991111216404, 0.29536290692907397, 0.09217680504218027, 0.18957917345095804, -0.3756324452892147, -0.11213498950789888, 0.2067736834169255, 0.11906153555728606, 0.03001341310534942, -0.028740049873010584, -0.24859502518123364, 0.12359593088849116, -0.18298389424690267, -0.19858539516453522, -0.06711192528117385, 0.028742447087513598, 0.05283252746498181, -0.21987333783576013, 0.03832588644396865, 0.11609854124549587, 0.12906987322652239, -0.055972133300679544, -0.09679601203119462, -0.03148959304247509, 0.08201856919185957, 0.023562169936682902, -0.018997216426522738, 0.07863695792443419, -0.06748113290098953, -0.17122438126362038, 0.3743121172479054, -0.0035491307988472806, -0.20911223234712853, 0.14008972069674755, -0.20064544677142432, -0.21483586495347573, 0.12346299635088545, 0.08224872727404837, 0.16691706409101706, -0.0365423182437075, 0.12704239392547545, -0.189542988879543, 0.038119338751746876, 0.1385151545410597, 0.010312970338233399, 0.14534586551993833, 0.04053525025936601, 0.10309296081181007, 0.1698781382356636, 0.04236075392962725, -0.051716161644188845, -0.30091486978285426, -0.2204327652165745, -0.15063247345466863, 0.1234740583537841, -0.14985435791255688, -0.1670731560443528, 0.3806510845799062, 0.06231828057996423, 0.16522657764302093, 0.17831194536934086, 0.18318420214878428, 0.05372945645427473, 0.0917499296426856, 0.04736413022254641, 0.14372054131314854, 0.259135471963742, -0.01653455069902258, -0.12383925197872933, -0.0006887996401558867, 0.23141066326317772] |
1,802.0705 | Resonance dynamics of DCO ($\widetilde{X}\,{}^2A'$) simulated with the
dynamically pruned discrete variable representation (DP-DVR) | Selected resonance states of the deuterated formyl radical in the electronic
ground state ($\widetilde{X}\,{}^2A'$) are computed using our recently
introduced dynamically pruned discrete variable representation (DP-DVR) [H. R.
Larsson, B. Hartke and D. J. Tannor, J. Chem. Phys., 145, 204108 (2016)]. Their
decay and asymptotic distributions are analyzed and, for selected resonances,
compared to experimental results obtained by a combination of stimulated
emission pumping (SEP) and velocity-map imaging of the product D atoms. The
theoretical results show good agreement with the experimental kinetic energy
distributions. The intramolecular vibrational energy redistribution (IVR) is
analyzed and compared with previous results from an effective polyad
Hamiltonian. Specifically, we analyzed the part of the wavefunction that
remains in the interaction region during the decay. The results from the polyad
Hamiltonian could mainly be confirmed. The C=O stretch quantum number is
typically conserved, while the D-C=O bend quantum number decreases. Differences
are due to strong anharmonic coupling such that all resonances have major
contributions from several zero-order states. For some of the resonances, the
coupling is so strong that no further zero-order states appear during the
dynamics in the interaction region, even after propagating for 300 ps.
| physics.chem-ph | selected resonance states of the deuterated formyl radical in the electronic ground state widetildex2a are computed using our recently introduced dynamically pruned discrete variable representation dpdvr h r larsson b hartke and d j tannor j chem phys 145 204108 2016 their decay and asymptotic distributions are analyzed and for selected resonances compared to experimental results obtained by a combination of stimulated emission pumping sep and velocitymap imaging of the product d atoms the theoretical results show good agreement with the experimental kinetic energy distributions the intramolecular vibrational energy redistribution ivr is analyzed and compared with previous results from an effective polyad hamiltonian specifically we analyzed the part of the wavefunction that remains in the interaction region during the decay the results from the polyad hamiltonian could mainly be confirmed the co stretch quantum number is typically conserved while the dco bend quantum number decreases differences are due to strong anharmonic coupling such that all resonances have major contributions from several zeroorder states for some of the resonances the coupling is so strong that no further zeroorder states appear during the dynamics in the interaction region even after propagating for 300 ps | [['selected', 'resonance', 'states', 'of', 'the', 'deuterated', 'formyl', 'radical', 'in', 'the', 'electronic', 'ground', 'state', 'widetildex2a', 'are', 'computed', 'using', 'our', 'recently', 'introduced', 'dynamically', 'pruned', 'discrete', 'variable', 'representation', 'dpdvr', 'h', 'r', 'larsson', 'b', 'hartke', 'and', 'd', 'j', 'tannor', 'j', 'chem', 'phys', '145', '204108', '2016', 'their', 'decay', 'and', 'asymptotic', 'distributions', 'are', 'analyzed', 'and', 'for', 'selected', 'resonances', 'compared', 'to', 'experimental', 'results', 'obtained', 'by', 'a', 'combination', 'of', 'stimulated', 'emission', 'pumping', 'sep', 'and', 'velocitymap', 'imaging', 'of', 'the', 'product', 'd', 'atoms', 'the', 'theoretical', 'results', 'show', 'good', 'agreement', 'with', 'the', 'experimental', 'kinetic', 'energy', 'distributions', 'the', 'intramolecular', 'vibrational', 'energy', 'redistribution', 'ivr', 'is', 'analyzed', 'and', 'compared', 'with', 'previous', 'results', 'from', 'an', 'effective', 'polyad', 'hamiltonian', 'specifically', 'we', 'analyzed', 'the', 'part', 'of', 'the', 'wavefunction', 'that', 'remains', 'in', 'the', 'interaction', 'region', 'during', 'the', 'decay', 'the', 'results', 'from', 'the', 'polyad', 'hamiltonian', 'could', 'mainly', 'be', 'confirmed', 'the', 'co', 'stretch', 'quantum', 'number', 'is', 'typically', 'conserved', 'while', 'the', 'dco', 'bend', 'quantum', 'number', 'decreases', 'differences', 'are', 'due', 'to', 'strong', 'anharmonic', 'coupling', 'such', 'that', 'all', 'resonances', 'have', 'major', 'contributions', 'from', 'several', 'zeroorder', 'states', 'for', 'some', 'of', 'the', 'resonances', 'the', 'coupling', 'is', 'so', 'strong', 'that', 'no', 'further', 'zeroorder', 'states', 'appear', 'during', 'the', 'dynamics', 'in', 'the', 'interaction', 'region', 'even', 'after', 'propagating', 'for', '300', 'ps']] | [-0.11053196773476277, 0.17709885538371203, -0.02651223330019367, 0.03517386655719882, -0.003772367140593589, -0.12084209573302399, 0.044359314920646806, 0.38246742605906786, -0.23153122837739015, -0.3027585182762729, 0.023120980428300165, -0.3140288830375072, -0.08353238876554228, 0.14487039982267316, 0.03162842412896839, 0.03694434629885046, 0.10508124574232926, 0.002183766380228378, 0.004511872249798327, -0.18321946329097188, 0.23841816140831543, 0.0737326402160482, 0.24831753950621488, 0.0814003815021977, 0.019624587608545664, -0.0034852833253030896, -0.002274977590238291, -0.02461992566863065, -0.15017541772842244, 0.08104313478993606, 0.22435215027773722, 0.033513702873495366, 0.22365221832804974, -0.4091378589685533, -0.19270226500128276, 0.056520245972991226, 0.14494769820431, 0.12747327157692914, -0.030147200293232878, -0.32520073537946376, 0.024451369688249926, -0.1643233873527842, -0.09116911144296407, -0.09660598765763026, 0.06942900438502274, 0.022373637452228985, -0.2742246716934941, 0.1122074525058947, 0.03200869712419315, 0.0681783917961179, -0.08472445046420767, -0.18600488292969883, -0.09030979992538474, 0.07025724999291241, 0.03110031030761699, 0.0474716476891584, 0.1345376302771487, -0.09671755123233038, -0.11022463758173029, 0.3374623626805645, -0.08049599478691422, -0.12467604511412521, 0.20840973144017713, -0.1384762085028111, -0.11594811398733072, 0.2019329336668961, 0.07849586427349735, 0.10936064185915273, -0.11812830047075829, 0.08126793159067226, -0.014491392430115156, 0.14814553913049322, 0.08568635545227499, 0.0707245591165798, 0.14593508266277178, 0.0758192192482215, -0.023425301697065748, 0.12268509990695825, -0.11192769883508503, -0.12693679433765023, -0.2862775497601698, -0.12654549304381132, -0.2114043294596264, 0.04760434569312979, -0.03335462129148519, -0.06962847870542968, 0.39396267556265074, 0.08763632741658185, 0.20697183145096812, 0.00011185091581730241, 0.22579072226238037, 0.1156688875441129, 0.0536502711896824, 0.08544213980221974, 0.31765189929695914, 0.18353336135285203, 0.07887500534422336, -0.2840831666265826, 0.038553749720372565, 0.002414642978538439] |
1,802.07051 | On Learning Causal Structures from Non-Experimental Data without Any
Faithfulness Assumption | Consider the problem of learning, from non-experimental data, the causal
(Markov equivalence) structure of the true, unknown causal Bayesian network
(CBN) on a given, fixed set of (categorical) variables. This learning problem
is known to be so hard that there is no learning algorithm that converges to
the truth for all possible CBNs (on the given set of variables). So the
convergence property has to be sacrificed for some CBNs---but for which? In
response, the standard practice has been to design and employ learning
algorithms that secure the convergence property for at least all the CBNs that
satisfy the famous faithfulness condition, which implies sacrificing the
convergence property for some CBNs that violate the faithfulness condition
(Spirtes et al. 2000). This standard design practice can be justified by
assuming---that is, accepting on faith---that the true, unknown CBN satisfies
the faithfulness condition. But the real question is this: Is it possible to
explain, without assuming the faithfulness condition or any of its weaker
variants, why it is mandatory rather than optional to follow the standard
design practice? This paper aims to answer the above question in the
affirmative. We first define an array of modes of convergence to the truth as
desiderata that might or might not be achieved by a causal learning algorithm.
Those modes of convergence concern (i) how pervasive the domain of convergence
is on the space of all possible CBNs and (ii) how uniformly the convergence
happens. Then we prove a result to the following effect: for any learning
algorithm that tackles the causal learning problem in question, if it achieves
the best achievable mode of convergence (considered in this paper), then it
must follow the standard design practice of converging to the truth for at
least all CBNs that satisfy the faithfulness condition---it is a requirement,
not an option.
| stat.ML cs.LG stat.ME | consider the problem of learning from nonexperimental data the causal markov equivalence structure of the true unknown causal bayesian network cbn on a given fixed set of categorical variables this learning problem is known to be so hard that there is no learning algorithm that converges to the truth for all possible cbns on the given set of variables so the convergence property has to be sacrificed for some cbnsbut for which in response the standard practice has been to design and employ learning algorithms that secure the convergence property for at least all the cbns that satisfy the famous faithfulness condition which implies sacrificing the convergence property for some cbns that violate the faithfulness condition spirtes et al 2000 this standard design practice can be justified by assumingthat is accepting on faiththat the true unknown cbn satisfies the faithfulness condition but the real question is this is it possible to explain without assuming the faithfulness condition or any of its weaker variants why it is mandatory rather than optional to follow the standard design practice this paper aims to answer the above question in the affirmative we first define an array of modes of convergence to the truth as desiderata that might or might not be achieved by a causal learning algorithm those modes of convergence concern i how pervasive the domain of convergence is on the space of all possible cbns and ii how uniformly the convergence happens then we prove a result to the following effect for any learning algorithm that tackles the causal learning problem in question if it achieves the best achievable mode of convergence considered in this paper then it must follow the standard design practice of converging to the truth for at least all cbns that satisfy the faithfulness conditionit is a requirement not an option | [['consider', 'the', 'problem', 'of', 'learning', 'from', 'nonexperimental', 'data', 'the', 'causal', 'markov', 'equivalence', 'structure', 'of', 'the', 'true', 'unknown', 'causal', 'bayesian', 'network', 'cbn', 'on', 'a', 'given', 'fixed', 'set', 'of', 'categorical', 'variables', 'this', 'learning', 'problem', 'is', 'known', 'to', 'be', 'so', 'hard', 'that', 'there', 'is', 'no', 'learning', 'algorithm', 'that', 'converges', 'to', 'the', 'truth', 'for', 'all', 'possible', 'cbns', 'on', 'the', 'given', 'set', 'of', 'variables', 'so', 'the', 'convergence', 'property', 'has', 'to', 'be', 'sacrificed', 'for', 'some', 'cbnsbut', 'for', 'which', 'in', 'response', 'the', 'standard', 'practice', 'has', 'been', 'to', 'design', 'and', 'employ', 'learning', 'algorithms', 'that', 'secure', 'the', 'convergence', 'property', 'for', 'at', 'least', 'all', 'the', 'cbns', 'that', 'satisfy', 'the', 'famous', 'faithfulness', 'condition', 'which', 'implies', 'sacrificing', 'the', 'convergence', 'property', 'for', 'some', 'cbns', 'that', 'violate', 'the', 'faithfulness', 'condition', 'spirtes', 'et', 'al', '2000', 'this', 'standard', 'design', 'practice', 'can', 'be', 'justified', 'by', 'assumingthat', 'is', 'accepting', 'on', 'faiththat', 'the', 'true', 'unknown', 'cbn', 'satisfies', 'the', 'faithfulness', 'condition', 'but', 'the', 'real', 'question', 'is', 'this', 'is', 'it', 'possible', 'to', 'explain', 'without', 'assuming', 'the', 'faithfulness', 'condition', 'or', 'any', 'of', 'its', 'weaker', 'variants', 'why', 'it', 'is', 'mandatory', 'rather', 'than', 'optional', 'to', 'follow', 'the', 'standard', 'design', 'practice', 'this', 'paper', 'aims', 'to', 'answer', 'the', 'above', 'question', 'in', 'the', 'affirmative', 'we', 'first', 'define', 'an', 'array', 'of', 'modes', 'of', 'convergence', 'to', 'the', 'truth', 'as', 'desiderata', 'that', 'might', 'or', 'might', 'not', 'be', 'achieved', 'by', 'a', 'causal', 'learning', 'algorithm', 'those', 'modes', 'of', 'convergence', 'concern', 'i', 'how', 'pervasive', 'the', 'domain', 'of', 'convergence', 'is', 'on', 'the', 'space', 'of', 'all', 'possible', 'cbns', 'and', 'ii', 'how', 'uniformly', 'the', 'convergence', 'happens', 'then', 'we', 'prove', 'a', 'result', 'to', 'the', 'following', 'effect', 'for', 'any', 'learning', 'algorithm', 'that', 'tackles', 'the', 'causal', 'learning', 'problem', 'in', 'question', 'if', 'it', 'achieves', 'the', 'best', 'achievable', 'mode', 'of', 'convergence', 'considered', 'in', 'this', 'paper', 'then', 'it', 'must', 'follow', 'the', 'standard', 'design', 'practice', 'of', 'converging', 'to', 'the', 'truth', 'for', 'at', 'least', 'all', 'cbns', 'that', 'satisfy', 'the', 'faithfulness', 'conditionit', 'is', 'a', 'requirement', 'not', 'an', 'option']] | [-0.07172214332578648, 0.048733436737001645, -0.08908270564503394, 0.11276291832008577, -0.13139384458648246, -0.16131211798887288, 0.06528372759619311, 0.3843057896890506, -0.2916922696794455, -0.27951386580897813, 0.1286608660889534, -0.21027678104447875, -0.14492680096724708, 0.16114382854394962, -0.1404962794571791, 0.0695276466043694, 0.07981008628965745, 0.07774865343141989, -0.04683695232747185, -0.31541211686227905, 0.32779402735901614, 0.05168613918159892, 0.2893618666683713, 0.02721029467862037, 0.11760514695080539, -0.003985094682883508, 0.046576392953284085, 0.030014784887793588, -0.1201816074829315, 0.0979999100219421, 0.2587000289542544, 0.2511171434807784, 0.3465220594403325, -0.3772793928672089, -0.1672342138171794, 0.17684848962256677, 0.12578954358575833, 0.08572728772660138, 0.0053594391244030665, -0.24755008386628682, 0.16279257908011832, -0.10837228259813028, -0.10811629397311812, -0.07797288984826527, -0.01265828730694227, -0.04659745553243644, -0.31166441976828624, 0.0253777109198646, 0.1447131675185268, 0.03845299165353279, -0.034951201891199525, -0.07750896729036767, 0.02275749040225577, 0.11494292591365185, 0.06566009915992332, 0.038777178436841656, 0.07485475480972313, -0.09835025360947942, -0.1259249949841028, 0.37631365414833445, -0.0008541700708306858, -0.21651714839847963, 0.17837429213895148, -0.10544993921399527, -0.1769809040286108, 0.10515089250418098, 0.12267818537627947, 0.09952703809652191, -0.15555057452114013, 0.10068314759190004, -0.10015214945385886, 0.15668692593431618, 0.07736331408331015, 0.026330375419594782, 0.12454788620820437, 0.15170740033889246, 0.11395645494390604, 0.10451408371914889, -0.021484403317345673, -0.06540624722744957, -0.3061537134950127, -0.15004040797032342, -0.20834634729369425, 0.048308996203839064, -0.07170163247495637, -0.1717049895620665, 0.33583349560194314, 0.21524156218108076, 0.156645236916865, 0.1216027932981322, 0.28164085159374147, 0.10064917089805758, 0.04984388191309013, 0.12628743470799067, 0.2531440774125614, 0.1037202623145605, 0.07885880290353858, -0.17286186125814715, 0.16659650068113388, 0.06348907699135684] |
1,802.07052 | Effect of Hartree-Fock Pseudopotential on the First-principles
Electronic Structure | Density functional theory (DFT) can run into serious difficulties with
localized states in elements such as transition metals with occupied-d states
and oxygen. In contrast, Hartree-Fock (HF) method can be a better approach for
such localized states. Here, we develop HF pseudopotentials to be used
alongside with DFT for solids. The computation cost is on par with standard
DFT. Calculations for a range of II-VI, III-V and group-IV semiconductors with
diverse physical properties show observably improved band gap for systems
containing d-electrons, whereby pointing to a new direction in electronic
theory.
| cond-mat.mtrl-sci | density functional theory dft can run into serious difficulties with localized states in elements such as transition metals with occupiedd states and oxygen in contrast hartreefock hf method can be a better approach for such localized states here we develop hf pseudopotentials to be used alongside with dft for solids the computation cost is on par with standard dft calculations for a range of iivi iiiv and groupiv semiconductors with diverse physical properties show observably improved band gap for systems containing delectrons whereby pointing to a new direction in electronic theory | [['density', 'functional', 'theory', 'dft', 'can', 'run', 'into', 'serious', 'difficulties', 'with', 'localized', 'states', 'in', 'elements', 'such', 'as', 'transition', 'metals', 'with', 'occupiedd', 'states', 'and', 'oxygen', 'in', 'contrast', 'hartreefock', 'hf', 'method', 'can', 'be', 'a', 'better', 'approach', 'for', 'such', 'localized', 'states', 'here', 'we', 'develop', 'hf', 'pseudopotentials', 'to', 'be', 'used', 'alongside', 'with', 'dft', 'for', 'solids', 'the', 'computation', 'cost', 'is', 'on', 'par', 'with', 'standard', 'dft', 'calculations', 'for', 'a', 'range', 'of', 'iivi', 'iiiv', 'and', 'groupiv', 'semiconductors', 'with', 'diverse', 'physical', 'properties', 'show', 'observably', 'improved', 'band', 'gap', 'for', 'systems', 'containing', 'delectrons', 'whereby', 'pointing', 'to', 'a', 'new', 'direction', 'in', 'electronic', 'theory']] | [-0.0407356821724938, 0.13285302797254797, -0.053774409523854656, 0.06484370632873228, 0.012456975657389395, -0.16063033880976338, 0.08799686966619144, 0.42313801046046945, -0.25373696277125013, -0.3254578631112559, -0.002017786155920476, -0.3325220009415514, -0.14168014015174574, 0.16522899330852348, 0.00982259701348893, 0.07082446654223734, 0.048196321019592384, -0.06682420336744851, -0.15911371010265107, -0.16529669093175067, 0.23799105402108076, 0.03181881850792302, 0.2573858907394525, 0.05426976042799651, -0.04785274543230318, 0.0013027192041691806, 0.1466922372734795, 0.039545667274958556, -0.07771500245564514, 0.15774775772523653, 0.35598408430814743, -0.03652294011521412, 0.2686298891281088, -0.5581756325438618, -0.27264058276390035, -0.0385063633762507, 0.1112149060703814, 0.18884045625519422, -0.09248315497016948, -0.278980968773572, 0.09211427646094106, -0.19260249226612763, -0.10973769940642847, -0.1629712491425582, -0.0338170725826381, 0.021004147660763313, -0.26725790467009775, 0.10821214116488893, -0.04531769928418928, 0.05182438563327499, -0.09798514608086811, -0.1874581787062602, -0.045900107081979516, 0.032200426375493404, 0.0018873068271204828, 0.05561478334582514, 0.1608027830396572, -0.06720430119894445, -0.12014726840166581, 0.4418278607436352, -0.08350321969612398, -0.15801872401934816, 0.2118149155854351, -0.10504845897020358, -0.14934889650903643, 0.115850968442909, 0.13585071296741566, 0.09845212413120963, -0.1025499489197197, 0.12297390970892998, 0.05142492903784538, 0.2086966202607275, -0.009393526748236682, 0.14480599518865347, 0.19936706690738598, 0.15687736751925613, 0.052522528792421024, 0.030593361609822345, -0.0832974923787535, -0.07681012610490952, -0.20035710105051596, -0.211945603053189, -0.2175659572188225, 0.03012086325842473, -0.021674175953376108, -0.23385357465595008, 0.40654381637771925, 0.11520444746646616, 0.10583510431978438, -0.02158398304341568, 0.22133613067886068, 0.1250707213320614, 0.08719799355086354, 0.03019690628991359, 0.20195545398940642, 0.1508778846694137, 0.02653493625111878, -0.19840313220241418, 0.04137618579164458, 0.046259434958402484] |
1,802.07053 | Existence, decay time and light yield for a reaction-diffusion-drift
equation in the continuum physics of scintillators | A scintillator is a material which converts incoming ionizing energy into
visible light. This conversion process, which is a strongly nonlinear one, can
be described by a Reaction-Diffusion-Drift equation we obtain from a model of
continua with microstructure endowed with a suitable thermodynamics. For such
an equation it can be show the global existence of renormalizable and weak
solutions, and the solutions exponential decay estimates can be given; moreover
we give also a mathematical definition for the light yield which is a measure
of scintillation efficiency.
| math-ph math.AP math.MP | a scintillator is a material which converts incoming ionizing energy into visible light this conversion process which is a strongly nonlinear one can be described by a reactiondiffusiondrift equation we obtain from a model of continua with microstructure endowed with a suitable thermodynamics for such an equation it can be show the global existence of renormalizable and weak solutions and the solutions exponential decay estimates can be given moreover we give also a mathematical definition for the light yield which is a measure of scintillation efficiency | [['a', 'scintillator', 'is', 'a', 'material', 'which', 'converts', 'incoming', 'ionizing', 'energy', 'into', 'visible', 'light', 'this', 'conversion', 'process', 'which', 'is', 'a', 'strongly', 'nonlinear', 'one', 'can', 'be', 'described', 'by', 'a', 'reactiondiffusiondrift', 'equation', 'we', 'obtain', 'from', 'a', 'model', 'of', 'continua', 'with', 'microstructure', 'endowed', 'with', 'a', 'suitable', 'thermodynamics', 'for', 'such', 'an', 'equation', 'it', 'can', 'be', 'show', 'the', 'global', 'existence', 'of', 'renormalizable', 'and', 'weak', 'solutions', 'and', 'the', 'solutions', 'exponential', 'decay', 'estimates', 'can', 'be', 'given', 'moreover', 'we', 'give', 'also', 'a', 'mathematical', 'definition', 'for', 'the', 'light', 'yield', 'which', 'is', 'a', 'measure', 'of', 'scintillation', 'efficiency']] | [-0.07095211669802666, 0.163577091070885, -0.16093592806445325, 0.06843023339968246, -0.08301921828704721, -0.1603594653417959, 0.0031222687321988975, 0.3396596523220925, -0.2980932904736084, -0.28859138859107214, 0.10644920724991928, -0.2907225964426556, -0.1114801417597953, 0.21184541649075553, -0.042263370122322265, 0.01240000067936147, 0.06012534219771624, 0.013205204591812457, -0.03200021818937624, -0.17885068418348538, 0.27605601568596766, 0.02540853778448175, 0.24028671834179582, 0.08207414739710443, 0.14904502026517602, -0.04482849129366086, 0.011606916564735857, 0.033946290699874655, -0.10674956123728085, 0.10643993089085116, 0.19678977263324401, 0.11550300008726909, 0.2094496533219867, -0.3904130770222229, -0.2644518014098353, 0.13318057722028565, 0.11248488458530868, 0.09816499018411645, -0.09578671917757567, -0.2660408651072751, 0.07729758655323701, -0.14721538151669153, -0.1525471579776529, -0.07233621947029058, -0.02470441446913516, 0.064229547583005, -0.3219752324854626, 0.05354268954868209, 0.058471013674074236, -0.03918069492450313, -0.09263031769763021, -0.01187326030477005, -0.02021400846321793, 0.04757040277780855, 0.021471966004259338, 0.01785768270766472, 0.10843087450655944, -0.1362965693779509, -0.05821584695402314, 0.39530819891130226, -0.10076448536916252, -0.25069448126151284, 0.13577541123308678, -0.10596999499179861, -0.06524068477070506, 0.19025475335690906, 0.1640877248993253, 0.13158202339785502, -0.1930280987830723, 0.07557566685966723, -0.05413832455763922, 0.22031675283523167, 0.0468824618112515, 0.05701131597161293, 0.23340982225011378, 0.19859825180405202, 0.08794530709548032, 0.14892366892959485, -0.025697223903090857, -0.041493245751103934, -0.3441689656718689, -0.20652473021079512, -0.12580787244745914, 0.14945482476888333, -0.09284277535283335, -0.17853087646996274, 0.4045897301834296, 0.06964900634415885, 0.18322963219355135, 0.027165388336459942, 0.2689655731706058, 0.2246265988029978, 0.032200983107802186, 0.055369495856832464, 0.26252435809549163, 0.12430550533292048, 0.07289794916287065, -0.17432005768915748, 0.06218320343314725, 0.0802933792145375] |
1,802.07054 | On the Mabinogion urn model | In this paper we discuss the Mabinogion urn model introduced by D. Williams
in Probability with Martingales (1991). Therein he describes an optimal control
problem where the objective is to maximize the expected final number of objects
of one kind in the Mabinogion urn model. Our main contribution is formulas for
the expected time to absorption and its asymptotic behavior in the optimally
controlled process. We also present results for the non-controlled Mabinogion
urn process and briefly analyze other strategies that become superior if a
certain discount factor is included.
| math.PR | in this paper we discuss the mabinogion urn model introduced by d williams in probability with martingales 1991 therein he describes an optimal control problem where the objective is to maximize the expected final number of objects of one kind in the mabinogion urn model our main contribution is formulas for the expected time to absorption and its asymptotic behavior in the optimally controlled process we also present results for the noncontrolled mabinogion urn process and briefly analyze other strategies that become superior if a certain discount factor is included | [['in', 'this', 'paper', 'we', 'discuss', 'the', 'mabinogion', 'urn', 'model', 'introduced', 'by', 'd', 'williams', 'in', 'probability', 'with', 'martingales', '1991', 'therein', 'he', 'describes', 'an', 'optimal', 'control', 'problem', 'where', 'the', 'objective', 'is', 'to', 'maximize', 'the', 'expected', 'final', 'number', 'of', 'objects', 'of', 'one', 'kind', 'in', 'the', 'mabinogion', 'urn', 'model', 'our', 'main', 'contribution', 'is', 'formulas', 'for', 'the', 'expected', 'time', 'to', 'absorption', 'and', 'its', 'asymptotic', 'behavior', 'in', 'the', 'optimally', 'controlled', 'process', 'we', 'also', 'present', 'results', 'for', 'the', 'noncontrolled', 'mabinogion', 'urn', 'process', 'and', 'briefly', 'analyze', 'other', 'strategies', 'that', 'become', 'superior', 'if', 'a', 'certain', 'discount', 'factor', 'is', 'included']] | [-0.04602674831015368, 0.09516253078294944, -0.08244856255542901, 0.08860111608992156, -0.052429940567041436, -0.14308527095967696, 0.09428886049168392, 0.37638380382623937, -0.26525281944001716, -0.2569167840275137, 0.09667980901172592, -0.26858500734282037, -0.15872709466558363, 0.12905117316275008, -0.16510627165925043, 0.03264227104308601, 0.013488357746973633, 0.022252269410010843, 0.05301809447248363, -0.31657951635619, 0.3099699014642586, 0.07383407690665789, 0.2297831960565721, 0.020128937551958694, 0.09374932965341334, 0.03613018598924908, -0.054326626358346806, -0.017682919014866152, -0.16388222424146887, 0.06165851100425546, 0.24645637493166658, 0.13583360659993357, 0.30101530057274634, -0.3623881302566992, -0.14670006856322287, 0.1381315565512826, 0.12824441163619565, 0.0896677646941195, -0.030871503686325418, -0.22850920908515238, 0.05529682457628143, -0.16622015501682957, -0.15930505474098028, -0.015726822107616396, 0.03959163326977028, 0.046133011421706116, -0.2955042109100355, 0.021310636574182557, 0.09340971067754758, -0.031572111098406214, -0.049959971447889176, -0.1598248131935381, 0.024671094735903253, 0.10319075751014882, 0.06989433291406992, 0.00743460141432782, 0.09544430728678385, -0.10659341271707995, -0.14459129705404242, 0.3574835369984309, -0.07612621209377216, -0.19204432738737928, 0.12017391136743956, -0.13465366661031214, -0.14774771503483256, 0.09577233410543866, 0.15534199257898662, 0.1285034915432334, -0.16428035012342865, 0.06871781171584088, -0.04571829365773333, 0.11374788172025647, 0.045560216800206235, 0.022075452213175594, 0.11390283750370145, 0.1824570316200455, 0.05621084505174723, 0.18516066657806127, -0.035827982456733784, -0.1352836127185987, -0.30563716577986877, -0.16601519033105838, -0.16176761722502608, 0.027160018873918387, -0.10221613465853605, -0.12367673111148178, 0.3595915910994841, 0.186129037818561, 0.19361660374949377, 0.08550153245321579, 0.26171833362895996, 0.13733548064159953, -0.05271152702884541, 0.07242237917251057, 0.2011042706668377, 0.10279093689686204, 0.1049421872322758, -0.203822155477893, 0.1209119946592384, 0.09817969970819022] |
1,802.07055 | Euclidean Action and the Einstein tensor | I give a local description of the Euclidean regime $(M, g_{ab}, u^a)$ of
Lorentzian spacetimes $(M, g_{ab})$ based on timelike geodesics $u^a$ passing
through an arbitrary event $p_0 \in M$. I show that, to leading order, the
Euclidean Einstein-Hilbert action $I_E$ is proportional to the Einstein tensor
$G_{ab}u^a u^b$ of $g_{ab}$. The positivity of $I_E$ follows if $G_{ab}u^a
u^b>0$ holds. I suggest an interpretation of this result in terms of the
amplitude $\mathcal{A}[\Sigma_0]=\exp[{-I_E}]$ for a single space-like
hypersurface $\Sigma_0 \in I^{+}(p_0)$ to emerge at a constant geodesic
distance $\lambda_0$ from $p_0$. Implications for classical and quantum gravity
are discussed.
| gr-qc hep-th | i give a local description of the euclidean regime m g_ab ua of lorentzian spacetimes m g_ab based on timelike geodesics ua passing through an arbitrary event p_0 in m i show that to leading order the euclidean einsteinhilbert action i_e is proportional to the einstein tensor g_abua ub of g_ab the positivity of i_e follows if g_abua ub0 holds i suggest an interpretation of this result in terms of the amplitude mathcalasigma_0expi_e for a single spacelike hypersurface sigma_0 in ip_0 to emerge at a constant geodesic distance lambda_0 from p_0 implications for classical and quantum gravity are discussed | [['i', 'give', 'a', 'local', 'description', 'of', 'the', 'euclidean', 'regime', 'm', 'g_ab', 'ua', 'of', 'lorentzian', 'spacetimes', 'm', 'g_ab', 'based', 'on', 'timelike', 'geodesics', 'ua', 'passing', 'through', 'an', 'arbitrary', 'event', 'p_0', 'in', 'm', 'i', 'show', 'that', 'to', 'leading', 'order', 'the', 'euclidean', 'einsteinhilbert', 'action', 'i_e', 'is', 'proportional', 'to', 'the', 'einstein', 'tensor', 'g_abua', 'ub', 'of', 'g_ab', 'the', 'positivity', 'of', 'i_e', 'follows', 'if', 'g_abua', 'ub0', 'holds', 'i', 'suggest', 'an', 'interpretation', 'of', 'this', 'result', 'in', 'terms', 'of', 'the', 'amplitude', 'mathcalasigma_0expi_e', 'for', 'a', 'single', 'spacelike', 'hypersurface', 'sigma_0', 'in', 'ip_0', 'to', 'emerge', 'at', 'a', 'constant', 'geodesic', 'distance', 'lambda_0', 'from', 'p_0', 'implications', 'for', 'classical', 'and', 'quantum', 'gravity', 'are', 'discussed']] | [-0.20631134856809327, 0.11893816471893708, -0.09348085686623891, 0.04974411353171664, -0.0912172399917023, -0.16057489313522078, -0.04385968763628935, 0.3110408873317089, -0.217011877241485, -0.1955490629485947, 0.022065387848031488, -0.298413102921257, -0.11314365942962468, 0.14910538914920565, -0.08802072027143329, -0.017457936504023507, 0.00690818872386986, 0.14560750644019943, -0.11998542082406818, -0.20686766643949012, 0.3660314633570453, 0.010357559805963822, 0.22640610441684406, 0.03588361545723486, 0.14324304624336792, 0.024584062598110672, -0.0023102594658415366, 0.06132188101021692, -0.20342277289912206, 0.03463377270840128, 0.21316368110165831, 0.14530699894307775, 0.19560972516959968, -0.36326227602647976, -0.18168589055161685, 0.08503652764781516, 0.1441534631390204, 0.04462247283261101, 0.027955314338930507, -0.27564037935015684, 0.08446990845395509, -0.10327755394788023, -0.20978517701571925, 0.012182736303657293, 0.12625171971368662, -0.06782068527164928, -0.2258858566836236, 0.11943480461598077, 0.08086764104069864, 0.052234166688186694, -0.07306985068382656, -0.1051162790576432, -0.024155082022573087, 0.04870129607498963, 0.07437673000249755, 0.1282713177584191, 0.09634963201081499, -0.07705729744803319, -0.05888578166907772, 0.41453238578632157, -0.11433638559599862, -0.23027555405984612, 0.06582374099216008, -0.16947623461167863, -0.060193014593715684, 0.07611483288928866, 0.10822384439884349, 0.153263000488415, -0.09094764836172158, 0.20592429343192403, 0.012253903801196274, 0.06909064450945229, 0.13332564854360324, 0.02381459671503646, 0.22072694364172268, 0.055967911775719296, 0.08938645523913363, 0.06527026590118383, -0.0463879565842093, -0.06714321886117451, -0.4807566554939493, -0.19918805896056854, -0.1639262588813584, 0.18384163478944213, -0.2092667148853194, -0.15103523518414574, 0.2784711520529372, 0.048303480113316526, 0.2267635738176165, 0.09671655494442329, 0.2162914973822363, 0.07584727649636408, 0.02458507843325509, 0.16373767124543442, 0.2468282728990976, 0.1613788724024879, 0.04568529486200435, -0.20762524481099892, -0.07021220453440193, 0.12455225778753533] |
1,802.07056 | Electronic phase separation in insulating (Ga,Mn)As with low
compensation: Super-paramagnetism and hopping conduction | In the present work, low compensated insulating (Ga,Mn)As with 0.7% Mn is
obtained by ion implantation combined with pulsed laser melting. The sample
shows variable-range hopping transport behavior with a Coulomb gap in the
vicinity of the Fermi energy, and the activation energy is reduced by an
external magnetic field. A blocking super-paramagnetism is observed rather than
ferromagnetism. Below the blocking temperature, the sample exhibits a colossal
negative magnetoresistance. Our studies confirm that the disorder-induced
electronic phase separation occurs in (Ga,Mn)As samples with a Mn concentration
in the insulator-metal transition regime, and it can account for the observed
superparamagnetism and the colossal magnetoresistance.
| cond-mat.mtrl-sci | in the present work low compensated insulating gamnas with 07 mn is obtained by ion implantation combined with pulsed laser melting the sample shows variablerange hopping transport behavior with a coulomb gap in the vicinity of the fermi energy and the activation energy is reduced by an external magnetic field a blocking superparamagnetism is observed rather than ferromagnetism below the blocking temperature the sample exhibits a colossal negative magnetoresistance our studies confirm that the disorderinduced electronic phase separation occurs in gamnas samples with a mn concentration in the insulatormetal transition regime and it can account for the observed superparamagnetism and the colossal magnetoresistance | [['in', 'the', 'present', 'work', 'low', 'compensated', 'insulating', 'gamnas', 'with', '07', 'mn', 'is', 'obtained', 'by', 'ion', 'implantation', 'combined', 'with', 'pulsed', 'laser', 'melting', 'the', 'sample', 'shows', 'variablerange', 'hopping', 'transport', 'behavior', 'with', 'a', 'coulomb', 'gap', 'in', 'the', 'vicinity', 'of', 'the', 'fermi', 'energy', 'and', 'the', 'activation', 'energy', 'is', 'reduced', 'by', 'an', 'external', 'magnetic', 'field', 'a', 'blocking', 'superparamagnetism', 'is', 'observed', 'rather', 'than', 'ferromagnetism', 'below', 'the', 'blocking', 'temperature', 'the', 'sample', 'exhibits', 'a', 'colossal', 'negative', 'magnetoresistance', 'our', 'studies', 'confirm', 'that', 'the', 'disorderinduced', 'electronic', 'phase', 'separation', 'occurs', 'in', 'gamnas', 'samples', 'with', 'a', 'mn', 'concentration', 'in', 'the', 'insulatormetal', 'transition', 'regime', 'and', 'it', 'can', 'account', 'for', 'the', 'observed', 'superparamagnetism', 'and', 'the', 'colossal', 'magnetoresistance']] | [-0.18055736719296106, 0.2510689915706306, -0.019072776149452023, 0.04531392911155211, 0.010814324570638896, -0.1559858983020904, 0.12753856498341176, 0.3962714620368573, -0.23999363724232733, -0.35217275858395597, -0.04314749428631683, -0.3653766574717841, -0.0803154086811667, 0.16370823779211208, 0.041085692755516295, -0.04419667431090063, -0.034622090733022366, -0.061108547696861824, -0.10547773445757486, -0.19595443621928832, 0.2585707415998416, 0.06213294692084338, 0.3309693190820732, 0.11165883430523925, 0.03460349166512634, 0.0024743956531786803, 0.19206053421841662, 0.08111698611851927, -0.1423730607618814, -0.007102041197850287, 0.2654538012100655, -0.17924462414337594, 0.2175370618266967, -0.3840501872743243, -0.25968929880199215, -0.02237859512091551, 0.13287801993558707, 0.15099392128962508, -0.14943849327024614, -0.2713177010814831, 0.04110546914625515, -0.0991379876476396, -0.09439103725791267, -0.06361244391939304, -0.04589935595020471, -0.007015720952428805, -0.26477409863519, 0.1576115140573854, 0.10510365355723691, 0.12309123421069777, -0.14181121681066391, -0.13724833000813005, -0.05793193482468357, -0.0021801701954846245, 0.07301982940577006, 0.07914673898242486, 0.20605769833364496, -0.0732646051938962, -0.08788987493269074, 0.295134976840786, -0.07188592139403766, 0.0113003616519634, 0.1439572426951626, -0.2642969132663266, -0.009957864767537244, 0.23845747142162138, 0.07978411641839928, 0.07811545312079121, -0.13688532110231305, 0.08662975432653007, 0.04502161265378004, 0.18851516140332852, 0.028312940758571607, 0.026734733547183497, 0.22938149803978147, 0.25707321558871027, 0.03005316660929363, 0.17056166951884222, -0.16579069778011227, -0.01186265335960802, -0.18434633296525593, -0.15673659409134133, -0.25899329071963945, 0.09470999719647383, -0.10217143690569024, -0.20121271648326688, 0.35925214468570454, 0.14148232690284698, 0.22177736585941707, -0.04562722133852325, 0.24313942976386368, 0.14805977019928937, 0.07629849608011037, 0.04683622970580331, 0.2537306400413797, 0.1660998226866777, 0.227771456181569, -0.3423300562132584, 0.16025313576321723, -0.02044516531648838] |
1,802.07057 | Physics at the Munich Tandem Accelerator Laboratory | This review reports on the science performed in various fields at the Munich
tandem accelerator during the past decade. It covers nuclear structure studies,
also with respect to astro- and particle physics as well as for the
understanding of fundamental symmetries, the extremely sensitive detection of
long-lived radionuclides from Supernova or r-process production with
accelerator mass spectrometry and studies of the elemental composition of thin
films with extreme depth resolution and sensitivity by elastic recoil detection
(ERD). The ion microbeam is used for 3D hydrogen microscopy as well as in
radiobiology to study the response of living cells on well-defined
irradiations. In medical research new therapeutic methods of tumour irradiation
are tested using proton minibeams as well as the determination of ion ranges in
tissue with iono-acoustics. Primary and secondary beams from the accelerator
are also used for development and testing of detector components in large
setups, e.g. at the LHC, and for testing new kinds of fuel materials of high
uranium density to use them as medium enriched fuels at the Munich research
reactor FRM II in the future.
| nucl-ex | this review reports on the science performed in various fields at the munich tandem accelerator during the past decade it covers nuclear structure studies also with respect to astro and particle physics as well as for the understanding of fundamental symmetries the extremely sensitive detection of longlived radionuclides from supernova or rprocess production with accelerator mass spectrometry and studies of the elemental composition of thin films with extreme depth resolution and sensitivity by elastic recoil detection erd the ion microbeam is used for 3d hydrogen microscopy as well as in radiobiology to study the response of living cells on welldefined irradiations in medical research new therapeutic methods of tumour irradiation are tested using proton minibeams as well as the determination of ion ranges in tissue with ionoacoustics primary and secondary beams from the accelerator are also used for development and testing of detector components in large setups eg at the lhc and for testing new kinds of fuel materials of high uranium density to use them as medium enriched fuels at the munich research reactor frm ii in the future | [['this', 'review', 'reports', 'on', 'the', 'science', 'performed', 'in', 'various', 'fields', 'at', 'the', 'munich', 'tandem', 'accelerator', 'during', 'the', 'past', 'decade', 'it', 'covers', 'nuclear', 'structure', 'studies', 'also', 'with', 'respect', 'to', 'astro', 'and', 'particle', 'physics', 'as', 'well', 'as', 'for', 'the', 'understanding', 'of', 'fundamental', 'symmetries', 'the', 'extremely', 'sensitive', 'detection', 'of', 'longlived', 'radionuclides', 'from', 'supernova', 'or', 'rprocess', 'production', 'with', 'accelerator', 'mass', 'spectrometry', 'and', 'studies', 'of', 'the', 'elemental', 'composition', 'of', 'thin', 'films', 'with', 'extreme', 'depth', 'resolution', 'and', 'sensitivity', 'by', 'elastic', 'recoil', 'detection', 'erd', 'the', 'ion', 'microbeam', 'is', 'used', 'for', '3d', 'hydrogen', 'microscopy', 'as', 'well', 'as', 'in', 'radiobiology', 'to', 'study', 'the', 'response', 'of', 'living', 'cells', 'on', 'welldefined', 'irradiations', 'in', 'medical', 'research', 'new', 'therapeutic', 'methods', 'of', 'tumour', 'irradiation', 'are', 'tested', 'using', 'proton', 'minibeams', 'as', 'well', 'as', 'the', 'determination', 'of', 'ion', 'ranges', 'in', 'tissue', 'with', 'ionoacoustics', 'primary', 'and', 'secondary', 'beams', 'from', 'the', 'accelerator', 'are', 'also', 'used', 'for', 'development', 'and', 'testing', 'of', 'detector', 'components', 'in', 'large', 'setups', 'eg', 'at', 'the', 'lhc', 'and', 'for', 'testing', 'new', 'kinds', 'of', 'fuel', 'materials', 'of', 'high', 'uranium', 'density', 'to', 'use', 'them', 'as', 'medium', 'enriched', 'fuels', 'at', 'the', 'munich', 'research', 'reactor', 'frm', 'ii', 'in', 'the', 'future']] | [0.030175459868761217, 0.17656365787254624, -0.013083866363119208, 0.040176017137945455, 0.0026197970577965628, -0.11647739146379597, -0.012519361150746621, 0.38114306563562583, -0.21460429200735154, -0.35494575686288443, 0.10521214225282369, -0.31080213746087354, -0.021912250998743884, 0.2551273127495876, -0.00591681406079802, 0.08616452653149373, 0.06315846901761075, -0.008907773045383477, -0.038003662172077075, -0.17127350862844312, 0.2654830817946787, 0.17758164101730237, 0.3129541831813083, 0.07662508651248592, 0.07854434717682013, 0.007396951223608483, -0.04752125475376457, -0.029171073046680332, -0.1080774256383694, 0.09928695123846737, 0.31536415482721136, 0.141761275050178, 0.20088610880396046, -0.47995060263986417, -0.22925954306788554, 0.04790882789660664, 0.11471814582452343, 0.06601409173931591, -0.13714851489097005, -0.24289712008988756, 0.0329866651507759, -0.18544395525385154, -0.13933175991847196, -0.03325608226449721, 0.007908175014001265, 0.08889546367638022, -0.241581584856024, 0.04493144904936957, -0.04729696072433981, 0.1188826241773773, -0.09590299264135446, -0.17595560997044354, 0.008993481320533065, 0.10215468278411106, 0.07876314158261011, 0.015125207842348583, 0.21822678980553586, -0.18136930885316616, -0.08898647747844918, 0.4039589472617326, -0.032687605753687496, -0.06872198302455748, 0.2303379884073406, -0.18456766802500058, -0.15880718217179013, 0.10420727925741355, 0.22368714456143005, 0.10825336069062226, -0.16889495175008745, 0.02428698123581812, 0.03251163812231252, 0.13338417870476038, 0.11849498612220201, 0.027004998728505068, 0.24938470395831286, 0.27696392800674635, 0.0215269793880815, 0.07055896123118431, -0.15554632498961848, 0.008442895316252004, -0.28376629743973586, -0.1652539369514149, -0.09828517191227149, 0.024453557163131624, 0.006486505568727296, -0.1398634592965873, 0.3818282683515984, 0.1031336611309455, 0.1340909359611707, -0.08539780127335853, 0.30344832048678166, -0.012368757507287678, 0.1103051776403896, -0.03279839821547019, 0.2473194664815085, 0.143963027173873, 0.14780035650423332, -0.2312049695216721, 0.09769126012126046, -0.0029484180137096497] |
1,802.07058 | A quantitative first-order approach for the scattering of light by
structured thin films | We present a full vectorial first-order approach to the scattering by
arbitrary photonic structures with a low refractive index contrast. Our
approach uses the first-order Born approximation and keeps the simple
geometrical representation of the Ewald sphere construction. Via normalization
to a representative sample volume, the approach can also predict the scattering
by infinitely extended layers of scattering media. It can therefore be used to
describe and efficiently calculate the scattering by structures where the
linear first-order scattering terms dominate, e.g. in low index contrast
disordered structures creating a color impression.
| physics.optics | we present a full vectorial firstorder approach to the scattering by arbitrary photonic structures with a low refractive index contrast our approach uses the firstorder born approximation and keeps the simple geometrical representation of the ewald sphere construction via normalization to a representative sample volume the approach can also predict the scattering by infinitely extended layers of scattering media it can therefore be used to describe and efficiently calculate the scattering by structures where the linear firstorder scattering terms dominate eg in low index contrast disordered structures creating a color impression | [['we', 'present', 'a', 'full', 'vectorial', 'firstorder', 'approach', 'to', 'the', 'scattering', 'by', 'arbitrary', 'photonic', 'structures', 'with', 'a', 'low', 'refractive', 'index', 'contrast', 'our', 'approach', 'uses', 'the', 'firstorder', 'born', 'approximation', 'and', 'keeps', 'the', 'simple', 'geometrical', 'representation', 'of', 'the', 'ewald', 'sphere', 'construction', 'via', 'normalization', 'to', 'a', 'representative', 'sample', 'volume', 'the', 'approach', 'can', 'also', 'predict', 'the', 'scattering', 'by', 'infinitely', 'extended', 'layers', 'of', 'scattering', 'media', 'it', 'can', 'therefore', 'be', 'used', 'to', 'describe', 'and', 'efficiently', 'calculate', 'the', 'scattering', 'by', 'structures', 'where', 'the', 'linear', 'firstorder', 'scattering', 'terms', 'dominate', 'eg', 'in', 'low', 'index', 'contrast', 'disordered', 'structures', 'creating', 'a', 'color', 'impression']] | [-0.0580206248745486, 0.1412568907509302, -0.11633532898561967, 0.08616642273737343, -0.07717371825128794, -0.1041698903868814, 0.034674554088429274, 0.3879199040705686, -0.29842945601750204, -0.31031694353537653, 0.053053507211638595, -0.2596813885413192, -0.2024990935441475, 0.13181188757848608, 0.016550195925347098, 0.050793476054792876, -0.00889431853052024, 0.00046492089609523395, -0.06962171799738656, -0.19108423729846766, 0.30252438350734145, 0.014761451984868272, 0.3038919705559837, 0.03425108902361039, 0.07510048692923162, 0.1083791119169321, -0.03496934760075349, 0.0506608971998423, -0.07635969920646768, 0.16609594314666157, 0.2643757563923578, 0.015768464470466415, 0.1742990855946318, -0.4321626571852523, -0.23717392438345916, 0.03322402551606461, 0.16282196169265592, 0.134448561341512, -0.050315476687891145, -0.25440341672235794, 0.05565745658292384, -0.17229626940020903, -0.148899607254182, -0.12441030780754082, -0.023323545718545113, -0.00619061981010568, -0.2660322875439466, 0.04178273227739987, 0.05079535699889555, -0.01946917087463969, -0.06330160541552027, -0.04881069477766517, 0.025722065822804695, 0.06561435928957148, -0.04031764595145053, -0.0038413238957278675, 0.12705108921483652, -0.12099605035241488, -0.08395974246585476, 0.42126219343025606, -0.08223607406794295, -0.19817121994200643, 0.18294630826010808, -0.1195253247170003, -0.034927241276478865, 0.20940763074495308, 0.19136129642048708, 0.13583890400100296, -0.11096856595723184, 0.09566970508236049, -0.03030854927191695, 0.2043699921200891, 0.11318310169799888, 0.005034646843201839, 0.17502667799919516, 0.1437877282797062, 0.0027229905865349614, 0.16852343128802214, -0.10012854791788774, -0.06461163279651613, -0.28239347828695405, -0.13485367624965436, -0.1638602139300329, 0.016223823457219445, -0.1346320503050395, -0.22402390246126022, 0.3486257715580555, 0.12147451877327901, 0.21169213764369488, 0.04992979697391882, 0.3259965411776288, 0.16977558060482675, 0.10616906786562649, 0.06601703292843732, 0.22031987988093232, 0.14785472861143176, 0.0804259102832485, -0.19209485182763783, 0.05409071541002409, 0.08722723178197067] |
1,802.07059 | Toric Fano varieties associated to graph cubeahedra | We give a necessary and sufficient condition for the nonsingular projective
toric variety associated to the graph cubeahedron of a finite simple graph to
be Fano or weak Fano in terms of the graph.
| math.AG math.CO | we give a necessary and sufficient condition for the nonsingular projective toric variety associated to the graph cubeahedron of a finite simple graph to be fano or weak fano in terms of the graph | [['we', 'give', 'a', 'necessary', 'and', 'sufficient', 'condition', 'for', 'the', 'nonsingular', 'projective', 'toric', 'variety', 'associated', 'to', 'the', 'graph', 'cubeahedron', 'of', 'a', 'finite', 'simple', 'graph', 'to', 'be', 'fano', 'or', 'weak', 'fano', 'in', 'terms', 'of', 'the', 'graph']] | [-0.18526005082051544, 0.013916578883414759, -0.06041161748854553, 0.10752186102463919, -0.157040671500213, -0.20196843265062747, -0.0188635552973103, 0.35135114570970044, -0.2570455822655383, -0.20820249899235718, 0.09843475573956419, -0.1609403325847405, -0.19061257441610316, 0.17502614066196495, -0.17498416765866912, 0.024427175453370985, 0.07992755341590108, 0.11305097041322905, -0.07997001858208985, -0.3264112731378512, 0.42934052383198457, -0.05749140422352973, 0.21791015464045546, 0.19034009362461374, 0.14253508880296173, 0.029834025361410835, 0.06274642134924173, 0.10643104803474511, -0.1951607495875043, 0.09067065745372982, 0.32283949323327227, 0.13812770716407718, 0.14380839861491146, -0.4132823716191685, -0.13701973180286586, 0.2914091605857453, 0.06868611515828353, 0.1250559229622869, 0.014574520248810159, -0.2511257220278768, 0.19865868131027503, -0.1342348365441841, -0.14962952321066575, -0.09339208870797473, -0.009541912387837382, 0.039458276977872145, -0.30529910441049757, -0.02298629703000188, 0.13158476796439467, 0.1345828156644369, 0.07479748935164775, -0.009305796846199562, -0.05341132565894548, 0.035857196465846806, -0.12784314040532885, 0.029010329080526445, 0.039870226112030005, -0.11946410872042179, -0.1035801666405271, 0.3901720640852171, -0.07511391311281305, -0.20518361634629614, 0.12411943165694966, -0.1118362047983443, -0.1032025096938014, 0.19743086966028547, 0.15089816085117705, 0.11764840387246188, -0.06404786151559914, 0.1017450591093888, -0.06069347371949869, 0.035863782005275, 0.07819060060907812, 0.03666180279105902, 0.1133261828628533, 0.08115302697371911, 0.16933232225368128, 0.15041356322506225, 0.016766796653802672, 0.003850890980923877, -0.40009672391940565, -0.14948977108168252, -0.17835308244342313, 0.2087445517673212, -0.20268098410066587, -0.25385158240576, 0.4737911220530377, -0.0058728157926131695, 0.26984527942669745, 0.01957532316994141, 0.23221066955696135, 0.07223793066291631, -0.02218614567947738, 0.0186924727715771, 0.10842750930939526, 0.2542808234472485, -0.03769307742443155, -0.1743383514420951, 0.004288416390088113, 0.13666301934212885] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.