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.0306 | Simulations of Galactic polarized synchrotron emission for Epoch of
Reionization observations | The detection of the redshifted cosmological $21$~cm line signal requires the
removal of the Galactic and extragalactic foreground emission, which is orders
of magnitude brighter anywhere in the sky. Foreground cleaning methods
currently used are efficient in removing spectrally smooth components. However,
they struggle in the presence of not spectrally smooth contamination that is,
therefore, potentially the most dangerous one. An example of this is the
polarized synchrotron emission, which is Faraday rotated by the interstellar
medium and leaks into total intensity due to instrumental imperfections. In
this work we present new full-sky simulations of this polarized synchrotron
emission in the $50-200$~MHz range, obtained from the observed properties of
diffuse polarized emission at low frequencies. The simulated polarized maps are
made publicly available, aiming to provide more realistic templates to simulate
the effect of instrumental leakage and the effectiveness of foreground
separation techniques.
| astro-ph.CO | the detection of the redshifted cosmological 21cm line signal requires the removal of the galactic and extragalactic foreground emission which is orders of magnitude brighter anywhere in the sky foreground cleaning methods currently used are efficient in removing spectrally smooth components however they struggle in the presence of not spectrally smooth contamination that is therefore potentially the most dangerous one an example of this is the polarized synchrotron emission which is faraday rotated by the interstellar medium and leaks into total intensity due to instrumental imperfections in this work we present new fullsky simulations of this polarized synchrotron emission in the 50200mhz range obtained from the observed properties of diffuse polarized emission at low frequencies the simulated polarized maps are made publicly available aiming to provide more realistic templates to simulate the effect of instrumental leakage and the effectiveness of foreground separation techniques | [['the', 'detection', 'of', 'the', 'redshifted', 'cosmological', '21cm', 'line', 'signal', 'requires', 'the', 'removal', 'of', 'the', 'galactic', 'and', 'extragalactic', 'foreground', 'emission', 'which', 'is', 'orders', 'of', 'magnitude', 'brighter', 'anywhere', 'in', 'the', 'sky', 'foreground', 'cleaning', 'methods', 'currently', 'used', 'are', 'efficient', 'in', 'removing', 'spectrally', 'smooth', 'components', 'however', 'they', 'struggle', 'in', 'the', 'presence', 'of', 'not', 'spectrally', 'smooth', 'contamination', 'that', 'is', 'therefore', 'potentially', 'the', 'most', 'dangerous', 'one', 'an', 'example', 'of', 'this', 'is', 'the', 'polarized', 'synchrotron', 'emission', 'which', 'is', 'faraday', 'rotated', 'by', 'the', 'interstellar', 'medium', 'and', 'leaks', 'into', 'total', 'intensity', 'due', 'to', 'instrumental', 'imperfections', 'in', 'this', 'work', 'we', 'present', 'new', 'fullsky', 'simulations', 'of', 'this', 'polarized', 'synchrotron', 'emission', 'in', 'the', '50200mhz', 'range', 'obtained', 'from', 'the', 'observed', 'properties', 'of', 'diffuse', 'polarized', 'emission', 'at', 'low', 'frequencies', 'the', 'simulated', 'polarized', 'maps', 'are', 'made', 'publicly', 'available', 'aiming', 'to', 'provide', 'more', 'realistic', 'templates', 'to', 'simulate', 'the', 'effect', 'of', 'instrumental', 'leakage', 'and', 'the', 'effectiveness', 'of', 'foreground', 'separation', 'techniques']] | [-0.050572211509013, 0.0904011383209366, -0.04428307708593833, 0.07724421051360378, -0.09729659885436978, -0.06688890734057822, -0.011302413210653188, 0.46696457502261646, -0.2451593226295712, -0.28865770027566123, 0.07490446680458263, -0.30214201144113295, -0.01820597752541776, 0.21839417041030149, -0.010951849156465958, -0.010593284383042335, -0.01141769908578463, -0.14033832277222963, 0.012975326681043953, -0.2421005934511285, 0.29306381918870333, 0.12744803352176515, 0.2530619741161682, 0.03241415021442611, 0.06148786799987109, -0.06069256555498906, -0.14690763036340054, -0.012562338831550834, -0.026046083107335298, 0.09608036686968006, 0.3014680675926133, 0.13621163303950723, 0.16285511468943786, -0.39678410028146816, -0.2602396714697841, 0.13706896516402634, 0.13194074533333752, 0.1198021296500294, -0.06273952511052723, -0.30533090978204996, 0.036840728839898716, -0.09904352764756431, -0.1576400769179241, -0.012531842846213512, 0.007072889893709249, -0.017538621592906003, -0.2175323992974164, 0.08414545761827956, 0.049494083714999366, 0.06578981406120978, -0.03741732659966121, -0.10601220361914643, -0.04946010437807147, 0.10290732920828971, 0.021718058982719734, 0.046513347074669836, 0.18565378201351515, -0.14954009458166875, -0.053973978280391494, 0.42410997376764115, -0.10067723367468152, -0.09087265692126582, 0.1761794756133844, -0.18666162021608998, -0.14189979530097, 0.2608910325101354, 0.1817965579127342, 0.13658032497115644, -0.16173607234934895, 0.0031143557335640316, 0.033667257458994716, 0.21535998419202654, 0.08757472048434888, 0.04211592164651399, 0.28340854731873727, 0.09766949628624068, 0.07954087743036979, 0.16644206425358712, -0.25851161047999915, 0.01704399425759387, -0.26867516297178057, -0.029165813322244605, -0.13541412962482532, 0.09223620925259754, -0.07407961285668573, -0.1387844427003407, 0.37429649741913545, 0.2050052632144849, 0.15520468114016078, -0.01736329054184468, 0.46162969818417454, 0.06805713669869157, 0.06348547534885961, 0.06206219054514241, 0.3009389945556751, 0.1256297012236835, 0.060480584761022894, -0.19597528298454306, 0.08160770494608917, -0.08221598378461327] |
1,802.03061 | Fast algorithms for integral formulations of steady-state radiative
transfer equation | We investigate integral formulations and fast algorithms for the steady-state
radiative transfer equation with isotropic and anisotropic scattering. When the
scattering term is a smooth convolution on the unit sphere, a model reduction
step in the angular domain using the Fourier transformation in 2D and the
spherical harmonic transformation in 3D significantly reduces the number of
degrees of freedoms. The resulting Fourier coefficients or spherical harmonic
coefficients satisfy a Fredholm integral equation of the second kind. We study
the uniqueness of the equation and proved an a priori estimate. For a
homogeneous medium, the integral equation can be solved efficiently using the
FFT and iterative methods. For an inhomogeneous medium, the recursive
skeletonization factorization method is applied instead. Numerical simulations
demonstrate the efficiency of the proposed algorithms in both homogeneous and
inhomogeneous cases and for both transport and diffusion regimes.
| math.NA | we investigate integral formulations and fast algorithms for the steadystate radiative transfer equation with isotropic and anisotropic scattering when the scattering term is a smooth convolution on the unit sphere a model reduction step in the angular domain using the fourier transformation in 2d and the spherical harmonic transformation in 3d significantly reduces the number of degrees of freedoms the resulting fourier coefficients or spherical harmonic coefficients satisfy a fredholm integral equation of the second kind we study the uniqueness of the equation and proved an a priori estimate for a homogeneous medium the integral equation can be solved efficiently using the fft and iterative methods for an inhomogeneous medium the recursive skeletonization factorization method is applied instead numerical simulations demonstrate the efficiency of the proposed algorithms in both homogeneous and inhomogeneous cases and for both transport and diffusion regimes | [['we', 'investigate', 'integral', 'formulations', 'and', 'fast', 'algorithms', 'for', 'the', 'steadystate', 'radiative', 'transfer', 'equation', 'with', 'isotropic', 'and', 'anisotropic', 'scattering', 'when', 'the', 'scattering', 'term', 'is', 'a', 'smooth', 'convolution', 'on', 'the', 'unit', 'sphere', 'a', 'model', 'reduction', 'step', 'in', 'the', 'angular', 'domain', 'using', 'the', 'fourier', 'transformation', 'in', '2d', 'and', 'the', 'spherical', 'harmonic', 'transformation', 'in', '3d', 'significantly', 'reduces', 'the', 'number', 'of', 'degrees', 'of', 'freedoms', 'the', 'resulting', 'fourier', 'coefficients', 'or', 'spherical', 'harmonic', 'coefficients', 'satisfy', 'a', 'fredholm', 'integral', 'equation', 'of', 'the', 'second', 'kind', 'we', 'study', 'the', 'uniqueness', 'of', 'the', 'equation', 'and', 'proved', 'an', 'a', 'priori', 'estimate', 'for', 'a', 'homogeneous', 'medium', 'the', 'integral', 'equation', 'can', 'be', 'solved', 'efficiently', 'using', 'the', 'fft', 'and', 'iterative', 'methods', 'for', 'an', 'inhomogeneous', 'medium', 'the', 'recursive', 'skeletonization', 'factorization', 'method', 'is', 'applied', 'instead', 'numerical', 'simulations', 'demonstrate', 'the', 'efficiency', 'of', 'the', 'proposed', 'algorithms', 'in', 'both', 'homogeneous', 'and', 'inhomogeneous', 'cases', 'and', 'for', 'both', 'transport', 'and', 'diffusion', 'regimes']] | [-0.098348827665073, 0.046037035530441375, -0.09301316996238061, 0.052939433544608096, -0.07475571402548147, -0.09135932718137545, -0.030558937302391443, 0.3759702839422971, -0.328517293148408, -0.2326799437802817, 0.11860121750671948, -0.24962508343825382, -0.1518281517271784, 0.20785591522830404, 0.023108184772510348, 0.09969281843597336, 0.07434679650302445, -0.013687767131653214, -0.1136940613189446, -0.21632847272059216, 0.3243692631367594, 0.021510633480335984, 0.28215447517910175, 0.011959202294903142, 0.16116772820574365, 0.043432646793579416, -0.06283152161299117, 0.00031689225089784096, -0.12883834379192974, 0.10703809807476189, 0.18410581568854728, 0.0202849976286026, 0.2314094310177357, -0.4545649819541723, -0.24017761565212692, 0.06904861218562083, 0.17632737127797946, 0.09661399693494396, -0.044481354389738825, -0.2438132284708055, 0.019696660368936136, -0.12601710170773522, -0.16157057708062764, -0.11140224570408463, -0.012379526320312704, 0.06220342898408749, -0.33963262031653096, 0.12363384812088044, 0.08131922332603218, 0.008054853091016412, -0.1120894303877971, -0.08358125616796315, 0.03451183715702168, 0.06909771095483198, -0.011905115565917055, -0.005177027626528538, 0.07280099915473588, -0.15640211383080377, -0.057379549914704904, 0.3830175677306085, -0.07877879967563786, -0.29669849294503886, 0.13685813851521483, -0.1192188351814236, -0.0664322485980977, 0.17020458022598178, 0.18099018685253604, 0.15981058066577783, -0.1359589398627577, 0.12132561474240251, -0.03358514600300363, 0.15260776704443352, 0.07659475741675123, -0.042329218532956604, 0.10050497397647372, 0.1156952536947626, 0.05755835340907132, 0.16569911037887713, -0.09671856457134709, -0.09548498405347346, -0.28243752576942954, -0.1964865772694923, -0.22407538176880085, 0.03995714098813811, -0.15627708456928044, -0.1702946886819388, 0.37008080847029173, 0.08831906741917399, 0.1291103619749525, 0.05177066213052187, 0.3182300331636465, 0.21311683916885937, 0.028588867879339626, 0.09361202598748995, 0.1925238446698391, 0.18069593300377684, 0.13447275446129164, -0.26837131154544686, -0.003794100315177015, 0.1596548988018185] |
1,802.03062 | Multiple shadows from distorted static black holes | We study the local shadow of the Schwarzschild black hole with a quadrupole
distortion and the influence of the external gravitational field on the photon
dynamics. The external matter sources modify the light ring structure and lead
to the appearance of multiple shadow images. In the case of negative quadrupole
moments we identify the most prominent mechanism causing multiple shadow
formation. Furthermore, we obtain a condition under which this mechanism can be
realized. This condition depends on the quadrupole moment, but also on the
position of the observer and the celestial sphere.
| gr-qc astro-ph.HE | we study the local shadow of the schwarzschild black hole with a quadrupole distortion and the influence of the external gravitational field on the photon dynamics the external matter sources modify the light ring structure and lead to the appearance of multiple shadow images in the case of negative quadrupole moments we identify the most prominent mechanism causing multiple shadow formation furthermore we obtain a condition under which this mechanism can be realized this condition depends on the quadrupole moment but also on the position of the observer and the celestial sphere | [['we', 'study', 'the', 'local', 'shadow', 'of', 'the', 'schwarzschild', 'black', 'hole', 'with', 'a', 'quadrupole', 'distortion', 'and', 'the', 'influence', 'of', 'the', 'external', 'gravitational', 'field', 'on', 'the', 'photon', 'dynamics', 'the', 'external', 'matter', 'sources', 'modify', 'the', 'light', 'ring', 'structure', 'and', 'lead', 'to', 'the', 'appearance', 'of', 'multiple', 'shadow', 'images', 'in', 'the', 'case', 'of', 'negative', 'quadrupole', 'moments', 'we', 'identify', 'the', 'most', 'prominent', 'mechanism', 'causing', 'multiple', 'shadow', 'formation', 'furthermore', 'we', 'obtain', 'a', 'condition', 'under', 'which', 'this', 'mechanism', 'can', 'be', 'realized', 'this', 'condition', 'depends', 'on', 'the', 'quadrupole', 'moment', 'but', 'also', 'on', 'the', 'position', 'of', 'the', 'observer', 'and', 'the', 'celestial', 'sphere']] | [-0.17865819049968748, 0.09188096102772524, -0.079474804551909, 0.08957228368988422, -0.09269097322881546, -0.06931461737005283, 0.0025712346370868468, 0.3446645271842894, -0.2410214135977541, -0.31276461421309604, 0.07346623551743307, -0.2549825878813863, -0.14064048836007714, 0.16739411385851385, -0.026111168219991352, -0.03381941815630695, -0.01763141660131109, 0.09839367420594815, -0.06385765742996465, -0.20088209912089794, 0.3683755856776691, 0.12573311447530336, 0.2580316151573282, 0.0575116877716146, 0.08978823613901825, 0.04655701704525753, 0.016147255269891542, 0.02657822348460879, -0.10545252124511931, 0.08154125145191084, 0.10098495860786541, 0.09295851717410109, 0.19359738706439006, -0.432021032816366, -0.18633750148886896, 0.11063825867503234, 0.09200138068737705, 0.15143422884537597, -0.08859027365511081, -0.3059583355485381, 0.04658828235393309, -0.15781959473742577, -0.15558694478671026, -0.03071100091683152, -0.006716011453966569, 0.023392002460162115, -0.24979886273529148, 0.07434859525370563, 0.11015167111611884, -0.0008119994713722364, -0.1370462784189326, -0.04655463977352432, -0.014949901677344156, 0.10747450682759771, 0.10172878372806894, 0.03645786587604443, 0.21966681522620923, -0.13403088288475334, -0.06923131239296787, 0.38601741114752774, -0.061778577722851995, -0.20502220861785841, 0.12794842559346958, -0.25129480941383087, -0.09562435652048368, 0.12496866162299462, 0.19259795115288833, 0.1724435493916921, -0.09593594881627486, 0.05619476356799208, -0.015247484800689246, 0.17078026433718269, 0.12390932081388714, 0.07682816336012405, 0.34087705757448694, 0.07440939114388564, 0.066210989764722, 0.18479643149539302, -0.1836276315481645, -0.0670064727411322, -0.2975580866319512, -0.09851463101348719, -0.14826718415133655, 0.053156564477831125, -0.11600888571047108, -0.17821502137319287, 0.41071953032287245, 0.11902112136917624, 0.20494797810628687, -0.054878538493421336, 0.29615781624275056, 0.10407778537584185, 0.06387563841923585, 0.048413250780077244, 0.3186933408977221, 0.09380592828940439, 0.08425941208185142, -0.2988418380770346, 0.043706183397697045, 0.047118587826844305] |
1,802.03063 | Learning Latent Representations in Neural Networks for Clustering
through Pseudo Supervision and Graph-based Activity Regularization | In this paper, we propose a novel unsupervised clustering approach exploiting
the hidden information that is indirectly introduced through a pseudo
classification objective. Specifically, we randomly assign a pseudo
parent-class label to each observation which is then modified by applying the
domain specific transformation associated with the assigned label. Generated
pseudo observation-label pairs are subsequently used to train a neural network
with Auto-clustering Output Layer (ACOL) that introduces multiple softmax nodes
for each pseudo parent-class. Due to the unsupervised objective based on
Graph-based Activity Regularization (GAR) terms, softmax duplicates of each
parent-class are specialized as the hidden information captured through the
help of domain specific transformations is propagated during training.
Ultimately we obtain a k-means friendly latent representation. Furthermore, we
demonstrate how the chosen transformation type impacts performance and helps
propagate the latent information that is useful in revealing unknown clusters.
Our results show state-of-the-art performance for unsupervised clustering tasks
on MNIST, SVHN and USPS datasets, with the highest accuracies reported to date
in the literature.
| cs.LG stat.ML | in this paper we propose a novel unsupervised clustering approach exploiting the hidden information that is indirectly introduced through a pseudo classification objective specifically we randomly assign a pseudo parentclass label to each observation which is then modified by applying the domain specific transformation associated with the assigned label generated pseudo observationlabel pairs are subsequently used to train a neural network with autoclustering output layer acol that introduces multiple softmax nodes for each pseudo parentclass due to the unsupervised objective based on graphbased activity regularization gar terms softmax duplicates of each parentclass are specialized as the hidden information captured through the help of domain specific transformations is propagated during training ultimately we obtain a kmeans friendly latent representation furthermore we demonstrate how the chosen transformation type impacts performance and helps propagate the latent information that is useful in revealing unknown clusters our results show stateoftheart performance for unsupervised clustering tasks on mnist svhn and usps datasets with the highest accuracies reported to date in the literature | [['in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'unsupervised', 'clustering', 'approach', 'exploiting', 'the', 'hidden', 'information', 'that', 'is', 'indirectly', 'introduced', 'through', 'a', 'pseudo', 'classification', 'objective', 'specifically', 'we', 'randomly', 'assign', 'a', 'pseudo', 'parentclass', 'label', 'to', 'each', 'observation', 'which', 'is', 'then', 'modified', 'by', 'applying', 'the', 'domain', 'specific', 'transformation', 'associated', 'with', 'the', 'assigned', 'label', 'generated', 'pseudo', 'observationlabel', 'pairs', 'are', 'subsequently', 'used', 'to', 'train', 'a', 'neural', 'network', 'with', 'autoclustering', 'output', 'layer', 'acol', 'that', 'introduces', 'multiple', 'softmax', 'nodes', 'for', 'each', 'pseudo', 'parentclass', 'due', 'to', 'the', 'unsupervised', 'objective', 'based', 'on', 'graphbased', 'activity', 'regularization', 'gar', 'terms', 'softmax', 'duplicates', 'of', 'each', 'parentclass', 'are', 'specialized', 'as', 'the', 'hidden', 'information', 'captured', 'through', 'the', 'help', 'of', 'domain', 'specific', 'transformations', 'is', 'propagated', 'during', 'training', 'ultimately', 'we', 'obtain', 'a', 'kmeans', 'friendly', 'latent', 'representation', 'furthermore', 'we', 'demonstrate', 'how', 'the', 'chosen', 'transformation', 'type', 'impacts', 'performance', 'and', 'helps', 'propagate', 'the', 'latent', 'information', 'that', 'is', 'useful', 'in', 'revealing', 'unknown', 'clusters', 'our', 'results', 'show', 'stateoftheart', 'performance', 'for', 'unsupervised', 'clustering', 'tasks', 'on', 'mnist', 'svhn', 'and', 'usps', 'datasets', 'with', 'the', 'highest', 'accuracies', 'reported', 'to', 'date', 'in', 'the', 'literature']] | [-0.04314072956842166, 0.052347941967238465, -0.07111023781003385, 0.08417628641544114, -0.1784856523821562, -0.17547845672876375, 0.062127657740791445, 0.45347521757343556, -0.30862185763331446, -0.31604607191459255, 0.061440695730952274, -0.2742300306378705, -0.19274322222066453, 0.12319981718645999, -0.10798160615945007, 0.057877743795582255, 0.11832551244737172, 0.11388593701157355, -0.08023924963327306, -0.2984512829216106, 0.3254040132266776, 0.042378622567190265, 0.3535225526202561, -0.03767330327465926, 0.15647208269418603, 0.003149982005330768, -0.05465007818477206, -0.013942771509613433, -0.059590711101430695, 0.15861879849115035, 0.2759228809268168, 0.17617986961651208, 0.3375479022336261, -0.36225413293407366, -0.21361462430738867, 0.09920408813106804, 0.1510067086399919, 0.0857471963959475, -0.055191711738433055, -0.34346566309942295, 0.1132939050737882, -0.14309425791725516, 0.03605763770912478, -0.13749216756465413, -0.08632107966057048, -0.003585779633395737, -0.2980420624258042, 0.07113490092280433, 0.060542095957605006, 0.020112402140867056, -0.07294740454398846, -0.11200517300294893, -0.02266468880158599, 0.15045665233060945, 0.013941912022213418, 0.07110607204461902, 0.1388471749477747, -0.13375490687350267, -0.15384063726963998, 0.3237716242509167, -0.06376083086034647, -0.25102791003315006, 0.1796690550896839, 0.007400851020952914, -0.16470777156490196, 0.08066400951456006, 0.2296780022713015, 0.10249110379131375, -0.17758979052645948, -0.017493467077345972, -0.033334510744813396, 0.18280761643233367, 0.06539393483842837, -0.01251987520344101, 0.16194706106886392, 0.2095740890675565, 0.007284586425734366, 0.21746523230813625, -0.13980521394735593, -0.042399050638778135, -0.22911250551561996, -0.09846577853271056, -0.22218795502757108, -0.03542495750830645, -0.09752552164132883, -0.13239489864308115, 0.41382027997794313, 0.21234781899870653, 0.26489290418444067, 0.07875842779729993, 0.3115515532724491, 0.044205482921381364, 0.13017543173031654, 0.10160106281670402, 0.16433794322003406, 0.049624353398784724, 0.072719150986636, -0.16429309790283897, 0.10114966768902023, 0.06139856088898008] |
1,802.03064 | Comparison of data-driven uncertainty quantification methods for a
carbon dioxide storage benchmark scenario | A variety of methods is available to quantify uncertainties arising with\-in
the modeling of flow and transport in carbon dioxide storage, but there is a
lack of thorough comparisons. Usually, raw data from such storage sites can
hardly be described by theoretical statistical distributions since only very
limited data is available. Hence, exact information on distribution shapes for
all uncertain parameters is very rare in realistic applications. We discuss and
compare four different methods tested for data-driven uncertainty
quantification based on a benchmark scenario of carbon dioxide storage. In the
benchmark, for which we provide data and code, carbon dioxide is injected into
a saline aquifer modeled by the nonlinear capillarity-free fractional flow
formulation for two incompressible fluid phases, namely carbon dioxide and
brine. To cover different aspects of uncertainty quantification, we incorporate
various sources of uncertainty such as uncertainty of boundary conditions, of
conceptual model definitions and of material properties. We consider recent
versions of the following non-intrusive and intrusive uncertainty
quantification methods: arbitary polynomial chaos, spatially adaptive sparse
grids, kernel-based greedy interpolation and hybrid stochastic Galerkin. The
performance of each approach is demonstrated assessing expectation value and
standard deviation of the carbon dioxide saturation against a reference
statistic based on Monte Carlo sampling. We compare the convergence of all
methods reporting on accuracy with respect to the number of model runs and
resolution. Finally we offer suggestions about the methods' advantages and
disadvantages that can guide the modeler for uncertainty quantification in
carbon dioxide storage and beyond.
| cs.CE cs.NA math.NA | a variety of methods is available to quantify uncertainties arising within the modeling of flow and transport in carbon dioxide storage but there is a lack of thorough comparisons usually raw data from such storage sites can hardly be described by theoretical statistical distributions since only very limited data is available hence exact information on distribution shapes for all uncertain parameters is very rare in realistic applications we discuss and compare four different methods tested for datadriven uncertainty quantification based on a benchmark scenario of carbon dioxide storage in the benchmark for which we provide data and code carbon dioxide is injected into a saline aquifer modeled by the nonlinear capillarityfree fractional flow formulation for two incompressible fluid phases namely carbon dioxide and brine to cover different aspects of uncertainty quantification we incorporate various sources of uncertainty such as uncertainty of boundary conditions of conceptual model definitions and of material properties we consider recent versions of the following nonintrusive and intrusive uncertainty quantification methods arbitary polynomial chaos spatially adaptive sparse grids kernelbased greedy interpolation and hybrid stochastic galerkin the performance of each approach is demonstrated assessing expectation value and standard deviation of the carbon dioxide saturation against a reference statistic based on monte carlo sampling we compare the convergence of all methods reporting on accuracy with respect to the number of model runs and resolution finally we offer suggestions about the methods advantages and disadvantages that can guide the modeler for uncertainty quantification in carbon dioxide storage and beyond | [['a', 'variety', 'of', 'methods', 'is', 'available', 'to', 'quantify', 'uncertainties', 'arising', 'within', 'the', 'modeling', 'of', 'flow', 'and', 'transport', 'in', 'carbon', 'dioxide', 'storage', 'but', 'there', 'is', 'a', 'lack', 'of', 'thorough', 'comparisons', 'usually', 'raw', 'data', 'from', 'such', 'storage', 'sites', 'can', 'hardly', 'be', 'described', 'by', 'theoretical', 'statistical', 'distributions', 'since', 'only', 'very', 'limited', 'data', 'is', 'available', 'hence', 'exact', 'information', 'on', 'distribution', 'shapes', 'for', 'all', 'uncertain', 'parameters', 'is', 'very', 'rare', 'in', 'realistic', 'applications', 'we', 'discuss', 'and', 'compare', 'four', 'different', 'methods', 'tested', 'for', 'datadriven', 'uncertainty', 'quantification', 'based', 'on', 'a', 'benchmark', 'scenario', 'of', 'carbon', 'dioxide', 'storage', 'in', 'the', 'benchmark', 'for', 'which', 'we', 'provide', 'data', 'and', 'code', 'carbon', 'dioxide', 'is', 'injected', 'into', 'a', 'saline', 'aquifer', 'modeled', 'by', 'the', 'nonlinear', 'capillarityfree', 'fractional', 'flow', 'formulation', 'for', 'two', 'incompressible', 'fluid', 'phases', 'namely', 'carbon', 'dioxide', 'and', 'brine', 'to', 'cover', 'different', 'aspects', 'of', 'uncertainty', 'quantification', 'we', 'incorporate', 'various', 'sources', 'of', 'uncertainty', 'such', 'as', 'uncertainty', 'of', 'boundary', 'conditions', 'of', 'conceptual', 'model', 'definitions', 'and', 'of', 'material', 'properties', 'we', 'consider', 'recent', 'versions', 'of', 'the', 'following', 'nonintrusive', 'and', 'intrusive', 'uncertainty', 'quantification', 'methods', 'arbitary', 'polynomial', 'chaos', 'spatially', 'adaptive', 'sparse', 'grids', 'kernelbased', 'greedy', 'interpolation', 'and', 'hybrid', 'stochastic', 'galerkin', 'the', 'performance', 'of', 'each', 'approach', 'is', 'demonstrated', 'assessing', 'expectation', 'value', 'and', 'standard', 'deviation', 'of', 'the', 'carbon', 'dioxide', 'saturation', 'against', 'a', 'reference', 'statistic', 'based', 'on', 'monte', 'carlo', 'sampling', 'we', 'compare', 'the', 'convergence', 'of', 'all', 'methods', 'reporting', 'on', 'accuracy', 'with', 'respect', 'to', 'the', 'number', 'of', 'model', 'runs', 'and', 'resolution', 'finally', 'we', 'offer', 'suggestions', 'about', 'the', 'methods', 'advantages', 'and', 'disadvantages', 'that', 'can', 'guide', 'the', 'modeler', 'for', 'uncertainty', 'quantification', 'in', 'carbon', 'dioxide', 'storage', 'and', 'beyond']] | [-0.0551388910182962, 0.04477598286241353, -0.05120643828394673, 0.0653491290320216, -0.02859031609090556, -0.14739955437272007, 0.06267042765431406, 0.4176678531728084, -0.27597050300861276, -0.32745207328797177, 0.14186161822046064, -0.28993319069793927, -0.0673724114387897, 0.2159988917415068, -0.08917521353014896, 0.10387790933037327, 0.11536516102111613, -0.04619469750950004, -0.08538857268520646, -0.19883772056275648, 0.2502493794590625, 0.06771979772958965, 0.3243708793691645, 0.03218594624758548, 0.09567794421332844, -0.043393068904650486, -0.0696438305012341, 0.038788756727421235, -0.14497638220308867, 0.1454417282083957, 0.25952164370438924, 0.14056520062431152, 0.27046468112380795, -0.4562165929575361, -0.2647981043211926, 0.08315543520955308, 0.0970233500079156, 0.10309128027274123, -0.04823249740987986, -0.24471885110476926, 0.03580604776864, -0.19053643967133888, -0.07311791646216373, -0.10549533287919458, -0.0026071780939087, 0.05383338735649182, -0.2973720981202449, 0.08416893876593319, 0.00039091490086115473, 0.10031785557164825, -0.04732558360950451, -0.1786686499544885, -0.015719296300366913, 0.0937178245724006, 0.02628462197284417, -0.05719642584365154, 0.1596719860493566, -0.10457734113198615, -0.10622815273546299, 0.4242429857427675, -0.06357114118004721, -0.20869908946934307, 0.18346094361397497, -0.07891757950293991, -0.15428734939045935, 0.12599481000536122, 0.19045243321447597, 0.10152918840879377, -0.18905521815101947, 0.031227619503888783, 0.004912601104625801, 0.16457683788312058, 0.03651368716870615, 0.03382544130257766, 0.1760488251522709, 0.2580726818827492, 0.03837269862114842, 0.1198447988525356, -0.11307246100078637, -0.1332750169775306, -0.25427965951225373, -0.14203122302640095, -0.16031728270595083, -0.0015010198652406312, -0.12895482318644128, -0.18011428628115908, 0.3502306261084854, 0.21470734261440097, 0.12138953024799365, 0.00886301260541058, 0.34380534643447214, 0.05215503541976138, 0.016371286992404248, 0.05408891392477427, 0.19732198660682526, 0.11090253265161489, 0.07241676765448984, -0.19123632223777204, 0.12117078521095531, 0.027097241184110905] |
1,802.03065 | Generating Realistic Geology Conditioned on Physical Measurements with
Generative Adversarial Networks | An important problem in geostatistics is to build models of the subsurface of
the Earth given physical measurements at sparse spatial locations. Typically,
this is done using spatial interpolation methods or by reproducing patterns
from a reference image. However, these algorithms fail to produce realistic
patterns and do not exhibit the wide range of uncertainty inherent in the
prediction of geology. In this paper, we show how semantic inpainting with
Generative Adversarial Networks can be used to generate varied realizations of
geology which honor physical measurements while matching the expected
geological patterns. In contrast to other algorithms, our method scales well
with the number of data points and mimics a distribution of patterns as opposed
to a single pattern or image. The generated conditional samples are state of
the art.
| stat.ML physics.comp-ph physics.geo-ph | an important problem in geostatistics is to build models of the subsurface of the earth given physical measurements at sparse spatial locations typically this is done using spatial interpolation methods or by reproducing patterns from a reference image however these algorithms fail to produce realistic patterns and do not exhibit the wide range of uncertainty inherent in the prediction of geology in this paper we show how semantic inpainting with generative adversarial networks can be used to generate varied realizations of geology which honor physical measurements while matching the expected geological patterns in contrast to other algorithms our method scales well with the number of data points and mimics a distribution of patterns as opposed to a single pattern or image the generated conditional samples are state of the art | [['an', 'important', 'problem', 'in', 'geostatistics', 'is', 'to', 'build', 'models', 'of', 'the', 'subsurface', 'of', 'the', 'earth', 'given', 'physical', 'measurements', 'at', 'sparse', 'spatial', 'locations', 'typically', 'this', 'is', 'done', 'using', 'spatial', 'interpolation', 'methods', 'or', 'by', 'reproducing', 'patterns', 'from', 'a', 'reference', 'image', 'however', 'these', 'algorithms', 'fail', 'to', 'produce', 'realistic', 'patterns', 'and', 'do', 'not', 'exhibit', 'the', 'wide', 'range', 'of', 'uncertainty', 'inherent', 'in', 'the', 'prediction', 'of', 'geology', 'in', 'this', 'paper', 'we', 'show', 'how', 'semantic', 'inpainting', 'with', 'generative', 'adversarial', 'networks', 'can', 'be', 'used', 'to', 'generate', 'varied', 'realizations', 'of', 'geology', 'which', 'honor', 'physical', 'measurements', 'while', 'matching', 'the', 'expected', 'geological', 'patterns', 'in', 'contrast', 'to', 'other', 'algorithms', 'our', 'method', 'scales', 'well', 'with', 'the', 'number', 'of', 'data', 'points', 'and', 'mimics', 'a', 'distribution', 'of', 'patterns', 'as', 'opposed', 'to', 'a', 'single', 'pattern', 'or', 'image', 'the', 'generated', 'conditional', 'samples', 'are', 'state', 'of', 'the', 'art']] | [-0.023134529862839443, 0.07365453354040465, -0.0837907824683218, 0.09172771535813809, -0.06683339334021395, -0.08328942396104909, 0.004503427597228438, 0.4023372797438732, -0.2980487885455099, -0.39199545674312575, 0.09139984703192917, -0.26234473545247544, -0.16535481799465532, 0.19354541995831265, -0.13070275443247878, 0.10192795087529632, 0.06303203643944401, 0.031173787550785793, -0.07876004652744786, -0.22460458229940672, 0.30151063063396855, 0.047726470368126266, 0.3121720193168865, -0.018351923416440305, 0.10069509530529523, -0.03713354441122367, -0.04706896251927201, 0.00485511151357339, -0.07252722003210622, 0.14509822711832104, 0.3086380383925783, 0.17219129169377714, 0.25106599043624905, -0.4643430717002887, -0.27606497994409157, 0.14042019515226667, 0.12600634248855597, 0.14005665223633584, -0.028533701235965755, -0.2961386693498263, 0.08098110925012196, -0.10196565680492382, -0.06299700525302726, -0.08416980065745659, -0.04170986127036695, 0.04187716867667265, -0.3012895304709673, 0.0711862592957914, 0.05659403780681224, 0.09524428353000146, -0.0447580312163784, -0.09920455706305802, -0.009078025484744174, 0.17576512667493752, 0.033022698792270745, 0.04087697092640715, 0.1343984314497972, -0.16588217740690409, -0.13395715686850823, 0.4164745758072688, -0.04748336303477677, -0.20483621962081927, 0.21320809352999695, -0.11792603650918373, -0.1206747854540411, 0.11079245820605697, 0.21596855460307918, 0.11665864550080957, -0.12552374746435538, 0.01182467210948324, -0.049018883955879854, 0.17876738101566353, 0.05202368839930457, 0.03155558112507256, 0.20875330873979972, 0.19830336319282652, 0.04219109604959018, 0.09384879581691796, -0.13786256491349866, -0.06806019487289282, -0.2229635308048903, -0.0701961758492801, -0.2030951526804039, -0.022169980700374042, -0.09188348883024167, -0.19512058650859845, 0.3993386385962367, 0.22988380733161018, 0.2563438045792282, 0.024025353202775407, 0.30931581548200204, 0.04022285372126275, 0.09791110875801398, 0.05403578674707275, 0.16864018949966592, 0.054601526548727776, 0.1141591134105021, -0.1303098475506816, 0.13168719509043372, 0.006048267149554494] |
1,802.03066 | A simple example of the weak discontinuity of $f\mapsto \int \det \nabla
f$ | Verifying lower-semicontinuity of integral functionals in the weak topology
of Sobolev spaces is a central theme in the calculus of variations. For
integral functionals with $p$-growth, quasiconvexity is a necessary condition
for weak lower-semicontinuity in $W^{1,p}$, but is only sufficient if some
additional conditions are met.The standard functional showing the necessity of
additional conditions is $f\mapsto \int_\Omega \det \nabla f$, which fails to
be weakly lower-semicontinuous. However, the common examples showing this
failure are non-injective and have a lot of shear. The aim of this short note
is to point out that a known sequence of conformal diffeomorphisms of the
$d$-dimensional unit ball that converges weakly to a constant in $W^{1,d}$,
exemplifies the weak discontinuity of this functional even when restricting a
space to functions which are "as nice as possible".
| math.AP | verifying lowersemicontinuity of integral functionals in the weak topology of sobolev spaces is a central theme in the calculus of variations for integral functionals with pgrowth quasiconvexity is a necessary condition for weak lowersemicontinuity in w1p but is only sufficient if some additional conditions are metthe standard functional showing the necessity of additional conditions is fmapsto int_omega det nabla f which fails to be weakly lowersemicontinuous however the common examples showing this failure are noninjective and have a lot of shear the aim of this short note is to point out that a known sequence of conformal diffeomorphisms of the ddimensional unit ball that converges weakly to a constant in w1d exemplifies the weak discontinuity of this functional even when restricting a space to functions which are as nice as possible | [['verifying', 'lowersemicontinuity', 'of', 'integral', 'functionals', 'in', 'the', 'weak', 'topology', 'of', 'sobolev', 'spaces', 'is', 'a', 'central', 'theme', 'in', 'the', 'calculus', 'of', 'variations', 'for', 'integral', 'functionals', 'with', 'pgrowth', 'quasiconvexity', 'is', 'a', 'necessary', 'condition', 'for', 'weak', 'lowersemicontinuity', 'in', 'w1p', 'but', 'is', 'only', 'sufficient', 'if', 'some', 'additional', 'conditions', 'are', 'metthe', 'standard', 'functional', 'showing', 'the', 'necessity', 'of', 'additional', 'conditions', 'is', 'fmapsto', 'int_omega', 'det', 'nabla', 'f', 'which', 'fails', 'to', 'be', 'weakly', 'lowersemicontinuous', 'however', 'the', 'common', 'examples', 'showing', 'this', 'failure', 'are', 'noninjective', 'and', 'have', 'a', 'lot', 'of', 'shear', 'the', 'aim', 'of', 'this', 'short', 'note', 'is', 'to', 'point', 'out', 'that', 'a', 'known', 'sequence', 'of', 'conformal', 'diffeomorphisms', 'of', 'the', 'ddimensional', 'unit', 'ball', 'that', 'converges', 'weakly', 'to', 'a', 'constant', 'in', 'w1d', 'exemplifies', 'the', 'weak', 'discontinuity', 'of', 'this', 'functional', 'even', 'when', 'restricting', 'a', 'space', 'to', 'functions', 'which', 'are', 'as', 'nice', 'as', 'possible']] | [-0.16902176390921828, 0.07678029759130044, -0.08273192759343358, 0.11748097084152202, -0.09495572733887753, -0.12921921402042688, -0.0046030020299764685, 0.3584671534576215, -0.31066756425497605, -0.19160311835882968, 0.1353309025109002, -0.2481688391561656, -0.1430686960491359, 0.16769974897507317, -0.13315068578795175, 0.0674081328009118, 0.052671873525088266, 0.0805993819421576, -0.09948233353531767, -0.2604171219462341, 0.36313914789912083, -0.013867375729677752, 0.2034652758851763, 0.09028699120882061, 0.09243067218506955, -0.020096707681208387, 0.043132960679038435, 0.02479917090724569, -0.13780762127416962, 0.10464990830640922, 0.24777532943213978, 0.07578661152190536, 0.3512329358694165, -0.3902706649919698, -0.19937163957506562, 0.16644363873547968, 0.07420636799056517, 0.01051879691342686, -0.021720107428209727, -0.2619217363178961, 0.1378465564325885, -0.06715236584269695, -0.1568799101234984, -0.10665725259644579, 0.049165294480387325, 0.08869173720049447, -0.328252514730417, 0.09970863753308852, 0.13560240697332246, 0.044196880877364515, -0.079029457694165, -0.05819083146557804, -0.043537474190455304, 0.07583532065749637, 0.06658781826127927, 0.1174503884841363, 0.08097527990868503, -0.11015063647881093, -0.001208233069484086, 0.36742660659545845, -0.0714467815340085, -0.25343831188168175, 0.1850559502468235, -0.17731698214025923, -0.19959473739876304, 0.11227378251334262, 0.06283954824068287, 0.1469877735096167, -0.15892941962696103, 0.20136091448754692, -0.06722552943685951, 0.13762405313584816, 0.07355334517697609, 0.045806084422019215, 0.11835243306555894, 0.09552864789377985, 0.16321307425964768, 0.13385376970503884, -0.007260166534561982, -0.0748772540746993, -0.4111290186600283, -0.1837314121648958, -0.1720073318989702, 0.10204696874747905, -0.08583887523144408, -0.2146482999732559, 0.3026559396155987, 0.07084912658872555, 0.16927752169769603, 0.07831615371477985, 0.21032048506272394, 0.12100127793788953, 0.06060255998059703, 0.06392398295028842, 0.18840486596472916, 0.15416704710255297, 0.05603104592174609, -0.13281541239910635, 0.04502000898310496, 0.11704153887739824] |
1,802.03067 | Uniformly accurate methods for Vlasov equations with non-homogeneous
strong magnetic field | In this paper, we consider the numerical solution of highly-oscillatory
Vlasov and Vlasov-Poisson equations with non-homogeneous magnetic field.
Designed in the spirit of recent uniformly accurate methods, our schemes remain
insensitive to the stiffness of the problem, in terms of both accuracy and
computational cost. The specific difficulty (and the resulting novelty of our
approach) stems from the presence of a non-periodic oscillation, which
necessitates a careful ad-hoc reformulation of the equations. Our results are
illustrated numerically on several examples.
| math.NA physics.comp-ph physics.plasm-ph | in this paper we consider the numerical solution of highlyoscillatory vlasov and vlasovpoisson equations with nonhomogeneous magnetic field designed in the spirit of recent uniformly accurate methods our schemes remain insensitive to the stiffness of the problem in terms of both accuracy and computational cost the specific difficulty and the resulting novelty of our approach stems from the presence of a nonperiodic oscillation which necessitates a careful adhoc reformulation of the equations our results are illustrated numerically on several examples | [['in', 'this', 'paper', 'we', 'consider', 'the', 'numerical', 'solution', 'of', 'highlyoscillatory', 'vlasov', 'and', 'vlasovpoisson', 'equations', 'with', 'nonhomogeneous', 'magnetic', 'field', 'designed', 'in', 'the', 'spirit', 'of', 'recent', 'uniformly', 'accurate', 'methods', 'our', 'schemes', 'remain', 'insensitive', 'to', 'the', 'stiffness', 'of', 'the', 'problem', 'in', 'terms', 'of', 'both', 'accuracy', 'and', 'computational', 'cost', 'the', 'specific', 'difficulty', 'and', 'the', 'resulting', 'novelty', 'of', 'our', 'approach', 'stems', 'from', 'the', 'presence', 'of', 'a', 'nonperiodic', 'oscillation', 'which', 'necessitates', 'a', 'careful', 'adhoc', 'reformulation', 'of', 'the', 'equations', 'our', 'results', 'are', 'illustrated', 'numerically', 'on', 'several', 'examples']] | [-0.11896543917537201, 0.02730878315924201, -0.03070444823242724, 0.014657866429479327, -0.06186257778899744, -0.06695976824266836, 0.012493789890140761, 0.3034071165602654, -0.2511374356690794, -0.3047196156112477, 0.1080127260494919, -0.24166212929412723, -0.1693365050596185, 0.23209465283434838, -0.0931679307948798, 0.115122441702988, 0.10985700905730482, -0.01147834092262201, -0.08953807498983224, -0.26795018595003056, 0.35556635423126864, 0.039599814685061574, 0.28296317749191074, 0.05228924811235629, 0.12702595588052645, -0.027276997975423, -0.06021887672832236, 0.047737842751666905, -0.10585741008108016, 0.1488850471083424, 0.23216771102743222, 0.05445817037834786, 0.31590201072394847, -0.4500114815309644, -0.22603328848490492, 0.0444436263438547, 0.1443323556857649, 0.15332392933632946, -0.07840004506433615, -0.2889537338167429, 0.064470397963305, -0.13256877624662594, -0.17334814064670354, -0.10538042765692808, -0.057073943071009124, 0.07823987712617964, -0.27196384165436027, 0.1253268263419159, 0.06707243011333049, 0.04552671172423288, -0.10448865544749424, -0.11034907396533526, 0.03157924487895798, 0.07345083741238341, 0.09795436524873366, -0.0008565064519643784, 0.05792246687924489, -0.11932952709903474, -0.09385476331226528, 0.41253504790365697, -0.04284457548055798, -0.28107420513406395, 0.20348736963351258, -0.08322033677250147, -0.1139146130590234, 0.13735725958831607, 0.16572366314940154, 0.18358580520143733, -0.12221949937520549, 0.11994051883011707, -0.012544479279313236, 0.14454496932448818, 0.01869098046445288, -0.003991666180081665, 0.11866607224219479, 0.20173653832462152, 0.045353452093695526, 0.1371928898297483, -0.04079221239371691, -0.15122264263918622, -0.31672636851435526, -0.09465348081193951, -0.17379151534987614, 0.010824581823544576, -0.11562681029845408, -0.18841727188264484, 0.41597081045620143, 0.21122904088715586, 0.14498402455355971, 0.06310579551063711, 0.3366239285969641, 0.13255521858663996, -0.021669751079753042, 0.06254130254383199, 0.23664005488681142, 0.13942917241656688, 0.15413134027039632, -0.28073168397240805, 0.02182013484562049, 0.08849741002777592] |
1,802.03068 | Nonreciprocal flexural dynamics of Dzyaloshinskii domain walls | We revisit the description of ferromagnetic domain wall dynamics through an
extended one-dimensional model by allowing flexural distortions of the wall
during its motion. This is taken into account by allowing the domain wall
center and internal angle to be functions of position in the direction parallel
to the wall. In the limit of small applied fields, this model accounts for the
nonreciprocity in the propagation of wall modes and their stability in the
presence of the Dzyaloshinskii-Moriya interaction and in-plane magnetic field.
| cond-mat.mes-hall | we revisit the description of ferromagnetic domain wall dynamics through an extended onedimensional model by allowing flexural distortions of the wall during its motion this is taken into account by allowing the domain wall center and internal angle to be functions of position in the direction parallel to the wall in the limit of small applied fields this model accounts for the nonreciprocity in the propagation of wall modes and their stability in the presence of the dzyaloshinskiimoriya interaction and inplane magnetic field | [['we', 'revisit', 'the', 'description', 'of', 'ferromagnetic', 'domain', 'wall', 'dynamics', 'through', 'an', 'extended', 'onedimensional', 'model', 'by', 'allowing', 'flexural', 'distortions', 'of', 'the', 'wall', 'during', 'its', 'motion', 'this', 'is', 'taken', 'into', 'account', 'by', 'allowing', 'the', 'domain', 'wall', 'center', 'and', 'internal', 'angle', 'to', 'be', 'functions', 'of', 'position', 'in', 'the', 'direction', 'parallel', 'to', 'the', 'wall', 'in', 'the', 'limit', 'of', 'small', 'applied', 'fields', 'this', 'model', 'accounts', 'for', 'the', 'nonreciprocity', 'in', 'the', 'propagation', 'of', 'wall', 'modes', 'and', 'their', 'stability', 'in', 'the', 'presence', 'of', 'the', 'dzyaloshinskiimoriya', 'interaction', 'and', 'inplane', 'magnetic', 'field']] | [-0.18228369834552327, 0.15832351420670102, -0.0688823437127453, -0.01788561051874141, -0.11018581147563744, -0.03246120863358479, 0.031128701512668146, 0.40779516415064593, -0.31733009640508925, -0.2814130144395742, 0.08515853193554893, -0.18673003094652332, -0.059912961531789544, 0.14289922847872577, 0.03115318317796631, -0.017738223963007557, 0.01433788962572454, -0.010458012975483056, 0.02037365134266845, -0.13551574697471166, 0.26556957762755723, 0.013918919331697097, 0.32838547549838853, 0.09100620009857847, 0.06219396930950952, 0.07995288475018264, 0.03314299662653581, 0.04384410857077105, -0.12948472503886885, 0.08189954089157912, 0.13957217548965442, -0.0506684656355934, 0.20499697884163223, -0.5116595249982124, -0.2125600515023233, 0.05156714873141553, 0.1687163128040686, 0.1573845067409327, -0.007509458058300507, -0.34464892291699545, 0.03306432245635843, -0.12666346260952394, -0.18349218922835517, -0.019840202945093793, 0.021109100878631406, 0.010835586362574473, -0.2231826625304319, 0.12462584835937224, 0.1129869194434821, 0.0626495322436992, -0.13566360986337112, -0.041445285741082694, -0.0617760888031538, 0.13563334365117263, 0.12068529061816004, 0.06472777141572301, 0.1391885633361582, -0.18968246041808323, -0.10218877273510737, 0.40888354392071447, -0.07204206124458641, -0.2563187387513827, 0.1549922554607851, -0.16943689748884672, 0.015140922554959375, 0.13847268175288854, 0.2008687114028866, 0.07898919061050717, -0.14579362105802599, 0.12635700171041941, 0.03314417177609291, 0.1377650324422838, 0.055457532989332474, -0.030335198953209155, 0.26116364230457917, 0.1735864915837343, 0.03029178545238024, 0.22587083510532752, -0.15210148165877685, -0.08690999416881297, -0.2906037607196584, -0.12401163337208017, -0.16128166454159712, -0.020415394505239035, -0.11881592888220252, -0.158708615262196, 0.4472991370382797, 0.16433430537132612, 0.17779553534620138, -0.03987294586981276, 0.29365546620417254, 0.09080372404037829, 0.0961486829742116, 0.0421158051376332, 0.300358792250774, 0.17853613096255674, 0.1261722091781761, -0.2856823528292084, 0.027310176371002054, 0.011332886787243637] |
1,802.03069 | McShane-type identities for quasifuchsian representations of
nonorientable surfaces | We show that Norbury's McShane identity for nonorientable cusped hyperbolic
surfaces N generalizes to quasifuchsian representations of pi_1(N) as well as
pseudo-Anosov mapping Klein bottles with singular fibers given by N.
| math.GT math.DG | we show that norburys mcshane identity for nonorientable cusped hyperbolic surfaces n generalizes to quasifuchsian representations of pi_1n as well as pseudoanosov mapping klein bottles with singular fibers given by n | [['we', 'show', 'that', 'norburys', 'mcshane', 'identity', 'for', 'nonorientable', 'cusped', 'hyperbolic', 'surfaces', 'n', 'generalizes', 'to', 'quasifuchsian', 'representations', 'of', 'pi_1n', 'as', 'well', 'as', 'pseudoanosov', 'mapping', 'klein', 'bottles', 'with', 'singular', 'fibers', 'given', 'by', 'n']] | [-0.1913616180419922, 0.13919992505883177, -0.013988897328575452, 0.050096948506931464, -0.11229509970483681, -0.260746173436443, -0.0679913284877936, 0.33742697549362977, -0.24202560526318848, -0.23202218736211458, 0.03912304209855696, -0.3402946552882592, -0.26620813690436385, 0.3001577171186606, -0.2330265552426378, 0.093807854436515, 0.058061470510438085, 0.03383709167440732, -0.08800534092976402, -0.2789432369793455, 0.4010298619667689, -0.12487546106179555, 0.14278177206094067, 0.09755795455227295, 0.13627947910378377, 0.03305949848145247, 0.02301585813984275, -0.04088234306933979, -0.1572210336814654, 0.09028678151468436, 0.34819813817739487, 0.0038893736122796933, 0.055846169823780656, -0.3799538613607486, -0.2682381683339675, 0.16211542459204792, 0.1839551123790443, -0.05060427791128556, -0.023105887913455567, -0.3240649980182449, 0.0929168896128734, -0.06767674805596471, -0.25831914896455904, -0.053388244138720134, 0.08535613395894567, -0.003523607738316059, -0.09942104369401931, -0.0014936952541271845, 0.15478176093117024, 0.08616665848142778, 0.030818251986056568, -0.08478041073928276, -0.10942133197095245, 0.14117890695730845, 0.011889272866149743, 0.07103136169413725, 0.1017633663645635, -0.03993942995245258, -0.06707154082444806, 0.3682887296269958, -0.16861407418424884, -0.2769866368422906, 0.10872599456148843, -0.1503240413653354, -0.15655415148163834, 0.18809643996258577, 0.08485266643886764, 0.1663971934467554, 0.04771585675577323, 0.19546134294942022, -0.21182146112745007, 0.013187669042963535, 0.24909097300842403, -0.1335927585605532, 0.07886838714281717, 0.05249364202221234, 0.16302142731534938, 0.14098407135655483, 0.03755037798546255, 0.06120442269990842, -0.3464612815529108, -0.30890774531289933, -0.1625246545067057, 0.23833427513018252, -0.10731486241954068, -0.2548044325162967, 0.2747136077998827, -0.08128266486649711, 0.2358463310326139, 0.22975144643957415, 0.21897211282824477, -0.08425425082872001, 0.09765285576383273, 0.14344655831033984, 0.010041979671223089, 0.20499276817621043, -0.14129942537595827, -0.10840765113631884, -0.1363429832737893, 0.30622749477624894] |
1,802.0307 | Iterative Sparse Asymptotic Minimum Variance Based Approaches for Array
Processing | This paper presents a series of user parameter-free iterative Sparse
Asymptotic Minimum Variance (SAMV) approaches for array processing applications
based on the asymptotically minimum variance (AMV) criterion. With the
assumption of abundant snapshots in the direction-of-arrival (DOA) estimation
problem, the signal powers and noise variance are jointly estimated by the
proposed iterative AMV approach, which is later proved to coincide with the
Maximum Likelihood (ML) estimator. We then propose a series of power-based
iterative SAMV approaches, which are robust against insufficient snapshots,
coherent sources and arbitrary array geometries. Moreover, to overcome the
direction grid limitation on the estimation accuracy, the SAMV-Stochastic ML
(SAMV-SML) approaches are derived by explicitly minimizing a closed form
stochastic ML cost function with respect to one scalar parameter, eliminating
the need of any additional grid refinement techniques. To assist the
performance evaluation, approximate solutions to the SAMV approaches are also
provided at high signal-to-noise ratio (SNR) and low SNR, respectively.
Finally, numerical examples are generated to compare the performance of the
proposed approaches with existing approaches.
| eess.SP | this paper presents a series of user parameterfree iterative sparse asymptotic minimum variance samv approaches for array processing applications based on the asymptotically minimum variance amv criterion with the assumption of abundant snapshots in the directionofarrival doa estimation problem the signal powers and noise variance are jointly estimated by the proposed iterative amv approach which is later proved to coincide with the maximum likelihood ml estimator we then propose a series of powerbased iterative samv approaches which are robust against insufficient snapshots coherent sources and arbitrary array geometries moreover to overcome the direction grid limitation on the estimation accuracy the samvstochastic ml samvsml approaches are derived by explicitly minimizing a closed form stochastic ml cost function with respect to one scalar parameter eliminating the need of any additional grid refinement techniques to assist the performance evaluation approximate solutions to the samv approaches are also provided at high signaltonoise ratio snr and low snr respectively finally numerical examples are generated to compare the performance of the proposed approaches with existing approaches | [['this', 'paper', 'presents', 'a', 'series', 'of', 'user', 'parameterfree', 'iterative', 'sparse', 'asymptotic', 'minimum', 'variance', 'samv', 'approaches', 'for', 'array', 'processing', 'applications', 'based', 'on', 'the', 'asymptotically', 'minimum', 'variance', 'amv', 'criterion', 'with', 'the', 'assumption', 'of', 'abundant', 'snapshots', 'in', 'the', 'directionofarrival', 'doa', 'estimation', 'problem', 'the', 'signal', 'powers', 'and', 'noise', 'variance', 'are', 'jointly', 'estimated', 'by', 'the', 'proposed', 'iterative', 'amv', 'approach', 'which', 'is', 'later', 'proved', 'to', 'coincide', 'with', 'the', 'maximum', 'likelihood', 'ml', 'estimator', 'we', 'then', 'propose', 'a', 'series', 'of', 'powerbased', 'iterative', 'samv', 'approaches', 'which', 'are', 'robust', 'against', 'insufficient', 'snapshots', 'coherent', 'sources', 'and', 'arbitrary', 'array', 'geometries', 'moreover', 'to', 'overcome', 'the', 'direction', 'grid', 'limitation', 'on', 'the', 'estimation', 'accuracy', 'the', 'samvstochastic', 'ml', 'samvsml', 'approaches', 'are', 'derived', 'by', 'explicitly', 'minimizing', 'a', 'closed', 'form', 'stochastic', 'ml', 'cost', 'function', 'with', 'respect', 'to', 'one', 'scalar', 'parameter', 'eliminating', 'the', 'need', 'of', 'any', 'additional', 'grid', 'refinement', 'techniques', 'to', 'assist', 'the', 'performance', 'evaluation', 'approximate', 'solutions', 'to', 'the', 'samv', 'approaches', 'are', 'also', 'provided', 'at', 'high', 'signaltonoise', 'ratio', 'snr', 'and', 'low', 'snr', 'respectively', 'finally', 'numerical', 'examples', 'are', 'generated', 'to', 'compare', 'the', 'performance', 'of', 'the', 'proposed', 'approaches', 'with', 'existing', 'approaches']] | [-0.10640873494169985, -0.02143865182075561, -0.052867996997000385, 0.06029418293092888, -0.08428892392770476, -0.18571014043464812, 0.054741203919374606, 0.41451916938725236, -0.2393220754983347, -0.3231002025329092, 0.14202408820953374, -0.2624896397326319, -0.1424819477224013, 0.18167787891676804, -0.10284392807183654, 0.12266668031224981, 0.0958099949888752, 0.006699214949982152, -0.1101156281382871, -0.2859126093105823, 0.24882501946731714, 0.1241025079396509, 0.351009659397061, -0.03372435477138511, 0.1394961825225047, -0.024174794400182907, -0.05155644275891107, 0.03174153360062822, -0.11847665661064509, 0.13727373424002767, 0.29304183360433117, 0.1734446078910315, 0.29313358041413484, -0.3742055169062778, -0.21388662992311375, 0.11475055024493486, 0.17134180544651048, 0.08425205341301903, -0.011515397970686621, -0.2545088935488214, 0.13935605697666428, -0.15825122374198622, -0.06349636383155095, -0.06597508118803878, -0.06822755000238041, 0.05717798693027968, -0.3418056592428392, 0.0770306847461186, 0.009962635209029983, 0.034654752735237014, -0.0351541201317949, -0.18293211721937128, 0.07093513179764462, 0.07787446347009834, 0.07268121015000534, -0.0035801221439171406, 0.0980064484340671, -0.08591302121307567, -0.10830382355371035, 0.28761072212364525, -0.04946096393472371, -0.2559351933852581, 0.1589259848108105, -0.047420363869085644, -0.1033834331097924, 0.17086768757352339, 0.18912774191786802, 0.11127935865494822, -0.13993647340906873, 0.06731391254687055, 0.0455323575505255, 0.1527045079662154, 0.06666419585789776, 0.020370765686190378, 0.15524017781717703, 0.13225846035527952, 0.11806662154794183, 0.13941278345217661, -0.13026460541767024, -0.05304856000224217, -0.24765956144048168, -0.07822558822088121, -0.217280428068729, -0.02337015915933686, -0.16519477954274667, -0.16107749376325436, 0.3480576395508944, 0.19620227135740043, 0.15980758102765927, 0.12644494652687127, 0.41549132442811415, 0.14728049364029652, -0.00204251096528467, 0.11876491638499179, 0.19083867749612268, 0.12000276712517786, 0.05738913723784901, -0.21656460222896254, 0.07696132656253342, 0.0858003397630195] |
1,802.03071 | The onset of low Prandtl number thermal convection in thin spherical
shells | This study considers the onset of stress-free Boussinesq thermal convection
in rotating spherical shells with aspect ratio $\eta=r_i/r_o=0.9$ ($r_i$ and
$r_o$ being the inner and outer radius), Prandtl numbers ${\rm Pr}
\in[10^{-4},10^{-1}]$, and Taylor numbers ${\rm Ta}\in[10^{4},10^{12}]$. We are
particularly interested in the form of the convective cell pattern that
develops, and in its time scales, since this may have observational
consequences. For a fixed ${\rm Ta}<10^{9}$ and by decreasing ${\rm Pr}$ from
0.1 to $10^{-4}$ a transition between spiralling columnar (SC) and
equatorially-attached (EA) modes, and a transition between EA and equatorially
antisymmetric or symmetric polar (AP/SP) weakly multicellular modes are found.
The latter modes are preferred at very low ${\rm Pr}$. Surprisingly, for ${\rm
Ta}>3\times 10^{9}$ the unicellular polar modes become also preferred at
moderate ${\rm Pr}\sim10^{-2}$ because two new transition curves between EA and
AP/SP and between AP/SP and SC modes are born at a triple-point bifurcation.
The dependence on ${\rm Pr}$ and ${\rm Ta}$ of the transitions is studied to
estimate the type of modes, and their critical parameters, preferred at
different stellar regimes.
| astro-ph.SR astro-ph.HE physics.flu-dyn | this study considers the onset of stressfree boussinesq thermal convection in rotating spherical shells with aspect ratio etar_ir_o09 r_i and r_o being the inner and outer radius prandtl numbers rm pr in104101 and taylor numbers rm tain1041012 we are particularly interested in the form of the convective cell pattern that develops and in its time scales since this may have observational consequences for a fixed rm ta109 and by decreasing rm pr from 01 to 104 a transition between spiralling columnar sc and equatoriallyattached ea modes and a transition between ea and equatorially antisymmetric or symmetric polar apsp weakly multicellular modes are found the latter modes are preferred at very low rm pr surprisingly for rm ta3times 109 the unicellular polar modes become also preferred at moderate rm prsim102 because two new transition curves between ea and apsp and between apsp and sc modes are born at a triplepoint bifurcation the dependence on rm pr and rm ta of the transitions is studied to estimate the type of modes and their critical parameters preferred at different stellar regimes | [['this', 'study', 'considers', 'the', 'onset', 'of', 'stressfree', 'boussinesq', 'thermal', 'convection', 'in', 'rotating', 'spherical', 'shells', 'with', 'aspect', 'ratio', 'etar_ir_o09', 'r_i', 'and', 'r_o', 'being', 'the', 'inner', 'and', 'outer', 'radius', 'prandtl', 'numbers', 'rm', 'pr', 'in104101', 'and', 'taylor', 'numbers', 'rm', 'tain1041012', 'we', 'are', 'particularly', 'interested', 'in', 'the', 'form', 'of', 'the', 'convective', 'cell', 'pattern', 'that', 'develops', 'and', 'in', 'its', 'time', 'scales', 'since', 'this', 'may', 'have', 'observational', 'consequences', 'for', 'a', 'fixed', 'rm', 'ta109', 'and', 'by', 'decreasing', 'rm', 'pr', 'from', '01', 'to', '104', 'a', 'transition', 'between', 'spiralling', 'columnar', 'sc', 'and', 'equatoriallyattached', 'ea', 'modes', 'and', 'a', 'transition', 'between', 'ea', 'and', 'equatorially', 'antisymmetric', 'or', 'symmetric', 'polar', 'apsp', 'weakly', 'multicellular', 'modes', 'are', 'found', 'the', 'latter', 'modes', 'are', 'preferred', 'at', 'very', 'low', 'rm', 'pr', 'surprisingly', 'for', 'rm', 'ta3times', '109', 'the', 'unicellular', 'polar', 'modes', 'become', 'also', 'preferred', 'at', 'moderate', 'rm', 'prsim102', 'because', 'two', 'new', 'transition', 'curves', 'between', 'ea', 'and', 'apsp', 'and', 'between', 'apsp', 'and', 'sc', 'modes', 'are', 'born', 'at', 'a', 'triplepoint', 'bifurcation', 'the', 'dependence', 'on', 'rm', 'pr', 'and', 'rm', 'ta', 'of', 'the', 'transitions', 'is', 'studied', 'to', 'estimate', 'the', 'type', 'of', 'modes', 'and', 'their', 'critical', 'parameters', 'preferred', 'at', 'different', 'stellar', 'regimes']] | [-0.19592270759146727, 0.2286031476537866, 0.0026884320197485346, 0.07862633725353217, -0.01927636144682765, -0.12283753716980504, 0.02748133996991735, 0.33649826855861653, -0.24529078072862842, -0.2883769585662494, 0.0828827043310385, -0.27428802769707394, -0.06848767133224047, 0.15740357443270933, 0.03501254237939097, -0.0380018895321079, -0.03095706862299458, 0.00581652195497868, -0.10074138316415708, -0.1363060799187692, 0.2754441224125742, 0.03915276884357309, 0.2520272554492725, -0.0018744436773466089, 0.027924694394562067, -0.08223765715418438, 0.049097129385795836, -0.002739926885911509, -0.20155262018232067, 0.017333300957151236, 0.2662565102142061, 0.06714049495732118, 0.20879806013374824, -0.42592396398690363, -0.13427486037563163, 0.07881545769568118, 0.18825420464405365, 0.04793171452804964, -0.03548441391267367, -0.19008143589292703, 0.11433137249343141, -0.13380558096820064, -0.09600277073553366, 0.022834233444031567, 0.11178672021494536, 0.008446985518026072, -0.3163389597981297, 0.1383779637053628, 0.07951118203413765, 0.12942912431749684, -0.03634131344495483, -0.15596076818346455, -0.09146824961375685, 0.06503305675588515, 0.07134893495039416, 0.03764649242304309, 0.10014587817495765, -0.09067246762284062, -0.004372455217815631, 0.3947359333495604, -0.047784475653230796, -0.13335020546202292, 0.22423387577005646, -0.2007202752321218, -0.08505908942547197, 0.17063511108532983, 0.16245283264982002, 0.14535646928114848, -0.02578704313195327, 0.048874619915061604, -0.01566185857433477, 0.14323676847689376, 0.11109046905699094, 0.015949923654048764, 0.251842773411551, 0.1065615085116996, 0.028981187792048294, 0.08723112093407269, -0.14111042858308387, -0.0839562273382792, -0.23985041126510814, -0.1270436041604466, -0.11176855643402393, -0.0017896538017568185, -0.11991462700383136, -0.13271745028279242, 0.31271250038788984, 0.038125906249219604, 0.2172316220175061, 0.059832527558183114, 0.2189166434735539, 0.08133850080010138, 0.042410342064985666, 0.13137307919681682, 0.26501428544908023, 0.18490347225485881, 0.11086487377127796, -0.27347508874689147, 0.03046479634395991, 0.04927507521889624] |
1,802.03072 | Experimentation With Fuzzy Interest Forwarding in Named Data Networking | In the current Named Data Networking implementation, forwarding a data
request requires finding an exact match between the prefix of the name carried
in the request and a forwarding table entry. However, consumers may not always
know the exact naming, or an exact prefix, of their desired data. The current
approach to this problem-establishing naming conventions and performing name
lookup-can be infeasible in highly ad hoc, heterogeneous, and dynamic
environments: the same data can be named using different terms or even
languages, naming conventions may be minimal if they exist at all, and name
lookups can be costly. In this paper, we present a fuzzy Interest forwarding
approach that exploits semantic similarities between the names carried in
Interest packets and the names of potentially matching data in CS and entries
in FIB. We describe the fuzzy Interest forwarding approach, outline the
semantic understanding function that determines the name matching, and present
our simulation study along with extended evaluation results.
| cs.NI | in the current named data networking implementation forwarding a data request requires finding an exact match between the prefix of the name carried in the request and a forwarding table entry however consumers may not always know the exact naming or an exact prefix of their desired data the current approach to this problemestablishing naming conventions and performing name lookupcan be infeasible in highly ad hoc heterogeneous and dynamic environments the same data can be named using different terms or even languages naming conventions may be minimal if they exist at all and name lookups can be costly in this paper we present a fuzzy interest forwarding approach that exploits semantic similarities between the names carried in interest packets and the names of potentially matching data in cs and entries in fib we describe the fuzzy interest forwarding approach outline the semantic understanding function that determines the name matching and present our simulation study along with extended evaluation results | [['in', 'the', 'current', 'named', 'data', 'networking', 'implementation', 'forwarding', 'a', 'data', 'request', 'requires', 'finding', 'an', 'exact', 'match', 'between', 'the', 'prefix', 'of', 'the', 'name', 'carried', 'in', 'the', 'request', 'and', 'a', 'forwarding', 'table', 'entry', 'however', 'consumers', 'may', 'not', 'always', 'know', 'the', 'exact', 'naming', 'or', 'an', 'exact', 'prefix', 'of', 'their', 'desired', 'data', 'the', 'current', 'approach', 'to', 'this', 'problemestablishing', 'naming', 'conventions', 'and', 'performing', 'name', 'lookupcan', 'be', 'infeasible', 'in', 'highly', 'ad', 'hoc', 'heterogeneous', 'and', 'dynamic', 'environments', 'the', 'same', 'data', 'can', 'be', 'named', 'using', 'different', 'terms', 'or', 'even', 'languages', 'naming', 'conventions', 'may', 'be', 'minimal', 'if', 'they', 'exist', 'at', 'all', 'and', 'name', 'lookups', 'can', 'be', 'costly', 'in', 'this', 'paper', 'we', 'present', 'a', 'fuzzy', 'interest', 'forwarding', 'approach', 'that', 'exploits', 'semantic', 'similarities', 'between', 'the', 'names', 'carried', 'in', 'interest', 'packets', 'and', 'the', 'names', 'of', 'potentially', 'matching', 'data', 'in', 'cs', 'and', 'entries', 'in', 'fib', 'we', 'describe', 'the', 'fuzzy', 'interest', 'forwarding', 'approach', 'outline', 'the', 'semantic', 'understanding', 'function', 'that', 'determines', 'the', 'name', 'matching', 'and', 'present', 'our', 'simulation', 'study', 'along', 'with', 'extended', 'evaluation', 'results']] | [-0.15356355656389217, 0.03620225414029429, -0.0485867802676549, 0.08480556288016307, -0.14630084206308624, -0.1629391161096134, 0.1378908582487007, 0.42358582180622184, -0.2741613642425294, -0.32339627296918894, 0.12212390831506116, -0.2548266524288827, -0.15240702839497072, 0.11095124672339031, -0.1139341652464525, 0.022927721523365398, 0.10511754951766057, 0.0840495365262506, -0.057620297040001364, -0.22564345481953804, 0.28076935036235434, 0.046942819681042317, 0.3447393460056869, 0.03478555060006607, 0.06970787236013207, 0.010761882799398007, -0.09732269122677553, -0.0025241106368933514, -0.07766596622408033, 0.10425506196144944, 0.34928297363577565, 0.2513720798217187, 0.2744769275330814, -0.4654775909177817, -0.14694141532490207, 0.08892035531176692, 0.1748605564853568, 0.1227203054252751, -0.061581921635438824, -0.30198214602342266, 0.10811604540290869, -0.21911900383449948, -0.04976928591799394, -0.07712332779767027, -0.008528946620074047, 0.04056239969343255, -0.24660327413955788, -0.02035004415350616, 0.025419194779246097, 0.04088758980665522, -0.030682874193925198, -0.08603751384315769, 0.010754319825832536, 0.16756588601133532, 0.026150758740059128, 0.02328959740490718, 0.09364286435554457, -0.12062109431702715, -0.1646699916399351, 0.40949106176686323, 0.02570863736639167, -0.2272400036216921, 0.14785694048271342, -0.023425205274052015, -0.16026241753760512, 0.08606835735730448, 0.1524037394115025, 0.1033984092568421, -0.19834884967666808, 0.02596813076432308, -0.0692288031398206, 0.19009195530348144, 0.12908928500188835, 0.045328424857917486, 0.21740173566849177, 0.1738738323722011, 0.04549182726627892, 0.09113848429309666, -0.04682023330590877, -0.10415980893121973, -0.2437861636607273, -0.1358090589404296, -0.18555109921744936, -0.03279596880798682, -0.10279281244839017, -0.17591860493538297, 0.3757736793760756, 0.22515832921816334, 0.16124373989974616, 0.04754339201838537, 0.3328310884980212, 0.04074473665792875, 0.0938766948288532, 0.14424121763948708, 0.1334779762906159, -0.02979942340445319, 0.17810490202295126, -0.15164521756206764, 0.15906623900262937, 0.03957323537202208] |
1,802.03073 | Partitions related to positive definite binary quadratic forms | The purpose of this paper is to present a collection of interesting
generating functions for partitions which have connections to positive definite
binary quadratic forms. In establishing our results we obtain some new Bailey
pairs.
| math.NT | the purpose of this paper is to present a collection of interesting generating functions for partitions which have connections to positive definite binary quadratic forms in establishing our results we obtain some new bailey pairs | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'present', 'a', 'collection', 'of', 'interesting', 'generating', 'functions', 'for', 'partitions', 'which', 'have', 'connections', 'to', 'positive', 'definite', 'binary', 'quadratic', 'forms', 'in', 'establishing', 'our', 'results', 'we', 'obtain', 'some', 'new', 'bailey', 'pairs']] | [-0.1754723010850804, 0.051096055430493184, -0.10012828367097037, 0.08561349457928112, -0.13802559330527273, -0.10380512442705887, 0.05868527670723519, 0.32033827805093357, -0.25232223591634206, -0.267001086473465, 0.03908393003512174, -0.2857813474323068, -0.23104070422372647, 0.23071952941162246, -0.05610769646508353, 0.0293331544314112, 0.06597070523670741, 0.011048759639795338, -0.1224954608295645, -0.319960799866489, 0.4091524991605963, 0.004784640084419932, 0.1576824895239302, 0.06375492378782448, 0.08981436218268105, 0.031032707675227096, -0.05836609793560846, -0.031099581505571093, -0.14166382221238955, 0.2236193730096732, 0.31338414390172276, 0.1596006386514221, 0.2551786148255425, -0.3351290194583791, -0.12587109181497777, 0.1732203641108104, 0.11203609984368086, 0.10063773362697767, -0.16520373012338366, -0.23487414527750974, 0.13398930173300738, -0.1405805755140526, -0.10558287276320957, -0.1299959554203919, 0.06404055560539876, 0.07905106571103845, -0.3124738197773695, -0.0019171665156526225, 0.10591363215020724, 0.04141855343644108, -0.06606648275628686, -0.165116804279387, 0.09341723431300904, 0.11718426678063613, 0.03263928583557052, 0.053140002778465194, -0.045165116180266654, -0.0768118326086551, -0.12492615679012878, 0.28881689264838184, 0.001568166512463774, -0.24246197486562387, 0.2123436374855893, -0.13819898109483933, -0.21872072105429002, 0.06080623678863049, 0.19840675850531886, 0.1345037770590612, -0.17870787052171572, 0.026394349190273454, -0.14138931312731334, 0.10690793884652001, 0.1136269565139498, 0.03793769772829754, 0.21149268336594104, 0.07832039573362895, 0.052616869106090494, 0.25682900745554693, -0.00933201742757644, -0.08780148666618126, -0.3397151527660234, -0.23678224392767463, -0.1369895515697343, 0.06009722036376063, -0.06584773863266621, -0.21240258844835416, 0.44441255394901547, 0.10743294507265091, 0.245937934837171, 0.14334799163376113, 0.1928403772945915, 0.128707591993069, 0.06350215093365737, 0.006101945721145187, 0.14974205599449175, 0.16354643516242504, 0.046080041836415016, -0.11882154026867024, 0.04151743823396308, 0.09327601214338627] |
1,802.03074 | Mining Open Government Data Used in Scientific Research | In the following paper, we describe results from mining citations, mentions,
and links to open government data (OGD) in peer-reviewed literature. We
inductively develop a method for categorizing how OGD are used by different
research communities, and provide descriptive statistics about the publication
years, publication outlets, and OGD sources. Our results demonstrate that, 1.
The use of OGD in research is steadily increasing from 2009 to 2016; 2.
Researchers use OGD from 96 different open government data portals, with
data.gov.uk and data.gov being the most frequent sources; and, 3.Contrary to
previous findings, we provide evidence suggesting that OGD from developing
nations, notably India and Kenya, are being frequently used to fuel scientific
discoveries. The findings of this paper contribute to ongoing research agendas
aimed at tracking the impact of open government data initiatives, and provides
an initial description of how open government data are valuable to diverse
scientific research communities.
| cs.CY cs.DB | in the following paper we describe results from mining citations mentions and links to open government data ogd in peerreviewed literature we inductively develop a method for categorizing how ogd are used by different research communities and provide descriptive statistics about the publication years publication outlets and ogd sources our results demonstrate that 1 the use of ogd in research is steadily increasing from 2009 to 2016 2 researchers use ogd from 96 different open government data portals with datagovuk and datagov being the most frequent sources and 3contrary to previous findings we provide evidence suggesting that ogd from developing nations notably india and kenya are being frequently used to fuel scientific discoveries the findings of this paper contribute to ongoing research agendas aimed at tracking the impact of open government data initiatives and provides an initial description of how open government data are valuable to diverse scientific research communities | [['in', 'the', 'following', 'paper', 'we', 'describe', 'results', 'from', 'mining', 'citations', 'mentions', 'and', 'links', 'to', 'open', 'government', 'data', 'ogd', 'in', 'peerreviewed', 'literature', 'we', 'inductively', 'develop', 'a', 'method', 'for', 'categorizing', 'how', 'ogd', 'are', 'used', 'by', 'different', 'research', 'communities', 'and', 'provide', 'descriptive', 'statistics', 'about', 'the', 'publication', 'years', 'publication', 'outlets', 'and', 'ogd', 'sources', 'our', 'results', 'demonstrate', 'that', '1', 'the', 'use', 'of', 'ogd', 'in', 'research', 'is', 'steadily', 'increasing', 'from', '2009', 'to', '2016', '2', 'researchers', 'use', 'ogd', 'from', '96', 'different', 'open', 'government', 'data', 'portals', 'with', 'datagovuk', 'and', 'datagov', 'being', 'the', 'most', 'frequent', 'sources', 'and', '3contrary', 'to', 'previous', 'findings', 'we', 'provide', 'evidence', 'suggesting', 'that', 'ogd', 'from', 'developing', 'nations', 'notably', 'india', 'and', 'kenya', 'are', 'being', 'frequently', 'used', 'to', 'fuel', 'scientific', 'discoveries', 'the', 'findings', 'of', 'this', 'paper', 'contribute', 'to', 'ongoing', 'research', 'agendas', 'aimed', 'at', 'tracking', 'the', 'impact', 'of', 'open', 'government', 'data', 'initiatives', 'and', 'provides', 'an', 'initial', 'description', 'of', 'how', 'open', 'government', 'data', 'are', 'valuable', 'to', 'diverse', 'scientific', 'research', 'communities']] | [-0.025902659033670568, 0.07736502291181996, -0.06353508889347918, 0.07461474722603688, -0.13429237746734274, -0.10054940476009112, 0.09996056346805031, 0.3864047355018556, -0.1975899382590354, -0.36842002202379137, 0.12371767635498121, -0.3730259275164556, -0.141100254860027, 0.24632892315275967, -0.12432894749390716, 0.01041017970891443, 0.11064784541549916, -0.033751945171782094, 0.05673485412419698, -0.34470227743322784, 0.2795141653057087, 0.06952655813251654, 0.3550569210579065, 0.09660546124812115, 0.002505174669676234, -0.047828651008171005, -0.16858091582685733, -0.026458409327755658, -0.15238729726912129, 0.2135104099414437, 0.41900408906056674, 0.27494926108173223, 0.379070458461757, -0.4230276540525862, -0.1453957240021712, 0.044287113844089815, 0.12454255971415723, 0.10047297688229387, -0.07941332993544387, -0.3358256832438496, 0.038028993719332924, -0.21093512874732195, -0.11729946304930726, -0.07702746339271323, 0.06892871822708764, 0.041238826310192864, -0.18104641353774414, 0.03212311831491722, -0.0040003692013891165, 0.14853951498996656, -0.0462849537599706, -0.1469253240832807, 0.025262080244657054, 0.21465881971478765, 0.13393636518456922, 0.07776837421968938, 0.13810857439199714, -0.12979076543313176, -0.17452512247286536, 0.32785381272913433, -0.0018593545899273374, -0.08532017688422285, 0.20620189288102492, -0.1004274556432171, -0.21744512201828026, 0.03978846125883629, 0.23495382982828478, 0.016301954482883418, -0.22181863071573144, 0.002596334765454427, -0.03391721793387488, 0.143372279684676, 0.06690899271524285, -0.028935189961418008, 0.20200846790858368, 0.17553003672887948, 0.05213118382930957, 0.10505647710807672, -0.020326457036709464, -0.08578450968363197, -0.2116322209507957, -0.11851512675639242, -0.09454777177165237, 0.011135670380050165, 0.006365822317339071, -0.08476846442932288, 0.39752010653122655, 0.22468208383164695, 0.10522618154818947, -0.019316955551354063, 0.2641127497851345, -0.0393450031256794, 0.07601917883683298, 0.14434090697496021, 0.16931180672631976, 0.028086643669175338, 0.20156600559759583, -0.07075462672337135, 0.07598680735414697, -0.05042804680242379] |
1,802.03075 | A Multi-Frequency Study of the Milky Way-like Spiral Galaxy NGC 6744 | We present a multi-frequency study of the intermediate spiral SAB(r)bc type
galaxy NGC 6744, using available data from the Chandra X-Ray telescope, radio
continuum data from the Australia Telescope Compact Array and Murchison
Widefield Array, and Wide-field Infrared Survey Explorer infrared observations.
We identify 117 X-ray sources and 280 radio sources. Of these, we find nine
sources in common between the X-ray and radio catalogues, one of which is a
faint central black hole with a bolometric radio luminosity similar to the
Milky Way's central black hole. We classify 5 objects as supernova remnant
candidates, 2 objects as likely supernova remnants, 17 as HII regions, 1 source
as an AGN; the remaining 255 radio sources are categorised as background
objects and one X-ray source is classified as a foreground star. We find the
star-formation rate (SFR) of NGC 6744 to be in the range 2.8 - 4.7
$\rm{M_{\odot}~yr^{-1}}$ signifying the galaxy is still actively forming stars.
The specific SFR of NGC 6744 is greater than that of late-type spirals such as
the Milky Way, but considerably less that that of a typical starburst galaxy.
| astro-ph.GA | we present a multifrequency study of the intermediate spiral sabrbc type galaxy ngc 6744 using available data from the chandra xray telescope radio continuum data from the australia telescope compact array and murchison widefield array and widefield infrared survey explorer infrared observations we identify 117 xray sources and 280 radio sources of these we find nine sources in common between the xray and radio catalogues one of which is a faint central black hole with a bolometric radio luminosity similar to the milky ways central black hole we classify 5 objects as supernova remnant candidates 2 objects as likely supernova remnants 17 as hii regions 1 source as an agn the remaining 255 radio sources are categorised as background objects and one xray source is classified as a foreground star we find the starformation rate sfr of ngc 6744 to be in the range 28 47 rmm_odotyr1 signifying the galaxy is still actively forming stars the specific sfr of ngc 6744 is greater than that of latetype spirals such as the milky way but considerably less that that of a typical starburst galaxy | [['we', 'present', 'a', 'multifrequency', 'study', 'of', 'the', 'intermediate', 'spiral', 'sabrbc', 'type', 'galaxy', 'ngc', '6744', 'using', 'available', 'data', 'from', 'the', 'chandra', 'xray', 'telescope', 'radio', 'continuum', 'data', 'from', 'the', 'australia', 'telescope', 'compact', 'array', 'and', 'murchison', 'widefield', 'array', 'and', 'widefield', 'infrared', 'survey', 'explorer', 'infrared', 'observations', 'we', 'identify', '117', 'xray', 'sources', 'and', '280', 'radio', 'sources', 'of', 'these', 'we', 'find', 'nine', 'sources', 'in', 'common', 'between', 'the', 'xray', 'and', 'radio', 'catalogues', 'one', 'of', 'which', 'is', 'a', 'faint', 'central', 'black', 'hole', 'with', 'a', 'bolometric', 'radio', 'luminosity', 'similar', 'to', 'the', 'milky', 'ways', 'central', 'black', 'hole', 'we', 'classify', '5', 'objects', 'as', 'supernova', 'remnant', 'candidates', '2', 'objects', 'as', 'likely', 'supernova', 'remnants', '17', 'as', 'hii', 'regions', '1', 'source', 'as', 'an', 'agn', 'the', 'remaining', '255', 'radio', 'sources', 'are', 'categorised', 'as', 'background', 'objects', 'and', 'one', 'xray', 'source', 'is', 'classified', 'as', 'a', 'foreground', 'star', 'we', 'find', 'the', 'starformation', 'rate', 'sfr', 'of', 'ngc', '6744', 'to', 'be', 'in', 'the', 'range', '28', '47', 'rmm_odotyr1', 'signifying', 'the', 'galaxy', 'is', 'still', 'actively', 'forming', 'stars', 'the', 'specific', 'sfr', 'of', 'ngc', '6744', 'is', 'greater', 'than', 'that', 'of', 'latetype', 'spirals', 'such', 'as', 'the', 'milky', 'way', 'but', 'considerably', 'less', 'that', 'that', 'of', 'a', 'typical', 'starburst', 'galaxy']] | [-0.032417719199666906, 0.04389877240014332, -0.03800755578160121, 0.1427181307689508, -0.15929532123122425, -0.05277178525276359, 0.061178698508038046, 0.4853609634861762, -0.09992612058358545, -0.3598166119399897, 0.10216038324484263, -0.3551182995977405, -0.018008742005517962, 0.2489648255601896, -0.01706990009001379, -0.09974685942661532, 0.03822061544778186, -0.15458096616010011, -0.018994832018426316, -0.26412330215889446, 0.2794466991677304, 0.099826294704963, 0.14774824239992798, -0.12320933336628735, 0.09902433077135839, -0.1509545641354393, -0.10995357824510056, -0.05769716717241054, -0.08932217715229442, 0.005779016913797254, 0.319686640770006, 0.1706969222865577, 0.18102774606343586, -0.31835467935390566, -0.20973363048422733, 0.060710625478596486, 0.22425038485693904, -0.005677859705373727, -0.07446505711028013, -0.3039364625946799, 0.08497106545290894, -0.25039335212847785, -0.20184056367982406, 0.15674311177707304, 0.06303094243064769, 0.059193465121615246, -0.14911728892513956, 0.1459305460921113, -0.04777052869392528, 0.07422674635106194, -0.17976330944789748, -0.08010099254270696, -0.021780262957198433, 0.0970514779408766, -0.023934405018544616, 0.14218918788143903, 0.21361707147334327, -0.16313174285524581, -0.039054668907240776, 0.3971106982404026, -0.003750704161103079, 0.11319066640452703, 0.2402586421584556, -0.23610846808653593, -0.23036167006785288, 0.10526719635663791, 0.13057094480513046, 0.126204957866537, -0.2283869333081565, -0.019185244997523374, -0.02974495433723729, 0.2647735785939911, 0.062433955627519286, 0.13701323022839526, 0.36448997070045513, 0.09457557811273148, 0.0744853849517624, 0.16458903693076923, -0.3392269116831501, 0.057133875581481204, -0.23692624687695701, -0.04061467954322943, -0.13068061370083559, 0.16788910343620453, -0.17312560669101135, -0.10763325666602269, 0.3076047848920384, 0.04387711063717191, 0.18229401061048947, 0.0179941955624529, 0.3075795831024976, 0.0022886851127130797, 0.14469232068343077, 0.14357064424458252, 0.3152171391119038, 0.14797292827263228, 0.07558685973368956, -0.1959564263922116, -0.014094082726736795, -0.02270529305469759] |
1,802.03076 | Hochschild and Simplicial Cohomology | We study a naturally occurring $E_{\infty}$-subalgebra of the full
$E_2$-Hochschild cochain complex arising from coherent cochains. For group
rings and certain category algebras, these cochains detect $H^*(B {\cal{C}})$,
the simplicial cohomology of the classifying space of the underlying group or
category, $\cal{C}$. In this setting the simplicial cup product of cochains on
$B{\cal{C}}$ agrees with the Gerstenhaber product and Steenrod's cup-one
product of cochains agrees with the pre-Lie product. We extend the idea of
coherent cochains to algebras more general than category algebras and dub the
resulting cochains autopoietic. Coefficients are from a commutative ring $k$
with unit, not necessarily a field.
| math.AT | we study a naturally occurring e_inftysubalgebra of the full e_2hochschild cochain complex arising from coherent cochains for group rings and certain category algebras these cochains detect hb calc the simplicial cohomology of the classifying space of the underlying group or category calc in this setting the simplicial cup product of cochains on bcalc agrees with the gerstenhaber product and steenrods cupone product of cochains agrees with the prelie product we extend the idea of coherent cochains to algebras more general than category algebras and dub the resulting cochains autopoietic coefficients are from a commutative ring k with unit not necessarily a field | [['we', 'study', 'a', 'naturally', 'occurring', 'e_inftysubalgebra', 'of', 'the', 'full', 'e_2hochschild', 'cochain', 'complex', 'arising', 'from', 'coherent', 'cochains', 'for', 'group', 'rings', 'and', 'certain', 'category', 'algebras', 'these', 'cochains', 'detect', 'hb', 'calc', 'the', 'simplicial', 'cohomology', 'of', 'the', 'classifying', 'space', 'of', 'the', 'underlying', 'group', 'or', 'category', 'calc', 'in', 'this', 'setting', 'the', 'simplicial', 'cup', 'product', 'of', 'cochains', 'on', 'bcalc', 'agrees', 'with', 'the', 'gerstenhaber', 'product', 'and', 'steenrods', 'cupone', 'product', 'of', 'cochains', 'agrees', 'with', 'the', 'prelie', 'product', 'we', 'extend', 'the', 'idea', 'of', 'coherent', 'cochains', 'to', 'algebras', 'more', 'general', 'than', 'category', 'algebras', 'and', 'dub', 'the', 'resulting', 'cochains', 'autopoietic', 'coefficients', 'are', 'from', 'a', 'commutative', 'ring', 'k', 'with', 'unit', 'not', 'necessarily', 'a', 'field']] | [-0.17630876496354622, 0.032506749128960837, -0.02560853501971887, 0.07299505050023257, -0.14101804346226307, -0.09206037067009934, -0.058279848633790196, 0.3667483584389889, -0.44089340802510174, -0.17164662972624814, 0.12164321261320302, -0.1768141859971291, -0.15874172536399672, 0.16230991326643116, -0.19864213708978223, -0.12601298282911277, 0.0922963346440193, 0.1297459410674566, -0.10908332430016325, -0.21829935389437846, 0.514229025083537, 0.00858473395976257, 0.21854711077841266, -0.029469918540431832, 0.07914528149959384, 0.0069745858104861514, -0.05250933681785756, -0.019693702663953074, -0.1586184566282211, 0.19991917668708734, 0.34395643890056077, 0.02988772926262903, 0.14583734026315626, -0.39557715041600927, -0.056869659268734406, 0.18512350660083549, 0.1043538483084246, -0.004486713249578464, 0.06146411010113483, -0.332848446952103, 0.04459058119896419, -0.2713260093836912, -0.052454355087283314, -0.07465048200374812, 0.07095182009815827, -0.01929669438063034, -0.25189490711829643, 0.008179568514531972, 0.06148688564533178, 0.14363563853335015, -0.1258096298920371, -0.08595072110634944, -0.14280035852321557, 0.07841534712779506, -0.12781385659259192, 0.03412427790985652, 0.21914674935634343, -0.0669615303845696, -0.20087313519705238, 0.39422365699951745, -0.0661966529259356, -0.20267387618291743, 0.13365615176854237, -0.237139133631955, -0.19028213862519788, 0.15749028711864838, -0.02677274968627156, 0.1765965414993769, 0.027944967697127437, 0.22765711034298874, -0.12760831090640656, 0.02160412925105466, 0.092353654488427, 0.006676724323722515, 0.12250072077600932, 0.11455719394618835, 0.050895090866180576, 0.11509429894824874, 0.05758455452955879, -0.10389182585462624, -0.3121831263700614, -0.2146147465409369, -0.030403036576676732, 0.16493116920039994, -0.12672058654885515, -0.18807077561790236, 0.35763978074323766, 0.07936960678043946, 0.2023353090887528, 0.17144259620857025, 0.22592784553690223, 0.022617284427111854, 0.12327304621445662, -0.015407489094769165, 0.060906155947215705, 0.3192605536326538, 0.00423451982039426, -0.07636510700044431, -0.02857511324275817, 0.25442981368348916] |
1,802.03077 | Combining Satellite Imagery and Numerical Model Simulation to Estimate
Ambient Air Pollution: An Ensemble Averaging Approach | Ambient fine particulate matter less than 2.5 $\mu$m in aerodynamic diameter
(PM$_{2.5}$) has been linked to various adverse health outcomes and has,
therefore, gained interest in public health. However, the sparsity of air
quality monitors greatly restricts the spatio-temporal coverage of PM$_{2.5}$
measurements, limiting the accuracy of PM$_{2.5}$-related health studies. We
develop a method to combine estimates for PM$_{2.5}$ using satellite-retrieved
aerosol optical depth (AOD) and simulations from the Community Multiscale Air
Quality (CMAQ) modeling system. While most previous methods utilize AOD or CMAQ
separately, we aim to leverage advantages offered by both methods in terms of
resolution and coverage by using Bayesian model averaging. In an application of
estimating daily PM$_{2.5}$ in the Southeastern US, the ensemble approach
outperforms statistical downscalers that use either AOD or CMAQ in
cross-validation analyses. In addition to PM$_{2.5}$, our approach is also
highly applicable for estimating other environmental risks that utilize
information from both satellite imagery and numerical model simulation.
| stat.AP | ambient fine particulate matter less than 25 mum in aerodynamic diameter pm_25 has been linked to various adverse health outcomes and has therefore gained interest in public health however the sparsity of air quality monitors greatly restricts the spatiotemporal coverage of pm_25 measurements limiting the accuracy of pm_25related health studies we develop a method to combine estimates for pm_25 using satelliteretrieved aerosol optical depth aod and simulations from the community multiscale air quality cmaq modeling system while most previous methods utilize aod or cmaq separately we aim to leverage advantages offered by both methods in terms of resolution and coverage by using bayesian model averaging in an application of estimating daily pm_25 in the southeastern us the ensemble approach outperforms statistical downscalers that use either aod or cmaq in crossvalidation analyses in addition to pm_25 our approach is also highly applicable for estimating other environmental risks that utilize information from both satellite imagery and numerical model simulation | [['ambient', 'fine', 'particulate', 'matter', 'less', 'than', '25', 'mum', 'in', 'aerodynamic', 'diameter', 'pm_25', 'has', 'been', 'linked', 'to', 'various', 'adverse', 'health', 'outcomes', 'and', 'has', 'therefore', 'gained', 'interest', 'in', 'public', 'health', 'however', 'the', 'sparsity', 'of', 'air', 'quality', 'monitors', 'greatly', 'restricts', 'the', 'spatiotemporal', 'coverage', 'of', 'pm_25', 'measurements', 'limiting', 'the', 'accuracy', 'of', 'pm_25related', 'health', 'studies', 'we', 'develop', 'a', 'method', 'to', 'combine', 'estimates', 'for', 'pm_25', 'using', 'satelliteretrieved', 'aerosol', 'optical', 'depth', 'aod', 'and', 'simulations', 'from', 'the', 'community', 'multiscale', 'air', 'quality', 'cmaq', 'modeling', 'system', 'while', 'most', 'previous', 'methods', 'utilize', 'aod', 'or', 'cmaq', 'separately', 'we', 'aim', 'to', 'leverage', 'advantages', 'offered', 'by', 'both', 'methods', 'in', 'terms', 'of', 'resolution', 'and', 'coverage', 'by', 'using', 'bayesian', 'model', 'averaging', 'in', 'an', 'application', 'of', 'estimating', 'daily', 'pm_25', 'in', 'the', 'southeastern', 'us', 'the', 'ensemble', 'approach', 'outperforms', 'statistical', 'downscalers', 'that', 'use', 'either', 'aod', 'or', 'cmaq', 'in', 'crossvalidation', 'analyses', 'in', 'addition', 'to', 'pm_25', 'our', 'approach', 'is', 'also', 'highly', 'applicable', 'for', 'estimating', 'other', 'environmental', 'risks', 'that', 'utilize', 'information', 'from', 'both', 'satellite', 'imagery', 'and', 'numerical', 'model', 'simulation']] | [-0.007225415900700375, 0.0422461227818684, -0.09000033671157313, 0.05305794328103423, -0.047576562894580815, -0.10142268502008316, 0.05151777249131981, 0.44836290197313894, -0.20946313092234098, -0.3472813066494252, 0.15207924584437815, -0.2961278356514968, -0.13033082972994292, 0.22361601072865503, -0.13621657115540334, 0.08810485793691879, 0.09254883326190923, -0.04213866157088332, -0.026289745439569672, -0.24692226916720922, 0.2279794877515985, 0.11207540622041501, 0.3561166130707829, 0.04200112600447973, 0.07967723100204263, 0.037078523837550025, -0.1091416245349078, 0.02498779954561093, -0.13258768342688224, 0.16803501828803452, 0.29389737642902347, 0.1648747792358619, 0.31941161521214556, -0.42364356743909615, -0.3036747950238067, 0.0974055090556284, 0.12941637484798232, 0.035589479171525835, -0.012101131300865249, -0.29285428688752574, 0.02426500380335545, -0.211884171912876, -0.08480364157116742, -0.0993955361584274, -0.0654099882178178, 0.012134226908765177, -0.2833385119129988, 0.10136300730862952, -0.044992964938524865, 0.15251719021516574, -0.08668349573975308, -0.146123979923273, -0.021433653032509974, 0.17923544954535758, 0.0660611361313563, -0.029373253590590623, 0.16309385534826448, -0.13613134453242476, -0.07774844558836964, 0.3596389145868552, -0.05786022927822597, -0.17461521103796732, 0.19920555289907307, -0.12249028882882618, -0.12652656492889047, 0.15891329157649986, 0.2390086530623111, 0.05039136672192918, -0.1774220979627367, -0.005515803908022096, 0.0006470937076230328, 0.21930161198032658, 0.08349117386312067, 0.017445774262093684, 0.13622067608816138, 0.21853043246022485, 0.0935705951097506, 0.07410086300594478, -0.19345621784767983, -0.048868425818637935, -0.14569522428338405, -0.11023360843673445, -0.16679698006739815, -0.019101961969410056, -0.11136046730060517, -0.09271025357317397, 0.37553314639666635, 0.27510943915090197, 0.10899081372341456, 0.028272144012636953, 0.3670852494141837, 0.0008657427320208448, 0.047604089675398614, 0.05419835981507725, 0.1999015227419796, 0.05960273412517393, 0.1221974544671618, -0.18892956749375836, 0.14112282611351074, -0.014958317987257977] |
1,802.03078 | Haga's theorems in paper folding and related theorems in Wasan geometry
Part 2 | We generalize problems in Wasan geometry which involve no folded figures but
are related to Haga's fold in origami. Using the tangent circles appeared in
those problems we give a parametric representation of the generalized Haga's
fold given in the first part of this two-part paper.
| math.HO | we generalize problems in wasan geometry which involve no folded figures but are related to hagas fold in origami using the tangent circles appeared in those problems we give a parametric representation of the generalized hagas fold given in the first part of this twopart paper | [['we', 'generalize', 'problems', 'in', 'wasan', 'geometry', 'which', 'involve', 'no', 'folded', 'figures', 'but', 'are', 'related', 'to', 'hagas', 'fold', 'in', 'origami', 'using', 'the', 'tangent', 'circles', 'appeared', 'in', 'those', 'problems', 'we', 'give', 'a', 'parametric', 'representation', 'of', 'the', 'generalized', 'hagas', 'fold', 'given', 'in', 'the', 'first', 'part', 'of', 'this', 'twopart', 'paper']] | [-0.1459135813790414, -0.017780546362147383, -0.06083984130426594, 0.06087190473361103, -0.10125473785497573, -0.08614303931877342, -0.026773495171927727, 0.3536234641366679, -0.2856061707109051, -0.23767261854980304, 0.07984710506001569, -0.24410815964169477, -0.2771786587798725, 0.20639000881625258, -0.17927772634784164, 0.03516453678679207, 0.05642861320191751, 0.030268172844839486, -0.10562190640231837, -0.25974662487557076, 0.31818273496490135, -0.024308239502083186, 0.19339193746892977, 0.017396687281965886, 0.08462810473840522, -0.028509589954805764, -0.03087374252145705, 0.017380205104532448, -0.20613822825860395, 0.20192480749329147, 0.30352350929245836, 0.10932344847115809, 0.2167244629893938, -0.43100315405298834, -0.15468735248862725, 0.14745116885751486, 0.14807188891522263, 0.11366181159341383, 0.005398817745077869, -0.1994492427000533, 0.04002147219548731, -0.10128032323732243, -0.12433326013548218, -0.04281550305693046, -0.058283928295840386, 0.02536471785329606, -0.11950973532689006, 0.08861362660789619, 0.1301841554839326, 0.08413121024268153, -0.04634835960282742, -0.13817493305744036, 0.03839235117092081, 0.07110800592066802, 0.03273620614377053, 0.011027010704350212, 0.05014727881137768, -0.09001403878969343, -0.17411693580367643, 0.4001365520411839, 0.012529609157987263, -0.26288892757957394, 0.10157099817677037, -0.10733462543145794, -0.2044122761581093, 0.15703303905446891, 0.18175701266559569, 0.12830195252014243, -0.11488559252946921, 0.0854186133036147, -0.043028397981644324, 0.10349844460902007, 0.20351213912236626, -0.07709167639816018, 0.15996572077679244, 0.10869754791138289, 0.056466175597565976, 0.25343359879258537, -0.02955515169457573, -0.1212932059298391, -0.3217012433173216, -0.13194023497888577, -0.11488446785622965, 0.04334828431677559, -0.017857837247783722, -0.22984902629547793, 0.44720109884181747, 0.08672947258405063, 0.23331570663772846, 0.04385472917372523, 0.23458713477315463, 0.07189258812602771, 0.055789607151856886, 0.07270456542787344, 0.24764796253293753, 0.09087907405489165, 0.06848580926737707, -0.06661685753573218, -0.017473571493452335, 0.11277531459927559] |
1,802.03079 | Hole Filling with Multiple Reference Views in DIBR View Synthesis | Depth-image-based rendering (DIBR) oriented view synthesis has been widely
employed in the current depth-based 3D video systems by synthesizing a virtual
view from an arbitrary viewpoint. However, holes may appear in the synthesized
view due to disocclusion, thus significantly degrading the quality.
Consequently, efforts have been made on developing effective and efficient hole
filling algorithms. Current hole filling techniques generally
extrapolate/interpolate the hole regions with the neighboring information based
on an assumption that the texture pattern in the holes is similar to that of
the neighboring background information. However, in many scenarios especially
of complex texture, the assumption may not hold. In other words, hole filling
techniques can only provide an estimation for a hole which may not be good
enough or may even be erroneous considering a wide variety of complex scene of
images. In this paper, we first examine the view interpolation with multiple
reference views, demonstrating that the problem of emerging holes in a target
virtual view can be greatly alleviated by making good use of other neighboring
complementary views in addition to its two (commonly used) most neighboring
primary views. The effects of using multiple views for view extrapolation in
reducing holes are also investigated in this paper. In view of the 3D Video and
ongoing free-viewpoint TV standardization, we propose a new view synthesis
framework which employs multiple views to synthesize output virtual views.
Furthermore, a scheme of selective warping of complementary views is developed
by efficiently locating a small number of useful pixels in the complementary
views for hole reduction, to avoid a full warping of additional complementary
views thus lowering greatly the warping complexity.
| cs.CV | depthimagebased rendering dibr oriented view synthesis has been widely employed in the current depthbased 3d video systems by synthesizing a virtual view from an arbitrary viewpoint however holes may appear in the synthesized view due to disocclusion thus significantly degrading the quality consequently efforts have been made on developing effective and efficient hole filling algorithms current hole filling techniques generally extrapolateinterpolate the hole regions with the neighboring information based on an assumption that the texture pattern in the holes is similar to that of the neighboring background information however in many scenarios especially of complex texture the assumption may not hold in other words hole filling techniques can only provide an estimation for a hole which may not be good enough or may even be erroneous considering a wide variety of complex scene of images in this paper we first examine the view interpolation with multiple reference views demonstrating that the problem of emerging holes in a target virtual view can be greatly alleviated by making good use of other neighboring complementary views in addition to its two commonly used most neighboring primary views the effects of using multiple views for view extrapolation in reducing holes are also investigated in this paper in view of the 3d video and ongoing freeviewpoint tv standardization we propose a new view synthesis framework which employs multiple views to synthesize output virtual views furthermore a scheme of selective warping of complementary views is developed by efficiently locating a small number of useful pixels in the complementary views for hole reduction to avoid a full warping of additional complementary views thus lowering greatly the warping complexity | [['depthimagebased', 'rendering', 'dibr', 'oriented', 'view', 'synthesis', 'has', 'been', 'widely', 'employed', 'in', 'the', 'current', 'depthbased', '3d', 'video', 'systems', 'by', 'synthesizing', 'a', 'virtual', 'view', 'from', 'an', 'arbitrary', 'viewpoint', 'however', 'holes', 'may', 'appear', 'in', 'the', 'synthesized', 'view', 'due', 'to', 'disocclusion', 'thus', 'significantly', 'degrading', 'the', 'quality', 'consequently', 'efforts', 'have', 'been', 'made', 'on', 'developing', 'effective', 'and', 'efficient', 'hole', 'filling', 'algorithms', 'current', 'hole', 'filling', 'techniques', 'generally', 'extrapolateinterpolate', 'the', 'hole', 'regions', 'with', 'the', 'neighboring', 'information', 'based', 'on', 'an', 'assumption', 'that', 'the', 'texture', 'pattern', 'in', 'the', 'holes', 'is', 'similar', 'to', 'that', 'of', 'the', 'neighboring', 'background', 'information', 'however', 'in', 'many', 'scenarios', 'especially', 'of', 'complex', 'texture', 'the', 'assumption', 'may', 'not', 'hold', 'in', 'other', 'words', 'hole', 'filling', 'techniques', 'can', 'only', 'provide', 'an', 'estimation', 'for', 'a', 'hole', 'which', 'may', 'not', 'be', 'good', 'enough', 'or', 'may', 'even', 'be', 'erroneous', 'considering', 'a', 'wide', 'variety', 'of', 'complex', 'scene', 'of', 'images', 'in', 'this', 'paper', 'we', 'first', 'examine', 'the', 'view', 'interpolation', 'with', 'multiple', 'reference', 'views', 'demonstrating', 'that', 'the', 'problem', 'of', 'emerging', 'holes', 'in', 'a', 'target', 'virtual', 'view', 'can', 'be', 'greatly', 'alleviated', 'by', 'making', 'good', 'use', 'of', 'other', 'neighboring', 'complementary', 'views', 'in', 'addition', 'to', 'its', 'two', 'commonly', 'used', 'most', 'neighboring', 'primary', 'views', 'the', 'effects', 'of', 'using', 'multiple', 'views', 'for', 'view', 'extrapolation', 'in', 'reducing', 'holes', 'are', 'also', 'investigated', 'in', 'this', 'paper', 'in', 'view', 'of', 'the', '3d', 'video', 'and', 'ongoing', 'freeviewpoint', 'tv', 'standardization', 'we', 'propose', 'a', 'new', 'view', 'synthesis', 'framework', 'which', 'employs', 'multiple', 'views', 'to', 'synthesize', 'output', 'virtual', 'views', 'furthermore', 'a', 'scheme', 'of', 'selective', 'warping', 'of', 'complementary', 'views', 'is', 'developed', 'by', 'efficiently', 'locating', 'a', 'small', 'number', 'of', 'useful', 'pixels', 'in', 'the', 'complementary', 'views', 'for', 'hole', 'reduction', 'to', 'avoid', 'a', 'full', 'warping', 'of', 'additional', 'complementary', 'views', 'thus', 'lowering', 'greatly', 'the', 'warping', 'complexity']] | [-0.10381511113847848, 0.05359558217551913, -0.06497823539776383, 0.08625874171654384, -0.08985289974759023, -0.1524605221891155, 0.04699441838181681, 0.396790482125383, -0.2702857273462642, -0.35561002340616177, 0.0960831134390362, -0.23849138038198428, -0.15761135125584486, 0.19295146030964572, -0.1345706526103809, 0.023823685017285042, 0.05437476763143894, -0.008332534346414764, -0.11386011308641172, -0.23741095529317305, 0.31392705877941035, 0.0643119301095053, 0.32669242324600756, 0.012543260442368961, 0.06720258545564893, 0.04461188828917565, -0.06334569809992832, 0.0777607779607125, -0.04843326915716817, 0.16308561325875215, 0.29717118037709345, 0.15888717880782982, 0.273386837904238, -0.4557101224307661, -0.24376434229823105, 0.04978001902776736, 0.18461253490661167, 0.14195179216373988, -0.1030075261283114, -0.2858009909003697, 0.09629942879115266, -0.1528209792777758, -0.06832471793243679, -0.06069011569833728, -0.019622288597316517, -0.034762942119225586, -0.25614660397016753, -0.00441406351213421, 0.04173971426983674, 0.027379198232665658, -0.0698604875300252, -0.09346817511099356, -9.765940959806795e-05, 0.19102698526327946, 0.05064437037670157, 0.06730875279969985, 0.12778133753411197, -0.16587175106871183, -0.12180038036269791, 0.3882894141047641, 0.0012000614673727088, -0.22327791237513775, 0.21812414123387835, -0.12085033810473289, -0.1228294971416256, 0.1616585220831136, 0.17560808647044554, 0.13348973254232313, -0.16820434102857554, 0.04315835982367086, -0.03313195440504286, 0.184595191814609, 0.07244419945507413, 0.05919996656442958, 0.29737491081641226, 0.15441533624436016, 0.0453026424642842, 0.11651526092017, -0.1311860916884918, -0.06702855217865565, -0.2015842219079517, -0.12679518779946697, -0.1718662240145797, 0.012039723400893208, -0.0939305227783431, -0.14947224721243535, 0.3534127218748364, 0.189938421352525, 0.2207560296299764, -0.018060107946533847, 0.3470626543546031, 0.03942333752789569, 0.09458677854078511, 0.025049014948470155, 0.2203270364035335, 0.01605309914642324, 0.10630763392955823, -0.14234330947122847, 0.0808250186462559, 0.05196555033757317] |
1,802.0308 | Abstraction, Composition and Contracts: A Sheaf Theoretic Approach | Complex systems of systems (SoS) are characterized by multiple interconnected
subsystems. Typically, each subsystem is designed and analyzed using
methodologies and formalisms that are specific to the particular subsystem
model of computation considered --- Petri nets, continuous time ODEs,
nondeterministic automata, to name a few. When interconnecting subsystems, a
designer needs to choose, based on the specific subsystems models, a common
abstraction framework to analyze the composition. In this paper we introduce a
new framework for abstraction, composition and analysis of SoS that builds on
results and methods developed in sheaf theory, category theory and topos
theory. In particular, we will be modeling behaviors of systems using sheaves,
leverage category theoretic methods to define wiring diagrams and formalize
composition and, by establishing a connection with topos theory, define a
formal (intuitionistic/constructive) logic with a sound sheaf semantics
| cs.LO cs.SY | complex systems of systems sos are characterized by multiple interconnected subsystems typically each subsystem is designed and analyzed using methodologies and formalisms that are specific to the particular subsystem model of computation considered petri nets continuous time odes nondeterministic automata to name a few when interconnecting subsystems a designer needs to choose based on the specific subsystems models a common abstraction framework to analyze the composition in this paper we introduce a new framework for abstraction composition and analysis of sos that builds on results and methods developed in sheaf theory category theory and topos theory in particular we will be modeling behaviors of systems using sheaves leverage category theoretic methods to define wiring diagrams and formalize composition and by establishing a connection with topos theory define a formal intuitionisticconstructive logic with a sound sheaf semantics | [['complex', 'systems', 'of', 'systems', 'sos', 'are', 'characterized', 'by', 'multiple', 'interconnected', 'subsystems', 'typically', 'each', 'subsystem', 'is', 'designed', 'and', 'analyzed', 'using', 'methodologies', 'and', 'formalisms', 'that', 'are', 'specific', 'to', 'the', 'particular', 'subsystem', 'model', 'of', 'computation', 'considered', 'petri', 'nets', 'continuous', 'time', 'odes', 'nondeterministic', 'automata', 'to', 'name', 'a', 'few', 'when', 'interconnecting', 'subsystems', 'a', 'designer', 'needs', 'to', 'choose', 'based', 'on', 'the', 'specific', 'subsystems', 'models', 'a', 'common', 'abstraction', 'framework', 'to', 'analyze', 'the', 'composition', 'in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'framework', 'for', 'abstraction', 'composition', 'and', 'analysis', 'of', 'sos', 'that', 'builds', 'on', 'results', 'and', 'methods', 'developed', 'in', 'sheaf', 'theory', 'category', 'theory', 'and', 'topos', 'theory', 'in', 'particular', 'we', 'will', 'be', 'modeling', 'behaviors', 'of', 'systems', 'using', 'sheaves', 'leverage', 'category', 'theoretic', 'methods', 'to', 'define', 'wiring', 'diagrams', 'and', 'formalize', 'composition', 'and', 'by', 'establishing', 'a', 'connection', 'with', 'topos', 'theory', 'define', 'a', 'formal', 'intuitionisticconstructive', 'logic', 'with', 'a', 'sound', 'sheaf', 'semantics']] | [-0.13523042242870562, 0.045742132014560476, -0.09147968840681844, 0.08909330266286378, -0.09373419111663545, -0.20131181930709216, 0.05056913767820569, 0.36084373631273153, -0.3309089729355441, -0.27820142853867125, 0.07950378402601928, -0.21037243593622137, -0.1720664445793739, 0.1372180185229, -0.13970420720655022, 0.04368038441020029, 0.04379373012214071, 0.029517328573597804, -0.055983880510622704, -0.20814796124791934, 0.4007905533209581, 0.008789413436143487, 0.26514144948925134, 0.00015670309464136759, 0.11450079320412543, 0.015042634346280937, -0.00494081704635863, 0.06997837175494405, -0.11526247063809057, 0.19120962907111755, 0.3639285546325684, 0.1949326912596546, 0.27971100271334526, -0.46651866006906384, -0.1813739570133664, 0.06752783067317472, 0.0853737585901938, 0.07340698749068435, 0.036717472665218846, -0.2823189765335647, 0.06454034755696302, -0.22373798158433703, -0.056798821592841435, -0.14603543960558318, 0.017622839430071136, 0.028515096519280362, -0.21920668319281605, -0.07831913857479338, 0.06677889805804524, 0.13653625791409502, -0.07594056987652072, -0.06012641559516649, -0.0324182486170213, 0.10101872044809473, -0.07631352161902383, -0.016159498815735182, 0.14372449654533906, -0.06588765325852566, -0.20314963222653779, 0.34154051794084134, -0.03889423650516956, -0.2200766233727336, 0.22820081459875735, -0.040830688752854866, -0.2071047247008041, 0.05019044427727177, 0.14629601915022014, 0.1255800055117881, -0.18155494008646605, 0.10999495448173817, -0.019808616220123237, 0.21053904646800625, 0.04954721811744902, 0.0528027465429019, 0.19125368437143386, 0.23388907049299665, 0.012365352707759788, 0.13224537496851688, 0.052224078460562005, -0.1440968604689395, -0.2791344148214665, -0.1509638001486935, -0.09165966691518271, -0.02146471335845827, -0.03283109686917332, -0.18796554590678877, 0.37711672809112956, 0.18002793469867256, 0.13719447641870594, 0.14302321901131007, 0.31209982151717497, 0.11362700907651473, 0.07639893207147165, 0.035435872055866104, 0.12637149405976136, 0.18315287179279108, 0.10549096535822308, -0.10331073732598237, 0.06918346937918277, 0.16488479271496612] |
1,802.03081 | An optimal bound for the ratio between ordinary and uniform exponents of
Diophantine approximation | We provide a lower bound for the ratio between the ordinary and uniform
exponent of both simultaneous Diophantine approximation and Diophantine
approximation by linear forms in any dimension. This lower bound was
conjectured by Schmidt and Summerer and already shown in dimension $2$ and $3$.
This lower bound is reached at regular systems presented in the context of
parametric geometry of numbers, and thus optimal.
| math.NT | we provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous diophantine approximation and diophantine approximation by linear forms in any dimension this lower bound was conjectured by schmidt and summerer and already shown in dimension 2 and 3 this lower bound is reached at regular systems presented in the context of parametric geometry of numbers and thus optimal | [['we', 'provide', 'a', 'lower', 'bound', 'for', 'the', 'ratio', 'between', 'the', 'ordinary', 'and', 'uniform', 'exponent', 'of', 'both', 'simultaneous', 'diophantine', 'approximation', 'and', 'diophantine', 'approximation', 'by', 'linear', 'forms', 'in', 'any', 'dimension', 'this', 'lower', 'bound', 'was', 'conjectured', 'by', 'schmidt', 'and', 'summerer', 'and', 'already', 'shown', 'in', 'dimension', '2', 'and', '3', 'this', 'lower', 'bound', 'is', 'reached', 'at', 'regular', 'systems', 'presented', 'in', 'the', 'context', 'of', 'parametric', 'geometry', 'of', 'numbers', 'and', 'thus', 'optimal']] | [-0.14793059913119158, 0.12077522797939869, -0.08197788194251748, 0.08079606956408288, -0.0040520145101114536, -0.1644445707090199, 0.10248543078509662, 0.2390429008465547, -0.20741299915199096, -0.3425340121217932, 0.11466943789452601, -0.20828313856170727, -0.15423385952957547, 0.2381310470402241, -0.03354196366495811, 0.09986737227927034, -0.045338483692075195, 0.057035507631147855, -0.07071602808741423, -0.32146801156923177, 0.31013680203602867, 0.033006915693672804, 0.2849871503475767, 0.06916594508175666, 0.08834108734646669, 0.007048313599079847, 0.009120650130968827, 0.009176609536203055, -0.19568467849435714, 0.15150686506755076, 0.25141006332750504, 0.10425708275053273, 0.23999453869003515, -0.3677691308638224, -0.1544251543111526, 0.1004216423831307, 0.15583975980631434, 0.06444960300309154, -0.004819764769994296, -0.22302293811853116, 0.11262349871775279, -0.1334901916543738, -0.16844436898827553, -0.037048296057260954, 0.0903334602713585, 0.015147916234743137, -0.3122006115431969, 0.08713176939636469, 0.15209304466082427, 0.08617374118990623, -0.06511995525887379, -0.1576809479138599, 0.04559844181371423, 0.06981540349885249, -0.04067464161735888, 0.00816515634696071, -0.030868005394362488, -0.11430230561213997, -0.09804385353166323, 0.291813608573284, -0.08460940244392706, -0.2115256579162983, 0.18530719131231307, -0.21034872642216773, -0.11212344755275318, 0.1458274970547511, 0.16756719502692038, 0.10611487664282322, -0.05566311573179868, 0.1565698733069719, -0.07590524503388084, 0.1740369454599344, 0.1660774094124253, 0.03624536713871818, 0.0750384901292049, 0.07988282371885501, 0.13718227424587195, 0.1598416310376846, -0.010907973907887936, -0.05311598854067807, -0.2440670470205637, -0.12396030595723109, -0.210912082485783, 0.06554969500105541, -0.1303418333915313, -0.10029179825080344, 0.2986943704291032, 0.024947442744786923, 0.1855451532567923, 0.09694659594947902, 0.2772658486205798, 0.19240842793996518, -0.019336201594426082, 0.15083510042526402, 0.2849962268812725, 0.1883088933232312, 0.016932090271550876, -0.15966068180277943, 0.039656278448036084, 0.1677459401723284] |
1,802.03082 | The Foldy-Lax Approximation for the Full Electromagnetic Scattering by
Small Conductive Bodies of Arbitrary Shapes | We deal with the electromagnetic waves propagation in the harmonic regime. We
derive the Foldy-Lax approximation of the scattered fields generated by a
cluster of small conductive inhomogeneities arbitrarily distributed in a
bounded domain $\Omega$ of $\mathbb{R}^3$.
This approximation is valid under a sufficient but general condition on the
number of such inhomogeneities $m$, their maximum radii $\epsilon$ and the
minimum distances between them $\delta$, the form $$(\ln
m)^{\frac{1}{3}}\frac{\epsilon}{\delta} \leq C,$$ where $C$ is a constant
depending only on the Lipschitz characters of the scaled inhomogeneities. In
addition, we provide explicit error estimates of this approximation in terms of
aforementioned parameters, $m, \epsilon, \delta$ but also the used frequencies
$k$ under the Rayleigh regime. Both the far-fields and the near-fields (stated
at a distance $\delta$ to the cluster) are estimated. In particular, for a
moderate number of small inhomogeneities $m$, the derived expansions are valid
in the mesoscale regime where $\delta \sim \epsilon$.
At the mathematical analysis level and based on integral equation methods, we
prove a priori estimates of the densities in the $L^{2,Div}_t$ spaces instead
of the usual $L^2$ spaces (which are not enough). A key point in such a proof
is a derivation of a particular Helmholtz type decomposition of the densities.
Those estimates allow to obtain the needed qualitative as well as quantitative
estimates while refining the approximation. Finally, to prove the invertibility
of the Foldy-Lax linear algebraic system, we reduce the coercivity inequality
to the one related to the scalar Helmholtz model. As this linear algebraic
system comes from the boundary conditions, such a reduction is not
straightforward.
| math.AP | we deal with the electromagnetic waves propagation in the harmonic regime we derive the foldylax approximation of the scattered fields generated by a cluster of small conductive inhomogeneities arbitrarily distributed in a bounded domain omega of mathbbr3 this approximation is valid under a sufficient but general condition on the number of such inhomogeneities m their maximum radii epsilon and the minimum distances between them delta the form ln mfrac13fracepsilondelta leq c where c is a constant depending only on the lipschitz characters of the scaled inhomogeneities in addition we provide explicit error estimates of this approximation in terms of aforementioned parameters m epsilon delta but also the used frequencies k under the rayleigh regime both the farfields and the nearfields stated at a distance delta to the cluster are estimated in particular for a moderate number of small inhomogeneities m the derived expansions are valid in the mesoscale regime where delta sim epsilon at the mathematical analysis level and based on integral equation methods we prove a priori estimates of the densities in the l2div_t spaces instead of the usual l2 spaces which are not enough a key point in such a proof is a derivation of a particular helmholtz type decomposition of the densities those estimates allow to obtain the needed qualitative as well as quantitative estimates while refining the approximation finally to prove the invertibility of the foldylax linear algebraic system we reduce the coercivity inequality to the one related to the scalar helmholtz model as this linear algebraic system comes from the boundary conditions such a reduction is not straightforward | [['we', 'deal', 'with', 'the', 'electromagnetic', 'waves', 'propagation', 'in', 'the', 'harmonic', 'regime', 'we', 'derive', 'the', 'foldylax', 'approximation', 'of', 'the', 'scattered', 'fields', 'generated', 'by', 'a', 'cluster', 'of', 'small', 'conductive', 'inhomogeneities', 'arbitrarily', 'distributed', 'in', 'a', 'bounded', 'domain', 'omega', 'of', 'mathbbr3', 'this', 'approximation', 'is', 'valid', 'under', 'a', 'sufficient', 'but', 'general', 'condition', 'on', 'the', 'number', 'of', 'such', 'inhomogeneities', 'm', 'their', 'maximum', 'radii', 'epsilon', 'and', 'the', 'minimum', 'distances', 'between', 'them', 'delta', 'the', 'form', 'ln', 'mfrac13fracepsilondelta', 'leq', 'c', 'where', 'c', 'is', 'a', 'constant', 'depending', 'only', 'on', 'the', 'lipschitz', 'characters', 'of', 'the', 'scaled', 'inhomogeneities', 'in', 'addition', 'we', 'provide', 'explicit', 'error', 'estimates', 'of', 'this', 'approximation', 'in', 'terms', 'of', 'aforementioned', 'parameters', 'm', 'epsilon', 'delta', 'but', 'also', 'the', 'used', 'frequencies', 'k', 'under', 'the', 'rayleigh', 'regime', 'both', 'the', 'farfields', 'and', 'the', 'nearfields', 'stated', 'at', 'a', 'distance', 'delta', 'to', 'the', 'cluster', 'are', 'estimated', 'in', 'particular', 'for', 'a', 'moderate', 'number', 'of', 'small', 'inhomogeneities', 'm', 'the', 'derived', 'expansions', 'are', 'valid', 'in', 'the', 'mesoscale', 'regime', 'where', 'delta', 'sim', 'epsilon', 'at', 'the', 'mathematical', 'analysis', 'level', 'and', 'based', 'on', 'integral', 'equation', 'methods', 'we', 'prove', 'a', 'priori', 'estimates', 'of', 'the', 'densities', 'in', 'the', 'l2div_t', 'spaces', 'instead', 'of', 'the', 'usual', 'l2', 'spaces', 'which', 'are', 'not', 'enough', 'a', 'key', 'point', 'in', 'such', 'a', 'proof', 'is', 'a', 'derivation', 'of', 'a', 'particular', 'helmholtz', 'type', 'decomposition', 'of', 'the', 'densities', 'those', 'estimates', 'allow', 'to', 'obtain', 'the', 'needed', 'qualitative', 'as', 'well', 'as', 'quantitative', 'estimates', 'while', 'refining', 'the', 'approximation', 'finally', 'to', 'prove', 'the', 'invertibility', 'of', 'the', 'foldylax', 'linear', 'algebraic', 'system', 'we', 'reduce', 'the', 'coercivity', 'inequality', 'to', 'the', 'one', 'related', 'to', 'the', 'scalar', 'helmholtz', 'model', 'as', 'this', 'linear', 'algebraic', 'system', 'comes', 'from', 'the', 'boundary', 'conditions', 'such', 'a', 'reduction', 'is', 'not', 'straightforward']] | [-0.16318874725344024, 0.10251772093649737, -0.06607689764136555, 0.08639730722598832, -0.06296093275474378, -0.10827758161786416, 0.06078809277391796, 0.31045035563205936, -0.28197265674995253, -0.2767529546807723, 0.11022367056680422, -0.2500400559484274, -0.09713253709826604, 0.19212710578574432, -0.04400656713191527, 0.053298117512644363, 0.03491037226214263, 0.06898259185265725, -0.0951945901040159, -0.21155788566581762, 0.30825258720883836, 0.0005793579643542283, 0.216823598607247, 0.05160503078500073, 0.09093517949091007, -0.023547376247329846, 0.006444740827263143, 0.02326774787357598, -0.18319417741435126, 0.1213759204927632, 0.22747274033432663, 0.049641140220130144, 0.2853563298637197, -0.3989987342379331, -0.1992994855145542, 0.10262793731622369, 0.13823182061800762, 0.08346118540833151, 0.005766367533518951, -0.2459431952043968, 0.09383389305401865, -0.09504160889642049, -0.17276390317570547, -0.046237245908585085, 0.017878060437867355, 0.06721495487437301, -0.32356214278887857, 0.09434590650126035, 0.09900864018787454, 0.04313895188743013, -0.07067591885204687, -0.13066360012983183, 0.011754268033686897, 0.1000267637699978, 0.02474788560262628, 0.03536362422086473, 0.0813883724105027, -0.1172689191980994, 0.009473500230485194, 0.3729988285893453, -0.0907287108620461, -0.24014045498101932, 0.15089580738494152, -0.17018782589939188, -0.09419415117030913, 0.10429103744673004, 0.1507623019696024, 0.15209972036652752, -0.11547787444018384, 0.14639315926545687, -0.032212568692759506, 0.15968381786610578, 0.10851638746123148, 0.04161261136744392, 0.12073534909792787, 0.10363058869680568, 0.10622530967091706, 0.10640864762730926, -0.07931001491809417, -0.0472880536061444, -0.38205473215604235, -0.12036454616207273, -0.20141401446256715, 0.06202109986829207, -0.15347669305840964, -0.1983943794152817, 0.3287084870695197, 0.10724690178287898, 0.20041879534657145, 0.086087992001357, 0.2692965793381427, 0.15543519396275118, 0.036404424253315935, 0.10080588764200608, 0.22497093280995, 0.180918621228494, 0.08447706366539487, -0.20312286709913435, 0.04969041360991782, 0.09509071206398106] |
1,802.03083 | Generalized ordinary differential equations in metric spaces | The aim of this text is to extend the theory of generalized ordinary
differential equations to the setting of metric spaces. We present existence
and uniqueness theorems that significantly improve previous results even when
restricted back to Euclidean spaces.
| math.CA math.DS math.MG | the aim of this text is to extend the theory of generalized ordinary differential equations to the setting of metric spaces we present existence and uniqueness theorems that significantly improve previous results even when restricted back to euclidean spaces | [['the', 'aim', 'of', 'this', 'text', 'is', 'to', 'extend', 'the', 'theory', 'of', 'generalized', 'ordinary', 'differential', 'equations', 'to', 'the', 'setting', 'of', 'metric', 'spaces', 'we', 'present', 'existence', 'and', 'uniqueness', 'theorems', 'that', 'significantly', 'improve', 'previous', 'results', 'even', 'when', 'restricted', 'back', 'to', 'euclidean', 'spaces']] | [-0.06775559139891695, 0.03884866651601325, -0.09675555169964448, 0.14320397599098775, -0.13432608420650163, -0.09079713441240482, 0.035254240540477134, 0.277289653244691, -0.2966584861278534, -0.23110830086546066, 0.12018189166123286, -0.2804558386262029, -0.15725289762784272, 0.18017016761960128, -0.1714215883746361, 0.05654009880545812, 0.07492316769770323, 0.047577000055939726, -0.13648711424320936, -0.3465058507445531, 0.4299553299489885, -0.019443855134364314, 0.26388503365123117, 0.04060238205756132, 0.09797014771268153, 0.03683947815965766, -0.05480828575598888, 0.029114739157450505, -0.18086997606550517, 0.1783281699157296, 0.30829483318405276, 0.1048171418504073, 0.26803741816622323, -0.4061572013470607, -0.22320507378436816, 0.16019534271879074, 0.12202069736444034, 0.08515119705444728, 0.028141146167539634, -0.32586334937084943, 0.15145495963784364, -0.08806452150337207, -0.1867821551142977, -0.10084413049312738, -0.028151934775404442, 0.0127682934443538, -0.2236008471212326, 0.048910712906851984, 0.1732848156004762, -0.03055567182122897, -0.14692537656101662, -0.06975446443240611, 0.029302886770799372, 0.10377934258446121, 0.06398892009224838, 0.07022265061879387, 0.049335851393735565, -0.06876870869802168, -0.14711642488598442, 0.3509524026169227, -0.09862402956693983, -0.289868535187382, 0.1675105472214711, -0.1581315141505538, -0.1473896547149007, 0.08668726076109287, 0.18429276870133784, 0.1842608025464683, -0.1033770307284356, 0.14673102956163722, -0.07679954319237134, 0.10396259172986715, 0.08931313684353462, 0.020185983035331354, 0.024505537440582443, 0.09981166938534723, 0.10925520001313625, 0.15995019452813536, 0.03021295803288619, -0.13272838142569152, -0.28868432870755595, -0.14262151891867128, -0.0771370700870951, 0.07134445775777866, -0.10200945078954995, -0.15332568666109672, 0.3099959828437139, 0.1994156837463379, 0.1591302187014849, 0.1551437834277749, 0.2826122120500375, 0.09025266508643444, -0.014068250568249287, 0.025388880764158107, 0.24533367405335108, 0.23033603204366487, 0.16115772213118199, -0.14717693083609143, -0.00021278804454665916, 0.17913817447156477] |
1,802.03084 | Realfast: Real-Time, Commensal Fast Transient Surveys with the Very
Large Array | Radio interferometers have the ability to precisely localize and better
characterize the properties of sources. This ability is having a powerful
impact on the study of fast radio transients, where a few milliseconds of data
is enough to pinpoint a source at cosmological distances. However, recording
interferometric data at millisecond cadence produces a terabyte-per-hour data
stream that strains networks, computing systems, and archives. This challenge
mirrors that of other domains of science, where the science scope is limited by
the computational architecture as much as the physical processes at play. Here,
we present a solution to this problem in the context of radio transients:
realfast, a commensal, fast transient search system at the Jansky Very Large
Array. Realfast uses a novel architecture to distribute fast-sampled
interferometric data to a 32-node, 64-GPU cluster for real-time imaging and
transient detection. By detecting transients in situ, we can trigger the
recording of data for those rare, brief instants when the event occurs and
reduce the recorded data volume by a factor of 1000. This makes it possible to
commensally search a data stream that would otherwise be impossible to record.
This system will search for millisecond transients in more than 1000 hours of
data per year, potentially localizing several Fast Radio Bursts, pulsars, and
other sources of impulsive radio emission. We describe the science scope for
realfast, the system design, expected outcomes, and ways real-time analysis can
help in other fields of astrophysics.
| astro-ph.IM | radio interferometers have the ability to precisely localize and better characterize the properties of sources this ability is having a powerful impact on the study of fast radio transients where a few milliseconds of data is enough to pinpoint a source at cosmological distances however recording interferometric data at millisecond cadence produces a terabyteperhour data stream that strains networks computing systems and archives this challenge mirrors that of other domains of science where the science scope is limited by the computational architecture as much as the physical processes at play here we present a solution to this problem in the context of radio transients realfast a commensal fast transient search system at the jansky very large array realfast uses a novel architecture to distribute fastsampled interferometric data to a 32node 64gpu cluster for realtime imaging and transient detection by detecting transients in situ we can trigger the recording of data for those rare brief instants when the event occurs and reduce the recorded data volume by a factor of 1000 this makes it possible to commensally search a data stream that would otherwise be impossible to record this system will search for millisecond transients in more than 1000 hours of data per year potentially localizing several fast radio bursts pulsars and other sources of impulsive radio emission we describe the science scope for realfast the system design expected outcomes and ways realtime analysis can help in other fields of astrophysics | [['radio', 'interferometers', 'have', 'the', 'ability', 'to', 'precisely', 'localize', 'and', 'better', 'characterize', 'the', 'properties', 'of', 'sources', 'this', 'ability', 'is', 'having', 'a', 'powerful', 'impact', 'on', 'the', 'study', 'of', 'fast', 'radio', 'transients', 'where', 'a', 'few', 'milliseconds', 'of', 'data', 'is', 'enough', 'to', 'pinpoint', 'a', 'source', 'at', 'cosmological', 'distances', 'however', 'recording', 'interferometric', 'data', 'at', 'millisecond', 'cadence', 'produces', 'a', 'terabyteperhour', 'data', 'stream', 'that', 'strains', 'networks', 'computing', 'systems', 'and', 'archives', 'this', 'challenge', 'mirrors', 'that', 'of', 'other', 'domains', 'of', 'science', 'where', 'the', 'science', 'scope', 'is', 'limited', 'by', 'the', 'computational', 'architecture', 'as', 'much', 'as', 'the', 'physical', 'processes', 'at', 'play', 'here', 'we', 'present', 'a', 'solution', 'to', 'this', 'problem', 'in', 'the', 'context', 'of', 'radio', 'transients', 'realfast', 'a', 'commensal', 'fast', 'transient', 'search', 'system', 'at', 'the', 'jansky', 'very', 'large', 'array', 'realfast', 'uses', 'a', 'novel', 'architecture', 'to', 'distribute', 'fastsampled', 'interferometric', 'data', 'to', 'a', '32node', '64gpu', 'cluster', 'for', 'realtime', 'imaging', 'and', 'transient', 'detection', 'by', 'detecting', 'transients', 'in', 'situ', 'we', 'can', 'trigger', 'the', 'recording', 'of', 'data', 'for', 'those', 'rare', 'brief', 'instants', 'when', 'the', 'event', 'occurs', 'and', 'reduce', 'the', 'recorded', 'data', 'volume', 'by', 'a', 'factor', 'of', '1000', 'this', 'makes', 'it', 'possible', 'to', 'commensally', 'search', 'a', 'data', 'stream', 'that', 'would', 'otherwise', 'be', 'impossible', 'to', 'record', 'this', 'system', 'will', 'search', 'for', 'millisecond', 'transients', 'in', 'more', 'than', '1000', 'hours', 'of', 'data', 'per', 'year', 'potentially', 'localizing', 'several', 'fast', 'radio', 'bursts', 'pulsars', 'and', 'other', 'sources', 'of', 'impulsive', 'radio', 'emission', 'we', 'describe', 'the', 'science', 'scope', 'for', 'realfast', 'the', 'system', 'design', 'expected', 'outcomes', 'and', 'ways', 'realtime', 'analysis', 'can', 'help', 'in', 'other', 'fields', 'of', 'astrophysics']] | [-0.12448166174097855, 0.11278117822396364, -0.047188862159816644, 0.09298722044923895, -0.14192579644416475, -0.11702323543949653, 0.07632606427710092, 0.39158406708058036, -0.2511262206490925, -0.3575042780366395, 0.15943348465953022, -0.2929638589385076, -0.09626438515951415, 0.2778568271127277, -0.0370457782784982, 0.012543376389164793, 0.1369464568856914, -0.028058391296249513, -0.017624329649044153, -0.20328472916755067, 0.22627342820031396, 0.13557703040838162, 0.2501098859514568, -0.0418894062365279, 0.09514113977133154, -0.04098271897311275, -0.057356073518117924, -0.028861673173920837, -0.05525960463048743, 0.08433802252570247, 0.3253963856772378, 0.20553512276166072, 0.2656040515324448, -0.44384903832480815, -0.21890711501019738, 0.1002639836347583, 0.12997732048763466, 0.08461509143844369, -0.053163496605567025, -0.2979184670326442, 0.08966738150269582, -0.17578601424771725, -0.14383543655868242, -0.04483838201405765, 0.07002699676845854, 0.043649727299067555, -0.22415164263200774, 0.051818651034717715, -0.016915174192251733, 0.033860459207494004, -0.04278417336567052, -0.018716350513987907, 0.09208201799863334, 0.12203894506795115, 0.0027662434761207234, 0.06122513732900527, 0.13103447218082245, -0.14950591804838534, -0.11898179981320844, 0.38162218856672614, -0.02394364860533565, -0.05685573572221891, 0.23287814064198015, -0.17811615480419832, -0.18542397902403876, 0.16550519331200522, 0.22865097707515322, 0.1151397590213692, -0.20268447792693486, -0.01771463863640408, 0.03994075123662666, 0.20236684625842055, 0.0429824180585348, 0.08559179405649232, 0.2606730478030424, 0.21406080021811016, 0.06678130834706728, 0.141011536717257, -0.21532497011910398, 0.0031772138453700373, -0.2374708631946074, -0.10440522648780844, -0.178050148439933, 0.05923869687596719, -0.04850838150815758, -0.11871510957144753, 0.40029830338977973, 0.1763801279742176, 0.14441708162263178, 0.04055798444028754, 0.33140777500535723, 0.029311253830309074, 0.11700534352132956, 0.07143189641647041, 0.23508113800840041, 0.0536731435331295, 0.17611117159032216, -0.16040081862987698, 0.06921661352951837, -0.04701929680028362] |
1,802.03085 | Griffiths phase and symmetry breaking in the hidden-order phase of
URu2Si2 | The heavy-fermion compound URu2Si2 exhibits a hidden-order phase below the
temperature, ~ 17.5 K. In spite of intense research for past three decades, no
consensus on the order parameter exists and the nature has posed a
long-standing mystery. Here we report the discovery of a Griffiths phase within
the hidden-order phase, characterized by residual short-range correlations on
the collapse of long-range orders due to the dilution effects. In the Griffiths
phase scenario, strong evidence are provided for those cluster-like spins, such
as the unique power-law behavior of magnetic susceptibility and specific heat
as well as the frequency dispersion of AC susceptibility. In this way, the
existence of an order parameter is excluded, and the hidden order has a
significant kinship with the long-range large-moment antiferromagnetism which
is accessible by tuning the hydrostatic pressure or the chemical pressure
(i.e., isoelectronic Fe doping). Moreover, an unidirectional anisotropy of
resistivity measurements in rotating magnetic fields is observed in the
hidden-order phase. The anisotropic magnetoresistance and the associated broken
symmetries directly reflect the freezing behavior of at least part of magnetic
clusters. Thus, the demonstrations of the Griffiths phase as an alternative
proposal for the hidden-order phase of URu2Si2 are very promising, challenging
the understanding of exotic electronic states in correlated matter and quantum
materials.
| cond-mat.str-el | the heavyfermion compound uru2si2 exhibits a hiddenorder phase below the temperature 175 k in spite of intense research for past three decades no consensus on the order parameter exists and the nature has posed a longstanding mystery here we report the discovery of a griffiths phase within the hiddenorder phase characterized by residual shortrange correlations on the collapse of longrange orders due to the dilution effects in the griffiths phase scenario strong evidence are provided for those clusterlike spins such as the unique powerlaw behavior of magnetic susceptibility and specific heat as well as the frequency dispersion of ac susceptibility in this way the existence of an order parameter is excluded and the hidden order has a significant kinship with the longrange largemoment antiferromagnetism which is accessible by tuning the hydrostatic pressure or the chemical pressure ie isoelectronic fe doping moreover an unidirectional anisotropy of resistivity measurements in rotating magnetic fields is observed in the hiddenorder phase the anisotropic magnetoresistance and the associated broken symmetries directly reflect the freezing behavior of at least part of magnetic clusters thus the demonstrations of the griffiths phase as an alternative proposal for the hiddenorder phase of uru2si2 are very promising challenging the understanding of exotic electronic states in correlated matter and quantum materials | [['the', 'heavyfermion', 'compound', 'uru2si2', 'exhibits', 'a', 'hiddenorder', 'phase', 'below', 'the', 'temperature', '175', 'k', 'in', 'spite', 'of', 'intense', 'research', 'for', 'past', 'three', 'decades', 'no', 'consensus', 'on', 'the', 'order', 'parameter', 'exists', 'and', 'the', 'nature', 'has', 'posed', 'a', 'longstanding', 'mystery', 'here', 'we', 'report', 'the', 'discovery', 'of', 'a', 'griffiths', 'phase', 'within', 'the', 'hiddenorder', 'phase', 'characterized', 'by', 'residual', 'shortrange', 'correlations', 'on', 'the', 'collapse', 'of', 'longrange', 'orders', 'due', 'to', 'the', 'dilution', 'effects', 'in', 'the', 'griffiths', 'phase', 'scenario', 'strong', 'evidence', 'are', 'provided', 'for', 'those', 'clusterlike', 'spins', 'such', 'as', 'the', 'unique', 'powerlaw', 'behavior', 'of', 'magnetic', 'susceptibility', 'and', 'specific', 'heat', 'as', 'well', 'as', 'the', 'frequency', 'dispersion', 'of', 'ac', 'susceptibility', 'in', 'this', 'way', 'the', 'existence', 'of', 'an', 'order', 'parameter', 'is', 'excluded', 'and', 'the', 'hidden', 'order', 'has', 'a', 'significant', 'kinship', 'with', 'the', 'longrange', 'largemoment', 'antiferromagnetism', 'which', 'is', 'accessible', 'by', 'tuning', 'the', 'hydrostatic', 'pressure', 'or', 'the', 'chemical', 'pressure', 'ie', 'isoelectronic', 'fe', 'doping', 'moreover', 'an', 'unidirectional', 'anisotropy', 'of', 'resistivity', 'measurements', 'in', 'rotating', 'magnetic', 'fields', 'is', 'observed', 'in', 'the', 'hiddenorder', 'phase', 'the', 'anisotropic', 'magnetoresistance', 'and', 'the', 'associated', 'broken', 'symmetries', 'directly', 'reflect', 'the', 'freezing', 'behavior', 'of', 'at', 'least', 'part', 'of', 'magnetic', 'clusters', 'thus', 'the', 'demonstrations', 'of', 'the', 'griffiths', 'phase', 'as', 'an', 'alternative', 'proposal', 'for', 'the', 'hiddenorder', 'phase', 'of', 'uru2si2', 'are', 'very', 'promising', 'challenging', 'the', 'understanding', 'of', 'exotic', 'electronic', 'states', 'in', 'correlated', 'matter', 'and', 'quantum', 'materials']] | [-0.1999867537968038, 0.23780387684091692, -0.04289545325473661, 0.027386882912001705, -0.07587570064435048, -0.1103168132382312, 0.08808076215708362, 0.3440676693937608, -0.24727997534154428, -0.3073432858057675, 0.05480397636420094, -0.3260122285601461, -0.12340182086696759, 0.13864830124435856, 0.061913150104893636, 0.02900682195045409, -0.07882058000901625, 0.020486593006977014, -0.11322441955673553, -0.20887527284988514, 0.3090505052412655, 0.030540871331357352, 0.2962569520453967, 0.08171153978355938, 0.04914180615728366, -0.04013714875835008, 0.09515927540847943, 0.02448146282251747, -0.1202006450987288, -0.014200635014345781, 0.25020569717356317, -0.05250671860495848, 0.22411473963764453, -0.3792224727526662, -0.25082987936385465, 0.07672545264608094, 0.1176876216877385, 0.10920572332938068, -0.10577424469548055, -0.31517949810118545, 0.02026277272019624, -0.13058678847848482, -0.15408796021892202, -0.1355215256656742, 0.001501594947296239, -0.03600439986136431, -0.22493074930583437, 0.17116808073728212, 0.10361757065679524, 0.12477348771256705, -0.09439874080209328, -0.10636200325375068, -0.034005478901478155, 0.06604524994645977, 0.08259751211264216, 0.0735373658660267, 0.10088012957768071, -0.15618520194354157, -0.11642103847781463, 0.3749496145040861, -0.029403211872115555, -0.018913022193287145, 0.17912624265688162, -0.193450162872406, -0.1161908418206232, 0.16741474817418273, 0.10484277246342529, 0.08735640731063626, -0.12595010496886624, 0.061286505187274, 0.006799481548590674, 0.19736987691195237, 0.014159216685774958, 0.07197616195605536, 0.2710290426077942, 0.20520130961778618, 0.024310900479377735, 0.13583899806918842, -0.10754838758078958, -0.09489463637028599, -0.24760233817533367, -0.1662921230330886, -0.21329176833276592, 0.03865252560714171, -0.08692159397892066, -0.19926091931605092, 0.3927439513549741, 0.14308328428090872, 0.19255314997973896, -0.09952955621882298, 0.23530849569333007, 0.0852320120486963, 0.0563090726018085, 0.04647217758354687, 0.27478370270580943, 0.1789434038396437, 0.1518144698126153, -0.28687737484551257, 0.14991192729544958, -0.005686378000038011] |
1,802.03086 | Automatic segmenting teeth in X-ray images: Trends, a novel data set,
benchmarking and future perspectives | This review presents an in-depth study of the literature on segmentation
methods applied in dental imaging. Ten segmentation methods were studied and
categorized according to the type of the segmentation method (region-based,
threshold-based, cluster-based, boundary-based or watershed-based), type of
X-ray images used (intra-oral or extra-oral) and characteristics of the dataset
used to evaluate the methods in the state-of-the-art works. We found that the
literature has primarily focused on threshold-based segmentation methods (54%).
80% of the reviewed papers have used intra-oral X-ray images in their
experiments, demonstrating preference to perform segmentation on images of
already isolated parts of the teeth, rather than using extra-oral X-rays, which
show tooth structure of the mouth and bones of the face. To fill a scientific
gap in the field, a novel data set based on extra-oral X-ray images are
proposed here. A statistical comparison of the results found with the 10 image
segmentation methods over our proposed data set comprised of 1,500 images is
also carried out, providing a more comprehensive source of performance
assessment. Discussion on limitations of the methods conceived over the past
year as well as future perspectives on exploiting learning-based segmentation
methods to improve performance are also provided.
| cs.CV | this review presents an indepth study of the literature on segmentation methods applied in dental imaging ten segmentation methods were studied and categorized according to the type of the segmentation method regionbased thresholdbased clusterbased boundarybased or watershedbased type of xray images used intraoral or extraoral and characteristics of the dataset used to evaluate the methods in the stateoftheart works we found that the literature has primarily focused on thresholdbased segmentation methods 54 80 of the reviewed papers have used intraoral xray images in their experiments demonstrating preference to perform segmentation on images of already isolated parts of the teeth rather than using extraoral xrays which show tooth structure of the mouth and bones of the face to fill a scientific gap in the field a novel data set based on extraoral xray images are proposed here a statistical comparison of the results found with the 10 image segmentation methods over our proposed data set comprised of 1500 images is also carried out providing a more comprehensive source of performance assessment discussion on limitations of the methods conceived over the past year as well as future perspectives on exploiting learningbased segmentation methods to improve performance are also provided | [['this', 'review', 'presents', 'an', 'indepth', 'study', 'of', 'the', 'literature', 'on', 'segmentation', 'methods', 'applied', 'in', 'dental', 'imaging', 'ten', 'segmentation', 'methods', 'were', 'studied', 'and', 'categorized', 'according', 'to', 'the', 'type', 'of', 'the', 'segmentation', 'method', 'regionbased', 'thresholdbased', 'clusterbased', 'boundarybased', 'or', 'watershedbased', 'type', 'of', 'xray', 'images', 'used', 'intraoral', 'or', 'extraoral', 'and', 'characteristics', 'of', 'the', 'dataset', 'used', 'to', 'evaluate', 'the', 'methods', 'in', 'the', 'stateoftheart', 'works', 'we', 'found', 'that', 'the', 'literature', 'has', 'primarily', 'focused', 'on', 'thresholdbased', 'segmentation', 'methods', '54', '80', 'of', 'the', 'reviewed', 'papers', 'have', 'used', 'intraoral', 'xray', 'images', 'in', 'their', 'experiments', 'demonstrating', 'preference', 'to', 'perform', 'segmentation', 'on', 'images', 'of', 'already', 'isolated', 'parts', 'of', 'the', 'teeth', 'rather', 'than', 'using', 'extraoral', 'xrays', 'which', 'show', 'tooth', 'structure', 'of', 'the', 'mouth', 'and', 'bones', 'of', 'the', 'face', 'to', 'fill', 'a', 'scientific', 'gap', 'in', 'the', 'field', 'a', 'novel', 'data', 'set', 'based', 'on', 'extraoral', 'xray', 'images', 'are', 'proposed', 'here', 'a', 'statistical', 'comparison', 'of', 'the', 'results', 'found', 'with', 'the', '10', 'image', 'segmentation', 'methods', 'over', 'our', 'proposed', 'data', 'set', 'comprised', 'of', '1500', 'images', 'is', 'also', 'carried', 'out', 'providing', 'a', 'more', 'comprehensive', 'source', 'of', 'performance', 'assessment', 'discussion', 'on', 'limitations', 'of', 'the', 'methods', 'conceived', 'over', 'the', 'past', 'year', 'as', 'well', 'as', 'future', 'perspectives', 'on', 'exploiting', 'learningbased', 'segmentation', 'methods', 'to', 'improve', 'performance', 'are', 'also', 'provided']] | [-0.0085270892359496, -0.058383644639965274, -0.06360900741741818, 0.059118021468674474, -0.07809895648843217, -0.09232432125750835, 0.03242490918648566, 0.44520475051654174, -0.18114783206607715, -0.35321314479011645, 0.12742418627996888, -0.311876179718975, -0.1142732965202085, 0.26264002965290456, -0.10621291610795229, 0.05869454510987448, 0.11856347147072784, 0.039061098088874355, -0.06835902066130739, -0.2864175840330589, 0.2808136366352647, 0.06423556708274551, 0.3583524124153185, 0.032188302964955416, 0.09254678905005496, -0.041499097167625364, -0.11404422226451753, 0.03281377544616991, -0.12307369262326495, 0.15480945412445396, 0.2851873437914203, 0.16466805360055864, 0.3005614444450357, -0.41220374676803134, -0.22936367239037217, 0.024005873895812838, 0.16062883527117408, 0.026686467891582643, -0.06254704760868861, -0.33889208831422524, 0.08036311069972633, -0.1408669120811758, -0.013261055044338183, -0.07834861578353619, -0.027267293764637584, 0.00017004097569001093, -0.20839737416841894, 0.05927055916243096, 0.02599842472741768, 0.12232444549764171, -0.1066278790189946, -0.15908958642214044, 0.03992512150369774, 0.14858282889300947, 0.034087551006016695, 0.046364227853488496, 0.15470221626387937, -0.16025087959808976, -0.1695269420577525, 0.3714365556807763, -0.027669465298504985, -0.16240742114469467, 0.21636095908966843, -0.06771017897042073, -0.12794931370263854, 0.13590748813582423, 0.1781155638816899, 0.15432015189494427, -0.1597643991991958, -0.03197639443418768, -0.02316050573256869, 0.18735000614057942, 0.07352470447602422, -0.02095302756585306, 0.17141689081217734, 0.25402377613141736, -0.018656495993727637, 0.1475383759621616, -0.21079795187998676, -0.011260228719075357, -0.19061112774086603, -0.09351323244869851, -0.16175849283549007, -0.027018785125665783, -0.024276480439540383, -0.15882159000366625, 0.42391495629530496, 0.21184625322835965, 0.17514090578492522, 0.013330198612257952, 0.3486152643025829, -0.010659813987732945, 0.11385517523548362, 0.02420826978522925, 0.23269480442968646, 0.041402847393827165, 0.12447072639186786, -0.1492300354899262, 0.0587291390786354, 0.04999412038554981] |
1,802.03087 | A Note on Intervals in the Hales-Jewett Theorem | The Hales-Jewett theorem for alphabet of size 3 states that whenever the
Hales-Jewett cube [3]^n is r-coloured there is a monochromatic line (for n
large). Conlon and Kamcev conjectured that, for any n, there is a 2-colouring
of [3]^n for which there is no monochromatic line whose active coordinate set
is an interval. In this note we disprove this conjecture.
| math.CO | the halesjewett theorem for alphabet of size 3 states that whenever the halesjewett cube 3n is rcoloured there is a monochromatic line for n large conlon and kamcev conjectured that for any n there is a 2colouring of 3n for which there is no monochromatic line whose active coordinate set is an interval in this note we disprove this conjecture | [['the', 'halesjewett', 'theorem', 'for', 'alphabet', 'of', 'size', '3', 'states', 'that', 'whenever', 'the', 'halesjewett', 'cube', '3n', 'is', 'rcoloured', 'there', 'is', 'a', 'monochromatic', 'line', 'for', 'n', 'large', 'conlon', 'and', 'kamcev', 'conjectured', 'that', 'for', 'any', 'n', 'there', 'is', 'a', '2colouring', 'of', '3n', 'for', 'which', 'there', 'is', 'no', 'monochromatic', 'line', 'whose', 'active', 'coordinate', 'set', 'is', 'an', 'interval', 'in', 'this', 'note', 'we', 'disprove', 'this', 'conjecture']] | [-0.18446255677332313, 0.1784739439334756, -0.050598577043767703, 0.05692180034396696, -0.009081279353822693, -0.16690972003833218, 0.03443686571958775, 0.36426060697284796, -0.18857132046783376, -0.24288859284656533, 0.06359384878305718, -0.3159661283834948, -0.10114211507804566, 0.1547776194865484, -0.05527053094642647, -0.029596849392026156, 0.04892195289228427, 0.06649797738498171, 0.04922664038426543, -0.28691675334032307, 0.30925712098714786, -0.0631622719396916, 0.1295946469625174, 0.12737216882533947, 0.09551849250950045, 0.06454912475428655, 0.010483629717412641, 0.017483522973449555, -0.13822039047190013, 0.08055835977587375, 0.2880547326689554, 0.205476450433923, 0.25264438115439175, -0.33939503344817684, -0.14423354406114983, 0.25524437058148747, 0.14083401509955273, 0.11057499007487638, -0.03390844167857352, -0.16786610472836863, 0.17479616416207813, -0.11249401903379772, -0.1882812299576225, 0.05601957399334948, 0.24321572332627187, -0.03192519589122069, -0.3073484430452651, -0.03874840723129652, 0.18848657079230427, 0.09477539693589433, 0.04977069816638921, -0.14811343077759623, 0.01747060709601363, 0.06986853159900944, -0.013073418072377474, 0.1350226044039226, -0.020610606597768047, -0.05073296002820687, -0.10875059135447619, 0.34718985101050237, -0.004643719090874922, -0.18391913993252537, 0.12009124160286481, -0.09574206880593704, -0.21424956060945988, 0.1913965488389387, 0.013720048409965584, 0.12458215799119512, -0.020664728309769752, 0.17968695041609106, -0.2527145763259318, 0.26549231620915864, 0.17935850711192114, -0.0008956344967897414, 0.09493258892227027, 0.07901372372220128, 0.1646258230163258, 0.11206564250386368, -0.03468075257299815, 0.009139114264714516, -0.39043662796523104, -0.14659192537794175, -0.27150898450448857, 0.13335413651509306, -0.1298894096652768, -0.21590094256483144, 0.2700766264224204, 0.07954259935798029, 0.15521108464858793, 0.1102953983364248, 0.21360573573511535, 0.10543110351679033, 0.039059645669945214, 0.1304651200692406, 0.1440948589973278, 0.1386858060545588, -0.03187895073729046, -0.14467185292929663, 0.018080999380198574, 0.13923999256754327] |
1,802.03088 | Brane SUSY Breaking and the Gravitino Mass | Supergravity models with spontaneously broken supersymmetry have been widely
investigated over the years, together with some notable non-linear limits.
Although in these models the gravitino becomes naturally massive absorbing the
degrees of freedom of a Nambu-Goldstone fermion, there are cases in which the
naive counting of degrees of freedom does not apply, in particular because of
the absence of explicit gravitino mass terms in unitary gauge. The
corresponding models require non-trivial de Sitter-like backgrounds, and it
becomes of interest to clarify the fate of their Nambu-Goldstone modes. We
elaborate on the fact that these non-trivial backgrounds can accommodate,
consistently, gravitino fields carrying a number of degrees of freedom that is
intermediate between those of massless and massive fields in a flat spacetime.
For instance, in a simple supergravity model of this type with de Sitter
background, the overall degrees of freedom of gravitino are as many as for a
massive spin-3/2 field in flat spacetime, while the gravitino remains massless
in the sense that it undergoes null-cone propagation in the stereographic
picture. On the other hand, in the ten-dimensional USp(32) Type I Sugimoto
model with "brane SUSY breaking", which requires a more complicated background,
the degrees of freedom of gravitino are half as many of those of a massive one,
and yet it somehow behaves again as a massless one.
| hep-th | supergravity models with spontaneously broken supersymmetry have been widely investigated over the years together with some notable nonlinear limits although in these models the gravitino becomes naturally massive absorbing the degrees of freedom of a nambugoldstone fermion there are cases in which the naive counting of degrees of freedom does not apply in particular because of the absence of explicit gravitino mass terms in unitary gauge the corresponding models require nontrivial de sitterlike backgrounds and it becomes of interest to clarify the fate of their nambugoldstone modes we elaborate on the fact that these nontrivial backgrounds can accommodate consistently gravitino fields carrying a number of degrees of freedom that is intermediate between those of massless and massive fields in a flat spacetime for instance in a simple supergravity model of this type with de sitter background the overall degrees of freedom of gravitino are as many as for a massive spin32 field in flat spacetime while the gravitino remains massless in the sense that it undergoes nullcone propagation in the stereographic picture on the other hand in the tendimensional usp32 type i sugimoto model with brane susy breaking which requires a more complicated background the degrees of freedom of gravitino are half as many of those of a massive one and yet it somehow behaves again as a massless one | [['supergravity', 'models', 'with', 'spontaneously', 'broken', 'supersymmetry', 'have', 'been', 'widely', 'investigated', 'over', 'the', 'years', 'together', 'with', 'some', 'notable', 'nonlinear', 'limits', 'although', 'in', 'these', 'models', 'the', 'gravitino', 'becomes', 'naturally', 'massive', 'absorbing', 'the', 'degrees', 'of', 'freedom', 'of', 'a', 'nambugoldstone', 'fermion', 'there', 'are', 'cases', 'in', 'which', 'the', 'naive', 'counting', 'of', 'degrees', 'of', 'freedom', 'does', 'not', 'apply', 'in', 'particular', 'because', 'of', 'the', 'absence', 'of', 'explicit', 'gravitino', 'mass', 'terms', 'in', 'unitary', 'gauge', 'the', 'corresponding', 'models', 'require', 'nontrivial', 'de', 'sitterlike', 'backgrounds', 'and', 'it', 'becomes', 'of', 'interest', 'to', 'clarify', 'the', 'fate', 'of', 'their', 'nambugoldstone', 'modes', 'we', 'elaborate', 'on', 'the', 'fact', 'that', 'these', 'nontrivial', 'backgrounds', 'can', 'accommodate', 'consistently', 'gravitino', 'fields', 'carrying', 'a', 'number', 'of', 'degrees', 'of', 'freedom', 'that', 'is', 'intermediate', 'between', 'those', 'of', 'massless', 'and', 'massive', 'fields', 'in', 'a', 'flat', 'spacetime', 'for', 'instance', 'in', 'a', 'simple', 'supergravity', 'model', 'of', 'this', 'type', 'with', 'de', 'sitter', 'background', 'the', 'overall', 'degrees', 'of', 'freedom', 'of', 'gravitino', 'are', 'as', 'many', 'as', 'for', 'a', 'massive', 'spin32', 'field', 'in', 'flat', 'spacetime', 'while', 'the', 'gravitino', 'remains', 'massless', 'in', 'the', 'sense', 'that', 'it', 'undergoes', 'nullcone', 'propagation', 'in', 'the', 'stereographic', 'picture', 'on', 'the', 'other', 'hand', 'in', 'the', 'tendimensional', 'usp32', 'type', 'i', 'sugimoto', 'model', 'with', 'brane', 'susy', 'breaking', 'which', 'requires', 'a', 'more', 'complicated', 'background', 'the', 'degrees', 'of', 'freedom', 'of', 'gravitino', 'are', 'half', 'as', 'many', 'of', 'those', 'of', 'a', 'massive', 'one', 'and', 'yet', 'it', 'somehow', 'behaves', 'again', 'as', 'a', 'massless', 'one']] | [-0.1596596310343805, 0.2304015297839545, -0.05073510623240674, 0.09180105937835337, -0.10517883235377005, -0.1491818927186118, -0.024160856820261953, 0.30700500178553, -0.15981279782188887, -0.31106408065375446, 0.09207945417517542, -0.2596881557128985, -0.11824653893709183, 0.12195631763686172, -0.05390468853610483, -0.012496077972040935, 0.008514487296766179, 0.0864415117867545, -0.060211894982124, -0.2827985640064898, 0.3232234840662303, 0.015509989070282741, 0.2383751430464062, -0.00684563953651708, 0.10773046064158817, 0.01118503744454012, 0.01807675243313001, -0.0138176975570125, -0.06113990549873217, 0.08115839430935343, 0.22290316778458377, 0.09802186834858731, 0.16766385465691036, -0.399453332063488, -0.2705001004421237, 0.1327411300026473, 0.2151538499990817, 0.1718465349472932, -0.03887117564055106, -0.265044047108809, 0.04274096914397722, -0.15880183071871712, -0.1862822309078183, -0.06776090533821844, -0.0063476281771727375, -0.10982298782883762, -0.21245328609154307, 0.13311428004896947, 0.0398698785987852, 0.018372698856348343, -0.019037394509227437, -0.10344687323085963, -0.1108690041657114, 0.04038962086620317, 0.17542938158466395, -0.0008582935308698904, 0.09681391388347203, -0.22975774595662105, -0.11293324590501884, 0.41561750038103623, -0.0478206238201396, -0.2325791619633409, 0.2115255761119029, -0.12433766558123435, -0.17474330517632716, 0.14987885884686628, 0.12526274530947293, 0.1554658202517947, -0.1253608686658977, 0.20055322147699453, -0.029395980199544945, 0.14960635316727514, 0.09941459155969906, 0.1074526015351611, 0.2939285831197842, 0.12302997762929987, 0.04357922873618505, 0.0991456228543856, 0.010410232746719636, -0.13770791704512456, -0.373211052514274, -0.1509435588430444, -0.10727781318551437, 0.08742011116337381, -0.12554477352248133, -0.1797781974839216, 0.38020369804051535, 0.11450833677451804, 0.1835728995999406, 0.012185591119553217, 0.2375857203881341, 0.06777266900859434, 0.1006629845159213, 0.060984244652155954, 0.28293777008353077, 0.13182067826908844, 0.07736216670336117, -0.20781515769829803, -0.10174536132677035, 0.049503104426813396] |
1,802.03089 | The geometry of generalized loxodromic elements | We explore geometric conditions which ensure a given element of a finitely
generated group is, or fails to be, generalized loxodromic; as part of this we
prove a generalization of Sisto's result that every generalized loxodromic
element is Morse. We provide a sufficient geometric condition for an element of
a small cancellation group to be generalized loxodromic in terms of the
defining relations and provide a number of constructions which prove that this
condition is sharp.
| math.GR | we explore geometric conditions which ensure a given element of a finitely generated group is or fails to be generalized loxodromic as part of this we prove a generalization of sistos result that every generalized loxodromic element is morse we provide a sufficient geometric condition for an element of a small cancellation group to be generalized loxodromic in terms of the defining relations and provide a number of constructions which prove that this condition is sharp | [['we', 'explore', 'geometric', 'conditions', 'which', 'ensure', 'a', 'given', 'element', 'of', 'a', 'finitely', 'generated', 'group', 'is', 'or', 'fails', 'to', 'be', 'generalized', 'loxodromic', 'as', 'part', 'of', 'this', 'we', 'prove', 'a', 'generalization', 'of', 'sistos', 'result', 'that', 'every', 'generalized', 'loxodromic', 'element', 'is', 'morse', 'we', 'provide', 'a', 'sufficient', 'geometric', 'condition', 'for', 'an', 'element', 'of', 'a', 'small', 'cancellation', 'group', 'to', 'be', 'generalized', 'loxodromic', 'in', 'terms', 'of', 'the', 'defining', 'relations', 'and', 'provide', 'a', 'number', 'of', 'constructions', 'which', 'prove', 'that', 'this', 'condition', 'is', 'sharp']] | [-0.16957395432206493, 0.10904280648430964, -0.15445852984984715, 0.06750913933695604, -0.10872181425181528, -0.122535208525757, 0.001288087780897816, 0.32222317323088645, -0.31701204866170885, -0.2127035171041886, 0.12601960307452828, -0.19187475754568975, -0.1835198052506894, 0.1897777160226057, -0.17204184222966432, -0.0378992331897219, 0.08266129147261381, 0.09698479088100916, -0.08014100187147657, -0.22765664704144, 0.342441996075213, -0.04420970568899065, 0.2052841403397421, 0.1023412520531565, 0.13198656377072135, -0.026597285959869623, -0.01347618361003697, 0.04229344978928566, -0.15415598996701496, 0.11267666394511859, 0.25272117796043553, 0.10148624690249562, 0.26836344997088113, -0.37578582498361357, -0.19004936264206965, 0.2086317658983171, 0.08999223773988585, 0.07143542480655014, -0.0876351053143541, -0.2370389432211717, 0.19169871193667254, -0.17522878660509983, -0.20156592364112536, -0.06716021684308847, 0.018974093645811083, 0.018213151370485625, -0.35888386234641073, -0.003382629851500193, 0.13432967600723109, 0.10357619337213692, -0.013048648300270239, -0.03694046625557045, 0.00450730711221695, 0.11294791926629841, -0.021471267190451424, -0.00967983264941722, 0.04194320284994319, -0.033674561126778524, -0.06364311389625073, 0.43436084690193333, -0.049926510440806544, -0.28740187528232736, 0.12482925308247407, -0.0960129593933622, -0.16646761039892832, 0.09395787061502536, 0.10542649469027916, 0.1449269590511297, -0.11525491447498401, 0.11064152800710872, -0.14590327988068263, 0.12740169207255045, 0.09081234730780124, 0.025737746483646334, 0.11196155601491531, 0.09325486932570735, 0.14646146668121218, 0.16353546707890929, 0.037473474858949585, 0.01755833697815736, -0.41891415576140084, -0.2319955758502086, -0.17787351697683335, 0.07912803084899982, -0.10398201782236963, -0.24857171684503554, 0.3800387662152449, 0.07799215551465749, 0.1830635612209638, 0.0866014632799973, 0.229544772359853, 0.1448293023998849, 0.04586196444928646, 0.05832597281783819, 0.14094534993171692, 0.1915329048410058, -0.054802146709892745, -0.1446720174777632, 0.028794748000800608, 0.23269009655341505] |
1,802.0309 | Formation of Super-Earths | Super-Earths are the most abundant planets known to date and are
characterized by having sizes between that of Earth and Neptune, typical
orbital periods of less than 100 days and gaseous envelopes that are often
massive enough to significantly contribute to the planet's overall radius.
Furthermore, super-Earths regularly appear in tightly-packed multiple-planet
systems, but resonant configurations in such systems are rare. This chapters
summarizes current super-Earth formation theories. It starts from the formation
of rocky cores and subsequent accretion of gaseous envelopes. We follow the
thermal evolution of newly formed super-Earths and discuss their atmospheric
mass loss due to disk dispersal, photoevaporation, core-cooling and collisions.
We conclude with a comparison of observations and theoretical predictions,
highlighting that even super-Earths that appear as barren rocky cores today
likely formed with primordial hydrogen and helium envelopes and discuss some
paths forward for the future.
| astro-ph.EP | superearths are the most abundant planets known to date and are characterized by having sizes between that of earth and neptune typical orbital periods of less than 100 days and gaseous envelopes that are often massive enough to significantly contribute to the planets overall radius furthermore superearths regularly appear in tightlypacked multipleplanet systems but resonant configurations in such systems are rare this chapters summarizes current superearth formation theories it starts from the formation of rocky cores and subsequent accretion of gaseous envelopes we follow the thermal evolution of newly formed superearths and discuss their atmospheric mass loss due to disk dispersal photoevaporation corecooling and collisions we conclude with a comparison of observations and theoretical predictions highlighting that even superearths that appear as barren rocky cores today likely formed with primordial hydrogen and helium envelopes and discuss some paths forward for the future | [['superearths', 'are', 'the', 'most', 'abundant', 'planets', 'known', 'to', 'date', 'and', 'are', 'characterized', 'by', 'having', 'sizes', 'between', 'that', 'of', 'earth', 'and', 'neptune', 'typical', 'orbital', 'periods', 'of', 'less', 'than', '100', 'days', 'and', 'gaseous', 'envelopes', 'that', 'are', 'often', 'massive', 'enough', 'to', 'significantly', 'contribute', 'to', 'the', 'planets', 'overall', 'radius', 'furthermore', 'superearths', 'regularly', 'appear', 'in', 'tightlypacked', 'multipleplanet', 'systems', 'but', 'resonant', 'configurations', 'in', 'such', 'systems', 'are', 'rare', 'this', 'chapters', 'summarizes', 'current', 'superearth', 'formation', 'theories', 'it', 'starts', 'from', 'the', 'formation', 'of', 'rocky', 'cores', 'and', 'subsequent', 'accretion', 'of', 'gaseous', 'envelopes', 'we', 'follow', 'the', 'thermal', 'evolution', 'of', 'newly', 'formed', 'superearths', 'and', 'discuss', 'their', 'atmospheric', 'mass', 'loss', 'due', 'to', 'disk', 'dispersal', 'photoevaporation', 'corecooling', 'and', 'collisions', 'we', 'conclude', 'with', 'a', 'comparison', 'of', 'observations', 'and', 'theoretical', 'predictions', 'highlighting', 'that', 'even', 'superearths', 'that', 'appear', 'as', 'barren', 'rocky', 'cores', 'today', 'likely', 'formed', 'with', 'primordial', 'hydrogen', 'and', 'helium', 'envelopes', 'and', 'discuss', 'some', 'paths', 'forward', 'for', 'the', 'future']] | [-0.12198689710643983, 0.22828049082833696, -0.018743097262365192, 0.10805788693513432, -0.07075928756803222, -0.05548571540423158, 0.04418555034068741, 0.3700110746259001, -0.16561129257086218, -0.33884983340894775, 0.10823532591842797, -0.2941051012335073, -0.09881617891615335, 0.17440653306392717, -0.06389984107104091, 0.018967645633867353, 0.16916450258659224, -0.09162548301793949, -0.03260254166925221, -0.28901241816298273, 0.3162156224831743, 0.06948744327577591, 0.0038085136247772568, 0.002322134138806395, -0.04710434963533156, -0.14864668942304185, -0.037256510251096754, -0.0885991990225206, -0.1909143959416378, 0.06556045043164975, 0.24748373154426176, 0.12780180321612827, 0.1987195783442306, -0.48074669548323457, -0.22726929099376897, 0.04680693213759043, 0.17403853606805902, 0.03937008406009368, -0.051804420994070004, -0.22203173084204203, 0.10106890404746133, -0.23280667955003365, -0.17268893478969505, 0.0036997312948789814, 0.11389127011332188, 0.027791790441203286, -0.22190470616562738, 0.09570249276314403, 0.09098639678288724, 0.08159819419141597, -0.12227343949882812, -0.18922278156231853, -0.09460017115244983, 0.03807740175152119, 0.051572902664266736, -0.048908063092491995, 0.2414705302225242, -0.0985221447854329, -0.016710600281186715, 0.4479179718362784, -0.06232824768433692, -0.007754240142391391, 0.3553529240807492, -0.24661219332196657, -0.11317883055775203, 0.15562365716979118, 0.17688035307188507, 0.13017641493893214, -0.14141559902526124, -0.060633730360152675, 0.009282913381187901, 0.1694603564929296, 0.14531963925913605, 0.09112902909425467, 0.4343995777234225, 0.17315336132527026, 0.035042380212320826, 0.036019023119235855, -0.13944549659516295, -0.12028621022202547, -0.1438599401120831, -0.13873634727107703, -0.10966409200107233, 0.025993560824517002, -0.05368563894280413, -0.12893900186525212, 0.2794870821247533, 0.1453903875785919, 0.19848406672417054, 0.04069581765248637, 0.2801233999509837, 0.04228080936271409, 0.1155671170686411, 0.13785935601409735, 0.30744389931013, 0.15890594151585927, 0.10890002310863027, -0.22572020841860801, 0.11008101481941043, -0.0679232481027573] |
1,802.03091 | An experimental survey of the production of alpha decaying heavy
elements in the reactions of $^{238}$U +$^{232}$Th at 7.5-6.1 MeV/nucleon | The production of alpha particle decaying heavy nuclei in reactions of
7.5-6.1 MeV/nucleon $^{238}$U +$^{232}$Th has been explored using an in-beam
detection array composed of YAP scintillators and gas ionization chamber-Si
telescopes. Comparisons of alpha energies and half-lives for the observed
products with those of the previously known isotopes and with theoretically
predicted values indicate the observation of a number of previously unreported
alpha emitters. Alpha particle decay energies reaching as high as 12 MeV are
observed. Many of these are expected to be from decay of previously unseen
relatively neutron rich products. While the contributions of isomeric states
require further exploration and specific isotope identifications need to be
made, the production of heavy isotopes with quite high atomic numbers is
suggested by the data.
| nucl-ex | the production of alpha particle decaying heavy nuclei in reactions of 7561 mevnucleon 238u 232th has been explored using an inbeam detection array composed of yap scintillators and gas ionization chambersi telescopes comparisons of alpha energies and halflives for the observed products with those of the previously known isotopes and with theoretically predicted values indicate the observation of a number of previously unreported alpha emitters alpha particle decay energies reaching as high as 12 mev are observed many of these are expected to be from decay of previously unseen relatively neutron rich products while the contributions of isomeric states require further exploration and specific isotope identifications need to be made the production of heavy isotopes with quite high atomic numbers is suggested by the data | [['the', 'production', 'of', 'alpha', 'particle', 'decaying', 'heavy', 'nuclei', 'in', 'reactions', 'of', '7561', 'mevnucleon', '238u', '232th', 'has', 'been', 'explored', 'using', 'an', 'inbeam', 'detection', 'array', 'composed', 'of', 'yap', 'scintillators', 'and', 'gas', 'ionization', 'chambersi', 'telescopes', 'comparisons', 'of', 'alpha', 'energies', 'and', 'halflives', 'for', 'the', 'observed', 'products', 'with', 'those', 'of', 'the', 'previously', 'known', 'isotopes', 'and', 'with', 'theoretically', 'predicted', 'values', 'indicate', 'the', 'observation', 'of', 'a', 'number', 'of', 'previously', 'unreported', 'alpha', 'emitters', 'alpha', 'particle', 'decay', 'energies', 'reaching', 'as', 'high', 'as', '12', 'mev', 'are', 'observed', 'many', 'of', 'these', 'are', 'expected', 'to', 'be', 'from', 'decay', 'of', 'previously', 'unseen', 'relatively', 'neutron', 'rich', 'products', 'while', 'the', 'contributions', 'of', 'isomeric', 'states', 'require', 'further', 'exploration', 'and', 'specific', 'isotope', 'identifications', 'need', 'to', 'be', 'made', 'the', 'production', 'of', 'heavy', 'isotopes', 'with', 'quite', 'high', 'atomic', 'numbers', 'is', 'suggested', 'by', 'the', 'data']] | [-0.018370905213864384, 0.26148748380897235, -0.010845893471524483, 0.09299727833386874, 0.030104492098893744, -0.15648955653792596, 0.05881692502814216, 0.39111642476655845, -0.16756413610106924, -0.38919211624992817, 0.001840428913928326, -0.34580907415659207, 0.05289681057438133, 0.21786349332830832, 0.08836256967842336, 0.08107179630752671, 0.08214837263103544, 0.033649459110224635, -0.041493091482396535, -0.20204210436687145, 0.25321302671890283, 0.14709794715925203, 0.19066466319912334, 0.05386619946003202, 0.026041380698580627, -0.07415939696375431, -0.012469899485728181, -0.07150776592287712, -0.11620263485389391, 0.08536645726677469, 0.2725606952827969, 0.07200160584075574, 0.14253842531574692, -0.37939800117619155, -0.1833111774100642, 0.13185953408029172, 0.18288060418534569, 0.0826792694813746, -0.12185240530113621, -0.3335922524499578, 0.036844276106628646, -0.2223772602174734, -0.14506302815218403, -0.08081790927524973, 0.061950029167857745, 0.11477656230449722, -0.25272894961895737, 0.03238614226172761, -0.05578542153949175, 0.06441102800815086, -0.10308550594860075, -0.26158717301166884, -0.013703909562522076, 0.066665976285571, 0.13382733405597994, -0.015617017272662946, 0.17944024338167372, -0.10360262811759381, -0.12017643397174231, 0.3853469241516498, 0.0070779321098139855, -0.05481926624001121, 0.19095530995731885, -0.1945091796820279, -0.1746627943991585, 0.27322951329238354, 0.1142438136389464, 0.13668276754239142, -0.15003115550531604, 0.040957037100144394, 0.00905447156070088, 0.200067600095266, 0.1147141538378669, 0.08592208949621857, 0.16579175961574888, 0.2027219170174463, -0.04669781664918306, 0.07414093617978317, -0.1909503946080804, -0.027277784452326898, -0.2492183926666716, -0.1499852316242991, -0.11594947961282565, 0.0726457140749184, -0.016013018002760088, -0.12117749272052547, 0.3086989610266637, 0.019760999005269904, 0.19111306943582387, -0.02309204287575255, 0.23811802759054837, 0.06965269900790257, 0.09266599055168567, -0.006486788068375573, 0.33155991409988544, 0.17675836142639978, 0.06469400602059697, -0.20181653428466884, 0.1205374618530334, -0.018755635239062755] |
1,802.03092 | Embedding graphs in Euclidean space | The dimension of a graph $G$ is the smallest $d$ for which its vertices can
be embedded in $d$-dimensional Euclidean space in the sense that the distances
between endpoints of edges equal $1$ (but there may be other unit distances).
Answering a question of Erd\H{o}s and Simonovits [Ars Combin. 9 (1980)
229--246], we show that any graph with less than $\binom{d+2}{2}$ edges has
dimension at most $d$. Improving their result, we prove that that the dimension
of a graph with maximum degree $d$ is at most $d$. We show the following Ramsey
result: if each edge of the complete graph on $2d$ vertices is coloured red or
blue, then either the red graph or the blue graph can be embedded in Euclidean
$d$-space. We also derive analogous results for embeddings of graphs into the
$(d-1)$-dimensional sphere of radius $1/\sqrt{2}$.
| math.CO math.MG | the dimension of a graph g is the smallest d for which its vertices can be embedded in ddimensional euclidean space in the sense that the distances between endpoints of edges equal 1 but there may be other unit distances answering a question of erdhos and simonovits ars combin 9 1980 229246 we show that any graph with less than binomd22 edges has dimension at most d improving their result we prove that that the dimension of a graph with maximum degree d is at most d we show the following ramsey result if each edge of the complete graph on 2d vertices is coloured red or blue then either the red graph or the blue graph can be embedded in euclidean dspace we also derive analogous results for embeddings of graphs into the d1dimensional sphere of radius 1sqrt2 | [['the', 'dimension', 'of', 'a', 'graph', 'g', 'is', 'the', 'smallest', 'd', 'for', 'which', 'its', 'vertices', 'can', 'be', 'embedded', 'in', 'ddimensional', 'euclidean', 'space', 'in', 'the', 'sense', 'that', 'the', 'distances', 'between', 'endpoints', 'of', 'edges', 'equal', '1', 'but', 'there', 'may', 'be', 'other', 'unit', 'distances', 'answering', 'a', 'question', 'of', 'erdhos', 'and', 'simonovits', 'ars', 'combin', '9', '1980', '229246', 'we', 'show', 'that', 'any', 'graph', 'with', 'less', 'than', 'binomd22', 'edges', 'has', 'dimension', 'at', 'most', 'd', 'improving', 'their', 'result', 'we', 'prove', 'that', 'that', 'the', 'dimension', 'of', 'a', 'graph', 'with', 'maximum', 'degree', 'd', 'is', 'at', 'most', 'd', 'we', 'show', 'the', 'following', 'ramsey', 'result', 'if', 'each', 'edge', 'of', 'the', 'complete', 'graph', 'on', '2d', 'vertices', 'is', 'coloured', 'red', 'or', 'blue', 'then', 'either', 'the', 'red', 'graph', 'or', 'the', 'blue', 'graph', 'can', 'be', 'embedded', 'in', 'euclidean', 'dspace', 'we', 'also', 'derive', 'analogous', 'results', 'for', 'embeddings', 'of', 'graphs', 'into', 'the', 'd1dimensional', 'sphere', 'of', 'radius', '1sqrt2']] | [-0.12362892338904097, 0.1548484751859503, -0.06023688382557491, 0.014298799164749573, -0.07874455494996514, -0.15694860711584996, 0.039857411695929774, 0.39127825913325387, -0.22383901178428944, -0.2886519167830583, 0.08424066245831195, -0.3518762582450779, -0.15466860534596075, 0.11180685550980542, -0.12853282739163588, -0.03766924158005506, 0.1135222666563779, 0.11216913989615919, 0.025809157700923673, -0.30130140377798315, 0.30767442543317913, -0.07891208244433259, 0.1524475426328144, 0.07289661687961738, 0.029810551768100827, 0.02325841820336552, 0.008243660010859697, 0.10164479764809757, -0.17760511037122872, 0.10768187411102283, 0.22649349855517384, 0.156789239400821, 0.24380379209267725, -0.37754552133626096, -0.19404722635301141, 0.21541293881864143, 0.1541976102714488, 0.030622093070699515, 0.03858024111088963, -0.23274786996376448, 0.16695250518429672, -0.04328982301838577, -0.12490385851013834, 0.049812748708701046, 0.14746047081561744, -0.05097834041416917, -0.2535594928955292, 0.00500985820090269, 0.13771849334661435, 0.046052068920574916, 0.045028939296790554, -0.16635419960290085, -0.08773520485885496, 0.12575898635673616, -0.060468469044519926, 0.13120891303367857, 0.04449230969890299, -0.09107696854706554, -0.1703147393129562, 0.3647096584020794, -0.03333653535332316, -0.16461391937341133, 0.1716331334200001, -0.19887965997803386, -0.12931752670556307, 0.07435217354596205, 0.13732083124978753, 0.15132219125142823, -0.06674793655610214, 0.14139950000400567, -0.1088519049697916, 0.1448096670074402, 0.18114480411593062, 0.05586341635432829, 0.15563826576677442, 0.12121651654240478, 0.15894659669104502, 0.15468270572736845, -0.05854236853757642, -0.006390095882144941, -0.26217457606545547, -0.14755935406475498, -0.2688436504983663, 0.09827516728461495, -0.22341639537992633, -0.16655017277157871, 0.3645517567995202, 0.06960663382099078, 0.24433247673095385, 0.07871593391594144, 0.2405926010632602, 0.07713028248807374, 0.07167902032541575, 0.21306938595090905, 0.16199503753361474, 0.14116733393421138, -0.03806005621050233, -0.12176120788348417, 0.01874150826262623, 0.15045716164184966] |
1,802.03093 | Blow-up profiles for the parabolic-elliptic Keller-Segel system in
dimensions $n\ge 3$ | We study the blow-up asymptotics of radially decreasing solutions of the
parabolic-elliptic Keller-Segel-Patlak system in space dimensions $n\ge 3$. In
view of the biological background of this system and of its mass conservation
property, blowup is usually interpreted as a phenomenon of concentration or
aggregation of the bacterial population. Understanding the asymptotic behavior
of solutions at the blowup time is thus meaningful for the interpretation of
the model.
Under mild assumptions on the initial data, for $n\ge 3$, we show that the
final profile satisfies $C_1|x|^{-2}\le u(x,T)\le C_2|x|^{-2}$, with
convergence in $L^1$ as $t\to T$. This is in sharp contrast with the
two-dimensional case, where solutions are known to concentrate to a Dirac mass
at the origin (plus an integrable part). We also obtain refined space-time
estimates of the form $u(x,t)\le C(T-t+|x|^2)^{-1}$ for type~I blowup
solutions. Previous work had shown that radial, self-similar blowup solutions
(which satisfy the above estimates) exist in dimensions $n\ge 3$ and do not
exist in dimension $2$. Our results thus reveal that the final profile
displayed by these special solutions actually corresponds to a much more
general phenomenon.
| math.AP | we study the blowup asymptotics of radially decreasing solutions of the parabolicelliptic kellersegelpatlak system in space dimensions nge 3 in view of the biological background of this system and of its mass conservation property blowup is usually interpreted as a phenomenon of concentration or aggregation of the bacterial population understanding the asymptotic behavior of solutions at the blowup time is thus meaningful for the interpretation of the model under mild assumptions on the initial data for nge 3 we show that the final profile satisfies c_1x2le uxtle c_2x2 with convergence in l1 as tto t this is in sharp contrast with the twodimensional case where solutions are known to concentrate to a dirac mass at the origin plus an integrable part we also obtain refined spacetime estimates of the form uxtle cttx21 for typei blowup solutions previous work had shown that radial selfsimilar blowup solutions which satisfy the above estimates exist in dimensions nge 3 and do not exist in dimension 2 our results thus reveal that the final profile displayed by these special solutions actually corresponds to a much more general phenomenon | [['we', 'study', 'the', 'blowup', 'asymptotics', 'of', 'radially', 'decreasing', 'solutions', 'of', 'the', 'parabolicelliptic', 'kellersegelpatlak', 'system', 'in', 'space', 'dimensions', 'nge', '3', 'in', 'view', 'of', 'the', 'biological', 'background', 'of', 'this', 'system', 'and', 'of', 'its', 'mass', 'conservation', 'property', 'blowup', 'is', 'usually', 'interpreted', 'as', 'a', 'phenomenon', 'of', 'concentration', 'or', 'aggregation', 'of', 'the', 'bacterial', 'population', 'understanding', 'the', 'asymptotic', 'behavior', 'of', 'solutions', 'at', 'the', 'blowup', 'time', 'is', 'thus', 'meaningful', 'for', 'the', 'interpretation', 'of', 'the', 'model', 'under', 'mild', 'assumptions', 'on', 'the', 'initial', 'data', 'for', 'nge', '3', 'we', 'show', 'that', 'the', 'final', 'profile', 'satisfies', 'c_1x2le', 'uxtle', 'c_2x2', 'with', 'convergence', 'in', 'l1', 'as', 'tto', 't', 'this', 'is', 'in', 'sharp', 'contrast', 'with', 'the', 'twodimensional', 'case', 'where', 'solutions', 'are', 'known', 'to', 'concentrate', 'to', 'a', 'dirac', 'mass', 'at', 'the', 'origin', 'plus', 'an', 'integrable', 'part', 'we', 'also', 'obtain', 'refined', 'spacetime', 'estimates', 'of', 'the', 'form', 'uxtle', 'cttx21', 'for', 'typei', 'blowup', 'solutions', 'previous', 'work', 'had', 'shown', 'that', 'radial', 'selfsimilar', 'blowup', 'solutions', 'which', 'satisfy', 'the', 'above', 'estimates', 'exist', 'in', 'dimensions', 'nge', '3', 'and', 'do', 'not', 'exist', 'in', 'dimension', '2', 'our', 'results', 'thus', 'reveal', 'that', 'the', 'final', 'profile', 'displayed', 'by', 'these', 'special', 'solutions', 'actually', 'corresponds', 'to', 'a', 'much', 'more', 'general', 'phenomenon']] | [-0.12089292518274244, 0.06344014337598854, -0.07997584216005309, 0.08964625917512965, -0.03473370232458055, -0.15884564086982159, 0.006082776002585888, 0.3046884740736627, -0.2163148497324957, -0.2516878530664068, 0.14904414234532032, -0.28894561111235045, -0.12105149029384694, 0.16668282189424666, -0.05999332055574356, 0.04952378895142839, 0.0354770516967609, 0.06597378293140765, -0.07497895227526653, -0.24540006678482984, 0.36100036709949207, -0.0172705043418796, 0.24954491557537803, 0.03223303874126016, 0.06612126786045876, -0.05213594670848015, 0.019585728634918868, -0.0022635848923812634, -0.2076481998495757, 0.045517801203083394, 0.2013949035281867, 0.11215510250114076, 0.24073388317714356, -0.3889196935895435, -0.2325633051935271, 0.12385056735999757, 0.21359683254567188, 0.10192308125057513, -0.05700945778655255, -0.25375747667786835, 0.12172749272532053, -0.08974969779614712, -0.23911219732523714, -0.05087025829476393, 0.040525314655654426, 0.035281701941516606, -0.28292842556373865, 0.13226379037235717, 0.1392008160987567, 0.03991819680642399, -0.1380725740786777, -0.08885167013299677, -0.0506303418927186, 0.08443187943896456, 0.10359810886243827, 0.013474796901914868, 0.0518174401989113, -0.14004289198084083, -0.0661410012798821, 0.3392150714842592, -0.05998477998174019, -0.23416527222979205, 0.19834702553529313, -0.19281791791959807, -0.14875340374582058, 0.1370693555488069, 0.14865697388193835, 0.13635418149408515, -0.1087204564321141, 0.11397070592131424, -0.06960829917612023, 0.16612866731339743, 0.12029867658948307, 0.030419430762136553, 0.13717221129977003, 0.15593809480440682, 0.1282238163295925, 0.09749505224159019, -0.03274045746341639, -0.08029131640097407, -0.3563778339338869, -0.14624948061836165, -0.14894809207733326, 0.11779919598785206, -0.11519795559153517, -0.15874627557262525, 0.3528070511548733, 0.1113563892119382, 0.21184711354685812, 0.0905619456287078, 0.2050149390921413, 0.1357321837330341, 0.016250169614860633, 0.08613491206275112, 0.2203040205074901, 0.08822341052185764, 0.14998358328613406, -0.19313203522547892, 0.049885252147247004, 0.09706915422751147] |
1,802.03094 | 2D nanoporous membrane for cation removal from water: effects of ionic
valence, membrane hydrophobicity and pore size | Using molecular dynamic simulations we show that single-layers of molybdenum
disulfide (MoS$_2$) and graphene can effectively reject ions and allow high
water permeability. Solutions of water and three cations with different valence
(Na$^+$, Zn$^{2+}$ and Fe$^{3+}$) were investigated in the presence of the two
types of membranes and the results indicate a high dependence of the ion
rejection on the cation charge. The associative characteristic of ferric
chloride leads to a high rate of ion rejection by both nanopores, while the
monovalent sodium chloride induces lower rejection rates. Particularly, MoS$_2$
shows 100\% of Fe$^{3+}$ rejection for all pore sizes and applied pressures. On
the other hand, the water permeation did not varies with the cation valence,
having dependence only with the nanopore geometric and chemical characteristic.
This study helps to understand the fluid transport through nanoporous membrane,
essential for the development of new technologies for pollutants removal from
water.
| cond-mat.soft cond-mat.mes-hall | using molecular dynamic simulations we show that singlelayers of molybdenum disulfide mos_2 and graphene can effectively reject ions and allow high water permeability solutions of water and three cations with different valence na zn2 and fe3 were investigated in the presence of the two types of membranes and the results indicate a high dependence of the ion rejection on the cation charge the associative characteristic of ferric chloride leads to a high rate of ion rejection by both nanopores while the monovalent sodium chloride induces lower rejection rates particularly mos_2 shows 100 of fe3 rejection for all pore sizes and applied pressures on the other hand the water permeation did not varies with the cation valence having dependence only with the nanopore geometric and chemical characteristic this study helps to understand the fluid transport through nanoporous membrane essential for the development of new technologies for pollutants removal from water | [['using', 'molecular', 'dynamic', 'simulations', 'we', 'show', 'that', 'singlelayers', 'of', 'molybdenum', 'disulfide', 'mos_2', 'and', 'graphene', 'can', 'effectively', 'reject', 'ions', 'and', 'allow', 'high', 'water', 'permeability', 'solutions', 'of', 'water', 'and', 'three', 'cations', 'with', 'different', 'valence', 'na', 'zn2', 'and', 'fe3', 'were', 'investigated', 'in', 'the', 'presence', 'of', 'the', 'two', 'types', 'of', 'membranes', 'and', 'the', 'results', 'indicate', 'a', 'high', 'dependence', 'of', 'the', 'ion', 'rejection', 'on', 'the', 'cation', 'charge', 'the', 'associative', 'characteristic', 'of', 'ferric', 'chloride', 'leads', 'to', 'a', 'high', 'rate', 'of', 'ion', 'rejection', 'by', 'both', 'nanopores', 'while', 'the', 'monovalent', 'sodium', 'chloride', 'induces', 'lower', 'rejection', 'rates', 'particularly', 'mos_2', 'shows', '100', 'of', 'fe3', 'rejection', 'for', 'all', 'pore', 'sizes', 'and', 'applied', 'pressures', 'on', 'the', 'other', 'hand', 'the', 'water', 'permeation', 'did', 'not', 'varies', 'with', 'the', 'cation', 'valence', 'having', 'dependence', 'only', 'with', 'the', 'nanopore', 'geometric', 'and', 'chemical', 'characteristic', 'this', 'study', 'helps', 'to', 'understand', 'the', 'fluid', 'transport', 'through', 'nanoporous', 'membrane', 'essential', 'for', 'the', 'development', 'of', 'new', 'technologies', 'for', 'pollutants', 'removal', 'from', 'water']] | [-0.059428737408187764, 0.18909189439747456, 0.03296240449464261, -0.020965580063584517, 0.029896176179508436, -0.18580363616472323, 0.08025229232613898, 0.41869455133408506, -0.224239102383488, -0.30895540163846025, 0.002399102333876861, -0.32307302856492814, -0.08663188116062408, 0.12281717604648122, -0.0019460216527117178, 0.007290837554973644, 0.0310674242631551, -0.07555305149137424, -0.03525872552773646, -0.18721662782095122, 0.21830745324517456, 0.09413994793723894, 0.33594500649432907, 0.19060061583311091, 0.08700478886685416, -0.03433983615480814, 0.05089868208543466, 0.03553294713355776, -0.1616617719060839, 0.11407030285679853, 0.239350585571659, -0.036693824255126434, 0.22245544307996462, -0.5058916493650251, -0.2418727573115166, -0.00171099163454351, 0.12198334103512684, 0.15084939289856827, -0.12436380747224411, -0.2179978644028431, 0.07282913381846359, -0.12716819080930428, -0.09619145733054302, -0.061411350338888546, -0.022626213866892276, 0.1022449679303158, -0.2529067206735591, 0.10026081729580293, 0.03546743869356461, 0.10066259247032087, -0.1517496392968417, -0.2147834976360002, -0.11076024282074103, 0.09619769343134366, 0.06506034324958221, -0.03903394337312237, 0.2899735297651449, -0.10231299763514141, -0.046683949343360114, 0.40227332828103896, -0.09440576454512024, -0.15750985399463632, 0.2541402973509675, -0.19142335417466363, -0.07840831165714501, 0.2454481117064821, 0.1105866962325003, 0.10821268264979324, -0.14495660840289903, 0.010455538503491263, 0.018619855709573967, 0.21786660415179215, 0.1590328352625838, 0.041911011271103714, 0.19416454721292192, 0.20321067706166124, 0.03924732457146349, 0.13617531348222198, -0.1659055864907201, -0.025853028077157152, -0.14153331618181011, -0.2537458221593734, -0.10999374204368374, 0.04135410823625272, -0.13063581849086245, -0.18389678248610572, 0.3741995523286821, 0.08039924506435558, 0.10947448378288181, -0.05621217142934317, 0.20860243724009034, -0.015139881396453652, 0.0581317448413512, -0.00885597355788786, 0.2176564902882873, 0.1427289861216891, 0.14806591888620899, -0.318379801735532, 0.1353515643632702, 0.006571290973923951] |
1,802.03095 | Microwave-Activated Controlled-Z Gate for Fixed-Frequency Fluxonium
Qubits | The superconducting fluxonium circuit is an artificial atom with a strongly
anharmonic spectrum: when biased at a half flux quantum, the lowest qubit
transition is an order of magnitude smaller in frequency than those to higher
levels. Similar to conventional atomic systems, such a frequency separation
between the computational and noncomputational subspaces allows independent
optimizations of the qubit coherence and two-qubit interactions. Here we
describe a controlled-Z gate for two fluxoniums connected either capacitively
or inductively, with qubit transitions fixed near 500 MHz. The gate is
activated by a microwave drive at a resonance involving the second excited
state. We estimate intrinsic gate fidelities over 99.9% with gate times below
100 ns.
| quant-ph cond-mat.mes-hall | the superconducting fluxonium circuit is an artificial atom with a strongly anharmonic spectrum when biased at a half flux quantum the lowest qubit transition is an order of magnitude smaller in frequency than those to higher levels similar to conventional atomic systems such a frequency separation between the computational and noncomputational subspaces allows independent optimizations of the qubit coherence and twoqubit interactions here we describe a controlledz gate for two fluxoniums connected either capacitively or inductively with qubit transitions fixed near 500 mhz the gate is activated by a microwave drive at a resonance involving the second excited state we estimate intrinsic gate fidelities over 999 with gate times below 100 ns | [['the', 'superconducting', 'fluxonium', 'circuit', 'is', 'an', 'artificial', 'atom', 'with', 'a', 'strongly', 'anharmonic', 'spectrum', 'when', 'biased', 'at', 'a', 'half', 'flux', 'quantum', 'the', 'lowest', 'qubit', 'transition', 'is', 'an', 'order', 'of', 'magnitude', 'smaller', 'in', 'frequency', 'than', 'those', 'to', 'higher', 'levels', 'similar', 'to', 'conventional', 'atomic', 'systems', 'such', 'a', 'frequency', 'separation', 'between', 'the', 'computational', 'and', 'noncomputational', 'subspaces', 'allows', 'independent', 'optimizations', 'of', 'the', 'qubit', 'coherence', 'and', 'twoqubit', 'interactions', 'here', 'we', 'describe', 'a', 'controlledz', 'gate', 'for', 'two', 'fluxoniums', 'connected', 'either', 'capacitively', 'or', 'inductively', 'with', 'qubit', 'transitions', 'fixed', 'near', '500', 'mhz', 'the', 'gate', 'is', 'activated', 'by', 'a', 'microwave', 'drive', 'at', 'a', 'resonance', 'involving', 'the', 'second', 'excited', 'state', 'we', 'estimate', 'intrinsic', 'gate', 'fidelities', 'over', '999', 'with', 'gate', 'times', 'below', '100', 'ns']] | [-0.16744368324509343, 0.26376440518914285, 0.07086146362534901, 3.5475653193488313e-05, 0.03439603408437793, -0.24897739707349656, 0.13175112738374722, 0.4219033481754564, -0.19853709184623383, -0.32837974594335434, 0.016006191857872314, -0.3068498915108812, -0.017164893851611292, 0.24208291691962863, 0.01585256832710526, 0.04204786599085138, 0.012527357384159759, 0.03070667845004045, -0.1155813085334795, -0.20073278281661505, 0.2435888687803133, 0.03645070799446019, 0.2864840615683378, 0.0026397692744393607, 0.10901612410036561, -0.06998591076767256, 0.12977080417352285, -0.06451411433685739, -0.07116509654752172, 0.06846411310992129, 0.2706824179470271, -0.005864206178762493, 0.2493361836752376, -0.45843080009191156, -0.12122725791755123, 0.07420295864125495, 0.11886950631768585, 0.17165716327223424, 0.0408746481386458, -0.2977585117038977, 0.02711123573753211, -0.17343328306283634, -0.0603733049802113, -0.04973548560965437, 0.023892800806107017, -0.02088678898740778, -0.2590420982288616, 0.06720836298867457, 0.05388236979047793, 0.07498037070245692, -0.0021587127388606, -0.051712032235521184, 0.026309718822573755, 0.05199503363031466, -0.1339020104239787, 0.07411743055920007, 0.23546776034542033, -0.05543209865336885, -0.16207597359410814, 0.27496221519352215, -0.0808637910560539, -0.1436247547987748, 0.17904371545054354, -0.1588864808835022, -0.03443579478105446, 0.14547171421046998, 0.08309352259898374, 0.04905991442501545, -0.12209160673064452, 0.02455809473391488, 0.09075288653273035, 0.2887757302740136, 0.10451384687267647, 0.10715905078141405, 0.21564944947625067, 0.15846116125776624, 0.142998551530344, 0.19422199524234277, -0.0999664634399049, -0.06713386902979969, -0.276867262222007, -0.12002212646509614, -0.20554440066444915, 0.13289002690942506, -0.06093837158845712, -0.13693150558387274, 0.45518459017212326, 0.11061979223646827, 0.17630703933746764, -0.011980097017225784, 0.34074605568018446, 0.19275247783878366, 0.08444643456086114, 0.04684308080237594, 0.21473674836090287, 0.19532654742995562, 0.019939312773236486, -0.3001428819578749, 0.0037790082755859373, -0.02889924489280528] |
1,802.03096 | The structure of state transition graphs in hysteresis models with
return point memory: I. General Theory | We consider the athermal quasi-static dynamics (AQS) of disordered systems
driven by a slowly varying external field. Our interest is in an automaton
description (AQS-A) that represents the AQS dynamics in terms of the graph of
state transitions triggered by the driving field. A particular feature of these
systems is return point memory (RPM), a tendency for the system to return to
the same microstate upon cycling the field. It is known that the existence of
three conditions, (1) a partial order on the set of configuration; (2) a
no-passing property; and (3) an adiabatic response to monotonous driving
fields, implies RPM. When periodically driven, such systems settle into a
cyclic response after a transient of at most one period. However conditions
(1)-(3) are only sufficient but not necessary. In fact, we show that the AQS
dynamics naturally provides a more selective partial order which, due to its
connection to hysteresis loops, is a natural choice for establishing RPM. This
enables us to consider AQS-A exhibiting RPM without necessarily possessing the
no-passing property. We call such automata $\ell$AQS-A and work out the
structure of their state transition graphs. Our central finding is that RPM
constrains the {\em intra-loop} structure of hysteresis loops, namely its
hierarchical organization into sub loops, but not the {\em inter-loop}
structure. We prove that the topology of the intra-loop structure has a natural
representation in terms of an ordered tree and that the corresponding state
transition graph is planar. On the other hand, the RPM property does not
significantly restrict inter-loop transitions. A system exhibiting RPM and
subject to periodic forcing can thus undergo a large number of transient cycles
before settling into a periodic response. Such systems can even exhibit
subharmonic response.
| cond-mat.dis-nn cond-mat.soft cond-mat.stat-mech math-ph math.MP | we consider the athermal quasistatic dynamics aqs of disordered systems driven by a slowly varying external field our interest is in an automaton description aqsa that represents the aqs dynamics in terms of the graph of state transitions triggered by the driving field a particular feature of these systems is return point memory rpm a tendency for the system to return to the same microstate upon cycling the field it is known that the existence of three conditions 1 a partial order on the set of configuration 2 a nopassing property and 3 an adiabatic response to monotonous driving fields implies rpm when periodically driven such systems settle into a cyclic response after a transient of at most one period however conditions 13 are only sufficient but not necessary in fact we show that the aqs dynamics naturally provides a more selective partial order which due to its connection to hysteresis loops is a natural choice for establishing rpm this enables us to consider aqsa exhibiting rpm without necessarily possessing the nopassing property we call such automata ellaqsa and work out the structure of their state transition graphs our central finding is that rpm constrains the em intraloop structure of hysteresis loops namely its hierarchical organization into sub loops but not the em interloop structure we prove that the topology of the intraloop structure has a natural representation in terms of an ordered tree and that the corresponding state transition graph is planar on the other hand the rpm property does not significantly restrict interloop transitions a system exhibiting rpm and subject to periodic forcing can thus undergo a large number of transient cycles before settling into a periodic response such systems can even exhibit subharmonic response | [['we', 'consider', 'the', 'athermal', 'quasistatic', 'dynamics', 'aqs', 'of', 'disordered', 'systems', 'driven', 'by', 'a', 'slowly', 'varying', 'external', 'field', 'our', 'interest', 'is', 'in', 'an', 'automaton', 'description', 'aqsa', 'that', 'represents', 'the', 'aqs', 'dynamics', 'in', 'terms', 'of', 'the', 'graph', 'of', 'state', 'transitions', 'triggered', 'by', 'the', 'driving', 'field', 'a', 'particular', 'feature', 'of', 'these', 'systems', 'is', 'return', 'point', 'memory', 'rpm', 'a', 'tendency', 'for', 'the', 'system', 'to', 'return', 'to', 'the', 'same', 'microstate', 'upon', 'cycling', 'the', 'field', 'it', 'is', 'known', 'that', 'the', 'existence', 'of', 'three', 'conditions', '1', 'a', 'partial', 'order', 'on', 'the', 'set', 'of', 'configuration', '2', 'a', 'nopassing', 'property', 'and', '3', 'an', 'adiabatic', 'response', 'to', 'monotonous', 'driving', 'fields', 'implies', 'rpm', 'when', 'periodically', 'driven', 'such', 'systems', 'settle', 'into', 'a', 'cyclic', 'response', 'after', 'a', 'transient', 'of', 'at', 'most', 'one', 'period', 'however', 'conditions', '13', 'are', 'only', 'sufficient', 'but', 'not', 'necessary', 'in', 'fact', 'we', 'show', 'that', 'the', 'aqs', 'dynamics', 'naturally', 'provides', 'a', 'more', 'selective', 'partial', 'order', 'which', 'due', 'to', 'its', 'connection', 'to', 'hysteresis', 'loops', 'is', 'a', 'natural', 'choice', 'for', 'establishing', 'rpm', 'this', 'enables', 'us', 'to', 'consider', 'aqsa', 'exhibiting', 'rpm', 'without', 'necessarily', 'possessing', 'the', 'nopassing', 'property', 'we', 'call', 'such', 'automata', 'ellaqsa', 'and', 'work', 'out', 'the', 'structure', 'of', 'their', 'state', 'transition', 'graphs', 'our', 'central', 'finding', 'is', 'that', 'rpm', 'constrains', 'the', 'em', 'intraloop', 'structure', 'of', 'hysteresis', 'loops', 'namely', 'its', 'hierarchical', 'organization', 'into', 'sub', 'loops', 'but', 'not', 'the', 'em', 'interloop', 'structure', 'we', 'prove', 'that', 'the', 'topology', 'of', 'the', 'intraloop', 'structure', 'has', 'a', 'natural', 'representation', 'in', 'terms', 'of', 'an', 'ordered', 'tree', 'and', 'that', 'the', 'corresponding', 'state', 'transition', 'graph', 'is', 'planar', 'on', 'the', 'other', 'hand', 'the', 'rpm', 'property', 'does', 'not', 'significantly', 'restrict', 'interloop', 'transitions', 'a', 'system', 'exhibiting', 'rpm', 'and', 'subject', 'to', 'periodic', 'forcing', 'can', 'thus', 'undergo', 'a', 'large', 'number', 'of', 'transient', 'cycles', 'before', 'settling', 'into', 'a', 'periodic', 'response', 'such', 'systems', 'can', 'even', 'exhibit', 'subharmonic', 'response']] | [-0.19593432906353334, 0.18522192924447542, -0.07364916477306145, 0.03376193261740016, -0.0695262734864092, -0.12130720945279913, 0.060601844065921735, 0.36060556014157596, -0.27722792381607325, -0.26039271439914424, 0.1269356935162837, -0.2277077086606717, -0.1638693638964959, 0.18050649379882036, -0.050824526804730506, 0.017244668589518505, 0.048894843387752705, 0.07380432962829657, -0.02699747576596255, -0.18998804998956456, 0.3002722050684194, 0.015174816918215907, 0.25824599070903836, 0.010010920054236334, 0.10276356376897451, 0.007007952695316139, 0.04627185059058668, 0.06962450997241779, -0.09839400334248827, 0.03985438027983888, 0.19396624052963146, 0.09309503650424857, 0.25674237334334576, -0.43393220531866483, -0.23195362393248906, 0.12330601171380676, 0.11733663746268086, 0.10704029916665114, -0.0174420022739346, -0.2416944113206647, 0.08443202165695211, -0.14836903543588012, -0.1327622696519532, -0.08665288517462975, 0.049215153166413284, 0.006058392033611708, -0.26845934336174426, 0.017181045481446364, 0.15249570900411674, 0.04962553951149502, -0.05824218191502035, -0.028840888143807704, -0.033791480479425096, 0.14311464523687276, 0.008233836314522047, 0.03622563851085749, 0.11356223252080117, -0.12951152749831873, -0.12266614300971652, 0.38889419762599314, -0.03831786726492437, -0.16506268246205036, 0.2151610544273392, -0.1641789125278592, -0.13101797073861546, 0.18070469849415996, 0.1406054522099918, 0.08208309381574612, -0.13387874013882384, 0.06110425219550755, -0.028623158698166715, 0.2063175777113932, 0.07034568734803891, 0.016564912315464666, 0.20882246134049715, 0.16101074572949808, 0.09778671273515817, 0.15914901615477972, -0.03555288150904912, -0.12535464240061384, -0.26219757448498765, -0.1273068133105874, -0.13662068503545532, 0.07773420383171417, -0.06216554564229008, -0.21539728951983894, 0.41474330496102413, 0.13236681240980666, 0.19698218411125296, 0.03327014162461108, 0.2209796281366325, 0.1220096838514503, 0.06929353416422819, 0.07434925421203836, 0.21813807527432283, 0.11390567291527987, 0.09657682166913696, -0.22356190283597838, 0.08370405739170816, 0.054153667432619325] |
1,802.03097 | Relative Fourier transforms and expectations on coideal subalgebras | For an algebraic compact quantum group $H$ we establish a bijection between
the set of right coideal $*$-subalgebras $A\to H$ and that of left module
quotient $*$-coalgebras $H\to C$. It turns out that the inclusion $A\to H$
always splits as a map of right $A$-modules and right $H$-comodules, and the
resulting expectation $E:H\to A$ is positive (and lifts to a positive map on
the full $C^*$ completion on $H$) if and only if $A$ is invariant under the
squared antipode of $H$.
The proof proceeds by Tannaka-reconstructing the coalgebra $C$ corresponding
to $A\to H$ by means of a fiber functor from $H$-equivariant $A$-modules to
Hilbert spaces, while the characterization of those $A\to H$ which admit
positive expectations makes use of a Fourier transform turning elements of $H$
into functions on $C$.
| math.QA math.OA math.RA | for an algebraic compact quantum group h we establish a bijection between the set of right coideal subalgebras ato h and that of left module quotient coalgebras hto c it turns out that the inclusion ato h always splits as a map of right amodules and right hcomodules and the resulting expectation ehto a is positive and lifts to a positive map on the full c completion on h if and only if a is invariant under the squared antipode of h the proof proceeds by tannakareconstructing the coalgebra c corresponding to ato h by means of a fiber functor from hequivariant amodules to hilbert spaces while the characterization of those ato h which admit positive expectations makes use of a fourier transform turning elements of h into functions on c | [['for', 'an', 'algebraic', 'compact', 'quantum', 'group', 'h', 'we', 'establish', 'a', 'bijection', 'between', 'the', 'set', 'of', 'right', 'coideal', 'subalgebras', 'ato', 'h', 'and', 'that', 'of', 'left', 'module', 'quotient', 'coalgebras', 'hto', 'c', 'it', 'turns', 'out', 'that', 'the', 'inclusion', 'ato', 'h', 'always', 'splits', 'as', 'a', 'map', 'of', 'right', 'amodules', 'and', 'right', 'hcomodules', 'and', 'the', 'resulting', 'expectation', 'ehto', 'a', 'is', 'positive', 'and', 'lifts', 'to', 'a', 'positive', 'map', 'on', 'the', 'full', 'c', 'completion', 'on', 'h', 'if', 'and', 'only', 'if', 'a', 'is', 'invariant', 'under', 'the', 'squared', 'antipode', 'of', 'h', 'the', 'proof', 'proceeds', 'by', 'tannakareconstructing', 'the', 'coalgebra', 'c', 'corresponding', 'to', 'ato', 'h', 'by', 'means', 'of', 'a', 'fiber', 'functor', 'from', 'hequivariant', 'amodules', 'to', 'hilbert', 'spaces', 'while', 'the', 'characterization', 'of', 'those', 'ato', 'h', 'which', 'admit', 'positive', 'expectations', 'makes', 'use', 'of', 'a', 'fourier', 'transform', 'turning', 'elements', 'of', 'h', 'into', 'functions', 'on', 'c']] | [-0.12402075488511076, 0.10458963313837114, -0.04636245295982952, 0.04100265570324232, -0.0918956465347735, -0.18427871727897216, 0.03396366050560749, 0.39759557861690376, -0.40384339113528445, -0.11478519326350255, 0.09249170083875674, -0.2765645156402408, -0.0715515622074983, 0.18416575242786906, -0.06562892219788113, -0.04366178882792014, 0.09335286012135965, 0.118975558865079, -0.09033142016521951, -0.18683781697912966, 0.3526138563968905, -0.008636693886206883, 0.19308216856835886, 0.013129603917721312, 0.14988814105185888, 0.018310579214995914, -0.028083587603195924, -0.03191414969619508, -0.1939151394619767, 0.05392462797751722, 0.2382076851511013, 0.11644388453009748, 0.23959163699006705, -0.29020917864675205, -0.02051854521296052, 0.19297038637419311, 0.13625619322956764, -0.05805560999799, 0.000385146867844832, -0.3189719311979621, 0.11697775306353389, -0.15748237503706947, -0.026207901808151673, -0.07276218478358532, 0.15386205109904788, -0.07302403047928124, -0.3354991182482751, -0.03624495276964681, 0.12233131289366604, 0.08449333466141838, -0.0022728792391717434, -0.107323475018714, -0.14727336839888275, 0.06657686938221256, -0.038955751759570466, 0.0646269756713124, 0.14621148828431502, -0.09920889671256607, -0.059193694983905025, 0.3796334661500052, -0.13071081232118903, -0.21406154881967882, 0.12196150492306423, -0.19336957459215276, -0.07660258983355737, 0.13828153230336515, 0.020254727548652495, 0.12910166012787427, -0.018264509217458046, 0.28696141782344875, -0.12820746180016634, 0.059195340148989084, 0.09577485166721103, 0.0049831649981612386, 0.13436502858259997, 0.038568429491850874, 0.126800901494747, 0.12898314745046285, 0.028077531568056275, 0.009043293350372579, -0.4115424117058978, -0.23520845728168308, -0.09857297077226315, 0.15127236295936813, -0.059432392819336065, -0.1860502062341949, 0.3560577548982561, 0.030999551070565286, 0.2553748346399516, 0.10088720506638317, 0.20986851997124825, 0.09353298744804482, 0.08230110709086176, 0.03312583518207304, 0.11540145673897377, 0.2649940808462484, -0.02550542090167544, -0.1550385672472735, -0.0050768453642263895, 0.2114476457873518] |
1,802.03098 | Tracking Noisy Targets: A Review of Recent Object Tracking Approaches | Visual object tracking is an important computer vision problem with numerous
real-world applications including human-computer interaction, autonomous
vehicles, robotics, motion-based recognition, video indexing, surveillance and
security. In this paper, we aim to extensively review the latest trends and
advances in the tracking algorithms and evaluate the robustness of trackers in
the presence of noise. The first part of this work comprises a comprehensive
survey of recently proposed tracking algorithms. We broadly categorize trackers
into correlation filter based trackers and the others as non-correlation filter
trackers. Each category is further classified into various types of trackers
based on the architecture of the tracking mechanism. In the second part of this
work, we experimentally evaluate tracking algorithms for robustness in the
presence of additive white Gaussian noise. Multiple levels of additive noise
are added to the Object Tracking Benchmark (OTB) 2015, and the precision and
success rates of the tracking algorithms are evaluated. Some algorithms
suffered more performance degradation than others, which brings to light a
previously unexplored aspect of the tracking algorithms. The relative rank of
the algorithms based on their performance on benchmark datasets may change in
the presence of noise. Our study concludes that no single tracker is able to
achieve the same efficiency in the presence of noise as under noise-free
conditions; thus, there is a need to include a parameter for robustness to
noise when evaluating newly proposed tracking algorithms.
| cs.CV | visual object tracking is an important computer vision problem with numerous realworld applications including humancomputer interaction autonomous vehicles robotics motionbased recognition video indexing surveillance and security in this paper we aim to extensively review the latest trends and advances in the tracking algorithms and evaluate the robustness of trackers in the presence of noise the first part of this work comprises a comprehensive survey of recently proposed tracking algorithms we broadly categorize trackers into correlation filter based trackers and the others as noncorrelation filter trackers each category is further classified into various types of trackers based on the architecture of the tracking mechanism in the second part of this work we experimentally evaluate tracking algorithms for robustness in the presence of additive white gaussian noise multiple levels of additive noise are added to the object tracking benchmark otb 2015 and the precision and success rates of the tracking algorithms are evaluated some algorithms suffered more performance degradation than others which brings to light a previously unexplored aspect of the tracking algorithms the relative rank of the algorithms based on their performance on benchmark datasets may change in the presence of noise our study concludes that no single tracker is able to achieve the same efficiency in the presence of noise as under noisefree conditions thus there is a need to include a parameter for robustness to noise when evaluating newly proposed tracking algorithms | [['visual', 'object', 'tracking', 'is', 'an', 'important', 'computer', 'vision', 'problem', 'with', 'numerous', 'realworld', 'applications', 'including', 'humancomputer', 'interaction', 'autonomous', 'vehicles', 'robotics', 'motionbased', 'recognition', 'video', 'indexing', 'surveillance', 'and', 'security', 'in', 'this', 'paper', 'we', 'aim', 'to', 'extensively', 'review', 'the', 'latest', 'trends', 'and', 'advances', 'in', 'the', 'tracking', 'algorithms', 'and', 'evaluate', 'the', 'robustness', 'of', 'trackers', 'in', 'the', 'presence', 'of', 'noise', 'the', 'first', 'part', 'of', 'this', 'work', 'comprises', 'a', 'comprehensive', 'survey', 'of', 'recently', 'proposed', 'tracking', 'algorithms', 'we', 'broadly', 'categorize', 'trackers', 'into', 'correlation', 'filter', 'based', 'trackers', 'and', 'the', 'others', 'as', 'noncorrelation', 'filter', 'trackers', 'each', 'category', 'is', 'further', 'classified', 'into', 'various', 'types', 'of', 'trackers', 'based', 'on', 'the', 'architecture', 'of', 'the', 'tracking', 'mechanism', 'in', 'the', 'second', 'part', 'of', 'this', 'work', 'we', 'experimentally', 'evaluate', 'tracking', 'algorithms', 'for', 'robustness', 'in', 'the', 'presence', 'of', 'additive', 'white', 'gaussian', 'noise', 'multiple', 'levels', 'of', 'additive', 'noise', 'are', 'added', 'to', 'the', 'object', 'tracking', 'benchmark', 'otb', '2015', 'and', 'the', 'precision', 'and', 'success', 'rates', 'of', 'the', 'tracking', 'algorithms', 'are', 'evaluated', 'some', 'algorithms', 'suffered', 'more', 'performance', 'degradation', 'than', 'others', 'which', 'brings', 'to', 'light', 'a', 'previously', 'unexplored', 'aspect', 'of', 'the', 'tracking', 'algorithms', 'the', 'relative', 'rank', 'of', 'the', 'algorithms', 'based', 'on', 'their', 'performance', 'on', 'benchmark', 'datasets', 'may', 'change', 'in', 'the', 'presence', 'of', 'noise', 'our', 'study', 'concludes', 'that', 'no', 'single', 'tracker', 'is', 'able', 'to', 'achieve', 'the', 'same', 'efficiency', 'in', 'the', 'presence', 'of', 'noise', 'as', 'under', 'noisefree', 'conditions', 'thus', 'there', 'is', 'a', 'need', 'to', 'include', 'a', 'parameter', 'for', 'robustness', 'to', 'noise', 'when', 'evaluating', 'newly', 'proposed', 'tracking', 'algorithms']] | [-0.10562053288766803, -0.02037098017802748, -0.06126547779272362, 0.019836784547790406, -0.04735713855107615, -0.17095255248584332, -0.015295569060965892, 0.42100533717931465, -0.1985177392491775, -0.35983274633648443, 0.10803288748126093, -0.26842824027917545, -0.1954878249001797, 0.21731998852370188, -0.19542295399772466, 0.09418700544836595, 0.1129029553314639, 0.04933327180408381, -0.05656230932225517, -0.3238325259241559, 0.27289515139950765, 0.08531120005403466, 0.3126660093561199, 0.0282776936408544, 0.10681027684224842, -0.007723539927774489, -0.09331689804868348, -0.00044827868906149534, -0.05898582527795312, 0.13080480976715733, 0.26843138694660257, 0.15747056218151947, 0.32608411892850847, -0.3649383347137739, -0.19328351954124118, 0.10827158936279398, 0.14113063305964127, 0.07889674888038659, -0.08197607919495091, -0.37692719991438794, 0.09505297825571805, -0.17036873447436984, -0.03126954706385732, -0.09075941676833535, 0.016383507681207117, 0.03271426546962956, -0.25704219860830163, 0.019503864004024877, 0.06444112005930963, 0.06750069764670576, -0.06248433726875695, -0.13798925952082539, 0.06762076262434617, 0.19614910888108386, 0.06337641907407195, -0.0030239163638120558, 0.18116197801822628, -0.21172902722538964, -0.1862284910179127, 0.35581410330317537, -0.05532956588045292, -0.21107943469604534, 0.23910551673738695, -0.051388976988562506, -0.16732605425800826, 0.13339678458459756, 0.24273706704793827, 0.10253296571480441, -0.17633711772226646, 0.03211670170104443, 0.006094683833068533, 0.1853520875434939, 0.033477013662873166, 0.0590455660095854, 0.15465376850481388, 0.2567538044509346, 0.07429182407188394, 0.14394051238270916, -0.16535690628579724, -0.09467697477911483, -0.21946929417407668, -0.10984522870505956, -0.15498767446830486, -0.0707584878123993, -0.05465421003357971, -0.1479476250572202, 0.4106128891338414, 0.25777785362957584, 0.1629196554152575, 0.02978657406071289, 0.41200191448362694, 0.020505781870539194, 0.06653054055254187, 0.06531588376655599, 0.24137640276400657, 0.05248888069563925, 0.14215065548126485, -0.1977373330981037, 0.08710821023382759, 0.028765580776775088] |
1,802.03099 | Blockchain-Assisted Crowdsourced Energy Systems | Crowdsourcing relies on people's contributions to meet product- or
system-level objectives. Crowdsourcing-based methods have been implemented in
various cyber-physical systems and realtime markets. This paper explores a
framework for Crowdsourced Energy Systems (CES), where small-scale energy
generation or energy trading is crowdsourced from distributed energy resources,
electric vehicles, and shapable loads. The merits/pillars of energy
crowdsourcing are discussed. Then, an operational model for CESs in
distribution networks with different types of crowdsourcees is proposed. The
model yields a market equilibrium depicting traditional and distributed
generator and load setpoints. Given these setpoints, crowdsourcing incentives
are designed to steer crowdsourcees to the equilibrium. As the number of
crowdsourcees and energy trading transactions scales up, a secure energy
trading platform is required. To that end, the presented framework is
integrated with a lightweight Blockchain implementation and smart contracts.
Numerical tests are provided to showcase the overall implementation.
| cs.SY math.OC | crowdsourcing relies on peoples contributions to meet product or systemlevel objectives crowdsourcingbased methods have been implemented in various cyberphysical systems and realtime markets this paper explores a framework for crowdsourced energy systems ces where smallscale energy generation or energy trading is crowdsourced from distributed energy resources electric vehicles and shapable loads the meritspillars of energy crowdsourcing are discussed then an operational model for cess in distribution networks with different types of crowdsourcees is proposed the model yields a market equilibrium depicting traditional and distributed generator and load setpoints given these setpoints crowdsourcing incentives are designed to steer crowdsourcees to the equilibrium as the number of crowdsourcees and energy trading transactions scales up a secure energy trading platform is required to that end the presented framework is integrated with a lightweight blockchain implementation and smart contracts numerical tests are provided to showcase the overall implementation | [['crowdsourcing', 'relies', 'on', 'peoples', 'contributions', 'to', 'meet', 'product', 'or', 'systemlevel', 'objectives', 'crowdsourcingbased', 'methods', 'have', 'been', 'implemented', 'in', 'various', 'cyberphysical', 'systems', 'and', 'realtime', 'markets', 'this', 'paper', 'explores', 'a', 'framework', 'for', 'crowdsourced', 'energy', 'systems', 'ces', 'where', 'smallscale', 'energy', 'generation', 'or', 'energy', 'trading', 'is', 'crowdsourced', 'from', 'distributed', 'energy', 'resources', 'electric', 'vehicles', 'and', 'shapable', 'loads', 'the', 'meritspillars', 'of', 'energy', 'crowdsourcing', 'are', 'discussed', 'then', 'an', 'operational', 'model', 'for', 'cess', 'in', 'distribution', 'networks', 'with', 'different', 'types', 'of', 'crowdsourcees', 'is', 'proposed', 'the', 'model', 'yields', 'a', 'market', 'equilibrium', 'depicting', 'traditional', 'and', 'distributed', 'generator', 'and', 'load', 'setpoints', 'given', 'these', 'setpoints', 'crowdsourcing', 'incentives', 'are', 'designed', 'to', 'steer', 'crowdsourcees', 'to', 'the', 'equilibrium', 'as', 'the', 'number', 'of', 'crowdsourcees', 'and', 'energy', 'trading', 'transactions', 'scales', 'up', 'a', 'secure', 'energy', 'trading', 'platform', 'is', 'required', 'to', 'that', 'end', 'the', 'presented', 'framework', 'is', 'integrated', 'with', 'a', 'lightweight', 'blockchain', 'implementation', 'and', 'smart', 'contracts', 'numerical', 'tests', 'are', 'provided', 'to', 'showcase', 'the', 'overall', 'implementation']] | [-0.16155288019381517, 0.052596870266351174, -0.06391750323146739, 0.04853229091132165, -0.07306357989789472, -0.17966562577418355, 0.058630629023701, 0.41123555285829894, -0.25562422184772055, -0.3668371804884937, 0.09170132130794359, -0.2960156793050258, -0.09067692944753758, 0.18191159893815984, -0.11506029230240784, 0.09907917471104105, 0.03837084755937661, -0.009500744057373263, 0.062219919265464316, -0.253155969565367, 0.2698946150862546, 0.10527124352225194, 0.3795507001480691, 0.06637300144959714, 0.1162805061616843, -0.05566490820156489, -0.027475576244399582, -0.0020505220819474527, -0.07949905892495684, 0.15526227526117484, 0.33710698002267264, 0.18634775450328547, 0.3555553608744497, -0.4488420228237732, -0.1435900979960652, 0.11134847790383222, 0.07331416526199384, 0.036917198896998356, -0.05728339178661462, -0.269071880196759, 0.09034233618344009, -0.28275470191639074, -0.07348283316159594, -0.13654957645454666, -0.021473941896569877, 0.09747728379279323, -0.3221264835725814, -0.01794486913607049, -0.029533476867175227, 0.06520055144251337, -0.06786812537572753, -0.07706916700182877, -0.037708868962076404, 0.14241501126228504, 0.04178166043990567, -0.08098074247237479, 0.20248785889732102, -0.08980943438593744, -0.1814122269763021, 0.4026591993645358, 0.050763956118214375, -0.15938898220225434, 0.1520848471317178, 0.025863170932853778, -0.10843220727787103, 0.06050491764236399, 0.2574719723091054, 0.060283178119456174, -0.20719161175165168, 0.03572286109679418, 0.04146343735243443, 0.1932512633896, 0.026195092579271172, 0.018040171097209807, 0.19606324148357807, 0.2363533458941367, 0.11856218934605148, 0.10461158625466722, -0.011012790893519324, -0.17249169254767327, -0.24116242725507053, -0.12533721812135, -0.1757687241573569, 0.01722054264154023, -0.07715286052245549, -0.12076110344275202, 0.37399442396848137, 0.16802825192710988, 0.08384797760469079, 0.09081578480725794, 0.40115076965901636, 0.08337988868982098, 0.04866436574096516, 0.1548770667729296, 0.15634226411397398, -0.02803889087493151, 0.2186824516163693, -0.1718911353259308, 0.07155348781601224, -0.01172666047522667] |
1,802.031 | Determination of $s$- and $p$-wave $I=1/2$ $K\pi$ scattering amplitudes
in $N_{\mathrm{f}}=2+1$ lattice QCD | The elastic $I=1/2$, $s$- and $p$-wave kaon-pion scattering amplitudes are
calculated using a single ensemble of anisotropic lattice QCD gauge field
configurations with $N_{\mathrm{f}} = 2+1$ flavors of dynamical Wilson-clover
fermions at $m_{\pi} = 230\mathrm{MeV}$. A large spatial extent of $L =
3.7\mathrm{fm}$ enables a good energy resolution while partial wave mixing due
to the reduced symmetries of the finite volume is treated explicitly.The
$p$-wave amplitude is well described by a Breit-Wigner shape with parameters
$m_{K^{*}}/m_{\pi} = 3.808(18)$ and $g^{\mathrm{BW}}_{K^{*}K\pi} = 5.33(20)$
which are insensitive to the inclusion of $d$-wave mixing and variation of the
$s$-wave parametrization. An effective range description of the near-threshold
$s$-wave amplitude yields $m_{\pi}a_0 = -0.353(25)$.
| hep-lat hep-ph nucl-th | the elastic i12 s and pwave kaonpion scattering amplitudes are calculated using a single ensemble of anisotropic lattice qcd gauge field configurations with n_mathrmf 21 flavors of dynamical wilsonclover fermions at m_pi 230mathrmmev a large spatial extent of l 37mathrmfm enables a good energy resolution while partial wave mixing due to the reduced symmetries of the finite volume is treated explicitlythe pwave amplitude is well described by a breitwigner shape with parameters m_km_pi 380818 and gmathrmbw_kkpi 53320 which are insensitive to the inclusion of dwave mixing and variation of the swave parametrization an effective range description of the nearthreshold swave amplitude yields m_pia_0 035325 | [['the', 'elastic', 'i12', 's', 'and', 'pwave', 'kaonpion', 'scattering', 'amplitudes', 'are', 'calculated', 'using', 'a', 'single', 'ensemble', 'of', 'anisotropic', 'lattice', 'qcd', 'gauge', 'field', 'configurations', 'with', 'n_mathrmf', '21', 'flavors', 'of', 'dynamical', 'wilsonclover', 'fermions', 'at', 'm_pi', '230mathrmmev', 'a', 'large', 'spatial', 'extent', 'of', 'l', '37mathrmfm', 'enables', 'a', 'good', 'energy', 'resolution', 'while', 'partial', 'wave', 'mixing', 'due', 'to', 'the', 'reduced', 'symmetries', 'of', 'the', 'finite', 'volume', 'is', 'treated', 'explicitlythe', 'pwave', 'amplitude', 'is', 'well', 'described', 'by', 'a', 'breitwigner', 'shape', 'with', 'parameters', 'm_km_pi', '380818', 'and', 'gmathrmbw_kkpi', '53320', 'which', 'are', 'insensitive', 'to', 'the', 'inclusion', 'of', 'dwave', 'mixing', 'and', 'variation', 'of', 'the', 'swave', 'parametrization', 'an', 'effective', 'range', 'description', 'of', 'the', 'nearthreshold', 'swave', 'amplitude', 'yields', 'm_pia_0', '035325']] | [-0.1881276186261522, 0.2800191725519988, -0.08029478500891281, 0.08876006402026274, -0.0467788169748689, -0.13133980074627816, 0.04138414335290068, 0.3391953394307118, -0.1833694060627175, -0.2566713952655463, -0.03903760528437009, -0.2909829449300703, -0.025515264934419017, 0.08184199466026927, 0.07977113413477414, 0.10805197655970819, 0.04128159749762792, 0.026937749084869497, -0.13471485834176603, -0.17943471097142288, 0.33768878867359536, -0.004882037306302472, 0.265734348750036, 0.11614219634548614, 0.0430770316749419, 0.06819224154919779, -0.01181072660991432, -0.0244499713366263, -0.12144988345374402, 0.060955633968114854, 0.21307126751022512, -0.05912157578614393, 0.061371378149641186, -0.3442566920954146, -0.22407437460742108, 0.06037817021439734, 0.18302383168943617, 0.145782117419386, 0.06890205263503288, -0.3115430417225549, 0.04888792737926308, -0.1907549259595965, -0.2197712455545307, -0.12132765535559309, 0.027042834235869936, -0.030286524175837833, -0.33871143894073996, 0.11961068676533422, -0.03605983587698766, 0.07592650924711243, -0.009814549198276118, -0.1883407134072561, -0.030565593411263667, 0.009125783500310621, 0.06585175066199889, 0.09073440400197318, 0.10948595197283123, -0.15076075005099962, -0.06291081278928017, 0.43288167352101914, -0.0970378640536709, -0.1797946532943139, 0.12801591226046807, -0.09690488053877887, -0.033227676721779925, 0.22052992205870778, 0.11847157796452704, 0.03069121033737534, -0.1442499326345952, 0.13768780048466348, -0.03442114238293327, 0.21493795800120816, 0.11566894185778341, 0.08144173756928036, 0.19630044070317557, 0.1875433018761932, -0.009637676728399176, 0.05983955477254073, -0.08880379345071943, -0.10443561541553782, -0.3408334121500191, -0.022038344237463255, -0.14659110458665772, 0.07066502158428958, -0.1116577826965735, -0.16561744986101984, 0.36006548236075203, 0.05135881898826675, 0.25066792158851103, -0.014984276820905506, 0.24639578459686354, 0.12689470442404088, 0.0863023655636138, 0.022067389008589088, 0.20801011391082092, 0.2197694185949666, 0.061520748950639054, -0.3561020400938823, -0.0724610351565245, 0.060739905485197115] |
1,802.03101 | Convolutional Hashing for Automated Scene Matching | We present a powerful new loss function and training scheme for learning
binary hash functions. In particular, we demonstrate our method by creating for
the first time a neural network that outperforms state-of-the-art Haar wavelets
and color layout descriptors at the task of automated scene matching. By
accurately relating distance on the manifold of network outputs to distance in
Hamming space, we achieve a 100-fold reduction in nontrivial false positive
rate and significantly higher true positive rate. We expect our insights to
provide large wins for hashing models applied to other information retrieval
hashing tasks as well.
| cs.CV cs.IR stat.ML | we present a powerful new loss function and training scheme for learning binary hash functions in particular we demonstrate our method by creating for the first time a neural network that outperforms stateoftheart haar wavelets and color layout descriptors at the task of automated scene matching by accurately relating distance on the manifold of network outputs to distance in hamming space we achieve a 100fold reduction in nontrivial false positive rate and significantly higher true positive rate we expect our insights to provide large wins for hashing models applied to other information retrieval hashing tasks as well | [['we', 'present', 'a', 'powerful', 'new', 'loss', 'function', 'and', 'training', 'scheme', 'for', 'learning', 'binary', 'hash', 'functions', 'in', 'particular', 'we', 'demonstrate', 'our', 'method', 'by', 'creating', 'for', 'the', 'first', 'time', 'a', 'neural', 'network', 'that', 'outperforms', 'stateoftheart', 'haar', 'wavelets', 'and', 'color', 'layout', 'descriptors', 'at', 'the', 'task', 'of', 'automated', 'scene', 'matching', 'by', 'accurately', 'relating', 'distance', 'on', 'the', 'manifold', 'of', 'network', 'outputs', 'to', 'distance', 'in', 'hamming', 'space', 'we', 'achieve', 'a', '100fold', 'reduction', 'in', 'nontrivial', 'false', 'positive', 'rate', 'and', 'significantly', 'higher', 'true', 'positive', 'rate', 'we', 'expect', 'our', 'insights', 'to', 'provide', 'large', 'wins', 'for', 'hashing', 'models', 'applied', 'to', 'other', 'information', 'retrieval', 'hashing', 'tasks', 'as', 'well']] | [-0.0632752511727134, -0.004198212409391999, -0.09026981597843091, 0.10939216278685429, -0.07964581983120747, -0.1976928041561401, 0.08131268088761046, 0.45945589659140285, -0.2702887831735857, -0.3048970062554497, 0.05342334093281174, -0.2520555127124043, -0.18785302196005263, 0.20964473795107344, -0.1443836022571651, 0.12445948610907977, 0.12347495288962555, 0.044697959373582674, -0.12137364521358623, -0.34062416455948474, 0.33520507387884113, 0.060155096406251496, 0.32687773170506523, 0.04074741451828212, 0.15614766229097685, 0.010714139333282857, -0.02872547564053543, -0.01502972689352824, -0.07651452008389073, 0.16748418007045984, 0.29792534961466727, 0.2280187931190216, 0.27940592999310837, -0.353687983371087, -0.2270840944952725, 0.11207013029950796, 0.12267215600472481, 0.13044193376470165, -0.08099800182059984, -0.3051882210948514, 0.11309286265528386, -0.16611979124088264, 0.021002703370315207, -0.17443597674389014, 0.016856037373126475, -0.01153445495388557, -0.3274098851924436, 0.057317589536866116, 0.06769009828015432, 0.010874046060765526, -0.04027293123108018, -0.14526810693871423, 0.03811623406423659, 0.16539911812017719, -0.01690830292957883, 0.1452912460717363, 0.11191230045977174, -0.15226254300166345, -0.16919219246153364, 0.3385211084057222, -0.11411981967028192, -0.19679759192213261, 0.16660760155850157, -0.07263863485152881, -0.1376596012515179, 0.11214688145699575, 0.2727845983253312, 0.15157490575052412, -0.09629464160036488, -0.03168372232070884, -0.027495286475444577, 0.2084174645373348, 0.08337198762515963, 0.058910941743512746, 0.16410326649982138, 0.21541825765215783, 0.11634456080182926, 0.17138928505316012, -0.11915820245823064, -0.040104726413456894, -0.20235702055554414, -0.13388643150707497, -0.24367077403567425, -0.029654913466692585, -0.16128915354334053, -0.13947190562282333, 0.39887037234195266, 0.21054803428825797, 0.21107236090561463, 0.15575961949130923, 0.33913690930942897, 0.014031101672276471, 0.1267564717065735, 0.12708932481953375, 0.1649833319459072, 0.011260007688122773, 0.08858074755743914, -0.16728307084857305, 0.08473938143663301, 0.12548337662688544] |
1,802.03102 | Learning to Match | Booking.com is a virtual two-sided marketplace where guests and accommodation
providers are the two distinct stakeholders. They meet to satisfy their
respective and different goals. Guests want to be able to choose accommodations
from a huge and diverse inventory, fast and reliably within their requirements
and constraints. Accommodation providers desire to reach a reliable and large
market that maximizes their revenue. Finding the best accommodation for the
guests, a problem typically addressed by the recommender systems community, and
finding the best audience for the accommodation providers, are key pieces of a
good platform. This work describes how Booking.com extends such approach,
enabling the guests themselves to find the best accommodation by helping them
to discover their needs and restrictions, what the market can actually offer,
reinforcing good decisions, discouraging bad ones, etc. turning the platform
into a decision process advisor, as opposed to a decision maker. Booking.com
implements this idea with hundreds of Machine Learned Models, all of them
validated through rigorous Randomized Controlled Experiments. We further
elaborate on model types, techniques, methodological issues and challenges that
we have faced.
| cs.IR | bookingcom is a virtual twosided marketplace where guests and accommodation providers are the two distinct stakeholders they meet to satisfy their respective and different goals guests want to be able to choose accommodations from a huge and diverse inventory fast and reliably within their requirements and constraints accommodation providers desire to reach a reliable and large market that maximizes their revenue finding the best accommodation for the guests a problem typically addressed by the recommender systems community and finding the best audience for the accommodation providers are key pieces of a good platform this work describes how bookingcom extends such approach enabling the guests themselves to find the best accommodation by helping them to discover their needs and restrictions what the market can actually offer reinforcing good decisions discouraging bad ones etc turning the platform into a decision process advisor as opposed to a decision maker bookingcom implements this idea with hundreds of machine learned models all of them validated through rigorous randomized controlled experiments we further elaborate on model types techniques methodological issues and challenges that we have faced | [['bookingcom', 'is', 'a', 'virtual', 'twosided', 'marketplace', 'where', 'guests', 'and', 'accommodation', 'providers', 'are', 'the', 'two', 'distinct', 'stakeholders', 'they', 'meet', 'to', 'satisfy', 'their', 'respective', 'and', 'different', 'goals', 'guests', 'want', 'to', 'be', 'able', 'to', 'choose', 'accommodations', 'from', 'a', 'huge', 'and', 'diverse', 'inventory', 'fast', 'and', 'reliably', 'within', 'their', 'requirements', 'and', 'constraints', 'accommodation', 'providers', 'desire', 'to', 'reach', 'a', 'reliable', 'and', 'large', 'market', 'that', 'maximizes', 'their', 'revenue', 'finding', 'the', 'best', 'accommodation', 'for', 'the', 'guests', 'a', 'problem', 'typically', 'addressed', 'by', 'the', 'recommender', 'systems', 'community', 'and', 'finding', 'the', 'best', 'audience', 'for', 'the', 'accommodation', 'providers', 'are', 'key', 'pieces', 'of', 'a', 'good', 'platform', 'this', 'work', 'describes', 'how', 'bookingcom', 'extends', 'such', 'approach', 'enabling', 'the', 'guests', 'themselves', 'to', 'find', 'the', 'best', 'accommodation', 'by', 'helping', 'them', 'to', 'discover', 'their', 'needs', 'and', 'restrictions', 'what', 'the', 'market', 'can', 'actually', 'offer', 'reinforcing', 'good', 'decisions', 'discouraging', 'bad', 'ones', 'etc', 'turning', 'the', 'platform', 'into', 'a', 'decision', 'process', 'advisor', 'as', 'opposed', 'to', 'a', 'decision', 'maker', 'bookingcom', 'implements', 'this', 'idea', 'with', 'hundreds', 'of', 'machine', 'learned', 'models', 'all', 'of', 'them', 'validated', 'through', 'rigorous', 'randomized', 'controlled', 'experiments', 'we', 'further', 'elaborate', 'on', 'model', 'types', 'techniques', 'methodological', 'issues', 'and', 'challenges', 'that', 'we', 'have', 'faced']] | [-0.08153755530042367, 0.05669665191995187, -0.06427538058972762, 0.08773448649061619, -0.1914867204458763, -0.20286289602776783, 0.1637273886344499, 0.4151866337491406, -0.2847273738925449, -0.35964883416373694, 0.12057749235278202, -0.3151946457904867, -0.12910651010461152, 0.1591272576265813, -0.10130343789157147, 0.06503958258027624, 0.04875986953686354, -0.005878445028793066, 0.018122332802482155, -0.30558577860550334, 0.28485459262349955, 0.075693653896451, 0.3125037150328151, 0.062399523172320594, 0.07177057676534686, -0.013438710192632344, -0.03943959969199366, -0.014171960626521872, -0.11936856151935192, 0.17078970363298948, 0.3550140801205392, 0.2001188978811519, 0.375823798824826, -0.45125362406381303, -0.11099862751240532, 0.10845626364591428, 0.1161080818131773, 0.05312162156527241, -0.02047457128776134, -0.28078421221709704, 0.07743366048412605, -0.21272902933673726, -0.1169178053840167, -0.1125528471544385, -0.05422106477069772, 0.030404968603721095, -0.2711071332295736, -0.059058761587625165, 4.5516704105668595e-05, 0.010127604437164135, -0.04792174973149991, -0.10046014923912784, 0.00271118368449, 0.24530735007073318, 0.0667999693844144, -0.017751504837845763, 0.16312831724579963, -0.15337493590001638, -0.1464371527182973, 0.4402089225024813, 0.0341942531367143, -0.17204144952338538, 0.2127269585384056, -0.04075258808669686, -0.13016834503246677, 0.07415616378841353, 0.1930444549044801, 0.044120190421947175, -0.20194785141955232, -0.002540509316410559, -0.019749513174691754, 0.14384693009390806, 0.03602680177389427, 0.0067901709142865405, 0.25722295744861995, 0.18770121932029724, 0.09379813172078381, 0.07764243214171276, 0.06614428235366682, -0.10476151706081711, -0.21342454831012422, -0.14905007022898645, -0.12154450760960268, -0.002898978334592862, -0.07677614984495448, -0.1042443670248354, 0.33999084057480405, 0.2082894769652436, 0.16526943979875391, 0.04786884736968204, 0.31507871584488184, 0.029150927654700353, 0.09108247999101877, 0.09577994194114581, 0.18705762573841234, -0.04205872048365159, 0.1516623049056054, -0.14509270760269524, 0.14099960537278095, -0.022812851950422756] |
1,802.03103 | The complex gamma-ray behaviour of the Radio Galaxy M87 | Context.In recent years, non-blazar Active Galactic Nuclei (AGN) such as
Radio Galaxies have emerged as a highly instructive source class providing
unique insights into high energy acceleration and radiation mechanisms.
Aims.Here we aim at a detailed characterization of the high-energy (HE;>100
MeV) gamma-ray emission from the prominent radio galaxy M87. Methods.We analyze
8 years of Fermi-LAT data and derive the spectral energy distribution between
100 MeV and 300 GeV. We extract lightcurves and investigate the variability
behaviour for the entire energy range as well as below and above 10 GeV.
Results.Our analysis provides (i)evidence for HE gamma-ray flux variability and
(ii)indications for a possible excess over the standard power-law model above
Eb~10 GeV, similar to the earlier indications in the case of Cen A. When viewed
in HE-VHE context, this is most naturally explained by an additional component
dominating the highest-energy part of the spectrum. Investigation of the
gamma-ray lightcurves suggests that the lower-energy (<10 GeV) component is
variable on timescales of (at least) a few months. The statistics of the high
energy component (>10 GeV) does not allow significant constraints on
variability. We find indications, however, for spectral changes with time that
support variability of the putative additional component and seem to favor
jet-related scenarios for its origin capable of accommodating month-type
variability. Conclusions.The current findings suggest that both the high-energy
(> Eb) and the very high energy (VHE;>100 GeV) emission in M87 are compatible
with originating from the same physical component. The variability behaviour at
VHE then allows further constraints on the location and the nature of the
second component. In particular, these considerations suggest that the VHE
emission during the quiescent state originates in a similar region as during
the flare.
| astro-ph.HE astro-ph.CO | contextin recent years nonblazar active galactic nuclei agn such as radio galaxies have emerged as a highly instructive source class providing unique insights into high energy acceleration and radiation mechanisms aimshere we aim at a detailed characterization of the highenergy he100 mev gammaray emission from the prominent radio galaxy m87 methodswe analyze 8 years of fermilat data and derive the spectral energy distribution between 100 mev and 300 gev we extract lightcurves and investigate the variability behaviour for the entire energy range as well as below and above 10 gev resultsour analysis provides ievidence for he gammaray flux variability and iiindications for a possible excess over the standard powerlaw model above eb10 gev similar to the earlier indications in the case of cen a when viewed in hevhe context this is most naturally explained by an additional component dominating the highestenergy part of the spectrum investigation of the gammaray lightcurves suggests that the lowerenergy 10 gev component is variable on timescales of at least a few months the statistics of the high energy component 10 gev does not allow significant constraints on variability we find indications however for spectral changes with time that support variability of the putative additional component and seem to favor jetrelated scenarios for its origin capable of accommodating monthtype variability conclusionsthe current findings suggest that both the highenergy eb and the very high energy vhe100 gev emission in m87 are compatible with originating from the same physical component the variability behaviour at vhe then allows further constraints on the location and the nature of the second component in particular these considerations suggest that the vhe emission during the quiescent state originates in a similar region as during the flare | [['contextin', 'recent', 'years', 'nonblazar', 'active', 'galactic', 'nuclei', 'agn', 'such', 'as', 'radio', 'galaxies', 'have', 'emerged', 'as', 'a', 'highly', 'instructive', 'source', 'class', 'providing', 'unique', 'insights', 'into', 'high', 'energy', 'acceleration', 'and', 'radiation', 'mechanisms', 'aimshere', 'we', 'aim', 'at', 'a', 'detailed', 'characterization', 'of', 'the', 'highenergy', 'he100', 'mev', 'gammaray', 'emission', 'from', 'the', 'prominent', 'radio', 'galaxy', 'm87', 'methodswe', 'analyze', '8', 'years', 'of', 'fermilat', 'data', 'and', 'derive', 'the', 'spectral', 'energy', 'distribution', 'between', '100', 'mev', 'and', '300', 'gev', 'we', 'extract', 'lightcurves', 'and', 'investigate', 'the', 'variability', 'behaviour', 'for', 'the', 'entire', 'energy', 'range', 'as', 'well', 'as', 'below', 'and', 'above', '10', 'gev', 'resultsour', 'analysis', 'provides', 'ievidence', 'for', 'he', 'gammaray', 'flux', 'variability', 'and', 'iiindications', 'for', 'a', 'possible', 'excess', 'over', 'the', 'standard', 'powerlaw', 'model', 'above', 'eb10', 'gev', 'similar', 'to', 'the', 'earlier', 'indications', 'in', 'the', 'case', 'of', 'cen', 'a', 'when', 'viewed', 'in', 'hevhe', 'context', 'this', 'is', 'most', 'naturally', 'explained', 'by', 'an', 'additional', 'component', 'dominating', 'the', 'highestenergy', 'part', 'of', 'the', 'spectrum', 'investigation', 'of', 'the', 'gammaray', 'lightcurves', 'suggests', 'that', 'the', 'lowerenergy', '10', 'gev', 'component', 'is', 'variable', 'on', 'timescales', 'of', 'at', 'least', 'a', 'few', 'months', 'the', 'statistics', 'of', 'the', 'high', 'energy', 'component', '10', 'gev', 'does', 'not', 'allow', 'significant', 'constraints', 'on', 'variability', 'we', 'find', 'indications', 'however', 'for', 'spectral', 'changes', 'with', 'time', 'that', 'support', 'variability', 'of', 'the', 'putative', 'additional', 'component', 'and', 'seem', 'to', 'favor', 'jetrelated', 'scenarios', 'for', 'its', 'origin', 'capable', 'of', 'accommodating', 'monthtype', 'variability', 'conclusionsthe', 'current', 'findings', 'suggest', 'that', 'both', 'the', 'highenergy', 'eb', 'and', 'the', 'very', 'high', 'energy', 'vhe100', 'gev', 'emission', 'in', 'm87', 'are', 'compatible', 'with', 'originating', 'from', 'the', 'same', 'physical', 'component', 'the', 'variability', 'behaviour', 'at', 'vhe', 'then', 'allows', 'further', 'constraints', 'on', 'the', 'location', 'and', 'the', 'nature', 'of', 'the', 'second', 'component', 'in', 'particular', 'these', 'considerations', 'suggest', 'that', 'the', 'vhe', 'emission', 'during', 'the', 'quiescent', 'state', 'originates', 'in', 'a', 'similar', 'region', 'as', 'during', 'the', 'flare']] | [-0.05315844975141944, 0.13809918043794375, -0.06121348203885355, 0.16819962163234764, -0.0990029255088935, -0.08630524946889584, 0.048343578632541365, 0.4177070331930156, -0.2022732980123323, -0.38415407868898543, 0.05298912841037921, -0.30058462340710557, -0.005369082175910581, 0.2316893309665223, 0.009525048496615836, -0.037886410691577985, 0.0723099842434749, -0.039350783889779486, 0.0019792304161271295, -0.15219675750046482, 0.27676648528058256, 0.14406795062519528, 0.2217084963989876, 0.08550604392244629, 0.07513270950521869, -0.035889177550258035, -0.040381416220359664, -0.06899548076699316, -0.07060498275182064, 0.06830796106713524, 0.23443812119143514, 0.1054925314400453, 0.20307512988633328, -0.35237813157289277, -0.281363176575025, 0.11590696006770367, 0.15658434889105527, -0.017670126405774034, -0.045153797012365736, -0.2398814325721975, 0.06973384046442874, -0.18903442310925195, -0.16752687158515217, 0.023939167404972504, 0.03206374802992787, 0.009108685596257219, -0.19422420512621655, 0.12609197062092659, 0.03856697268075431, 0.07119602609874573, -0.13398924403620607, -0.112071885014513, -0.014770923996431942, 0.050480338508719615, 0.11093760065715827, 0.04895995755214244, 0.14203578342204454, -0.11912147181177768, -0.11917354424308607, 0.377517111577512, -0.06293305318863333, 0.017958557104988806, 0.21437646930470414, -0.19103709664162033, -0.21907931170088873, 0.20148605132303404, 0.1633832771077995, 0.06092674528506747, -0.14213224052245083, 0.02134196368106, -0.0016426759167992766, 0.22115148026563658, 0.0076238419126678746, 0.08217243818939281, 0.28644933810363105, 0.14638293572394448, 0.042914307717591575, 0.11262993672542085, -0.2268921141605487, -0.037697636996660774, -0.32576107737385546, -0.05768609170437507, -0.1233050607649299, 0.1039873859301514, -0.09800319576696484, -0.08099198044932353, 0.4509083290003996, 0.09410142137631487, 0.2511342405375309, 0.013757927352528803, 0.2778089124830845, 0.09084052236479086, 0.06227387636191333, 0.13425450306385756, 0.34219321337076364, 0.10475655903945258, 0.14357056128716542, -0.17026823252345438, 0.05897727422584928, -0.05447795902432847] |
1,802.03104 | Kinematic N-expansive flows | In light of the rich results of expansiveness in the dynamics of
diffeomorphisms, it is natural to consider another notions of expansiveness
such as countably-expansive, measure expansive, $N$-expansive and so on. In
this paper, we introduce the notion of $N$-expansiveness for flows on a
$C^{\infty}$ compact connected Riemannian manifold by using the kinematic
expansiveness which is extension of the $N$-expansive diffeomorphisms. And we
prove that a vector field $X$ on $M$ is $C^1$ robustly kinematic $N$-expansive
then $X$ satisfies quasi-Anosov. Furthermore, we consider the hyperbolicity of
local dynamical systems with kinematic $N$-expansiveness.
| math.DS | in light of the rich results of expansiveness in the dynamics of diffeomorphisms it is natural to consider another notions of expansiveness such as countablyexpansive measure expansive nexpansive and so on in this paper we introduce the notion of nexpansiveness for flows on a cinfty compact connected riemannian manifold by using the kinematic expansiveness which is extension of the nexpansive diffeomorphisms and we prove that a vector field x on m is c1 robustly kinematic nexpansive then x satisfies quasianosov furthermore we consider the hyperbolicity of local dynamical systems with kinematic nexpansiveness | [['in', 'light', 'of', 'the', 'rich', 'results', 'of', 'expansiveness', 'in', 'the', 'dynamics', 'of', 'diffeomorphisms', 'it', 'is', 'natural', 'to', 'consider', 'another', 'notions', 'of', 'expansiveness', 'such', 'as', 'countablyexpansive', 'measure', 'expansive', 'nexpansive', 'and', 'so', 'on', 'in', 'this', 'paper', 'we', 'introduce', 'the', 'notion', 'of', 'nexpansiveness', 'for', 'flows', 'on', 'a', 'cinfty', 'compact', 'connected', 'riemannian', 'manifold', 'by', 'using', 'the', 'kinematic', 'expansiveness', 'which', 'is', 'extension', 'of', 'the', 'nexpansive', 'diffeomorphisms', 'and', 'we', 'prove', 'that', 'a', 'vector', 'field', 'x', 'on', 'm', 'is', 'c1', 'robustly', 'kinematic', 'nexpansive', 'then', 'x', 'satisfies', 'quasianosov', 'furthermore', 'we', 'consider', 'the', 'hyperbolicity', 'of', 'local', 'dynamical', 'systems', 'with', 'kinematic', 'nexpansiveness']] | [-0.20130951084953908, 0.1078655121612598, -0.12629321246193007, 0.07370419567195023, -0.06158554950053548, -0.0911180326512984, -0.004380948819823891, 0.354259867464182, -0.28610376383249575, -0.18303622969600197, 0.11257580922696493, -0.25833290103045137, -0.15554032431772122, 0.1682466953035935, -0.14228314652291874, 0.037754756823223046, 0.01631615576999528, 0.09580078143831137, -0.09491254226304591, -0.17605519674175962, 0.45238257019401906, -0.07549785509971636, 0.17947313409544283, 0.06219584915715341, 0.17910752820035258, -0.00954675017907233, -0.009256350418941661, 0.08800281204825657, -0.17476214990725006, 0.11383411125535821, 0.18752054476875116, 0.13685793715406333, 0.2156732853010788, -0.31851999634610756, -0.22479946958412836, 0.13844616970067825, 0.10360029672405549, -0.026603825184373327, -0.03248899052774145, -0.33275726016938356, 0.1540090212403991, -0.11251941508521418, -0.17344505908121202, -0.10901654866820835, 0.05096664534149958, 0.02962056790980009, -0.24214908181802258, 0.04305461785950503, 0.1505332111651564, 0.12962390727025794, -0.04788618165344655, 0.017253151224864708, -0.0931728630771881, 0.07683679284425554, 0.027723469902571945, 0.07956696336495352, 0.1349897394724354, -0.042880940422477136, -0.06604913088933125, 0.3864314578381459, -0.11092104195171947, -0.2844301180550726, 0.2069159607162474, -0.16590016484158215, -0.23602293576062708, 0.06824752433573479, 0.19340561234627615, 0.16180570242967415, -0.124025095684024, 0.17949388356198773, -0.14362996510629142, 0.09528366068971682, 0.012497161883492392, 0.0478632268700544, 0.12590956499615868, 0.14437738413011636, 0.18905025110119483, 0.14414892184220582, -0.036369534682707635, -0.04732522318282953, -0.317964942573191, -0.18800338004603162, -0.10158502398017835, 0.13102599032540488, -0.08915101933762544, -0.16508826774104937, 0.36852353021175, 0.10148452577717822, 0.20417344562995893, 0.10435681109915354, 0.24071496360740818, 0.03467191014423516, 0.01376226529156646, 0.11304163529056606, 0.17563477424638613, 0.19435376283241906, 0.02122924392428863, -0.15373678031827803, 0.013553409381759363, 0.13462339506924645] |
1,802.03105 | Optimized Bacteria are Environmental Prediction Engines | Experimentalists have observed phenotypic variability in isogenic bacteria
populations. We explore the hypothesis that in fluctuating environments this
variability is tuned to maximize a bacterium's expected log growth rate,
potentially aided by epigenetic markers that store information about past
environments. We show that, in a complex, memoryful environment, the maximal
expected log growth rate is linear in the instantaneous predictive
information---the mutual information between a bacterium's epigenetic markers
and future environmental states. Hence, under resource constraints, optimal
epigenetic markers are causal states---the minimal sufficient statistics for
prediction. This is the minimal amount of information about the past needed to
predict the future as well as possible. We suggest new theoretical
investigations into and new experiments on bacteria phenotypic bet-hedging in
fluctuating complex environments.
| q-bio.PE cond-mat.stat-mech cs.IT math.IT nlin.AO | experimentalists have observed phenotypic variability in isogenic bacteria populations we explore the hypothesis that in fluctuating environments this variability is tuned to maximize a bacteriums expected log growth rate potentially aided by epigenetic markers that store information about past environments we show that in a complex memoryful environment the maximal expected log growth rate is linear in the instantaneous predictive informationthe mutual information between a bacteriums epigenetic markers and future environmental states hence under resource constraints optimal epigenetic markers are causal statesthe minimal sufficient statistics for prediction this is the minimal amount of information about the past needed to predict the future as well as possible we suggest new theoretical investigations into and new experiments on bacteria phenotypic bethedging in fluctuating complex environments | [['experimentalists', 'have', 'observed', 'phenotypic', 'variability', 'in', 'isogenic', 'bacteria', 'populations', 'we', 'explore', 'the', 'hypothesis', 'that', 'in', 'fluctuating', 'environments', 'this', 'variability', 'is', 'tuned', 'to', 'maximize', 'a', 'bacteriums', 'expected', 'log', 'growth', 'rate', 'potentially', 'aided', 'by', 'epigenetic', 'markers', 'that', 'store', 'information', 'about', 'past', 'environments', 'we', 'show', 'that', 'in', 'a', 'complex', 'memoryful', 'environment', 'the', 'maximal', 'expected', 'log', 'growth', 'rate', 'is', 'linear', 'in', 'the', 'instantaneous', 'predictive', 'informationthe', 'mutual', 'information', 'between', 'a', 'bacteriums', 'epigenetic', 'markers', 'and', 'future', 'environmental', 'states', 'hence', 'under', 'resource', 'constraints', 'optimal', 'epigenetic', 'markers', 'are', 'causal', 'statesthe', 'minimal', 'sufficient', 'statistics', 'for', 'prediction', 'this', 'is', 'the', 'minimal', 'amount', 'of', 'information', 'about', 'the', 'past', 'needed', 'to', 'predict', 'the', 'future', 'as', 'well', 'as', 'possible', 'we', 'suggest', 'new', 'theoretical', 'investigations', 'into', 'and', 'new', 'experiments', 'on', 'bacteria', 'phenotypic', 'bethedging', 'in', 'fluctuating', 'complex', 'environments']] | [-0.11898119316986307, 0.13717499370800285, -0.06852161472216552, 0.16016060854043296, -0.07235550785028352, -0.135418449343008, 0.09479205016940226, 0.3818281592528631, -0.26143813090808493, -0.2981196115876177, 0.08676523936695203, -0.25067645924665577, -0.19384038258283362, 0.1707907411595428, -0.14615217598564015, 0.036656626424472025, 0.04593199658836049, 0.016782158728295225, 0.045302649499466115, -0.24424841058084634, 0.22396304549997656, 0.11545852664763456, 0.3004127651400016, 0.025536918718788045, 0.10626023528506844, -0.025243274602524148, -0.05173194338567555, -0.01593337067103816, -0.16544084521468372, 0.11602831657432759, 0.32672163797163867, 0.22295099402573415, 0.30790136893832587, -0.4712902780440522, -0.2835660783831424, 0.1681666217471768, 0.12939241325967316, 0.1267851619267594, -0.05588450209650294, -0.24481699530913578, 0.04203372593350118, -0.12432942208568983, -0.0861030046305642, -0.06954485150735552, 0.043137071010603656, 0.011648716907607527, -0.2845755868508079, 0.12095817001120043, -0.021417152904148206, 0.10647405957333683, -0.07581357699932485, -0.0783867744920109, -0.06923861275957065, 0.17056933924086332, 0.04641716712442174, 0.011733555728077464, 0.22154741569202605, -0.1405941637723169, -0.13788288997531664, 0.28432456779339144, -0.042885071872468525, -0.1874756703864995, 0.20936312159235643, -0.15759150820549547, -0.12242774359647154, 0.09615982115662437, 0.23417776852005684, 0.08056006883081746, -0.20762738399680825, -0.007711466872209032, -0.0028309241577044006, 0.19119779828072683, 0.035001690198508344, 0.09795096546612166, 0.25617699126705407, 0.2144566451661228, 0.06048927626693697, 0.09067877560732811, -0.05232744920256782, -0.12456256452980034, -0.23098417882981703, -0.16182662228622088, -0.11650616874373178, 0.06066685649036331, -0.1014420005653292, -0.10180936773436342, 0.34476921378778735, 0.1570531887296167, 0.18173435691940953, 0.06444472355230492, 0.25215882090927383, 0.005139528943615686, 0.08264050132223988, 0.046782031869212905, 0.16293094898536195, 0.058578389896954436, 0.07000508746207972, -0.28858168710522897, 0.20768855744357623, -0.06827867214711822] |
1,802.03106 | Effects of Fano resonance on optical chirality of planar plasmonic
nanodevices | The effects of Fano resonance on the optical chirality of planar plasmonic
nanodevices in the visible wavelength range are experimentally observed and
theoretically explained. The nanodevice consists of a nanodisk at the center
with six gold nanorods with an orientation angle to exhibit optical chirality
under dark-field illumination. The chiral response induced by the gold nanorods
are affected by the presence of the nanodisk with different diameters which
causes Fano resonance. An intriguing change to the opposite selection
preference of different handedness of the circularly polarized light has been
clearly observed experimentally. This change of the preference is understood
based on the extended coupled oscillator model. Moreover, electrostatic
analysis and the time-dependent simulations provide a further understanding of
the phenomenon. The observed and understood effects of Fano resonance on
optical chirality enables effective manipulation of chiral characteristics of
planar subwavelength nanodevices.
| physics.optics | the effects of fano resonance on the optical chirality of planar plasmonic nanodevices in the visible wavelength range are experimentally observed and theoretically explained the nanodevice consists of a nanodisk at the center with six gold nanorods with an orientation angle to exhibit optical chirality under darkfield illumination the chiral response induced by the gold nanorods are affected by the presence of the nanodisk with different diameters which causes fano resonance an intriguing change to the opposite selection preference of different handedness of the circularly polarized light has been clearly observed experimentally this change of the preference is understood based on the extended coupled oscillator model moreover electrostatic analysis and the timedependent simulations provide a further understanding of the phenomenon the observed and understood effects of fano resonance on optical chirality enables effective manipulation of chiral characteristics of planar subwavelength nanodevices | [['the', 'effects', 'of', 'fano', 'resonance', 'on', 'the', 'optical', 'chirality', 'of', 'planar', 'plasmonic', 'nanodevices', 'in', 'the', 'visible', 'wavelength', 'range', 'are', 'experimentally', 'observed', 'and', 'theoretically', 'explained', 'the', 'nanodevice', 'consists', 'of', 'a', 'nanodisk', 'at', 'the', 'center', 'with', 'six', 'gold', 'nanorods', 'with', 'an', 'orientation', 'angle', 'to', 'exhibit', 'optical', 'chirality', 'under', 'darkfield', 'illumination', 'the', 'chiral', 'response', 'induced', 'by', 'the', 'gold', 'nanorods', 'are', 'affected', 'by', 'the', 'presence', 'of', 'the', 'nanodisk', 'with', 'different', 'diameters', 'which', 'causes', 'fano', 'resonance', 'an', 'intriguing', 'change', 'to', 'the', 'opposite', 'selection', 'preference', 'of', 'different', 'handedness', 'of', 'the', 'circularly', 'polarized', 'light', 'has', 'been', 'clearly', 'observed', 'experimentally', 'this', 'change', 'of', 'the', 'preference', 'is', 'understood', 'based', 'on', 'the', 'extended', 'coupled', 'oscillator', 'model', 'moreover', 'electrostatic', 'analysis', 'and', 'the', 'timedependent', 'simulations', 'provide', 'a', 'further', 'understanding', 'of', 'the', 'phenomenon', 'the', 'observed', 'and', 'understood', 'effects', 'of', 'fano', 'resonance', 'on', 'optical', 'chirality', 'enables', 'effective', 'manipulation', 'of', 'chiral', 'characteristics', 'of', 'planar', 'subwavelength', 'nanodevices']] | [-0.16737706440084793, 0.1710371820040209, -0.044280403831986885, -0.004671525277844663, -0.06115838170632826, -0.15802878080966307, 0.0030646035579819206, 0.48867274898084556, -0.222087451118104, -0.3248865099901215, -0.012675364562046073, -0.25696023658301076, -0.1952485549362733, 0.18254995059159235, 0.011319438801378224, 0.02902721789341869, -0.021515167577535653, -0.04346828387719116, -0.008790513791196735, -0.14650012960026687, 0.2703950275429227, 0.008081141505299585, 0.35881074885210246, 0.10892566191552683, 0.08681230722094312, 0.042846902163372315, 0.052815605034219455, 0.035788888494807776, -0.1059722467837525, 0.12124767458290918, 0.18529649360224287, -0.07316384638051984, 0.17828017151220998, -0.44264854322986824, -0.21044027409681404, 0.026018711057960563, 0.15870114672823366, 0.1328445298288427, -0.08122872223529357, -0.3063234617464667, 0.03477218943311179, -0.06859412261450841, -0.20161107846317775, -0.02286129212667439, -0.0038531523805560796, 0.007309704120700241, -0.2200369358414467, 0.05265384565618596, 0.06243698920308222, 0.12222009082820187, -0.04971973174614898, -0.07876710744627508, -0.07238654951162055, 0.06769843016179768, 0.017446599939527612, -0.03724238687815765, 0.21546453521884185, -0.12006244206873713, -0.1699547109570592, 0.37555651809254015, -0.0682636762387945, -0.14046507422572435, 0.13842036509192845, -0.19657885441589598, 0.005458275224445454, 0.19048795986471448, 0.16164482475080072, 0.1367668340160967, -0.12488539200375214, 0.029673136577938176, -0.05639250358196755, 0.17174488913551872, 0.13262841318806645, 0.09208267005754912, 0.2945234951239528, 0.207385777393422, 0.007208286279297256, 0.1539466741762342, -0.15263352525116652, -0.027849792403743624, -0.2204110740901942, -0.053895913473171915, -0.17843519106295938, 0.06278295841659189, -0.07218589052091046, -0.1618670398296775, 0.46286209844422677, 0.09756454860408467, 0.1762784188745398, -0.0848809388963215, 0.29346847494879197, 0.09414708823566688, 0.11438258049071681, -0.0800246375956381, 0.348690502662608, 0.1755443858738216, 0.08482831849960994, -0.34564446433486934, 0.07478411901570486, -0.060147454159611716] |
1,802.03107 | Accelerating CALYPSO Structure Prediction by Data-driven Learning of
Potential Energy Surface | Ab initio structure prediction methods have been nowadays widely used as
powerful tools for structure searches and material discovery. However, they are
generally restricted to small systems owing to the heavy computational cost of
underlying density functional theory (DFT) calculations. In this work, by
combining state-of-art machine learning (ML) potential with our in-house
developed CALYPSO structure prediction method, we developed two acceleration
schemes for structure prediction toward large systems, in which ML potential is
pre-constructed to fully replace DFT calculations or trained in an on-the-fly
manner from scratch during the structure searches. The developed schemes have
been applied to medium- and large-sized boron clusters, which are challenging
cases for both construction of ML potentials and extensive structure searches.
Experimental structures of B36 and B40 clusters can be readily reproduced, and
the putative global minimum structure for B84 cluster is proposed, where
substantially less computational cost by several orders of magnitude is evident
if compared with full DFT-based structure searches. Our results demonstrate a
viable route for structure prediction toward large systems via the combination
of state-of-art structure prediction methods and ML techniques.
| cond-mat.mtrl-sci | ab initio structure prediction methods have been nowadays widely used as powerful tools for structure searches and material discovery however they are generally restricted to small systems owing to the heavy computational cost of underlying density functional theory dft calculations in this work by combining stateofart machine learning ml potential with our inhouse developed calypso structure prediction method we developed two acceleration schemes for structure prediction toward large systems in which ml potential is preconstructed to fully replace dft calculations or trained in an onthefly manner from scratch during the structure searches the developed schemes have been applied to medium and largesized boron clusters which are challenging cases for both construction of ml potentials and extensive structure searches experimental structures of b36 and b40 clusters can be readily reproduced and the putative global minimum structure for b84 cluster is proposed where substantially less computational cost by several orders of magnitude is evident if compared with full dftbased structure searches our results demonstrate a viable route for structure prediction toward large systems via the combination of stateofart structure prediction methods and ml techniques | [['ab', 'initio', 'structure', 'prediction', 'methods', 'have', 'been', 'nowadays', 'widely', 'used', 'as', 'powerful', 'tools', 'for', 'structure', 'searches', 'and', 'material', 'discovery', 'however', 'they', 'are', 'generally', 'restricted', 'to', 'small', 'systems', 'owing', 'to', 'the', 'heavy', 'computational', 'cost', 'of', 'underlying', 'density', 'functional', 'theory', 'dft', 'calculations', 'in', 'this', 'work', 'by', 'combining', 'stateofart', 'machine', 'learning', 'ml', 'potential', 'with', 'our', 'inhouse', 'developed', 'calypso', 'structure', 'prediction', 'method', 'we', 'developed', 'two', 'acceleration', 'schemes', 'for', 'structure', 'prediction', 'toward', 'large', 'systems', 'in', 'which', 'ml', 'potential', 'is', 'preconstructed', 'to', 'fully', 'replace', 'dft', 'calculations', 'or', 'trained', 'in', 'an', 'onthefly', 'manner', 'from', 'scratch', 'during', 'the', 'structure', 'searches', 'the', 'developed', 'schemes', 'have', 'been', 'applied', 'to', 'medium', 'and', 'largesized', 'boron', 'clusters', 'which', 'are', 'challenging', 'cases', 'for', 'both', 'construction', 'of', 'ml', 'potentials', 'and', 'extensive', 'structure', 'searches', 'experimental', 'structures', 'of', 'b36', 'and', 'b40', 'clusters', 'can', 'be', 'readily', 'reproduced', 'and', 'the', 'putative', 'global', 'minimum', 'structure', 'for', 'b84', 'cluster', 'is', 'proposed', 'where', 'substantially', 'less', 'computational', 'cost', 'by', 'several', 'orders', 'of', 'magnitude', 'is', 'evident', 'if', 'compared', 'with', 'full', 'dftbased', 'structure', 'searches', 'our', 'results', 'demonstrate', 'a', 'viable', 'route', 'for', 'structure', 'prediction', 'toward', 'large', 'systems', 'via', 'the', 'combination', 'of', 'stateofart', 'structure', 'prediction', 'methods', 'and', 'ml', 'techniques']] | [-0.04448461543882501, 0.0264938305015196, -0.09171457779158808, 0.07037492357015324, -0.06359964547740234, -0.15365724968416924, 0.038416847780444095, 0.43795559007116686, -0.26937405965649164, -0.3632891236876066, 0.09341633041289502, -0.24629824015230023, -0.17162560171237892, 0.2016583191765636, 0.021621733696640028, 0.10772651218512393, 0.1187166680817257, -0.031705651541655, -0.0904311335397434, -0.2549187537758601, 0.23869583563710267, 0.12135454712200214, 0.31151090367379913, 0.021253300183401495, 0.017864049884367857, -0.015253788292674082, -0.008262248945986638, 0.05884190451726661, -0.11381674406648316, 0.1772296520616542, 0.28990053054352116, 0.10035219865052827, 0.26070822337591143, -0.454280024916343, -0.27066126168474614, 0.0289644618534002, 0.1515673784050415, 0.1328404957165041, -0.11016580138283853, -0.273843788429276, 0.12741620590971722, -0.18930926112775373, -0.08700638634899815, -0.16400792944285977, -0.01913887200618654, -0.004624150619857464, -0.23828929335526242, 0.05978836670548624, -0.044308075544444825, 0.046306373123925465, -0.07458364217066216, -0.18985066400932987, 0.005148035776033834, 0.08710693007662565, 0.015275161279682684, 0.05840967151919728, 0.14233043170303802, -0.1420575718710117, -0.15953709757093668, 0.400196008473778, -0.04529961508668059, -0.15330154243037925, 0.25257009971544025, -0.06745474766105142, -0.17670462218338398, 0.1392583563708915, 0.17857578652143313, 0.12419083395174571, -0.15943553193874022, 0.10725670378043695, 0.04541087466750069, 0.20029164126889965, 0.008542941100281346, -0.002181142333199035, 0.18684427751001778, 0.22991724949903214, 0.02036191518405698, 0.046211598125020306, -0.09598387408378575, -0.10408409885233166, -0.1720746830412811, -0.10456143766734366, -0.1665432086798259, -0.015481469704984473, -0.04548887835235391, -0.15026648271352994, 0.34480585805703323, 0.13846829299978747, 0.14774796293132458, 0.029991232303922977, 0.34026366824304666, 0.06288533876867515, 0.14785501135610413, 0.08421438776089676, 0.24586154443562377, 0.12113020640470415, 0.051294724827959805, -0.16655010074840162, 0.09845975688837755, 0.03749941837728269] |
1,802.03108 | Zero Forcing in Claw-Free Cubic Graphs | The zero forcing number of a simple graph, written $Z(G)$, is a NP-hard graph
invariant which is the result of the zero forcing color change rule. This graph
invariant has been heavily studied by linear algebraists, physicists, and graph
theorist. It's broad applicability and interesting combinatorial properties
have attracted the attention of many researchers. Of particular interest, is
that of bounding the zero forcing number from above. In this paper we show a
surprising relation between the zero forcing number of a graph and the
independence number of a graph, denoted $\alpha(G)$. Our main theorem states
that if $G \ne K_4$ is a connected, cubic, claw-free graph, then $Z(G) \le
\alpha(G) + 1$. This improves on best known upper bounds for $Z(G)$, as well as
known lower bounds on $\alpha(G)$. As a consequence of this result, if $G \ne
K_4$ is a connected, cubic, claw-free graph with order $n$, then $Z(G) \le
\frac{2}{5}n + 1$. Additionally, under the hypothesis of our main theorem, we
further show $Z(G) \le \alpha'(G)$, where $\alpha'(G)$ denotes the matching
number of $G$.
| math.CO | the zero forcing number of a simple graph written zg is a nphard graph invariant which is the result of the zero forcing color change rule this graph invariant has been heavily studied by linear algebraists physicists and graph theorist its broad applicability and interesting combinatorial properties have attracted the attention of many researchers of particular interest is that of bounding the zero forcing number from above in this paper we show a surprising relation between the zero forcing number of a graph and the independence number of a graph denoted alphag our main theorem states that if g ne k_4 is a connected cubic clawfree graph then zg le alphag 1 this improves on best known upper bounds for zg as well as known lower bounds on alphag as a consequence of this result if g ne k_4 is a connected cubic clawfree graph with order n then zg le frac25n 1 additionally under the hypothesis of our main theorem we further show zg le alphag where alphag denotes the matching number of g | [['the', 'zero', 'forcing', 'number', 'of', 'a', 'simple', 'graph', 'written', 'zg', 'is', 'a', 'nphard', 'graph', 'invariant', 'which', 'is', 'the', 'result', 'of', 'the', 'zero', 'forcing', 'color', 'change', 'rule', 'this', 'graph', 'invariant', 'has', 'been', 'heavily', 'studied', 'by', 'linear', 'algebraists', 'physicists', 'and', 'graph', 'theorist', 'its', 'broad', 'applicability', 'and', 'interesting', 'combinatorial', 'properties', 'have', 'attracted', 'the', 'attention', 'of', 'many', 'researchers', 'of', 'particular', 'interest', 'is', 'that', 'of', 'bounding', 'the', 'zero', 'forcing', 'number', 'from', 'above', 'in', 'this', 'paper', 'we', 'show', 'a', 'surprising', 'relation', 'between', 'the', 'zero', 'forcing', 'number', 'of', 'a', 'graph', 'and', 'the', 'independence', 'number', 'of', 'a', 'graph', 'denoted', 'alphag', 'our', 'main', 'theorem', 'states', 'that', 'if', 'g', 'ne', 'k_4', 'is', 'a', 'connected', 'cubic', 'clawfree', 'graph', 'then', 'zg', 'le', 'alphag', '1', 'this', 'improves', 'on', 'best', 'known', 'upper', 'bounds', 'for', 'zg', 'as', 'well', 'as', 'known', 'lower', 'bounds', 'on', 'alphag', 'as', 'a', 'consequence', 'of', 'this', 'result', 'if', 'g', 'ne', 'k_4', 'is', 'a', 'connected', 'cubic', 'clawfree', 'graph', 'with', 'order', 'n', 'then', 'zg', 'le', 'frac25n', '1', 'additionally', 'under', 'the', 'hypothesis', 'of', 'our', 'main', 'theorem', 'we', 'further', 'show', 'zg', 'le', 'alphag', 'where', 'alphag', 'denotes', 'the', 'matching', 'number', 'of', 'g']] | [-0.18663365066051482, 0.12798237932978995, -0.056337689050872414, 0.037566762021742764, -0.13674573962709732, -0.15286786873026617, 0.07243985987634265, 0.31937045311289175, -0.26866291048537405, -0.3373040153831244, 0.07138625540038837, -0.29086935824581556, -0.1610793610457248, 0.13725779090076684, -0.11486147485141243, 0.0002502906372371529, 0.056151263639330866, 0.14712325038654464, 0.04532695078627772, -0.2830377206272845, 0.26770735282717006, -0.05297031677195004, 0.21205202110776944, 0.11674386527489072, 0.06390237188232796, 0.0252721474266478, 0.020745645851961203, 0.0671150679886341, -0.22505375262923605, 0.05873685180974592, 0.2476556807277458, 0.17854248211719095, 0.2881537908874452, -0.3232460827380419, -0.15401372274649994, 0.21829686910579246, 0.13111938597368342, -0.006537583883452628, 0.002259867815300822, -0.19848007617252214, 0.15362647464232784, -0.18538092066134726, -0.0816282631829381, 0.020406846372144564, 0.11634186909800129, 0.011820357707994325, -0.27648451459194934, -0.0037624440980809077, 0.17388273892250644, 0.0718816369916645, 0.1140993409118216, -0.20874813302819217, -0.07238463338863636, 0.07480572818645409, -0.0020901302346361004, 0.08763390553849085, 0.057963236293622426, -0.11682841811329127, -0.11033039245222297, 0.36276769753545524, -0.05924678884247052, -0.11938921237497457, 0.14656828446845924, -0.13183872196158128, -0.23327328626731678, 0.08019647400027939, 0.09784228007708277, 0.16717262975339378, -0.03898761947240148, 0.20060764535629588, -0.17257148797490768, 0.12899212090830717, 0.12143694754157748, 0.018772187842322246, 0.10049422210215458, 0.14829491484378066, 0.1644754997108664, 0.1636113256504593, 0.01922985201967614, 0.06797027981241367, -0.3188942189514637, -0.06879277096845077, -0.30125506708930644, 0.08682456858190042, -0.1650430565058819, -0.15032226988114417, 0.3894003428465554, 0.11178073829971254, 0.16029931478202342, 0.12207761147791253, 0.2505313922251974, 0.08019841963491801, 0.015494123497711761, 0.15375599972371545, 0.1394194480297821, 0.28035108692544913, -0.03500321897545031, -0.15601578564116997, 0.05138199255668691, 0.14605969572705882] |
1,802.03109 | Understanding Chatbot-mediated Task Management | Effective task management is essential to successful team collaboration.
While the past decade has seen considerable innovation in systems that track
and manage group tasks, these innovations have typically been outside of the
principal communication channels: email, instant messenger, and group chat.
Teams formulate, discuss, refine, assign, and track the progress of their
collaborative tasks over electronic communication channels, yet they must leave
these channels to update their task-tracking tools, creating a source of
friction and inefficiency. To address this problem, we explore how bots might
be used to mediate task management for individuals and teams. We deploy a
prototype bot to eight different teams of information workers to help them
create, assign, and keep track of tasks, all within their main communication
channel. We derived seven insights for the design of future bots for
coordinating work.
| cs.HC | effective task management is essential to successful team collaboration while the past decade has seen considerable innovation in systems that track and manage group tasks these innovations have typically been outside of the principal communication channels email instant messenger and group chat teams formulate discuss refine assign and track the progress of their collaborative tasks over electronic communication channels yet they must leave these channels to update their tasktracking tools creating a source of friction and inefficiency to address this problem we explore how bots might be used to mediate task management for individuals and teams we deploy a prototype bot to eight different teams of information workers to help them create assign and keep track of tasks all within their main communication channel we derived seven insights for the design of future bots for coordinating work | [['effective', 'task', 'management', 'is', 'essential', 'to', 'successful', 'team', 'collaboration', 'while', 'the', 'past', 'decade', 'has', 'seen', 'considerable', 'innovation', 'in', 'systems', 'that', 'track', 'and', 'manage', 'group', 'tasks', 'these', 'innovations', 'have', 'typically', 'been', 'outside', 'of', 'the', 'principal', 'communication', 'channels', 'email', 'instant', 'messenger', 'and', 'group', 'chat', 'teams', 'formulate', 'discuss', 'refine', 'assign', 'and', 'track', 'the', 'progress', 'of', 'their', 'collaborative', 'tasks', 'over', 'electronic', 'communication', 'channels', 'yet', 'they', 'must', 'leave', 'these', 'channels', 'to', 'update', 'their', 'tasktracking', 'tools', 'creating', 'a', 'source', 'of', 'friction', 'and', 'inefficiency', 'to', 'address', 'this', 'problem', 'we', 'explore', 'how', 'bots', 'might', 'be', 'used', 'to', 'mediate', 'task', 'management', 'for', 'individuals', 'and', 'teams', 'we', 'deploy', 'a', 'prototype', 'bot', 'to', 'eight', 'different', 'teams', 'of', 'information', 'workers', 'to', 'help', 'them', 'create', 'assign', 'and', 'keep', 'track', 'of', 'tasks', 'all', 'within', 'their', 'main', 'communication', 'channel', 'we', 'derived', 'seven', 'insights', 'for', 'the', 'design', 'of', 'future', 'bots', 'for', 'coordinating', 'work']] | [-0.15998826494015864, 0.07400388560884441, -0.081854248426252, 0.06451840592575643, -0.14973130165462328, -0.21806480800596012, 0.1078393428298809, 0.45450642524177537, -0.257448164619478, -0.3903015748878448, 0.10905483465980711, -0.27797066603157233, -0.13657880529953056, 0.13738358364550068, -0.10822913521620006, 0.051179796238155925, 0.08165192284693201, 0.044548580618164337, 0.03735651277598021, -0.31127636657123836, 0.2833919955318218, 0.06741757594350287, 0.2776147538850851, 0.04519236507579027, 0.07952226745456915, 0.010519779061295968, -0.12162263942403062, -0.07009437669886906, -0.08546060818143279, 0.14029175597020452, 0.4109646354062373, 0.21008802263703033, 0.3432497084722854, -0.46096238676075113, -0.1959052215653869, 0.1155827312511118, 0.18412652589134215, 0.09041845686014686, -0.015605465947266887, -0.31931913135271955, 0.09000191605189363, -0.24222918613882297, -0.07448493194191114, -0.1172818818312782, 0.02752908895833089, -0.0010152416862718597, -0.20055388858514456, -0.03828955352283254, -0.011397759008960909, 0.06457299728165655, -0.02470244966645944, -0.11503641574424417, 0.033684499168028945, 0.32430095050949603, 0.07040339944240473, 0.0005916624684366124, 0.21135667208513684, -0.143570971699185, -0.1940004220848684, 0.3770537145490594, 0.0311880466675468, -0.12583233763272053, 0.21281140537757892, -0.036324538418043895, -0.1832117745960953, 0.06298009143895744, 0.2942446165731834, 0.040763988344491846, -0.2297599075074472, -0.02571618032251375, 0.014313135652200264, 0.16454478223878302, 0.04614785404684132, 0.03882091367182404, 0.22438335588691083, 0.17541784889694742, 0.08802987122737035, 0.06195967698123936, -0.008899153503187015, -0.09895844602108221, -0.16539623407366247, -0.16436619192416616, -0.09768553719229256, -0.01807767662788084, 0.006800201068151235, -0.06691456916536588, 0.3896892112816739, 0.20436334735987818, 0.1201235221892335, 0.04612773046520648, 0.3025289795854512, -0.01767355409067343, 0.12044239694066217, 0.10280076856125721, 0.19602908996646018, 0.04338016312206438, 0.17521693257988183, -0.19034308903193212, 0.10700822981016245, -0.04398823098253] |
1,802.0311 | The Effect of IoT New Features on Security and Privacy: New Threats,
Existing Solutions, and Challenges Yet to Be Solved | The future of Internet of Things (IoT) is already upon us. IoT applications
have been widely used in many field of social production and social living such
as healthcare, energy and industrial automation. While enjoying the convenience
and efficiency that IoT brings to us, new threats from IoT also have emerged.
There are increasing research works to ease these threats, but many problems
remain open. To better understand the essential reasons of new threats and the
challenges in current research, this survey first proposes the concept of "IoT
features". Then, the security and privacy effects of eight IoT new features
were discussed including the threats they cause, existing solutions and
challenges yet to be solved. To help researchers follow the up-to-date works in
this field, this paper finally illustrates the developing trend of IoT security
research and reveals how IoT features affect existing security research by
investigating most existing research works related to IoT security from 2013 to
2017.
| cs.CR | the future of internet of things iot is already upon us iot applications have been widely used in many field of social production and social living such as healthcare energy and industrial automation while enjoying the convenience and efficiency that iot brings to us new threats from iot also have emerged there are increasing research works to ease these threats but many problems remain open to better understand the essential reasons of new threats and the challenges in current research this survey first proposes the concept of iot features then the security and privacy effects of eight iot new features were discussed including the threats they cause existing solutions and challenges yet to be solved to help researchers follow the uptodate works in this field this paper finally illustrates the developing trend of iot security research and reveals how iot features affect existing security research by investigating most existing research works related to iot security from 2013 to 2017 | [['the', 'future', 'of', 'internet', 'of', 'things', 'iot', 'is', 'already', 'upon', 'us', 'iot', 'applications', 'have', 'been', 'widely', 'used', 'in', 'many', 'field', 'of', 'social', 'production', 'and', 'social', 'living', 'such', 'as', 'healthcare', 'energy', 'and', 'industrial', 'automation', 'while', 'enjoying', 'the', 'convenience', 'and', 'efficiency', 'that', 'iot', 'brings', 'to', 'us', 'new', 'threats', 'from', 'iot', 'also', 'have', 'emerged', 'there', 'are', 'increasing', 'research', 'works', 'to', 'ease', 'these', 'threats', 'but', 'many', 'problems', 'remain', 'open', 'to', 'better', 'understand', 'the', 'essential', 'reasons', 'of', 'new', 'threats', 'and', 'the', 'challenges', 'in', 'current', 'research', 'this', 'survey', 'first', 'proposes', 'the', 'concept', 'of', 'iot', 'features', 'then', 'the', 'security', 'and', 'privacy', 'effects', 'of', 'eight', 'iot', 'new', 'features', 'were', 'discussed', 'including', 'the', 'threats', 'they', 'cause', 'existing', 'solutions', 'and', 'challenges', 'yet', 'to', 'be', 'solved', 'to', 'help', 'researchers', 'follow', 'the', 'uptodate', 'works', 'in', 'this', 'field', 'this', 'paper', 'finally', 'illustrates', 'the', 'developing', 'trend', 'of', 'iot', 'security', 'research', 'and', 'reveals', 'how', 'iot', 'features', 'affect', 'existing', 'security', 'research', 'by', 'investigating', 'most', 'existing', 'research', 'works', 'related', 'to', 'iot', 'security', 'from', '2013', 'to', '2017']] | [-0.11897014460377044, -0.004595890509421533, -0.027030093293730757, 0.05395653990167632, -0.1806389032145552, -0.18308614801802914, 0.005762403196092906, 0.34630065676082605, -0.25038936892714725, -0.3609469422818683, 0.13117042886541347, -0.3295546619971312, -0.19885297332972335, 0.2561372244564389, -0.18235820943472097, 0.10205812288928519, 0.018559961450877804, -0.026268635055689257, 0.03323466308581871, -0.34376363080279, 0.3107126089012098, 0.05097328641586615, 0.3847036489150809, 0.16402068121780483, -0.014594647892803516, -0.07799151142160027, -0.08558714115492848, -0.02355086502074352, -0.1158907681414085, 0.2032744235200983, 0.4290704987489226, 0.27602354793877265, 0.40619874040965204, -0.4637450243246818, -0.22265437314559197, 0.08074986661708206, 0.20405673063740884, 0.0766919116070787, -0.10107802416332676, -0.35002638882029, 0.09435566438694408, -0.24071624937449704, -0.1694978512501426, -0.07985008711876851, 0.017463367004035356, 0.06030816961198448, -0.15045325832336015, -0.04443357265631247, 0.001399041141775794, 0.09616711270796287, -0.032640155951006326, -0.10784633035783263, 0.018024644114475394, 0.19937576724321776, 0.16151460809501345, -0.011061662734843462, 0.19127199812880102, -0.18120640404844574, -0.1582565762149463, 0.35405558617141264, 0.07172879607690522, -0.11000301426499144, 0.20183202753183227, -0.012845897292220415, -0.2381957698343966, 0.050277076261088766, 0.22125713872494843, 0.012337602969568732, -0.22349467975198753, 0.0739237361608817, 0.06205073860034628, 0.12038778696017363, 0.05060864634425292, 0.1054302364362275, 0.21498964031654522, 0.22250823779675946, 0.1179365439057854, 0.06262270706696962, -0.01568966749294093, -0.13220600833319737, -0.17198666532922233, -0.163930332991031, -0.084271650872656, 0.03130589529751864, -0.008654620723287083, -0.10882164871191266, 0.41933693407607153, 0.28934695099556595, 0.11183571730778441, -0.03909682615443408, 0.3815873704115573, 0.007747639713767893, 0.13700430121261087, 0.11169907913994302, 0.21992003519099745, 0.021515346107324994, 0.26702174900609227, -0.10606989566728754, 0.11292250167853755, -0.0706548427023673] |
1,802.03111 | Tunable Electronic Structure and Surface States in Rare Earth
Mono-Bismuthides with Partially Filled f Shell | Here we report the evolution of bulk band structure and surface states in
rare earth mono-bismuthides with partially filled f shell. Utilizing
synchrotron-based photoemission spectroscopy, we determined the
three-dimensional bulk band structure and identified the bulk band inversions
near the X points, which, according to the topological theory, could give rise
to nontrivial band topology with odd number of gapless topological surface
states. Near the surface Gamma bar point, no clear evidence for predicted
gapless topological surface state is observed due to its strong hybridization
with the bulk bands. Near the M bar point, the two surface states, due to
projections from two inequivalent bulk band inversions, interact and give rise
to two peculiar sets of gapped surface states. The bulk band inversions and
corresponding surface states can be tuned substantially by varying rare earth
elements, in good agreement with density-functional theory calculations
assuming local f electrons. Our study therefore establishes rare earth
mono-bismuthides as an interesting class of materials possessing tunable
electronic properties and magnetism, providing a promising platform to search
for novel properties in potentially correlated topological materials.
| cond-mat.mes-hall cond-mat.mtrl-sci | here we report the evolution of bulk band structure and surface states in rare earth monobismuthides with partially filled f shell utilizing synchrotronbased photoemission spectroscopy we determined the threedimensional bulk band structure and identified the bulk band inversions near the x points which according to the topological theory could give rise to nontrivial band topology with odd number of gapless topological surface states near the surface gamma bar point no clear evidence for predicted gapless topological surface state is observed due to its strong hybridization with the bulk bands near the m bar point the two surface states due to projections from two inequivalent bulk band inversions interact and give rise to two peculiar sets of gapped surface states the bulk band inversions and corresponding surface states can be tuned substantially by varying rare earth elements in good agreement with densityfunctional theory calculations assuming local f electrons our study therefore establishes rare earth monobismuthides as an interesting class of materials possessing tunable electronic properties and magnetism providing a promising platform to search for novel properties in potentially correlated topological materials | [['here', 'we', 'report', 'the', 'evolution', 'of', 'bulk', 'band', 'structure', 'and', 'surface', 'states', 'in', 'rare', 'earth', 'monobismuthides', 'with', 'partially', 'filled', 'f', 'shell', 'utilizing', 'synchrotronbased', 'photoemission', 'spectroscopy', 'we', 'determined', 'the', 'threedimensional', 'bulk', 'band', 'structure', 'and', 'identified', 'the', 'bulk', 'band', 'inversions', 'near', 'the', 'x', 'points', 'which', 'according', 'to', 'the', 'topological', 'theory', 'could', 'give', 'rise', 'to', 'nontrivial', 'band', 'topology', 'with', 'odd', 'number', 'of', 'gapless', 'topological', 'surface', 'states', 'near', 'the', 'surface', 'gamma', 'bar', 'point', 'no', 'clear', 'evidence', 'for', 'predicted', 'gapless', 'topological', 'surface', 'state', 'is', 'observed', 'due', 'to', 'its', 'strong', 'hybridization', 'with', 'the', 'bulk', 'bands', 'near', 'the', 'm', 'bar', 'point', 'the', 'two', 'surface', 'states', 'due', 'to', 'projections', 'from', 'two', 'inequivalent', 'bulk', 'band', 'inversions', 'interact', 'and', 'give', 'rise', 'to', 'two', 'peculiar', 'sets', 'of', 'gapped', 'surface', 'states', 'the', 'bulk', 'band', 'inversions', 'and', 'corresponding', 'surface', 'states', 'can', 'be', 'tuned', 'substantially', 'by', 'varying', 'rare', 'earth', 'elements', 'in', 'good', 'agreement', 'with', 'densityfunctional', 'theory', 'calculations', 'assuming', 'local', 'f', 'electrons', 'our', 'study', 'therefore', 'establishes', 'rare', 'earth', 'monobismuthides', 'as', 'an', 'interesting', 'class', 'of', 'materials', 'possessing', 'tunable', 'electronic', 'properties', 'and', 'magnetism', 'providing', 'a', 'promising', 'platform', 'to', 'search', 'for', 'novel', 'properties', 'in', 'potentially', 'correlated', 'topological', 'materials']] | [-0.16149667010435628, 0.2081224837942702, -0.05430442577020989, 0.05664904014524331, -0.054463995087684854, -0.15960912756207918, 0.11635613149652878, 0.3788384763058275, -0.2950699878453937, -0.3264684645484926, -0.008299632117592005, -0.33319823562115847, -0.1544127375792919, 0.14766915219240925, 0.02296646351977769, 0.013698371477463904, 0.020513909958794506, -0.07576889841455138, -0.1580028804038496, -0.12888150055013184, 0.2835034024487767, 0.036853593692002404, 0.27469102174638665, 0.06016177690794899, -0.03964990963383267, -0.025697729596868158, 0.05516360316089251, 0.03944152399680105, -0.16789089045487343, 0.08921889257326257, 0.27175676927177445, -0.07833838866661406, 0.14418145131009322, -0.46581761358926693, -0.2179755279328674, 0.027947446754357466, 0.08824379134716259, 0.08237687161179363, -0.08460941861719928, -0.3133029635478225, 0.07027500096915497, -0.10655247339099232, -0.1815084146309851, -0.10121339159151022, 0.012327815325827234, -0.097560248319577, -0.18499645002949466, 0.04848212026473549, 0.0012707779352139268, 0.09531625657849266, -0.1104117087198473, -0.13836955514788213, -0.17185573710206276, 0.07959578087967303, 0.05174404486056624, 0.04945466788097595, 0.1255868806788284, -0.08805256273481063, -0.10587797162847387, 0.392356537318685, -0.07878788380120468, -0.08833694257045863, 0.2625195802706811, -0.192232334593104, -0.08563475008381324, 0.21967031142363946, 0.11358356714352137, 0.08441443400871422, -0.0745785950741265, 0.10880715200489956, -0.027266932346133723, 0.14203805103542336, 0.02637815566526519, 0.14746942895156584, 0.32160478210134896, 0.1262743748129449, 0.08043817480146472, 0.09947228076699603, -0.13843577976610202, -0.0010542308394279746, -0.25260341455125146, -0.19723828518245784, -0.23252971049449925, 0.05947378303648697, -0.026622847030052476, -0.23687910730691833, 0.42745706000003136, 0.052313643995310286, 0.177998533180087, -0.06764556112013653, 0.1604695283057582, 0.07067880521838864, 0.029973195102583203, 0.08948487671797112, 0.23759532589982782, 0.17295978363189432, 0.009949257173058059, -0.24280594746168288, 0.0319760205819168, 0.023835373362008895] |
1,802.03112 | Asymptotic behavior of a free boundary problem for the growth of
multi-layer tumors in necrotic phase | In this paper we study a free boundary problem for the growth of multi-layer
tumors in necrotic phase. The tumor region is strip-like and divided into
necrotic region and proliferating region with two free boundaries. The upper
free boundary is tumor surface and governed by a Stefan condition. The lower
free boundary is the interface separating necrotic region from proliferating
region, its evolution is implicit and intrinsically governed by an obstacle
problem. We prove that the problem has a unique flat stationary solution, and
there exists a positive constant $\gamma_*$, such that the flat stationary
solution is asymptotically stable for cell-to-cell adhesiveness
$\gamma>\gamma_*$, and unstable for $0<\gamma<\gamma_*$.
| math.AP | in this paper we study a free boundary problem for the growth of multilayer tumors in necrotic phase the tumor region is striplike and divided into necrotic region and proliferating region with two free boundaries the upper free boundary is tumor surface and governed by a stefan condition the lower free boundary is the interface separating necrotic region from proliferating region its evolution is implicit and intrinsically governed by an obstacle problem we prove that the problem has a unique flat stationary solution and there exists a positive constant gamma_ such that the flat stationary solution is asymptotically stable for celltocell adhesiveness gammagamma_ and unstable for 0gammagamma_ | [['in', 'this', 'paper', 'we', 'study', 'a', 'free', 'boundary', 'problem', 'for', 'the', 'growth', 'of', 'multilayer', 'tumors', 'in', 'necrotic', 'phase', 'the', 'tumor', 'region', 'is', 'striplike', 'and', 'divided', 'into', 'necrotic', 'region', 'and', 'proliferating', 'region', 'with', 'two', 'free', 'boundaries', 'the', 'upper', 'free', 'boundary', 'is', 'tumor', 'surface', 'and', 'governed', 'by', 'a', 'stefan', 'condition', 'the', 'lower', 'free', 'boundary', 'is', 'the', 'interface', 'separating', 'necrotic', 'region', 'from', 'proliferating', 'region', 'its', 'evolution', 'is', 'implicit', 'and', 'intrinsically', 'governed', 'by', 'an', 'obstacle', 'problem', 'we', 'prove', 'that', 'the', 'problem', 'has', 'a', 'unique', 'flat', 'stationary', 'solution', 'and', 'there', 'exists', 'a', 'positive', 'constant', 'gamma_', 'such', 'that', 'the', 'flat', 'stationary', 'solution', 'is', 'asymptotically', 'stable', 'for', 'celltocell', 'adhesiveness', 'gammagamma_', 'and', 'unstable', 'for', '0gammagamma_']] | [-0.14888633707555654, 0.16809818566960139, -0.05778485469554908, 0.03777641060144127, -0.020070639064657354, -0.16172810037681293, 0.03725268309783608, 0.34439736724369857, -0.2742278890283865, -0.20324604088553688, 0.15780554587080223, -0.27239607302384955, -0.14972194565338232, 0.15226074406511594, -0.08075781884547714, 0.03458111750878063, 0.029413491470095154, -0.003942789736195145, 0.02426449544118526, -0.14549466738832034, 0.3726800954509004, -0.04159042195234204, 0.29986405448561587, 0.07045918847129584, 0.13321087189523556, -0.06519528422243545, 0.042991003019421874, 0.059309627061653186, -0.2355827524128999, 0.06835285374550933, 0.2452895479672806, 0.07238722871771414, 0.2977351951543416, -0.4106474914631554, -0.24406250636746116, 0.10902012128243659, 0.1918507941876686, 0.06636787655928703, -0.0766339019383195, -0.24633376119292785, 0.10563520479633987, -0.08710979880160157, -0.1561648339886114, 0.07276887428363628, 0.04169519258571667, -0.07682697502754751, -0.2773961284318634, 0.1497778475684958, 0.058805636678622146, 0.014113335528304348, -0.20553302676656293, -0.029119986074619762, -0.0818193973712275, 0.15392947404984839, 0.05233042914133136, 0.030687634703685816, 0.10928573166934129, -0.16571644188566395, 0.005492633425143208, 0.30075352937505345, -0.02040530478464283, -0.2376257053915864, 0.18701995940548238, -0.13889882502920717, -0.029191767788170096, 0.20642478078621151, 0.10479927788027257, 0.14842417977546846, -0.1304369299350498, 0.14231806820819903, -0.024817455817823447, 0.1474450317202745, 0.11332520945693984, -0.09479383372910599, 0.1853988704572989, 0.20843956381012904, 0.14624567833189445, 0.19823801691891957, -0.06671819828285305, -0.12931381614234683, -0.3122698408725593, -0.1778949198234722, -0.1347259460365243, 0.01051467735424777, -0.10534328998150261, -0.26718997974470954, 0.33249677129189925, -0.001502357508169017, 0.16212706129767315, 0.029052809211556042, 0.22570575640001553, 0.12420230070738314, -0.016481056132693295, 0.1270173812398217, 0.17575877050164146, 0.09572812683105678, 0.06496223518363783, -0.23537562759027372, 0.08594396157695033, 0.1163547066732301] |
1,802.03113 | Crowdsourcing: a new tool for policy-making? | Crowdsourcing is rapidly evolving and applied in situations where ideas,
labour, opinion or expertise of large groups of people are used. Crowdsourcing
is now used in various policy-making initiatives; however, this use has usually
focused on open collaboration platforms and specific stages of the policy
process, such as agenda-setting and policy evaluations. Other forms of
crowdsourcing have been neglected in policy-making, with a few exceptions. This
article examines crowdsourcing as a tool for policy-making, and explores the
nuances of the technology and its use and implications for different stages of
the policy process. The article addresses questions surrounding the role of
crowdsourcing and whether it can be considered as a policy tool or as a
technological enabler and investigates the current trends and future directions
of crowdsourcing.
Keywords: Crowdsourcing, Public Policy, Policy Instrument, Policy Tool,
Policy Process, Policy Cycle, Open Collaboration, Virtual Labour Markets,
Tournaments, Competition.
| cs.CY cs.HC | crowdsourcing is rapidly evolving and applied in situations where ideas labour opinion or expertise of large groups of people are used crowdsourcing is now used in various policymaking initiatives however this use has usually focused on open collaboration platforms and specific stages of the policy process such as agendasetting and policy evaluations other forms of crowdsourcing have been neglected in policymaking with a few exceptions this article examines crowdsourcing as a tool for policymaking and explores the nuances of the technology and its use and implications for different stages of the policy process the article addresses questions surrounding the role of crowdsourcing and whether it can be considered as a policy tool or as a technological enabler and investigates the current trends and future directions of crowdsourcing keywords crowdsourcing public policy policy instrument policy tool policy process policy cycle open collaboration virtual labour markets tournaments competition | [['crowdsourcing', 'is', 'rapidly', 'evolving', 'and', 'applied', 'in', 'situations', 'where', 'ideas', 'labour', 'opinion', 'or', 'expertise', 'of', 'large', 'groups', 'of', 'people', 'are', 'used', 'crowdsourcing', 'is', 'now', 'used', 'in', 'various', 'policymaking', 'initiatives', 'however', 'this', 'use', 'has', 'usually', 'focused', 'on', 'open', 'collaboration', 'platforms', 'and', 'specific', 'stages', 'of', 'the', 'policy', 'process', 'such', 'as', 'agendasetting', 'and', 'policy', 'evaluations', 'other', 'forms', 'of', 'crowdsourcing', 'have', 'been', 'neglected', 'in', 'policymaking', 'with', 'a', 'few', 'exceptions', 'this', 'article', 'examines', 'crowdsourcing', 'as', 'a', 'tool', 'for', 'policymaking', 'and', 'explores', 'the', 'nuances', 'of', 'the', 'technology', 'and', 'its', 'use', 'and', 'implications', 'for', 'different', 'stages', 'of', 'the', 'policy', 'process', 'the', 'article', 'addresses', 'questions', 'surrounding', 'the', 'role', 'of', 'crowdsourcing', 'and', 'whether', 'it', 'can', 'be', 'considered', 'as', 'a', 'policy', 'tool', 'or', 'as', 'a', 'technological', 'enabler', 'and', 'investigates', 'the', 'current', 'trends', 'and', 'future', 'directions', 'of', 'crowdsourcing', 'keywords', 'crowdsourcing', 'public', 'policy', 'policy', 'instrument', 'policy', 'tool', 'policy', 'process', 'policy', 'cycle', 'open', 'collaboration', 'virtual', 'labour', 'markets', 'tournaments', 'competition']] | [-0.0902279929117593, 0.069601653005022, -0.06317223049381314, 0.10581989000109214, -0.14696411286123506, -0.15006744469299096, 0.11837618358509794, 0.44545879796759724, -0.26755322972695306, -0.32040110861002274, 0.1611608737347686, -0.27176618633141153, -0.1732720774869524, 0.21991026032180205, -0.11223577681852326, 0.07655472496136934, 0.08413109443810679, 0.006517443837827607, 0.10794300313565357, -0.2609433854183769, 0.3362359983456908, 0.08199778303172287, 0.3480623775777369, 0.07132683042117892, 0.08019308855578508, -0.031802254561526216, -0.09760942756938301, -0.010919208722591738, -0.10233380730971152, 0.11152207329295168, 0.4125084642524997, 0.2626647842292074, 0.4554365827280977, -0.426124179148919, -0.14834404811390664, 0.079537783051707, 0.15320777108459033, 0.05217281955115701, -0.09053097547698537, -0.2956644209191101, 0.008730793296445594, -0.25533171965141005, -0.09038697117748223, -0.07312335029295454, 0.01592491979213202, 0.013743774671177699, -0.26775305637968577, -0.024875828364787446, -0.0054320245088167384, 0.14817905526812356, -0.028421740616155048, -0.13302776308679212, 0.046248473395268136, 0.2570717422808329, 0.13533613423131924, 0.04305301941967129, 0.1916063807319454, -0.1859553229503895, -0.22362301756359942, 0.403176259070839, 0.01702760577150812, -0.14327832147453542, 0.18258066128138836, -0.0494920101737578, -0.17906403779498722, -0.01837307253010469, 0.2444726508812443, 0.09639139074755654, -0.19699741362861983, 0.0572488445382763, -0.0013448440291191617, 0.11389591104242543, 0.04950651768531191, -0.015205737560579222, 0.19932224179860458, 0.2586381377090942, 0.08597552284043385, 0.09693719929503596, 0.03302175391063553, -0.1375929930100651, -0.172209858907106, -0.14920209136102602, -0.12203184192145422, 0.023860463370211832, -0.0501825400549011, -0.1019988387178435, 0.3581121742903982, 0.1719919036331703, 0.10158341533459773, -0.02095188628738644, 0.3088917632982747, 0.011396286646318813, 0.07849288533189755, 0.06792367036990209, 0.1520051475859898, -0.011593856290620689, 0.23727257763137657, -0.14188245441349964, 0.16700577259395424, -0.012212688760347154] |
1,802.03114 | Solitons, the Korteweg-de Vries equation with step boundary values and
pseudo-embedded eigenvalues | The Korteweg-deVries (KdV) equation with step boundary conditions is
considered, with an emphasis on soliton dynamics. When one or more initial
solitons are of sufficient size they can propagate through the step; in this
case the phase shift is calculated via the inverse scattering transform. On the
other hand, when the amplitude is too small they become trapped. In the trapped
case the transmission coefficient of the associated associated linear
Schr\"odinger equation can become large at a point exponentially close to the
continuous spectrum. This point is referred to as a {\it pseudo-embedded
eigenvalue}. Employing the inverse problem it is shown that the continuous
spectrum associated with a branch cut in the neighborhood of the
pseudo-embedded eigenvalue plays the role of discrete spectra, which in turn
leads to a trapped soliton in the KdV equation.
| nlin.SI | the kortewegdevries kdv equation with step boundary conditions is considered with an emphasis on soliton dynamics when one or more initial solitons are of sufficient size they can propagate through the step in this case the phase shift is calculated via the inverse scattering transform on the other hand when the amplitude is too small they become trapped in the trapped case the transmission coefficient of the associated associated linear schrodinger equation can become large at a point exponentially close to the continuous spectrum this point is referred to as a it pseudoembedded eigenvalue employing the inverse problem it is shown that the continuous spectrum associated with a branch cut in the neighborhood of the pseudoembedded eigenvalue plays the role of discrete spectra which in turn leads to a trapped soliton in the kdv equation | [['the', 'kortewegdevries', 'kdv', 'equation', 'with', 'step', 'boundary', 'conditions', 'is', 'considered', 'with', 'an', 'emphasis', 'on', 'soliton', 'dynamics', 'when', 'one', 'or', 'more', 'initial', 'solitons', 'are', 'of', 'sufficient', 'size', 'they', 'can', 'propagate', 'through', 'the', 'step', 'in', 'this', 'case', 'the', 'phase', 'shift', 'is', 'calculated', 'via', 'the', 'inverse', 'scattering', 'transform', 'on', 'the', 'other', 'hand', 'when', 'the', 'amplitude', 'is', 'too', 'small', 'they', 'become', 'trapped', 'in', 'the', 'trapped', 'case', 'the', 'transmission', 'coefficient', 'of', 'the', 'associated', 'associated', 'linear', 'schrodinger', 'equation', 'can', 'become', 'large', 'at', 'a', 'point', 'exponentially', 'close', 'to', 'the', 'continuous', 'spectrum', 'this', 'point', 'is', 'referred', 'to', 'as', 'a', 'it', 'pseudoembedded', 'eigenvalue', 'employing', 'the', 'inverse', 'problem', 'it', 'is', 'shown', 'that', 'the', 'continuous', 'spectrum', 'associated', 'with', 'a', 'branch', 'cut', 'in', 'the', 'neighborhood', 'of', 'the', 'pseudoembedded', 'eigenvalue', 'plays', 'the', 'role', 'of', 'discrete', 'spectra', 'which', 'in', 'turn', 'leads', 'to', 'a', 'trapped', 'soliton', 'in', 'the', 'kdv', 'equation']] | [-0.13430301662485458, 0.1333491252044862, -0.09935628206826243, 0.07366738234702638, -0.07043983036463142, -0.1478881628140527, -0.029981013768198516, 0.3550819622114637, -0.3030357024666531, -0.2082826490969138, 0.15930284694085753, -0.3093768783225293, -0.1343423597903264, 0.18690822985639474, -0.007226192247983825, 0.06701962205518346, 0.08257944421156456, 0.1118707746141275, -0.026880156213795782, -0.1915347004743447, 0.34383466621139613, 0.04674765378362814, 0.2674796694427505, 0.02747443881011883, 0.06282685348532982, -0.01054517746223767, 0.018824518610954397, -0.016202240601125965, -0.09488708843395886, 0.06928494097437374, 0.22545744214536048, 0.012757011965841503, 0.27429096790772856, -0.41802711167225715, -0.21949965163673224, 0.14819614199879474, 0.19740741302721426, 0.13771186363130555, -0.03889290571855679, -0.2762232544443297, 0.04781550410224643, -0.08671169350609968, -0.2094224608552299, 0.00037705848086275217, 0.020749102507654885, 0.012560889208899405, -0.24875573658461408, 0.10444891195100053, 0.0648453165041773, -0.03225165966870193, -0.07173439157300425, -0.06278081990680412, -0.06689547819848683, 0.06857337960947123, 0.04164974223927392, 0.01719736065925624, 0.07432086763665416, -0.13622834134664863, -0.008478596225324878, 0.4127055653335905, -0.07950372441454713, -0.25285611335972424, 0.15772799016466657, -0.12495506565345633, -0.07932769269612443, 0.16099601047449655, 0.1479618932414604, 0.12573327637396584, -0.09062830838169098, 0.1074392371355815, -0.017918448053174336, 0.16395575115395905, 0.10738675356177348, 0.0104408893047979, 0.18831463630094117, 0.1537951061369053, 0.13297674718445965, 0.1612986229343473, -0.07479525900216549, -0.15136806318830504, -0.29956323605843055, -0.11800176265152325, -0.19194061186556755, 0.05692761718414556, -0.0670080910107695, -0.18747656127850218, 0.3680488732818486, 0.08015393887653499, 0.23189690960501147, -0.013661316889198147, 0.24776272935078555, 0.26199593107588937, 0.06317048321681139, 0.06447203175857999, 0.22743909712180607, 0.1474265669213426, 0.13121811939487443, -0.27091633981002733, 0.008801987828840887, 0.11022423015543281] |
1,802.03115 | Implicit complexity via structure transformation | Implicit computational complexity, which aims at characterizing complexity
classes by machine-independent means, has traditionally been based, on the one
hand, on programs and deductive formalisms for free algebras, and on the other
hand on descriptive tools for finite structures.
We consider here "uninterpreted" programs for the transformation of finite
structures, which define functions over a free algebra A once the elements of A
are themselves considered as finite structures. We thus bridge the gap between
the two approaches above to implicit complexity, with the potential of
streamlining and clarifying important tools and techniques, such as
set-existence and ramification.
We illustrate this potential by delineating a broad class of programs, based
on the notion of loop variant familiar from imperative program construction,
that characterizes a generic notion of primitive-recursive complexity, without
reference to any data-driven recurrence.
| cs.LO | implicit computational complexity which aims at characterizing complexity classes by machineindependent means has traditionally been based on the one hand on programs and deductive formalisms for free algebras and on the other hand on descriptive tools for finite structures we consider here uninterpreted programs for the transformation of finite structures which define functions over a free algebra a once the elements of a are themselves considered as finite structures we thus bridge the gap between the two approaches above to implicit complexity with the potential of streamlining and clarifying important tools and techniques such as setexistence and ramification we illustrate this potential by delineating a broad class of programs based on the notion of loop variant familiar from imperative program construction that characterizes a generic notion of primitiverecursive complexity without reference to any datadriven recurrence | [['implicit', 'computational', 'complexity', 'which', 'aims', 'at', 'characterizing', 'complexity', 'classes', 'by', 'machineindependent', 'means', 'has', 'traditionally', 'been', 'based', 'on', 'the', 'one', 'hand', 'on', 'programs', 'and', 'deductive', 'formalisms', 'for', 'free', 'algebras', 'and', 'on', 'the', 'other', 'hand', 'on', 'descriptive', 'tools', 'for', 'finite', 'structures', 'we', 'consider', 'here', 'uninterpreted', 'programs', 'for', 'the', 'transformation', 'of', 'finite', 'structures', 'which', 'define', 'functions', 'over', 'a', 'free', 'algebra', 'a', 'once', 'the', 'elements', 'of', 'a', 'are', 'themselves', 'considered', 'as', 'finite', 'structures', 'we', 'thus', 'bridge', 'the', 'gap', 'between', 'the', 'two', 'approaches', 'above', 'to', 'implicit', 'complexity', 'with', 'the', 'potential', 'of', 'streamlining', 'and', 'clarifying', 'important', 'tools', 'and', 'techniques', 'such', 'as', 'setexistence', 'and', 'ramification', 'we', 'illustrate', 'this', 'potential', 'by', 'delineating', 'a', 'broad', 'class', 'of', 'programs', 'based', 'on', 'the', 'notion', 'of', 'loop', 'variant', 'familiar', 'from', 'imperative', 'program', 'construction', 'that', 'characterizes', 'a', 'generic', 'notion', 'of', 'primitiverecursive', 'complexity', 'without', 'reference', 'to', 'any', 'datadriven', 'recurrence']] | [-0.08422896511002823, 0.0623233042792172, -0.11034013106158577, 0.1217751193194671, -0.12669564025210484, -0.14465353627780214, 0.06656114474863262, 0.3435947477215327, -0.3142360491412027, -0.304464900242935, 0.1165556081455145, -0.23204972092902526, -0.14741464930863768, 0.2356460760557618, -0.07183388778169576, 0.0714003963788089, 0.00915539995732164, 0.04740463978701964, -0.10946109176865478, -0.20128926109956732, 0.39306249578756497, 0.02523989432589396, 0.259048730464078, 0.044532314251015954, 0.11307476383037174, 0.04205279599847202, -0.05147609778826958, 0.0767123033957822, -0.1292762171175209, 0.15783442817961, 0.28510423078502817, 0.17770824264699972, 0.32001754946838645, -0.41566615743576585, -0.18913326936899125, 0.07613271612610976, 0.11612385563566384, 0.09415917499235978, -0.02614435507947425, -0.2518778586746159, 0.07669360761852809, -0.15099457267556282, -0.0842190226960115, -0.08410669295327332, 0.012970800893171165, 0.035818674815188446, -0.19447336110979654, -0.046501887431706315, 0.0828100757890458, 0.1320993508023203, -0.03624053165680708, -0.1174927154920043, 0.0035539321527865374, 0.11270404762161293, -0.008897122465725289, -0.021711027155161128, 0.08374922318187983, -0.10679328136489187, -0.1744760919845474, 0.36556998630495446, -0.02857196618298671, -0.2206807326301372, 0.24459169531955308, -0.07702216519308942, -0.19189974104572452, 0.08691997566309415, 0.14802537507664665, 0.11531164064387181, -0.11610442809620522, 0.14955927717063533, -0.01398854105404221, 0.1623616960473863, 0.06492662369938833, 0.0397814122952969, 0.1797021715586683, 0.1615716479403576, 0.06383938958896394, 0.15303007000750912, 0.028098100494362302, -0.10399962246901166, -0.3095725311694625, -0.18225718518439854, -0.12106427614913232, -0.005964348477808605, -0.06190266633348074, -0.20661383906477376, 0.39449254313441817, 0.1306380213105253, 0.14210114474023194, 0.12260464539478316, 0.31841041882088256, 0.08782446280268855, 0.12124582940250411, 0.05018815882433962, 0.11856036263612568, 0.1310961791104112, 0.051102360755142136, -0.18029453268859366, 0.08701788382499683, 0.13464398845273973] |
1,802.03116 | Zero-Resource Neural Machine Translation with Multi-Agent Communication
Game | While end-to-end neural machine translation (NMT) has achieved notable
success in the past years in translating a handful of resource-rich language
pairs, it still suffers from the data scarcity problem for low-resource
language pairs and domains. To tackle this problem, we propose an interactive
multimodal framework for zero-resource neural machine translation. Instead of
being passively exposed to large amounts of parallel corpora, our learners
(implemented as encoder-decoder architecture) engage in cooperative image
description games, and thus develop their own image captioning or neural
machine translation model from the need to communicate in order to succeed at
the game. Experimental results on the IAPR-TC12 and Multi30K datasets show that
the proposed learning mechanism significantly improves over the
state-of-the-art methods.
| cs.CL | while endtoend neural machine translation nmt has achieved notable success in the past years in translating a handful of resourcerich language pairs it still suffers from the data scarcity problem for lowresource language pairs and domains to tackle this problem we propose an interactive multimodal framework for zeroresource neural machine translation instead of being passively exposed to large amounts of parallel corpora our learners implemented as encoderdecoder architecture engage in cooperative image description games and thus develop their own image captioning or neural machine translation model from the need to communicate in order to succeed at the game experimental results on the iaprtc12 and multi30k datasets show that the proposed learning mechanism significantly improves over the stateoftheart methods | [['while', 'endtoend', 'neural', 'machine', 'translation', 'nmt', 'has', 'achieved', 'notable', 'success', 'in', 'the', 'past', 'years', 'in', 'translating', 'a', 'handful', 'of', 'resourcerich', 'language', 'pairs', 'it', 'still', 'suffers', 'from', 'the', 'data', 'scarcity', 'problem', 'for', 'lowresource', 'language', 'pairs', 'and', 'domains', 'to', 'tackle', 'this', 'problem', 'we', 'propose', 'an', 'interactive', 'multimodal', 'framework', 'for', 'zeroresource', 'neural', 'machine', 'translation', 'instead', 'of', 'being', 'passively', 'exposed', 'to', 'large', 'amounts', 'of', 'parallel', 'corpora', 'our', 'learners', 'implemented', 'as', 'encoderdecoder', 'architecture', 'engage', 'in', 'cooperative', 'image', 'description', 'games', 'and', 'thus', 'develop', 'their', 'own', 'image', 'captioning', 'or', 'neural', 'machine', 'translation', 'model', 'from', 'the', 'need', 'to', 'communicate', 'in', 'order', 'to', 'succeed', 'at', 'the', 'game', 'experimental', 'results', 'on', 'the', 'iaprtc12', 'and', 'multi30k', 'datasets', 'show', 'that', 'the', 'proposed', 'learning', 'mechanism', 'significantly', 'improves', 'over', 'the', 'stateoftheart', 'methods']] | [-0.03951151399180675, -0.013133575151645595, -0.01794585794544755, 0.07870918579109044, -0.12842332806167567, -0.21901980954278102, 0.05071796355152137, 0.47529696450274217, -0.3112947702065556, -0.3523723184903208, 0.008945861271120863, -0.27832255740132594, -0.12655751388042402, 0.20750140622218385, -0.18901229257353097, 0.09943163210454468, 0.19210700412145537, 0.06576676023765825, -0.01487618866779555, -0.33118349423584265, 0.298677559561916, -0.0031719268856840767, 0.402191433044644, 0.0028220093132466334, 0.15629829773301274, -0.03852081806279528, 0.0034091788315230138, -0.08756823741838846, -0.015308393137920031, 0.21252787051947278, 0.3677225278961098, 0.2589652277011838, 0.36552603315944093, -0.4238389842849002, -0.22979442227400967, 0.09215552269473162, 0.17933551187260857, 0.1424255151229236, -0.07382920105109772, -0.3625352690155562, 0.09729104494461073, -0.20467648501348737, 0.07585069601240958, -0.1495251202663311, -0.025020638178301673, -0.06208613523705982, -0.2415847665705901, -0.01645714397199898, 0.14323424535174656, 0.12628696269045273, -0.04283353978863511, -0.0788303434721425, 0.06982059146150246, 0.15522980556075072, 0.07581983327280539, 0.1494419179044855, 0.11750534072152188, -0.21996538681535321, -0.19103530851694253, 0.38149983435869217, -0.06965626237921926, -0.2042149232310426, 0.23734701729208454, 0.01693738071829017, -0.16987629208522728, 0.07383332169081411, 0.2715886365940683, 0.08902023959522828, -0.16788600047286123, 0.04803660974696549, -0.038357366919199117, 0.21546946336718228, 0.06267979854128809, -0.03524703487483227, 0.2079096996378647, 0.27811025775586945, -0.02148199171369147, 0.1260110197417661, -0.06459524573033883, -0.12332946133131209, -0.13255639813649348, -0.08700605282066469, -0.1587312850687239, -0.03628008231584333, -0.03575163832470142, -0.10521046772129579, 0.36398356984186375, 0.23324350949424583, 0.16710126595014435, 0.17248318067345864, 0.3622399501852755, -0.030659317194173735, 0.17969655376683888, 0.10625371155448449, 0.16301863133493397, -0.02628144149421754, 0.2056146738662695, -0.15744916375519502, 0.08903539640446886, 0.022689223918331485] |
1,802.03117 | The Maximum Flux of Star-Forming Galaxies | The importance of radiation pressure feedback in galaxy formation has been
extensively debated over the last decade. The regime of greatest uncertainty is
in the most actively star-forming galaxies, where large dust columns can
potentially produce a dust-reprocessed infrared radiation field with enough
pressure to drive turbulence or eject material. Here we derive the conditions
under which a self-gravitating, mixed gas-star disc can remain hydrostatic
despite trapped radiation pressure. Consistently taking into account the
self-gravity of the medium, the star- and dust-to-gas ratios, and the effects
of turbulent motions not driven by radiation, we show that galaxies can achieve
a maximum Eddington-limited star formation rate per unit area
$\dot{\Sigma}_{\rm *,crit} \sim 10^3 M_{\odot}$ pc$^{-2}$ Myr$^{-1}$,
corresponding to a critical flux of $F_{\rm *,crit} \sim 10^{13} L_{\odot}$
kpc$^{-2}$ similar to previous estimates; higher fluxes eject mass in bulk,
halting further star formation. Conversely, we show that in galaxies below this
limit, our one-dimensional models imply simple vertical hydrostatic equilibrium
and that radiation pressure is ineffective at driving turbulence or ejecting
matter. Because the vast majority of star-forming galaxies lie below the
maximum limit for typical dust-to-gas ratios, we conclude that infrared
radiation pressure is likely unimportant for all but the most extreme systems
on galaxy-wide scales. Thus, while radiation pressure does not explain the
Kennicutt-Schmidt relation, it does impose an upper truncation on it. Our
predicted truncation is in good agreement with the highest observed gas and
star formation rate surface densities found both locally and at high redshift.
| astro-ph.GA | the importance of radiation pressure feedback in galaxy formation has been extensively debated over the last decade the regime of greatest uncertainty is in the most actively starforming galaxies where large dust columns can potentially produce a dustreprocessed infrared radiation field with enough pressure to drive turbulence or eject material here we derive the conditions under which a selfgravitating mixed gasstar disc can remain hydrostatic despite trapped radiation pressure consistently taking into account the selfgravity of the medium the star and dusttogas ratios and the effects of turbulent motions not driven by radiation we show that galaxies can achieve a maximum eddingtonlimited star formation rate per unit area dotsigma_rm crit sim 103 m_odot pc2 myr1 corresponding to a critical flux of f_rm crit sim 1013 l_odot kpc2 similar to previous estimates higher fluxes eject mass in bulk halting further star formation conversely we show that in galaxies below this limit our onedimensional models imply simple vertical hydrostatic equilibrium and that radiation pressure is ineffective at driving turbulence or ejecting matter because the vast majority of starforming galaxies lie below the maximum limit for typical dusttogas ratios we conclude that infrared radiation pressure is likely unimportant for all but the most extreme systems on galaxywide scales thus while radiation pressure does not explain the kennicuttschmidt relation it does impose an upper truncation on it our predicted truncation is in good agreement with the highest observed gas and star formation rate surface densities found both locally and at high redshift | [['the', 'importance', 'of', 'radiation', 'pressure', 'feedback', 'in', 'galaxy', 'formation', 'has', 'been', 'extensively', 'debated', 'over', 'the', 'last', 'decade', 'the', 'regime', 'of', 'greatest', 'uncertainty', 'is', 'in', 'the', 'most', 'actively', 'starforming', 'galaxies', 'where', 'large', 'dust', 'columns', 'can', 'potentially', 'produce', 'a', 'dustreprocessed', 'infrared', 'radiation', 'field', 'with', 'enough', 'pressure', 'to', 'drive', 'turbulence', 'or', 'eject', 'material', 'here', 'we', 'derive', 'the', 'conditions', 'under', 'which', 'a', 'selfgravitating', 'mixed', 'gasstar', 'disc', 'can', 'remain', 'hydrostatic', 'despite', 'trapped', 'radiation', 'pressure', 'consistently', 'taking', 'into', 'account', 'the', 'selfgravity', 'of', 'the', 'medium', 'the', 'star', 'and', 'dusttogas', 'ratios', 'and', 'the', 'effects', 'of', 'turbulent', 'motions', 'not', 'driven', 'by', 'radiation', 'we', 'show', 'that', 'galaxies', 'can', 'achieve', 'a', 'maximum', 'eddingtonlimited', 'star', 'formation', 'rate', 'per', 'unit', 'area', 'dotsigma_rm', 'crit', 'sim', '103', 'm_odot', 'pc2', 'myr1', 'corresponding', 'to', 'a', 'critical', 'flux', 'of', 'f_rm', 'crit', 'sim', '1013', 'l_odot', 'kpc2', 'similar', 'to', 'previous', 'estimates', 'higher', 'fluxes', 'eject', 'mass', 'in', 'bulk', 'halting', 'further', 'star', 'formation', 'conversely', 'we', 'show', 'that', 'in', 'galaxies', 'below', 'this', 'limit', 'our', 'onedimensional', 'models', 'imply', 'simple', 'vertical', 'hydrostatic', 'equilibrium', 'and', 'that', 'radiation', 'pressure', 'is', 'ineffective', 'at', 'driving', 'turbulence', 'or', 'ejecting', 'matter', 'because', 'the', 'vast', 'majority', 'of', 'starforming', 'galaxies', 'lie', 'below', 'the', 'maximum', 'limit', 'for', 'typical', 'dusttogas', 'ratios', 'we', 'conclude', 'that', 'infrared', 'radiation', 'pressure', 'is', 'likely', 'unimportant', 'for', 'all', 'but', 'the', 'most', 'extreme', 'systems', 'on', 'galaxywide', 'scales', 'thus', 'while', 'radiation', 'pressure', 'does', 'not', 'explain', 'the', 'kennicuttschmidt', 'relation', 'it', 'does', 'impose', 'an', 'upper', 'truncation', 'on', 'it', 'our', 'predicted', 'truncation', 'is', 'in', 'good', 'agreement', 'with', 'the', 'highest', 'observed', 'gas', 'and', 'star', 'formation', 'rate', 'surface', 'densities', 'found', 'both', 'locally', 'and', 'at', 'high', 'redshift']] | [-0.09979414432483956, 0.18181099474501017, -0.03565075469621823, 0.10172227735731088, -0.05388842332026043, -0.0422242579864798, 0.03793973414800488, 0.39796637702801146, -0.1671087055312477, -0.32629852140744625, 0.05297997896418141, -0.2470029390639501, 0.003422705910021537, 0.1973908390248428, -0.045973132329103106, -0.025825082285797246, 0.004678748749754569, -0.06369127170748345, -0.04540736344872704, -0.2710199073854427, 0.29882644092699945, 0.1108738118217059, 0.21886243638563674, 0.04228590955502478, 0.06975990795409721, -0.16069963688468222, 0.00492819826950994, -0.013862771893142598, -0.20935679983400912, -0.03875765326312226, 0.21840125730380272, 0.08009126982161481, 0.26625235423894394, -0.41575439787481117, -0.267967799075159, 0.10598172761145451, 0.20691075992227537, 0.041648308155013754, -0.09222904354266008, -0.16836550944533787, 0.06937285143126043, -0.2080397267631719, -0.13152232259391292, 0.029607306680404524, 0.05524496202166701, 0.006699608784615355, -0.2627225439436545, 0.19322897357722887, 0.04235853753448558, 0.02916221397960472, -0.13331018009238127, -0.07162504124753026, -0.10825392783163229, 0.03045080789187659, 0.034015414658047805, 0.1035449889437616, 0.2770039250834766, -0.18560984511887993, 0.04898745821871859, 0.42787375776210296, -0.06313194909513842, -0.03541851435836993, 0.2445436696416363, -0.26644405713568814, -0.1460875983916502, 0.20391652110854713, 0.13707099706811174, 0.09575958351080537, -0.12732312508219162, -0.00800829367294553, -0.010410173370046655, 0.22728105172454116, 0.0685525659649908, 0.03365810846169088, 0.34381868442339514, 0.10945181272898495, 0.051757437045504964, 0.06142006567132618, -0.14062052775129133, -0.05976534966588669, -0.23089531012377154, -0.08665491341163596, -0.11916528243301927, 0.11557290883631603, -0.1407385232067372, -0.09538331897910458, 0.22978513401288253, 0.1636068854209503, 0.199887703991069, 0.07851639375710852, 0.3138522293724059, 0.13518578708944803, 0.11961043896417507, 0.1743473837402864, 0.3285557494728792, 0.18168953909757377, 0.04743754689116031, -0.2640296007103102, 0.07926642819239875, 0.0019406668743097905] |
1,802.03118 | Cryogenic Trapped-Ion System for Large Scale Quantum Simulation | We present a cryogenic ion trapping system designed for large scale quantum
simulation of spin models. Our apparatus is based on a segmented-blade ion trap
enclosed in a 4 K cryostat, which enables us to routinely trap over 100
$^{171}$Yb$^+$ ions in a linear configuration for hours due to a low background
gas pressure from differential cryo-pumping. We characterize the cryogenic
vacuum by using trapped ion crystals as a pressure gauge, measuring both
inelastic and elastic collision rates with the molecular background gas. We
demonstrate nearly equidistant ion spacing for chains of up to 44 ions using
anharmonic axial potentials. This reliable production and lifetime enhancement
of large linear ion chains will enable quantum simulation of spin models that
are intractable with classical computer modelling.
| quant-ph physics.atom-ph | we present a cryogenic ion trapping system designed for large scale quantum simulation of spin models our apparatus is based on a segmentedblade ion trap enclosed in a 4 k cryostat which enables us to routinely trap over 100 171yb ions in a linear configuration for hours due to a low background gas pressure from differential cryopumping we characterize the cryogenic vacuum by using trapped ion crystals as a pressure gauge measuring both inelastic and elastic collision rates with the molecular background gas we demonstrate nearly equidistant ion spacing for chains of up to 44 ions using anharmonic axial potentials this reliable production and lifetime enhancement of large linear ion chains will enable quantum simulation of spin models that are intractable with classical computer modelling | [['we', 'present', 'a', 'cryogenic', 'ion', 'trapping', 'system', 'designed', 'for', 'large', 'scale', 'quantum', 'simulation', 'of', 'spin', 'models', 'our', 'apparatus', 'is', 'based', 'on', 'a', 'segmentedblade', 'ion', 'trap', 'enclosed', 'in', 'a', '4', 'k', 'cryostat', 'which', 'enables', 'us', 'to', 'routinely', 'trap', 'over', '100', '171yb', 'ions', 'in', 'a', 'linear', 'configuration', 'for', 'hours', 'due', 'to', 'a', 'low', 'background', 'gas', 'pressure', 'from', 'differential', 'cryopumping', 'we', 'characterize', 'the', 'cryogenic', 'vacuum', 'by', 'using', 'trapped', 'ion', 'crystals', 'as', 'a', 'pressure', 'gauge', 'measuring', 'both', 'inelastic', 'and', 'elastic', 'collision', 'rates', 'with', 'the', 'molecular', 'background', 'gas', 'we', 'demonstrate', 'nearly', 'equidistant', 'ion', 'spacing', 'for', 'chains', 'of', 'up', 'to', '44', 'ions', 'using', 'anharmonic', 'axial', 'potentials', 'this', 'reliable', 'production', 'and', 'lifetime', 'enhancement', 'of', 'large', 'linear', 'ion', 'chains', 'will', 'enable', 'quantum', 'simulation', 'of', 'spin', 'models', 'that', 'are', 'intractable', 'with', 'classical', 'computer', 'modelling']] | [-0.09922682223141163, 0.2434647914809667, -0.011333769278191939, -0.0007935691799029587, 0.03905390579124716, -0.19025264172511916, 0.031353163794137356, 0.3966634353789372, -0.20169672249945078, -0.3087368714736729, 0.04678090280811567, -0.29281634236950943, 0.023314121711196574, 0.22633868835798307, 0.046475546308641695, 0.11396058726813493, 0.07426793481851739, -0.028173606727287415, -0.04788808873475991, -0.19265769387318987, 0.22204149571224685, 0.14472482862836886, 0.25688171925731157, 0.08527276690716182, 0.15927148529335977, -0.007544259235974613, 0.061172758827716625, 0.007486909855066276, -0.13556612768936646, 0.11375959213005334, 0.26468977829843915, -0.005855804814661785, 0.19960976316313433, -0.4800807508427983, -0.2055809657596718, 0.07448716499517119, 0.1446406821023703, 0.21900779698839093, -0.09239454542918933, -0.2443756250819812, 0.004079351407983075, -0.20015297810039748, -0.14131434854002653, -0.10780304243477683, 0.006323253062016111, 0.04791589833917172, -0.284457368420331, 0.07679827481023664, -0.0037801146461832816, 0.1298253406085286, -0.0889155063304929, -0.08781548182392962, 0.043702542149590524, 0.008226026224381313, -0.04569698354736637, 0.013755930235563981, 0.26752587407070205, -0.05637384772800454, -0.07402433064857089, 0.37332488224667504, -0.12423755747939998, -0.13659972609664367, 0.2101527275157926, -0.18333051048930946, -0.07027035227378572, 0.18925423458279148, 0.20782487843624822, 0.09406598181888741, -0.17340315757243613, 0.04581654506164785, 0.01944426079734978, 0.20195443499329943, 0.11454927793711545, 0.014567918455553793, 0.2549934078053367, 0.18840807511630217, 0.03337077454264405, 0.1511266831810467, -0.15590408681210402, -0.08824858233726364, -0.265478965841476, -0.1608778171362431, -0.1463037003816022, 0.06722403503575825, -0.03716810740037382, -0.12762060973081527, 0.3244373445452108, 0.12773641910757946, 0.15711581925161153, -0.014578926444197513, 0.3015858881569248, 0.06315209143757214, 0.08808945622143706, 0.04345537727032372, 0.22635137042166983, 0.18752432815404987, 0.12498725166949405, -0.3067071558453324, -0.027717911237017896, -0.008516684943068077] |
1,802.03119 | Measurements of absolute branching fractions for $D$ mesons decays into
two pseudoscalar mesons | Using a data sample of $e^+e^-$ collision data with an integrated luminosity
of 2.93 fb$^{-1}$ taken at the center-of-mass energy $\sqrt s= 3.773$~GeV with
the BESIII detector operating at the BEPCII storage rings, we measure the
absolute branching fractions of the two-body hadronic decays $D^+\to
\pi^+\pi^0$, $K^+ \pi^0$, $\pi^+ \eta$, $K^+\eta$, $\pi^+\eta^\prime$,
$K^+\eta^\prime$, $K_S^0 \pi^+$, $K_S^0 K^+$, and $D^0\to \pi^+ \pi^-$, $K^+
K^-$, $K^\mp \pi^\pm$, $K_S^0 \pi^0$, $K_S^0 \eta$, $K_S^0 \eta^\prime$. Our
results are consistent with previous measurements within uncertainties. Among
them, the branching fractions for $D^+\to\pi^+\pi^0$, $K^+\pi^0$, $\pi^+\eta$,
$\pi^+\eta^\prime$, $K_S^0 \pi^+$, $K_S^0 K^+$ and $D^0 \to K_S^0 \pi^0$,
$K_S^0 \eta$, $K_S^0 \eta^\prime$ are determined with improved precision
compared to the world average values.
| hep-ex | using a data sample of ee collision data with an integrated luminosity of 293 fb1 taken at the centerofmass energy sqrt s 3773gev with the besiii detector operating at the bepcii storage rings we measure the absolute branching fractions of the twobody hadronic decays dto pipi0 k pi0 pi eta keta pietaprime ketaprime k_s0 pi k_s0 k and d0to pi pi k k kmp pipm k_s0 pi0 k_s0 eta k_s0 etaprime our results are consistent with previous measurements within uncertainties among them the branching fractions for dtopipi0 kpi0 pieta pietaprime k_s0 pi k_s0 k and d0 to k_s0 pi0 k_s0 eta k_s0 etaprime are determined with improved precision compared to the world average values | [['using', 'a', 'data', 'sample', 'of', 'ee', 'collision', 'data', 'with', 'an', 'integrated', 'luminosity', 'of', '293', 'fb1', 'taken', 'at', 'the', 'centerofmass', 'energy', 'sqrt', 's', '3773gev', 'with', 'the', 'besiii', 'detector', 'operating', 'at', 'the', 'bepcii', 'storage', 'rings', 'we', 'measure', 'the', 'absolute', 'branching', 'fractions', 'of', 'the', 'twobody', 'hadronic', 'decays', 'dto', 'pipi0', 'k', 'pi0', 'pi', 'eta', 'keta', 'pietaprime', 'ketaprime', 'k_s0', 'pi', 'k_s0', 'k', 'and', 'd0to', 'pi', 'pi', 'k', 'k', 'kmp', 'pipm', 'k_s0', 'pi0', 'k_s0', 'eta', 'k_s0', 'etaprime', 'our', 'results', 'are', 'consistent', 'with', 'previous', 'measurements', 'within', 'uncertainties', 'among', 'them', 'the', 'branching', 'fractions', 'for', 'dtopipi0', 'kpi0', 'pieta', 'pietaprime', 'k_s0', 'pi', 'k_s0', 'k', 'and', 'd0', 'to', 'k_s0', 'pi0', 'k_s0', 'eta', 'k_s0', 'etaprime', 'are', 'determined', 'with', 'improved', 'precision', 'compared', 'to', 'the', 'world', 'average', 'values']] | [-0.10734418550180683, 0.30685390600127443, -0.1697088603663827, 0.0517168958790897, -0.008019722429458547, -0.13670311826569712, 0.08358279124120728, 0.2626208443652047, -0.18998904940795847, -0.18235669271872107, -0.20250156949134132, -0.5425962757286245, 0.21793355280945523, 0.1355771162749095, 0.17842968861341674, 0.2399014270921347, 0.1503900928686546, 0.051177948144618915, -0.012995650583828709, -0.14183074110022753, 0.1210686777289792, -0.0032099089214363986, 0.15461203515677985, 0.04513409537617612, -0.1045474932895792, 0.03908276868431903, -0.05649618119870898, -0.16343752567994252, -0.31471070446552035, -0.0021930628206861097, 0.37449636316726365, 0.09008312312498755, 0.014004091612697967, -0.19509488710095907, 0.14973165675486744, 0.24816731082901886, 0.18609624159052573, -0.10136705174768113, 0.04558748930004483, -0.4831194363006976, 0.2673349528433343, -0.19490274973625762, 0.001442489988970018, -0.10141629939981267, 0.15727168208696937, -0.1516812683404547, -0.436842217085372, 0.10609962290103457, -0.11897912068473818, 0.16903087833846828, -0.03683759483500524, -0.4582572919934724, -0.002681394491913374, -0.08634090806415255, 0.0858689536705234, 0.2029090510769871, 0.2891020760953888, -0.008881899124357552, -0.19094348573579198, 0.3614618993339549, -0.04615588758997949, -0.14484676726618823, 0.07416144585385259, -0.2552606485849988, -0.0929193561046747, 0.34742872746438774, 0.30258498129031036, 0.010850193242715524, -0.21735797108736185, 0.1547107583445505, -0.0268082151486151, 0.2054255348012115, 0.17189663090017845, 0.11265094171533674, 0.04416534852904094, 0.18921474276720424, -0.10600135929519887, 0.010653476292613597, -0.1291539149126553, 0.04482060537335619, -0.42674094050158373, -0.13260711269634487, -0.002248883004242604, 0.14449275763029545, -0.07029765068818156, 0.10609971638768911, 0.2026707340790107, -0.06921033455245403, 0.44882621767774095, 0.03782357081803864, 0.32167970610007773, 0.06374478434517453, -0.05631354685555484, 0.14154770923366325, 0.2533096769016928, 0.2811584516997095, 0.20005305710586563, -0.43734241052802686, 0.046240787557532304, -0.049735261074811285] |
1,802.0312 | Doubly-charged scalar in rare decays of $B_c$ meson | In this paper, we study the lepton number violation processes of $B_c$ meson
induced by possible doubly-charged scalars. Both the three-body decay channels
and the four-body decay channels are considered. For the former,
$Br\times\left(\frac{s_\Delta h_{ij}}{M_\Delta^2}\right)^{-2}$ is of the order
of $10^{-7}\sim 10^{-9}$, and for the later channels,
$Br\times\left(\frac{s_\Delta h_{ij}}{M_\Delta^2}\right)^{-2}$ is of the order
of $10^{-12}\sim 10^{-20}$, where $s_\Delta$, $h_{ij}$, $M_\Delta$ are the
constants related to the doubly-charged boson.
| hep-ph | in this paper we study the lepton number violation processes of b_c meson induced by possible doublycharged scalars both the threebody decay channels and the fourbody decay channels are considered for the former brtimesleftfracs_delta h_ijm_delta2right2 is of the order of 107sim 109 and for the later channels brtimesleftfracs_delta h_ijm_delta2right2 is of the order of 1012sim 1020 where s_delta h_ij m_delta are the constants related to the doublycharged boson | [['in', 'this', 'paper', 'we', 'study', 'the', 'lepton', 'number', 'violation', 'processes', 'of', 'b_c', 'meson', 'induced', 'by', 'possible', 'doublycharged', 'scalars', 'both', 'the', 'threebody', 'decay', 'channels', 'and', 'the', 'fourbody', 'decay', 'channels', 'are', 'considered', 'for', 'the', 'former', 'brtimesleftfracs_delta', 'h_ijm_delta2right2', 'is', 'of', 'the', 'order', 'of', '107sim', '109', 'and', 'for', 'the', 'later', 'channels', 'brtimesleftfracs_delta', 'h_ijm_delta2right2', 'is', 'of', 'the', 'order', 'of', '1012sim', '1020', 'where', 's_delta', 'h_ij', 'm_delta', 'are', 'the', 'constants', 'related', 'to', 'the', 'doublycharged', 'boson']] | [-0.16167410211919836, 0.31986778149042616, 0.05466127594594251, 0.1259708034357931, -0.014766685996261058, -0.14898964723177027, 0.03874748977691387, 0.25453522507891513, -0.2036586501688527, -0.21426692191567837, 0.02971816368076499, -0.3169446394524791, -0.027686965537158714, 0.10821713105718972, 0.08787410989911719, 0.1191752354233441, 0.03213445044997515, 0.04646513872130802, -0.0136896206540493, -0.25047052485840116, 0.33737912930717523, 0.0031415918391289642, 0.11919114110765583, 0.12190225544018728, -0.0312974964141507, -0.006305042774218953, -0.027361497508757042, -0.13123850602035722, -0.162195537951916, 0.05446315551120223, 0.16630878302296906, 0.09842149291370968, 0.11826249377124688, -0.32283283149202663, -0.0773050311501279, 0.1896238090244658, 0.18395829501307823, 0.07910940519562273, 0.0012275870663650107, -0.3436733195628745, 0.13457964087667112, -0.18454441823291057, -0.05573066165247424, -0.03559280862453196, 0.049538274789511255, -0.054439702328774285, -0.3786313957111402, 0.13014928106162132, 0.009153198845910303, -0.028373893505583208, -0.007381669414991682, -0.20097845736326594, 0.0054938466090596084, 0.050129578498220355, 0.18746158505338384, 0.018143484555890387, 0.1332552236660073, -0.15297501971310173, -0.14845184908446038, 0.41071017120372166, -0.06739705727280428, -0.18360588267078679, 0.13229736558048788, -0.1791123922025277, -0.11403977195026749, 0.14224747320016226, 0.2190528673562574, 0.09658865201653856, -0.1903316196941446, 0.15772012317602552, -0.035325499886477534, 0.11884648948343414, 0.08526807027219822, 0.11597789606347567, 0.1366443633257101, 0.1357122778920739, -0.004406940079096592, 0.08212778181063407, -0.08626587008775184, -0.05602886371938935, -0.3886276057949572, -0.1907382580508111, -0.08844422390966704, 0.0564056345628518, -0.03958906007315046, -0.03377953323510927, 0.4052840257275172, 0.04830946622303489, 0.22987498063594103, 0.023298145896247166, 0.24999374287400508, 0.11578552017101285, 0.0632103836961147, 0.05473088515414433, 0.3129043138134434, 0.23587419256694953, 0.06795925990621926, -0.2710489143553952, 0.026770087643385385, 0.06275617736250613] |
1,802.03121 | Gravitational instability of a dust layer composed of porous silicate
dust aggregates in a protoplanetary disk | Planetesimal formation is one of the most important unsolved problems in
planet formation theory. In particular, rocky planetesimal formation is
difficult because silicate dust grains are easily broken when they collide.
Recently, it has been proposed that they can grow as porous aggregates when
their monomer radius is smaller than $\sim$ 10 nm, which can also avoid the
radial drift toward the central star. However, the stability of a layer
composed of such porous silicate dust aggregates has not been investigated.
Therefore, we investigate the gravitational instability of this dust layer. To
evaluate the disk stability, we calculate Toomre's stability parameter $Q$, for
which we need to evaluate the equilibrium random velocity of dust aggregates.
We calculate the equilibrium random velocity considering gravitational
scattering and collisions between dust aggregates, drag by mean flow of gas,
stirring by gas turbulence, and gravitational scattering by gas density
fluctuation due to turbulence. We derive the condition of the gravitational
instability using the disk mass, dust-to-gas ratio, turbulent strength, orbital
radius, and dust monomer radius. We find that, for the minimum mass solar
nebula model at 1 au, the dust layer becomes gravitationally unstable when the
turbulent strength $\alpha\lesssim10^{-5}$. If the dust-to-gas ratio is
increased twice, the gravitational instability occurs for
$\alpha\lesssim10^{-4}$. We also find that the dust layer is more unstable in
disks with larger mass, higher dust-to-gas ratio, and weaker turbulent
strength, at larger orbital radius, and with a larger monomer radius.
| astro-ph.EP | planetesimal formation is one of the most important unsolved problems in planet formation theory in particular rocky planetesimal formation is difficult because silicate dust grains are easily broken when they collide recently it has been proposed that they can grow as porous aggregates when their monomer radius is smaller than sim 10 nm which can also avoid the radial drift toward the central star however the stability of a layer composed of such porous silicate dust aggregates has not been investigated therefore we investigate the gravitational instability of this dust layer to evaluate the disk stability we calculate toomres stability parameter q for which we need to evaluate the equilibrium random velocity of dust aggregates we calculate the equilibrium random velocity considering gravitational scattering and collisions between dust aggregates drag by mean flow of gas stirring by gas turbulence and gravitational scattering by gas density fluctuation due to turbulence we derive the condition of the gravitational instability using the disk mass dusttogas ratio turbulent strength orbital radius and dust monomer radius we find that for the minimum mass solar nebula model at 1 au the dust layer becomes gravitationally unstable when the turbulent strength alphalesssim105 if the dusttogas ratio is increased twice the gravitational instability occurs for alphalesssim104 we also find that the dust layer is more unstable in disks with larger mass higher dusttogas ratio and weaker turbulent strength at larger orbital radius and with a larger monomer radius | [['planetesimal', 'formation', 'is', 'one', 'of', 'the', 'most', 'important', 'unsolved', 'problems', 'in', 'planet', 'formation', 'theory', 'in', 'particular', 'rocky', 'planetesimal', 'formation', 'is', 'difficult', 'because', 'silicate', 'dust', 'grains', 'are', 'easily', 'broken', 'when', 'they', 'collide', 'recently', 'it', 'has', 'been', 'proposed', 'that', 'they', 'can', 'grow', 'as', 'porous', 'aggregates', 'when', 'their', 'monomer', 'radius', 'is', 'smaller', 'than', 'sim', '10', 'nm', 'which', 'can', 'also', 'avoid', 'the', 'radial', 'drift', 'toward', 'the', 'central', 'star', 'however', 'the', 'stability', 'of', 'a', 'layer', 'composed', 'of', 'such', 'porous', 'silicate', 'dust', 'aggregates', 'has', 'not', 'been', 'investigated', 'therefore', 'we', 'investigate', 'the', 'gravitational', 'instability', 'of', 'this', 'dust', 'layer', 'to', 'evaluate', 'the', 'disk', 'stability', 'we', 'calculate', 'toomres', 'stability', 'parameter', 'q', 'for', 'which', 'we', 'need', 'to', 'evaluate', 'the', 'equilibrium', 'random', 'velocity', 'of', 'dust', 'aggregates', 'we', 'calculate', 'the', 'equilibrium', 'random', 'velocity', 'considering', 'gravitational', 'scattering', 'and', 'collisions', 'between', 'dust', 'aggregates', 'drag', 'by', 'mean', 'flow', 'of', 'gas', 'stirring', 'by', 'gas', 'turbulence', 'and', 'gravitational', 'scattering', 'by', 'gas', 'density', 'fluctuation', 'due', 'to', 'turbulence', 'we', 'derive', 'the', 'condition', 'of', 'the', 'gravitational', 'instability', 'using', 'the', 'disk', 'mass', 'dusttogas', 'ratio', 'turbulent', 'strength', 'orbital', 'radius', 'and', 'dust', 'monomer', 'radius', 'we', 'find', 'that', 'for', 'the', 'minimum', 'mass', 'solar', 'nebula', 'model', 'at', '1', 'au', 'the', 'dust', 'layer', 'becomes', 'gravitationally', 'unstable', 'when', 'the', 'turbulent', 'strength', 'alphalesssim105', 'if', 'the', 'dusttogas', 'ratio', 'is', 'increased', 'twice', 'the', 'gravitational', 'instability', 'occurs', 'for', 'alphalesssim104', 'we', 'also', 'find', 'that', 'the', 'dust', 'layer', 'is', 'more', 'unstable', 'in', 'disks', 'with', 'larger', 'mass', 'higher', 'dusttogas', 'ratio', 'and', 'weaker', 'turbulent', 'strength', 'at', 'larger', 'orbital', 'radius', 'and', 'with', 'a', 'larger', 'monomer', 'radius']] | [-0.11418932766939034, 0.20099679459759257, -0.05164557127827568, 0.07590108408269211, -0.01731187973763778, -0.08265428127775507, -0.04729128647722288, 0.3599532245761602, -0.23629455114217965, -0.286500963998109, 0.04795478083530371, -0.23962487879298847, -0.05415768410803976, 0.11218882523375762, -0.008778095800647801, 0.03925933696234123, 0.03145642414548781, -0.0891576659394171, -0.007950190056279052, -0.2399993374676806, 0.32068292756864963, 0.11635923262482907, 0.1486157760916426, 0.0761819796309861, 0.024579100384353562, -0.09650439784616606, 0.021266464732400292, 0.005158363467386328, -0.257875215579242, 0.0323992540396674, 0.14729722565289385, 0.042290956676240124, 0.2484821456418252, -0.4373040779973049, -0.25130665203250524, 0.07974693181078928, 0.20915200370539244, 0.08845350691935663, -0.010951010573952006, -0.18783664589973798, 0.10409922782812954, -0.2131277365048872, -0.1927767128091321, 0.052252666274607805, 0.14221249766273727, 0.004362192571408673, -0.28351452715780634, 0.16254844691845, 0.055491583717979145, 0.05331291762184523, -0.11832413557920776, -0.10184836381789157, -0.1348521682574067, 0.02250698218343752, 0.08646888969803158, 0.01824620603213562, 0.3078456493659592, -0.12174291700356353, 0.06433108964034796, 0.4224559844755977, -0.08518129843999545, -0.1128617401184148, 0.23983653625190865, -0.21812023206664616, -0.0658687433114891, 0.22252637917705848, 0.17903122273380925, 0.10690138077998541, -0.09878961370168517, -0.013567102139973506, -0.05555862672120395, 0.23003871346800492, 0.15381740966312993, 0.03492213400065213, 0.34851575546769353, 0.16091764774407302, 0.07234629316335334, 0.13065911230151872, -0.18263439522378117, -0.09094242182283596, -0.19103399698454965, -0.12764235642041122, -0.17387417764899762, 0.05237636488291706, -0.1772613141791789, -0.12899165066294216, 0.2278686654744241, 0.1452103576673561, 0.19901036521201665, 0.045800392682543295, 0.3095765255282489, 0.1143885256496558, 0.11550562558442386, 0.1463160084835234, 0.34597053487539664, 0.1802068490619775, 0.12212627289805048, -0.25626339186879193, 0.11706533461953338, 0.06334869679118113] |
1,802.03122 | Delay-Dependent Distributed Kalman Fusion Estimation with Dimensionality
Reduction in Cyber-Physical Systems | This paper studies the distributed dimensionality reduction fusion estimation
problem with communication delays for a class of cyber-physical systems (CPSs).
The raw measurements are preprocessed in each sink node to obtain the local
optimal estimate (LOE) of a CPS, and the compressed LOE under dimensionality
reduction encounters with communication delays during the transmission. Under
this case, a mathematical model with compensation strategy is proposed to
characterize the dimensionality reduction and communication delays. This model
also has the property to reduce the information loss caused by the
dimensionality reduction and delays. Based on this model, a recursive
distributed Kalman fusion estimator (DKFE) is derived by optimal weighted
fusion criterion in the linear minimum variance sense. A stability condition
for the DKFE, which can be easily verified by the exiting software, is derived.
In addition, this condition can guarantee that estimation error covariance
matrix of the DKFE converges to the unique steady-state matrix for any initial
values, and thus the steady-state DKFE (SDKFE) is given. Notice that the
computational complexity of the SDKFE is much lower than that of the DKFE.
Moreover, a probability selection criterion for determining the dimensionality
reduction strategy is also presented to guarantee the stability of the DKFE.
Two illustrative examples are given to show the advantage and effectiveness of
the proposed methods.
| cs.SY | this paper studies the distributed dimensionality reduction fusion estimation problem with communication delays for a class of cyberphysical systems cpss the raw measurements are preprocessed in each sink node to obtain the local optimal estimate loe of a cps and the compressed loe under dimensionality reduction encounters with communication delays during the transmission under this case a mathematical model with compensation strategy is proposed to characterize the dimensionality reduction and communication delays this model also has the property to reduce the information loss caused by the dimensionality reduction and delays based on this model a recursive distributed kalman fusion estimator dkfe is derived by optimal weighted fusion criterion in the linear minimum variance sense a stability condition for the dkfe which can be easily verified by the exiting software is derived in addition this condition can guarantee that estimation error covariance matrix of the dkfe converges to the unique steadystate matrix for any initial values and thus the steadystate dkfe sdkfe is given notice that the computational complexity of the sdkfe is much lower than that of the dkfe moreover a probability selection criterion for determining the dimensionality reduction strategy is also presented to guarantee the stability of the dkfe two illustrative examples are given to show the advantage and effectiveness of the proposed methods | [['this', 'paper', 'studies', 'the', 'distributed', 'dimensionality', 'reduction', 'fusion', 'estimation', 'problem', 'with', 'communication', 'delays', 'for', 'a', 'class', 'of', 'cyberphysical', 'systems', 'cpss', 'the', 'raw', 'measurements', 'are', 'preprocessed', 'in', 'each', 'sink', 'node', 'to', 'obtain', 'the', 'local', 'optimal', 'estimate', 'loe', 'of', 'a', 'cps', 'and', 'the', 'compressed', 'loe', 'under', 'dimensionality', 'reduction', 'encounters', 'with', 'communication', 'delays', 'during', 'the', 'transmission', 'under', 'this', 'case', 'a', 'mathematical', 'model', 'with', 'compensation', 'strategy', 'is', 'proposed', 'to', 'characterize', 'the', 'dimensionality', 'reduction', 'and', 'communication', 'delays', 'this', 'model', 'also', 'has', 'the', 'property', 'to', 'reduce', 'the', 'information', 'loss', 'caused', 'by', 'the', 'dimensionality', 'reduction', 'and', 'delays', 'based', 'on', 'this', 'model', 'a', 'recursive', 'distributed', 'kalman', 'fusion', 'estimator', 'dkfe', 'is', 'derived', 'by', 'optimal', 'weighted', 'fusion', 'criterion', 'in', 'the', 'linear', 'minimum', 'variance', 'sense', 'a', 'stability', 'condition', 'for', 'the', 'dkfe', 'which', 'can', 'be', 'easily', 'verified', 'by', 'the', 'exiting', 'software', 'is', 'derived', 'in', 'addition', 'this', 'condition', 'can', 'guarantee', 'that', 'estimation', 'error', 'covariance', 'matrix', 'of', 'the', 'dkfe', 'converges', 'to', 'the', 'unique', 'steadystate', 'matrix', 'for', 'any', 'initial', 'values', 'and', 'thus', 'the', 'steadystate', 'dkfe', 'sdkfe', 'is', 'given', 'notice', 'that', 'the', 'computational', 'complexity', 'of', 'the', 'sdkfe', 'is', 'much', 'lower', 'than', 'that', 'of', 'the', 'dkfe', 'moreover', 'a', 'probability', 'selection', 'criterion', 'for', 'determining', 'the', 'dimensionality', 'reduction', 'strategy', 'is', 'also', 'presented', 'to', 'guarantee', 'the', 'stability', 'of', 'the', 'dkfe', 'two', 'illustrative', 'examples', 'are', 'given', 'to', 'show', 'the', 'advantage', 'and', 'effectiveness', 'of', 'the', 'proposed', 'methods']] | [-0.11417719191858466, 0.04157247093720405, -0.07278378956684484, 0.04505050675495322, -0.038357260894957286, -0.16524405641472537, 0.06518808992206832, 0.34130862502254405, -0.295833255807069, -0.28807068004452147, 0.14641600561206897, -0.22781515484369697, -0.1643320145361462, 0.1712831636276446, -0.13803029200280775, 0.10459707881726528, 0.09905149867308821, 0.05049421423565194, -0.07556502812786876, -0.2938723476874716, 0.27126140212869715, 0.0963388106811949, 0.33616309015281465, 0.007677454024251603, 0.1162259748211418, 0.024490346360357015, -0.020444885036195386, 0.023862742982310694, -0.10998652680465343, 0.12851596417882755, 0.2581036391705187, 0.1607121009698811, 0.31225452077150906, -0.3587869399472057, -0.2372403209373145, 0.1350989233507849, 0.1312668146128316, 0.12303774455122807, -0.03941362790988557, -0.26531605131622454, 0.13768618345313088, -0.15835305119817092, -0.0879038338256484, -0.05476177559549015, -0.004933911069632976, 0.010405305375130803, -0.350746307796427, 0.0620248718731031, 0.06052747834856434, 0.030010070391611455, -0.06811395917577504, -0.08947377181458921, -0.012383782164906392, 0.09239265089417358, 0.023955644244446198, -0.0328538552185678, 0.12328328628381582, -0.09132033476317433, -0.0952493333992299, 0.3535977678784462, -0.013304399595688264, -0.2399939207322983, 0.15626646677893477, -0.05820801583263026, -0.10555237177715684, 0.1510634553736784, 0.19367871508701867, 0.057803788737223395, -0.1696890248204341, 0.05851739728380598, -0.02292631196181679, 0.1726025853026221, 0.05080421645622788, 0.04737295703131688, 0.0764055101402069, 0.1798085430658864, 0.1475540032629973, 0.14677922890200215, -0.09384616047686115, -0.0924025907371403, -0.2827876699572438, -0.14268940513157788, -0.2027473773374419, -0.0012061021152988706, -0.13111758237110807, -0.12699352561150778, 0.3589300934794827, 0.16478703663347752, 0.18572131467178604, 0.10627647059884342, 0.34451217112511817, 0.17750809739940657, 0.03675044547797054, 0.09894982543926983, 0.21311997775285738, 0.11817716809422513, 0.0691184153531114, -0.24876699707265332, 0.12493115017505389, 0.07857469952678386] |
1,802.03123 | Surface operator study in SU(2) gauge field theory | The surface operator in an SU(2) gauge field theory is studied. We analyze
Abelian projection of the SU(2) symmetry to the U(1) group calculating the
surface parameter. The surface parameter dependence on the surface area and
volume is studied in confinement and deconfinement phases. It is shown the
spatial and temporal surface operators exhibit nontrivial area dependence in
the confinement and deconfinement phases. It is shown also that there is no
volume law for the operators defined on a cubic surface.
| hep-lat | the surface operator in an su2 gauge field theory is studied we analyze abelian projection of the su2 symmetry to the u1 group calculating the surface parameter the surface parameter dependence on the surface area and volume is studied in confinement and deconfinement phases it is shown the spatial and temporal surface operators exhibit nontrivial area dependence in the confinement and deconfinement phases it is shown also that there is no volume law for the operators defined on a cubic surface | [['the', 'surface', 'operator', 'in', 'an', 'su2', 'gauge', 'field', 'theory', 'is', 'studied', 'we', 'analyze', 'abelian', 'projection', 'of', 'the', 'su2', 'symmetry', 'to', 'the', 'u1', 'group', 'calculating', 'the', 'surface', 'parameter', 'the', 'surface', 'parameter', 'dependence', 'on', 'the', 'surface', 'area', 'and', 'volume', 'is', 'studied', 'in', 'confinement', 'and', 'deconfinement', 'phases', 'it', 'is', 'shown', 'the', 'spatial', 'and', 'temporal', 'surface', 'operators', 'exhibit', 'nontrivial', 'area', 'dependence', 'in', 'the', 'confinement', 'and', 'deconfinement', 'phases', 'it', 'is', 'shown', 'also', 'that', 'there', 'is', 'no', 'volume', 'law', 'for', 'the', 'operators', 'defined', 'on', 'a', 'cubic', 'surface']] | [-0.17426697370872177, 0.22230816797664488, -0.12031500394467587, 0.10667019952692229, -0.04524001734975128, -0.09906990540409345, -0.0010547677592523856, 0.3999070597605573, -0.1915301700801025, -0.25693710840502637, 0.10580038144339428, -0.2732454318507218, -0.17242465126845571, 0.1297654858847827, -0.04747735758392531, 0.025064159452736975, -0.0984970214949162, 0.07681286558623851, -0.12979448716052705, -0.24069545443319243, 0.3200175983739304, -0.03232979810980643, 0.343709144062926, 0.1649160072563883, 0.10044615877861227, -0.012540551529116468, 0.005877557725151196, 0.0453899756482124, -0.14169095069456367, 0.03386530651492469, 0.18779183376327524, -0.024799148381089816, 0.12373319070464299, -0.3886181331573077, -0.27025936601430545, 0.11157720980958806, 0.07644966194107208, 0.07380401582261663, -0.07313025712012601, -0.2736421706913798, 0.04351279352228215, -0.1313022594255062, -0.1622672973036835, -0.08125106560319294, 0.07097186867498367, -0.09343078100111013, -0.2151822896105134, 0.07285943401677039, 0.030733344018643284, 0.11192888788947905, -0.06354015344684874, -0.061611448851540504, -0.1317589582622419, 0.07788445958637713, 0.10465865538248585, 0.09007470966834161, 0.15153030713841917, -0.15805283920655464, -0.041601069593503154, 0.37311605442269347, -0.043471652634993745, -0.22444729272414138, 0.15822110478018905, -0.2137594833193249, -0.1046689885587972, 0.1360345247006159, 0.119651032473754, 0.10841769912112346, -0.0949248938769516, 0.2075160375457073, -0.035477036943682184, 0.18437826843863284, 0.04361155315267819, 0.020806461134293106, 0.17947733035472072, 0.163194783302139, 0.12810549172170368, 0.11614247525174079, -0.06603221654501042, -0.1238636895324345, -0.3457256746880802, -0.16669749485236812, -0.20288763432131138, -0.012469274693249184, -0.10431647668003369, -0.17591044516230783, 0.41021286482336344, 0.05143625429187568, 0.16643922785756948, -0.02656764394523185, 0.19622014219194284, 0.15025607735079563, 0.11002308846577818, 0.05930873080743132, 0.21298737129495468, 0.2137575409271651, 0.05007794992653308, -0.2980518188660987, -0.048153941720770095, 0.16460632345420712] |
1,802.03124 | Nuclear reaction path and requantization of TDDFT | Using a theory of large amplitude collective motion, the adiabatic
self-consistent collective coordinate method, we derive reaction path for the
fusion process at sub-barrier energies. The collective Hamiltonian to describe
the fusion process is constructed, based on the obtained reaction path and
canonical variables. We study the reaction of N=Z stable nuclei, alpha+16O,
16O+16O, and alpha+12C. The results suggest that, after two nuclei touch, the
reaction path is significantly deviated from the simple relative motion, which
may affect the deep sub-barrier fusion cross section.
| nucl-th | using a theory of large amplitude collective motion the adiabatic selfconsistent collective coordinate method we derive reaction path for the fusion process at subbarrier energies the collective hamiltonian to describe the fusion process is constructed based on the obtained reaction path and canonical variables we study the reaction of nz stable nuclei alpha16o 16o16o and alpha12c the results suggest that after two nuclei touch the reaction path is significantly deviated from the simple relative motion which may affect the deep subbarrier fusion cross section | [['using', 'a', 'theory', 'of', 'large', 'amplitude', 'collective', 'motion', 'the', 'adiabatic', 'selfconsistent', 'collective', 'coordinate', 'method', 'we', 'derive', 'reaction', 'path', 'for', 'the', 'fusion', 'process', 'at', 'subbarrier', 'energies', 'the', 'collective', 'hamiltonian', 'to', 'describe', 'the', 'fusion', 'process', 'is', 'constructed', 'based', 'on', 'the', 'obtained', 'reaction', 'path', 'and', 'canonical', 'variables', 'we', 'study', 'the', 'reaction', 'of', 'nz', 'stable', 'nuclei', 'alpha16o', '16o16o', 'and', 'alpha12c', 'the', 'results', 'suggest', 'that', 'after', 'two', 'nuclei', 'touch', 'the', 'reaction', 'path', 'is', 'significantly', 'deviated', 'from', 'the', 'simple', 'relative', 'motion', 'which', 'may', 'affect', 'the', 'deep', 'subbarrier', 'fusion', 'cross', 'section']] | [-0.05312009905797562, 0.19253488409975988, -0.1342131460814493, 0.0717406482534941, -0.009944170691250335, -0.09249788809323772, 0.05687821414072199, 0.37330086926175726, -0.2873631649611828, -0.1973160122676442, -0.07932500464708678, -0.25937491476846236, -0.12086167887208007, 0.17673186281795747, 0.015443225934480628, 0.033596435317858345, 0.1620401011425115, 0.09981957406160377, -0.01843586598711443, -0.16032225195141064, 0.3371016647988221, 0.11863162923691561, 0.2975838530276503, 0.07350519180874385, 0.13406951550305599, 0.12021649499157709, -0.0210788877060016, -0.04085109550284133, -0.13663366820340647, 0.11379817733541131, 0.2565231179081214, 0.06925892642521787, 0.14129396560158403, -0.4373828722164035, -0.19032442862434046, 0.07300302193367056, 0.16921795536542222, 0.19561965768419518, -0.03663480196042829, -0.2762531968654089, 0.015126670360630323, -0.21235096783909416, -0.1337149538254986, -0.09248758750479846, 0.03851581919228747, 0.057336983312520066, -0.2502806004056419, 0.06789706765474486, 0.03131072913683532, 0.04558388674576279, -0.1313130493009729, -0.166119911342061, -0.03576678321475074, 0.08037307895054775, 0.031117844208936384, 0.005466925084225035, 0.2738665313892333, -0.10262535307889006, -0.10440410619429756, 0.37652497095543713, 0.006048424338500592, -0.12314895549345584, 0.140465538175444, -0.10474421651590438, -0.12934527550325065, 0.22400050469496774, 0.18682067655026913, 0.1777016800589904, -0.20796321864639009, 0.04524117073326904, 0.05475872237556836, 0.08329856374655806, 0.0690798523497679, -0.032858384002576624, 0.09683826335328506, 0.19708067360555842, -0.013488777846630131, 0.03052716091596743, -0.1679363393396627, -0.20494449620933405, -0.3170316731113763, -0.08628264620589714, -0.087283657262257, 0.06156711409511488, -0.045041085769341974, -0.08576443292466658, 0.3308980484670472, 0.09062875154389378, 0.251037662516215, 0.009255086317092978, 0.26316869803260834, 0.15943638908876373, 0.05123773505467744, 0.05246036231983453, 0.3301015794277191, 0.14817788628196077, 0.0605992855493068, -0.312733196246665, 0.04745292938536122, 0.11390350954718001] |
1,802.03125 | On the Progenitors of Type Ia Supernovae | We review all the models proposed for the progenitor systems of Type Ia
supernovae and discuss the strengths and weaknesses of each scenario when
confronted with observations. We show that all scenarios encounter at least a
few serious diffculties, if taken to represent a comprehensive model for the
progenitors of all Type Ia supernovae (SNe Ia). Consequently, we tentatively
conclude that there is probably more than one channel leading SNe Ia. While the
single-degenerate scenario (in which a single white dwarf accretes mass from a
normal stellar companion) has been studied in some detail, the other scenarios
will need a similar level of scrutiny before any firm conclusions can be drawn.
| astro-ph.SR astro-ph.HE | we review all the models proposed for the progenitor systems of type ia supernovae and discuss the strengths and weaknesses of each scenario when confronted with observations we show that all scenarios encounter at least a few serious diffculties if taken to represent a comprehensive model for the progenitors of all type ia supernovae sne ia consequently we tentatively conclude that there is probably more than one channel leading sne ia while the singledegenerate scenario in which a single white dwarf accretes mass from a normal stellar companion has been studied in some detail the other scenarios will need a similar level of scrutiny before any firm conclusions can be drawn | [['we', 'review', 'all', 'the', 'models', 'proposed', 'for', 'the', 'progenitor', 'systems', 'of', 'type', 'ia', 'supernovae', 'and', 'discuss', 'the', 'strengths', 'and', 'weaknesses', 'of', 'each', 'scenario', 'when', 'confronted', 'with', 'observations', 'we', 'show', 'that', 'all', 'scenarios', 'encounter', 'at', 'least', 'a', 'few', 'serious', 'diffculties', 'if', 'taken', 'to', 'represent', 'a', 'comprehensive', 'model', 'for', 'the', 'progenitors', 'of', 'all', 'type', 'ia', 'supernovae', 'sne', 'ia', 'consequently', 'we', 'tentatively', 'conclude', 'that', 'there', 'is', 'probably', 'more', 'than', 'one', 'channel', 'leading', 'sne', 'ia', 'while', 'the', 'singledegenerate', 'scenario', 'in', 'which', 'a', 'single', 'white', 'dwarf', 'accretes', 'mass', 'from', 'a', 'normal', 'stellar', 'companion', 'has', 'been', 'studied', 'in', 'some', 'detail', 'the', 'other', 'scenarios', 'will', 'need', 'a', 'similar', 'level', 'of', 'scrutiny', 'before', 'any', 'firm', 'conclusions', 'can', 'be', 'drawn']] | [-0.08047433582088398, 0.06096955635039522, -0.034967128577566634, 0.1372550018435881, -0.1440088607387634, -0.20931257327246638, 0.08274862591726789, 0.3813377856234978, -0.15806356888801396, -0.23964824509043414, 0.07124734204472252, -0.30550114640563325, -0.07221442525619054, 0.21830852546620075, -0.0854020560379738, -0.07957851361936412, 0.1622103673598922, -0.002285845792193704, -0.11189960867065836, -0.3579013776957049, 0.35200817165225073, 0.018420487474482338, 0.1871157762015591, -0.06484750518575311, 0.03648918681462853, -0.13643636169365128, -0.026677986149684533, -0.04728739788369821, -0.15516087719564942, -0.019910174963140004, 0.2366816790470382, 0.20983681046437505, 0.2656695780067428, -0.4039262100416529, -0.33376641772679044, 0.15968123723979336, 0.2096131661264981, 0.12325912151959734, -0.0895586027917169, -0.2579969552488209, 0.1253505276604178, -0.26222838494960254, -0.13332855067979377, 0.08812257632411816, 0.014245644520735106, 0.02001324107268456, -0.23529753276893683, 0.08773821676653382, 0.036050499811231554, 0.01600548940467405, -0.09012302006636788, -0.14957098388700402, -0.03751251028078768, 0.03791463673287827, 0.07841068141577714, -0.0015539351275488567, 0.02959085471989998, -0.13816969746908359, -0.02858270281875456, 0.45146529418091197, -0.004502233783405081, -0.03791331713452835, 0.24125763627874605, -0.1498197382819411, -0.18613617226632462, 0.08100107740526935, 0.1379967061802745, 0.05789653210940578, -0.21153818678201558, -0.037260645766625064, 0.0035211496592104973, 0.14160605779270063, 0.005648620999292345, 0.0560296334091339, 0.3173659646648679, 0.1701838323775142, -0.010761356919894818, 0.019911031959775567, -0.1635072289940876, -0.015448230297749376, -0.29695725887971886, -0.08003096854909919, -0.12378817123281224, 0.12150594230892288, -0.10476587098883675, -0.09078268106053541, 0.3373462459290618, 0.14215059810410346, 0.22330515145382904, -0.009939133893354452, 0.289065892883652, 0.06047698858756203, 0.10304469682762886, 0.09512051503249519, 0.3208578161505651, 0.1413654440862907, 0.0761727246147505, -0.1516343363925714, 0.1235717540053097, -0.0191097125822158] |
1,802.03126 | On Motzkin's Method for Inconsistent Linear Systems | Iterative linear solvers have gained recent popularity due to their
computational efficiency and low memory footprint for large-scale linear
systems. The relaxation method, or Motzkin's method, can be viewed as an
iterative method that projects the current estimation onto the solution
hyperplane corresponding to the most violated constraint. Although this leads
to an optimal selection strategy for consistent systems, for inconsistent least
square problems, the strategy presents a tradeoff between convergence rate and
solution accuracy. We provide a theoretical analysis that shows Motzkin's
method offers an initially accelerated convergence rate and this acceleration
depends on the dynamic range of the residual. We quantify this acceleration for
Gaussian systems as a concrete example. Lastly, we include experimental
evidence on real and synthetic systems that support the analysis.
| math.NA | iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for largescale linear systems the relaxation method or motzkins method can be viewed as an iterative method that projects the current estimation onto the solution hyperplane corresponding to the most violated constraint although this leads to an optimal selection strategy for consistent systems for inconsistent least square problems the strategy presents a tradeoff between convergence rate and solution accuracy we provide a theoretical analysis that shows motzkins method offers an initially accelerated convergence rate and this acceleration depends on the dynamic range of the residual we quantify this acceleration for gaussian systems as a concrete example lastly we include experimental evidence on real and synthetic systems that support the analysis | [['iterative', 'linear', 'solvers', 'have', 'gained', 'recent', 'popularity', 'due', 'to', 'their', 'computational', 'efficiency', 'and', 'low', 'memory', 'footprint', 'for', 'largescale', 'linear', 'systems', 'the', 'relaxation', 'method', 'or', 'motzkins', 'method', 'can', 'be', 'viewed', 'as', 'an', 'iterative', 'method', 'that', 'projects', 'the', 'current', 'estimation', 'onto', 'the', 'solution', 'hyperplane', 'corresponding', 'to', 'the', 'most', 'violated', 'constraint', 'although', 'this', 'leads', 'to', 'an', 'optimal', 'selection', 'strategy', 'for', 'consistent', 'systems', 'for', 'inconsistent', 'least', 'square', 'problems', 'the', 'strategy', 'presents', 'a', 'tradeoff', 'between', 'convergence', 'rate', 'and', 'solution', 'accuracy', 'we', 'provide', 'a', 'theoretical', 'analysis', 'that', 'shows', 'motzkins', 'method', 'offers', 'an', 'initially', 'accelerated', 'convergence', 'rate', 'and', 'this', 'acceleration', 'depends', 'on', 'the', 'dynamic', 'range', 'of', 'the', 'residual', 'we', 'quantify', 'this', 'acceleration', 'for', 'gaussian', 'systems', 'as', 'a', 'concrete', 'example', 'lastly', 'we', 'include', 'experimental', 'evidence', 'on', 'real', 'and', 'synthetic', 'systems', 'that', 'support', 'the', 'analysis']] | [-0.10792014327654172, -0.025179522324169593, -0.10215455172435632, 0.06649835177675067, -0.07254872864873577, -0.1417619590832305, 0.06524068809443316, 0.39793567380143535, -0.2934411462841718, -0.29870189251821666, 0.14953447344698131, -0.23497311878969732, -0.15211702427375942, 0.262172318350095, -0.07892725713521478, 0.08167258248062036, 0.09546025782927042, -0.019767971784901982, -0.08403662911668006, -0.26513701693953146, 0.2424006416122355, 0.12217432301535848, 0.32883052264399354, 0.050668950656443716, 0.13466870837700776, -0.009054102639238986, -0.010486524884722062, 0.04145422663229207, -0.0958101127789488, 0.13297114333522225, 0.22276790105989056, 0.18967826864016907, 0.3245375758657853, -0.40224691622314, -0.19217983199771316, 0.09657724055882898, 0.1799756324672628, 0.12318131842813085, -0.11239242074560256, -0.22332365226946652, 0.08294447816701399, -0.1865951890896891, -0.1098437351248567, -0.1301151478500475, -0.017972765630850242, 0.02691811468777439, -0.30514788994979525, 0.11108443276247099, 0.07143790483666909, 0.042141540707754235, -0.07415222010523495, -0.13419138158242855, 0.05535869195406872, 0.06414179778325238, 0.0508046131728897, 0.032892411899945094, 0.11072647088532528, -0.0883684687312722, -0.14965870799053282, 0.361142663408943, -0.05680864975817265, -0.21313057123916224, 0.23057292767667345, -0.04147527751971095, -0.12000705604256677, 0.1353762546214201, 0.24676441551289624, 0.11506514429366069, -0.11454199231599295, 0.053690332095443626, -0.01299426262266934, 0.1939377195297903, 0.002962219709944394, 0.013788748894714646, 0.18273628877091502, 0.20795290161936825, 0.13503739964549563, 0.13497841838167035, -0.06294517895753776, -0.10857455120495861, -0.26852335981536835, -0.13998425301970058, -0.18136906968836214, 0.0016386641304023445, -0.11864888761515936, -0.13288375099618283, 0.3371803824760256, 0.17863231718111489, 0.1823014345995727, 0.09075833622750545, 0.3276356091456754, 0.14376536485302957, 0.021651296157552492, 0.09098971441447262, 0.2272075084518523, 0.09645681473101297, 0.10960992266764007, -0.2577767127437428, 0.08356152061421039, 0.05328151125032159] |
1,802.03127 | Robust and Sparse Regression in GLM by Stochastic Optimization | The generalized linear model (GLM) plays a key role in regression analyses.
In high-dimensional data, the sparse GLM has been used but it is not robust
against outliers. Recently, the robust methods have been proposed for the
specific example of the sparse GLM. Among them, we focus on the robust and
sparse linear regression based on the $\gamma$-divergence. The estimator of the
$\gamma$-divergence has strong robustness under heavy contamination. In this
paper, we extend the robust and sparse linear regression based on the
$\gamma$-divergence to the robust and sparse GLM based on the
$\gamma$-divergence with a stochastic optimization approach in order to obtain
the estimate. We adopt the randomized stochastic projected gradient descent as
a stochastic optimization approach and extend the established convergence
property to the classical first-order necessary condition. By virtue of the
stochastic optimization approach, we can efficiently estimate parameters for
very large problems. Particularly, we show the linear regression, logistic
regression and Poisson regression with $L_1$ regularization in detail as
specific examples of robust and sparse GLM. In numerical experiments and real
data analysis, the proposed method outperformed comparative methods.
| stat.ML stat.ME | the generalized linear model glm plays a key role in regression analyses in highdimensional data the sparse glm has been used but it is not robust against outliers recently the robust methods have been proposed for the specific example of the sparse glm among them we focus on the robust and sparse linear regression based on the gammadivergence the estimator of the gammadivergence has strong robustness under heavy contamination in this paper we extend the robust and sparse linear regression based on the gammadivergence to the robust and sparse glm based on the gammadivergence with a stochastic optimization approach in order to obtain the estimate we adopt the randomized stochastic projected gradient descent as a stochastic optimization approach and extend the established convergence property to the classical firstorder necessary condition by virtue of the stochastic optimization approach we can efficiently estimate parameters for very large problems particularly we show the linear regression logistic regression and poisson regression with l_1 regularization in detail as specific examples of robust and sparse glm in numerical experiments and real data analysis the proposed method outperformed comparative methods | [['the', 'generalized', 'linear', 'model', 'glm', 'plays', 'a', 'key', 'role', 'in', 'regression', 'analyses', 'in', 'highdimensional', 'data', 'the', 'sparse', 'glm', 'has', 'been', 'used', 'but', 'it', 'is', 'not', 'robust', 'against', 'outliers', 'recently', 'the', 'robust', 'methods', 'have', 'been', 'proposed', 'for', 'the', 'specific', 'example', 'of', 'the', 'sparse', 'glm', 'among', 'them', 'we', 'focus', 'on', 'the', 'robust', 'and', 'sparse', 'linear', 'regression', 'based', 'on', 'the', 'gammadivergence', 'the', 'estimator', 'of', 'the', 'gammadivergence', 'has', 'strong', 'robustness', 'under', 'heavy', 'contamination', 'in', 'this', 'paper', 'we', 'extend', 'the', 'robust', 'and', 'sparse', 'linear', 'regression', 'based', 'on', 'the', 'gammadivergence', 'to', 'the', 'robust', 'and', 'sparse', 'glm', 'based', 'on', 'the', 'gammadivergence', 'with', 'a', 'stochastic', 'optimization', 'approach', 'in', 'order', 'to', 'obtain', 'the', 'estimate', 'we', 'adopt', 'the', 'randomized', 'stochastic', 'projected', 'gradient', 'descent', 'as', 'a', 'stochastic', 'optimization', 'approach', 'and', 'extend', 'the', 'established', 'convergence', 'property', 'to', 'the', 'classical', 'firstorder', 'necessary', 'condition', 'by', 'virtue', 'of', 'the', 'stochastic', 'optimization', 'approach', 'we', 'can', 'efficiently', 'estimate', 'parameters', 'for', 'very', 'large', 'problems', 'particularly', 'we', 'show', 'the', 'linear', 'regression', 'logistic', 'regression', 'and', 'poisson', 'regression', 'with', 'l_1', 'regularization', 'in', 'detail', 'as', 'specific', 'examples', 'of', 'robust', 'and', 'sparse', 'glm', 'in', 'numerical', 'experiments', 'and', 'real', 'data', 'analysis', 'the', 'proposed', 'method', 'outperformed', 'comparative', 'methods']] | [-0.016521596872690517, -0.0639797268801781, -0.09608021708805867, 0.10384989950438209, -0.10639084525701534, -0.20259777331327805, 0.019816753291016027, 0.4041861989051918, -0.2954853696677366, -0.23876462438871546, 0.17772964926250787, -0.22248375210198548, -0.24069484761760881, 0.19323948076977063, -0.12569196517910056, 0.19312660450044553, 0.06590240629379704, 0.00792592244294009, -0.10362710316202355, -0.297833054498235, 0.2780751874441373, 0.08236805716201236, 0.31037102940955447, -0.04044443068935541, 0.14302968942621325, 0.052667116588541396, -0.06750461390455727, 0.04529283886973853, -0.06950582670241269, 0.15154815897793392, 0.2705350866123952, 0.13872419382303017, 0.38347787002376355, -0.38623153121093584, -0.23591139104441217, 0.14153593312948942, 0.09287935912626913, 0.08740164884086189, -0.053533530675680785, -0.2862686682187143, 0.0875163192280614, -0.14102953227359008, -0.043598899571988425, -0.1773466268717184, -0.07977285041712998, 0.027871749358750433, -0.379328017227372, 0.11467462201358476, 0.07153543349243496, 0.0470252328481057, -0.03725685145517638, -0.1816399302562607, 0.025374109046648212, 0.02266271268093928, 0.0715026963086127, -0.012644233428898567, 0.09234205717628038, -0.06354817295258691, -0.11856268739004625, 0.3393084275602399, -0.09452317919661012, -0.25484930287252683, 0.18354917475012197, -0.041295776095958886, -0.20722675642069896, 0.06949400552421238, 0.2795746834144566, 0.12200648029451895, -0.15037775408639445, 0.09393844657858752, -0.07212833011309143, 0.1146517465052658, -0.023381278439185738, -0.048832691305118504, 0.09533887613396787, 0.21385005469143878, 0.12093595642459075, 0.1404050627850248, -0.15488340655393273, -0.10483552270716494, -0.24546510982199934, -0.06714146961, -0.1868552776216402, -0.07853241116271285, -0.16565225428789968, -0.17788334337414288, 0.39741132908393856, 0.19011464203651257, 0.19787759458025297, 0.0914802349839217, 0.33288840953352267, 0.1366989187262647, 0.052593051849055245, 0.09543170017836605, 0.21968265659496433, 0.1900224118440061, 0.04806606658820897, -0.23645987418922979, 0.12247049211539694, 0.07225680850125606] |
1,802.03128 | Exceed Improved Efficient Perovskite Solar Cells Under Dual-Irradiation
System | In general, perovskite solar cells (PSC) with a sensitized or thin film
architecture absorb light from a single illumination. This paper reported a PSC
architecture with a semitransparent Au/ITO counter electrode, which allows
light to pass it partially. When the device was illuminated simultaneously from
both the FTO and Au/ITO sides, the PSC has achieved an overall power conversion
efficiency (PCE) as high as 20.1% under high light intensity (1.4 sun), which
is much higher than that of the single-irradiation system.
| physics.app-ph | in general perovskite solar cells psc with a sensitized or thin film architecture absorb light from a single illumination this paper reported a psc architecture with a semitransparent auito counter electrode which allows light to pass it partially when the device was illuminated simultaneously from both the fto and auito sides the psc has achieved an overall power conversion efficiency pce as high as 201 under high light intensity 14 sun which is much higher than that of the singleirradiation system | [['in', 'general', 'perovskite', 'solar', 'cells', 'psc', 'with', 'a', 'sensitized', 'or', 'thin', 'film', 'architecture', 'absorb', 'light', 'from', 'a', 'single', 'illumination', 'this', 'paper', 'reported', 'a', 'psc', 'architecture', 'with', 'a', 'semitransparent', 'auito', 'counter', 'electrode', 'which', 'allows', 'light', 'to', 'pass', 'it', 'partially', 'when', 'the', 'device', 'was', 'illuminated', 'simultaneously', 'from', 'both', 'the', 'fto', 'and', 'auito', 'sides', 'the', 'psc', 'has', 'achieved', 'an', 'overall', 'power', 'conversion', 'efficiency', 'pce', 'as', 'high', 'as', '201', 'under', 'high', 'light', 'intensity', '14', 'sun', 'which', 'is', 'much', 'higher', 'than', 'that', 'of', 'the', 'singleirradiation', 'system']] | [-0.040636587786512114, 0.11597190660783478, -0.020669674607723627, -0.05473902529010024, -0.029120415413322356, -0.20451373557966107, 0.09203584214153054, 0.43242943009886986, -0.24086559432534835, -0.35003593515676373, 0.08687771659028024, -0.2923397934812387, -0.12264541265530846, 0.23307873874317664, -0.13156642083030862, 0.03629338288476738, 0.028769893715014823, -0.031602434118469365, -0.025757046138796095, -0.16139624076776016, 0.18475896340962022, 0.10206671949858084, 0.3362612158466035, 0.011337039278050024, 0.13417700622588968, -0.04613705563585823, 0.10301462861780937, -0.023164351745389212, -0.0006382534708954596, 0.10122770058194128, 0.1877279866834541, 0.04547078240041932, 0.21036561033449686, -0.43762768048028916, -0.2487182940881795, -0.00262770289555192, 0.1310455105625666, 0.0211175877857619, -0.11794555941238426, -0.2058211144310637, 0.1028255474976061, -0.15195574850823063, -0.0944842321690745, 0.06271413211018229, -0.011815932782319112, 0.01167444634036376, -0.2878609254205516, -0.02339356211730494, 0.049460170683092795, 0.0552885761209883, -0.06037618301119297, -0.10828639516451706, -0.10165529773952678, 0.07728161985981458, -0.001996622946208868, 0.10635754060095702, 0.175803951250437, -0.12186068845375513, -0.036609735718976036, 0.3836872611935131, -0.07508758677095802, -0.13742371568551812, 0.18893786346635374, -0.21716740432505807, -0.029275871789417207, 0.19246965834799296, 0.15372659540914285, 0.16150042284817362, -0.15953320549977854, -0.01625354704484403, -0.02793158004537989, 0.2300246357678985, 0.13230406150269586, 0.061255665637033344, 0.24718511145776853, 0.23501661701354748, 0.03078085093950041, 0.17756950337356195, -0.17860108418151355, -0.0028127200471667144, -0.18534407321698007, -0.18313489432255617, -0.10781764508320545, 0.08434813107268359, -0.08288639348626393, -0.14085667764242643, 0.4001405871867274, 0.10677347931628808, 0.14953850825818685, -0.027244693919037204, 0.3601585561648393, 0.12336111040666509, 0.11643944186373399, 0.058694504505883045, 0.3133157843198532, 0.11098879042830771, 0.18249466305151613, -0.17824220081839043, 0.0637165120181938, -0.02834743232681201] |
1,802.03129 | Rank Selection and Depth Conditions for Balanced Simplicial Complexes | We prove some new rank selection theorems for balanced simplicial complexes.
Specifically, we prove that rank selected subcomplexes of balanced simplicial
complexes satisfying Serre's condition $(S_{\ell})$ retain $(S_{\ell})$. We
also provide a formula for the depth of a balanced simplicial complex in terms
of reduced homologies of its rank selected subcomplexes. By passing to a
barycentric subdivision, our results give information about Serre's condition
and the depth of any simplicial compex. Our results extend rank selection
theorems for depth proved by Stanley, Munkres, and Hibi.
| math.AC math.CO | we prove some new rank selection theorems for balanced simplicial complexes specifically we prove that rank selected subcomplexes of balanced simplicial complexes satisfying serres condition s_ell retain s_ell we also provide a formula for the depth of a balanced simplicial complex in terms of reduced homologies of its rank selected subcomplexes by passing to a barycentric subdivision our results give information about serres condition and the depth of any simplicial compex our results extend rank selection theorems for depth proved by stanley munkres and hibi | [['we', 'prove', 'some', 'new', 'rank', 'selection', 'theorems', 'for', 'balanced', 'simplicial', 'complexes', 'specifically', 'we', 'prove', 'that', 'rank', 'selected', 'subcomplexes', 'of', 'balanced', 'simplicial', 'complexes', 'satisfying', 'serres', 'condition', 's_ell', 'retain', 's_ell', 'we', 'also', 'provide', 'a', 'formula', 'for', 'the', 'depth', 'of', 'a', 'balanced', 'simplicial', 'complex', 'in', 'terms', 'of', 'reduced', 'homologies', 'of', 'its', 'rank', 'selected', 'subcomplexes', 'by', 'passing', 'to', 'a', 'barycentric', 'subdivision', 'our', 'results', 'give', 'information', 'about', 'serres', 'condition', 'and', 'the', 'depth', 'of', 'any', 'simplicial', 'compex', 'our', 'results', 'extend', 'rank', 'selection', 'theorems', 'for', 'depth', 'proved', 'by', 'stanley', 'munkres', 'and', 'hibi']] | [-0.13791795221759992, 0.03498317173079533, -0.06590547040104866, 0.12107304211925057, -0.0986980637508061, -0.1581662780221771, 0.040446619842858876, 0.34367439646054715, -0.30809472514426006, -0.1779124086613164, 0.09304846725015736, -0.2027040319845957, -0.16970264072913457, 0.12312339491703932, -0.21166353439364363, -0.050577885965022315, 0.11044987438191824, 0.05001194244558813, -0.04726134987602777, -0.38886928420294736, 0.39898653744774704, -0.004573899858138141, 0.2042351091198404, 0.13920880604316208, 0.12363959889968529, 0.049871093648321485, -0.06817684554878403, 0.048898394723587174, -0.26763398220312357, 0.17212668663876898, 0.2999765999176923, 0.1748225909548209, 0.1849749517681844, -0.369964558412047, -0.1289128409972524, 0.1929194195963004, 0.06095048945725841, 0.03137780964812812, -0.018694563127835007, -0.25983813786331345, 0.1857925204176675, -0.11918098265921478, -0.18634321704945145, -0.11935147350544438, 0.04831744424505707, 0.049555490746655884, -0.3018598311854636, -0.0193392671072883, 0.16458446806406274, 0.14240826226990014, -0.054600017487674075, -0.18442733635139816, -0.08606555245488005, 0.03655820712721085, -0.13104460399378748, -0.027667743064846623, 0.08383803566479507, -0.10873273997841512, -0.14758996620692094, 0.3489530165624969, 0.03732211177018197, -0.23013537777039936, 0.11310164876391783, -0.11297794443774312, -0.18730701411909917, 0.14073813449153127, 0.023917658648946707, 0.16752267389092595, -0.001671542490229887, 0.1004062583875459, -0.16891382387017503, 0.06652827111675459, 0.21480382206466267, 0.03924453123198712, 0.06981632343000349, 0.08289035909316118, 0.1517202731112347, 0.2072019378599875, 0.011117800445679357, -0.0005877754130565069, -0.27244237407165417, -0.19611914022003904, -0.16369174524374744, 0.11578088621882832, -0.2257362667193828, -0.16842188190887955, 0.36692618850399467, 0.08249412285273566, 0.15864525405306587, 0.22388903249931685, 0.2782731070676271, 0.013589884754379883, 0.03001684758483487, 0.034354674887350375, 0.06903848824098104, 0.2740459449644036, -0.008356459044358309, -0.07789333380676587, 0.0285145241602817, 0.2913371383869911] |
1,802.0313 | Defect states in hexagonal boron nitride: Assignments of observed
properties and prediction of properties relevant to quantum computation | Key properties of nine possible defect sites in hexagonal boron nitride
(h-BN) are predicted using density-functional theory and are corrected by
applying results from high-level ab initio calculations. Observed h-BN
electron-paramagnetic resonance signals at 22.4, 20.83, and 352.70 MHz are
assigned to VN, CN, and VNO2B, respectively, while the observed photoemission
at 1.95 eV is assigned to VNCB. Detailed consideration of the available excited
states, allowed spin-orbit couplings, zero-field splitting, and optical
transitions are made for the two related defects VNCB and VBCN. VNCB is
proposed for realizing long-lived quantum memory in h-BN. VBCN is predicted to
have a triplet ground state, implying that spin initialization by optical means
is feasible and suitable optical excitations are identified, making this defect
of interest for possible quantum-qubit operations.
| physics.comp-ph cond-mat.mtrl-sci | key properties of nine possible defect sites in hexagonal boron nitride hbn are predicted using densityfunctional theory and are corrected by applying results from highlevel ab initio calculations observed hbn electronparamagnetic resonance signals at 224 2083 and 35270 mhz are assigned to vn cn and vno2b respectively while the observed photoemission at 195 ev is assigned to vncb detailed consideration of the available excited states allowed spinorbit couplings zerofield splitting and optical transitions are made for the two related defects vncb and vbcn vncb is proposed for realizing longlived quantum memory in hbn vbcn is predicted to have a triplet ground state implying that spin initialization by optical means is feasible and suitable optical excitations are identified making this defect of interest for possible quantumqubit operations | [['key', 'properties', 'of', 'nine', 'possible', 'defect', 'sites', 'in', 'hexagonal', 'boron', 'nitride', 'hbn', 'are', 'predicted', 'using', 'densityfunctional', 'theory', 'and', 'are', 'corrected', 'by', 'applying', 'results', 'from', 'highlevel', 'ab', 'initio', 'calculations', 'observed', 'hbn', 'electronparamagnetic', 'resonance', 'signals', 'at', '224', '2083', 'and', '35270', 'mhz', 'are', 'assigned', 'to', 'vn', 'cn', 'and', 'vno2b', 'respectively', 'while', 'the', 'observed', 'photoemission', 'at', '195', 'ev', 'is', 'assigned', 'to', 'vncb', 'detailed', 'consideration', 'of', 'the', 'available', 'excited', 'states', 'allowed', 'spinorbit', 'couplings', 'zerofield', 'splitting', 'and', 'optical', 'transitions', 'are', 'made', 'for', 'the', 'two', 'related', 'defects', 'vncb', 'and', 'vbcn', 'vncb', 'is', 'proposed', 'for', 'realizing', 'longlived', 'quantum', 'memory', 'in', 'hbn', 'vbcn', 'is', 'predicted', 'to', 'have', 'a', 'triplet', 'ground', 'state', 'implying', 'that', 'spin', 'initialization', 'by', 'optical', 'means', 'is', 'feasible', 'and', 'suitable', 'optical', 'excitations', 'are', 'identified', 'making', 'this', 'defect', 'of', 'interest', 'for', 'possible', 'quantumqubit', 'operations']] | [-0.11638061235741286, 0.17080029897818652, 0.012379264396925767, 0.027731745091538567, 0.0004009776127835115, -0.20157265443898117, 0.1012152460355234, 0.5094803671197344, -0.21859148910734802, -0.3186853356038531, 0.02005826750731406, -0.3395334048252456, -0.08037317187214892, 0.1674916222245277, 0.07453825400831798, 0.08140728807387253, 0.04828322400571779, -0.04614190130960196, -0.05085087101809525, -0.19426536392129493, 0.22938556771647806, 0.031907058378177075, 0.2991584322725733, 0.08202576859621331, 0.01269906482193619, -0.0342574445103916, 0.047584533233505984, -0.026103318389505147, -0.14138818986860618, 0.12677832838999165, 0.28096693074912765, -0.047391810136226314, 0.19270556981985767, -0.44622967911418526, -0.16303463471122087, -0.00820326836546883, 0.11434319077137237, 0.15188845523516648, -0.06103150666846583, -0.31035622709508365, 0.09582917984807864, -0.11186012840286517, -0.08978890704068666, -0.13411723736595985, 0.020997766313666944, -0.02466413578610324, -0.2562503211122627, 0.06810808780137449, -0.03604047361101645, 0.06696693493037552, -0.1161043344104352, -0.17102167802707602, -0.12739100580026086, 0.05960605816217139, -0.020718698964143793, 0.03221307659793335, 0.1736673324194271, -0.04603432159832058, -0.1588163338950835, 0.40860333779516317, -0.030562470946460963, -0.05442792132186393, 0.1510066231363453, -0.1166836950307091, -0.12808127239501724, 0.1786194519411462, 0.033576479938831956, 0.08900328275437157, -0.14515447163479014, 0.05930249197893621, 0.035786741669289766, 0.1736131211509928, 0.0968098029998752, 0.12293254608909289, 0.25326182974786204, 0.16252427588915452, 0.004643107776064426, 0.09497746661654674, -0.13688081679865718, -0.051453198016194315, -0.20846534867450828, -0.11788339681612948, -0.2424248470691964, 0.0801001498863722, -0.013071654832310741, -0.1204172841195638, 0.38459721884379783, 0.10044973895419389, 0.13837622602198582, -0.06145095188403502, 0.21407902454569314, 0.09645828819678476, 0.09826361003797501, 0.01820414326696967, 0.28088893010281024, 0.17608296016405803, 0.035026734208804554, -0.2301742319386297, 0.03506442265740285, -0.014251995482482016] |
1,802.03131 | Large sieve inequality with power moduli for function fields | In this paper, we establish a general version of the large sieve with
additive characters for restricted sets of moduli in arbitrary dimension for
function fields. From this, we derive function field versions for the large
sieve in high dimensions and for power moduli.
| math.NT | in this paper we establish a general version of the large sieve with additive characters for restricted sets of moduli in arbitrary dimension for function fields from this we derive function field versions for the large sieve in high dimensions and for power moduli | [['in', 'this', 'paper', 'we', 'establish', 'a', 'general', 'version', 'of', 'the', 'large', 'sieve', 'with', 'additive', 'characters', 'for', 'restricted', 'sets', 'of', 'moduli', 'in', 'arbitrary', 'dimension', 'for', 'function', 'fields', 'from', 'this', 'we', 'derive', 'function', 'field', 'versions', 'for', 'the', 'large', 'sieve', 'in', 'high', 'dimensions', 'and', 'for', 'power', 'moduli']] | [-0.10246925633824007, 0.1010779560479436, -0.0671933979981325, 0.08334224541481076, -0.021036467800678856, -0.07681109196379442, 0.025503921684999528, 0.2701961834152991, -0.2856731264883737, -0.27341187913605774, 0.10361320072710938, -0.1848198449747129, -0.1515978246567432, 0.2345166028191505, -0.13457762642594223, 0.038625965445217764, 0.017869679087942295, -0.0008331895805895329, -0.03770943551154977, -0.31219247212125495, 0.4135652865198525, -0.02128823126920245, 0.2733636231754314, 0.020537979371676392, 0.12699528786734762, 0.10804531825918028, 0.01170810040044175, 0.048316023058511993, -0.1670203636061739, 0.2060031673595817, 0.28158111176030204, 0.04780847770267759, 0.2385916541415182, -0.3885084848681634, -0.16159560952589594, 0.16916982105679132, 0.11487300636178009, 0.1401801768859679, -0.037563677771355615, -0.18993875164199958, 0.12521036142822017, -0.16233776160515845, -0.17567262175196613, -0.1113834127318114, 0.0582854891307017, 0.07363426374186846, -0.34291745544495905, 0.05088152028408579, 0.011673471543789756, 0.14312342977659268, -0.0945199720392173, -0.14705783331671476, 0.13705582998227328, 0.06324012512711553, 0.04528790594882925, 0.016445125217697667, 0.010589157125319947, -0.20721157021100886, -0.05129785839976235, 0.3084432089764794, -0.12113912047987635, -0.24383976285091855, 0.15168754553253, -0.1530621194026687, -0.19807159211698241, 0.05549040394411846, 0.24899850362403828, 0.14907950289886107, -0.05743745987472886, 0.19729496508873787, -0.06301321453330191, 0.12944353464990854, 0.09751542729579589, 0.025403018507693723, 0.1494623286165403, 0.0865499851801856, 0.0997049509208988, 0.25768869822125207, -0.06747708109800112, -0.04611488804221153, -0.35661069623363967, -0.22910730204206298, -0.1715332179870033, 0.09263211380775002, -0.18178111035343714, -0.21716959147968076, 0.3856250020590695, 0.1180527460846034, 0.21338082951578227, 0.18231043990024112, 0.24404669299044393, 0.1486210974187336, 0.09525436239147728, 0.09410672084513036, 0.1624238191341812, 0.15613438750998201, 0.033709669443355364, -0.07805742475267669, -0.035340268768116155, 0.1230913063892248] |
1,802.03132 | Infinity modulus and the essential metric | We study $\infty$-modulus on general metric spaces and establish its relation
to shortest lengths of paths. This connection was already known for modulus on
graphs, but the formulation in metric measure spaces requires more attention to
exceptional families. We use this to define a metric that we call the essential
metric, and show how this recovers a metric that had already been advanced in
the literature by De Cecco and Palmieri.
| math.MG | we study inftymodulus on general metric spaces and establish its relation to shortest lengths of paths this connection was already known for modulus on graphs but the formulation in metric measure spaces requires more attention to exceptional families we use this to define a metric that we call the essential metric and show how this recovers a metric that had already been advanced in the literature by de cecco and palmieri | [['we', 'study', 'inftymodulus', 'on', 'general', 'metric', 'spaces', 'and', 'establish', 'its', 'relation', 'to', 'shortest', 'lengths', 'of', 'paths', 'this', 'connection', 'was', 'already', 'known', 'for', 'modulus', 'on', 'graphs', 'but', 'the', 'formulation', 'in', 'metric', 'measure', 'spaces', 'requires', 'more', 'attention', 'to', 'exceptional', 'families', 'we', 'use', 'this', 'to', 'define', 'a', 'metric', 'that', 'we', 'call', 'the', 'essential', 'metric', 'and', 'show', 'how', 'this', 'recovers', 'a', 'metric', 'that', 'had', 'already', 'been', 'advanced', 'in', 'the', 'literature', 'by', 'de', 'cecco', 'and', 'palmieri']] | [-0.12146911828811946, 0.061313832468087116, -0.12557304427027702, 0.1510990591204193, -0.1381991246715188, -0.09011777794387724, 0.0438573489763907, 0.42531423409070285, -0.22323824833812458, -0.26893276226307666, 0.11367233120503702, -0.26601356102951934, -0.2530802267204438, 0.19401186493092348, -0.1640246609225869, 0.019896980420786088, 0.056200050536010945, 0.08495195947055306, -0.0929568859282881, -0.24707201554972147, 0.39318979585254316, 0.05524991638958454, 0.27727333833130874, 0.04709809040900187, 0.12777249153836498, 0.02416055604948529, -0.03728320760918515, 0.05237816411203572, -0.20457175642888095, 0.1477963551612837, 0.2307522189138191, 0.1556725440602999, 0.2382281029729971, -0.3338700177946261, -0.230740103952121, 0.1693504389525125, 0.09216479497429515, 0.08461238276213408, -0.006844889579848054, -0.25571704090439845, 0.11292219977559788, -0.1254086542076298, -0.10598563829636468, -0.0872753772485469, 0.07736295458328511, -0.026464015182240733, -0.1628534968942404, -0.03182830660870033, 0.07303380650867308, -0.001042960278157677, -0.058161364706964896, -0.0680947239161469, 0.03535562195549054, 0.10766914454288781, 0.03590046257844993, 0.08926269218791276, 0.02188660068869857, -0.04753062867093831, -0.12188584859749037, 0.35776228790304493, -0.05516292037708419, -0.20730511617979833, 0.17316211137388435, -0.12226362154719286, -0.1727296552487782, 0.02456806789019278, 0.1535831212465252, 0.14861676937767437, -0.14852539040148258, 0.13005890600532957, -0.04277491620076554, 0.11077581208997539, 0.13676031813291567, 0.04915576681710913, 0.11218854035916073, 0.11710169472332511, 0.10740328134436693, 0.16592080581800214, -0.0039036833348550966, -0.09827463016678978, -0.24765924589176264, -0.1926835861323135, -0.13763070802337357, 0.0640527954391603, -0.10848057838094453, -0.19126360317958252, 0.35233662133770327, 0.1387413911787527, 0.19686073727539874, 0.12053302067465016, 0.22574974115871424, 0.04290754381301148, 0.07300987807268809, 0.08642125838835324, 0.2671647483349911, 0.16104665233953191, 0.0778519847696381, -0.116805094600256, 0.05970056157675572, 0.13418748234897585] |
1,802.03133 | Batch Kalman Normalization: Towards Training Deep Neural Networks with
Micro-Batches | As an indispensable component, Batch Normalization (BN) has successfully
improved the training of deep neural networks (DNNs) with mini-batches, by
normalizing the distribution of the internal representation for each hidden
layer. However, the effectiveness of BN would diminish with scenario of
micro-batch (e.g., less than 10 samples in a mini-batch), since the estimated
statistics in a mini-batch are not reliable with insufficient samples. In this
paper, we present a novel normalization method, called Batch Kalman
Normalization (BKN), for improving and accelerating the training of DNNs,
particularly under the context of micro-batches. Specifically, unlike the
existing solutions treating each hidden layer as an isolated system, BKN treats
all the layers in a network as a whole system, and estimates the statistics of
a certain layer by considering the distributions of all its preceding layers,
mimicking the merits of Kalman Filtering. BKN has two appealing properties.
First, it enables more stable training and faster convergence compared to
previous works. Second, training DNNs using BKN performs substantially better
than those using BN and its variants, especially when very small mini-batches
are presented. On the image classification benchmark of ImageNet, using BKN
powered networks we improve upon the best-published model-zoo results: reaching
74.0% top-1 val accuracy for InceptionV2. More importantly, using BKN achieves
the comparable accuracy with extremely smaller batch size, such as 64 times
smaller on CIFAR-10/100 and 8 times smaller on ImageNet.
| cs.CV cs.LG stat.ML | as an indispensable component batch normalization bn has successfully improved the training of deep neural networks dnns with minibatches by normalizing the distribution of the internal representation for each hidden layer however the effectiveness of bn would diminish with scenario of microbatch eg less than 10 samples in a minibatch since the estimated statistics in a minibatch are not reliable with insufficient samples in this paper we present a novel normalization method called batch kalman normalization bkn for improving and accelerating the training of dnns particularly under the context of microbatches specifically unlike the existing solutions treating each hidden layer as an isolated system bkn treats all the layers in a network as a whole system and estimates the statistics of a certain layer by considering the distributions of all its preceding layers mimicking the merits of kalman filtering bkn has two appealing properties first it enables more stable training and faster convergence compared to previous works second training dnns using bkn performs substantially better than those using bn and its variants especially when very small minibatches are presented on the image classification benchmark of imagenet using bkn powered networks we improve upon the bestpublished modelzoo results reaching 740 top1 val accuracy for inceptionv2 more importantly using bkn achieves the comparable accuracy with extremely smaller batch size such as 64 times smaller on cifar10100 and 8 times smaller on imagenet | [['as', 'an', 'indispensable', 'component', 'batch', 'normalization', 'bn', 'has', 'successfully', 'improved', 'the', 'training', 'of', 'deep', 'neural', 'networks', 'dnns', 'with', 'minibatches', 'by', 'normalizing', 'the', 'distribution', 'of', 'the', 'internal', 'representation', 'for', 'each', 'hidden', 'layer', 'however', 'the', 'effectiveness', 'of', 'bn', 'would', 'diminish', 'with', 'scenario', 'of', 'microbatch', 'eg', 'less', 'than', '10', 'samples', 'in', 'a', 'minibatch', 'since', 'the', 'estimated', 'statistics', 'in', 'a', 'minibatch', 'are', 'not', 'reliable', 'with', 'insufficient', 'samples', 'in', 'this', 'paper', 'we', 'present', 'a', 'novel', 'normalization', 'method', 'called', 'batch', 'kalman', 'normalization', 'bkn', 'for', 'improving', 'and', 'accelerating', 'the', 'training', 'of', 'dnns', 'particularly', 'under', 'the', 'context', 'of', 'microbatches', 'specifically', 'unlike', 'the', 'existing', 'solutions', 'treating', 'each', 'hidden', 'layer', 'as', 'an', 'isolated', 'system', 'bkn', 'treats', 'all', 'the', 'layers', 'in', 'a', 'network', 'as', 'a', 'whole', 'system', 'and', 'estimates', 'the', 'statistics', 'of', 'a', 'certain', 'layer', 'by', 'considering', 'the', 'distributions', 'of', 'all', 'its', 'preceding', 'layers', 'mimicking', 'the', 'merits', 'of', 'kalman', 'filtering', 'bkn', 'has', 'two', 'appealing', 'properties', 'first', 'it', 'enables', 'more', 'stable', 'training', 'and', 'faster', 'convergence', 'compared', 'to', 'previous', 'works', 'second', 'training', 'dnns', 'using', 'bkn', 'performs', 'substantially', 'better', 'than', 'those', 'using', 'bn', 'and', 'its', 'variants', 'especially', 'when', 'very', 'small', 'minibatches', 'are', 'presented', 'on', 'the', 'image', 'classification', 'benchmark', 'of', 'imagenet', 'using', 'bkn', 'powered', 'networks', 'we', 'improve', 'upon', 'the', 'bestpublished', 'modelzoo', 'results', 'reaching', '740', 'top1', 'val', 'accuracy', 'for', 'inceptionv2', 'more', 'importantly', 'using', 'bkn', 'achieves', 'the', 'comparable', 'accuracy', 'with', 'extremely', 'smaller', 'batch', 'size', 'such', 'as', '64', 'times', 'smaller', 'on', 'cifar10100', 'and', '8', 'times', 'smaller', 'on', 'imagenet']] | [-0.029755048299608587, 0.014668735922258062, -0.020800981268270367, 0.04539523379450353, -0.03192480831364121, -0.18174307660420277, 0.053404993415920456, 0.4291978726661846, -0.21745890784771754, -0.34801857647273626, 0.10393053918194614, -0.27825091537414937, -0.11745237541515707, 0.22060129259663977, -0.09328235389170515, 0.09108294480941831, 0.12716267965190223, 0.040961008255467994, -0.10448444493343695, -0.3260101302518722, 0.26425552774290145, 0.10479068660201288, 0.3380386868977854, -0.055378539008016925, 0.10621762401506044, -0.023011946236804585, -0.0031329570838511643, -0.013110794750932735, -0.02268068577885922, 0.14420391766664883, 0.201404235442169, 0.1317632885796851, 0.3293252288396552, -0.42068434278930034, -0.2085259827839317, 0.0940668962501692, 0.19604355198342155, 0.08921076910031077, -0.015343559489369989, -0.28017095447080864, 0.15406984329558582, -0.1663180950328528, -0.0010442855654809247, -0.10370787725734867, -0.01682322083057411, 0.01664099421274538, -0.27500550336155455, 0.07384280373317827, 0.0941695389620898, 0.049592629160830064, -0.038385022836640324, -0.2005558304091417, -0.008912907235259027, 0.11376472251995756, 0.03174573616247232, 0.052065275114217546, 0.15319116456687384, -0.19176654854540207, -0.07877655790479478, 0.3455873487370187, -0.07796899838183635, -0.1826463441156145, 0.19026469942024019, -0.023299776869335848, -0.1341923141337343, 0.11505953380797189, 0.18949487476135818, 0.14147504728814392, -0.11773630710281156, 0.01208000221129368, -0.018679143265584123, 0.18952052070138356, 0.08340784595878958, 0.005886230216435108, 0.08477244914760568, 0.27867177679722216, 0.05074256097105446, 0.14343954838522335, -0.1493450754532476, -0.06114996385989351, -0.20510473079048097, -0.10579128344972177, -0.1905260012922155, 0.010510579193035946, -0.16395819698134387, -0.13114079996726982, 0.3898292828622576, 0.19468622123352824, 0.260905796631848, 0.12020419802304291, 0.31877833008847867, 0.047803148739611764, 0.14673962122086728, 0.12578070574856706, 0.2144388926936428, 0.05683081996782372, 0.11219050430947008, -0.12927981783044137, 0.11390333481617027, 0.03656564547839623] |
1,802.03134 | Understanding and calibrating Density-Functional-Theory calculations
describing the energy and spectroscopy of defect sites in hexagonal boron
nitride | Defect states in 2D materials present many possible uses but both
experimental and computational characterization of their spectroscopic
properties is difficult. We provide and compare results from 13 DFT and ab
initio computational methods for up to 25 excited states of a paradigm system,
the VNCB defect in hexagonal boron nitride (h-BN). Studied include include: (i)
potentially catastrophic effects for computational methods arising from the
multi-reference nature of the closed-shell and open-shell states of the defect,
which intrinsically involves broken chemical bonds, (ii) differing results from
DFT and time-dependent DFT (TDDFT) calculations, (iii) comparison of cluster
models to periodic-slab models of the defect, (iv) the starkly differing
effects of nuclear relaxation on the various electronic states as broken bonds
try to heal that control the widths of photoabsorption and photoemission
spectra, (v) the effect of zero-point energy and entropy on free-energy
differences, (vi) defect-localized and conduction/valence band transition
natures, and (vii) strategies needed to ensure that the lowest-energy state of
a defect can be computationally identified.
| physics.comp-ph physics.chem-ph | defect states in 2d materials present many possible uses but both experimental and computational characterization of their spectroscopic properties is difficult we provide and compare results from 13 dft and ab initio computational methods for up to 25 excited states of a paradigm system the vncb defect in hexagonal boron nitride hbn studied include include i potentially catastrophic effects for computational methods arising from the multireference nature of the closedshell and openshell states of the defect which intrinsically involves broken chemical bonds ii differing results from dft and timedependent dft tddft calculations iii comparison of cluster models to periodicslab models of the defect iv the starkly differing effects of nuclear relaxation on the various electronic states as broken bonds try to heal that control the widths of photoabsorption and photoemission spectra v the effect of zeropoint energy and entropy on freeenergy differences vi defectlocalized and conductionvalence band transition natures and vii strategies needed to ensure that the lowestenergy state of a defect can be computationally identified | [['defect', 'states', 'in', '2d', 'materials', 'present', 'many', 'possible', 'uses', 'but', 'both', 'experimental', 'and', 'computational', 'characterization', 'of', 'their', 'spectroscopic', 'properties', 'is', 'difficult', 'we', 'provide', 'and', 'compare', 'results', 'from', '13', 'dft', 'and', 'ab', 'initio', 'computational', 'methods', 'for', 'up', 'to', '25', 'excited', 'states', 'of', 'a', 'paradigm', 'system', 'the', 'vncb', 'defect', 'in', 'hexagonal', 'boron', 'nitride', 'hbn', 'studied', 'include', 'include', 'i', 'potentially', 'catastrophic', 'effects', 'for', 'computational', 'methods', 'arising', 'from', 'the', 'multireference', 'nature', 'of', 'the', 'closedshell', 'and', 'openshell', 'states', 'of', 'the', 'defect', 'which', 'intrinsically', 'involves', 'broken', 'chemical', 'bonds', 'ii', 'differing', 'results', 'from', 'dft', 'and', 'timedependent', 'dft', 'tddft', 'calculations', 'iii', 'comparison', 'of', 'cluster', 'models', 'to', 'periodicslab', 'models', 'of', 'the', 'defect', 'iv', 'the', 'starkly', 'differing', 'effects', 'of', 'nuclear', 'relaxation', 'on', 'the', 'various', 'electronic', 'states', 'as', 'broken', 'bonds', 'try', 'to', 'heal', 'that', 'control', 'the', 'widths', 'of', 'photoabsorption', 'and', 'photoemission', 'spectra', 'v', 'the', 'effect', 'of', 'zeropoint', 'energy', 'and', 'entropy', 'on', 'freeenergy', 'differences', 'vi', 'defectlocalized', 'and', 'conductionvalence', 'band', 'transition', 'natures', 'and', 'vii', 'strategies', 'needed', 'to', 'ensure', 'that', 'the', 'lowestenergy', 'state', 'of', 'a', 'defect', 'can', 'be', 'computationally', 'identified']] | [-0.048486408100209454, 0.10301722236908972, -0.05889856354756789, 0.07141150238669731, 0.016519902956982455, -0.16865576466714793, 0.11598753713664006, 0.41282904371054785, -0.2543017160373204, -0.3150195921122125, -0.0005879006136886098, -0.3355012055401775, -0.11187201994330143, 0.1272835760786565, 0.033998037231239404, 0.06627434285809145, 0.050723891366611824, -0.0776720309487163, -0.09851635653335093, -0.1880111243716921, 0.2803886166660849, 0.03959672913011728, 0.28471719629103037, 0.10283882398242977, -0.012197083284880852, -0.030463420132273863, 0.03068679386862751, 0.031222072170313562, -0.1543775099080063, 0.15941978283826205, 0.2685383008474177, 0.02769208648100947, 0.22402274090338986, -0.5113571108629306, -0.19221662269397216, -0.0003786569404782671, 0.11539781498793286, 0.19013915901058212, -0.05059827109022687, -0.268340478851601, 0.04157792033811072, -0.15949089135480762, -0.11412936929952014, -0.12427254742237204, 0.01019207338245134, 0.026079781765513347, -0.20027702719812762, 0.11984188917805581, -0.018936146108546492, 0.06478940171492109, -0.13913016118335, -0.18291750443802976, -0.10801661011240812, 0.07834009343730003, 0.020916462823692146, -0.023566390599730903, 0.18674451131373643, -0.11191653541825486, -0.14192334837985762, 0.4498467543585734, -0.009852839688855138, -0.0883616832578837, 0.22303184179419822, -0.09178952503822405, -0.15239366287026893, 0.17025438965524012, 0.08958325804578084, 0.0983230874118762, -0.10324365352033496, 0.09574065907173931, 0.08084439083891497, 0.17415159298953684, 0.02824024541416403, 0.10104130886382226, 0.1733057531605785, 0.11104140106842599, 0.013911714916696039, 0.08171838349733276, -0.13093493376491647, -0.09430972069367823, -0.24407002903295286, -0.14862927218165362, -0.19138073811702655, 0.04707896319415533, -0.03974180939866611, -0.21412209671442256, 0.4119236336301335, 0.09710139772487861, 0.13097342142383708, -0.014689744346436452, 0.20089311730116605, 0.07004667993451497, 0.05455985341475091, 0.0027744267467465816, 0.23934511867718714, 0.192102076693184, 0.05961352853725354, -0.293401856169415, 0.05626215023750609, 0.003800630250550581] |
1,802.03135 | Relations between variability of the photospheric and interplanetary
magnetic fields, solar wind and geomagnetic characteristics | Large scale solar magnetic field topology has a great influence on the
structure of the corona, heliosphera and geomagnetic perturbations.
Data obtained over the last three solar cycles have been analysed to reveal
the relationships between the photospheric field measured along the line of
sight by the WSO group at 30 levels of heliolatitudes from -75 to 75 degrees
and the interplanetary magnetic field The main aim of this first paper is to
make a direct comparison between the basic structure and dynamics of the
photospheric magnetic field and components and intensity of the interplanetary
magnetic field % solar wind and geomagnetic parameters without using
theoretical assumptions, models, physical expectations, etc.
The second paper by Gavryuseva, 2018d presents the raports between different
characteristics of the solar wind at the Earth orbit, and geomagnetic
parameters provided by the OMNI team. % Data obtained over the last three solar
cycles have been analysed % to reveal the relationships % between the
photospheric field measured along the line of sight % by the WSO group % at
heliolatitudes from -75 to 75 degrees averaged over one year % and the
interplanetary magnetic field, different characteristics % of the solar wind at
the Earth orbit, and geomagnetic parameters. % provided by the OMNI team.
The heliospheric and geomagnetic data are found to be divided into two groups
characterized by their response to variability of the solar magnetic field
latitudinal structures on short and on long time scales.
| astro-ph.SR physics.geo-ph physics.plasm-ph | large scale solar magnetic field topology has a great influence on the structure of the corona heliosphera and geomagnetic perturbations data obtained over the last three solar cycles have been analysed to reveal the relationships between the photospheric field measured along the line of sight by the wso group at 30 levels of heliolatitudes from 75 to 75 degrees and the interplanetary magnetic field the main aim of this first paper is to make a direct comparison between the basic structure and dynamics of the photospheric magnetic field and components and intensity of the interplanetary magnetic field solar wind and geomagnetic parameters without using theoretical assumptions models physical expectations etc the second paper by gavryuseva 2018d presents the raports between different characteristics of the solar wind at the earth orbit and geomagnetic parameters provided by the omni team data obtained over the last three solar cycles have been analysed to reveal the relationships between the photospheric field measured along the line of sight by the wso group at heliolatitudes from 75 to 75 degrees averaged over one year and the interplanetary magnetic field different characteristics of the solar wind at the earth orbit and geomagnetic parameters provided by the omni team the heliospheric and geomagnetic data are found to be divided into two groups characterized by their response to variability of the solar magnetic field latitudinal structures on short and on long time scales | [['large', 'scale', 'solar', 'magnetic', 'field', 'topology', 'has', 'a', 'great', 'influence', 'on', 'the', 'structure', 'of', 'the', 'corona', 'heliosphera', 'and', 'geomagnetic', 'perturbations', 'data', 'obtained', 'over', 'the', 'last', 'three', 'solar', 'cycles', 'have', 'been', 'analysed', 'to', 'reveal', 'the', 'relationships', 'between', 'the', 'photospheric', 'field', 'measured', 'along', 'the', 'line', 'of', 'sight', 'by', 'the', 'wso', 'group', 'at', '30', 'levels', 'of', 'heliolatitudes', 'from', '75', 'to', '75', 'degrees', 'and', 'the', 'interplanetary', 'magnetic', 'field', 'the', 'main', 'aim', 'of', 'this', 'first', 'paper', 'is', 'to', 'make', 'a', 'direct', 'comparison', 'between', 'the', 'basic', 'structure', 'and', 'dynamics', 'of', 'the', 'photospheric', 'magnetic', 'field', 'and', 'components', 'and', 'intensity', 'of', 'the', 'interplanetary', 'magnetic', 'field', 'solar', 'wind', 'and', 'geomagnetic', 'parameters', 'without', 'using', 'theoretical', 'assumptions', 'models', 'physical', 'expectations', 'etc', 'the', 'second', 'paper', 'by', 'gavryuseva', '2018d', 'presents', 'the', 'raports', 'between', 'different', 'characteristics', 'of', 'the', 'solar', 'wind', 'at', 'the', 'earth', 'orbit', 'and', 'geomagnetic', 'parameters', 'provided', 'by', 'the', 'omni', 'team', 'data', 'obtained', 'over', 'the', 'last', 'three', 'solar', 'cycles', 'have', 'been', 'analysed', 'to', 'reveal', 'the', 'relationships', 'between', 'the', 'photospheric', 'field', 'measured', 'along', 'the', 'line', 'of', 'sight', 'by', 'the', 'wso', 'group', 'at', 'heliolatitudes', 'from', '75', 'to', '75', 'degrees', 'averaged', 'over', 'one', 'year', 'and', 'the', 'interplanetary', 'magnetic', 'field', 'different', 'characteristics', 'of', 'the', 'solar', 'wind', 'at', 'the', 'earth', 'orbit', 'and', 'geomagnetic', 'parameters', 'provided', 'by', 'the', 'omni', 'team', 'the', 'heliospheric', 'and', 'geomagnetic', 'data', 'are', 'found', 'to', 'be', 'divided', 'into', 'two', 'groups', 'characterized', 'by', 'their', 'response', 'to', 'variability', 'of', 'the', 'solar', 'magnetic', 'field', 'latitudinal', 'structures', 'on', 'short', 'and', 'on', 'long', 'time', 'scales']] | [-0.1546558005289863, 0.18304680890768119, -0.013515842090482297, 0.060002066097829654, -0.04571845006987291, -0.01194663760960912, 0.013011519967720075, 0.39744685392664825, -0.2444413598485129, -0.42299886415510074, 0.06325983081934164, -0.2389398336046092, -0.09296074814932502, 0.22714881372192633, -0.014442701236871273, -0.021873460124935146, 0.055292435059242924, 0.030610166847422394, -0.03213256866084007, -0.21737835331555486, 0.277150888743041, 0.11338143905867701, 0.21202366096979897, 0.001726035891181749, 0.11449225283096261, -0.05179303921025206, -0.04537956418226594, 0.04004393083893734, -0.0796356016466313, 0.10040456900656547, 0.1593325124971433, 0.11184497561568961, 0.21632737904260663, -0.4797362951318855, -0.2383282110499947, -0.001896033257893894, 0.09155825931052475, -0.02484863589520303, 0.014778662315549572, -0.2984746625930395, 0.07757030266650912, -0.11942005869325088, -0.11390605995269573, 0.05181599387332149, 0.0534536534940581, 0.07062429991226805, -0.24101487938972677, 0.010341565253000463, -0.010815505713791303, 0.23244811926522982, -0.1359683759631994, -0.09980327379687325, -0.07406523760570133, 0.1689093766734004, 0.16061218232928734, 0.043578328932736714, 0.16403106710995022, -0.06888602250761798, -0.059831763569103635, 0.3797886846870508, -0.07726905935686891, -0.049374831943145105, 0.16684063755269365, -0.24448988149752435, -0.11456123320183352, 0.17153951007994298, 0.17702321361689627, 0.04665682452285419, -0.15326798731592767, 0.043801494573658006, -0.014191881030716974, 0.14336541102308295, 0.052902727523494675, -0.0017705020919928085, 0.2687469227037028, 0.10043881207441344, 0.04709003751603355, 0.06756840105644306, -0.21987172969232271, -0.06716220757984759, -0.22421530952889715, -0.10480235120200593, -0.102268581116653, 0.044337113914282425, -0.13111932257502898, -0.1229770753097356, 0.49427095955723654, 0.19170819900565497, 0.18655808868858478, -0.026566067163872976, 0.30857538337940754, 0.06655680131693573, 0.07307848236219877, 0.11618660718971945, 0.31958803914325395, 0.20635206485065916, 0.18788725609496318, -0.21398264852608048, 0.09090796857869819, 0.03892352474934381] |
1,802.03136 | The contractive principle for mappings in $b_v(s)$-metric spaces | In this article, we introduce the notions of sequentially compactness and
boundedly compactness in the framework of a newly defined $b_v(s)$-metric space
which is a generalization of usual metric spaces and several other abstract
spaces. We establish correlations between sequentially compactness and
boundedly compactness. Moreover, we prove some fixed point results of
contractive mapping in this setting, from which we can deduce several analogous
fixed point results. Finally, we illustrate some non-trivial examples to
validate the significances and motivations of this manuscript.
| math.FA | in this article we introduce the notions of sequentially compactness and boundedly compactness in the framework of a newly defined b_vsmetric space which is a generalization of usual metric spaces and several other abstract spaces we establish correlations between sequentially compactness and boundedly compactness moreover we prove some fixed point results of contractive mapping in this setting from which we can deduce several analogous fixed point results finally we illustrate some nontrivial examples to validate the significances and motivations of this manuscript | [['in', 'this', 'article', 'we', 'introduce', 'the', 'notions', 'of', 'sequentially', 'compactness', 'and', 'boundedly', 'compactness', 'in', 'the', 'framework', 'of', 'a', 'newly', 'defined', 'b_vsmetric', 'space', 'which', 'is', 'a', 'generalization', 'of', 'usual', 'metric', 'spaces', 'and', 'several', 'other', 'abstract', 'spaces', 'we', 'establish', 'correlations', 'between', 'sequentially', 'compactness', 'and', 'boundedly', 'compactness', 'moreover', 'we', 'prove', 'some', 'fixed', 'point', 'results', 'of', 'contractive', 'mapping', 'in', 'this', 'setting', 'from', 'which', 'we', 'can', 'deduce', 'several', 'analogous', 'fixed', 'point', 'results', 'finally', 'we', 'illustrate', 'some', 'nontrivial', 'examples', 'to', 'validate', 'the', 'significances', 'and', 'motivations', 'of', 'this', 'manuscript']] | [-0.0820397541306361, 0.09006342544496336, -0.11190025915713682, 0.15140589766698764, -0.10039628417242641, -0.08953948149940481, 0.07840411414472777, 0.39688523923173363, -0.3152117227422602, -0.20790329025943338, 0.14203240711638634, -0.2746789802532689, -0.19453503522608015, 0.18577661790689567, -0.16073443144157437, 0.02379432781656951, 0.03148145435010025, 0.03946711763992538, -0.14274864142507682, -0.2523384148594176, 0.4624121136572442, -0.04018861414105804, 0.2067235402452449, 0.0805826082446233, 0.10473592859336439, -0.003303185145566125, -0.06745560940090613, 0.05178120232691678, -0.19002092788340869, 0.16311496725006971, 0.2532605622883564, 0.13659592205946, 0.34339747876848703, -0.3496717837535673, -0.17193480272903855, 0.1706974921449099, 0.09363894199055654, 0.05362430733720554, -0.0658977748872856, -0.34096967756610225, 0.11688970159279344, -0.15006122627743967, -0.12047886230154997, -0.1559171230563848, -0.045941756716296994, 0.08781170160337179, -0.2613633877086097, -0.032404677769928066, 0.1697371484550797, 0.06537537745945299, -0.11952721201642244, -0.05296030312052204, -0.0025770870945703837, 0.08665251320250976, 0.04981499342075377, 0.02295243925196521, 0.07216623005238765, -0.02731534675695002, -0.13395083423152013, 0.31661745880580977, -0.05501056387000085, -0.22905714704114713, 0.21070603421532813, -0.1654943032535138, -0.20442516572290548, 0.01680141643701512, 0.13624544662457924, 0.14380252054306092, -0.14368463877910448, 0.1044581283636989, -0.09333037271129864, 0.09599186795444607, 0.08465516833979407, 0.08511293931852704, 0.10006214843855964, 0.14146067740188706, 0.1282181330082685, 0.20225600110162856, -0.006553230048329742, -0.08801446348445972, -0.38114172716935474, -0.18847482894075873, -0.13820233351240555, 0.04672051859548154, -0.12329806812771561, -0.1086490008244176, 0.3725035832562472, 0.1931059239834639, 0.23333951294491137, 0.12074632765897722, 0.25099665952133543, 0.05964784988742552, -0.034456558916487814, 0.05974815014956726, 0.17819579269084504, 0.14451495859266064, 0.041687452498777415, -0.08868523357568285, -0.026753004830054664, 0.15025897996707094] |
1,802.03137 | Fast Radio Burst Search: Cross Spectrum vs. Auto Spectrum Method | The search of fast radio burst (FRB) is a hot topic in current radio
astronomy study. In this work, we carry out single pulse search for a VLBI
pulsar observation data set using both auto spectrum and cross spectrum search
method. The cross spectrum method is first proposed in Liu et al. (2018), which
maximizes the signal power by fully utilizing the fringe phase information of
the baseline cross spectrum. The auto spectrum search method is based on the
popular pulsar software package PRESTO, which extracts single pulses from the
auto spectrum of each station. According to our comparison, the cross spectrum
method is able to enhance the signal power and therefore extract single pules
from highly RFI contaminated data, which makes it possible to carry out FRB
search in regular VLBI observations with the presence of RFIs.
| astro-ph.IM | the search of fast radio burst frb is a hot topic in current radio astronomy study in this work we carry out single pulse search for a vlbi pulsar observation data set using both auto spectrum and cross spectrum search method the cross spectrum method is first proposed in liu et al 2018 which maximizes the signal power by fully utilizing the fringe phase information of the baseline cross spectrum the auto spectrum search method is based on the popular pulsar software package presto which extracts single pulses from the auto spectrum of each station according to our comparison the cross spectrum method is able to enhance the signal power and therefore extract single pules from highly rfi contaminated data which makes it possible to carry out frb search in regular vlbi observations with the presence of rfis | [['the', 'search', 'of', 'fast', 'radio', 'burst', 'frb', 'is', 'a', 'hot', 'topic', 'in', 'current', 'radio', 'astronomy', 'study', 'in', 'this', 'work', 'we', 'carry', 'out', 'single', 'pulse', 'search', 'for', 'a', 'vlbi', 'pulsar', 'observation', 'data', 'set', 'using', 'both', 'auto', 'spectrum', 'and', 'cross', 'spectrum', 'search', 'method', 'the', 'cross', 'spectrum', 'method', 'is', 'first', 'proposed', 'in', 'liu', 'et', 'al', '2018', 'which', 'maximizes', 'the', 'signal', 'power', 'by', 'fully', 'utilizing', 'the', 'fringe', 'phase', 'information', 'of', 'the', 'baseline', 'cross', 'spectrum', 'the', 'auto', 'spectrum', 'search', 'method', 'is', 'based', 'on', 'the', 'popular', 'pulsar', 'software', 'package', 'presto', 'which', 'extracts', 'single', 'pulses', 'from', 'the', 'auto', 'spectrum', 'of', 'each', 'station', 'according', 'to', 'our', 'comparison', 'the', 'cross', 'spectrum', 'method', 'is', 'able', 'to', 'enhance', 'the', 'signal', 'power', 'and', 'therefore', 'extract', 'single', 'pules', 'from', 'highly', 'rfi', 'contaminated', 'data', 'which', 'makes', 'it', 'possible', 'to', 'carry', 'out', 'frb', 'search', 'in', 'regular', 'vlbi', 'observations', 'with', 'the', 'presence', 'of', 'rfis']] | [-0.07272917029542336, 0.02627010267916257, -0.10146904255236512, 0.03222434525631125, -0.15141618406346094, -0.12218724478684041, 0.06381329296129769, 0.40575316012499557, -0.23028110783290712, -0.3218176253409921, 0.0792470095557687, -0.3226992066298355, -0.11016816356678263, 0.23357208258560117, 0.029955528177105, 0.03205393693423358, 0.10532601200553683, -0.028147062617421583, 0.0028629303345476965, -0.18484572281844178, 0.23513440726969417, 0.2151653422548881, 0.33594340712263965, -0.007596672215647455, 0.0763398253146316, 0.019196775342435645, -0.16021158523938578, -0.06816156425365066, -0.04299713670869992, 0.06958440978053039, 0.2836821267256459, 0.19661638501312825, 0.1680652897811724, -0.35261312567129516, -0.20817471496706855, 0.10057864406321576, 0.12066824265512759, 0.05697727427173379, -0.0366933355306147, -0.3276330297677845, 0.09657833505458994, -0.23152977898312005, -0.06094546888388046, -0.03925929674996819, 0.004823201389956302, 0.03863106575495887, -0.2492409184899019, 0.06880339876237407, -0.010885891995554708, -0.0007504759967138154, -0.035269277758282216, -0.04995030437704122, 0.008358506455450603, 0.09720315296621318, 0.016301243007942307, 0.051528757897819785, 0.1209692063646904, -0.0595569473647418, -0.11840685469476317, 0.35890758431017183, -0.08359519299119711, -0.0999219852341069, 0.1109722769073467, -0.14829097771207275, -0.18631683255923723, 0.19150998537847097, 0.18737547254135858, 0.12922856375402975, -0.1907712455191042, 0.026285526463323258, -0.005314127224888923, 0.2440540751044139, 0.04809799553839949, 0.02476586001601232, 0.2691211137799141, 0.1820989031474565, 0.07799057865876408, 0.12776918623569436, -0.25299156189261784, -0.024454750052309068, -0.23350215261440177, -0.05249340749941294, -0.2027236856283971, 0.021763400734820658, -0.020789280174210653, -0.12083439222550478, 0.4507859340072542, 0.16321464428219243, 0.16133207567643537, 0.03111924049090189, 0.3861336787433728, 0.10852434609325323, 0.06088598126518554, 0.11245201521661079, 0.25645971808420576, 0.09753817564342171, 0.15435300678338693, -0.18541893455793784, 0.021894197124798877, 0.010788178638271664] |
1,802.03138 | Some growth analysis of entire functions in the form of vector valued
Dirichlet series on the basis of their (p, q)-th relative Ritt order and (p,
q)-th relative Ritt type | In this paper we wish to study some growth properties of entire functions
represented by a vector valued Dirichlet series on the basis of (p,q)th
relative Ritt order, (p,q)th relative Ritt type and (p,q)th relative Ritt weak
type.
| math.CV | in this paper we wish to study some growth properties of entire functions represented by a vector valued dirichlet series on the basis of pqth relative ritt order pqth relative ritt type and pqth relative ritt weak type | [['in', 'this', 'paper', 'we', 'wish', 'to', 'study', 'some', 'growth', 'properties', 'of', 'entire', 'functions', 'represented', 'by', 'a', 'vector', 'valued', 'dirichlet', 'series', 'on', 'the', 'basis', 'of', 'pqth', 'relative', 'ritt', 'order', 'pqth', 'relative', 'ritt', 'type', 'and', 'pqth', 'relative', 'ritt', 'weak', 'type']] | [-0.1489960654197555, 0.04089860760263706, -0.03520167728665432, 0.10756616738906719, -0.12840907545270105, -0.012476626207659903, 0.026971543088285744, 0.3093371588222094, -0.3653931517742182, -0.17839471169894464, 0.09982230790927515, -0.25167198636029897, -0.15123560059031374, 0.12997871754985107, -0.12432948890828381, 0.031356929691116274, -0.029368365134455655, 0.09565200436076052, -0.10498905203942406, -0.28642274264099177, 0.4285702829396254, -0.042675172027788665, 0.21478035724966935, -0.03616333448965298, 0.038846911985035, 0.04715106512517914, -0.08979242254587773, -0.027246996564300435, -0.214628315261124, 0.2293199604303625, 0.24659067960946182, 0.09194584777823796, 0.349534168055183, -0.37802422909360184, -0.07369838878022213, 0.19554975962168292, 0.08219841377515542, -0.06415638148686603, 0.027484985126648098, -0.25264225516615335, 0.0981391743070593, -0.18042059252528767, -0.1722426190114531, -0.11300798593775223, 0.04836049039946183, 0.11809761260213379, -0.27509752317870917, 0.05399180946283435, 0.10437471648401697, 0.13273737199702546, -0.11235663833701294, -0.13497145522974038, -0.00281353771539503, 0.03220115825043697, 0.006512128061761982, 0.056579351112687665, 0.024415997249123297, -0.07322409309716404, -0.12707805985241735, 0.30614451404758974, -0.13273003811666154, -0.2274819918859162, 0.1533014524335924, -0.2270507942517533, -0.1675615334932349, 0.01825553853996098, 0.16516257182842023, 0.15791604471834084, -0.07668608696641106, 0.1592504312268973, -0.06694390230174911, 0.13638425458109277, 0.1974619295399048, 0.04682279471307993, 0.0810568192973733, 0.0005370984834275747, 0.05398048972710967, 0.14342996514843484, 0.03255262447055429, -0.0641310527724655, -0.3640964284147087, -0.2186880761659459, -0.11855644140220982, 0.12373248350463416, -0.06073086978339186, -0.21546214867971444, 0.41158122421658944, 0.06238077191243831, 0.17967836382357696, 0.056660991578706, 0.16611379595767511, 0.13788314190644183, -0.02152048075865758, -0.0039653173206668155, 0.09767757338168419, 0.2530228067740896, 0.09113963415209007, -0.1785511187718887, 0.08289554970044839, 0.2529931469379287] |
1,802.03139 | Small-Gain Stability Analysis of Hyperbolic-Parabolic PDE Loops | This work provides stability results in the spatial sup norm for
hyperbolic-parabolic loops in one spatial dimension. The results are obtained
by an application of the small-gain stability analysis. Two particular cases
are selected for the study because they contain challenges typical of more
general systems (to which the results are easily generalizable but at the
expense of less pedagogical clarity and more notational clutter): (i) the
feedback interconnection of a parabolic PDE with a first-order zero-speed
hyperbolic PDE with boundary disturbances, and (ii) the feedback
interconnection, by means of a combination of boundary and in-domain terms, of
a parabolic PDE with a first-order hyperbolic PDE. The first case arises in the
study of the movement of chemicals underground and includes the wave equation
with Kelvin-Voigt damping as a subcase. The second case arises when we apply
backstepping to a pair of hyperbolic PDEs that is obtained by ignoring
diffusion phenomena. Moreover, the second case arises in the study of parabolic
PDEs with distributed delays. In the first case, we provide sufficient
conditions for ISS in the spatial sup norm with respect to boundary
disturbances. In the second case, we provide (delay-independent) sufficient
conditions for exponential stability in the spatial sup norm.
| math.OC cs.SY math.AP | this work provides stability results in the spatial sup norm for hyperbolicparabolic loops in one spatial dimension the results are obtained by an application of the smallgain stability analysis two particular cases are selected for the study because they contain challenges typical of more general systems to which the results are easily generalizable but at the expense of less pedagogical clarity and more notational clutter i the feedback interconnection of a parabolic pde with a firstorder zerospeed hyperbolic pde with boundary disturbances and ii the feedback interconnection by means of a combination of boundary and indomain terms of a parabolic pde with a firstorder hyperbolic pde the first case arises in the study of the movement of chemicals underground and includes the wave equation with kelvinvoigt damping as a subcase the second case arises when we apply backstepping to a pair of hyperbolic pdes that is obtained by ignoring diffusion phenomena moreover the second case arises in the study of parabolic pdes with distributed delays in the first case we provide sufficient conditions for iss in the spatial sup norm with respect to boundary disturbances in the second case we provide delayindependent sufficient conditions for exponential stability in the spatial sup norm | [['this', 'work', 'provides', 'stability', 'results', 'in', 'the', 'spatial', 'sup', 'norm', 'for', 'hyperbolicparabolic', 'loops', 'in', 'one', 'spatial', 'dimension', 'the', 'results', 'are', 'obtained', 'by', 'an', 'application', 'of', 'the', 'smallgain', 'stability', 'analysis', 'two', 'particular', 'cases', 'are', 'selected', 'for', 'the', 'study', 'because', 'they', 'contain', 'challenges', 'typical', 'of', 'more', 'general', 'systems', 'to', 'which', 'the', 'results', 'are', 'easily', 'generalizable', 'but', 'at', 'the', 'expense', 'of', 'less', 'pedagogical', 'clarity', 'and', 'more', 'notational', 'clutter', 'i', 'the', 'feedback', 'interconnection', 'of', 'a', 'parabolic', 'pde', 'with', 'a', 'firstorder', 'zerospeed', 'hyperbolic', 'pde', 'with', 'boundary', 'disturbances', 'and', 'ii', 'the', 'feedback', 'interconnection', 'by', 'means', 'of', 'a', 'combination', 'of', 'boundary', 'and', 'indomain', 'terms', 'of', 'a', 'parabolic', 'pde', 'with', 'a', 'firstorder', 'hyperbolic', 'pde', 'the', 'first', 'case', 'arises', 'in', 'the', 'study', 'of', 'the', 'movement', 'of', 'chemicals', 'underground', 'and', 'includes', 'the', 'wave', 'equation', 'with', 'kelvinvoigt', 'damping', 'as', 'a', 'subcase', 'the', 'second', 'case', 'arises', 'when', 'we', 'apply', 'backstepping', 'to', 'a', 'pair', 'of', 'hyperbolic', 'pdes', 'that', 'is', 'obtained', 'by', 'ignoring', 'diffusion', 'phenomena', 'moreover', 'the', 'second', 'case', 'arises', 'in', 'the', 'study', 'of', 'parabolic', 'pdes', 'with', 'distributed', 'delays', 'in', 'the', 'first', 'case', 'we', 'provide', 'sufficient', 'conditions', 'for', 'iss', 'in', 'the', 'spatial', 'sup', 'norm', 'with', 'respect', 'to', 'boundary', 'disturbances', 'in', 'the', 'second', 'case', 'we', 'provide', 'delayindependent', 'sufficient', 'conditions', 'for', 'exponential', 'stability', 'in', 'the', 'spatial', 'sup', 'norm']] | [-0.1381847975482544, 0.06852768577405051, -0.017761151128106216, 0.04594600009893316, -0.0806835392768965, -0.15086493274833232, -0.034858429043818584, 0.3180780079363301, -0.2744467245359527, -0.25050779297460324, 0.1682992085948757, -0.2612703998462472, -0.1487843232266236, 0.1958856748481567, -0.11324776875980125, 0.05941406896425466, 0.06568922651793328, 0.030753032698833133, -0.08241328677522147, -0.22086966448085438, 0.3678067180213961, 0.003332005592413468, 0.21494024894246372, 0.03293162675131813, 0.10076283117800047, -0.038362065507652296, -0.018027732409260207, 0.02709622397197554, -0.12332994019916531, 0.11299424451351682, 0.25803702258929095, 0.06031072364156457, 0.31496219960442456, -0.42341928813827806, -0.22471884209293835, 0.07666625713671346, 0.10127137776344351, 0.09175798669515067, -0.05224807275817061, -0.29419000861165806, 0.0652671468347348, -0.10361185583451965, -0.17925164843725022, -0.03935078524647348, -0.012800085049417645, 0.05391070185457762, -0.3228967447885045, 0.109503668341048, 0.11253159828391848, 0.0641492918654723, -0.09873001348333305, -0.05568229425456467, -0.03833891986408225, 0.0928788232736089, 0.04474401663606156, -0.04292044794304518, 0.05464212640677348, -0.11932406919238407, -0.07934650713301236, 0.3982351253265607, -0.06732372570746016, -0.2728572445183919, 0.2009047163318437, -0.15124477055569244, -0.1250103520930256, 0.12751810913928555, 0.19264223847807949, 0.11926008500320155, -0.14861099747976916, 0.09281442647610819, -0.015722666547151334, 0.15296197043141663, 0.08204661329198482, 0.01740964331997254, 0.06856576043600678, 0.19553331940176685, 0.1516737534248473, 0.15948112041223794, -0.03374801025815806, -0.11173747604168804, -0.36250684179808246, -0.14969683308868972, -0.10941453646905351, 0.023287732186044293, -0.10402489554264933, -0.16100809681413714, 0.3689251661226891, 0.1038577828998908, 0.16391147417477378, 0.0701905667388784, 0.26916498314856674, 0.14974165976820927, 0.0006886538542290726, 0.0626579763970812, 0.23923050695200368, 0.15552608034283033, 0.14661046514393633, -0.21232051047940836, 0.04027035281881644, 0.1041102492086829] |
1,802.0314 | Neighborhood Change, One Pint at a Time: The Impact of Local
Characteristics on Craft Breweries | Cities have recognized the local impact of small craft breweries, in many
ways altering municipal codes to make it easier to establish breweries and
making them the anchor points of economic development and revitalization.
Nevertheless, we do not know the extent to which these strategies impacted
changes at the neighborhood level across the nation. In this chapter, we
examine the relationship between growth and locations of craft breweries and
the incidence of neighborhood change across the United States. In the first
part of the chapter, we rely on a unique dataset of geocoded brewery locations
that tracks openings and closings from 2004 to the present. Using measures of
neighborhood change often found in literature on gentrification-related topics,
we develop statistical models relying on census tract demographic and
employment data to determine the extent to which brewery locations are
associated with social and demographic shifts since 2000. The strongest
predictor of whether a craft brewery opened in 2013 or later in a neighborhood
was the presence of a prior brewery. We do not find evidence entirely
consistent with the common narrative of a link between gentrification and craft
brewing, but we see a link between an influx of lower-to-middle income urban
creatives and the introduction of a craft breweries. We advocate for urban
planners to recognize the importance of craft breweries in neighborhood
revitalization while also protecting residents from potential displacement.
| stat.AP | cities have recognized the local impact of small craft breweries in many ways altering municipal codes to make it easier to establish breweries and making them the anchor points of economic development and revitalization nevertheless we do not know the extent to which these strategies impacted changes at the neighborhood level across the nation in this chapter we examine the relationship between growth and locations of craft breweries and the incidence of neighborhood change across the united states in the first part of the chapter we rely on a unique dataset of geocoded brewery locations that tracks openings and closings from 2004 to the present using measures of neighborhood change often found in literature on gentrificationrelated topics we develop statistical models relying on census tract demographic and employment data to determine the extent to which brewery locations are associated with social and demographic shifts since 2000 the strongest predictor of whether a craft brewery opened in 2013 or later in a neighborhood was the presence of a prior brewery we do not find evidence entirely consistent with the common narrative of a link between gentrification and craft brewing but we see a link between an influx of lowertomiddle income urban creatives and the introduction of a craft breweries we advocate for urban planners to recognize the importance of craft breweries in neighborhood revitalization while also protecting residents from potential displacement | [['cities', 'have', 'recognized', 'the', 'local', 'impact', 'of', 'small', 'craft', 'breweries', 'in', 'many', 'ways', 'altering', 'municipal', 'codes', 'to', 'make', 'it', 'easier', 'to', 'establish', 'breweries', 'and', 'making', 'them', 'the', 'anchor', 'points', 'of', 'economic', 'development', 'and', 'revitalization', 'nevertheless', 'we', 'do', 'not', 'know', 'the', 'extent', 'to', 'which', 'these', 'strategies', 'impacted', 'changes', 'at', 'the', 'neighborhood', 'level', 'across', 'the', 'nation', 'in', 'this', 'chapter', 'we', 'examine', 'the', 'relationship', 'between', 'growth', 'and', 'locations', 'of', 'craft', 'breweries', 'and', 'the', 'incidence', 'of', 'neighborhood', 'change', 'across', 'the', 'united', 'states', 'in', 'the', 'first', 'part', 'of', 'the', 'chapter', 'we', 'rely', 'on', 'a', 'unique', 'dataset', 'of', 'geocoded', 'brewery', 'locations', 'that', 'tracks', 'openings', 'and', 'closings', 'from', '2004', 'to', 'the', 'present', 'using', 'measures', 'of', 'neighborhood', 'change', 'often', 'found', 'in', 'literature', 'on', 'gentrificationrelated', 'topics', 'we', 'develop', 'statistical', 'models', 'relying', 'on', 'census', 'tract', 'demographic', 'and', 'employment', 'data', 'to', 'determine', 'the', 'extent', 'to', 'which', 'brewery', 'locations', 'are', 'associated', 'with', 'social', 'and', 'demographic', 'shifts', 'since', '2000', 'the', 'strongest', 'predictor', 'of', 'whether', 'a', 'craft', 'brewery', 'opened', 'in', '2013', 'or', 'later', 'in', 'a', 'neighborhood', 'was', 'the', 'presence', 'of', 'a', 'prior', 'brewery', 'we', 'do', 'not', 'find', 'evidence', 'entirely', 'consistent', 'with', 'the', 'common', 'narrative', 'of', 'a', 'link', 'between', 'gentrification', 'and', 'craft', 'brewing', 'but', 'we', 'see', 'a', 'link', 'between', 'an', 'influx', 'of', 'lowertomiddle', 'income', 'urban', 'creatives', 'and', 'the', 'introduction', 'of', 'a', 'craft', 'breweries', 'we', 'advocate', 'for', 'urban', 'planners', 'to', 'recognize', 'the', 'importance', 'of', 'craft', 'breweries', 'in', 'neighborhood', 'revitalization', 'while', 'also', 'protecting', 'residents', 'from', 'potential', 'displacement']] | [-0.07035004496553979, 0.06399746645368859, -0.08407918580607593, 0.09149682756029315, -0.09141501245342129, -0.08056745618140619, 0.11776255046858926, 0.37124245623821034, -0.2414509699344962, -0.361624353965581, 0.09758278009049766, -0.2798631117769043, -0.16763382483571931, 0.15261704601723244, -0.13642016395093187, -0.027577808855934756, 0.0383540366882491, 0.028751920806570797, -0.028794230900466414, -0.2455476747341699, 0.32169073356290984, 0.052472265702754, 0.282835377451735, 0.04603469122115424, 0.08439067604475688, -0.027130117415238107, -0.08519162371011223, 0.011270252744189316, -0.14088357051977046, 0.14479126002624343, 0.2671942095189559, 0.18152918448679867, 0.31887739958862465, -0.419697443607443, -0.19762840700895412, 0.10947534563673432, 0.10877860836958382, 0.07387183040376394, -0.01745379930709309, -0.3001418720620374, 0.05899760776031926, -0.17372761486228883, -0.12003310384604622, -0.03527918197148226, 0.03716176566402346, 0.028048951661810605, -0.2093537639573282, 0.05159854197049035, 0.015767091623785204, 0.12571915914100318, -0.05139835997703669, -0.08368320055632737, -0.05692850404190259, 0.21991720053522026, 0.06845064334195565, 0.002024598608202946, 0.13023651259126173, -0.12966832456183047, -0.08470235539706457, 0.34819644176107095, -0.007280893288879541, -0.14552681928647584, 0.217610400280376, -0.15181476475973205, -0.127560403668771, 0.05857573897095822, 0.22094696377743067, 0.05827656285347123, -0.15895846084560872, 0.01866618709627482, -0.014575410826262413, 0.17092778231017292, 0.10118119875500142, 0.0005621649712945024, 0.2190857090080451, 0.150971053940195, 0.09398734589845653, 0.06625796821818017, -0.10536805740718448, -0.09988044340392216, -0.2390779845739241, -0.13711720993824042, -0.12465587812026538, 0.013781910207813908, -0.026474960017048146, -0.17782583550893163, 0.3940540289735062, 0.20757111808767117, 0.183392089409672, 0.016910179976420886, 0.22575122141687756, -0.00888806423315321, 0.07685157701780554, 0.11877779642695953, 0.2010466816953563, 0.010394824141832558, 0.13553083436553398, -0.15723998038090048, 0.1479300590407659, 0.006743279632932523] |
1,802.03141 | A Minimum Message Length Criterion for Robust Linear Regression | This paper applies the minimum message length principle to inference of
linear regression models with Student-t errors. A new criterion for variable
selection and parameter estimation in Student-t regression is proposed. By
exploiting properties of the regression model, we derive a suitable
non-informative proper uniform prior distribution for the regression
coefficients that leads to a simple and easy-to-apply criterion. Our proposed
criterion does not require specification of hyperparameters and is invariant
under both full rank transformations of the design matrix and linear
transformations of the outcomes. We compare the proposed criterion with several
standard model selection criteria, such as the Akaike information criterion and
the Bayesian information criterion, on simulations and real data with promising
results.
| stat.ME | this paper applies the minimum message length principle to inference of linear regression models with studentt errors a new criterion for variable selection and parameter estimation in studentt regression is proposed by exploiting properties of the regression model we derive a suitable noninformative proper uniform prior distribution for the regression coefficients that leads to a simple and easytoapply criterion our proposed criterion does not require specification of hyperparameters and is invariant under both full rank transformations of the design matrix and linear transformations of the outcomes we compare the proposed criterion with several standard model selection criteria such as the akaike information criterion and the bayesian information criterion on simulations and real data with promising results | [['this', 'paper', 'applies', 'the', 'minimum', 'message', 'length', 'principle', 'to', 'inference', 'of', 'linear', 'regression', 'models', 'with', 'studentt', 'errors', 'a', 'new', 'criterion', 'for', 'variable', 'selection', 'and', 'parameter', 'estimation', 'in', 'studentt', 'regression', 'is', 'proposed', 'by', 'exploiting', 'properties', 'of', 'the', 'regression', 'model', 'we', 'derive', 'a', 'suitable', 'noninformative', 'proper', 'uniform', 'prior', 'distribution', 'for', 'the', 'regression', 'coefficients', 'that', 'leads', 'to', 'a', 'simple', 'and', 'easytoapply', 'criterion', 'our', 'proposed', 'criterion', 'does', 'not', 'require', 'specification', 'of', 'hyperparameters', 'and', 'is', 'invariant', 'under', 'both', 'full', 'rank', 'transformations', 'of', 'the', 'design', 'matrix', 'and', 'linear', 'transformations', 'of', 'the', 'outcomes', 'we', 'compare', 'the', 'proposed', 'criterion', 'with', 'several', 'standard', 'model', 'selection', 'criteria', 'such', 'as', 'the', 'akaike', 'information', 'criterion', 'and', 'the', 'bayesian', 'information', 'criterion', 'on', 'simulations', 'and', 'real', 'data', 'with', 'promising', 'results']] | [-0.042606412184199895, -0.0295778852767022, -0.12621112916907617, 0.0956252626126335, -0.14880764086586262, -0.22192411799513703, 0.09723920866662379, 0.39114075459756664, -0.26104572986790525, -0.2854937352741876, 0.1258347517487609, -0.1905413138969191, -0.17540088952679572, 0.163801543830075, -0.11146829567111001, 0.1693328173975621, 0.07005492077160884, 0.014404784751542169, -0.11105945933327191, -0.2861963461699157, 0.29344946863772026, 0.09164003395186417, 0.3487009989129829, -0.027120096258245054, 0.16095340080975237, 0.10424609790989679, -0.07168861247743641, -0.00257902461553699, -0.17872350901629472, 0.0914235603293115, 0.2483685743960952, 0.2235880199265827, 0.31836371491502585, -0.3078866195483615, -0.2423577633814822, 0.13722324323166032, 0.06486512211568911, 0.09065985739841287, 0.012853598530235669, -0.2546966629873576, 0.07978758353194029, -0.1579359128658764, -0.06523104612956401, -0.13831491893807682, -0.06299305776965097, 0.010623984090012402, -0.42232053826065286, 0.12682596693650403, 0.1082577380684911, 0.07226047715260486, -0.050487006083130836, -0.13642112891077354, -0.004315998025864748, 0.0452315017755609, 0.04015993698829271, -0.033986545826212085, 0.11335447790896006, -0.0982677338841564, -0.12497193589284696, 0.35696693030507143, -0.05520633086642443, -0.28700210484836636, 0.17182597132592364, -0.03101923948972775, -0.1397021111584638, 0.06256804165655169, 0.20222451700026106, 0.09383532878213184, -0.19370931407822103, 0.03514365568166952, -0.06163502011070799, 0.15770366024185806, -0.0046501620612428365, -0.00024810997399918994, 0.14190904251781516, 0.1504573713715092, 0.07541684020342755, 0.111278519712806, -0.13575088128182589, -0.09008802288083424, -0.334497919081357, -0.13002939617004375, -0.18337714252391316, -0.046861535369630315, -0.1898083384181393, -0.18311140581098354, 0.3847974829118827, 0.18166528251182673, 0.1960977012620725, 0.12977215427712635, 0.2976919472506591, 0.1130178905581927, 0.052490255557288416, 0.06453243350802824, 0.17423504171090137, 0.16353376977173772, 0.0010222273212375827, -0.16340210553908976, 0.13667479939437632, 0.059427493905190955] |
1,802.03142 | Augmenting Librispeech with French Translations: A Multimodal Corpus for
Direct Speech Translation Evaluation | Recent works in spoken language translation (SLT) have attempted to build
end-to-end speech-to-text translation without using source language
transcription during learning or decoding. However, while large quantities of
parallel texts (such as Europarl, OpenSubtitles) are available for training
machine translation systems, there are no large (100h) and open source parallel
corpora that include speech in a source language aligned to text in a target
language. This paper tries to fill this gap by augmenting an existing
(monolingual) corpus: LibriSpeech. This corpus, used for automatic speech
recognition, is derived from read audiobooks from the LibriVox project, and has
been carefully segmented and aligned. After gathering French e-books
corresponding to the English audio-books from LibriSpeech, we align speech
segments at the sentence level with their respective translations and obtain
236h of usable parallel data. This paper presents the details of the processing
as well as a manual evaluation conducted on a small subset of the corpus. This
evaluation shows that the automatic alignments scores are reasonably correlated
with the human judgments of the bilingual alignment quality. We believe that
this corpus (which is made available online) is useful for replicable
experiments in direct speech translation or more general spoken language
translation experiments.
| cs.CL | recent works in spoken language translation slt have attempted to build endtoend speechtotext translation without using source language transcription during learning or decoding however while large quantities of parallel texts such as europarl opensubtitles are available for training machine translation systems there are no large 100h and open source parallel corpora that include speech in a source language aligned to text in a target language this paper tries to fill this gap by augmenting an existing monolingual corpus librispeech this corpus used for automatic speech recognition is derived from read audiobooks from the librivox project and has been carefully segmented and aligned after gathering french ebooks corresponding to the english audiobooks from librispeech we align speech segments at the sentence level with their respective translations and obtain 236h of usable parallel data this paper presents the details of the processing as well as a manual evaluation conducted on a small subset of the corpus this evaluation shows that the automatic alignments scores are reasonably correlated with the human judgments of the bilingual alignment quality we believe that this corpus which is made available online is useful for replicable experiments in direct speech translation or more general spoken language translation experiments | [['recent', 'works', 'in', 'spoken', 'language', 'translation', 'slt', 'have', 'attempted', 'to', 'build', 'endtoend', 'speechtotext', 'translation', 'without', 'using', 'source', 'language', 'transcription', 'during', 'learning', 'or', 'decoding', 'however', 'while', 'large', 'quantities', 'of', 'parallel', 'texts', 'such', 'as', 'europarl', 'opensubtitles', 'are', 'available', 'for', 'training', 'machine', 'translation', 'systems', 'there', 'are', 'no', 'large', '100h', 'and', 'open', 'source', 'parallel', 'corpora', 'that', 'include', 'speech', 'in', 'a', 'source', 'language', 'aligned', 'to', 'text', 'in', 'a', 'target', 'language', 'this', 'paper', 'tries', 'to', 'fill', 'this', 'gap', 'by', 'augmenting', 'an', 'existing', 'monolingual', 'corpus', 'librispeech', 'this', 'corpus', 'used', 'for', 'automatic', 'speech', 'recognition', 'is', 'derived', 'from', 'read', 'audiobooks', 'from', 'the', 'librivox', 'project', 'and', 'has', 'been', 'carefully', 'segmented', 'and', 'aligned', 'after', 'gathering', 'french', 'ebooks', 'corresponding', 'to', 'the', 'english', 'audiobooks', 'from', 'librispeech', 'we', 'align', 'speech', 'segments', 'at', 'the', 'sentence', 'level', 'with', 'their', 'respective', 'translations', 'and', 'obtain', '236h', 'of', 'usable', 'parallel', 'data', 'this', 'paper', 'presents', 'the', 'details', 'of', 'the', 'processing', 'as', 'well', 'as', 'a', 'manual', 'evaluation', 'conducted', 'on', 'a', 'small', 'subset', 'of', 'the', 'corpus', 'this', 'evaluation', 'shows', 'that', 'the', 'automatic', 'alignments', 'scores', 'are', 'reasonably', 'correlated', 'with', 'the', 'human', 'judgments', 'of', 'the', 'bilingual', 'alignment', 'quality', 'we', 'believe', 'that', 'this', 'corpus', 'which', 'is', 'made', 'available', 'online', 'is', 'useful', 'for', 'replicable', 'experiments', 'in', 'direct', 'speech', 'translation', 'or', 'more', 'general', 'spoken', 'language', 'translation', 'experiments']] | [-0.059985928134545875, 0.04060567425620669, -0.005825804406247864, 0.08865555463713885, -0.17304459794876026, -0.1428320371470005, 0.04067541923282216, 0.48130713392876917, -0.2483289927382944, -0.32702609090101575, 0.059752056787891146, -0.32158692267892713, -0.0784329233266004, 0.23419800162494106, -0.1307360992009629, 0.07351967338778342, 0.1857619130468899, 0.08538809569312655, -0.03296502359618825, -0.2757052635230745, 0.2671404657544418, 0.04061854747947155, 0.3815529408648309, -0.003002490069848871, 0.10111176363084315, -0.06393026738997015, -0.07698724588680297, -0.080276638114204, -0.03259205744031322, 0.20053690196146642, 0.4105940368391028, 0.2477649793680287, 0.287176515721255, -0.3784296051457976, -0.12183044603531898, 0.030449889292187914, 0.14539906169367822, 0.14773188450319616, -0.05493622522007714, -0.38961258864575865, 0.09533294763608902, -0.1585656803964421, 0.09045591613400088, -0.10704108945216344, 0.029661507390420696, -0.021252585246780985, -0.2079488938965957, 0.030815853720831902, 0.15146899458774685, 0.19760695587834248, -0.02258309998403708, -0.11754224670644041, 0.04235011332132148, 0.21693582512729923, 0.10106080280254698, 0.1601789425586696, 0.1043039495125413, -0.13702884866301007, -0.13872080022055241, 0.4091842565103434, -0.0869111114962384, -0.26029516561509514, 0.1900345185298868, -0.0003530382963057344, -0.1862341344034337, 0.05775597630858873, 0.2341084102535564, 0.054554118513778754, -0.21296154338433737, 0.02931708764435366, -0.04036016199464976, 0.2844007506306904, 0.12595881606837867, -0.06770130329338524, 0.2067693010715749, 0.23234646062300812, -0.07540849251837253, 0.171402307735836, -0.07637807954281493, -0.017322716237318635, -0.2247392080554908, -0.11841120504459009, -0.18631655071753858, -0.02297216064926952, -0.018530261087980393, -0.16394415753922953, 0.34792974079968503, 0.2080119907540843, 0.13325520705977323, 0.14534902412178596, 0.3227203117796417, -0.041708347535188865, 0.14559673165168727, 0.07542578113674553, 0.12771004806872402, -0.08251376804246595, 0.18239672281520647, -0.13913189895060665, 0.1107862577097481, 0.001814710250303074] |
1,802.03143 | Solitons as candidates for energy carriers in Fermi-Pasta-Ulam lattices | Currently, effective phonons (renormalized or interacting phonons) rather
than solitary waves (for short, solitons) are regarded as the energy carriers
in nonlinear lattices. In this work, by using the approximate soliton solutions
of the corresponding equations of motion and adopting the Boltzmann
distribution for these solitons, the average velocities of solitons are
obtained and are compared with the sound velocities of energy transfer.
Excellent agreements with the numerical results and the predictions of other
existing theories are shown in both the symmetric Fermi-Pasta-Ulam-$\beta$
lattices and the asymmetric Fermi-Pasta-Ulam-$\alpha \beta$ lattices. These
clearly indicate that solitons are suitable candidates for energy carriers in
Fermi-Pasta-Ulam lattices. In addition, the root-mean-square velocity of
solitons can be obtained from the effective phonons theory.
| cond-mat.stat-mech cond-mat.mes-hall nlin.PS physics.class-ph | currently effective phonons renormalized or interacting phonons rather than solitary waves for short solitons are regarded as the energy carriers in nonlinear lattices in this work by using the approximate soliton solutions of the corresponding equations of motion and adopting the boltzmann distribution for these solitons the average velocities of solitons are obtained and are compared with the sound velocities of energy transfer excellent agreements with the numerical results and the predictions of other existing theories are shown in both the symmetric fermipastaulambeta lattices and the asymmetric fermipastaulamalpha beta lattices these clearly indicate that solitons are suitable candidates for energy carriers in fermipastaulam lattices in addition the rootmeansquare velocity of solitons can be obtained from the effective phonons theory | [['currently', 'effective', 'phonons', 'renormalized', 'or', 'interacting', 'phonons', 'rather', 'than', 'solitary', 'waves', 'for', 'short', 'solitons', 'are', 'regarded', 'as', 'the', 'energy', 'carriers', 'in', 'nonlinear', 'lattices', 'in', 'this', 'work', 'by', 'using', 'the', 'approximate', 'soliton', 'solutions', 'of', 'the', 'corresponding', 'equations', 'of', 'motion', 'and', 'adopting', 'the', 'boltzmann', 'distribution', 'for', 'these', 'solitons', 'the', 'average', 'velocities', 'of', 'solitons', 'are', 'obtained', 'and', 'are', 'compared', 'with', 'the', 'sound', 'velocities', 'of', 'energy', 'transfer', 'excellent', 'agreements', 'with', 'the', 'numerical', 'results', 'and', 'the', 'predictions', 'of', 'other', 'existing', 'theories', 'are', 'shown', 'in', 'both', 'the', 'symmetric', 'fermipastaulambeta', 'lattices', 'and', 'the', 'asymmetric', 'fermipastaulamalpha', 'beta', 'lattices', 'these', 'clearly', 'indicate', 'that', 'solitons', 'are', 'suitable', 'candidates', 'for', 'energy', 'carriers', 'in', 'fermipastaulam', 'lattices', 'in', 'addition', 'the', 'rootmeansquare', 'velocity', 'of', 'solitons', 'can', 'be', 'obtained', 'from', 'the', 'effective', 'phonons', 'theory']] | [-0.13161029401965343, 0.18971936583175655, -0.08443850032211739, 0.10115900038745475, -0.03282763606521411, -0.13381521010739825, -0.018402730976034083, 0.42458712017574046, -0.2151229392887109, -0.2414017900098431, 0.070984243658979, -0.3412175311596464, -0.08538856335434179, 0.2261372793947299, 0.05990567512344569, 0.06344121644052408, 0.0767876844561138, 0.029789940785553495, -0.03835923739085448, -0.20706474548205733, 0.291374429841368, 0.03731971119640995, 0.3081582492233207, 0.04395691658985817, 0.050334387683798956, -0.02586076585615401, 0.013194144719232947, 0.02759245141819751, -0.16338100151576435, 0.14231891120326215, 0.23831522598728475, -0.06726303209661175, 0.17508356198589553, -0.44126134359482994, -0.2719739825322719, 0.041898882973512984, 0.1997822966481859, 0.1844231402896092, -0.05392353403997623, -0.3160273468721721, 0.044234919077637845, -0.1407589454330125, -0.16790801082674603, -0.08932536376750697, 0.01807978707444617, 0.17491921941923388, -0.2191715487042221, 0.1662997419396376, 0.04136326320477272, 0.03725132425868158, -0.13594458119201838, -0.12589686356042906, -0.07394206748636029, 0.0430916126371535, 0.06422863090687068, -0.03024712374820611, 0.06226675995325638, -0.16512460706132007, -0.10826127080743052, 0.4461626936129089, -0.12338665283496701, -0.2016588922400596, 0.19223388719127782, -0.07702229895344856, 0.01753734153995322, 0.15522412322777307, 0.13162036018714435, 0.12341678043495927, -0.09414232503307068, 0.03500743244056416, -0.026352547933900003, 0.12402334656088881, 0.10464201693549373, 0.09297428902838442, 0.2425634333453441, 0.11350482628854403, 0.015686771406208055, 0.09028309832822326, -0.04214049479529514, -0.12933607430244654, -0.2737800564135472, -0.10793145783087713, -0.19131600545813976, 0.010213706427316923, -0.10538625701723257, -0.10526984879205406, 0.3845817325321042, 0.11254263835637514, 0.1549198075742224, 0.05167605184310637, 0.2262702372154, 0.15800522579476078, 0.0603732144641611, 0.11504137759507334, 0.3054080658826101, 0.13889277904191827, 0.09340033126635856, -0.2395700165287639, -0.06339575671906567, 0.057098116394195514] |
1,802.03144 | Neural Dynamic Programming for Musical Self Similarity | We present a neural sequence model designed specifically for symbolic music.
The model is based on a learned edit distance mechanism which generalises a
classic recursion from computer sci- ence, leading to a neural dynamic program.
Re- peated motifs are detected by learning the transfor- mations between them.
We represent the arising computational dependencies using a novel data
structure, the edit tree; this perspective suggests natural approximations
which afford the scaling up of our otherwise cubic time algorithm. We
demonstrate our model on real and synthetic data; in all cases it out-performs
a strong stacked long short-term memory benchmark.
| cs.AI cs.LG | we present a neural sequence model designed specifically for symbolic music the model is based on a learned edit distance mechanism which generalises a classic recursion from computer sci ence leading to a neural dynamic program re peated motifs are detected by learning the transfor mations between them we represent the arising computational dependencies using a novel data structure the edit tree this perspective suggests natural approximations which afford the scaling up of our otherwise cubic time algorithm we demonstrate our model on real and synthetic data in all cases it outperforms a strong stacked long shortterm memory benchmark | [['we', 'present', 'a', 'neural', 'sequence', 'model', 'designed', 'specifically', 'for', 'symbolic', 'music', 'the', 'model', 'is', 'based', 'on', 'a', 'learned', 'edit', 'distance', 'mechanism', 'which', 'generalises', 'a', 'classic', 'recursion', 'from', 'computer', 'sci', 'ence', 'leading', 'to', 'a', 'neural', 'dynamic', 'program', 're', 'peated', 'motifs', 'are', 'detected', 'by', 'learning', 'the', 'transfor', 'mations', 'between', 'them', 'we', 'represent', 'the', 'arising', 'computational', 'dependencies', 'using', 'a', 'novel', 'data', 'structure', 'the', 'edit', 'tree', 'this', 'perspective', 'suggests', 'natural', 'approximations', 'which', 'afford', 'the', 'scaling', 'up', 'of', 'our', 'otherwise', 'cubic', 'time', 'algorithm', 'we', 'demonstrate', 'our', 'model', 'on', 'real', 'and', 'synthetic', 'data', 'in', 'all', 'cases', 'it', 'outperforms', 'a', 'strong', 'stacked', 'long', 'shortterm', 'memory', 'benchmark']] | [-0.07822345663812391, 0.012995240642042945, -0.09306284610647708, 0.11264398174208341, -0.1268772337234066, -0.1685696166597915, 0.07384932091654449, 0.40799157230221494, -0.33959738252570437, -0.3419508471780894, 0.043091313007088114, -0.25789007774497175, -0.2497015731903363, 0.19788550643716007, -0.053446166726050195, 0.0674783544750333, 0.10526143565146746, 0.013227858851492708, -0.04612343851476908, -0.2519252003664721, 0.2557033957172261, 0.039563790272579204, 0.3020331846379048, -0.024629580118332287, 0.11960146254717316, -0.017732751227877274, -0.03536385652842, 0.005299288653708461, -0.09455222241807378, 0.15984889931919777, 0.24744720023947445, 0.1732089241743278, 0.28195737663465514, -0.4243137410946418, -0.20806382873038554, 0.07447034788462903, 0.08629436831332135, 0.12631388709462266, -0.024581666296937178, -0.29004580467673285, 0.07539714113999234, -0.15936271139605884, 0.017026787904110188, -0.12590532016237171, 0.0012778506984896197, 0.010010676563014182, -0.28875739259315103, 0.051915068261334865, 0.09214964283782305, 0.06973919469140927, -0.018945404899791265, -0.10329046808373259, 0.015104665606263645, 0.1273372619821481, -0.002186947038910371, 0.07004909205003357, 0.06667388105593926, -0.08712282879230547, -0.17081524665367656, 0.3565406683186183, -0.057668795229448955, -0.16050354103149123, 0.1969478383223165, -0.022850770099392653, -0.183472821522238, 0.07953860175947906, 0.22461775217053234, 0.1306801164535834, -0.15224743288601938, 0.08136412359201539, -0.07349923274441793, 0.20728430844729348, 0.053720645763322104, -0.034777229908397614, 0.18469542824682228, 0.24496487657508662, -0.012574237292009995, 0.16501062145285614, -0.10669615488690656, -0.10906983005852268, -0.21718153037244872, -0.0763242166793468, -0.17592166588589436, -0.0022833388160952194, -0.13046345053396868, -0.19053129682659495, 0.3945696667853591, 0.20183602199718662, 0.18642740247638098, 0.17064502382204316, 0.3056898866304938, 0.040927756703648795, 0.13325547333687962, 0.12428826547693461, 0.14618604848807565, 0.02654150680743386, 0.12876355735471054, -0.19200155239941893, 0.08389588336612346, 0.09027404019285981] |
1,802.03145 | Relational Autoencoder for Feature Extraction | Feature extraction becomes increasingly important as data grows high
dimensional. Autoencoder as a neural network based feature extraction method
achieves great success in generating abstract features of high dimensional
data. However, it fails to consider the relationships of data samples which may
affect experimental results of using original and new features. In this paper,
we propose a Relation Autoencoder model considering both data features and
their relationships. We also extend it to work with other major autoencoder
models including Sparse Autoencoder, Denoising Autoencoder and Variational
Autoencoder. The proposed relational autoencoder models are evaluated on a set
of benchmark datasets and the experimental results show that considering data
relationships can generate more robust features which achieve lower
construction loss and then lower error rate in further classification compared
to the other variants of autoencoders.
| cs.LG stat.ML | feature extraction becomes increasingly important as data grows high dimensional autoencoder as a neural network based feature extraction method achieves great success in generating abstract features of high dimensional data however it fails to consider the relationships of data samples which may affect experimental results of using original and new features in this paper we propose a relation autoencoder model considering both data features and their relationships we also extend it to work with other major autoencoder models including sparse autoencoder denoising autoencoder and variational autoencoder the proposed relational autoencoder models are evaluated on a set of benchmark datasets and the experimental results show that considering data relationships can generate more robust features which achieve lower construction loss and then lower error rate in further classification compared to the other variants of autoencoders | [['feature', 'extraction', 'becomes', 'increasingly', 'important', 'as', 'data', 'grows', 'high', 'dimensional', 'autoencoder', 'as', 'a', 'neural', 'network', 'based', 'feature', 'extraction', 'method', 'achieves', 'great', 'success', 'in', 'generating', 'abstract', 'features', 'of', 'high', 'dimensional', 'data', 'however', 'it', 'fails', 'to', 'consider', 'the', 'relationships', 'of', 'data', 'samples', 'which', 'may', 'affect', 'experimental', 'results', 'of', 'using', 'original', 'and', 'new', 'features', 'in', 'this', 'paper', 'we', 'propose', 'a', 'relation', 'autoencoder', 'model', 'considering', 'both', 'data', 'features', 'and', 'their', 'relationships', 'we', 'also', 'extend', 'it', 'to', 'work', 'with', 'other', 'major', 'autoencoder', 'models', 'including', 'sparse', 'autoencoder', 'denoising', 'autoencoder', 'and', 'variational', 'autoencoder', 'the', 'proposed', 'relational', 'autoencoder', 'models', 'are', 'evaluated', 'on', 'a', 'set', 'of', 'benchmark', 'datasets', 'and', 'the', 'experimental', 'results', 'show', 'that', 'considering', 'data', 'relationships', 'can', 'generate', 'more', 'robust', 'features', 'which', 'achieve', 'lower', 'construction', 'loss', 'and', 'then', 'lower', 'error', 'rate', 'in', 'further', 'classification', 'compared', 'to', 'the', 'other', 'variants', 'of', 'autoencoders']] | [-0.007259870398810652, -0.015905181457169522, -0.0777707031518361, 0.12761552782669747, -0.10471743781861842, -0.20496443019395597, 0.020455099769195725, 0.43967947386261214, -0.29455960080853866, -0.34266902819359885, 0.07929171269577473, -0.3195777638794336, -0.22967615879063769, 0.19055518404846744, -0.11135565253548828, 0.10332614142461714, 0.1644278666970873, 0.035308053941094784, -0.10397155634197582, -0.2803683779613794, 0.32228447459077925, 0.08380191436009411, 0.3826846381495322, -0.0011587765389927348, 0.13779328225786217, -0.05727891465193851, -0.03244961029674886, -0.023149013758244876, -0.0498400304497231, 0.22264176518201156, 0.3033185530552064, 0.21230512214264363, 0.29223408029393705, -0.4076554905133028, -0.27155943959054213, 0.08179705441558272, 0.14098414266481996, 0.12237749229059677, -0.03819829473918377, -0.3153962714919694, 0.07652626270113191, -0.16193685048308812, 0.028444639655684393, -0.19402557623282046, -0.047608668250697, -0.01214337766413836, -0.3138956377926962, 0.11067468257900152, 0.10446528301231171, 0.02992254079851721, -0.10515720786568813, -0.13689359960989164, -0.03734476057570988, 0.1052090726736793, 0.03390221675259194, 0.06500981715542817, 0.07558898625132117, -0.16335610724397834, -0.12599112797367448, 0.33236931524890706, -0.08857249172362394, -0.20698477239242957, 0.1999678440073407, -0.01411253572581686, -0.17455779601070553, 0.049085743816331365, 0.2625065467887579, 0.08808433070089108, -0.15627829693397857, -0.013515570710843807, -0.05576527417686425, 0.16727796913635798, 0.023931713624248153, 0.050544727380086384, 0.10670418012186997, 0.2817171650384623, -0.0037568552643620877, 0.1763305951415778, -0.1631411408665905, -0.048759250180389645, -0.212878282616069, -0.08729569712164462, -0.2015889499483532, -0.053542277443089654, -0.12871638948351224, -0.14500471787821306, 0.3897687064700837, 0.2573720534521162, 0.27774616051465273, 0.11739904719362862, 0.3291082762153749, 0.049234202925200726, 0.12223886362324238, 0.07863023237122181, 0.16284769709761204, 0.06535557088183057, 0.06106918852792045, -0.11073762574583236, 0.0876376289608223, 0.04335046280525569] |
1,802.03146 | Analysis of the 3C445 Soft X-ray Spectrum as Observed by Chandra
high-energy gratings | We present a detailed analysis of the soft X-ray emission of 3C445 using an
archival Chandra HETG spectrum. Highly-ionized H- and He-like Mg, Si and S
lines, as well as a resolved low-ionized Si K$\alpha$ line, are detected in the
high resolution spectrum.
The He-like triplets of Mg and Si are resolved into individual lines, and the
calculated R ratios indicate a high density for the emitter. The low values of
the G ratios indicate the lines originate from collisionally ionized plasmas.
However, the detection of a resolved narrow Ne X RRC feature in the spectrum
seems to prefer to a photoionized environment. The spectrum is subsequently
modelled with a photoionization model, and the results are compared with that
of a collisional model. Through a detailed analysis on the spectrum, we exclude
a collisional origin for these emission lines. A one-component photoionization
model provides a great fit to the emission features.
The best-fit parameters are log$\xi$ = $3.3^{+0.4}_{-0.3}$ erg cm s$^{-1}$,
$n_{H}$ = $5^{+15}_{-4.5}\times10^{10}$ cm$^{-3}$ and $N_{H}$ =
$2.5^{+3.8}_{-1.7}\times10^{20}$ cm$^{-2}$.
According to the calculated high density for the emitter, the measured
velocity widths of the emission lines and the inferred the radial distance (6
$\times$ $10^{14}$ - 8 $\times$ $10^{15}$ cm), we suggest the emission lines
originating from matter locate in the broad line region (BLR).
| astro-ph.GA astro-ph.HE | we present a detailed analysis of the soft xray emission of 3c445 using an archival chandra hetg spectrum highlyionized h and helike mg si and s lines as well as a resolved lowionized si kalpha line are detected in the high resolution spectrum the helike triplets of mg and si are resolved into individual lines and the calculated r ratios indicate a high density for the emitter the low values of the g ratios indicate the lines originate from collisionally ionized plasmas however the detection of a resolved narrow ne x rrc feature in the spectrum seems to prefer to a photoionized environment the spectrum is subsequently modelled with a photoionization model and the results are compared with that of a collisional model through a detailed analysis on the spectrum we exclude a collisional origin for these emission lines a onecomponent photoionization model provides a great fit to the emission features the bestfit parameters are logxi 3304_03 erg cm s1 n_h 515_45times1010 cm3 and n_h 2538_17times1020 cm2 according to the calculated high density for the emitter the measured velocity widths of the emission lines and the inferred the radial distance 6 times 1014 8 times 1015 cm we suggest the emission lines originating from matter locate in the broad line region blr | [['we', 'present', 'a', 'detailed', 'analysis', 'of', 'the', 'soft', 'xray', 'emission', 'of', '3c445', 'using', 'an', 'archival', 'chandra', 'hetg', 'spectrum', 'highlyionized', 'h', 'and', 'helike', 'mg', 'si', 'and', 's', 'lines', 'as', 'well', 'as', 'a', 'resolved', 'lowionized', 'si', 'kalpha', 'line', 'are', 'detected', 'in', 'the', 'high', 'resolution', 'spectrum', 'the', 'helike', 'triplets', 'of', 'mg', 'and', 'si', 'are', 'resolved', 'into', 'individual', 'lines', 'and', 'the', 'calculated', 'r', 'ratios', 'indicate', 'a', 'high', 'density', 'for', 'the', 'emitter', 'the', 'low', 'values', 'of', 'the', 'g', 'ratios', 'indicate', 'the', 'lines', 'originate', 'from', 'collisionally', 'ionized', 'plasmas', 'however', 'the', 'detection', 'of', 'a', 'resolved', 'narrow', 'ne', 'x', 'rrc', 'feature', 'in', 'the', 'spectrum', 'seems', 'to', 'prefer', 'to', 'a', 'photoionized', 'environment', 'the', 'spectrum', 'is', 'subsequently', 'modelled', 'with', 'a', 'photoionization', 'model', 'and', 'the', 'results', 'are', 'compared', 'with', 'that', 'of', 'a', 'collisional', 'model', 'through', 'a', 'detailed', 'analysis', 'on', 'the', 'spectrum', 'we', 'exclude', 'a', 'collisional', 'origin', 'for', 'these', 'emission', 'lines', 'a', 'onecomponent', 'photoionization', 'model', 'provides', 'a', 'great', 'fit', 'to', 'the', 'emission', 'features', 'the', 'bestfit', 'parameters', 'are', 'logxi', '3304_03', 'erg', 'cm', 's1', 'n_h', '515_45times1010', 'cm3', 'and', 'n_h', '2538_17times1020', 'cm2', 'according', 'to', 'the', 'calculated', 'high', 'density', 'for', 'the', 'emitter', 'the', 'measured', 'velocity', 'widths', 'of', 'the', 'emission', 'lines', 'and', 'the', 'inferred', 'the', 'radial', 'distance', '6', 'times', '1014', '8', 'times', '1015', 'cm', 'we', 'suggest', 'the', 'emission', 'lines', 'originating', 'from', 'matter', 'locate', 'in', 'the', 'broad', 'line', 'region', 'blr']] | [-0.03714734583237525, 0.07485655808447288, 0.021092322363148324, 0.06373399080005118, 0.007426891167331754, -0.1565827968637303, 0.042321975881802795, 0.48052637049990693, -0.14675802368510282, -0.3387622162877943, 0.02152009476332716, -0.3388954695786514, 0.06701703464365052, 0.14765823001134473, 0.05118302927053373, -0.06137827588472255, 0.013334283983985487, -0.1049846558827176, -0.04676624534776407, -0.12838796020427531, 0.24196447973901575, 0.0878939761659888, 0.2048026411237115, 0.077741186274884, 0.02648588525282852, -0.10453015837136602, -0.04424157461628282, 0.0063375560129181096, -0.11224773875455084, 0.10400425870156442, 0.2269008892574949, 0.13260520860312158, 0.15250521253139387, -0.3449057463654562, -0.26088036143590815, 0.025005061605582614, 0.18704318346313098, 0.011047864016412834, 0.0012906081590168712, -0.29191317417297924, 0.027790685346668686, -0.15597680966819874, -0.17502771780278054, 0.07252902550061353, 0.05017259909936258, 0.023003195775071223, -0.2533748739523786, 0.09646359617982292, -0.031025577391136847, 0.08112693595940594, -0.11245578434875315, -0.11263895211251158, -0.08356598063826597, 0.006876488231817643, -0.0023960360469581763, -0.002100382673077321, 0.22006289689672406, -0.0896156370691516, -0.03063067609364051, 0.41495726220911305, -0.1383475086977037, 0.00791937831129754, 0.1927529667865075, -0.19369849348585588, -0.1731406325857605, 0.3126162514699073, 0.10233908696055555, 0.14066867825394702, -0.06965407703916261, 0.045439961586235554, -0.057527530377198224, 0.25911892582350476, 0.014419660436738122, 0.048224731210316195, 0.2794075816575634, 0.03314690103054795, -0.031255400171458864, 0.07280427247116511, -0.2639675944061553, 0.015032027184107658, -0.2934152479123371, -0.11755170540340494, -0.11983408998368246, 0.10984962516348434, -0.10939074360658849, -0.14164671142425156, 0.3490658051136026, 0.09444006581336224, 0.3095456858100949, -0.018948714832583684, 0.29360313337456667, 0.15477823945871916, 0.017472984079877584, 0.09547868317313955, 0.2783951690848293, 0.21171423514779106, 0.0959639690691632, -0.227027700819592, 0.04384712678821463, -0.0002448596015715143] |
1,802.03147 | Mode Selection and Spectrum Partition for D2D Inband Communications: A
Physical Layer Security Perspective | This paper investigates from the physical layer security (PLS) perspective
the fundamental issues of mode selection and spectrum partition in cellular
networks with inband device-to-device (D2D) communication. We consider a mode
selection scheme allowing each D2D pair to probabilistically switch between the
underlay and overlay modes, and also a spectrum partition scheme where the
system spectrum is orthogonally partitioned between cellular and overlay D2D
communications. We first develop a general theoretical framework to model both
the secrecy outage/secrecy capacity performance of cellular users and
outage/capacity performance of D2D pairs, and to conduct performance
optimization to identify the optimal mode selection and spectrum partition for
secrecy capacity maximization and secrecy outage probability minimization. A
case study is then provided to demonstrate the application of our theoretical
framework for performance modeling and optimization, and also to illustrate the
impacts of mode selection and spectrum partition on the PLS performances of
inband D2D communications.
| cs.IT math.IT | this paper investigates from the physical layer security pls perspective the fundamental issues of mode selection and spectrum partition in cellular networks with inband devicetodevice d2d communication we consider a mode selection scheme allowing each d2d pair to probabilistically switch between the underlay and overlay modes and also a spectrum partition scheme where the system spectrum is orthogonally partitioned between cellular and overlay d2d communications we first develop a general theoretical framework to model both the secrecy outagesecrecy capacity performance of cellular users and outagecapacity performance of d2d pairs and to conduct performance optimization to identify the optimal mode selection and spectrum partition for secrecy capacity maximization and secrecy outage probability minimization a case study is then provided to demonstrate the application of our theoretical framework for performance modeling and optimization and also to illustrate the impacts of mode selection and spectrum partition on the pls performances of inband d2d communications | [['this', 'paper', 'investigates', 'from', 'the', 'physical', 'layer', 'security', 'pls', 'perspective', 'the', 'fundamental', 'issues', 'of', 'mode', 'selection', 'and', 'spectrum', 'partition', 'in', 'cellular', 'networks', 'with', 'inband', 'devicetodevice', 'd2d', 'communication', 'we', 'consider', 'a', 'mode', 'selection', 'scheme', 'allowing', 'each', 'd2d', 'pair', 'to', 'probabilistically', 'switch', 'between', 'the', 'underlay', 'and', 'overlay', 'modes', 'and', 'also', 'a', 'spectrum', 'partition', 'scheme', 'where', 'the', 'system', 'spectrum', 'is', 'orthogonally', 'partitioned', 'between', 'cellular', 'and', 'overlay', 'd2d', 'communications', 'we', 'first', 'develop', 'a', 'general', 'theoretical', 'framework', 'to', 'model', 'both', 'the', 'secrecy', 'outagesecrecy', 'capacity', 'performance', 'of', 'cellular', 'users', 'and', 'outagecapacity', 'performance', 'of', 'd2d', 'pairs', 'and', 'to', 'conduct', 'performance', 'optimization', 'to', 'identify', 'the', 'optimal', 'mode', 'selection', 'and', 'spectrum', 'partition', 'for', 'secrecy', 'capacity', 'maximization', 'and', 'secrecy', 'outage', 'probability', 'minimization', 'a', 'case', 'study', 'is', 'then', 'provided', 'to', 'demonstrate', 'the', 'application', 'of', 'our', 'theoretical', 'framework', 'for', 'performance', 'modeling', 'and', 'optimization', 'and', 'also', 'to', 'illustrate', 'the', 'impacts', 'of', 'mode', 'selection', 'and', 'spectrum', 'partition', 'on', 'the', 'pls', 'performances', 'of', 'inband', 'd2d', 'communications']] | [-0.24469232330280014, -0.07429871566268621, -0.022212486259401743, 0.024973576042282352, -0.07220120334704, -0.24116581883719004, 0.1961005329781043, 0.40747782955533707, -0.27598223789288795, -0.24683633261053955, 0.04983610554282622, -0.26121010633823055, -0.223041601844707, 0.09318350956325212, -0.08728705855373968, 0.0679909448864426, 0.047721743833698684, 0.009247976150551198, 0.048551251655507006, -0.23604010553224225, 0.2968563228695585, 0.13452367022033507, 0.4493887012936925, 0.07839643246425479, 0.013183560234888288, 0.027887997303420564, -0.0024828234587439754, -0.04144590387383364, -0.1373593750716056, 0.14038085977190592, 0.34516430314280244, 0.22508303218227405, 0.31168406063240744, -0.35817023941734494, -0.2653555416208286, 0.09298900712356471, 0.2061911030241207, -0.015943126929548863, -0.02541945461924469, -0.2666258562040584, 0.12281821340466256, -0.26819359431208906, 0.009127266323756452, -0.01510999117346618, -0.10602039493770407, 0.03836565719598642, -0.37073841474750296, -0.021370029061698298, -0.022975768061079736, 0.02385740230897529, -0.05163666189666963, -0.07400786230221841, -0.0056966176840957975, 0.17804741185633527, 0.04546303361273002, -0.07479785535103273, 0.10153309450853591, -0.09099080107149812, -0.15544491409692887, 0.3911570727875169, 0.027353773407650574, -0.24918489553809367, 0.15956065251535717, -0.053608341276920685, -0.10628016897939746, 0.12373301579035668, 0.2759983349441482, 0.027296977777084046, -0.18340887439956002, 0.021320418294147284, -0.002398374371680637, 0.16406563256285936, 0.052425651411032115, 0.15978311279658916, 0.15941841282019228, 0.23830040229559446, 0.15755198599345632, 0.1633975995617025, -0.10485299776195729, -0.1111774794794869, -0.22177737186219068, -0.14615220193994927, -0.19819075914315454, 0.005114284125250458, -0.08507747153312846, -0.07838895340643873, 0.4251631193423871, 0.10270892882339919, 0.10635902894498318, 0.15751430167247785, 0.4324238286072376, 0.10408783558171693, 0.006068061543441059, 0.12519888530154055, 0.19336941586369835, 0.1289550752610268, 0.09719308376649782, -0.24871736309403591, -0.010323215810419529, 0.03050209548099329] |
1,802.03148 | Infinite Soft Theorems from Gauge Symmetry | In this letter we show that the soft behaviour of photons and graviton
amplitudes, after projection, can be determined to infinite order in soft
expansion via ordinary on-shell gauge invariance. In particular, as one of the
particle's momenta becomes soft, gauge invariance relates the non-singular
diagrams of an n-point amplitude to that of the singular ones up to possible
homogeneous terms. We demonstrate that with a particular projection of the
soft-limit, the homogeneous terms do not contribute, and one arrives at an
infinite soft theorem. This reproduces the result recently derived from the
Ward identity of large gauge transformations. We also discuss the modification
of these soft theorems due to the presence of higher-dimensional operators.
| hep-th | in this letter we show that the soft behaviour of photons and graviton amplitudes after projection can be determined to infinite order in soft expansion via ordinary onshell gauge invariance in particular as one of the particles momenta becomes soft gauge invariance relates the nonsingular diagrams of an npoint amplitude to that of the singular ones up to possible homogeneous terms we demonstrate that with a particular projection of the softlimit the homogeneous terms do not contribute and one arrives at an infinite soft theorem this reproduces the result recently derived from the ward identity of large gauge transformations we also discuss the modification of these soft theorems due to the presence of higherdimensional operators | [['in', 'this', 'letter', 'we', 'show', 'that', 'the', 'soft', 'behaviour', 'of', 'photons', 'and', 'graviton', 'amplitudes', 'after', 'projection', 'can', 'be', 'determined', 'to', 'infinite', 'order', 'in', 'soft', 'expansion', 'via', 'ordinary', 'onshell', 'gauge', 'invariance', 'in', 'particular', 'as', 'one', 'of', 'the', 'particles', 'momenta', 'becomes', 'soft', 'gauge', 'invariance', 'relates', 'the', 'nonsingular', 'diagrams', 'of', 'an', 'npoint', 'amplitude', 'to', 'that', 'of', 'the', 'singular', 'ones', 'up', 'to', 'possible', 'homogeneous', 'terms', 'we', 'demonstrate', 'that', 'with', 'a', 'particular', 'projection', 'of', 'the', 'softlimit', 'the', 'homogeneous', 'terms', 'do', 'not', 'contribute', 'and', 'one', 'arrives', 'at', 'an', 'infinite', 'soft', 'theorem', 'this', 'reproduces', 'the', 'result', 'recently', 'derived', 'from', 'the', 'ward', 'identity', 'of', 'large', 'gauge', 'transformations', 'we', 'also', 'discuss', 'the', 'modification', 'of', 'these', 'soft', 'theorems', 'due', 'to', 'the', 'presence', 'of', 'higherdimensional', 'operators']] | [-0.125034987958877, 0.21469357739551925, -0.11483336621085587, 0.08899793314504559, -0.07512983867858092, -0.06431552433692243, 0.005554067635017893, 0.3259338919559251, -0.25493494342688633, -0.25893261027724845, 0.07910590361419094, -0.26922139825866276, -0.1635641553722646, 0.12757713387457087, -0.05117417591340516, 0.016441743108241456, 0.011003493875993982, 0.05888425387523097, -0.11072239154473999, -0.23907515399724893, 0.34683152456241456, 0.006413112856123758, 0.24604264470222204, 0.07601675511864217, 0.14448766282395176, 0.08139307423616234, -0.057192639723096204, -0.0013106764415683953, -0.06550453456578037, 0.09750462388214858, 0.2111074614991515, 0.04897908354178071, 0.13915831229811454, -0.4075325316061144, -0.14909355017640022, 0.1292041829220303, 0.16018672014546134, 0.11394957609312689, 0.019238518397121325, -0.24942766934957195, 0.0797682356160215, -0.18809969910299001, -0.22741414261475693, -0.11636113487993893, -0.015893706914199435, -0.050540881769974594, -0.22937587857671568, 0.09151324000750205, 0.09157567532814068, -0.02866261132547389, -0.04190163828594529, -0.04107681979000082, -0.0335832587848215, 0.09894733670466256, 0.13125533405691386, 0.030875502627990815, 0.10129190987461935, -0.18094238233550086, -0.13529313896256295, 0.37524989964440464, -0.08400186637072297, -0.19217708110480328, 0.1860202583666567, -0.15130421525353324, -0.18614103097630583, 0.14814312802627683, 0.12562447284226833, 0.11551596695840682, -0.15054521152911626, 0.1607873737356504, -0.031724403292426595, 0.1272921523899245, 0.14327430087749077, 0.06800942332281366, 0.1744081863809539, 0.03122296781056439, 0.021457186662187072, 0.19133401168004163, -0.02187735549700649, -0.08870185165433213, -0.40942731875440347, -0.13737035978423512, -0.1376571104740319, 0.08539075167133453, -0.138547700052099, -0.18457049328287173, 0.3379385198911895, 0.12829541957977672, 0.20436991736389007, 0.05695995476663761, 0.25527147074108536, 0.18128651634729265, 0.11252072941835807, 0.0374740535494588, 0.2682380830950063, 0.14592222419121992, 0.07861026161066864, -0.21742553517181912, -0.03442059546182661, 0.13941618386332108] |
1,802.03149 | On the Spectral Efficiency of Noncooperative Uplink Massive MIMO Systems | Massive multiple-input multiple-output (MIMO) systems have been drawing
considerable interest due to the growing throughput demands on wireless
networks. In the uplink, massive MIMO systems are commonly studied assuming
that each base station (BS) decodes the signals of its user terminals
separately and linearly while treating all interference as noise. Although this
approach provides improved spectral efficiency which scales with the number of
BS antennas in favorable channel conditions, it is generally sub-optimal from
an information-theoretic perspective. In this work we characterize the spectral
efficiency of massive MIMO when the BSs are allowed to jointly decode the
received signals. In particular, we consider four schemes for treating the
interference, and derive the achievable average ergodic rates for both finite
and asymptotic number of antennas for each scheme. Simulation tests of the
proposed methods illustrate their gains in spectral efficiency compared to the
standard approach of separate linear decoding, and show that the standard
approach fails to capture the actual achievable rates of massive MIMO systems,
particularly when the interference is dominant.
| cs.IT math.IT | massive multipleinput multipleoutput mimo systems have been drawing considerable interest due to the growing throughput demands on wireless networks in the uplink massive mimo systems are commonly studied assuming that each base station bs decodes the signals of its user terminals separately and linearly while treating all interference as noise although this approach provides improved spectral efficiency which scales with the number of bs antennas in favorable channel conditions it is generally suboptimal from an informationtheoretic perspective in this work we characterize the spectral efficiency of massive mimo when the bss are allowed to jointly decode the received signals in particular we consider four schemes for treating the interference and derive the achievable average ergodic rates for both finite and asymptotic number of antennas for each scheme simulation tests of the proposed methods illustrate their gains in spectral efficiency compared to the standard approach of separate linear decoding and show that the standard approach fails to capture the actual achievable rates of massive mimo systems particularly when the interference is dominant | [['massive', 'multipleinput', 'multipleoutput', 'mimo', 'systems', 'have', 'been', 'drawing', 'considerable', 'interest', 'due', 'to', 'the', 'growing', 'throughput', 'demands', 'on', 'wireless', 'networks', 'in', 'the', 'uplink', 'massive', 'mimo', 'systems', 'are', 'commonly', 'studied', 'assuming', 'that', 'each', 'base', 'station', 'bs', 'decodes', 'the', 'signals', 'of', 'its', 'user', 'terminals', 'separately', 'and', 'linearly', 'while', 'treating', 'all', 'interference', 'as', 'noise', 'although', 'this', 'approach', 'provides', 'improved', 'spectral', 'efficiency', 'which', 'scales', 'with', 'the', 'number', 'of', 'bs', 'antennas', 'in', 'favorable', 'channel', 'conditions', 'it', 'is', 'generally', 'suboptimal', 'from', 'an', 'informationtheoretic', 'perspective', 'in', 'this', 'work', 'we', 'characterize', 'the', 'spectral', 'efficiency', 'of', 'massive', 'mimo', 'when', 'the', 'bss', 'are', 'allowed', 'to', 'jointly', 'decode', 'the', 'received', 'signals', 'in', 'particular', 'we', 'consider', 'four', 'schemes', 'for', 'treating', 'the', 'interference', 'and', 'derive', 'the', 'achievable', 'average', 'ergodic', 'rates', 'for', 'both', 'finite', 'and', 'asymptotic', 'number', 'of', 'antennas', 'for', 'each', 'scheme', 'simulation', 'tests', 'of', 'the', 'proposed', 'methods', 'illustrate', 'their', 'gains', 'in', 'spectral', 'efficiency', 'compared', 'to', 'the', 'standard', 'approach', 'of', 'separate', 'linear', 'decoding', 'and', 'show', 'that', 'the', 'standard', 'approach', 'fails', 'to', 'capture', 'the', 'actual', 'achievable', 'rates', 'of', 'massive', 'mimo', 'systems', 'particularly', 'when', 'the', 'interference', 'is', 'dominant']] | [-0.23439794252027502, 0.03516960483153653, -0.007072117304897796, 0.04363220242500218, -0.04028155730508965, -0.23625507832597398, 0.09751106135285738, 0.36412286996002013, -0.22243460240142082, -0.2629771387416935, 0.0717260843198692, -0.25275490896188113, -0.18054152872108403, 0.1605344585902793, -0.10336876497195478, 0.06804054599678776, 0.06509395712736057, 0.06962765944980041, -0.041205579379562575, -0.27953526555636776, 0.2888892146796859, 0.13506778613909295, 0.38662296659531, -0.01341327063859119, 0.06784248361105306, 0.010299972814033952, -0.05902764065550607, -0.04213072990247032, -0.05731395508303261, 0.06281956638568979, 0.3447021129840647, 0.21819807156751597, 0.26133335562564475, -0.4096537406028014, -0.29544883763842417, 0.1040021675728719, 0.21200535453485642, 0.06669854229569369, -0.046901107827345814, -0.25618652894014593, 0.15174940261276362, -0.22607121741867553, -0.026089540070020838, 0.038918574965607966, -0.07791159316701324, 0.06271810321462727, -0.37178496972314623, 0.0329087031052083, 0.00410465978913837, 0.02084866893982885, -0.019181860179901776, -0.16548295174480268, 0.02229182269936155, 0.17078309207616854, 0.07698893287063886, -0.045187653392302796, 0.06656566092591973, -0.10486877719022072, -0.09146387805367073, 0.3710632021906541, 0.005609519001878035, -0.25593341645860923, 0.2105509721710107, -0.16134797606334003, -0.10489474884942392, 0.19154247905165828, 0.27095942272211027, 0.09591682923192496, -0.1948823408308447, 0.05483581050304554, 0.015590645394652908, 0.15694104268743891, 0.07915949649095796, 0.1839760449028721, 0.16035241873564515, 0.19580564912876974, 0.10267426179073838, 0.12529352798306367, -0.14235636966891194, -0.13910701617936205, -0.17473923359733423, -0.11182205200505753, -0.22219546116161437, -0.012569187293428253, -0.12119264796353081, -0.03245833959452241, 0.3284182016137939, 0.15246642462103166, 0.09828784374645448, 0.1316694260992883, 0.42432994921610023, 0.13612783326405203, 0.06387201790175025, 0.11396196903388577, 0.23226431899207742, 0.16046378194566882, 0.10039723832405319, -0.24772557945192208, 0.006464473387139321, -0.05641878750964956] |
1,802.0315 | Wafer-scale all-epitaxial GeSn-on-insulator on Si(111) by molecular beam
epitaxy | All epitaxial GeSn-on-insulator (GeSnOI) heterostructures have been realized
by conventional molecular beam epitaxy of both GeSn and a thin Gd2O3 insulating
layer, on Si(111) substrates. Analysis of the crystal and surface quality by
high-resolution transmission electron microscopy (HRTEM), high-resolution X-ray
diffraction (HRXRD), and atomic force microscopy (AFM) revealed the formation
of a continuous and fully-relaxed single-crystalline GeSn epilayer, however
with a surface roughness of 3.5 nm. Stacking faults and reflection microtwins
were also observed in cross-sectional HRTEM images. From Hall measurement, the
concentration and mobility of holes, introduced by un-intentional p-type doping
of the GeSn epilayers, were estimated to 8x10^16 cm-3 and 176 cm-2V-1s-1,
respectively. In metal-semiconductor-metal (MSM) Schottky diodes, fabricated
with these GeSnOI heterostructures, the dark current was observed to be lower
by a decade, when compared to similar diodes fabricated with GeSn/Ge/Si(001)
heterostructures. The results presented here are encouraging for the
development of these engineered substrates for (opto)electronic applications.
| physics.app-ph | all epitaxial gesnoninsulator gesnoi heterostructures have been realized by conventional molecular beam epitaxy of both gesn and a thin gd2o3 insulating layer on si111 substrates analysis of the crystal and surface quality by highresolution transmission electron microscopy hrtem highresolution xray diffraction hrxrd and atomic force microscopy afm revealed the formation of a continuous and fullyrelaxed singlecrystalline gesn epilayer however with a surface roughness of 35 nm stacking faults and reflection microtwins were also observed in crosssectional hrtem images from hall measurement the concentration and mobility of holes introduced by unintentional ptype doping of the gesn epilayers were estimated to 8x1016 cm3 and 176 cm2v1s1 respectively in metalsemiconductormetal msm schottky diodes fabricated with these gesnoi heterostructures the dark current was observed to be lower by a decade when compared to similar diodes fabricated with gesngesi001 heterostructures the results presented here are encouraging for the development of these engineered substrates for optoelectronic applications | [['all', 'epitaxial', 'gesnoninsulator', 'gesnoi', 'heterostructures', 'have', 'been', 'realized', 'by', 'conventional', 'molecular', 'beam', 'epitaxy', 'of', 'both', 'gesn', 'and', 'a', 'thin', 'gd2o3', 'insulating', 'layer', 'on', 'si111', 'substrates', 'analysis', 'of', 'the', 'crystal', 'and', 'surface', 'quality', 'by', 'highresolution', 'transmission', 'electron', 'microscopy', 'hrtem', 'highresolution', 'xray', 'diffraction', 'hrxrd', 'and', 'atomic', 'force', 'microscopy', 'afm', 'revealed', 'the', 'formation', 'of', 'a', 'continuous', 'and', 'fullyrelaxed', 'singlecrystalline', 'gesn', 'epilayer', 'however', 'with', 'a', 'surface', 'roughness', 'of', '35', 'nm', 'stacking', 'faults', 'and', 'reflection', 'microtwins', 'were', 'also', 'observed', 'in', 'crosssectional', 'hrtem', 'images', 'from', 'hall', 'measurement', 'the', 'concentration', 'and', 'mobility', 'of', 'holes', 'introduced', 'by', 'unintentional', 'ptype', 'doping', 'of', 'the', 'gesn', 'epilayers', 'were', 'estimated', 'to', '8x1016', 'cm3', 'and', '176', 'cm2v1s1', 'respectively', 'in', 'metalsemiconductormetal', 'msm', 'schottky', 'diodes', 'fabricated', 'with', 'these', 'gesnoi', 'heterostructures', 'the', 'dark', 'current', 'was', 'observed', 'to', 'be', 'lower', 'by', 'a', 'decade', 'when', 'compared', 'to', 'similar', 'diodes', 'fabricated', 'with', 'gesngesi001', 'heterostructures', 'the', 'results', 'presented', 'here', 'are', 'encouraging', 'for', 'the', 'development', 'of', 'these', 'engineered', 'substrates', 'for', 'optoelectronic', 'applications']] | [-0.08662520093783153, 0.1688883251852679, -0.028206496585008442, -0.06118208675749828, 0.02948034694418311, -0.20907668410135166, 0.0645021584976249, 0.5254277595426557, -0.20825397133269682, -0.36165686164583477, 0.03416009849811695, -0.3399065526924571, -0.10296420472100706, 0.2768289180865296, -0.0098615746888123, 0.1154158593339174, -0.043296278492376515, -0.23878240584060043, -0.07770626277339701, -0.23280508553317816, 0.219107355111513, 0.08400174578474391, 0.3859071436426824, 0.10174521246329457, 0.06322620155172562, -0.01169871508308566, 0.12111917070467912, 0.013755037804089841, -0.2024925277017209, 0.08999862495911162, 0.2775948320445763, -0.17912185824235433, 0.171656264104646, -0.5370531330252586, -0.26687700919756274, -0.12749159922126402, 0.11693148305726737, 0.05854962487328088, -0.15974628980204994, -0.3034128987540801, 0.12641877329395135, -0.08734735332549784, -0.039913589706593734, -0.020243756756579287, -0.0633041209235968, 0.021515397791319914, -0.1943025153156427, 0.07746490529959318, -0.022595173148295785, 0.14037364985489723, -0.11957188327258238, -0.1355597952992155, -0.12242763063737325, 0.02062521795334364, -0.009362840144356498, 0.022756450012845753, 0.279660821866979, -0.06381938459674771, -0.13323250775966716, 0.302061881553255, -0.008636681782715276, -0.013975395283702964, 0.15334415839680907, -0.22792009579740008, -0.01572411819392828, 0.2037738375904254, 0.08340601103030285, 0.11927244321088351, -0.1651362344179323, 0.03411629220801817, 0.007745934100694904, 0.24429294102679508, 0.19760982042850078, 0.06662229722410086, 0.2238902484326541, 0.22275406056555735, -0.018592475249818493, 0.07113780265556788, -0.21323095710447604, 0.11502545975389428, -0.08454624074986394, -0.22276396093970058, -0.20285493864117152, 0.13133734562450095, -0.07185742128612696, -0.17897790609890607, 0.3368348116973782, 0.08977526063289569, 0.14863547983699713, -0.0828946554767234, 0.289229031328828, 0.04367510474217283, 0.11118173354058242, -0.08646979312678534, 0.24281760848754522, 0.18917648685893335, 0.1302114884531621, -0.2299575432929128, 0.11922139002225635, -0.06842469838674561] |
1,802.03151 | Deep Private-Feature Extraction | We present and evaluate Deep Private-Feature Extractor (DPFE), a deep model
which is trained and evaluated based on information theoretic constraints.
Using the selective exchange of information between a user's device and a
service provider, DPFE enables the user to prevent certain sensitive
information from being shared with a service provider, while allowing them to
extract approved information using their model. We introduce and utilize the
log-rank privacy, a novel measure to assess the effectiveness of DPFE in
removing sensitive information and compare different models based on their
accuracy-privacy tradeoff. We then implement and evaluate the performance of
DPFE on smartphones to understand its complexity, resource demands, and
efficiency tradeoffs. Our results on benchmark image datasets demonstrate that
under moderate resource utilization, DPFE can achieve high accuracy for primary
tasks while preserving the privacy of sensitive features.
| stat.ML cs.CR cs.CV cs.IT cs.LG math.IT | we present and evaluate deep privatefeature extractor dpfe a deep model which is trained and evaluated based on information theoretic constraints using the selective exchange of information between a users device and a service provider dpfe enables the user to prevent certain sensitive information from being shared with a service provider while allowing them to extract approved information using their model we introduce and utilize the logrank privacy a novel measure to assess the effectiveness of dpfe in removing sensitive information and compare different models based on their accuracyprivacy tradeoff we then implement and evaluate the performance of dpfe on smartphones to understand its complexity resource demands and efficiency tradeoffs our results on benchmark image datasets demonstrate that under moderate resource utilization dpfe can achieve high accuracy for primary tasks while preserving the privacy of sensitive features | [['we', 'present', 'and', 'evaluate', 'deep', 'privatefeature', 'extractor', 'dpfe', 'a', 'deep', 'model', 'which', 'is', 'trained', 'and', 'evaluated', 'based', 'on', 'information', 'theoretic', 'constraints', 'using', 'the', 'selective', 'exchange', 'of', 'information', 'between', 'a', 'users', 'device', 'and', 'a', 'service', 'provider', 'dpfe', 'enables', 'the', 'user', 'to', 'prevent', 'certain', 'sensitive', 'information', 'from', 'being', 'shared', 'with', 'a', 'service', 'provider', 'while', 'allowing', 'them', 'to', 'extract', 'approved', 'information', 'using', 'their', 'model', 'we', 'introduce', 'and', 'utilize', 'the', 'logrank', 'privacy', 'a', 'novel', 'measure', 'to', 'assess', 'the', 'effectiveness', 'of', 'dpfe', 'in', 'removing', 'sensitive', 'information', 'and', 'compare', 'different', 'models', 'based', 'on', 'their', 'accuracyprivacy', 'tradeoff', 'we', 'then', 'implement', 'and', 'evaluate', 'the', 'performance', 'of', 'dpfe', 'on', 'smartphones', 'to', 'understand', 'its', 'complexity', 'resource', 'demands', 'and', 'efficiency', 'tradeoffs', 'our', 'results', 'on', 'benchmark', 'image', 'datasets', 'demonstrate', 'that', 'under', 'moderate', 'resource', 'utilization', 'dpfe', 'can', 'achieve', 'high', 'accuracy', 'for', 'primary', 'tasks', 'while', 'preserving', 'the', 'privacy', 'of', 'sensitive', 'features']] | [-0.08541322665082084, -0.0582993497899561, -0.08203874828673348, 0.09845437953265866, -0.1127919184492418, -0.22352321321075713, 0.1435346001000316, 0.40415967007478076, -0.2489266372665211, -0.372682120754487, 0.09923875236763033, -0.301539677436705, -0.11239816500563864, 0.18224935271190823, -0.14598458694225108, 0.06900501597836545, 0.06952434061483169, 0.05164415503817576, -0.048946364035967874, -0.2904939596351512, 0.31245781031816644, 0.0988257530658437, 0.4057213953678945, 0.1278315946369225, 0.14406919353124167, -0.00502228868642339, -0.07408671591267059, -0.04817916575853747, -0.10079508728754094, 0.18856400952295022, 0.2644564620300284, 0.23510852837590157, 0.30656754646312306, -0.43028506966376745, -0.16548796209886119, 0.059985199839704566, 0.1043447292306357, 0.03690909896988025, -0.048834177254940624, -0.3286637267028844, 0.11530322162779393, -0.202062399616396, 0.018101900514146244, -0.1777249047636158, -0.07621106328787627, 0.02419611385212866, -0.32014642433711776, -0.010223065847875896, -0.045007921662181614, 0.05585549320611689, -0.016837046808494186, -0.048271208801479254, -0.03232953014128186, 0.22704190908827715, 0.018535752873005414, -0.0023434719700297273, 0.17755993241789164, -0.16483125218127734, -0.1372670991104786, 0.3817843911824403, -0.058254924352729213, -0.2045640248667311, 0.20006568926145082, -0.02325880257067857, -0.13297986153996103, 0.052958887994841296, 0.25603740854464746, 0.08545442511310318, -0.19179769343937988, 0.007770744901305685, 0.02367640592813216, 0.22121196586242015, 0.035219942147119175, 0.11721800142830169, 0.16248483333986735, 0.22722621582862404, 0.06190344247001189, 0.17088625313265732, -0.1068408140725094, -0.0707765422899414, -0.1588504237295301, -0.13185677316591696, -0.1756871795764676, -0.013767550040588335, -0.1116155238883544, -0.06657625546299473, 0.4007623669863851, 0.26075357326685833, 0.17133152402454505, 0.10448241287031797, 0.3963069694737593, 0.015333472258687295, 0.1029467973038899, 0.10730445318406931, 0.17064053919856195, 0.011236611139719133, 0.12078700115628264, -0.19934834631987744, 0.12923201118009509, -0.03457054335697278] |
1,802.03152 | Reducing the Upfront Cost of Private Clouds with Clairvoyant Virtual
Machine Placement | Although public clouds still occupy the largest portion of the total cloud
infrastructure, private clouds are attracting increasing interest from both
industry and academia because of their better security and privacy control.
According to the existing studies, the high upfront cost is among the most
critical challenges associated with private clouds. To reduce cost and improve
performance, virtual machine placement (VMP) methods have been extensively
investigated, however, few of these methods have focused on private clouds.
This paper proposes a heterogeneous and multidimensional clairvoyant dynamic
bin packing (CDBP) model, in which the scheduler can conduct more efficient VMP
processes using additional information on the arrival time and duration of
virtual machines to reduce the datacenter scale and thereby decrease the
upfront cost of private clouds. In addition, a novel branch-and-bound algorithm
with a divide-and-conquer strategy (DCBB) is proposed to effectively and
efficiently handle the derived problem. One state-of-the-art and several
classic VMP methods are also modified to adapt to the proposed model to observe
their performance and compare with our proposed algorithm. Extensive
experiments are conducted on both real-world and synthetic workloads to
evaluate the accuracy and efficiency of the algorithms. The experimental
results demonstrate that DCBB delivers near-optimal solutions with a
convergence rate that is much faster than those of the other search-based
algorithms evaluated. In particular, DCBB yields the optimal solution for a
real-world workload with an execution time that is an order of magnitude
shorter than that required by the original branch-and-bound (BB) algorithm.
| cs.DC | although public clouds still occupy the largest portion of the total cloud infrastructure private clouds are attracting increasing interest from both industry and academia because of their better security and privacy control according to the existing studies the high upfront cost is among the most critical challenges associated with private clouds to reduce cost and improve performance virtual machine placement vmp methods have been extensively investigated however few of these methods have focused on private clouds this paper proposes a heterogeneous and multidimensional clairvoyant dynamic bin packing cdbp model in which the scheduler can conduct more efficient vmp processes using additional information on the arrival time and duration of virtual machines to reduce the datacenter scale and thereby decrease the upfront cost of private clouds in addition a novel branchandbound algorithm with a divideandconquer strategy dcbb is proposed to effectively and efficiently handle the derived problem one stateoftheart and several classic vmp methods are also modified to adapt to the proposed model to observe their performance and compare with our proposed algorithm extensive experiments are conducted on both realworld and synthetic workloads to evaluate the accuracy and efficiency of the algorithms the experimental results demonstrate that dcbb delivers nearoptimal solutions with a convergence rate that is much faster than those of the other searchbased algorithms evaluated in particular dcbb yields the optimal solution for a realworld workload with an execution time that is an order of magnitude shorter than that required by the original branchandbound bb algorithm | [['although', 'public', 'clouds', 'still', 'occupy', 'the', 'largest', 'portion', 'of', 'the', 'total', 'cloud', 'infrastructure', 'private', 'clouds', 'are', 'attracting', 'increasing', 'interest', 'from', 'both', 'industry', 'and', 'academia', 'because', 'of', 'their', 'better', 'security', 'and', 'privacy', 'control', 'according', 'to', 'the', 'existing', 'studies', 'the', 'high', 'upfront', 'cost', 'is', 'among', 'the', 'most', 'critical', 'challenges', 'associated', 'with', 'private', 'clouds', 'to', 'reduce', 'cost', 'and', 'improve', 'performance', 'virtual', 'machine', 'placement', 'vmp', 'methods', 'have', 'been', 'extensively', 'investigated', 'however', 'few', 'of', 'these', 'methods', 'have', 'focused', 'on', 'private', 'clouds', 'this', 'paper', 'proposes', 'a', 'heterogeneous', 'and', 'multidimensional', 'clairvoyant', 'dynamic', 'bin', 'packing', 'cdbp', 'model', 'in', 'which', 'the', 'scheduler', 'can', 'conduct', 'more', 'efficient', 'vmp', 'processes', 'using', 'additional', 'information', 'on', 'the', 'arrival', 'time', 'and', 'duration', 'of', 'virtual', 'machines', 'to', 'reduce', 'the', 'datacenter', 'scale', 'and', 'thereby', 'decrease', 'the', 'upfront', 'cost', 'of', 'private', 'clouds', 'in', 'addition', 'a', 'novel', 'branchandbound', 'algorithm', 'with', 'a', 'divideandconquer', 'strategy', 'dcbb', 'is', 'proposed', 'to', 'effectively', 'and', 'efficiently', 'handle', 'the', 'derived', 'problem', 'one', 'stateoftheart', 'and', 'several', 'classic', 'vmp', 'methods', 'are', 'also', 'modified', 'to', 'adapt', 'to', 'the', 'proposed', 'model', 'to', 'observe', 'their', 'performance', 'and', 'compare', 'with', 'our', 'proposed', 'algorithm', 'extensive', 'experiments', 'are', 'conducted', 'on', 'both', 'realworld', 'and', 'synthetic', 'workloads', 'to', 'evaluate', 'the', 'accuracy', 'and', 'efficiency', 'of', 'the', 'algorithms', 'the', 'experimental', 'results', 'demonstrate', 'that', 'dcbb', 'delivers', 'nearoptimal', 'solutions', 'with', 'a', 'convergence', 'rate', 'that', 'is', 'much', 'faster', 'than', 'those', 'of', 'the', 'other', 'searchbased', 'algorithms', 'evaluated', 'in', 'particular', 'dcbb', 'yields', 'the', 'optimal', 'solution', 'for', 'a', 'realworld', 'workload', 'with', 'an', 'execution', 'time', 'that', 'is', 'an', 'order', 'of', 'magnitude', 'shorter', 'than', 'that', 'required', 'by', 'the', 'original', 'branchandbound', 'bb', 'algorithm']] | [-0.08774879299070142, -0.007333430186992064, -0.058213512206874124, 0.06696462207540067, -0.08291945352343978, -0.1597016231427575, 0.10882483430375246, 0.4253532287808574, -0.24726586164272488, -0.36496086046099663, 0.11216080067887509, -0.2749262130156735, -0.11018376211291254, 0.2315362260470591, -0.10373219429719739, 0.11963134460707008, 0.10112751347894924, 0.009635594478955992, -0.02473291041394809, -0.34615365716030566, 0.2570140426112453, 0.08931173172938388, 0.3358824298058341, 0.049916409508787035, 0.06608276148856716, -0.057446556887021515, -0.04033678164989574, 0.012574360513513315, -0.0756412088087565, 0.15927914277403388, 0.2653760913394134, 0.20582181269897346, 0.33058938047303477, -0.432410198180535, -0.18609501332673054, 0.11531593430431454, 0.1636636509101959, 0.053523380106326374, -0.05734154406436426, -0.27047211161958495, 0.13198873504326203, -0.17151877564961107, -0.041329161190177974, -0.10134563841043055, -0.01563209275018454, 0.04317793585795424, -0.27063726438436564, 0.009242621608096463, -0.017871783677170554, 0.020155896215010585, -0.03991026293492982, -0.15253820578279959, 0.013871216969526699, 0.13685915585630004, 0.06662913214328237, 0.040721579921920215, 0.1510106112767291, -0.12896886174360597, -0.17895389048333424, 0.41463379194672273, -0.02713909679732751, -0.17285479766475717, 0.22077444847767824, -0.05093200096095783, -0.1327963716793442, 0.16578775379670466, 0.2602907395282783, 0.12776709052476637, -0.1549310541287731, 0.040870957944695495, -0.02114487199819783, 0.17869169408516064, 0.03136391413863748, 0.04075844314632458, 0.1085863761694693, 0.21003616164032393, 0.11445655176469041, 0.1458000210466382, -0.0716263760504506, -0.161185461670024, -0.1520689003267969, -0.13027311959568927, -0.16490039533019307, -0.0574983726274525, -0.10962918633340746, -0.11107544652120081, 0.3408962420842845, 0.22798933218066708, 0.170387815561986, 0.10632880054304482, 0.416647920332001, 0.0656607341824849, 0.08633054031804015, 0.16156114664542057, 0.19234887447503463, -0.003915241809667853, 0.14973707438628303, -0.22499370674046165, 0.126280778618643, 0.008802507280909675] |
1,802.03153 | Statistical approach of pion parton distributions from Drell-Yan process | The quantum statistical approach proposed more than one decade ago was used
to determine the parton distributions for the proton by considering a large set
of accurate Deep Inelastic Scattering experimental results. We propose to
extend this work to extract the parton distributions for the pion by using data
on lepton pair production from various experiments. This global next-to-leading
order QCD analysis leads to a good description of several Drell-Yan $\pi^- W$
data. The resulting parton distributions are compared with earlier
determinations. We will also discuss the difference between nucleon and pion
structure in the same approach.
| hep-ph nucl-ex | the quantum statistical approach proposed more than one decade ago was used to determine the parton distributions for the proton by considering a large set of accurate deep inelastic scattering experimental results we propose to extend this work to extract the parton distributions for the pion by using data on lepton pair production from various experiments this global nexttoleading order qcd analysis leads to a good description of several drellyan pi w data the resulting parton distributions are compared with earlier determinations we will also discuss the difference between nucleon and pion structure in the same approach | [['the', 'quantum', 'statistical', 'approach', 'proposed', 'more', 'than', 'one', 'decade', 'ago', 'was', 'used', 'to', 'determine', 'the', 'parton', 'distributions', 'for', 'the', 'proton', 'by', 'considering', 'a', 'large', 'set', 'of', 'accurate', 'deep', 'inelastic', 'scattering', 'experimental', 'results', 'we', 'propose', 'to', 'extend', 'this', 'work', 'to', 'extract', 'the', 'parton', 'distributions', 'for', 'the', 'pion', 'by', 'using', 'data', 'on', 'lepton', 'pair', 'production', 'from', 'various', 'experiments', 'this', 'global', 'nexttoleading', 'order', 'qcd', 'analysis', 'leads', 'to', 'a', 'good', 'description', 'of', 'several', 'drellyan', 'pi', 'w', 'data', 'the', 'resulting', 'parton', 'distributions', 'are', 'compared', 'with', 'earlier', 'determinations', 'we', 'will', 'also', 'discuss', 'the', 'difference', 'between', 'nucleon', 'and', 'pion', 'structure', 'in', 'the', 'same', 'approach']] | [-0.006134460695788802, 0.14701041252323493, -0.15964446614794048, 0.16551761827239594, -0.055946400602703394, -0.04223193156415328, 0.03368214499949449, 0.3840436399098217, -0.18792852162162668, -0.27343165987776114, -0.03339734498997094, -0.34022043423592735, -0.020546835583164214, 0.15928359301376743, 0.048556596871235015, 0.14799338745279716, 0.12092698298721123, -0.028179451266361268, -0.11212146721453857, -0.24696946314766466, 0.3648448783097808, 0.07091261802292813, 0.2770674667445962, 0.12795926993424744, 0.06425560960670952, 0.07206838010071018, -0.10727277731933371, -0.07754324005014196, -0.1583822779705479, 0.16778297699296596, 0.2611461775113358, 0.07935446461323005, 0.14454940557911916, -0.4029520851819171, -0.16197963485244624, 0.08019113329421614, 0.13184891218444353, 0.15001737387591646, -0.018951549415132173, -0.26834505924129304, 0.11118744410689652, -0.26311214306612607, -0.10324990898658781, -0.16456445728515073, -0.03750256999136554, -0.0016782813676700149, -0.29940899630790074, 0.056743379734809384, -0.04070332746703139, 0.008880832532574375, -0.003263159388599476, -0.20505808462321604, 0.02730068394112564, 0.06655635163860069, 0.10813258844667796, 0.10253712942958185, 0.11041995760091801, -0.1588673921849233, -0.1832459974726758, 0.40318689575015576, -0.04036973089525943, -0.174996142150815, 0.1315634742801644, -0.1989614457448887, -0.12923992708440601, 0.1275454108560093, 0.20825961137132853, 0.08611706752910941, -0.21968934827150546, 0.04214295455837891, -0.06511317869917173, 0.1504614781276275, 0.09486123471348018, 0.021450125426294032, 0.15423252325044157, 0.2268342381636084, -0.013001634696133664, 0.08702090842716549, -0.12791789260023206, -0.1128397518384856, -0.347267198827617, -0.07558998506928473, -0.12606134411600448, 0.06083701834557866, -0.07782281974085112, -0.07721436983838524, 0.3830179057669701, 0.17090166593450554, 0.27986058978767125, 0.04001775125435256, 0.3275672026823476, 0.09768738697379582, 0.0733657960309503, 0.053735872593794747, 0.22946365089299753, 0.17340390573822193, 0.13403401463340545, -0.22053098097952448, 0.05571967963436522, 0.04792739471574266] |
1,802.03154 | Boosting Image Forgery Detection using Resampling Features and Copy-move
analysis | Realistic image forgeries involve a combination of splicing, resampling,
cloning, region removal and other methods. While resampling detection
algorithms are effective in detecting splicing and resampling, copy-move
detection algorithms excel in detecting cloning and region removal. In this
paper, we combine these complementary approaches in a way that boosts the
overall accuracy of image manipulation detection. We use the copy-move
detection method as a pre-filtering step and pass those images that are
classified as untampered to a deep learning based resampling detection
framework. Experimental results on various datasets including the 2017 NIST
Nimble Challenge Evaluation dataset comprising nearly 10,000 pristine and
tampered images shows that there is a consistent increase of 8%-10% in
detection rates, when copy-move algorithm is combined with different resampling
detection algorithms.
| cs.CV | realistic image forgeries involve a combination of splicing resampling cloning region removal and other methods while resampling detection algorithms are effective in detecting splicing and resampling copymove detection algorithms excel in detecting cloning and region removal in this paper we combine these complementary approaches in a way that boosts the overall accuracy of image manipulation detection we use the copymove detection method as a prefiltering step and pass those images that are classified as untampered to a deep learning based resampling detection framework experimental results on various datasets including the 2017 nist nimble challenge evaluation dataset comprising nearly 10000 pristine and tampered images shows that there is a consistent increase of 810 in detection rates when copymove algorithm is combined with different resampling detection algorithms | [['realistic', 'image', 'forgeries', 'involve', 'a', 'combination', 'of', 'splicing', 'resampling', 'cloning', 'region', 'removal', 'and', 'other', 'methods', 'while', 'resampling', 'detection', 'algorithms', 'are', 'effective', 'in', 'detecting', 'splicing', 'and', 'resampling', 'copymove', 'detection', 'algorithms', 'excel', 'in', 'detecting', 'cloning', 'and', 'region', 'removal', 'in', 'this', 'paper', 'we', 'combine', 'these', 'complementary', 'approaches', 'in', 'a', 'way', 'that', 'boosts', 'the', 'overall', 'accuracy', 'of', 'image', 'manipulation', 'detection', 'we', 'use', 'the', 'copymove', 'detection', 'method', 'as', 'a', 'prefiltering', 'step', 'and', 'pass', 'those', 'images', 'that', 'are', 'classified', 'as', 'untampered', 'to', 'a', 'deep', 'learning', 'based', 'resampling', 'detection', 'framework', 'experimental', 'results', 'on', 'various', 'datasets', 'including', 'the', '2017', 'nist', 'nimble', 'challenge', 'evaluation', 'dataset', 'comprising', 'nearly', '10000', 'pristine', 'and', 'tampered', 'images', 'shows', 'that', 'there', 'is', 'a', 'consistent', 'increase', 'of', '810', 'in', 'detection', 'rates', 'when', 'copymove', 'algorithm', 'is', 'combined', 'with', 'different', 'resampling', 'detection', 'algorithms']] | [-0.043839042585808785, -0.029147890839725733, -0.05792727222293615, 0.04630152965057641, -0.028600015919655563, -0.21093632507696747, 0.04683794789854437, 0.460217670083046, -0.18637510946020483, -0.3776172537207603, 0.11920565930288285, -0.3125713440254331, -0.153864630876109, 0.23200479312241076, -0.15161304393457248, 0.07186415744572879, 0.1825553716868162, -0.010702070724219083, -0.04648458477295935, -0.27641205460671336, 0.23319653576612473, 0.051958759704371915, 0.38298353042453526, 0.0053417677246034145, 0.09977936640009284, -0.007070530146360397, -0.11524068330973387, -0.007992557235062122, -0.03016249197995057, 0.12243705742247403, 0.3185387535826303, 0.23307055424153805, 0.2835262957252562, -0.34093516239523886, -0.1719174454738386, 0.08511947731301188, 0.1769436027202755, 0.1549249467245536, -0.1369806777294725, -0.36961338566429913, 0.07932785063795746, -0.1743737633600831, 0.04431922798603773, -0.13455320423841477, -0.019857625307515264, -0.027321877651382238, -0.25660641884058716, 0.10326932941633277, 0.055610478622838855, 0.08466170191392303, -0.03811550096410792, -0.10584569605439902, 0.07956574464496226, 0.13898373870854266, -0.007458019733428955, 0.04014244540128857, 0.20628364854399114, -0.2123546357192099, -0.19747086529433727, 0.3307698172405362, -0.05901936699822545, -0.15626304634660482, 0.24009404489584268, -0.021462895592674613, -0.19452805024385453, 0.16800608231499792, 0.19985148847382517, 0.17016147651523353, -0.13087042515596842, -0.04620581399137154, -0.00434269031137228, 0.14759189826250077, 0.12364784461259842, -0.02693652591109276, 0.1583059321194887, 0.22718718251772224, 0.04331046959757805, 0.11937402659072541, -0.2515885821711272, -0.018280766390264033, -0.23701022178679704, -0.11502792560867965, -0.1744930087160319, -0.05876408991031349, -0.06542907275201287, -0.15721341003850103, 0.37736183136701584, 0.2558691846653819, 0.181524626692757, 0.07182742234319449, 0.4011067844331265, -0.002187815884128213, 0.12385184025019408, 0.05248831109330058, 0.20848296376131475, -0.015982455754652618, 0.011330130578950047, -0.14600575695186854, 0.09391412604041398, 0.04528722472116351] |
1,802.03155 | Web-Based Implementation of Travelling Salesperson Problem Using Genetic
Algorithm | The world is connected through the Internet. As the abundance of Internet
users connected into the Web and the popularity of cloud computing research,
the need of Artificial Intelligence (AI) is demanding. In this research,
Genetic Algorithm (GA) as AI optimization method through natural selection and
genetic evolution is utilized. There are many applications of GA such as web
mining, load balancing, routing, and scheduling or web service selection.
Hence, it is a challenging task to discover whether the code mainly server side
and web based language technology affects the performance of GA. Travelling
Salesperson Problem (TSP) as Non Polynomial-hard (NP-hard) problem is provided
to be a problem domain to be solved by GA. While many scientists prefer Python
in GA implementation, another popular high-level interpreter programming
language such as PHP (PHP Hypertext Preprocessor) and Ruby were benchmarked.
Line of codes, file sizes, and performances based on GA implementation and
runtime were found varies among these programming languages. Based on the
result, the use of Ruby in GA implementation is recommended.
| cs.NE cs.PL | the world is connected through the internet as the abundance of internet users connected into the web and the popularity of cloud computing research the need of artificial intelligence ai is demanding in this research genetic algorithm ga as ai optimization method through natural selection and genetic evolution is utilized there are many applications of ga such as web mining load balancing routing and scheduling or web service selection hence it is a challenging task to discover whether the code mainly server side and web based language technology affects the performance of ga travelling salesperson problem tsp as non polynomialhard nphard problem is provided to be a problem domain to be solved by ga while many scientists prefer python in ga implementation another popular highlevel interpreter programming language such as php php hypertext preprocessor and ruby were benchmarked line of codes file sizes and performances based on ga implementation and runtime were found varies among these programming languages based on the result the use of ruby in ga implementation is recommended | [['the', 'world', 'is', 'connected', 'through', 'the', 'internet', 'as', 'the', 'abundance', 'of', 'internet', 'users', 'connected', 'into', 'the', 'web', 'and', 'the', 'popularity', 'of', 'cloud', 'computing', 'research', 'the', 'need', 'of', 'artificial', 'intelligence', 'ai', 'is', 'demanding', 'in', 'this', 'research', 'genetic', 'algorithm', 'ga', 'as', 'ai', 'optimization', 'method', 'through', 'natural', 'selection', 'and', 'genetic', 'evolution', 'is', 'utilized', 'there', 'are', 'many', 'applications', 'of', 'ga', 'such', 'as', 'web', 'mining', 'load', 'balancing', 'routing', 'and', 'scheduling', 'or', 'web', 'service', 'selection', 'hence', 'it', 'is', 'a', 'challenging', 'task', 'to', 'discover', 'whether', 'the', 'code', 'mainly', 'server', 'side', 'and', 'web', 'based', 'language', 'technology', 'affects', 'the', 'performance', 'of', 'ga', 'travelling', 'salesperson', 'problem', 'tsp', 'as', 'non', 'polynomialhard', 'nphard', 'problem', 'is', 'provided', 'to', 'be', 'a', 'problem', 'domain', 'to', 'be', 'solved', 'by', 'ga', 'while', 'many', 'scientists', 'prefer', 'python', 'in', 'ga', 'implementation', 'another', 'popular', 'highlevel', 'interpreter', 'programming', 'language', 'such', 'as', 'php', 'php', 'hypertext', 'preprocessor', 'and', 'ruby', 'were', 'benchmarked', 'line', 'of', 'codes', 'file', 'sizes', 'and', 'performances', 'based', 'on', 'ga', 'implementation', 'and', 'runtime', 'were', 'found', 'varies', 'among', 'these', 'programming', 'languages', 'based', 'on', 'the', 'result', 'the', 'use', 'of', 'ruby', 'in', 'ga', 'implementation', 'is', 'recommended']] | [-0.11063776875243467, -0.03647304159479545, -0.02077315181548543, 0.07558438783196514, -0.17534124577102964, -0.23715599258156383, 0.06211093197960187, 0.4553173853632282, -0.3190014331053723, -0.38432664454859844, 0.11930614310001736, -0.26275476209052345, -0.13572102596517652, 0.21764822555842864, -0.06489512159982148, 0.049324675265233965, 0.08300040659275564, 0.03394325255306766, 0.016539981027188545, -0.3156595448579858, 0.22307868828887448, 0.07758053621886682, 0.3281049646437168, 0.0668719574535156, 0.02657212883932516, -0.00037224573110613754, -0.028980703685460064, 0.0028357684283572084, -0.04647745632374769, 0.1398592873921563, 0.36663447516039016, 0.31852775738738914, 0.3205511091496138, -0.4118955495438593, -0.13793293169891352, 0.03995387388174148, 0.1678123431829804, 0.07025858908069922, -0.07583205352660598, -0.2886873175883118, 0.0992888276328278, -0.17235150152906392, -0.0005582222934154903, -0.023779473601676086, 0.0545494896304958, 0.029588673889691778, -0.2005357154960032, -0.07079041421632556, -0.009238561937715585, 0.11833883043214241, -0.00033104415462516685, -0.1517583424348713, -0.02138509942109094, 0.12240248913465834, 0.04286464806748828, 0.06272426295258543, 0.21420326817999868, -0.07789146291393348, -0.18171857517924817, 0.44590536771780426, 0.003030672696802546, -0.1665299758698572, 0.21606636837686358, 0.07769093210671973, -0.16196212916333666, 0.0778142229448456, 0.23191567110445568, 0.11575752603547539, -0.19473288379719153, 0.11840522280955852, -0.005527851428590058, 0.19834970628897494, 0.08706043494372245, -0.032662658135899726, 0.18183392266852452, 0.27137559180914916, 0.0821964011164656, 0.11535287768826546, 0.0015325870392296245, -0.10909284674434115, -0.1422200313262532, -0.17738301521988914, -0.19051579846178784, -0.015192629187367857, -0.08598758046975812, -0.20088669571148998, 0.3526460108018535, 0.16954898581401828, 0.0682129643528777, 0.023774207805228584, 0.34556376365396907, 0.03510037630399251, 0.11934334575746428, 0.15394941937582404, 0.07805867189514067, 0.017303126980550587, 0.19083876283702386, -0.20640733113841098, 0.13773804823731017, 0.044133954347275635] |
1,802.03156 | Complex ISNMF: a Phase-Aware Model for Monaural Audio Source Separation | This paper introduces a phase-aware probabilistic model for audio source
separation. Classical source models in the short-term Fourier transform domain
use circularly-symmetric Gaussian or Poisson random variables. This is
equivalent to assuming that the phase of each source is uniformly distributed,
which is not suitable for exploiting the underlying structure of the phase.
Drawing on preliminary works, we introduce here a Bayesian anisotropic Gaussian
source model in which the phase is no longer uniform. Such a model permits us
to favor a phase value that originates from a signal model through a Markov
chain prior structure. The variance of the latent variables are structured with
nonnegative matrix factorization (NMF). The resulting model is called complex
Itakura-Saito NMF (ISNMF) since it generalizes the ISNMF model to the case of
non-isotropic variables. It combines the advantages of ISNMF, which uses a
distortion measure adapted to audio and yields a set of estimates which
preserve the overall energy of the mixture, and of complex NMF, which enables
one to account for some phase constraints. We derive a generalized
expectation-maximization algorithm to estimate the model parameters.
Experiments conducted on a musical source separation task in a semi-informed
setting show that the proposed approach outperforms state-of-the-art
phase-aware separation techniques.
| cs.SD eess.AS | this paper introduces a phaseaware probabilistic model for audio source separation classical source models in the shortterm fourier transform domain use circularlysymmetric gaussian or poisson random variables this is equivalent to assuming that the phase of each source is uniformly distributed which is not suitable for exploiting the underlying structure of the phase drawing on preliminary works we introduce here a bayesian anisotropic gaussian source model in which the phase is no longer uniform such a model permits us to favor a phase value that originates from a signal model through a markov chain prior structure the variance of the latent variables are structured with nonnegative matrix factorization nmf the resulting model is called complex itakurasaito nmf isnmf since it generalizes the isnmf model to the case of nonisotropic variables it combines the advantages of isnmf which uses a distortion measure adapted to audio and yields a set of estimates which preserve the overall energy of the mixture and of complex nmf which enables one to account for some phase constraints we derive a generalized expectationmaximization algorithm to estimate the model parameters experiments conducted on a musical source separation task in a semiinformed setting show that the proposed approach outperforms stateoftheart phaseaware separation techniques | [['this', 'paper', 'introduces', 'a', 'phaseaware', 'probabilistic', 'model', 'for', 'audio', 'source', 'separation', 'classical', 'source', 'models', 'in', 'the', 'shortterm', 'fourier', 'transform', 'domain', 'use', 'circularlysymmetric', 'gaussian', 'or', 'poisson', 'random', 'variables', 'this', 'is', 'equivalent', 'to', 'assuming', 'that', 'the', 'phase', 'of', 'each', 'source', 'is', 'uniformly', 'distributed', 'which', 'is', 'not', 'suitable', 'for', 'exploiting', 'the', 'underlying', 'structure', 'of', 'the', 'phase', 'drawing', 'on', 'preliminary', 'works', 'we', 'introduce', 'here', 'a', 'bayesian', 'anisotropic', 'gaussian', 'source', 'model', 'in', 'which', 'the', 'phase', 'is', 'no', 'longer', 'uniform', 'such', 'a', 'model', 'permits', 'us', 'to', 'favor', 'a', 'phase', 'value', 'that', 'originates', 'from', 'a', 'signal', 'model', 'through', 'a', 'markov', 'chain', 'prior', 'structure', 'the', 'variance', 'of', 'the', 'latent', 'variables', 'are', 'structured', 'with', 'nonnegative', 'matrix', 'factorization', 'nmf', 'the', 'resulting', 'model', 'is', 'called', 'complex', 'itakurasaito', 'nmf', 'isnmf', 'since', 'it', 'generalizes', 'the', 'isnmf', 'model', 'to', 'the', 'case', 'of', 'nonisotropic', 'variables', 'it', 'combines', 'the', 'advantages', 'of', 'isnmf', 'which', 'uses', 'a', 'distortion', 'measure', 'adapted', 'to', 'audio', 'and', 'yields', 'a', 'set', 'of', 'estimates', 'which', 'preserve', 'the', 'overall', 'energy', 'of', 'the', 'mixture', 'and', 'of', 'complex', 'nmf', 'which', 'enables', 'one', 'to', 'account', 'for', 'some', 'phase', 'constraints', 'we', 'derive', 'a', 'generalized', 'expectationmaximization', 'algorithm', 'to', 'estimate', 'the', 'model', 'parameters', 'experiments', 'conducted', 'on', 'a', 'musical', 'source', 'separation', 'task', 'in', 'a', 'semiinformed', 'setting', 'show', 'that', 'the', 'proposed', 'approach', 'outperforms', 'stateoftheart', 'phaseaware', 'separation', 'techniques']] | [-0.07427726508911901, 0.053826107846554644, -0.1430606705210002, 0.07075420055673756, -0.13351059539858343, -0.15610562428015426, 0.040163118034380996, 0.40180787853346084, -0.3051422425405824, -0.2618593844009352, 0.0927356387238509, -0.23142904552213592, -0.15871459927915693, 0.15402081203784593, -0.06430766731041845, 0.053315090888358764, 0.06992442134694365, 0.039111937890563324, -0.08917232603293482, -0.18974381121531533, 0.29851417117029555, 0.052336799171799106, 0.2989880080114628, -0.028671421369840504, 0.1695081739585498, 0.03489859547956934, -0.05252823899006884, -0.011171022090565395, -0.0678921517831938, 0.11888331701529437, 0.21848194904962978, 0.15718744833508663, 0.25793380192893883, -0.35262096549379707, -0.26545290751703854, 0.14127048052700575, 0.09696672374544335, 0.09120026202654476, -0.012505969607840142, -0.28307956755688884, 0.06799402369617535, -0.15560261124235766, -0.05577762237190283, -0.07305070260892911, -0.044650098657593354, 0.005466260896821327, -0.3474195274516362, 0.08850426957804912, 0.11367609817534685, -0.015926717911282636, -0.056720078041377874, -0.1414202337194546, 0.0521293075518967, 0.07661622022381832, 0.024272331861857087, 0.06796385179929838, 0.08964924320229903, -0.08380045062573306, -0.09278040534353314, 0.3596874320732769, -0.06804248548842269, -0.24721916683770606, 0.16365621523849042, -0.05790547309259843, -0.1570344022498122, 0.13534400223988324, 0.17995509028083786, 0.10227972789773065, -0.1707269295303408, 0.08089603197341097, -0.06316688287030593, 0.23025997543335877, 0.013422655564471345, 0.0014986569615851703, 0.15805055348780647, 0.18429157563732945, 0.06063214464003009, 0.1834453872033381, -0.1208533191562543, -0.1319589310055002, -0.2649019550201781, -0.11306351163135521, -0.20877929675057896, -0.0015315515810842833, -0.11952301687110799, -0.2068740972730657, 0.4081825549700504, 0.18344678660511635, 0.19641286443019734, 0.07441796135820283, 0.32157305278012466, 0.09051376056068593, 0.04130959639089467, 0.07005012734750689, 0.1505166774475431, 0.13773899906764514, 0.09349731039806393, -0.15030026866588742, 0.10075543575869698, 0.06534274692103505] |
1,802.03157 | Spin-susceptibility of spin-orbit coupled Fermi superfluids | Under the self-consistent mean-field approach for the BCS-BEC crossover
problem, we derive a closed-form analytical expression for the general spin
response of noncentrosymmetric Fermi superfluids with arbitrary spin-orbit
coupling and Zeeman fields. In addition to the paramagnetic, i.e., the Pauli
intra-helicity and Van Vleck type inter-helicity, contributions to the
spin-susceptibility tensor that have normal-state counterparts, we identify a
diamagnetic inter-helicity contribution that is unique to the superfluid state.
Our extensive numerical calculations for the Weyl, Rashba and equal
Rashba-Dresselhaus spin-orbit couplings illustrate that it is this diamagnetic
contribution that grows gradually with pairing and cancels precisely the Van
Vleck contribution away from the BCS regime in general.
| cond-mat.quant-gas cond-mat.str-el cond-mat.supr-con | under the selfconsistent meanfield approach for the bcsbec crossover problem we derive a closedform analytical expression for the general spin response of noncentrosymmetric fermi superfluids with arbitrary spinorbit coupling and zeeman fields in addition to the paramagnetic ie the pauli intrahelicity and van vleck type interhelicity contributions to the spinsusceptibility tensor that have normalstate counterparts we identify a diamagnetic interhelicity contribution that is unique to the superfluid state our extensive numerical calculations for the weyl rashba and equal rashbadresselhaus spinorbit couplings illustrate that it is this diamagnetic contribution that grows gradually with pairing and cancels precisely the van vleck contribution away from the bcs regime in general | [['under', 'the', 'selfconsistent', 'meanfield', 'approach', 'for', 'the', 'bcsbec', 'crossover', 'problem', 'we', 'derive', 'a', 'closedform', 'analytical', 'expression', 'for', 'the', 'general', 'spin', 'response', 'of', 'noncentrosymmetric', 'fermi', 'superfluids', 'with', 'arbitrary', 'spinorbit', 'coupling', 'and', 'zeeman', 'fields', 'in', 'addition', 'to', 'the', 'paramagnetic', 'ie', 'the', 'pauli', 'intrahelicity', 'and', 'van', 'vleck', 'type', 'interhelicity', 'contributions', 'to', 'the', 'spinsusceptibility', 'tensor', 'that', 'have', 'normalstate', 'counterparts', 'we', 'identify', 'a', 'diamagnetic', 'interhelicity', 'contribution', 'that', 'is', 'unique', 'to', 'the', 'superfluid', 'state', 'our', 'extensive', 'numerical', 'calculations', 'for', 'the', 'weyl', 'rashba', 'and', 'equal', 'rashbadresselhaus', 'spinorbit', 'couplings', 'illustrate', 'that', 'it', 'is', 'this', 'diamagnetic', 'contribution', 'that', 'grows', 'gradually', 'with', 'pairing', 'and', 'cancels', 'precisely', 'the', 'van', 'vleck', 'contribution', 'away', 'from', 'the', 'bcs', 'regime', 'in', 'general']] | [-0.1945508698853752, 0.1661270119003811, -0.04437877782093326, 0.07111905266218907, -0.09680103667773746, -0.1835033671034254, 0.07647668080017814, 0.3004672026331976, -0.234368927493463, -0.20552927791580278, -0.0821338536790001, -0.35692784947536466, -0.17595144027826498, 0.15519186967263385, 0.08340686934292843, -0.04681629843939588, -0.03558471667764814, -0.03608164786391909, -0.15491994241041676, -0.24179390573628107, 0.36579685040556315, -0.01186586782898543, 0.3035851290256207, 0.11603119074562476, 0.03617097050355712, 0.009857925810446998, 0.13607586769141117, 0.03841117421551695, -0.1487966547799758, 0.03256168606677883, 0.27322185240940733, -0.13242730280419565, 0.21508926170755108, -0.3915126474820218, -0.16022890918659713, 0.01628002817830387, 0.12726276104540546, 0.23155147999410852, -0.027242826738280577, -0.31553449089867325, -0.015609024189201728, -0.24286416683890769, -0.15796585789143616, -0.16252817858871565, 0.0017625271509629937, -0.034312956487619374, -0.27730061056285676, 0.13106860407575402, 0.08171759478919173, 0.043027285507807114, -0.1209086799414231, -0.16446244762551462, 0.005413519484342409, 0.06787521572660585, 0.08801800340747917, 0.061924165672675335, 0.10927563592932134, -0.12471895679646998, -0.04947539786632472, 0.3451070569912499, -0.10099006374805884, -0.14173112036484592, 0.1419002419592426, -0.16468167103791856, -0.06423850406295145, 0.1741527532016472, 0.09415821815436741, 0.040393892109211765, -0.1450547356474793, 0.1374453245113024, -0.04145849938065095, 0.09375039228009728, -0.0013487776389942978, 0.054403242006028106, 0.21042012178145772, 0.08288088054308351, 0.05134601441853381, 0.14078681991997896, -0.12105779733315532, -0.11035063658085353, -0.2898356103566739, -0.1346121820673909, -0.25419348028470884, 0.07894688489174752, -0.02625366016499751, -0.19729253281115713, 0.36991631903878924, 0.18694550361273424, 0.10905634391369773, 0.03977615529899749, 0.29080873008659286, 0.1427240117100498, 0.06331403249488124, 0.04858772259838176, 0.3192583887644534, 0.21563757156057037, 0.08708592804746246, -0.3815352277817064, 0.014885401796936145, 0.06568551833635934] |
1,802.03158 | Search for photonic signatures of gauge-mediated supersymmetry in 13 TeV
$pp$ collisions with the ATLAS detector | A search is presented for photonic signatures, motivated by generalized
models of gauge-mediated supersymmetry breaking. This search makes use of
proton-proton collision data at $\sqrt{s}$ = 13 TeV corresponding to an
integrated luminosity of 36.1 fb$^{-1}$ recorded by the ATLAS detector at the
LHC, and it explores models dominated by both strong and electroweak production
of supersymmetric partner states. Experimental signatures incorporating an
isolated photon and significant missing transverse momentum are explored. These
signatures include events with an additional photon or additional jet activity
not associated with any specific underlying quark flavor. No significant excess
of events is observed above the Standard Model prediction, and 95%
confidence-level upper limits of between 0.083 fb and 0.32 fb are set on the
visible cross section of contributions from physics beyond the Standard Model.
These results are interpreted in terms of lower limits on the masses of
gluinos, squarks, and gauginos in the context of generalized models of
gauge-mediated supersymmetry, which reach as high as 2.3 TeV for strongly
produced and 1.3 TeV for weakly produced supersymmetric partner pairs.
| hep-ex | a search is presented for photonic signatures motivated by generalized models of gaugemediated supersymmetry breaking this search makes use of protonproton collision data at sqrts 13 tev corresponding to an integrated luminosity of 361 fb1 recorded by the atlas detector at the lhc and it explores models dominated by both strong and electroweak production of supersymmetric partner states experimental signatures incorporating an isolated photon and significant missing transverse momentum are explored these signatures include events with an additional photon or additional jet activity not associated with any specific underlying quark flavor no significant excess of events is observed above the standard model prediction and 95 confidencelevel upper limits of between 0083 fb and 032 fb are set on the visible cross section of contributions from physics beyond the standard model these results are interpreted in terms of lower limits on the masses of gluinos squarks and gauginos in the context of generalized models of gaugemediated supersymmetry which reach as high as 23 tev for strongly produced and 13 tev for weakly produced supersymmetric partner pairs | [['a', 'search', 'is', 'presented', 'for', 'photonic', 'signatures', 'motivated', 'by', 'generalized', 'models', 'of', 'gaugemediated', 'supersymmetry', 'breaking', 'this', 'search', 'makes', 'use', 'of', 'protonproton', 'collision', 'data', 'at', 'sqrts', '13', 'tev', 'corresponding', 'to', 'an', 'integrated', 'luminosity', 'of', '361', 'fb1', 'recorded', 'by', 'the', 'atlas', 'detector', 'at', 'the', 'lhc', 'and', 'it', 'explores', 'models', 'dominated', 'by', 'both', 'strong', 'and', 'electroweak', 'production', 'of', 'supersymmetric', 'partner', 'states', 'experimental', 'signatures', 'incorporating', 'an', 'isolated', 'photon', 'and', 'significant', 'missing', 'transverse', 'momentum', 'are', 'explored', 'these', 'signatures', 'include', 'events', 'with', 'an', 'additional', 'photon', 'or', 'additional', 'jet', 'activity', 'not', 'associated', 'with', 'any', 'specific', 'underlying', 'quark', 'flavor', 'no', 'significant', 'excess', 'of', 'events', 'is', 'observed', 'above', 'the', 'standard', 'model', 'prediction', 'and', '95', 'confidencelevel', 'upper', 'limits', 'of', 'between', '0083', 'fb', 'and', '032', 'fb', 'are', 'set', 'on', 'the', 'visible', 'cross', 'section', 'of', 'contributions', 'from', 'physics', 'beyond', 'the', 'standard', 'model', 'these', 'results', 'are', 'interpreted', 'in', 'terms', 'of', 'lower', 'limits', 'on', 'the', 'masses', 'of', 'gluinos', 'squarks', 'and', 'gauginos', 'in', 'the', 'context', 'of', 'generalized', 'models', 'of', 'gaugemediated', 'supersymmetry', 'which', 'reach', 'as', 'high', 'as', '23', 'tev', 'for', 'strongly', 'produced', 'and', '13', 'tev', 'for', 'weakly', 'produced', 'supersymmetric', 'partner', 'pairs']] | [-0.05437879492528737, 0.22468528641013627, -0.0013066993161503758, 0.19904229958475167, -0.04760991141998342, -0.13945848025381566, 0.023495341470198973, 0.34818744342774155, -0.17752622903590756, -0.39783906939838615, 0.044412202860361766, -0.34295112050005366, 0.04403163230179676, 0.18024534476920961, 0.049605032594076226, 0.07995643568890436, 0.11749823667109012, -0.009754327995968716, -0.02699580179793494, -0.20859254455859108, 0.24686451498685139, 0.08644210156053304, 0.20616524101101927, 0.11320898631321533, 0.08856893004649984, 0.011952504611441067, -0.07510911139759369, -0.10879818086645433, -0.09311371867677995, 0.11135771544217797, 0.22329797566583562, 0.07866294793784619, 0.08955147101144706, -0.34738265212625263, -0.1197403558037643, 0.18558695916352527, 0.1427835351574634, 0.03861238453470703, -0.07046474427982632, -0.35308795882122856, 0.13820531154051424, -0.23213449420141322, -0.09947702397326273, 0.004101870823651552, -0.015773658068584544, -0.10932401631027461, -0.28290469897112674, 0.1472255147803974, -0.02071974235919437, 0.08543822036773366, -0.023424120816801276, -0.1778234104546053, -0.14672908198221454, -0.06198229536015008, 0.09223314834459286, 0.012638424159293728, 0.18617224334872196, -0.20610324479772577, -0.2553214536660484, 0.3597122600568192, -0.05988422931305, -0.1335130123727556, 0.23548529769909302, -0.13809055482436502, -0.13885247911326587, 0.18407274791704756, 0.267102822826377, 0.0567248888701267, -0.20668146181053348, 0.13138469128902736, -0.008958208614162036, 0.19215790960804693, 0.07476788846243705, 0.08280705628051822, 0.2674432101686086, 0.222676760338779, 0.0084524005651474, 0.06103361957440419, -0.10987783087849883, -0.07399322668090463, -0.48225453232548066, -0.060224647053650444, -0.08260893565203463, 0.03250573663581495, -0.07378909264499921, -0.05450657690742186, 0.36907255355534807, 0.1134461518374571, 0.30869383489979163, 0.01837797735418592, 0.23777389532420784, 0.1255268185593221, 0.09362026244401932, 0.0611794592280473, 0.34068814516333595, 0.0929542936211718, 0.13642633222309605, -0.15873124913312495, -0.018011163738556206, 0.038948986136487555] |
1,802.03159 | Running Distributed and Dynamic IoT Choreographies | IoT systems are growing larger and larger and are becoming suitable for basic
automation tasks. One of the features IoT automation systems can provide is
dealing with a dynamic system -- Devices leaving and joining the system during
operation. Additionally, IoT automation systems operate in a decentralized
manner. Current commercial automation systems have difficulty providing these
features. Integrating new devices into an automation system takes manual
intervention. Additionally, automation systems also require central entities to
orchestrate the operation of participants. With smarter sensors and actors, we
can move control operations into software deployed on a decentralized network
of devices, and provide support for dynamic systems. In this paper, we present
a framework for automation systems that demonstrates these two properties
(distributed and dynamic). We represent applications as semantically described
data flows that are run decentrally on participating devices, and connected at
runtime via rules. This allows integrating new devices into applications
without manual interaction and removes central controllers from the equation.
This approach provides similar features to current automation systems (central
engineering, multiple instantiation of applications), but enables distributed
and dynamic operation. We demonstrate satisfying performance of the system via
a quantitative evaluation.
| cs.DC | iot systems are growing larger and larger and are becoming suitable for basic automation tasks one of the features iot automation systems can provide is dealing with a dynamic system devices leaving and joining the system during operation additionally iot automation systems operate in a decentralized manner current commercial automation systems have difficulty providing these features integrating new devices into an automation system takes manual intervention additionally automation systems also require central entities to orchestrate the operation of participants with smarter sensors and actors we can move control operations into software deployed on a decentralized network of devices and provide support for dynamic systems in this paper we present a framework for automation systems that demonstrates these two properties distributed and dynamic we represent applications as semantically described data flows that are run decentrally on participating devices and connected at runtime via rules this allows integrating new devices into applications without manual interaction and removes central controllers from the equation this approach provides similar features to current automation systems central engineering multiple instantiation of applications but enables distributed and dynamic operation we demonstrate satisfying performance of the system via a quantitative evaluation | [['iot', 'systems', 'are', 'growing', 'larger', 'and', 'larger', 'and', 'are', 'becoming', 'suitable', 'for', 'basic', 'automation', 'tasks', 'one', 'of', 'the', 'features', 'iot', 'automation', 'systems', 'can', 'provide', 'is', 'dealing', 'with', 'a', 'dynamic', 'system', 'devices', 'leaving', 'and', 'joining', 'the', 'system', 'during', 'operation', 'additionally', 'iot', 'automation', 'systems', 'operate', 'in', 'a', 'decentralized', 'manner', 'current', 'commercial', 'automation', 'systems', 'have', 'difficulty', 'providing', 'these', 'features', 'integrating', 'new', 'devices', 'into', 'an', 'automation', 'system', 'takes', 'manual', 'intervention', 'additionally', 'automation', 'systems', 'also', 'require', 'central', 'entities', 'to', 'orchestrate', 'the', 'operation', 'of', 'participants', 'with', 'smarter', 'sensors', 'and', 'actors', 'we', 'can', 'move', 'control', 'operations', 'into', 'software', 'deployed', 'on', 'a', 'decentralized', 'network', 'of', 'devices', 'and', 'provide', 'support', 'for', 'dynamic', 'systems', 'in', 'this', 'paper', 'we', 'present', 'a', 'framework', 'for', 'automation', 'systems', 'that', 'demonstrates', 'these', 'two', 'properties', 'distributed', 'and', 'dynamic', 'we', 'represent', 'applications', 'as', 'semantically', 'described', 'data', 'flows', 'that', 'are', 'run', 'decentrally', 'on', 'participating', 'devices', 'and', 'connected', 'at', 'runtime', 'via', 'rules', 'this', 'allows', 'integrating', 'new', 'devices', 'into', 'applications', 'without', 'manual', 'interaction', 'and', 'removes', 'central', 'controllers', 'from', 'the', 'equation', 'this', 'approach', 'provides', 'similar', 'features', 'to', 'current', 'automation', 'systems', 'central', 'engineering', 'multiple', 'instantiation', 'of', 'applications', 'but', 'enables', 'distributed', 'and', 'dynamic', 'operation', 'we', 'demonstrate', 'satisfying', 'performance', 'of', 'the', 'system', 'via', 'a', 'quantitative', 'evaluation']] | [-0.2088505789157276, 0.03700873821418237, -0.04949141940082477, -0.015319511210253335, -0.10050173521441705, -0.19413261749679273, 0.054389206636349635, 0.40335258111678896, -0.2533150327182253, -0.33213607975676734, 0.116322451591716, -0.26017716397899776, -0.13890837580550716, 0.27407922849293154, -0.12180944942230486, 0.08875357468383319, 0.10912322909790652, -0.02832421833735827, -0.006503076388876086, -0.21285526567206997, 0.289402524724905, -0.003784287862933158, 0.3284690197001343, 0.029191213870830637, 0.0859352228498691, 0.03759825203557991, -0.016335812802773936, -0.002031020186865868, -0.015094153634629076, 0.1907411618694585, 0.35192281833066025, 0.1978378192989731, 0.3407600461285932, -0.4977237966535759, -0.1805219715753697, 0.042260671628722, 0.16723772382006508, 0.0743754027142855, -0.059948892099782825, -0.303326453433338, 0.11695257718162855, -0.24858307811865554, -0.08616662474374435, -0.14962687141978773, 0.006361302636875844, 0.039463907489991935, -0.2753158840716509, -0.029760349779761597, 0.03598484223591485, 0.09243198049727691, -0.049448993395058885, -0.06487764924745129, 0.0073010040793314345, 0.2218110909324666, -0.06309594352563834, -0.05184579767769505, 0.23425898278200347, -0.14922786238652055, -0.17924296362045178, 0.3835933323028005, 0.08238869423719601, -0.15495283664716164, 0.2502530863964491, -0.014252457380080255, -0.18410510110488426, 0.07487693201770021, 0.2576515953670895, 0.07589097684298042, -0.22601597250990219, 0.04302054944394689, 0.08510737010663015, 0.19286662403552632, 0.0029200415007516506, 0.06966777864590053, 0.2333293575708174, 0.2842472940780886, 0.1302836172426539, 0.13237492593141828, 0.017222474126818137, -0.10938637341367792, -0.24255515623829177, -0.1626208985967352, -0.10839739753206441, -0.007807377407678369, -0.05271112444347041, -0.11755201584264557, 0.348402040215765, 0.23499639380689105, 0.12411550067731482, 0.05490645437369718, 0.38461384747703975, 0.08356959740594712, 0.14934867226484558, 0.09989180762432906, 0.15024574388535353, 0.002338889818053439, 0.23830994611108647, -0.1363960829738976, 0.08245365091731177, -0.012147354851940071] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.