id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,803.01067 | Improved Charge Transfer Multiplet Method to Simulate M- and L-Edge
X-ray Absorption Spectra of Metal-Centered Excited States | Charge transfer multiplet (CTM) theory is a computationally undemanding and
highly mature method for simulating the soft X-ray spectra of first-row
transition metal complexes. However, CTM theory has seldom been applied to the
simulation of excited state spectra. In this article, we extend the CTM4XAS
software package to simulate M2,3- and L2,3-edge spectra of excited states of
first-row transition metals and to interpret CTM eigenfunctions in terms of
Russell-Saunders term symbols. We use these new programs to reinterpret the
recently reported excited state M2,3-edge difference spectra of photogenerated
ferrocenium cations and propose alternative assignments for the electronic
state of the photogenerated ferrocenium cations supported by CTM theory
simulations. We also use these new programs to model the L2,3-edge spectra of
FeII compounds during nuclear relaxation following photoinduced spin crossover,
and propose spectroscopic signatures for their vibrationally hot states
| physics.chem-ph cond-mat.mtrl-sci | charge transfer multiplet ctm theory is a computationally undemanding and highly mature method for simulating the soft xray spectra of firstrow transition metal complexes however ctm theory has seldom been applied to the simulation of excited state spectra in this article we extend the ctm4xas software package to simulate m23 and l23edge spectra of excited states of firstrow transition metals and to interpret ctm eigenfunctions in terms of russellsaunders term symbols we use these new programs to reinterpret the recently reported excited state m23edge difference spectra of photogenerated ferrocenium cations and propose alternative assignments for the electronic state of the photogenerated ferrocenium cations supported by ctm theory simulations we also use these new programs to model the l23edge spectra of feii compounds during nuclear relaxation following photoinduced spin crossover and propose spectroscopic signatures for their vibrationally hot states | [['charge', 'transfer', 'multiplet', 'ctm', 'theory', 'is', 'a', 'computationally', 'undemanding', 'and', 'highly', 'mature', 'method', 'for', 'simulating', 'the', 'soft', 'xray', 'spectra', 'of', 'firstrow', 'transition', 'metal', 'complexes', 'however', 'ctm', 'theory', 'has', 'seldom', 'been', 'applied', 'to', 'the', 'simulation', 'of', 'excited', 'state', 'spectra', 'in', 'this', 'article', 'we', 'extend', 'the', 'ctm4xas', 'software', 'package', 'to', 'simulate', 'm23', 'and', 'l23edge', 'spectra', 'of', 'excited', 'states', 'of', 'firstrow', 'transition', 'metals', 'and', 'to', 'interpret', 'ctm', 'eigenfunctions', 'in', 'terms', 'of', 'russellsaunders', 'term', 'symbols', 'we', 'use', 'these', 'new', 'programs', 'to', 'reinterpret', 'the', 'recently', 'reported', 'excited', 'state', 'm23edge', 'difference', 'spectra', 'of', 'photogenerated', 'ferrocenium', 'cations', 'and', 'propose', 'alternative', 'assignments', 'for', 'the', 'electronic', 'state', 'of', 'the', 'photogenerated', 'ferrocenium', 'cations', 'supported', 'by', 'ctm', 'theory', 'simulations', 'we', 'also', 'use', 'these', 'new', 'programs', 'to', 'model', 'the', 'l23edge', 'spectra', 'of', 'feii', 'compounds', 'during', 'nuclear', 'relaxation', 'following', 'photoinduced', 'spin', 'crossover', 'and', 'propose', 'spectroscopic', 'signatures', 'for', 'their', 'vibrationally', 'hot', 'states']] | [-0.0627128932683263, 0.14160843189764658, -0.044321726947707835, 0.0961512777789989, -0.01985061733627363, -0.1430822626091814, 0.04316975652353208, 0.41557523204178054, -0.23297163842738988, -0.2798000023262027, -0.0011499234191005064, -0.3160689014099155, -0.09505741980940323, 0.11333437266533591, 0.03253909790039282, 0.036999290949418485, 0.059486011984785474, -0.08442331665633794, -0.054473796356058514, -0.14251658060718053, 0.27605939188266776, 0.05510402310756035, 0.23819874201024718, 0.06694594000616823, 0.024336577901575604, -0.02225019641028827, 0.04910405624233296, -0.04907057505389436, -0.15594164908201064, 0.13645623200692866, 0.3047468773472835, 0.05808743307716213, 0.1720201320542187, -0.46012956062879634, -0.21192931739942117, 0.03593620597720313, 0.15006157839396858, 0.17289265977246138, -0.06726479541976005, -0.26745121929835636, 0.03440399513312835, -0.20923153628074728, -0.11259106410023592, -0.15634444625089494, 0.02374811568605604, -0.031502402658909835, -0.22873831488986446, 0.11047243730568237, -0.01969101556460373, 0.054952592595809084, -0.12168566636083757, -0.15444027876947075, -0.07648721202413607, 0.06330312207950663, 0.02977396831043092, -0.016454160073087278, 0.157198959882782, -0.05559442726628143, -0.1418706378831035, 0.3489051984095782, -0.07326584854950745, -0.08096919958959059, 0.19640907627763227, -0.13934304756591753, -0.1566696972483495, 0.1830612866084694, 0.1273484835281338, 0.20098122033317956, -0.15098897958694793, 0.060375556142175546, 0.004902876286959166, 0.19561200474393392, 0.01971371521187179, 0.08862401072538513, 0.20043043901815133, 0.1024644659835972, -0.05569212548845612, 0.14048157058491864, -0.08883393525320571, -0.08285117291105802, -0.19862188870662495, -0.18586116857306265, -0.19588093554108021, 0.054799206459018236, 0.03612503420395917, -0.15935593804084314, 0.4100014232612653, 0.12497891436385758, 0.1290157275781145, -0.004319134544964661, 0.254160303307478, 0.0902646493358428, 0.034582474185085366, 0.033510561491472315, 0.22146306198727175, 0.22080128241556368, 0.12720576829023605, -0.2733422174488249, 0.050583425801425407, 0.061898607390877956] |
1,803.01068 | Complexity of deciding whether a tropical linear prevariety is a
tropical variety | We give an algorithm, with a singly exponential complexity, deciding whether
a tropical linear prevariety is a tropical linear variety. The algorithm relies
on a criterion to be a tropical linear variety in terms of a duality between
the tropical orthogonalization $A^\perp$ and the double tropical
orthogonalization $A^{\perp \perp}$ of a subset $A$ of the vector space
$({\mathbb R} \cup \{ \infty \})^n$. We also give an example of a countable
family of tropical hyperplanes such that their intersection is not a tropical
prevariety.
| math.AG | we give an algorithm with a singly exponential complexity deciding whether a tropical linear prevariety is a tropical linear variety the algorithm relies on a criterion to be a tropical linear variety in terms of a duality between the tropical orthogonalization aperp and the double tropical orthogonalization aperp perp of a subset a of the vector space mathbb r cup infty n we also give an example of a countable family of tropical hyperplanes such that their intersection is not a tropical prevariety | [['we', 'give', 'an', 'algorithm', 'with', 'a', 'singly', 'exponential', 'complexity', 'deciding', 'whether', 'a', 'tropical', 'linear', 'prevariety', 'is', 'a', 'tropical', 'linear', 'variety', 'the', 'algorithm', 'relies', 'on', 'a', 'criterion', 'to', 'be', 'a', 'tropical', 'linear', 'variety', 'in', 'terms', 'of', 'a', 'duality', 'between', 'the', 'tropical', 'orthogonalization', 'aperp', 'and', 'the', 'double', 'tropical', 'orthogonalization', 'aperp', 'perp', 'of', 'a', 'subset', 'a', 'of', 'the', 'vector', 'space', 'mathbb', 'r', 'cup', 'infty', 'n', 'we', 'also', 'give', 'an', 'example', 'of', 'a', 'countable', 'family', 'of', 'tropical', 'hyperplanes', 'such', 'that', 'their', 'intersection', 'is', 'not', 'a', 'tropical', 'prevariety']] | [-0.17969361960843025, 0.06629371868919144, -0.0935802130051047, 0.08092206758334784, -0.09370618655783944, -0.12520459602889886, 0.046141002102788674, 0.2875478509140302, -0.3806038435593427, -0.15788864658539553, 0.1454849348484864, -0.21712054275200668, -0.2313152707423117, 0.20942724955686176, -0.1278152968229569, -0.011645492502903363, -0.0072578121066452506, 0.05971404641911567, -0.0962473273877593, -0.3010498500732054, 0.3220932746463152, -0.0201914973938501, 0.22498454229838877, 0.03383861485509628, 0.12392726413762205, 0.023015996755426187, 0.03582425003153193, 0.02045030591705062, -0.09999187080042664, 0.11290419757007117, 0.34672466984175776, 0.25525208667526583, 0.22054419006748371, -0.3721544944445591, -0.06572818002068853, 0.2442910195474165, 0.09939270018437227, 0.032659148359783445, -0.012541821659879243, -0.16148532444543867, 0.04074029038738774, -0.15104133599852942, -0.162258809903659, -0.055605347200958846, 0.055622195280774174, 0.010350621563483434, -0.3306863181607192, -0.09306093066662875, 0.12491598761225321, 0.18160776589739036, -0.001735017949109336, -0.10370356423488583, -0.07320765805352165, -0.019552425515041293, -0.09182886871879539, 0.09264834310455494, 0.05300670140142362, -0.027960366496524537, -0.13295888040125012, 0.34666350153092496, -0.05756672393216426, -0.24636869820350982, 0.1383307519065867, -0.12092529820749559, -0.11227656134785748, 0.13689909602728595, 0.16868074043059206, 0.17357976422701255, -0.007064711493271661, 0.19576341957232568, -0.21015962159418197, 0.07938205040093646, 0.07271848915212126, -0.050979780852345814, 0.16455755055130247, 0.12528696133339978, 0.14946681793487396, 0.15748987815774843, -0.029282765448968632, -0.05444993673408606, -0.359040070992771, -0.2080805811200695, -0.1262211300522448, 0.10221027811524228, -0.1695880193558889, -0.26250897211033897, 0.3714565900603242, -0.009039871540504047, 0.23242752142923784, 0.08992978340822709, 0.2552949696420187, 0.07764540641871562, -0.04124752652876259, 0.07696359202219104, 0.10866322572040091, 0.20402097129767918, 0.0007505536707768958, -0.18200446149132338, 0.03528815440003233, 0.21697250985910735] |
1,803.01069 | Charge-Parity violating effects in Casimir-Polder potentials | We demonstrate under which conditions a violation of the charge-parity (CP)
symmetry in molecules will manifest itself in the Casimir-Polder interaction of
these with a magnetodielectric surface. Charge-parity violation induces a
specific electric-magnetic cross-polarisability in a molecule that is not
chiral, but time-reversal (T) symmetry violating. As we show, a detection of
such an effect via the Casimir-Polder potential requires a material medium that
is also sensitive to time-reversal, i.e., it must exhibit a non-reciprocal
electromagnetic response. As simple examples of such media we consider a
perfectly reflecting non-reciprocal mirror that is a special case of a perfect
electromagnetic conductor as well as a Chern-Simons medium. In addition, we
show that Chern-Simons and related media can induce unusual atom-surface
interactions for anisotropic molecules with and without a chiral response.
| quant-ph | we demonstrate under which conditions a violation of the chargeparity cp symmetry in molecules will manifest itself in the casimirpolder interaction of these with a magnetodielectric surface chargeparity violation induces a specific electricmagnetic crosspolarisability in a molecule that is not chiral but timereversal t symmetry violating as we show a detection of such an effect via the casimirpolder potential requires a material medium that is also sensitive to timereversal ie it must exhibit a nonreciprocal electromagnetic response as simple examples of such media we consider a perfectly reflecting nonreciprocal mirror that is a special case of a perfect electromagnetic conductor as well as a chernsimons medium in addition we show that chernsimons and related media can induce unusual atomsurface interactions for anisotropic molecules with and without a chiral response | [['we', 'demonstrate', 'under', 'which', 'conditions', 'a', 'violation', 'of', 'the', 'chargeparity', 'cp', 'symmetry', 'in', 'molecules', 'will', 'manifest', 'itself', 'in', 'the', 'casimirpolder', 'interaction', 'of', 'these', 'with', 'a', 'magnetodielectric', 'surface', 'chargeparity', 'violation', 'induces', 'a', 'specific', 'electricmagnetic', 'crosspolarisability', 'in', 'a', 'molecule', 'that', 'is', 'not', 'chiral', 'but', 'timereversal', 't', 'symmetry', 'violating', 'as', 'we', 'show', 'a', 'detection', 'of', 'such', 'an', 'effect', 'via', 'the', 'casimirpolder', 'potential', 'requires', 'a', 'material', 'medium', 'that', 'is', 'also', 'sensitive', 'to', 'timereversal', 'ie', 'it', 'must', 'exhibit', 'a', 'nonreciprocal', 'electromagnetic', 'response', 'as', 'simple', 'examples', 'of', 'such', 'media', 'we', 'consider', 'a', 'perfectly', 'reflecting', 'nonreciprocal', 'mirror', 'that', 'is', 'a', 'special', 'case', 'of', 'a', 'perfect', 'electromagnetic', 'conductor', 'as', 'well', 'as', 'a', 'chernsimons', 'medium', 'in', 'addition', 'we', 'show', 'that', 'chernsimons', 'and', 'related', 'media', 'can', 'induce', 'unusual', 'atomsurface', 'interactions', 'for', 'anisotropic', 'molecules', 'with', 'and', 'without', 'a', 'chiral', 'response']] | [-0.22311154680028267, 0.21201841982576752, -0.06645289012021749, 0.03656229414627887, -0.12413865778762556, -0.17607474352553254, 0.020922326524669188, 0.3940257179492619, -0.21603290948769427, -0.2605978425126523, 0.027563005172851263, -0.2885193564743531, -0.23383218668641348, 0.12680753264794475, 0.002297176089086861, 0.01627757042297162, -0.04304417918319814, 0.04039397345513862, -0.08016520074124855, -0.12062755230726907, 0.2858581812179182, 0.002639234298840165, 0.26219066046905937, 0.1456102089300657, 0.09111067100820947, 0.019989612432254944, 0.09087850014111609, 0.052913581566826906, -0.04542760568551785, 0.0064954464105539955, 0.21651826634160898, -0.014688531573483488, 0.13937854924733983, -0.46989847264194395, -0.22748688642604975, 0.10525621895067161, 0.10417632797179976, 0.18939085357033036, -0.12684489423907053, -0.3143436649970681, 0.007621131089763367, -0.18263635986295412, -0.16397123161732452, -0.11903149407589808, 0.007622155018907506, -0.012454584837541915, -0.31249180913800956, 0.07941287912194639, 0.07136538649592694, 0.06884171010278806, -0.023518817955846316, -0.021968589200696442, -0.02316369668551488, 0.0553255356826412, 0.08131079005124775, -0.008209083283873042, 0.15831132929270098, -0.18699836340238107, -0.08899335792739294, 0.5006302993715508, -0.10705770739878062, -0.21220109918067465, 0.18379009727505036, -0.12727297834317142, -0.10687947671249276, 0.1028566214527018, 0.16006699090939946, 0.10508262160874438, -0.13718911676733114, 0.08200000528086093, -0.09740736799722072, 0.16655362904020876, 0.09440818180155475, 0.09557306182978209, 0.24610408594162436, 0.12282405142468633, 0.09346452289901208, 0.1817527699895436, -0.03125310715040541, 0.004636712452338543, -0.3704703402327141, -0.19837183800700586, -0.19598706031683832, 0.10572916803357657, -0.05346464871763601, -0.16427800695964834, 0.33791319621559524, 0.09355971393426898, 0.16094724408867478, -0.03662538409571425, 0.2596979332593037, 0.07902291081336443, 0.0955052935751155, 0.009662997457780875, 0.2852548639120869, 0.1363875418828684, 0.0955152161695878, -0.2863911608401395, 0.04191080081000109, -0.01176574620330939] |
1,803.0107 | A Lattice Model of Charge-Pattern-Dependent Polyampholyte Phase
Separation | In view of recent intense experimental and theoretical interests in the
biophysics of liquid-liquid phase separation (LLPS) of intrinsically disordered
proteins (IDPs), heteropolymer models with chain molecules configured as
self-avoiding walks on the simple cubic lattice are constructed to study how
phase behaviors depend on the sequence of monomers along the chains. To address
pertinent general principles, we focus primarily on two fully charged
50-monomer sequences with significantly different charge patterns. Each monomer
in our models occupies a single lattice site and all monomers interact via a
screened pairwise Coulomb potential. Phase diagrams are obtained by extensive
Monte Carlo sampling performed at multiple temperatures on ensembles of 300
chains in boxes of sizes ranging from $52\times 52\times 52$ to $246\times
246\times 246$ to simulate a large number of different systems with the overall
polymer volume fraction $\phi$ in each system varying from $0.001$ to $0.1$.
Phase separation in the model systems is characterized by the emergence of a
large cluster connected by inter-monomer nearest-neighbor lattice contacts and
by large fluctuations in local polymer density. The simulated critical
temperatures, $T_{\rm cr}$, of phase separation for the two sequences differ
significantly, whereby the sequence with a more "blocky" charge pattern
exhibits a substantially higher propensity to phase separate. The trend is
consistent with our sequence-specific random-phase-approximation (RPA) polymer
theory, but the variation of the simulated $T_{\rm cr}$ with a previously
proposed "sequence charge decoration" pattern parameter is milder than that
predicted by RPA. Ramifications of our findings for the development of
analytical theory and simulation protocols of IDP LLPS are discussed.
| q-bio.BM cond-mat.soft | in view of recent intense experimental and theoretical interests in the biophysics of liquidliquid phase separation llps of intrinsically disordered proteins idps heteropolymer models with chain molecules configured as selfavoiding walks on the simple cubic lattice are constructed to study how phase behaviors depend on the sequence of monomers along the chains to address pertinent general principles we focus primarily on two fully charged 50monomer sequences with significantly different charge patterns each monomer in our models occupies a single lattice site and all monomers interact via a screened pairwise coulomb potential phase diagrams are obtained by extensive monte carlo sampling performed at multiple temperatures on ensembles of 300 chains in boxes of sizes ranging from 52times 52times 52 to 246times 246times 246 to simulate a large number of different systems with the overall polymer volume fraction phi in each system varying from 0001 to 01 phase separation in the model systems is characterized by the emergence of a large cluster connected by intermonomer nearestneighbor lattice contacts and by large fluctuations in local polymer density the simulated critical temperatures t_rm cr of phase separation for the two sequences differ significantly whereby the sequence with a more blocky charge pattern exhibits a substantially higher propensity to phase separate the trend is consistent with our sequencespecific randomphaseapproximation rpa polymer theory but the variation of the simulated t_rm cr with a previously proposed sequence charge decoration pattern parameter is milder than that predicted by rpa ramifications of our findings for the development of analytical theory and simulation protocols of idp llps are discussed | [['in', 'view', 'of', 'recent', 'intense', 'experimental', 'and', 'theoretical', 'interests', 'in', 'the', 'biophysics', 'of', 'liquidliquid', 'phase', 'separation', 'llps', 'of', 'intrinsically', 'disordered', 'proteins', 'idps', 'heteropolymer', 'models', 'with', 'chain', 'molecules', 'configured', 'as', 'selfavoiding', 'walks', 'on', 'the', 'simple', 'cubic', 'lattice', 'are', 'constructed', 'to', 'study', 'how', 'phase', 'behaviors', 'depend', 'on', 'the', 'sequence', 'of', 'monomers', 'along', 'the', 'chains', 'to', 'address', 'pertinent', 'general', 'principles', 'we', 'focus', 'primarily', 'on', 'two', 'fully', 'charged', '50monomer', 'sequences', 'with', 'significantly', 'different', 'charge', 'patterns', 'each', 'monomer', 'in', 'our', 'models', 'occupies', 'a', 'single', 'lattice', 'site', 'and', 'all', 'monomers', 'interact', 'via', 'a', 'screened', 'pairwise', 'coulomb', 'potential', 'phase', 'diagrams', 'are', 'obtained', 'by', 'extensive', 'monte', 'carlo', 'sampling', 'performed', 'at', 'multiple', 'temperatures', 'on', 'ensembles', 'of', '300', 'chains', 'in', 'boxes', 'of', 'sizes', 'ranging', 'from', '52times', '52times', '52', 'to', '246times', '246times', '246', 'to', 'simulate', 'a', 'large', 'number', 'of', 'different', 'systems', 'with', 'the', 'overall', 'polymer', 'volume', 'fraction', 'phi', 'in', 'each', 'system', 'varying', 'from', '0001', 'to', '01', 'phase', 'separation', 'in', 'the', 'model', 'systems', 'is', 'characterized', 'by', 'the', 'emergence', 'of', 'a', 'large', 'cluster', 'connected', 'by', 'intermonomer', 'nearestneighbor', 'lattice', 'contacts', 'and', 'by', 'large', 'fluctuations', 'in', 'local', 'polymer', 'density', 'the', 'simulated', 'critical', 'temperatures', 't_rm', 'cr', 'of', 'phase', 'separation', 'for', 'the', 'two', 'sequences', 'differ', 'significantly', 'whereby', 'the', 'sequence', 'with', 'a', 'more', 'blocky', 'charge', 'pattern', 'exhibits', 'a', 'substantially', 'higher', 'propensity', 'to', 'phase', 'separate', 'the', 'trend', 'is', 'consistent', 'with', 'our', 'sequencespecific', 'randomphaseapproximation', 'rpa', 'polymer', 'theory', 'but', 'the', 'variation', 'of', 'the', 'simulated', 't_rm', 'cr', 'with', 'a', 'previously', 'proposed', 'sequence', 'charge', 'decoration', 'pattern', 'parameter', 'is', 'milder', 'than', 'that', 'predicted', 'by', 'rpa', 'ramifications', 'of', 'our', 'findings', 'for', 'the', 'development', 'of', 'analytical', 'theory', 'and', 'simulation', 'protocols', 'of', 'idp', 'llps', 'are', 'discussed']] | [-0.13140791370553712, 0.22662706152570267, -0.03140048955318107, 0.034631719462151184, 0.03413399066162375, -0.16571312290688528, 0.07968687297538998, 0.39653006040260136, -0.22515017291090575, -0.3041328800022747, 0.022234151515723458, -0.3112167902272772, -0.10619304073855368, 0.14258674987683853, 0.024527419392784782, 0.011673095895522527, 0.037859610494635924, -0.014727217460217228, -0.07550823397062675, -0.2092810703239353, 0.24704661010313317, 0.04678726324075183, 0.28593101347038563, 0.030891828204671196, 0.040331652752564166, 0.013591131616867501, 0.02018215147374097, 0.045105603640870184, -0.1566963292011784, 0.079386230249521, 0.20546435138749075, 0.012232957889737432, 0.2040598766621953, -0.44288575703047156, -0.2366532510870259, 0.08185933666419266, 0.15309021604796078, 0.13042891511419255, -0.05873129205976102, -0.27959456869451577, 0.07754561600325875, -0.15654608691715843, -0.10313763911474871, -0.027273978119311752, 0.01484167305102875, 0.08741411506202859, -0.23639736886117282, 0.1048142406908983, 0.0020412145175270793, 0.08821903621730964, -0.036920065792140286, -0.15972879164050832, -0.049038429358295464, 0.10304148088375381, 0.03192042621112494, 0.05830434660152929, 0.18722028072829566, -0.09029144964372882, -0.10514908420624096, 0.3771938230759327, -0.02544948959714316, -0.15093685249895464, 0.22895221058604157, -0.14857270814705814, -0.14700755947305597, 0.21309895426384173, 0.12968211708256033, 0.10402909333929564, -0.1520698202301048, 0.03257815831597144, 0.011569038179230176, 0.20840678819908234, 0.015692790565008746, 0.0004449083703089967, 0.2326386057385496, 0.18788155014698876, 0.00034912161293526204, 0.1465806413526275, -0.07318978626804441, -0.17897926644212747, -0.2047923840792189, -0.10180140567434476, -0.20654334138055483, 0.0010165172582131256, -0.13331031404745172, -0.1806392261493128, 0.36517602947593375, 0.13314954408247634, 0.20520833126563026, 0.06444343870150128, 0.227900115574544, 0.03482644399221943, 0.06190374343251708, -0.012204080751497847, 0.1833947428543655, 0.1286352249557268, 0.09417140111643027, -0.22714178095226062, 0.05823510249962944, 0.06706231793789409] |
1,803.01071 | High-Dynamic-Range Imaging for Cloud Segmentation | Sky/cloud images obtained from ground-based sky-cameras are usually captured
using a fish-eye lens with a wide field of view. However, the sky exhibits a
large dynamic range in terms of luminance, more than a conventional camera can
capture. It is thus difficult to capture the details of an entire scene with a
regular camera in a single shot. In most cases, the circumsolar region is
over-exposed, and the regions near the horizon are under-exposed. This renders
cloud segmentation for such images difficult. In this paper, we propose
HDRCloudSeg -- an effective method for cloud segmentation using
High-Dynamic-Range (HDR) imaging based on multi-exposure fusion. We describe
the HDR image generation process and release a new database to the community
for benchmarking. Our proposed approach is the first using HDR radiance maps
for cloud segmentation and achieves very good results.
| cs.CV | skycloud images obtained from groundbased skycameras are usually captured using a fisheye lens with a wide field of view however the sky exhibits a large dynamic range in terms of luminance more than a conventional camera can capture it is thus difficult to capture the details of an entire scene with a regular camera in a single shot in most cases the circumsolar region is overexposed and the regions near the horizon are underexposed this renders cloud segmentation for such images difficult in this paper we propose hdrcloudseg an effective method for cloud segmentation using highdynamicrange hdr imaging based on multiexposure fusion we describe the hdr image generation process and release a new database to the community for benchmarking our proposed approach is the first using hdr radiance maps for cloud segmentation and achieves very good results | [['skycloud', 'images', 'obtained', 'from', 'groundbased', 'skycameras', 'are', 'usually', 'captured', 'using', 'a', 'fisheye', 'lens', 'with', 'a', 'wide', 'field', 'of', 'view', 'however', 'the', 'sky', 'exhibits', 'a', 'large', 'dynamic', 'range', 'in', 'terms', 'of', 'luminance', 'more', 'than', 'a', 'conventional', 'camera', 'can', 'capture', 'it', 'is', 'thus', 'difficult', 'to', 'capture', 'the', 'details', 'of', 'an', 'entire', 'scene', 'with', 'a', 'regular', 'camera', 'in', 'a', 'single', 'shot', 'in', 'most', 'cases', 'the', 'circumsolar', 'region', 'is', 'overexposed', 'and', 'the', 'regions', 'near', 'the', 'horizon', 'are', 'underexposed', 'this', 'renders', 'cloud', 'segmentation', 'for', 'such', 'images', 'difficult', 'in', 'this', 'paper', 'we', 'propose', 'hdrcloudseg', 'an', 'effective', 'method', 'for', 'cloud', 'segmentation', 'using', 'highdynamicrange', 'hdr', 'imaging', 'based', 'on', 'multiexposure', 'fusion', 'we', 'describe', 'the', 'hdr', 'image', 'generation', 'process', 'and', 'release', 'a', 'new', 'database', 'to', 'the', 'community', 'for', 'benchmarking', 'our', 'proposed', 'approach', 'is', 'the', 'first', 'using', 'hdr', 'radiance', 'maps', 'for', 'cloud', 'segmentation', 'and', 'achieves', 'very', 'good', 'results']] | [-0.0411892267383842, -0.016662723857141962, -0.07748189008260077, 0.05017775882137088, -0.06499330165485541, -0.09665408797208565, -0.019680821308348743, 0.4378349619883078, -0.2221819933374516, -0.34030842794864263, 0.10756812060803726, -0.2642153549249525, -0.1434761549587603, 0.2512817908078432, -0.16971186712509262, 0.03980283083963311, 0.11719022431255628, 0.012670238992130314, -0.035689739130989266, -0.19794930159373003, 0.29130752383282893, 0.06947774695991366, 0.3071850474509928, 0.01828399667930272, 0.15305193239409062, 0.017528432545562585, -0.032178786469416486, 0.03295267361518873, -0.08347062027012861, 0.14019828111588678, 0.29500915148916346, 0.15848655707927214, 0.21844042338327402, -0.3722828892990947, -0.22045231205756188, 0.044429509434849024, 0.1535447595399563, 0.10358039558416715, -0.07827794025749123, -0.3340882340170167, 0.1107727430967821, -0.1528574795410451, -0.018165052639044544, -0.07649449351485128, -0.002012367848375881, -0.024027736227415313, -0.31423619796556457, 0.05244988114120335, -0.016875762813207178, 0.07676287231345971, -0.1017403918956579, -0.05475184350550451, 0.03985704469313431, 0.17415034988964045, -0.04959476016487719, 0.08946419881260091, 0.15034822781561633, -0.2417639167599932, -0.027699202692774295, 0.4271774366773941, -0.04105236276055048, -0.1525116688226936, 0.18968365643069976, -0.11496221291297978, -0.10559683721857491, 0.18767761102256675, 0.1650397788922958, 0.1946698916696564, -0.18123555106835232, 0.026944000531350158, -0.04223276175368853, 0.20313699071606, 0.06751134089340835, 0.006791386056553435, 0.22401302716936225, 0.23784146319246954, 0.0635009307056424, 0.1695163326907075, -0.27106864509448686, -0.05628973040557294, -0.2301765638920996, -0.11622831380098231, -0.18660929639978954, -0.032937522727513206, -0.08471935522813712, -0.15888395116673093, 0.3967098599955164, 0.2301126989742948, 0.20286876462675907, 0.046839409897586816, 0.3902045466212763, 0.04655428353300387, 0.12260236224090612, 0.039571402570301735, 0.20695740102479857, -0.0019543829822429902, 0.1708547608862217, -0.09609460894242619, 0.02992427463263825, 0.035789210821881336] |
1,803.01072 | Identification of significant $E0$ strength in the $2^+_2 \rightarrow
2^+_1$ transitions of $^{58, 60, 62}$Ni | The $E0$ transition strength in the $2^+_2 \rightarrow 2^+_1$ transitions of
$^{58,60,62}$Ni have been determined for the first time following a series of
measurements at the Australian National University (ANU) and the University of
Kentucky (UK). The CAESAR Compton-suppressed HPGe array and the Super-e
solenoid at ANU were used to measure the $\delta(E2/M1)$ mixing ratio and
internal conversion coefficient of each transition following inelastic proton
scattering. Level half-lives, $\delta(E2/M1)$ mixing ratios and $\gamma$-ray
branching ratios were measured at UK following inelastic neutron scattering.
The new spectroscopic information was used to determine the $E0$ strengths.
These are the first $2^+ \rightarrow 2^+$ $E0$ transition strengths measured in
nuclei with spherical ground states and the $E0$ component is found to be
unexpectedly large; in fact, these are amongst the largest $E0$ transition
strengths in medium and heavy nuclei reported to date.
| nucl-ex nucl-th | the e0 transition strength in the 2_2 rightarrow 2_1 transitions of 586062ni have been determined for the first time following a series of measurements at the australian national university anu and the university of kentucky uk the caesar comptonsuppressed hpge array and the supere solenoid at anu were used to measure the deltae2m1 mixing ratio and internal conversion coefficient of each transition following inelastic proton scattering level halflives deltae2m1 mixing ratios and gammaray branching ratios were measured at uk following inelastic neutron scattering the new spectroscopic information was used to determine the e0 strengths these are the first 2 rightarrow 2 e0 transition strengths measured in nuclei with spherical ground states and the e0 component is found to be unexpectedly large in fact these are amongst the largest e0 transition strengths in medium and heavy nuclei reported to date | [['the', 'e0', 'transition', 'strength', 'in', 'the', '2_2', 'rightarrow', '2_1', 'transitions', 'of', '586062ni', 'have', 'been', 'determined', 'for', 'the', 'first', 'time', 'following', 'a', 'series', 'of', 'measurements', 'at', 'the', 'australian', 'national', 'university', 'anu', 'and', 'the', 'university', 'of', 'kentucky', 'uk', 'the', 'caesar', 'comptonsuppressed', 'hpge', 'array', 'and', 'the', 'supere', 'solenoid', 'at', 'anu', 'were', 'used', 'to', 'measure', 'the', 'deltae2m1', 'mixing', 'ratio', 'and', 'internal', 'conversion', 'coefficient', 'of', 'each', 'transition', 'following', 'inelastic', 'proton', 'scattering', 'level', 'halflives', 'deltae2m1', 'mixing', 'ratios', 'and', 'gammaray', 'branching', 'ratios', 'were', 'measured', 'at', 'uk', 'following', 'inelastic', 'neutron', 'scattering', 'the', 'new', 'spectroscopic', 'information', 'was', 'used', 'to', 'determine', 'the', 'e0', 'strengths', 'these', 'are', 'the', 'first', '2', 'rightarrow', '2', 'e0', 'transition', 'strengths', 'measured', 'in', 'nuclei', 'with', 'spherical', 'ground', 'states', 'and', 'the', 'e0', 'component', 'is', 'found', 'to', 'be', 'unexpectedly', 'large', 'in', 'fact', 'these', 'are', 'amongst', 'the', 'largest', 'e0', 'transition', 'strengths', 'in', 'medium', 'and', 'heavy', 'nuclei', 'reported', 'to', 'date']] | [-0.08355290472240152, 0.220037268459176, -0.021253737000127632, 0.06831077394265406, 0.018484573528446534, -0.10081511032379543, 0.03418044641062065, 0.3825413775043907, -0.17908163599807908, -0.31075563517709576, 0.03137844720579408, -0.3667702882654137, 0.013167910781447535, 0.1460705201934885, 0.10365395438641793, 0.04312537448896802, 0.03444331372501674, 0.039196724667110376, -0.03554625143469484, -0.15367045716848224, 0.2816337234582062, 0.09505717322247585, 0.3103543964525064, 0.07350862140560316, 0.03543292370245413, -0.03287439921060232, 0.014609971383793486, -0.06930026258600669, -0.14412479115460344, 0.03601291743753892, 0.30818125520729356, 0.05996225054237853, 0.1473467569798231, -0.35116554508330644, -0.07851406616865898, 0.1195837614643905, 0.1077767417386726, 0.05991183017139082, 0.0013916922250279673, -0.3550918348737199, 0.05249974365449614, -0.1766732026995332, -0.1352729193969733, -0.03233740404248238, 0.07785238499442736, 0.059692636026173, -0.25727786010269216, 0.024425361821151993, -0.06469437092266701, 0.10039536347267804, -0.11322934118409951, -0.2468220444827306, -0.0012900516390800475, 0.16309835521711244, 0.037259736579532424, 0.04372647201439745, 0.1500367065926117, -0.07507824757722793, -0.07487590308128683, 0.3375350405358606, -0.06976134027009485, 0.005290918253336309, 0.14673873299249895, -0.2643675289772175, -0.20154410420606533, 0.19670769754728235, 0.17202735912848127, 0.07452022571082192, -0.13056308382915127, 0.06498918571354201, 0.02496850002143118, 0.1717244576283351, 0.11349521087896493, -0.01618612547129117, 0.15493011435286866, 0.14529076455057496, -0.032482428160599534, 0.0610094121079547, -0.1910595406691923, -0.01645080285810831, -0.27184617698054625, -0.1005528154541497, -0.1563461150723958, 0.07767660796331863, -0.010491336657260372, -0.07095707996351713, 0.3229226047587064, 0.04001591154891584, 0.20373983829868614, -0.012723025752024518, 0.2377566847467312, 0.11082406059787091, 0.061756955191527525, 0.031180666717355726, 0.34782219923411806, 0.20162985203442751, 0.12422879410010797, -0.263362002114041, 0.08047339506447315, 0.024784752140166583] |
1,803.01073 | Charge Mobility and Dynamics in Spin-crossover Nanoparticles studied by
Time-Resolved Microwave Conductivity | We use the electrode-less time-resolved microwave conductivity (TRMC)
technique to characterize spin-crossover (SCO) nanoparticles. We show that TRMC
is a simple and accurate mean for simultaneously as-sessing the magnetic state
of SCO compounds and charge transport information on the nanometre length
scale. In the low-spin state from liquid nitrogen temperature up to 360 K the
TRMC measurements present two well-defined regimes in the mobility and in the
half-life times, possessing similar transition tempera-tures TR near 225 K.
Below TR, an activation-less regime associated with short lifetimes of the
charge carri-ers points at the presence of shallow-trap states. Above TR, these
states are thermally released yielding a thermally activated hopping regime
where longer hops increases the mobility and, concomitantly, the barrier
energy. The activation energy could originate from intricate contributions such
as polaronic self-localizations, but also from dynamic disorder due to phonons
and/or thermal fluctuations of SCO moieties.
| cond-mat.mes-hall | we use the electrodeless timeresolved microwave conductivity trmc technique to characterize spincrossover sco nanoparticles we show that trmc is a simple and accurate mean for simultaneously assessing the magnetic state of sco compounds and charge transport information on the nanometre length scale in the lowspin state from liquid nitrogen temperature up to 360 k the trmc measurements present two welldefined regimes in the mobility and in the halflife times possessing similar transition temperatures tr near 225 k below tr an activationless regime associated with short lifetimes of the charge carriers points at the presence of shallowtrap states above tr these states are thermally released yielding a thermally activated hopping regime where longer hops increases the mobility and concomitantly the barrier energy the activation energy could originate from intricate contributions such as polaronic selflocalizations but also from dynamic disorder due to phonons andor thermal fluctuations of sco moieties | [['we', 'use', 'the', 'electrodeless', 'timeresolved', 'microwave', 'conductivity', 'trmc', 'technique', 'to', 'characterize', 'spincrossover', 'sco', 'nanoparticles', 'we', 'show', 'that', 'trmc', 'is', 'a', 'simple', 'and', 'accurate', 'mean', 'for', 'simultaneously', 'assessing', 'the', 'magnetic', 'state', 'of', 'sco', 'compounds', 'and', 'charge', 'transport', 'information', 'on', 'the', 'nanometre', 'length', 'scale', 'in', 'the', 'lowspin', 'state', 'from', 'liquid', 'nitrogen', 'temperature', 'up', 'to', '360', 'k', 'the', 'trmc', 'measurements', 'present', 'two', 'welldefined', 'regimes', 'in', 'the', 'mobility', 'and', 'in', 'the', 'halflife', 'times', 'possessing', 'similar', 'transition', 'temperatures', 'tr', 'near', '225', 'k', 'below', 'tr', 'an', 'activationless', 'regime', 'associated', 'with', 'short', 'lifetimes', 'of', 'the', 'charge', 'carriers', 'points', 'at', 'the', 'presence', 'of', 'shallowtrap', 'states', 'above', 'tr', 'these', 'states', 'are', 'thermally', 'released', 'yielding', 'a', 'thermally', 'activated', 'hopping', 'regime', 'where', 'longer', 'hops', 'increases', 'the', 'mobility', 'and', 'concomitantly', 'the', 'barrier', 'energy', 'the', 'activation', 'energy', 'could', 'originate', 'from', 'intricate', 'contributions', 'such', 'as', 'polaronic', 'selflocalizations', 'but', 'also', 'from', 'dynamic', 'disorder', 'due', 'to', 'phonons', 'andor', 'thermal', 'fluctuations', 'of', 'sco', 'moieties']] | [-0.12109470489428519, 0.28054118394137645, -0.006482666948401969, 0.03234741600526956, 0.03154251952846981, -0.14578315180771, 0.13580557408787258, 0.3802397461123254, -0.2778008334364181, -0.29385182242330216, 0.01832801109412685, -0.35736454737513035, -0.05608796082717711, 0.16495364550293792, 0.030576181406640028, -0.036594556156571395, -0.012650638033336105, 0.011330280486057347, -0.0416632527939988, -0.12618687115721278, 0.2199780446834454, 0.060662617230762356, 0.28104935526809566, 0.11351216626903744, 0.046029732045908905, -0.04852370138213115, 0.09499379591091396, -0.01339748882599277, -0.16794823129743708, 0.017704048732212707, 0.25334251554019444, -0.07885534263356295, 0.1719284926585802, -0.43344208909428283, -0.22907078784032509, 0.037118332647106116, 0.15443509511573061, 0.11186508837551491, -0.03486249712933723, -0.2664722692865674, 0.04299787982296811, -0.11967102415964952, -0.09794072363819059, -0.07326239386130098, 0.031831561122089624, -0.012361821552861342, -0.2470235381313689, 0.15594428359695922, 0.013056968954353505, 0.07988334487173196, -0.1231973754251631, -0.1327958648565085, -0.06449001432039252, 0.07955607730091536, 0.04592727898932636, 0.026091876423005526, 0.20263529154918578, -0.09701120935911504, -0.07308795464772105, 0.3084802999964928, -0.07730160138652699, -0.029024237865735204, 0.22088665167852115, -0.17150772098032838, -0.07308080991549092, 0.25301306118091493, 0.11616118159145117, 0.13734323572553217, -0.16671468894163224, 0.034666934913368766, 0.04737119481114237, 0.20085224366191876, 0.05290848799751536, 0.12087492430455064, 0.23527278098252233, 0.16328511632937454, 0.03417291541660383, 0.13266654521121632, -0.17852849757166464, -0.06794318946537702, -0.21537546334430985, -0.14263735042654907, -0.2040710881645855, 0.10655210961345328, -0.08741858453539277, -0.143253665155897, 0.3758362958220484, 0.14082343479553047, 0.18734422554134403, 0.0026012276142216863, 0.23258192379550677, 0.1166414104877295, 0.06648263600032955, 0.10322235428970562, 0.21698601300069068, 0.1482070511954913, 0.14436555105143495, -0.302954567154576, 0.07479450472451951, -0.004155462317500417] |
1,803.01074 | Computation of the Epsilon-Subdifferential of Convex Piecewise-Defined
Functions in Optimal Worst-Case Time | The $\epsilon$-subdifferential of convex univariate piecewise
linear-quadratic functions can be computed in linear worst-case time complexity
as the level-set of a convex function. Using dichotomic search, we show how the
computation can be performed in logarithmic worst-case time. Furthermore, a new
algorithm to compute the entire graph of the $\epsilon$-subdifferential in
linear time is presented. Both algorithms are not limited to convex PLQ
functions but are also applicable to any convex piecewise-defined function with
little restrictions.
| math.OC | the epsilonsubdifferential of convex univariate piecewise linearquadratic functions can be computed in linear worstcase time complexity as the levelset of a convex function using dichotomic search we show how the computation can be performed in logarithmic worstcase time furthermore a new algorithm to compute the entire graph of the epsilonsubdifferential in linear time is presented both algorithms are not limited to convex plq functions but are also applicable to any convex piecewisedefined function with little restrictions | [['the', 'epsilonsubdifferential', 'of', 'convex', 'univariate', 'piecewise', 'linearquadratic', 'functions', 'can', 'be', 'computed', 'in', 'linear', 'worstcase', 'time', 'complexity', 'as', 'the', 'levelset', 'of', 'a', 'convex', 'function', 'using', 'dichotomic', 'search', 'we', 'show', 'how', 'the', 'computation', 'can', 'be', 'performed', 'in', 'logarithmic', 'worstcase', 'time', 'furthermore', 'a', 'new', 'algorithm', 'to', 'compute', 'the', 'entire', 'graph', 'of', 'the', 'epsilonsubdifferential', 'in', 'linear', 'time', 'is', 'presented', 'both', 'algorithms', 'are', 'not', 'limited', 'to', 'convex', 'plq', 'functions', 'but', 'are', 'also', 'applicable', 'to', 'any', 'convex', 'piecewisedefined', 'function', 'with', 'little', 'restrictions']] | [-0.0744194155926571, 0.026975809222724485, -0.11170637093815267, 0.11639827507774737, -0.11760625493173536, -0.17619669774400168, 0.046124513066867, 0.416285838784748, -0.35308021049652444, -0.246499023596315, 0.1367867212623088, -0.20226803497950496, -0.1707606543051569, 0.23086299330277957, -0.11852347706773894, 0.18259962773146599, 0.008449858036137334, -0.0005687170686494363, -0.1428522944180785, -0.32866813281227797, 0.23909047239852188, -0.008869733318294349, 0.15199735618539548, 0.06966572669089625, 0.07768091481595643, 0.017789487635079575, -0.018415529170612756, 0.08406603186679269, -0.09469499051154248, 0.059636582399865516, 0.3375691686554714, 0.22565909981188415, 0.3159674324683453, -0.4386294829463096, -0.1571680065979691, 0.20138148242901815, 0.12746606732252985, 0.054918141539306624, -0.013760931887908986, -0.21015704680528297, 0.057815922467087055, -0.0897808607091735, -0.06913196562029618, -0.10395525147109047, -0.03259849719592909, 0.0873475820929008, -0.3116639306168317, 0.05541375707367766, 0.012119057698567448, 0.022103508137852737, -0.06396641431217033, -0.12009037928165574, -0.004235865585015793, 0.06140557346914552, 0.009209806831725138, 0.10768617923665595, 0.12372825585771352, -0.04841704855329896, -0.17395631744416037, 0.34444531763438135, -0.07209119385745573, -0.3199329601637529, 0.14257058540457174, -0.17717695965333596, -0.13408932711708507, 0.14182484018812447, 0.2511694744331946, 0.2044392901313442, -0.16774737209963955, 0.17965579688500025, -0.05866936515207941, 0.17970525174812219, 0.05024383485464281, 0.019915731170361762, 0.04353509181620259, 0.11404480205505695, 0.15228151696378758, 0.19872493053921253, 0.015848289648267, -0.12284427023443736, -0.32158109212392255, -0.11722832818907734, -0.25218421720752593, -0.03957056123315277, -0.15565009424953083, -0.20860491055799157, 0.38567948758013937, 0.043334316339735925, 0.17140131313843945, 0.21143121694484235, 0.30343708297923994, 0.19020415297066057, 0.07320081244382125, 0.12725637802903197, 0.18592253836227188, 0.054196663280507845, 0.02267785740428065, -0.20858383167299172, 0.12323393463463474, 0.09069585199100211] |
1,803.01075 | Functoriality of groupoid quantales. II | Taking advantage of the quantale-theoretic description of \'etale groupoids
we study principal bundles, Hilsum-Skandalis maps, and Morita equivalence in
terms of modules on inverse quantal frames. The Hilbert module description of
quantale sheaves leads naturally to a formulation of Morita equivalence in
terms of bimodules that resemble imprimitivity bimodules of C*-algebras.
| math.CT math.RA | taking advantage of the quantaletheoretic description of etale groupoids we study principal bundles hilsumskandalis maps and morita equivalence in terms of modules on inverse quantal frames the hilbert module description of quantale sheaves leads naturally to a formulation of morita equivalence in terms of bimodules that resemble imprimitivity bimodules of calgebras | [['taking', 'advantage', 'of', 'the', 'quantaletheoretic', 'description', 'of', 'etale', 'groupoids', 'we', 'study', 'principal', 'bundles', 'hilsumskandalis', 'maps', 'and', 'morita', 'equivalence', 'in', 'terms', 'of', 'modules', 'on', 'inverse', 'quantal', 'frames', 'the', 'hilbert', 'module', 'description', 'of', 'quantale', 'sheaves', 'leads', 'naturally', 'to', 'a', 'formulation', 'of', 'morita', 'equivalence', 'in', 'terms', 'of', 'bimodules', 'that', 'resemble', 'imprimitivity', 'bimodules', 'of', 'calgebras']] | [-0.18470305010676383, 0.0008900070691015571, -0.10382044350728392, 0.13498294912278652, -0.052649201340973374, -0.12818625728599728, -0.10682060896186157, 0.38409980236086994, -0.43884170772507786, -0.13330738618969917, 0.03154411586467177, -0.1967070099338889, -0.11826469548977911, 0.1612930705398321, -0.28150997042655945, -0.08289977010339498, 0.16587864710949363, 0.06383608972653747, -0.15115189692471176, -0.20531151382485405, 0.5172862536460161, 0.07073031677864491, 0.3015088354051113, 0.01897955119609833, 0.17028468392789364, 0.04896046446636319, -0.07293753085657954, -0.02279319230467081, -0.07136858985366416, 0.18071908626705407, 0.43610652908682823, 0.03551160425879061, 0.18879368459805845, -0.38971701040863993, -0.021192114679142834, 0.17880872957408428, 0.09662818737328052, -0.06230648450553417, 0.07692052624886855, -0.3650468719378114, 0.014922030810266733, -0.2822180714458227, -0.0011251752823591232, -0.15296503991819918, 0.10565410921350121, -0.013844082527793945, -0.20358755357563496, -0.03430863368441351, 0.17961151648312806, 0.21377861712127924, -0.23188086403533817, 0.019064071904867887, -0.053589545208960775, 0.0537693078815937, -0.033126952908933166, -0.09396282537374645, 0.21111978134140372, -0.06996963394805789, -0.19708323571830988, 0.38996247012168167, -0.05721641565789468, -0.17561767149716614, 0.1288075617700815, -0.1414189965929836, -0.13588102051988243, 0.15024356935173272, -0.016180719919502734, 0.13270562386140228, 0.008063729982823134, 0.21172236196580344, -0.18969356335699558, -0.012583615444600581, 0.09096049370244146, 0.0961427138093859, 0.10097766382619738, 0.08450341656804085, 0.011346030980348587, 0.12623284563422202, 0.10801172730047255, -0.09518868200480939, -0.41854323133826254, -0.26843489732593295, 0.025492831603623926, 0.17719982989132405, -0.11114381692343159, -0.20536457863170654, 0.45382367523387074, 0.1416545860283077, 0.1950267394632101, 0.20154615093022585, 0.1913941277563572, 0.005421945685520768, 0.1317032891139388, -0.05951444676145911, 0.1550232542678714, 0.4346059736981988, -0.08168692496605218, -0.07502244092524052, -0.11865844971500338, 0.40940214418107645] |
1,803.01076 | Low-Complexity Concatenated LDPC-Staircase Codes | A low-complexity soft-decision concatenated FEC scheme, consisting of an
inner LDPC code and an outer staircase code is proposed. The inner code is
tasked with reducing the bit error probability below the outer-code threshold.
The concatenated code is obtained by optimizing the degree distribution of the
inner-code ensemble to minimize estimated data-flow, for various choices of
outer staircase codes. A key feature that emerges from this optimization is
that it pays to leave some inner codeword bits completely uncoded, thereby
greatly reducing a significant portion of the decoding complexity. The
trade-off between required SNR and decoding complexity of the designed codes is
characterized by a Pareto frontier. Computer simulations of the resulting codes
reveals that the net coding-gains of existing designs can be achieved with up
to 71\% reduction in complexity. A hardware-friendly quasi-cyclic construction
is given for the inner codes, which can realize an energy-efficient decoder
implementation, and even further complexity reductions via a layered
message-passing decoder schedule.
| cs.IT math.IT | a lowcomplexity softdecision concatenated fec scheme consisting of an inner ldpc code and an outer staircase code is proposed the inner code is tasked with reducing the bit error probability below the outercode threshold the concatenated code is obtained by optimizing the degree distribution of the innercode ensemble to minimize estimated dataflow for various choices of outer staircase codes a key feature that emerges from this optimization is that it pays to leave some inner codeword bits completely uncoded thereby greatly reducing a significant portion of the decoding complexity the tradeoff between required snr and decoding complexity of the designed codes is characterized by a pareto frontier computer simulations of the resulting codes reveals that the net codinggains of existing designs can be achieved with up to 71 reduction in complexity a hardwarefriendly quasicyclic construction is given for the inner codes which can realize an energyefficient decoder implementation and even further complexity reductions via a layered messagepassing decoder schedule | [['a', 'lowcomplexity', 'softdecision', 'concatenated', 'fec', 'scheme', 'consisting', 'of', 'an', 'inner', 'ldpc', 'code', 'and', 'an', 'outer', 'staircase', 'code', 'is', 'proposed', 'the', 'inner', 'code', 'is', 'tasked', 'with', 'reducing', 'the', 'bit', 'error', 'probability', 'below', 'the', 'outercode', 'threshold', 'the', 'concatenated', 'code', 'is', 'obtained', 'by', 'optimizing', 'the', 'degree', 'distribution', 'of', 'the', 'innercode', 'ensemble', 'to', 'minimize', 'estimated', 'dataflow', 'for', 'various', 'choices', 'of', 'outer', 'staircase', 'codes', 'a', 'key', 'feature', 'that', 'emerges', 'from', 'this', 'optimization', 'is', 'that', 'it', 'pays', 'to', 'leave', 'some', 'inner', 'codeword', 'bits', 'completely', 'uncoded', 'thereby', 'greatly', 'reducing', 'a', 'significant', 'portion', 'of', 'the', 'decoding', 'complexity', 'the', 'tradeoff', 'between', 'required', 'snr', 'and', 'decoding', 'complexity', 'of', 'the', 'designed', 'codes', 'is', 'characterized', 'by', 'a', 'pareto', 'frontier', 'computer', 'simulations', 'of', 'the', 'resulting', 'codes', 'reveals', 'that', 'the', 'net', 'codinggains', 'of', 'existing', 'designs', 'can', 'be', 'achieved', 'with', 'up', 'to', '71', 'reduction', 'in', 'complexity', 'a', 'hardwarefriendly', 'quasicyclic', 'construction', 'is', 'given', 'for', 'the', 'inner', 'codes', 'which', 'can', 'realize', 'an', 'energyefficient', 'decoder', 'implementation', 'and', 'even', 'further', 'complexity', 'reductions', 'via', 'a', 'layered', 'messagepassing', 'decoder', 'schedule']] | [-0.19167807621982855, 0.055480458534405516, -0.05617516316497364, 0.04710356995593219, -0.01999303025121872, -0.2544981809034466, 0.1010106185089964, 0.3861980205640579, -0.327894562897153, -0.31240749074361074, 0.08838280933634497, -0.20204326284165758, -0.15392490287717336, 0.193557645030057, -0.13614708330267325, 0.11270159063562273, 0.07695478533740896, -0.0027718788418823327, -0.16754398040491372, -0.34142487042416364, 0.24073453088893962, 0.25676926772575825, 0.27247678692070526, -0.03922351201375326, 0.09476524638459803, -0.030095783435405254, 0.008517950665778838, -0.06120896982909658, -0.11227503622122197, 0.10494031745027034, 0.3118988609430977, 0.21906543018606803, 0.24983697035946908, -0.37212966514440876, -0.21671053126752107, 0.04005351266823709, 0.17023602879803199, 0.13863213983056946, -0.06090569704657611, -0.2078874005506245, 0.14608344465840417, -0.21588917425320595, 0.01170228216319512, 0.029324612605798907, -0.05649152743773392, -0.003622791344801394, -0.3035681389857275, -0.048112549490328185, 0.07207312188947047, 0.03692300797690852, 0.0026798800666792653, -0.1519346032739402, 0.014730774972868415, 0.12146505786670157, -0.02843626029192446, 0.08056518802037224, 0.09512330919134025, -0.07678550901936176, -0.12365723414442097, 0.33557039907034963, 0.032515510028669946, -0.19645574652792838, 0.10436704292750129, -0.021256161513380133, -0.04705698764882982, 0.24443622150470334, 0.20350997513816813, 0.038832044730392784, -0.10045853013901088, 0.06853382808931667, -0.028929379807474714, 0.2509929915555777, 0.09860062708433431, 0.08612445500703195, 0.1787048960597111, 0.15506122656202373, 0.08493947061950353, 0.2392359385498238, -0.105893913238572, -0.11084220995410131, -0.25674059752446526, -0.13589744981343244, -0.19413972638833982, -0.027931645093933463, -0.14843375168605305, -0.15000225441196027, 0.3726252302198284, 0.09985252601118424, 0.13189875935681927, 0.14243657418410294, 0.3406614733991237, 0.052801708954995356, 0.12757047058608478, 0.2317991598198811, 0.14433418353814303, 0.12447653198913218, -0.010283498794962771, -0.25917580438694227, 0.12458955789975917, 0.07507656966201746] |
1,803.01077 | Optimization of a Two-Hop Network with Energy Conferencing Relays | This paper considers a two-hop network consisting of a source, two parallel
half-duplex relay nodes, and two destinations. While the destinations have an
adequate power supply, the source and relay nodes rely on harvested energy for
data transmission. Different from all existing works, the two relay nodes can
also transfer their harvested energy to each other. For such a system, an
optimization problem is formulated with the objective of maximizing the total
data rate and conserving the source and relays transmission energy, where any
extra energy saved in the current transmission cycle can be used in the next
cycle. It turns out that the optimal solutions for this problem can be either
found in a closed form or through one-dimensional searches, depending on the
scenario. Simulation results based on both the average data rate and the outage
probability show that energy cooperation between the two relays consistently
improves the system performance.
| eess.SP | this paper considers a twohop network consisting of a source two parallel halfduplex relay nodes and two destinations while the destinations have an adequate power supply the source and relay nodes rely on harvested energy for data transmission different from all existing works the two relay nodes can also transfer their harvested energy to each other for such a system an optimization problem is formulated with the objective of maximizing the total data rate and conserving the source and relays transmission energy where any extra energy saved in the current transmission cycle can be used in the next cycle it turns out that the optimal solutions for this problem can be either found in a closed form or through onedimensional searches depending on the scenario simulation results based on both the average data rate and the outage probability show that energy cooperation between the two relays consistently improves the system performance | [['this', 'paper', 'considers', 'a', 'twohop', 'network', 'consisting', 'of', 'a', 'source', 'two', 'parallel', 'halfduplex', 'relay', 'nodes', 'and', 'two', 'destinations', 'while', 'the', 'destinations', 'have', 'an', 'adequate', 'power', 'supply', 'the', 'source', 'and', 'relay', 'nodes', 'rely', 'on', 'harvested', 'energy', 'for', 'data', 'transmission', 'different', 'from', 'all', 'existing', 'works', 'the', 'two', 'relay', 'nodes', 'can', 'also', 'transfer', 'their', 'harvested', 'energy', 'to', 'each', 'other', 'for', 'such', 'a', 'system', 'an', 'optimization', 'problem', 'is', 'formulated', 'with', 'the', 'objective', 'of', 'maximizing', 'the', 'total', 'data', 'rate', 'and', 'conserving', 'the', 'source', 'and', 'relays', 'transmission', 'energy', 'where', 'any', 'extra', 'energy', 'saved', 'in', 'the', 'current', 'transmission', 'cycle', 'can', 'be', 'used', 'in', 'the', 'next', 'cycle', 'it', 'turns', 'out', 'that', 'the', 'optimal', 'solutions', 'for', 'this', 'problem', 'can', 'be', 'either', 'found', 'in', 'a', 'closed', 'form', 'or', 'through', 'onedimensional', 'searches', 'depending', 'on', 'the', 'scenario', 'simulation', 'results', 'based', 'on', 'both', 'the', 'average', 'data', 'rate', 'and', 'the', 'outage', 'probability', 'show', 'that', 'energy', 'cooperation', 'between', 'the', 'two', 'relays', 'consistently', 'improves', 'the', 'system', 'performance']] | [-0.24015333373500466, 0.028049562784992713, -0.01172411601238002, 0.027948621886362945, -0.05663865733743701, -0.22982537558931387, 0.13296251275980636, 0.3804782565609114, -0.2934660050549254, -0.3018275536473421, 0.09298501818191063, -0.3070969225912793, -0.09060122164749596, 0.16082857949936774, -0.04945145552632529, 0.026895099509945324, 0.09753801884586054, 0.10969805856549877, 0.017977834361549837, -0.27373989775857044, 0.31136035656137084, 0.13934401328681617, 0.3520168089955453, 0.05813684599591259, 0.09165447133913981, 0.015566709653369539, -0.0006696141559309912, -0.022081531196468763, -0.08152611171319812, 0.06284167906053562, 0.3095560281333939, 0.1832575327161675, 0.2492615906460001, -0.4568860814999172, -0.267078066664125, 0.14736498314085483, 0.17221147731094566, 0.05923386032705424, -0.013711744619514916, -0.215065649087658, 0.07840908982710826, -0.20888825325258323, 0.006652871794406547, 0.054856059215469474, -0.09259214178837885, 0.09642574966026297, -0.3104443084201868, 0.013286357478582492, -0.0194399631674716, -0.00023566004480944563, -0.10670609155435436, -0.11738362258750427, -0.052451458330950794, 0.17667967971839899, 0.04550656386873136, -0.010825264804213253, 0.09761502276196311, -0.09388896387489822, -0.13300093643626335, 0.3431462066507103, -0.015026476261952262, -0.24325612611414876, 0.15133581775555152, -0.0476398513658552, -0.0907581497649878, 0.1463578207039009, 0.21410260556130023, 0.09273451696217849, -0.2169993892127019, 0.017966739220825326, -0.00630737172550713, 0.17578646296381623, 0.07477119131420819, 0.052744431310142115, 0.1878862401118983, 0.16572082727231605, 0.1502042330126124, 0.12577618578401092, -0.12695170322507127, -0.10248079436788002, -0.25500905206612007, -0.13150526041670746, -0.2307947733669252, 0.04646171111342133, -0.1107184496758905, -0.04402500186855627, 0.3968540148929822, 0.11216425412336044, 0.15856007872833963, 0.08520101338921003, 0.3888091213310396, 0.14352845262415362, 0.03245530697202544, 0.1815810070700006, 0.22558169128582967, 0.02452608794806562, 0.11181310329598602, -0.22616788053064799, 0.06925720213419012, -0.017967249914411676] |
1,803.01078 | Learning in Wireless Control Systems over Non-Stationary Channels | This paper considers a set of multiple independent control systems that are
each connected over a non-stationary wireless channel. The goal is to maximize
control performance over all the systems through the allocation of transmitting
power within a fixed budget. This can be formulated as a constrained
optimization problem examined using Lagrangian duality. By taking samples of
the unknown wireless channel at every time instance, the resulting problem
takes on the form of empirical risk minimization, a well-studied problem in
machine learning. Due to the non-stationarity of wireless channels, optimal
allocations must be continuously learned and updated as the channel evolves.
The quadratic convergence property of Newton's method motivates its use in
learning approximately optimal power allocation policies over the sampled dual
function as the channel evolves over time. Conditions are established under
which Newton's method learns approximate solutions with a single update, and
the subsequent sub-optimality of the control problem is further characterized.
Numerical simulations illustrate the near-optimal performance of the method and
resulting stability on a wireless control problem.
| math.OC | this paper considers a set of multiple independent control systems that are each connected over a nonstationary wireless channel the goal is to maximize control performance over all the systems through the allocation of transmitting power within a fixed budget this can be formulated as a constrained optimization problem examined using lagrangian duality by taking samples of the unknown wireless channel at every time instance the resulting problem takes on the form of empirical risk minimization a wellstudied problem in machine learning due to the nonstationarity of wireless channels optimal allocations must be continuously learned and updated as the channel evolves the quadratic convergence property of newtons method motivates its use in learning approximately optimal power allocation policies over the sampled dual function as the channel evolves over time conditions are established under which newtons method learns approximate solutions with a single update and the subsequent suboptimality of the control problem is further characterized numerical simulations illustrate the nearoptimal performance of the method and resulting stability on a wireless control problem | [['this', 'paper', 'considers', 'a', 'set', 'of', 'multiple', 'independent', 'control', 'systems', 'that', 'are', 'each', 'connected', 'over', 'a', 'nonstationary', 'wireless', 'channel', 'the', 'goal', 'is', 'to', 'maximize', 'control', 'performance', 'over', 'all', 'the', 'systems', 'through', 'the', 'allocation', 'of', 'transmitting', 'power', 'within', 'a', 'fixed', 'budget', 'this', 'can', 'be', 'formulated', 'as', 'a', 'constrained', 'optimization', 'problem', 'examined', 'using', 'lagrangian', 'duality', 'by', 'taking', 'samples', 'of', 'the', 'unknown', 'wireless', 'channel', 'at', 'every', 'time', 'instance', 'the', 'resulting', 'problem', 'takes', 'on', 'the', 'form', 'of', 'empirical', 'risk', 'minimization', 'a', 'wellstudied', 'problem', 'in', 'machine', 'learning', 'due', 'to', 'the', 'nonstationarity', 'of', 'wireless', 'channels', 'optimal', 'allocations', 'must', 'be', 'continuously', 'learned', 'and', 'updated', 'as', 'the', 'channel', 'evolves', 'the', 'quadratic', 'convergence', 'property', 'of', 'newtons', 'method', 'motivates', 'its', 'use', 'in', 'learning', 'approximately', 'optimal', 'power', 'allocation', 'policies', 'over', 'the', 'sampled', 'dual', 'function', 'as', 'the', 'channel', 'evolves', 'over', 'time', 'conditions', 'are', 'established', 'under', 'which', 'newtons', 'method', 'learns', 'approximate', 'solutions', 'with', 'a', 'single', 'update', 'and', 'the', 'subsequent', 'suboptimality', 'of', 'the', 'control', 'problem', 'is', 'further', 'characterized', 'numerical', 'simulations', 'illustrate', 'the', 'nearoptimal', 'performance', 'of', 'the', 'method', 'and', 'resulting', 'stability', 'on', 'a', 'wireless', 'control', 'problem']] | [-0.1733434080280369, 0.019623817129834006, -0.07636419874861052, 0.010694551932467529, -0.0735033889510805, -0.1801437376045257, 0.09240172952563333, 0.38086010933968056, -0.36253274684194586, -0.2782494045674191, 0.13112528509683688, -0.21837826252081677, -0.1392084849421044, 0.18945801855005018, -0.11692174099391185, 0.12568142877214952, 0.05772175181967517, 0.04728636243625691, -0.0588126680718419, -0.28365612058214057, 0.2697937264439394, 0.07582230137780918, 0.3112039458924327, -0.012655726823906758, 0.14972281147186695, 0.03803396070844423, -0.014718296915859158, 0.01787291829540988, -0.09389230108715911, 0.094914746674306, 0.30583484665686755, 0.18541879778381876, 0.3832057396396559, -0.38816938159510095, -0.24067215551213736, 0.13478517388565497, 0.1581076593968843, 0.039174292167806615, -0.02947905218658958, -0.2418391590622085, 0.10306531952745798, -0.1755302120708147, -0.041904661265250887, -0.02229034816247155, -0.0702086983504569, 0.037641152002227805, -0.3624950753203566, 0.033425928088046654, -0.003506201945724543, 0.0012363962426084525, -0.1279698291593313, -0.080771235362436, 0.025470952409433954, 0.150515680425332, 0.056025190405514944, 0.01142768353245586, 0.1402316599630217, -0.10243488237675694, -0.13673096054712888, 0.38411947161950477, -0.014300412830640699, -0.2349883003367318, 0.11392744309105501, -0.02787907446914336, -0.08478639537484892, 0.1527719227542654, 0.2599757150501797, 0.13347276544459818, -0.18480439109139538, 0.08971534413387672, -0.06046967910417513, 0.14801095064310085, 0.042707809907444126, 0.034010495448604836, 0.16172776223917368, 0.20914774597486296, 0.15738791106159836, 0.16931729563185127, -0.04347923678776238, -0.1492288910337228, -0.26780938856305053, -0.08223194178133898, -0.21762310243306998, 0.03083825172592303, -0.11860596128490587, -0.1016394183644208, 0.40441062707012815, 0.11498502091292226, 0.16048821193310406, 0.13483587035171318, 0.3435790401431378, 0.14471147521761482, 0.02699495475447862, 0.1258687373844373, 0.19160252111849554, 0.09556998317340955, 0.11618414110836317, -0.2529045729189893, 0.10481287997586337, 0.025666942087421468] |
1,803.01079 | Universal stabilization of single-qubit states using a tunable coupler | We theoretically analyze a scheme for fast stabilization of arbitrary qubit
states with high fidelities, extending a protocol recently demonstrated
experimentally [Lu et al., Phys. Rev. Lett. 119, 150502 (2017)]. That
experiment utilized red and blue sideband transitions in a system composed of a
fluxonium qubit, a low-Q LC-oscillator, and a coupler enabling us to tune the
interaction between them. Under parametric modulations of the coupling
strength, the qubit can be steered into any desired pure or mixed single-qubit
state. For realistic circuit parameters, we predict that stabilization can be
achieved within 100 ns. By varying the ratio between the oscillator's damping
rate and the effective qubit-oscillator coupling strength, we can switch
between under-damped, critically-damped, and over-damped stabilization and find
optimal working points. We further analyze the effect of thermal fluctuations
and show that the stabilization scheme remains robust for realistic
temperatures.
| quant-ph | we theoretically analyze a scheme for fast stabilization of arbitrary qubit states with high fidelities extending a protocol recently demonstrated experimentally lu et al phys rev lett 119 150502 2017 that experiment utilized red and blue sideband transitions in a system composed of a fluxonium qubit a lowq lcoscillator and a coupler enabling us to tune the interaction between them under parametric modulations of the coupling strength the qubit can be steered into any desired pure or mixed singlequbit state for realistic circuit parameters we predict that stabilization can be achieved within 100 ns by varying the ratio between the oscillators damping rate and the effective qubitoscillator coupling strength we can switch between underdamped criticallydamped and overdamped stabilization and find optimal working points we further analyze the effect of thermal fluctuations and show that the stabilization scheme remains robust for realistic temperatures | [['we', 'theoretically', 'analyze', 'a', 'scheme', 'for', 'fast', 'stabilization', 'of', 'arbitrary', 'qubit', 'states', 'with', 'high', 'fidelities', 'extending', 'a', 'protocol', 'recently', 'demonstrated', 'experimentally', 'lu', 'et', 'al', 'phys', 'rev', 'lett', '119', '150502', '2017', 'that', 'experiment', 'utilized', 'red', 'and', 'blue', 'sideband', 'transitions', 'in', 'a', 'system', 'composed', 'of', 'a', 'fluxonium', 'qubit', 'a', 'lowq', 'lcoscillator', 'and', 'a', 'coupler', 'enabling', 'us', 'to', 'tune', 'the', 'interaction', 'between', 'them', 'under', 'parametric', 'modulations', 'of', 'the', 'coupling', 'strength', 'the', 'qubit', 'can', 'be', 'steered', 'into', 'any', 'desired', 'pure', 'or', 'mixed', 'singlequbit', 'state', 'for', 'realistic', 'circuit', 'parameters', 'we', 'predict', 'that', 'stabilization', 'can', 'be', 'achieved', 'within', '100', 'ns', 'by', 'varying', 'the', 'ratio', 'between', 'the', 'oscillators', 'damping', 'rate', 'and', 'the', 'effective', 'qubitoscillator', 'coupling', 'strength', 'we', 'can', 'switch', 'between', 'underdamped', 'criticallydamped', 'and', 'overdamped', 'stabilization', 'and', 'find', 'optimal', 'working', 'points', 'we', 'further', 'analyze', 'the', 'effect', 'of', 'thermal', 'fluctuations', 'and', 'show', 'that', 'the', 'stabilization', 'scheme', 'remains', 'robust', 'for', 'realistic', 'temperatures']] | [-0.17342740813838253, 0.20576733816415071, -0.029184925535046462, -0.028683186310561413, -0.013483779267110724, -0.2300896075560797, 0.1319407787742027, 0.41140806740348007, -0.1984137817226509, -0.32454345473055296, -0.000745917494154489, -0.18882592410635177, -0.13166213705508262, 0.2285245387709257, -0.05273650118797119, 0.055483140520328746, 0.04723570303180658, -0.07370127449579973, -0.05578510894304709, -0.20732712626113747, 0.19328029841970626, 0.055723782577584924, 0.3223558737902988, 0.026022955951535188, 0.13093147551680498, -0.013346164165818502, 0.1058228775323864, -0.020095242563872896, -0.13406890011734143, 0.028853081559336326, 0.2224565419894379, 0.021198887695023354, 0.24342231341168707, -0.4196445803349534, -0.20439813047621055, 0.10508226584444971, 0.11808998756612657, 0.19437487093824232, -0.012447985493518571, -0.3338209399623228, 0.037672187486524754, -0.20138205585221872, -0.10386309890301092, -0.13461887692268493, 0.06100544310340011, 0.005619595347447915, -0.3568033597214108, 0.08213944825181137, 0.03549746045759584, 0.016982361278001297, -0.01349665616566302, -0.028941466020591926, -0.020755558003876226, 0.077252433744279, -0.09626572239642026, 0.01055902384257882, 0.1646464543139681, -0.04727158396701322, -0.11736704534950092, 0.2875976963294835, -0.10323744421620054, -0.15844576720623893, 0.17676902310724588, -0.07839280927507537, -0.050097601881237526, 0.09864711231083101, 0.15298892064218192, 0.0985331903509003, -0.12442002842427356, 0.043554862628439904, 0.036056609817694686, 0.2424452340755453, 0.10504096411647447, 0.08483558396828618, 0.17732032326030286, 0.15279387161862237, 0.04284814510045322, 0.177019773964714, -0.09878874090372201, -0.11415455056600445, -0.2588870029001503, -0.1206261673975234, -0.16651006198260299, 0.07433906867968064, -0.0522336595807743, -0.0685990105964349, 0.42412118194144877, 0.15447906186104032, 0.19862448073203628, -0.022734591785895947, 0.28359482144765186, 0.1373268851931108, 0.0013843367589598007, 0.09219423743916001, 0.3304567969476817, 0.18474084708397112, 0.05466989239889151, -0.33952957344181994, 0.02218395721576844, -0.013352647628503066] |
1,803.0108 | Supertrace formulae for nonlinearly realized supersymmetry | We derive the general supertrace formula for a system with $N$ chiral
superfields and one nilpotent chiral superfield in global and local
supersymmetry. The nilpotent multiplet is realized by taking the
scalar-decoupling limit of a chiral superfield breaking supersymmetry
spontaneously. As we show, however, the modified formula is not simply related
to the scalar-decoupling limit of the supertrace in linearly-realized
supersymmetry. We also show that the supertrace formula reduces to that of a
linearly realized supersymmetric theory with a decoupled sGoldstino if the
Goldstino is the fermion in the nilpotent multiplet.
| hep-th | we derive the general supertrace formula for a system with n chiral superfields and one nilpotent chiral superfield in global and local supersymmetry the nilpotent multiplet is realized by taking the scalardecoupling limit of a chiral superfield breaking supersymmetry spontaneously as we show however the modified formula is not simply related to the scalardecoupling limit of the supertrace in linearlyrealized supersymmetry we also show that the supertrace formula reduces to that of a linearly realized supersymmetric theory with a decoupled sgoldstino if the goldstino is the fermion in the nilpotent multiplet | [['we', 'derive', 'the', 'general', 'supertrace', 'formula', 'for', 'a', 'system', 'with', 'n', 'chiral', 'superfields', 'and', 'one', 'nilpotent', 'chiral', 'superfield', 'in', 'global', 'and', 'local', 'supersymmetry', 'the', 'nilpotent', 'multiplet', 'is', 'realized', 'by', 'taking', 'the', 'scalardecoupling', 'limit', 'of', 'a', 'chiral', 'superfield', 'breaking', 'supersymmetry', 'spontaneously', 'as', 'we', 'show', 'however', 'the', 'modified', 'formula', 'is', 'not', 'simply', 'related', 'to', 'the', 'scalardecoupling', 'limit', 'of', 'the', 'supertrace', 'in', 'linearlyrealized', 'supersymmetry', 'we', 'also', 'show', 'that', 'the', 'supertrace', 'formula', 'reduces', 'to', 'that', 'of', 'a', 'linearly', 'realized', 'supersymmetric', 'theory', 'with', 'a', 'decoupled', 'sgoldstino', 'if', 'the', 'goldstino', 'is', 'the', 'fermion', 'in', 'the', 'nilpotent', 'multiplet']] | [-0.16225182922789827, 0.23326507014942102, -0.04321458398904228, 0.08629307694685519, -0.13198912105078556, -0.17804961985993115, -0.027192999070393853, 0.29755466302793304, -0.19921518070358699, -0.22402854505079714, 0.08786636826830958, -0.2259895775403658, -0.16673737174079922, 0.059405544023981995, -0.05218857635786249, -0.012072604213079268, -0.03728755810813957, 0.11167866441114298, -0.10201671482487158, -0.2457853967154568, 0.31753067804013635, -0.075389928300865, 0.22144149963622278, 0.07532529887471769, 0.15799262738701972, 0.02371709811003794, 0.06873136047083377, -0.08355788431469012, -0.05352408188710714, 0.10988407988439906, 0.2029327152466232, 0.05298305564263666, 0.0792738363802941, -0.4224280139050362, -0.15145923400467093, 0.14377316867467016, 0.22483693721534853, 0.16611484351398592, -0.02405675809925676, -0.28502387847666716, 0.09681272444802082, -0.22347866019911386, -0.20979083277052268, -0.11517781777497889, -0.010606803380968895, -0.17876010805775877, -0.3006695682098242, 0.07831231669479166, 0.04727176092141731, 0.048829898132349954, -0.04612783272750676, -0.07300960068939523, -0.18043727627214554, -0.013758032643553715, 0.14670011291375637, -0.019378270096653563, 0.15125912651207976, -0.18488061972047118, -0.12561331852339208, 0.4100372928448699, -0.14030908405600878, -0.23424713766805574, 0.06575283274601547, -0.1251570320190777, -0.2374933123884892, 0.09459807933705054, 0.034724129570267076, 0.19784586401444607, -0.14253780580210415, 0.264457145291751, -0.10995104507839476, 0.11656067365468269, 0.041825164374048734, 0.012660269999204584, 0.22632279683073814, 0.12452842971437018, 0.10783657804131508, 0.10624541079794819, 0.05453167097386375, -0.06486664564264091, -0.4517379538579421, -0.16769283092369072, -0.16189558298686857, 0.07286409964134774, -0.09992124944024412, -0.10791298126886514, 0.40446093849922443, 0.13038335664367134, 0.17974211331222084, 0.10674955245551908, 0.21947683652979322, 0.19473907320670233, 0.17727971870706163, -0.0028773839453192936, 0.24122516357932577, 0.20302886359488845, 0.05552573637528853, -0.2742263479475779, -0.16665311270414598, 0.20790432029488412] |
1,803.01081 | Quantum Beat Photoelectron Imaging Spectroscopy of Xe in the VUV | Time-resolved pump-probe measurements of Xe, pumped at 133~nm and probed at
266~nm, are presented. The pump pulse prepared a long-lived hyperfine
wavepacket, in the Xe $5p^5(^2P^{\circ}_{1/2})6s~^2[1/2]^{\circ}_1$ manifold
($E=$77185 cm$^{-1}=$9.57 eV). The wavepacket was monitored via single-photon
ionization, and photoelectron images measured. The images provide angle- and
time-resolved data which, when obtained over a large time-window (900~ps),
constitute a precision quantum beat spectroscopy measurement of the hyperfine
state splittings. Additionally, analysis of the full photoelectron image stack
provides a quantum beat imaging modality, in which the Fourier components of
the photoelectron images correlated with specific beat components can be
obtained. This may also permit the extraction of isotope-resolved photoelectron
images in the frequency domain, in cases where nuclear spins (hence beat
components) can be uniquely assigned to specific isotopes (as herein), and also
provides phase information. The information content of both raw, and inverted,
image stacks is investigated, suggesting the utility of the Fourier analysis
methodology in cases where images cannot be inverted.
| physics.atom-ph quant-ph | timeresolved pumpprobe measurements of xe pumped at 133nm and probed at 266nm are presented the pump pulse prepared a longlived hyperfine wavepacket in the xe 5p52pcirc_126s212circ_1 manifold e77185 cm1957 ev the wavepacket was monitored via singlephoton ionization and photoelectron images measured the images provide angle and timeresolved data which when obtained over a large timewindow 900ps constitute a precision quantum beat spectroscopy measurement of the hyperfine state splittings additionally analysis of the full photoelectron image stack provides a quantum beat imaging modality in which the fourier components of the photoelectron images correlated with specific beat components can be obtained this may also permit the extraction of isotoperesolved photoelectron images in the frequency domain in cases where nuclear spins hence beat components can be uniquely assigned to specific isotopes as herein and also provides phase information the information content of both raw and inverted image stacks is investigated suggesting the utility of the fourier analysis methodology in cases where images cannot be inverted | [['timeresolved', 'pumpprobe', 'measurements', 'of', 'xe', 'pumped', 'at', '133nm', 'and', 'probed', 'at', '266nm', 'are', 'presented', 'the', 'pump', 'pulse', 'prepared', 'a', 'longlived', 'hyperfine', 'wavepacket', 'in', 'the', 'xe', '5p52pcirc_126s212circ_1', 'manifold', 'e77185', 'cm1957', 'ev', 'the', 'wavepacket', 'was', 'monitored', 'via', 'singlephoton', 'ionization', 'and', 'photoelectron', 'images', 'measured', 'the', 'images', 'provide', 'angle', 'and', 'timeresolved', 'data', 'which', 'when', 'obtained', 'over', 'a', 'large', 'timewindow', '900ps', 'constitute', 'a', 'precision', 'quantum', 'beat', 'spectroscopy', 'measurement', 'of', 'the', 'hyperfine', 'state', 'splittings', 'additionally', 'analysis', 'of', 'the', 'full', 'photoelectron', 'image', 'stack', 'provides', 'a', 'quantum', 'beat', 'imaging', 'modality', 'in', 'which', 'the', 'fourier', 'components', 'of', 'the', 'photoelectron', 'images', 'correlated', 'with', 'specific', 'beat', 'components', 'can', 'be', 'obtained', 'this', 'may', 'also', 'permit', 'the', 'extraction', 'of', 'isotoperesolved', 'photoelectron', 'images', 'in', 'the', 'frequency', 'domain', 'in', 'cases', 'where', 'nuclear', 'spins', 'hence', 'beat', 'components', 'can', 'be', 'uniquely', 'assigned', 'to', 'specific', 'isotopes', 'as', 'herein', 'and', 'also', 'provides', 'phase', 'information', 'the', 'information', 'content', 'of', 'both', 'raw', 'and', 'inverted', 'image', 'stacks', 'is', 'investigated', 'suggesting', 'the', 'utility', 'of', 'the', 'fourier', 'analysis', 'methodology', 'in', 'cases', 'where', 'images', 'can', 'not', 'be', 'inverted']] | [-0.05524297753218443, 0.14591108773876527, -0.08759884890406185, 0.041801972706226785, 0.002533397020380588, -0.17365023109966973, 0.04785064876207097, 0.45082590150035873, -0.2803606584321138, -0.3104988657365179, 0.05947023739216695, -0.2967962847717083, -0.02070889985604081, 0.22343918212814032, -0.02786098781581612, 0.016008582446652993, 0.09599878490089801, -0.0077233387371984895, -0.05487243482060018, -0.17348803721452102, 0.2411262446503373, 0.05068609631282224, 0.2919301136640037, 0.034868637479509516, 0.10573034453024839, 0.025311334524303675, -0.005825865334552375, -0.04635296051469161, -0.07978396675887571, 0.07883764320545515, 0.34480143060528073, 0.08530842306561008, 0.16008348402917194, -0.41623780170491165, -0.20082352169534298, 0.04440973637400159, 0.16960395186409877, 0.11363614329943658, -0.060460886770450056, -0.3488940950839003, -0.0013480189280098032, -0.08425842629075288, -0.05716895047207452, -0.11904535921005781, -0.025916966911446848, 0.021648980107656708, -0.26931107967534357, 0.0938346063933976, -0.00982274179002804, 0.08089143126775884, -0.08629946001793501, -0.0540394335777564, -0.03824492764012639, 0.12533352618898372, -0.03280047633074176, 0.030025809177250905, 0.18240347027832013, -0.11024362364172888, -0.11431308072445925, 0.34643239543363924, -0.10707244784185652, -0.1394396361711014, 0.08727496542083989, -0.22867250328017458, -0.07278670828231866, 0.17337956139817834, 0.10672458769326472, 0.1583676484975501, -0.1282738632991336, 0.011996130882777203, -0.01121946209507763, 0.2681812924113433, 0.12178059212365158, 0.10394855891799282, 0.20817754947607092, 0.14007554322875632, -0.005503968218299575, 0.11832791471640301, -0.221785749261309, -0.002844412300949264, -0.22159151648687328, -0.14779386578341294, -0.21892653178174498, 0.06978271800328037, -0.04085230051084187, -0.0950003089533398, 0.4495367196204651, 0.09304394394809612, 0.16985301496342395, -0.05213390650067502, 0.35384485108338914, 0.12174653690486292, 0.06328589141748514, -0.04265133375420597, 0.2638556322284565, 0.1387353875336184, 0.11138022012910717, -0.2452330147983969, 0.05137774357453558, -0.04358872723807195] |
1,803.01082 | Large deviations analysis for the $M/H_2/n + M$ queue in the
Halfin-Whitt regime | We consider the FCFS $M/H_2/n + M$ queue in the Halfin-Whitt heavy traffic
regime. It is known that the normalized sequence of steady-state queue length
distributions is tight and converges weakly to a limiting random variable W.
However, those works only describe W implicitly as the invariant measure of a
complicated diffusion. Although it was proven by Gamarnik and Stolyar that the
tail of W is sub-Gaussian, the actual value of $\lim_{x \rightarrow
\infty}x^{-2}\log(P(W >x))$ was left open. In subsequent work, Dai and He
conjectured an explicit form for this exponent, which was insensitive to the
higher moments of the service distribution.
We explicitly compute the true large deviations exponent for W when the
abandonment rate is less than the minimum service rate, the first such result
for non-Markovian queues with abandonments. Interestingly, our results resolve
the conjecture of Dai and He in the negative. Our main approach is to extend
the stochastic comparison framework of Gamarnik and Goldberg to the setting of
abandonments, requiring several novel and non-trivial contributions. Our
approach sheds light on several novel ways to think about multi-server queues
with abandonments in the Halfin-Whitt regime, which should hold in considerable
generality and provide new tools for analyzing these systems.
| math.PR | we consider the fcfs mh_2n m queue in the halfinwhitt heavy traffic regime it is known that the normalized sequence of steadystate queue length distributions is tight and converges weakly to a limiting random variable w however those works only describe w implicitly as the invariant measure of a complicated diffusion although it was proven by gamarnik and stolyar that the tail of w is subgaussian the actual value of lim_x rightarrow inftyx2logpw x was left open in subsequent work dai and he conjectured an explicit form for this exponent which was insensitive to the higher moments of the service distribution we explicitly compute the true large deviations exponent for w when the abandonment rate is less than the minimum service rate the first such result for nonmarkovian queues with abandonments interestingly our results resolve the conjecture of dai and he in the negative our main approach is to extend the stochastic comparison framework of gamarnik and goldberg to the setting of abandonments requiring several novel and nontrivial contributions our approach sheds light on several novel ways to think about multiserver queues with abandonments in the halfinwhitt regime which should hold in considerable generality and provide new tools for analyzing these systems | [['we', 'consider', 'the', 'fcfs', 'mh_2n', 'm', 'queue', 'in', 'the', 'halfinwhitt', 'heavy', 'traffic', 'regime', 'it', 'is', 'known', 'that', 'the', 'normalized', 'sequence', 'of', 'steadystate', 'queue', 'length', 'distributions', 'is', 'tight', 'and', 'converges', 'weakly', 'to', 'a', 'limiting', 'random', 'variable', 'w', 'however', 'those', 'works', 'only', 'describe', 'w', 'implicitly', 'as', 'the', 'invariant', 'measure', 'of', 'a', 'complicated', 'diffusion', 'although', 'it', 'was', 'proven', 'by', 'gamarnik', 'and', 'stolyar', 'that', 'the', 'tail', 'of', 'w', 'is', 'subgaussian', 'the', 'actual', 'value', 'of', 'lim_x', 'rightarrow', 'inftyx2logpw', 'x', 'was', 'left', 'open', 'in', 'subsequent', 'work', 'dai', 'and', 'he', 'conjectured', 'an', 'explicit', 'form', 'for', 'this', 'exponent', 'which', 'was', 'insensitive', 'to', 'the', 'higher', 'moments', 'of', 'the', 'service', 'distribution', 'we', 'explicitly', 'compute', 'the', 'true', 'large', 'deviations', 'exponent', 'for', 'w', 'when', 'the', 'abandonment', 'rate', 'is', 'less', 'than', 'the', 'minimum', 'service', 'rate', 'the', 'first', 'such', 'result', 'for', 'nonmarkovian', 'queues', 'with', 'abandonments', 'interestingly', 'our', 'results', 'resolve', 'the', 'conjecture', 'of', 'dai', 'and', 'he', 'in', 'the', 'negative', 'our', 'main', 'approach', 'is', 'to', 'extend', 'the', 'stochastic', 'comparison', 'framework', 'of', 'gamarnik', 'and', 'goldberg', 'to', 'the', 'setting', 'of', 'abandonments', 'requiring', 'several', 'novel', 'and', 'nontrivial', 'contributions', 'our', 'approach', 'sheds', 'light', 'on', 'several', 'novel', 'ways', 'to', 'think', 'about', 'multiserver', 'queues', 'with', 'abandonments', 'in', 'the', 'halfinwhitt', 'regime', 'which', 'should', 'hold', 'in', 'considerable', 'generality', 'and', 'provide', 'new', 'tools', 'for', 'analyzing', 'these', 'systems']] | [-0.11537070825463161, 0.1099086343782983, -0.08369034803239629, 0.09176107641425915, -0.040517384570557625, -0.1917625726433471, 0.09266357304353733, 0.3394503255782183, -0.25344270998379215, -0.266648954465054, 0.08821760771039408, -0.2782454160752241, -0.10852151337108808, 0.1958542986714747, -0.11828157868469134, 0.07349606451229192, 0.03998283498571254, 0.040149764756351944, -0.006099530928768217, -0.28707813196466303, 0.29691271322779356, 0.05307109833229333, 0.295055423816666, 0.06593884963076561, 0.07169424068066292, 0.01620187150052516, -0.026605173338903113, -0.049643813208676876, -0.1468358275572973, 0.08319173484283965, 0.2079409035318531, 0.09644817017018795, 0.27167621052009056, -0.3605708420800511, -0.19316028692177498, 0.09199205887096468, 0.13845108504159725, 0.06766123514506034, 0.001955807766644284, -0.26477513993391766, 0.1371819752868032, -0.1704195816864376, -0.13205630026524887, -0.03817751473747194, 0.06534304589498788, 0.03988299097807612, -0.29628567451261917, 0.06124391267920146, 0.1147798875812441, -0.019498269974719734, -0.014661654834635557, -0.13702472618664616, 0.026252568542258815, 0.137911430819222, 0.09434960214013699, 0.03341524687130004, 0.07819321752438554, -0.09991163749258704, -0.0887175775997457, 0.33786270711105315, -0.08441006979010127, -0.16404038495966233, 0.16621941737859744, -0.13991779402596877, -0.17020257918105927, 0.1102319604740478, 0.14941305863903837, 0.13983622292769723, -0.1607848135894892, 0.09389911081671017, -0.08431335184723139, 0.13642058308178093, 0.0960074990481371, 0.02702270687324926, 0.09280304752988741, 0.15914239408215508, 0.08367702064104378, 0.12367636822978965, -0.036619931111345067, -0.1244517663354054, -0.2850607052398846, -0.18515358825214207, -0.1783477942168247, 0.08951537485118025, -0.09129707339867309, -0.11555625319015235, 0.31975651124113935, 0.13397138641099446, 0.19248003168730066, 0.12923875423381104, 0.2487643243256025, 0.1526554839068558, -0.009023678203229793, 0.1334525397827383, 0.17292007648851723, 0.11660025478049647, 0.12881370557588526, -0.18621325473301112, 0.13384899541269987, 0.05433467779075727] |
1,803.01083 | On the generalized Drazin inverse of the sum in a Banach algebra | The objective of this paper is to study the existence of the generalized
Drazin inverse of the sum $a+b$ in a Banach algebra and present explicit
expressions for the generalized Drazin inverse of this sum, under new
conditions.
| math.FA | the objective of this paper is to study the existence of the generalized drazin inverse of the sum ab in a banach algebra and present explicit expressions for the generalized drazin inverse of this sum under new conditions | [['the', 'objective', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'existence', 'of', 'the', 'generalized', 'drazin', 'inverse', 'of', 'the', 'sum', 'ab', 'in', 'a', 'banach', 'algebra', 'and', 'present', 'explicit', 'expressions', 'for', 'the', 'generalized', 'drazin', 'inverse', 'of', 'this', 'sum', 'under', 'new', 'conditions']] | [-0.13113989296222203, 0.0074622257931255985, -0.06722387575887535, 0.09968945789334707, -0.09522518877699775, -0.040073924685681335, 0.013035416011821087, 0.33603126913505166, -0.3616807848999375, -0.15178762307684673, 0.12456688226972658, -0.21378326005498438, -0.19742997323996142, 0.13676332434835403, -0.05267528314633589, 0.03159549790679624, 0.03658012335041636, 0.08204431059819303, -0.18724557671597913, -0.1969540906383803, 0.4096569558115382, 0.035563778567225916, 0.23085509184257766, 0.08798149455259063, 0.12320292107209466, 0.06956790232001558, -0.03893000903343292, -0.04979051938770633, -0.19358730568599544, 0.14909452697458236, 0.2516952969722058, 0.11692323153348345, 0.26223293662463365, -0.34961828295337527, -0.07890815878483026, 0.2056561696441158, 0.13031101697369626, -0.06595138313346788, -0.02665778212739449, -0.23440848506594958, 0.11745507103440009, -0.182326087139939, -0.1147450316991461, -0.062411516610729065, 0.04615339386816088, 0.03753719340985347, -0.3707458676868363, 0.10260613643760352, 0.12034809192348468, 0.08938274135519016, -0.14876340352930129, -0.18992717892519737, 0.11649255523164022, 0.037953601329048216, 0.013753503089231489, -0.07352773540677797, 0.019321880107255357, -0.07333873921858244, -0.10002889998845364, 0.38119812721484586, -0.027014839119817082, -0.22806030598861216, 0.07765846809764441, -0.12809191820652863, -0.11532778748752255, 0.07549923276038546, 0.14304402774493946, 0.16722575452570854, -0.22256433392727845, 0.1559449005243981, -0.20124868470195093, 0.028494330515202723, 0.06475023420429543, 0.012588473919190858, 0.13592506690244927, 0.10853017199980586, 0.09660230054961223, 0.2311396277264545, 0.013289810599465119, -0.0418548986903931, -0.4043399044557622, -0.18672992749825904, -0.1689467143610512, 0.11711094295606017, -0.06504641536977081, -0.21178673237170043, 0.4280719960990705, 0.13958610746225245, 0.1231317900268263, 0.12177848061056513, 0.26948424600260823, 0.2137475874961207, -0.0014904456605252467, 0.01625486136120009, 0.19228118252450307, 0.23909370657546739, 0.055261751636862755, -0.2503789839285769, -0.03169414972102171, 0.1983152522435902] |
1,803.01084 | Diffusion behavior of water confined in deformed carbon nanotubes | We use molecular dynamics simulations to study the diffusion of water inside
deformed carbon nanotubes, with different degrees of eccentricity at 300K. We
found a water structural transition between tubular-like to single-file for the
(7,7) nanotubes associated with a change from a high to low mobility regimes.
The water which in the undeformed (9,9) nanotubes is frozen, becomes liquid for
the distortion above a certain threshold. These water diffusion enhancement
(suppresion) is related to a reduction (increase) in the number of hydrogen
bonds. This suggests that the shape of the nanotube is a particularly important
ingredient when considering the dynamical and structural properties of confined
water.
| cond-mat.soft | we use molecular dynamics simulations to study the diffusion of water inside deformed carbon nanotubes with different degrees of eccentricity at 300k we found a water structural transition between tubularlike to singlefile for the 77 nanotubes associated with a change from a high to low mobility regimes the water which in the undeformed 99 nanotubes is frozen becomes liquid for the distortion above a certain threshold these water diffusion enhancement suppresion is related to a reduction increase in the number of hydrogen bonds this suggests that the shape of the nanotube is a particularly important ingredient when considering the dynamical and structural properties of confined water | [['we', 'use', 'molecular', 'dynamics', 'simulations', 'to', 'study', 'the', 'diffusion', 'of', 'water', 'inside', 'deformed', 'carbon', 'nanotubes', 'with', 'different', 'degrees', 'of', 'eccentricity', 'at', '300k', 'we', 'found', 'a', 'water', 'structural', 'transition', 'between', 'tubularlike', 'to', 'singlefile', 'for', 'the', '77', 'nanotubes', 'associated', 'with', 'a', 'change', 'from', 'a', 'high', 'to', 'low', 'mobility', 'regimes', 'the', 'water', 'which', 'in', 'the', 'undeformed', '99', 'nanotubes', 'is', 'frozen', 'becomes', 'liquid', 'for', 'the', 'distortion', 'above', 'a', 'certain', 'threshold', 'these', 'water', 'diffusion', 'enhancement', 'suppresion', 'is', 'related', 'to', 'a', 'reduction', 'increase', 'in', 'the', 'number', 'of', 'hydrogen', 'bonds', 'this', 'suggests', 'that', 'the', 'shape', 'of', 'the', 'nanotube', 'is', 'a', 'particularly', 'important', 'ingredient', 'when', 'considering', 'the', 'dynamical', 'and', 'structural', 'properties', 'of', 'confined', 'water']] | [-0.12327070267572296, 0.1786043933210543, -0.022388816877039818, 0.009864354591799091, 0.03146279473868111, -0.10102607810294326, 0.07447376820469662, 0.3811739948841761, -0.2762747957318459, -0.29445986234240307, 0.0637192692155159, -0.2983768014017633, -0.13497204123556894, 0.11765627557728088, -0.005280093689677569, 0.01424966586911875, 0.041175248380311114, -0.012428359172465105, -0.0640582675531612, -0.16088401199371186, 0.2334417553425257, 0.09261390019564028, 0.287341672329689, 0.14021564670948242, 0.0781878907417984, -0.03366089688244996, 0.07869584681598013, 0.0348130205892167, -0.1759307365362749, 0.11481132411468283, 0.2502517605481564, -0.04471806859386698, 0.21329789259910303, -0.4179392214996283, -0.24695890516323862, 0.052563920737911926, 0.11384547365618483, 0.15493835507176007, -0.030339213091449567, -0.20109235758910765, 0.06001175076366877, -0.14825408602625412, -0.1675165274470412, -0.0010112519617596605, 0.0417426064575337, 0.043820018143962, -0.2056916947915869, 0.1237035773097063, 0.037195018625253685, 0.07826206562733103, -0.07382344615311837, -0.11982326359786796, -0.08833983749203947, 0.09921577806119974, 0.04671755974523653, -0.003562911301587691, 0.25733758133554935, -0.15341846680956156, 0.006496938499007022, 0.43904077903068855, -0.09009103691051626, -0.14999043723603464, 0.24070674214371532, -0.17453847787747123, -0.13044099136308399, 0.2566861803511615, 0.11941446395555758, 0.08648917263039863, -0.14823776837023753, -0.023075327046823968, -0.015794387963635602, 0.1790294954641107, 0.11685114941682737, 0.028833385350463807, 0.24554738572816243, 0.23702627226033793, 0.04838194647136162, 0.178364463396511, -0.13551962622584124, -0.09587795539530662, -0.21045213138227756, -0.19389572520114323, -0.1402606232847386, 0.08003443877217097, -0.09157591502010308, -0.1799096579593167, 0.3523548076034717, 0.09904963507334578, 0.18526161680182548, 0.009378771412950713, 0.20762450980101624, 0.07882170088782485, 0.056217039418560544, 0.018707584983994305, 0.2538237027727278, 0.1676875172833086, 0.09617638600252147, -0.27639153626316915, 0.0784260054637309, -0.01627410653943442] |
1,803.01085 | Group formation on a small-world: experiment and modelling | As a step towards studying human-agent collectives we conduct an online game
with human participants cooperating on a network. The game is presented in the
context of achieving group formation through local coordination. The players
set initially to a small world network with limited information on the location
of other players, coordinate their movements to arrange themselves into groups.
To understand the decision making process we construct a data-driven model of
agents based on probability matching. The model allows us to gather insight
into the nature and degree of rationality employed by the human players. By
varying the parameters in agent based simulations we are able to benchmark the
human behaviour. We observe that while the players utilize the neighbourhood
information in limited capacity, the perception of risk is optimal. We also
find that for certain parameter ranges the agents are able to act more
efficiently when compared to the human players. This approach would allow us to
simulate the collective dynamics in games with agents having varying strategies
playing alongside human proxies.
| physics.soc-ph cs.SI | as a step towards studying humanagent collectives we conduct an online game with human participants cooperating on a network the game is presented in the context of achieving group formation through local coordination the players set initially to a small world network with limited information on the location of other players coordinate their movements to arrange themselves into groups to understand the decision making process we construct a datadriven model of agents based on probability matching the model allows us to gather insight into the nature and degree of rationality employed by the human players by varying the parameters in agent based simulations we are able to benchmark the human behaviour we observe that while the players utilize the neighbourhood information in limited capacity the perception of risk is optimal we also find that for certain parameter ranges the agents are able to act more efficiently when compared to the human players this approach would allow us to simulate the collective dynamics in games with agents having varying strategies playing alongside human proxies | [['as', 'a', 'step', 'towards', 'studying', 'humanagent', 'collectives', 'we', 'conduct', 'an', 'online', 'game', 'with', 'human', 'participants', 'cooperating', 'on', 'a', 'network', 'the', 'game', 'is', 'presented', 'in', 'the', 'context', 'of', 'achieving', 'group', 'formation', 'through', 'local', 'coordination', 'the', 'players', 'set', 'initially', 'to', 'a', 'small', 'world', 'network', 'with', 'limited', 'information', 'on', 'the', 'location', 'of', 'other', 'players', 'coordinate', 'their', 'movements', 'to', 'arrange', 'themselves', 'into', 'groups', 'to', 'understand', 'the', 'decision', 'making', 'process', 'we', 'construct', 'a', 'datadriven', 'model', 'of', 'agents', 'based', 'on', 'probability', 'matching', 'the', 'model', 'allows', 'us', 'to', 'gather', 'insight', 'into', 'the', 'nature', 'and', 'degree', 'of', 'rationality', 'employed', 'by', 'the', 'human', 'players', 'by', 'varying', 'the', 'parameters', 'in', 'agent', 'based', 'simulations', 'we', 'are', 'able', 'to', 'benchmark', 'the', 'human', 'behaviour', 'we', 'observe', 'that', 'while', 'the', 'players', 'utilize', 'the', 'neighbourhood', 'information', 'in', 'limited', 'capacity', 'the', 'perception', 'of', 'risk', 'is', 'optimal', 'we', 'also', 'find', 'that', 'for', 'certain', 'parameter', 'ranges', 'the', 'agents', 'are', 'able', 'to', 'act', 'more', 'efficiently', 'when', 'compared', 'to', 'the', 'human', 'players', 'this', 'approach', 'would', 'allow', 'us', 'to', 'simulate', 'the', 'collective', 'dynamics', 'in', 'games', 'with', 'agents', 'having', 'varying', 'strategies', 'playing', 'alongside', 'human', 'proxies']] | [-0.07471810553607805, 0.06053377865657891, -0.12013573872027757, 0.07224983208100696, -0.126243840390278, -0.16420814735045108, 0.12201895760345365, 0.4326638691342635, -0.2520954962066143, -0.3419510390491069, 0.04998179980098792, -0.27706716373447404, -0.1690808462094774, 0.11801082041986674, -0.12754634620768035, 0.011892551254761012, 0.053203910894724246, 0.0844795887406937, 0.07264879174702774, -0.2896552286487654, 0.3178027950017309, 0.06361384917255168, 0.25560215932742364, -0.01648448324190975, 0.11476507297490933, 0.02972519490867853, -0.032792132091439316, 0.03202663402805223, -0.13330421120682368, 0.14647772498536488, 0.3028976970992853, 0.15836197891773257, 0.37247384731480154, -0.473283603588574, -0.17140201755767054, 0.13953678168334885, 0.12773518087651925, 0.09799943374862861, 0.013434742854869753, -0.3323459294436209, 0.07068507861066071, -0.15904597723474687, -0.08879306574615871, -0.0965941117758825, -0.032532834005138345, 0.016280756237434836, -0.3076028513218777, -0.04316542830168151, -0.009501029629626371, 0.06492030833217967, -0.062054670130836674, -0.06770214080982814, -0.0031678063147788805, 0.28682986712853714, 0.046621442995689585, -0.0282885867771235, 0.19457564424660131, -0.17070769566727662, -0.16120647703905758, 0.38611326381601824, -0.006196352355774341, -0.20825546495535685, 0.21602132016620626, -0.11406491035757037, -0.11293909361053021, 0.08059699185235653, 0.23761419259009053, 0.09765968318608713, -0.14607660684943524, -0.01419609264945719, -0.05755005187201556, 0.20180223688329813, 0.01851054917848696, 0.016547783945466396, 0.17961575846373495, 0.2004842579598953, 0.11341313617250134, 0.11369129630226933, -0.01685145694757085, -0.19127481945418898, -0.2113086194569794, -0.10983135113277273, -0.11962427858955017, 0.007457518469639166, -0.10179973728515711, -0.10683142160593043, 0.3702605761576853, 0.20369656845345835, 0.17587874303275794, 0.09699886990845677, 0.28492203400594135, 0.031613233357999676, 0.07239001763397773, 0.07520856410722555, 0.19414115616125782, 0.02979377794589725, 0.10805936311802294, -0.22957162263485564, 0.14291500757620643, 0.020413545048472637] |
1,803.01086 | Topological concordance of knots in homology spheres and the solvable
filtration | In 2016 Levine showed that there exists a knot in a homology 3-sphere which
is not smoothly concordant to any knot in the 3-sphere where one allows
concordances in any smooth homology cobordism. Whether the same is true if one
allows topological concordances is not known. One might hope that such an
example might be detected by the powerful filtration of knot concordance
introduced by Cochran-Orr-Teichner. We prove that this is not the case,
demonstrating that for any knot in any homology sphere there is a knot in the
3-sphere equivalent to the original knot modulo any term of this filtration.
Our results apply equally well to link concordance. As an application we prove
that every winding number +/-1 satellite operator acts bijectively on knot
concordance, modulo any term of the solvable filtration.
| math.GT | in 2016 levine showed that there exists a knot in a homology 3sphere which is not smoothly concordant to any knot in the 3sphere where one allows concordances in any smooth homology cobordism whether the same is true if one allows topological concordances is not known one might hope that such an example might be detected by the powerful filtration of knot concordance introduced by cochranorrteichner we prove that this is not the case demonstrating that for any knot in any homology sphere there is a knot in the 3sphere equivalent to the original knot modulo any term of this filtration our results apply equally well to link concordance as an application we prove that every winding number 1 satellite operator acts bijectively on knot concordance modulo any term of the solvable filtration | [['in', '2016', 'levine', 'showed', 'that', 'there', 'exists', 'a', 'knot', 'in', 'a', 'homology', '3sphere', 'which', 'is', 'not', 'smoothly', 'concordant', 'to', 'any', 'knot', 'in', 'the', '3sphere', 'where', 'one', 'allows', 'concordances', 'in', 'any', 'smooth', 'homology', 'cobordism', 'whether', 'the', 'same', 'is', 'true', 'if', 'one', 'allows', 'topological', 'concordances', 'is', 'not', 'known', 'one', 'might', 'hope', 'that', 'such', 'an', 'example', 'might', 'be', 'detected', 'by', 'the', 'powerful', 'filtration', 'of', 'knot', 'concordance', 'introduced', 'by', 'cochranorrteichner', 'we', 'prove', 'that', 'this', 'is', 'not', 'the', 'case', 'demonstrating', 'that', 'for', 'any', 'knot', 'in', 'any', 'homology', 'sphere', 'there', 'is', 'a', 'knot', 'in', 'the', '3sphere', 'equivalent', 'to', 'the', 'original', 'knot', 'modulo', 'any', 'term', 'of', 'this', 'filtration', 'our', 'results', 'apply', 'equally', 'well', 'to', 'link', 'concordance', 'as', 'an', 'application', 'we', 'prove', 'that', 'every', 'winding', 'number', '1', 'satellite', 'operator', 'acts', 'bijectively', 'on', 'knot', 'concordance', 'modulo', 'any', 'term', 'of', 'the', 'solvable', 'filtration']] | [-0.22598611709094585, 0.08028505684276588, -0.15846447258683524, 0.09982832858629553, -0.1426557338992624, -0.22219485078441134, -0.026976257919761024, 0.33155244343767043, -0.31966229922775374, -0.2637452945967478, 0.08081067563034594, -0.20594924789196042, -0.20982169928081698, 0.17807518952014975, -0.20394115508499003, -0.05770564507833101, 0.08189925403838375, 0.10108007761278659, -0.011872499815321394, -0.2876085907753025, 0.3426262415469365, -0.03712258319181383, 0.12875909230818874, 0.10035666036664655, 0.09428864434935656, -0.035229121863533906, -0.008439262149001198, 0.02338280943502441, -0.2068581954472461, 0.026195999451989967, 0.3029727719591132, 0.057831276257179286, 0.14343092241849667, -0.35952393913924297, -0.17145997612155917, 0.22973925130935455, 0.16592769504741842, 0.004966376335325097, -0.01265361365998738, -0.2584030474868736, 0.11838725333529196, -0.17819733816177996, -0.14328075616263358, -0.03549007220277773, 0.051546970567897074, -0.017897892935915774, -0.15678550576427042, -0.03742518499003429, 0.09337841809457659, 0.0588280965449738, -0.005235345807465676, -0.03297146258147476, -0.05060876406645192, 0.15186723358088866, 0.054675150419326315, 0.16854340825720052, 0.09471070096273101, -0.11331981510148012, -0.19994558387477987, 0.40958129394015197, -0.10884335749131396, -0.27645630588320863, 0.164584095761376, -0.14715940934514865, -0.2521347000878094, 0.19369502255476004, -0.08928702215671092, 0.06426786477992633, -0.005245476691542487, 0.13782062367851236, -0.1678326335224442, 0.21798319327539967, 0.08716524102553529, -0.09790318796789288, 0.18002033405727183, 0.04404034952001114, 0.1476677714118776, 0.15685276215269292, -0.0342014692426148, -0.025615601484397694, -0.31928574068373755, -0.2842928028500926, -0.20543066227171375, 0.1336214640233587, -0.1083259816785672, -0.16857079653545542, 0.3888318912735335, 0.06712791620039459, 0.16855586747309767, 0.14625812349998554, 0.29866302162286285, 0.03535066492841544, 0.09133609129541337, 0.12207361703906629, 0.1397493665659786, 0.09924479180778888, -0.054619809406060246, -0.07894786266361441, 0.037681776872674995, 0.21339769498970276] |
1,803.01087 | Intrinsically ultrastrong plasmon-exciton interactions in crystallized
films of carbon nanotubes | In cavity quantum electrodynamics, optical emitters that are strongly coupled
to cavities give rise to polaritons with characteristics of both the emitters
and the cavity excitations. We show that carbon nanotubes can be crystallized
into chip-scale, two-dimensionally ordered films and that this new material
enables intrinsically ultrastrong emitter-cavity interactions: rather than
interacting with external cavities, nanotube excitons couple to the
near-infrared plasmon resonances of the nanotubes themselves. Our
polycrystalline nanotube films have a hexagonal crystal structure, ~25 nm
domains, and a 1.74 nm lattice constant. With this extremely high nanotube
density and nearly ideal plasmon-exciton spatial overlap, plasmon-exciton
coupling strengths reach 0.5 eV, which is 75% of the bare exciton energy and a
near record for room-temperature ultrastrong coupling. Crystallized nanotube
films represent a milestone in nanomaterials assembly and provide a compelling
foundation for high-ampacity conductors, low-power optical switches, and
tunable optical antennas.
| cond-mat.mes-hall cond-mat.mtrl-sci physics.optics | in cavity quantum electrodynamics optical emitters that are strongly coupled to cavities give rise to polaritons with characteristics of both the emitters and the cavity excitations we show that carbon nanotubes can be crystallized into chipscale twodimensionally ordered films and that this new material enables intrinsically ultrastrong emittercavity interactions rather than interacting with external cavities nanotube excitons couple to the nearinfrared plasmon resonances of the nanotubes themselves our polycrystalline nanotube films have a hexagonal crystal structure 25 nm domains and a 174 nm lattice constant with this extremely high nanotube density and nearly ideal plasmonexciton spatial overlap plasmonexciton coupling strengths reach 05 ev which is 75 of the bare exciton energy and a near record for roomtemperature ultrastrong coupling crystallized nanotube films represent a milestone in nanomaterials assembly and provide a compelling foundation for highampacity conductors lowpower optical switches and tunable optical antennas | [['in', 'cavity', 'quantum', 'electrodynamics', 'optical', 'emitters', 'that', 'are', 'strongly', 'coupled', 'to', 'cavities', 'give', 'rise', 'to', 'polaritons', 'with', 'characteristics', 'of', 'both', 'the', 'emitters', 'and', 'the', 'cavity', 'excitations', 'we', 'show', 'that', 'carbon', 'nanotubes', 'can', 'be', 'crystallized', 'into', 'chipscale', 'twodimensionally', 'ordered', 'films', 'and', 'that', 'this', 'new', 'material', 'enables', 'intrinsically', 'ultrastrong', 'emittercavity', 'interactions', 'rather', 'than', 'interacting', 'with', 'external', 'cavities', 'nanotube', 'excitons', 'couple', 'to', 'the', 'nearinfrared', 'plasmon', 'resonances', 'of', 'the', 'nanotubes', 'themselves', 'our', 'polycrystalline', 'nanotube', 'films', 'have', 'a', 'hexagonal', 'crystal', 'structure', '25', 'nm', 'domains', 'and', 'a', '174', 'nm', 'lattice', 'constant', 'with', 'this', 'extremely', 'high', 'nanotube', 'density', 'and', 'nearly', 'ideal', 'plasmonexciton', 'spatial', 'overlap', 'plasmonexciton', 'coupling', 'strengths', 'reach', '05', 'ev', 'which', 'is', '75', 'of', 'the', 'bare', 'exciton', 'energy', 'and', 'a', 'near', 'record', 'for', 'roomtemperature', 'ultrastrong', 'coupling', 'crystallized', 'nanotube', 'films', 'represent', 'a', 'milestone', 'in', 'nanomaterials', 'assembly', 'and', 'provide', 'a', 'compelling', 'foundation', 'for', 'highampacity', 'conductors', 'lowpower', 'optical', 'switches', 'and', 'tunable', 'optical', 'antennas']] | [-0.16521624859232245, 0.26176541761993627, 0.016457194673523804, -0.060706808888451785, -0.02984432747561327, -0.24533885545228465, 0.07778491744850304, 0.5431348380868809, -0.189961482157511, -0.3019460042312243, -0.031483279965804814, -0.3091971349285942, -0.0829240607710975, 0.1954183047211034, 0.07725492393447113, -0.005195621818773003, 0.04488312153794973, -0.14898413695656518, 0.013430589828049948, -0.14892952540122026, 0.17980829865711045, 0.044308469325802485, 0.3650970175914781, 0.1007088881779567, 0.08228341489702358, -0.060586159958661547, 0.18612533976638715, -0.019435497256599262, -0.14958782703036722, 0.13397454816034773, 0.29327287065507973, -0.1651395742041977, 0.22494881489137056, -0.47217815725500106, -0.18836727602084324, -0.01591847307035621, 0.2052962960819648, 0.1481887764324275, -0.08948293767302153, -0.2933698868195356, 0.01854575279129433, -0.11361221046987134, -0.12160098888176743, -0.053824350109953484, -0.001865224420866916, 0.031137113187225982, -0.21607288760854534, 0.01839828961135321, 0.02265834098052181, 0.06987890384478075, -0.08153762174589874, -0.06592903217332746, -0.0439908405237923, 0.01745521742850542, -0.07517426530010736, 0.011471910687478286, 0.26703055879153625, -0.13358801903373654, -0.10423585410479089, 0.3892970657579496, -0.08585283030236458, -0.05633233784711067, 0.19016080488726286, -0.1692981454281425, 0.0009902271560580194, 0.2069772408978397, 0.12589482325424348, 0.09143317798476397, -0.14613460617723653, 0.03460955358984303, 0.0010004275778479036, 0.24670150515977557, 0.10421779894427409, 0.21394451911902237, 0.30629137506983967, 0.2278343834717509, 0.0061365340616632725, 0.14348311155204804, -0.08521969092790116, 0.000989543920068044, -0.1806034235116488, -0.20916826115153783, -0.1887097704211171, 0.13490662656062033, -0.10333016419442596, -0.2218338210056995, 0.371447093105993, 0.09884685104791548, 0.10169753018425594, -0.0219759251422275, 0.22251280972612758, 0.05587146698634966, 0.13834091528928774, -0.023029268666787048, 0.36196721269106363, 0.23121557663142367, 0.105774135745301, -0.24143751211051212, -0.044729252443419326, -0.08150444765375192] |
1,803.01088 | Practical Contextual Bandits with Regression Oracles | A major challenge in contextual bandits is to design general-purpose
algorithms that are both practically useful and theoretically well-founded. We
present a new technique that has the empirical and computational advantages of
realizability-based approaches combined with the flexibility of agnostic
methods. Our algorithms leverage the availability of a regression oracle for
the value-function class, a more realistic and reasonable oracle than the
classification oracles over policies typically assumed by agnostic methods. Our
approach generalizes both UCB and LinUCB to far more expressive possible model
classes and achieves low regret under certain distributional assumptions. In an
extensive empirical evaluation, compared to both realizability-based and
agnostic baselines, we find that our approach typically gives comparable or
superior results.
| cs.LG stat.ML | a major challenge in contextual bandits is to design generalpurpose algorithms that are both practically useful and theoretically wellfounded we present a new technique that has the empirical and computational advantages of realizabilitybased approaches combined with the flexibility of agnostic methods our algorithms leverage the availability of a regression oracle for the valuefunction class a more realistic and reasonable oracle than the classification oracles over policies typically assumed by agnostic methods our approach generalizes both ucb and linucb to far more expressive possible model classes and achieves low regret under certain distributional assumptions in an extensive empirical evaluation compared to both realizabilitybased and agnostic baselines we find that our approach typically gives comparable or superior results | [['a', 'major', 'challenge', 'in', 'contextual', 'bandits', 'is', 'to', 'design', 'generalpurpose', 'algorithms', 'that', 'are', 'both', 'practically', 'useful', 'and', 'theoretically', 'wellfounded', 'we', 'present', 'a', 'new', 'technique', 'that', 'has', 'the', 'empirical', 'and', 'computational', 'advantages', 'of', 'realizabilitybased', 'approaches', 'combined', 'with', 'the', 'flexibility', 'of', 'agnostic', 'methods', 'our', 'algorithms', 'leverage', 'the', 'availability', 'of', 'a', 'regression', 'oracle', 'for', 'the', 'valuefunction', 'class', 'a', 'more', 'realistic', 'and', 'reasonable', 'oracle', 'than', 'the', 'classification', 'oracles', 'over', 'policies', 'typically', 'assumed', 'by', 'agnostic', 'methods', 'our', 'approach', 'generalizes', 'both', 'ucb', 'and', 'linucb', 'to', 'far', 'more', 'expressive', 'possible', 'model', 'classes', 'and', 'achieves', 'low', 'regret', 'under', 'certain', 'distributional', 'assumptions', 'in', 'an', 'extensive', 'empirical', 'evaluation', 'compared', 'to', 'both', 'realizabilitybased', 'and', 'agnostic', 'baselines', 'we', 'find', 'that', 'our', 'approach', 'typically', 'gives', 'comparable', 'or', 'superior', 'results']] | [-0.009946982276201118, -0.0663604120336618, -0.09548207994942602, 0.14063038139117948, -0.1321515812183191, -0.2105322204399527, 0.09608042127199537, 0.47733845708793715, -0.22366705048714944, -0.3261346580085892, 0.0699803701626431, -0.2401938259666949, -0.16495577727338268, 0.264795683264087, -0.15364900151300326, 0.12276500747477832, 0.0879964931263474, 0.002569597709736084, -0.0952588271849029, -0.3063377553204957, 0.26353980006911515, 0.07929233004943582, 0.34595135092866003, 0.019249947171294735, 0.11825603909745584, -0.04111947066542741, 0.0009498340036850749, 0.04948302909421424, -0.08942860710987843, 0.18008595357011808, 0.294039089559463, 0.2125173134876317, 0.36852960842416477, -0.3731914630829634, -0.1897869736125709, 0.0939661151700931, 0.12412058080448524, 0.08483842424558181, -0.038629690161701945, -0.2962268611555102, 0.0849951706385534, -0.18826759355796271, 0.013769995435467806, -0.18718202196453748, -0.041451818448605765, -0.0002709769014791961, -0.36585443262664374, 0.02574630240652416, 0.11638433253749993, 0.047136223891325164, -0.036563057844576086, -0.18331104938120565, 0.09387640692007712, 0.06784231652987696, 0.06286014262035391, 0.03623068836730039, 0.11078644166353338, -0.1345077190229571, -0.20962136792705247, 0.3609017853282, -0.06539823141690904, -0.20610286806824438, 0.25662492693344685, -0.03239763480112806, -0.15071665016493122, 0.11649680188285154, 0.18193216033672033, 0.1404102945275474, -0.13360942182899044, 0.06469704936949838, -0.06812998337115635, 0.18588327569070093, -0.009812369752724311, 0.036800154807503545, 0.07344407235321246, 0.24005339250556731, 0.11501664855403074, 0.12900499581244954, -0.04269884234261617, -0.10941737550443545, -0.23930668303122124, -0.08158858811172347, -0.15467545966895527, -0.0598841266494179, -0.15845564169847007, -0.1479614910326506, 0.3509585381313962, 0.2716172228796048, 0.1484462082418695, 0.2054730017604143, 0.3758583494641802, 0.026724320136852105, 0.07511790939136981, 0.16877175860613453, 0.20628995871939287, 0.03717122824347921, 0.07131001830719852, -0.14826170769275018, 0.1707820692732767, -0.03399459503411332] |
1,803.01089 | Abundances and Depletions of Neutron-Capture Elements in the
Interstellar Medium | We present an extensive analysis of the gas-phase abundances and depletion
behaviors of neutron-capture elements in the interstellar medium (ISM). Column
densities (or upper limits to the column densities) of Ga II, Ge II, As II, Kr
I, Cd II, Sn II, and Pb II are determined for a sample of 69 sight lines with
high- and/or medium-resolution archival spectra obtained with the Space
Telescope Imaging Spectrograph onboard the Hubble Space Telescope. An
additional 59 sight lines with column density measurements reported in the
literature are included in our analysis. Parameters that characterize the
depletion trends of the elements are derived according to the methodology
developed by Jenkins (2009; arXiv:0905.3173). (In an appendix, we present
similar depletion results for the light element B.) The depletion patterns
exhibited by Ga and Ge comport with expectations based on the depletion results
obtained for many other elements. Arsenic exhibits much less depletion than
expected, and its abundance in low-depletion sight lines may even be
supersolar. We confirm a previous finding by Jenkins (2009; arXiv:0905.3173)
that the depletion of Kr increases as the overall depletion level increases
from one sight line to another. Cadmium shows no such evidence of increasing
depletion. We find a significant amount of scatter in the gas-phase abundances
of Sn and Pb. For Sn, at least, the scatter may be evidence of real intrinsic
abundance variations due to s-process enrichment combined with inefficient
mixing in the ISM.
| astro-ph.GA | we present an extensive analysis of the gasphase abundances and depletion behaviors of neutroncapture elements in the interstellar medium ism column densities or upper limits to the column densities of ga ii ge ii as ii kr i cd ii sn ii and pb ii are determined for a sample of 69 sight lines with high andor mediumresolution archival spectra obtained with the space telescope imaging spectrograph onboard the hubble space telescope an additional 59 sight lines with column density measurements reported in the literature are included in our analysis parameters that characterize the depletion trends of the elements are derived according to the methodology developed by jenkins 2009 arxiv09053173 in an appendix we present similar depletion results for the light element b the depletion patterns exhibited by ga and ge comport with expectations based on the depletion results obtained for many other elements arsenic exhibits much less depletion than expected and its abundance in lowdepletion sight lines may even be supersolar we confirm a previous finding by jenkins 2009 arxiv09053173 that the depletion of kr increases as the overall depletion level increases from one sight line to another cadmium shows no such evidence of increasing depletion we find a significant amount of scatter in the gasphase abundances of sn and pb for sn at least the scatter may be evidence of real intrinsic abundance variations due to sprocess enrichment combined with inefficient mixing in the ism | [['we', 'present', 'an', 'extensive', 'analysis', 'of', 'the', 'gasphase', 'abundances', 'and', 'depletion', 'behaviors', 'of', 'neutroncapture', 'elements', 'in', 'the', 'interstellar', 'medium', 'ism', 'column', 'densities', 'or', 'upper', 'limits', 'to', 'the', 'column', 'densities', 'of', 'ga', 'ii', 'ge', 'ii', 'as', 'ii', 'kr', 'i', 'cd', 'ii', 'sn', 'ii', 'and', 'pb', 'ii', 'are', 'determined', 'for', 'a', 'sample', 'of', '69', 'sight', 'lines', 'with', 'high', 'andor', 'mediumresolution', 'archival', 'spectra', 'obtained', 'with', 'the', 'space', 'telescope', 'imaging', 'spectrograph', 'onboard', 'the', 'hubble', 'space', 'telescope', 'an', 'additional', '59', 'sight', 'lines', 'with', 'column', 'density', 'measurements', 'reported', 'in', 'the', 'literature', 'are', 'included', 'in', 'our', 'analysis', 'parameters', 'that', 'characterize', 'the', 'depletion', 'trends', 'of', 'the', 'elements', 'are', 'derived', 'according', 'to', 'the', 'methodology', 'developed', 'by', 'jenkins', '2009', 'arxiv09053173', 'in', 'an', 'appendix', 'we', 'present', 'similar', 'depletion', 'results', 'for', 'the', 'light', 'element', 'b', 'the', 'depletion', 'patterns', 'exhibited', 'by', 'ga', 'and', 'ge', 'comport', 'with', 'expectations', 'based', 'on', 'the', 'depletion', 'results', 'obtained', 'for', 'many', 'other', 'elements', 'arsenic', 'exhibits', 'much', 'less', 'depletion', 'than', 'expected', 'and', 'its', 'abundance', 'in', 'lowdepletion', 'sight', 'lines', 'may', 'even', 'be', 'supersolar', 'we', 'confirm', 'a', 'previous', 'finding', 'by', 'jenkins', '2009', 'arxiv09053173', 'that', 'the', 'depletion', 'of', 'kr', 'increases', 'as', 'the', 'overall', 'depletion', 'level', 'increases', 'from', 'one', 'sight', 'line', 'to', 'another', 'cadmium', 'shows', 'no', 'such', 'evidence', 'of', 'increasing', 'depletion', 'we', 'find', 'a', 'significant', 'amount', 'of', 'scatter', 'in', 'the', 'gasphase', 'abundances', 'of', 'sn', 'and', 'pb', 'for', 'sn', 'at', 'least', 'the', 'scatter', 'may', 'be', 'evidence', 'of', 'real', 'intrinsic', 'abundance', 'variations', 'due', 'to', 'sprocess', 'enrichment', 'combined', 'with', 'inefficient', 'mixing', 'in', 'the', 'ism']] | [-0.041154661400912285, 0.1041851636799302, -0.0035034570759401107, 0.02398228049119059, -0.0049618288096534005, -0.10129627707398409, 0.0795993017924265, 0.4393048254796901, -0.1649369651105446, -0.3738230362072593, 0.024427215952294856, -0.33002967117593074, -0.03368366563008127, 0.1515658540227331, -0.05229549962454117, -0.05547376989280511, 0.06281544825332797, -0.09478507158455925, -0.09161774254638828, -0.25920159867805487, 0.2510746469697318, 0.10189101933596809, 0.22508583239450827, -0.007369036664867885, -0.00694242570301494, -0.11507702260636367, -0.09374243185385807, 0.02433569211575365, -0.12863056137233736, 0.11419863636261171, 0.2302658716117183, 0.13623979963306496, 0.1699795401058136, -0.4017773189691816, -0.224399312848074, 0.059726695106245384, 0.18318927116317946, 0.06207759766521044, -0.12289906811798947, -0.2671648423569516, 0.03126348706527462, -0.13367849563718096, -0.1698340401829531, 0.06812127262680258, 0.08418786075885575, 0.041891113940514944, -0.2607301896205172, 0.07702176258640571, -0.005274423170221858, 0.14141777054191285, -0.09778207496582714, -0.19642636766527882, -0.07522683281005703, 0.04639456438350403, 0.011205165515629908, -0.0038382393604245945, 0.15120571995756996, -0.09021018363006063, 0.007865749848767733, 0.3978463888534496, -0.15452571272081148, -0.008413468910312543, 0.20550016451997158, -0.1793498843201858, -0.1702260994703139, 0.1990988987734796, 0.11796361461986238, 0.08244081957337375, -0.10435663534200981, 0.03650738726520282, -0.020304300100443106, 0.2225166905719118, 0.04168632045750403, 0.054327159176250264, 0.18671333859774134, 0.11157862661788479, 0.03697177784544273, 0.030270192496534277, -0.2164637300048549, -0.019037139950256445, -0.2562351623832638, -0.197140122560832, -0.10648795174590002, 0.06604971040565616, -0.14649310107232205, -0.10980175306988704, 0.2816660869647709, 0.1188618328440218, 0.26287381672578997, -0.0007637333538797167, 0.2791204805422224, 0.11427530876667294, 0.07827448699912892, 0.0718023057741712, 0.2742037414433833, 0.16798156755279878, 0.10980565365529261, -0.26245373570555264, 0.16089629503683403, 0.032994011445886366] |
1,803.0109 | On Modular Training of Neural Acoustics-to-Word Model for LVCSR | End-to-end (E2E) automatic speech recognition (ASR) systems directly map
acoustics to words using a unified model. Previous works mostly focus on E2E
training a single model which integrates acoustic and language model into a
whole. Although E2E training benefits from sequence modeling and simplified
decoding pipelines, large amount of transcribed acoustic data is usually
required, and traditional acoustic and language modelling techniques cannot be
utilized. In this paper, a novel modular training framework of E2E ASR is
proposed to separately train neural acoustic and language models during
training stage, while still performing end-to-end inference in decoding stage.
Here, an acoustics-to-phoneme model (A2P) and a phoneme-to-word model (P2W) are
trained using acoustic data and text data respectively. A phone synchronous
decoding (PSD) module is inserted between A2P and P2W to reduce sequence
lengths without precision loss. Finally, modules are integrated into an
acousticsto-word model (A2W) and jointly optimized using acoustic data to
retain the advantage of sequence modeling. Experiments on a 300- hour
Switchboard task show significant improvement over the direct A2W model. The
efficiency in both training and decoding also benefits from the proposed
method.
| cs.CL | endtoend e2e automatic speech recognition asr systems directly map acoustics to words using a unified model previous works mostly focus on e2e training a single model which integrates acoustic and language model into a whole although e2e training benefits from sequence modeling and simplified decoding pipelines large amount of transcribed acoustic data is usually required and traditional acoustic and language modelling techniques cannot be utilized in this paper a novel modular training framework of e2e asr is proposed to separately train neural acoustic and language models during training stage while still performing endtoend inference in decoding stage here an acousticstophoneme model a2p and a phonemetoword model p2w are trained using acoustic data and text data respectively a phone synchronous decoding psd module is inserted between a2p and p2w to reduce sequence lengths without precision loss finally modules are integrated into an acousticstoword model a2w and jointly optimized using acoustic data to retain the advantage of sequence modeling experiments on a 300 hour switchboard task show significant improvement over the direct a2w model the efficiency in both training and decoding also benefits from the proposed method | [['endtoend', 'e2e', 'automatic', 'speech', 'recognition', 'asr', 'systems', 'directly', 'map', 'acoustics', 'to', 'words', 'using', 'a', 'unified', 'model', 'previous', 'works', 'mostly', 'focus', 'on', 'e2e', 'training', 'a', 'single', 'model', 'which', 'integrates', 'acoustic', 'and', 'language', 'model', 'into', 'a', 'whole', 'although', 'e2e', 'training', 'benefits', 'from', 'sequence', 'modeling', 'and', 'simplified', 'decoding', 'pipelines', 'large', 'amount', 'of', 'transcribed', 'acoustic', 'data', 'is', 'usually', 'required', 'and', 'traditional', 'acoustic', 'and', 'language', 'modelling', 'techniques', 'can', 'not', 'be', 'utilized', 'in', 'this', 'paper', 'a', 'novel', 'modular', 'training', 'framework', 'of', 'e2e', 'asr', 'is', 'proposed', 'to', 'separately', 'train', 'neural', 'acoustic', 'and', 'language', 'models', 'during', 'training', 'stage', 'while', 'still', 'performing', 'endtoend', 'inference', 'in', 'decoding', 'stage', 'here', 'an', 'acousticstophoneme', 'model', 'a2p', 'and', 'a', 'phonemetoword', 'model', 'p2w', 'are', 'trained', 'using', 'acoustic', 'data', 'and', 'text', 'data', 'respectively', 'a', 'phone', 'synchronous', 'decoding', 'psd', 'module', 'is', 'inserted', 'between', 'a2p', 'and', 'p2w', 'to', 'reduce', 'sequence', 'lengths', 'without', 'precision', 'loss', 'finally', 'modules', 'are', 'integrated', 'into', 'an', 'acousticstoword', 'model', 'a2w', 'and', 'jointly', 'optimized', 'using', 'acoustic', 'data', 'to', 'retain', 'the', 'advantage', 'of', 'sequence', 'modeling', 'experiments', 'on', 'a', '300', 'hour', 'switchboard', 'task', 'show', 'significant', 'improvement', 'over', 'the', 'direct', 'a2w', 'model', 'the', 'efficiency', 'in', 'both', 'training', 'and', 'decoding', 'also', 'benefits', 'from', 'the', 'proposed', 'method']] | [-0.05531187302372216, 0.010679030474737216, -0.036437716346446665, 0.05270904165555966, -0.12727004850698312, -0.2008949702367713, 0.0552291073064502, 0.45307830331401655, -0.2866030042211566, -0.33040585399399075, 0.06823723817132818, -0.26770875128188537, -0.17629804544697475, 0.23229703724380513, -0.1200890984403921, 0.10548726521601962, 0.193801012633586, 0.04673749056098092, -0.06447028795019319, -0.26592246326744434, 0.22249715291052227, 0.08608707857986345, 0.39515025662410114, -0.02756578199319926, 0.1497499334863792, -0.02434385108387252, -0.022837990887321368, -0.08563636067328448, -0.019800507901337645, 0.14140399195837192, 0.3247813816487312, 0.22660729428753257, 0.2822933551784524, -0.44330502399142185, -0.26478600837847055, 0.07659977045082285, 0.1785104167242737, 0.1291312988747529, -0.041354714524577896, -0.3271025280650381, 0.09189697039381946, -0.20396454173011158, 0.11777417632275382, -0.0757960170563108, -0.037402291969477156, -0.03802700653645645, -0.2938013016239932, 0.038386622542336976, 0.10553915193051343, 0.10537981777578471, -0.08451224559710523, -0.08092849593199587, 0.0026386946954754303, 0.1442186024815664, 0.008697334891463548, 0.07783449597912334, 0.10316481605506218, -0.11685251409020882, -0.09013341382555866, 0.34739834252927126, -0.08322534757905448, -0.22740198572105524, 0.15432386861800257, 0.02807751107257386, -0.11411093871878542, 0.11978222538575369, 0.27955168800469005, 0.04860178578604499, -0.21598562334016289, 0.016158322032108274, 0.030349238649132134, 0.26095415708487446, 0.0498380449172818, -0.03678755350309708, 0.1911510898353299, 0.2925856533604573, -0.06604510410587587, 0.12696292955851, -0.1258387449830163, -0.022400746400387066, -0.22516034313467453, -0.0862382557141878, -0.16967428725658226, -0.06327232576104111, -0.06664682428811869, -0.10237190324835904, 0.3938498450594995, 0.20924567254057722, 0.1964727328639761, 0.17334814059026743, 0.3986555854688682, 0.039844135006601195, 0.1444993459406997, 0.07689161979784409, 0.1438025887600025, 0.0009722427019606466, 0.12954877785966307, -0.17120453528490465, 0.056472785831631525, 0.051372328099956656] |
1,803.01091 | Unique recovery of piecewise analytic density and stiffness tensor from
the elastic-wave Dirichlet-to-Neumann map | We study the recovery of piecewise analytic density and stiffness tensor of a
three-dimensional domain from the local dynamical Dirichlet-to-Neumann map. We
give global uniqueness results if the medium is transversely isotropic with
known axis of symmetry or orthorhombic with known symmetry planes on each
subdomain. We also obtain uniqueness of a fully anisotropic stiffness tensor,
assuming that it is piecewise constant and that the interfaces which separate
the subdomains have curved portions. The domain partition need not to be known.
Precisely, we show that a domain partition consisting of subanalytic sets is
simultaneously uniquely determined.
| math.AP | we study the recovery of piecewise analytic density and stiffness tensor of a threedimensional domain from the local dynamical dirichlettoneumann map we give global uniqueness results if the medium is transversely isotropic with known axis of symmetry or orthorhombic with known symmetry planes on each subdomain we also obtain uniqueness of a fully anisotropic stiffness tensor assuming that it is piecewise constant and that the interfaces which separate the subdomains have curved portions the domain partition need not to be known precisely we show that a domain partition consisting of subanalytic sets is simultaneously uniquely determined | [['we', 'study', 'the', 'recovery', 'of', 'piecewise', 'analytic', 'density', 'and', 'stiffness', 'tensor', 'of', 'a', 'threedimensional', 'domain', 'from', 'the', 'local', 'dynamical', 'dirichlettoneumann', 'map', 'we', 'give', 'global', 'uniqueness', 'results', 'if', 'the', 'medium', 'is', 'transversely', 'isotropic', 'with', 'known', 'axis', 'of', 'symmetry', 'or', 'orthorhombic', 'with', 'known', 'symmetry', 'planes', 'on', 'each', 'subdomain', 'we', 'also', 'obtain', 'uniqueness', 'of', 'a', 'fully', 'anisotropic', 'stiffness', 'tensor', 'assuming', 'that', 'it', 'is', 'piecewise', 'constant', 'and', 'that', 'the', 'interfaces', 'which', 'separate', 'the', 'subdomains', 'have', 'curved', 'portions', 'the', 'domain', 'partition', 'need', 'not', 'to', 'be', 'known', 'precisely', 'we', 'show', 'that', 'a', 'domain', 'partition', 'consisting', 'of', 'subanalytic', 'sets', 'is', 'simultaneously', 'uniquely', 'determined']] | [-0.14135476300725713, 0.10326569825216818, -0.06784863625459063, -0.01767319994905847, -0.13680212781764567, -0.10434945265660645, -0.029937081000146765, 0.429678242537193, -0.33336469023682486, -0.2004693371078853, 0.13912248112804568, -0.2338554421051716, -0.15105341594365504, 0.10150156282422056, 0.016048222130242113, 0.031453447959696255, 0.03442399999282012, 0.014279262099686699, -0.1006057527968854, -0.21342934555529305, 0.3717085162449318, -0.05868926994541349, 0.2735023779872184, 0.048115547351699206, 0.116665402490374, -0.0011512636119732633, 0.016129173348114517, 0.05357023625159248, -0.18233899352943203, 0.09903704018021624, 0.23379752789332997, 0.05541539529319076, 0.15589586614320675, -0.41620831123630825, -0.21914088734289786, 0.1330394534585745, 0.12839358189861136, 0.08528075193195643, -0.037424219391444545, -0.27849543150902417, 0.10821429581847042, -0.0846379472107704, -0.18303071083209943, -0.10474255943942505, 0.0038324756314978004, 0.03089770944886065, -0.2831238800281426, 0.11298474215163878, 0.07455629061678337, 0.030274584928217035, -0.14592223048869832, -0.07094966147754651, -0.07700752711389214, 0.12796583609451773, 0.0313417210248493, 0.08718470219658532, 0.1144514033779463, -0.06016354101787632, -0.05228095187824996, 0.3710197291026513, -0.03543997317683534, -0.3044295912632151, 0.18748469337272886, -0.17690019946894608, -0.10392034468047011, 0.12338919252700482, 0.12095133899977857, 0.11523491611903107, -0.13309635415983698, 0.1537998218445864, -0.09885291857426637, 0.2082383434365814, 0.09100492057041265, -0.04338936087151524, 0.15654288442844214, 0.11280315456679091, 0.14745290519931586, 0.15921908909876947, -0.013448280392064286, -0.03869100727509552, -0.3378606667974964, -0.1363379248456719, -0.21104126498297168, 0.07320010762259699, -0.1251426274923991, -0.2358760877784031, 0.38072955689858645, 0.053454022946728706, 0.21022657278930032, 0.07330577946292276, 0.2880009546643123, 0.06663087507331511, 0.05111262015270768, 0.11878791435447056, 0.20119502557160254, 0.1399242897653797, 0.04577906053843132, -0.17673540894611506, 0.03384554108197335, 0.11573411642893916] |
1,803.01092 | Analyzing Business Process Anomalies Using Autoencoders | Businesses are naturally interested in detecting anomalies in their internal
processes, because these can be indicators for fraud and inefficiencies. Within
the domain of business intelligence, classic anomaly detection is not very
frequently researched. In this paper, we propose a method, using autoencoders,
for detecting and analyzing anomalies occurring in the execution of a business
process. Our method does not rely on any prior knowledge about the process and
can be trained on a noisy dataset already containing the anomalies. We
demonstrate its effectiveness by evaluating it on 700 different datasets and
testing its performance against three state-of-the-art anomaly detection
methods. This paper is an extension of our previous work from 2016 [30].
Compared to the original publication we have further refined the approach in
terms of performance and conducted an elaborate evaluation on more
sophisticated datasets including real-life event logs from the Business Process
Intelligence Challenges of 2012 and 2017. In our experiments our approach
reached an F1 score of 0.87, whereas the best unaltered state-of-the-art
approach reached an F1 score of 0.72. Furthermore, our approach can be used to
analyze the detected anomalies in terms of which event within one execution of
the process causes the anomaly.
| cs.AI | businesses are naturally interested in detecting anomalies in their internal processes because these can be indicators for fraud and inefficiencies within the domain of business intelligence classic anomaly detection is not very frequently researched in this paper we propose a method using autoencoders for detecting and analyzing anomalies occurring in the execution of a business process our method does not rely on any prior knowledge about the process and can be trained on a noisy dataset already containing the anomalies we demonstrate its effectiveness by evaluating it on 700 different datasets and testing its performance against three stateoftheart anomaly detection methods this paper is an extension of our previous work from 2016 30 compared to the original publication we have further refined the approach in terms of performance and conducted an elaborate evaluation on more sophisticated datasets including reallife event logs from the business process intelligence challenges of 2012 and 2017 in our experiments our approach reached an f1 score of 087 whereas the best unaltered stateoftheart approach reached an f1 score of 072 furthermore our approach can be used to analyze the detected anomalies in terms of which event within one execution of the process causes the anomaly | [['businesses', 'are', 'naturally', 'interested', 'in', 'detecting', 'anomalies', 'in', 'their', 'internal', 'processes', 'because', 'these', 'can', 'be', 'indicators', 'for', 'fraud', 'and', 'inefficiencies', 'within', 'the', 'domain', 'of', 'business', 'intelligence', 'classic', 'anomaly', 'detection', 'is', 'not', 'very', 'frequently', 'researched', 'in', 'this', 'paper', 'we', 'propose', 'a', 'method', 'using', 'autoencoders', 'for', 'detecting', 'and', 'analyzing', 'anomalies', 'occurring', 'in', 'the', 'execution', 'of', 'a', 'business', 'process', 'our', 'method', 'does', 'not', 'rely', 'on', 'any', 'prior', 'knowledge', 'about', 'the', 'process', 'and', 'can', 'be', 'trained', 'on', 'a', 'noisy', 'dataset', 'already', 'containing', 'the', 'anomalies', 'we', 'demonstrate', 'its', 'effectiveness', 'by', 'evaluating', 'it', 'on', '700', 'different', 'datasets', 'and', 'testing', 'its', 'performance', 'against', 'three', 'stateoftheart', 'anomaly', 'detection', 'methods', 'this', 'paper', 'is', 'an', 'extension', 'of', 'our', 'previous', 'work', 'from', '2016', '30', 'compared', 'to', 'the', 'original', 'publication', 'we', 'have', 'further', 'refined', 'the', 'approach', 'in', 'terms', 'of', 'performance', 'and', 'conducted', 'an', 'elaborate', 'evaluation', 'on', 'more', 'sophisticated', 'datasets', 'including', 'reallife', 'event', 'logs', 'from', 'the', 'business', 'process', 'intelligence', 'challenges', 'of', '2012', 'and', '2017', 'in', 'our', 'experiments', 'our', 'approach', 'reached', 'an', 'f1', 'score', 'of', '087', 'whereas', 'the', 'best', 'unaltered', 'stateoftheart', 'approach', 'reached', 'an', 'f1', 'score', 'of', '072', 'furthermore', 'our', 'approach', 'can', 'be', 'used', 'to', 'analyze', 'the', 'detected', 'anomalies', 'in', 'terms', 'of', 'which', 'event', 'within', 'one', 'execution', 'of', 'the', 'process', 'causes', 'the', 'anomaly']] | [-0.05170813686478808, -0.0057915561951242915, -0.0683923185040739, 0.050224062692013925, -0.07965748222432469, -0.09364281445226852, 0.07339873012440776, 0.38327995613427956, -0.2060036771868159, -0.38192067716514044, 0.13215764076858477, -0.2912473007802613, -0.18160136907019808, 0.22260774044441667, -0.11894552673718625, 0.04923405909405357, 0.12231246738849048, 0.07340026389802783, -0.04441797036745459, -0.32297569770546136, 0.270511853770732, 0.07334660256665256, 0.33256340922375943, 0.09233998628473611, 0.07661995572276675, -0.046040001520114816, -0.06243530652677668, -0.0064176189474499405, -0.04016503279130138, 0.13638836020795655, 0.2876317541327926, 0.2027294294334683, 0.2782792177065346, -0.4012642013021375, -0.19173721437595187, 0.10048609339496374, 0.13664808487238822, 0.07064120168900047, -0.00726720748444956, -0.36792510248084165, 0.07843831107113979, -0.1845747240556956, -0.03770047859124952, -0.12266531576117004, -0.01761112267551616, -0.04536959778835725, -0.2630987429055947, 0.07856051787504711, 0.06839954332289422, 0.0925549771870725, -0.026317744886727265, -0.12836716764363174, 0.048046486380851676, 0.1388758990431588, 0.06882256024163778, 0.032233776862793904, 0.16599179107471176, -0.14140347491051233, -0.20573486224748194, 0.37870153387886796, -0.09172131922142814, -0.1585528012751204, 0.2132606930579129, -0.06713934971608138, -0.1751959164786017, 0.10446281754996758, 0.20989656810421758, 0.1439351701346137, -0.20124600428488837, 0.0166141203395208, 0.01093499688548621, 0.16280223270316593, 0.06382664094700484, -0.031897674114607165, 0.19218674561783353, 0.2340426752071748, -0.00020833384367314415, 0.10442625702506203, -0.11671765918033807, -0.0750483207559054, -0.2514279943068357, -0.13427152909132553, -0.1592215838135412, -0.01937444317116561, -0.07718278395539108, -0.12431879103740667, 0.40095713031220825, 0.26316973506168806, 0.1857182323328926, 0.03562143017320271, 0.3214461772922595, 0.05979667940053003, 0.08110750718340605, 0.09157943160942376, 0.23082125717165633, -0.01901331030525005, 0.131128245117564, -0.1817870714711072, 0.1289885605442052, -0.006291505753123506] |
1,803.01093 | Building Maps in Collective Variable Space | Enhanced sampling techniques such as umbrella sampling and metadynamics are
now routinely used to provide information on how the thermodynamic potential,
or free energy, depends on a small number of collective variables. The free
energy surfaces that one extracts by using these techniques provide a
simplified or coarse-grained representation of the configurational ensemble. In
this work we discuss how auxiliary variables can be mapped in collective
variable (CV) space and how the dependence of the average value of a function
of the atomic coordinates on the value of a small number of CVs can thus be
visualised. We show that these maps allow one to analyse both the physics of
the molecular system under investigation and the quality of the reduced
representation of the system that is encoded in a set of CVs. We apply this
approach to analyse the degeneracy of CVs and to compute entropy and enthalpy
surfaces in CV space both for conformational transitions in alanine dipeptide
and for phase transitions in carbon dioxide molecular crystals under pressure.
| physics.comp-ph cond-mat.stat-mech physics.chem-ph | enhanced sampling techniques such as umbrella sampling and metadynamics are now routinely used to provide information on how the thermodynamic potential or free energy depends on a small number of collective variables the free energy surfaces that one extracts by using these techniques provide a simplified or coarsegrained representation of the configurational ensemble in this work we discuss how auxiliary variables can be mapped in collective variable cv space and how the dependence of the average value of a function of the atomic coordinates on the value of a small number of cvs can thus be visualised we show that these maps allow one to analyse both the physics of the molecular system under investigation and the quality of the reduced representation of the system that is encoded in a set of cvs we apply this approach to analyse the degeneracy of cvs and to compute entropy and enthalpy surfaces in cv space both for conformational transitions in alanine dipeptide and for phase transitions in carbon dioxide molecular crystals under pressure | [['enhanced', 'sampling', 'techniques', 'such', 'as', 'umbrella', 'sampling', 'and', 'metadynamics', 'are', 'now', 'routinely', 'used', 'to', 'provide', 'information', 'on', 'how', 'the', 'thermodynamic', 'potential', 'or', 'free', 'energy', 'depends', 'on', 'a', 'small', 'number', 'of', 'collective', 'variables', 'the', 'free', 'energy', 'surfaces', 'that', 'one', 'extracts', 'by', 'using', 'these', 'techniques', 'provide', 'a', 'simplified', 'or', 'coarsegrained', 'representation', 'of', 'the', 'configurational', 'ensemble', 'in', 'this', 'work', 'we', 'discuss', 'how', 'auxiliary', 'variables', 'can', 'be', 'mapped', 'in', 'collective', 'variable', 'cv', 'space', 'and', 'how', 'the', 'dependence', 'of', 'the', 'average', 'value', 'of', 'a', 'function', 'of', 'the', 'atomic', 'coordinates', 'on', 'the', 'value', 'of', 'a', 'small', 'number', 'of', 'cvs', 'can', 'thus', 'be', 'visualised', 'we', 'show', 'that', 'these', 'maps', 'allow', 'one', 'to', 'analyse', 'both', 'the', 'physics', 'of', 'the', 'molecular', 'system', 'under', 'investigation', 'and', 'the', 'quality', 'of', 'the', 'reduced', 'representation', 'of', 'the', 'system', 'that', 'is', 'encoded', 'in', 'a', 'set', 'of', 'cvs', 'we', 'apply', 'this', 'approach', 'to', 'analyse', 'the', 'degeneracy', 'of', 'cvs', 'and', 'to', 'compute', 'entropy', 'and', 'enthalpy', 'surfaces', 'in', 'cv', 'space', 'both', 'for', 'conformational', 'transitions', 'in', 'alanine', 'dipeptide', 'and', 'for', 'phase', 'transitions', 'in', 'carbon', 'dioxide', 'molecular', 'crystals', 'under', 'pressure']] | [-0.08885166354542762, 0.15807321339665928, -0.10553005745100696, 0.06760353259184011, -0.005681234145705855, -0.08084485487881721, 0.1106871778189003, 0.3677564046470917, -0.2756127415971057, -0.31356456857555876, 0.08992785413760408, -0.2404127012892648, -0.13772576356753272, 0.18946548826633053, -0.039501872041660266, 0.03936716081160638, 0.05212077567468218, 0.024753599818755072, -0.06707093915738688, -0.22836276407187467, 0.3083851483448991, 0.02950013236126356, 0.2549932123875322, 0.014136786917796391, 0.10991495774857352, 0.015380075948305389, 0.019528768101587282, 0.028697570609214733, -0.14860704508183725, 0.13865344617951508, 0.24039959492929802, 0.12562172857728618, 0.23847156106249282, -0.42608655392933004, -0.24191717595973036, 0.10774067771070969, 0.13548646204456774, 0.11573547047524772, -0.01103551154997069, -0.22006921952710165, 0.039692096956814936, -0.15006404205317997, -0.09918087074868054, -0.15854755058143918, -0.02519092849341401, 0.07244430916187794, -0.2270517693015567, 0.07724710599906003, 0.010165515246839202, 0.07606708348935677, -0.09215885545099863, -0.1135597035836167, -0.060152379805440005, 0.12346790331737166, 0.028892646218263353, 0.02939708493935892, 0.1874693460321348, -0.12204119918543889, -0.07600066399784508, 0.39233522490756206, -0.06724258041150911, -0.22378020906243581, 0.19083764939977413, -0.11398759294214131, -0.15840589200358904, 0.12987167439123953, 0.1674732574907115, 0.1224882998149733, -0.1543842628462055, 0.050717095629998335, 0.002421626194151478, 0.1901240854044799, 0.0330518069350275, 0.06056304273538684, 0.19478736375867015, 0.13375379019879807, 0.044518158071244145, 0.17494840599318737, -0.1322995601221919, -0.12309192466326276, -0.26461315901176624, -0.2186401012239226, -0.207091680134249, 0.03755253236686364, -0.07627431375647852, -0.1660093526432171, 0.3942935364320874, 0.16243996899860927, 0.20042408728966632, -0.02113840546546101, 0.25216627090472227, 0.10816732165139857, 0.04292769183279478, 0.03767945631870139, 0.19235227415637707, 0.10224307905501354, 0.06616266669803544, -0.24995218374363382, 0.056122259185132056, 0.057361954470486406] |
1,803.01094 | SpeechPy - A Library for Speech Processing and Recognition | SpeechPy is an open source Python package that contains speech preprocessing
techniques, speech features, and important post-processing operations. It
provides most frequent used speech features including MFCCs and filterbank
energies alongside with the log-energy of filter-banks. The aim of the package
is to provide researchers with a simple tool for speech feature extraction and
processing purposes in applications such as Automatic Speech Recognition and
Speaker Verification.
| cs.SD eess.AS | speechpy is an open source python package that contains speech preprocessing techniques speech features and important postprocessing operations it provides most frequent used speech features including mfccs and filterbank energies alongside with the logenergy of filterbanks the aim of the package is to provide researchers with a simple tool for speech feature extraction and processing purposes in applications such as automatic speech recognition and speaker verification | [['speechpy', 'is', 'an', 'open', 'source', 'python', 'package', 'that', 'contains', 'speech', 'preprocessing', 'techniques', 'speech', 'features', 'and', 'important', 'postprocessing', 'operations', 'it', 'provides', 'most', 'frequent', 'used', 'speech', 'features', 'including', 'mfccs', 'and', 'filterbank', 'energies', 'alongside', 'with', 'the', 'logenergy', 'of', 'filterbanks', 'the', 'aim', 'of', 'the', 'package', 'is', 'to', 'provide', 'researchers', 'with', 'a', 'simple', 'tool', 'for', 'speech', 'feature', 'extraction', 'and', 'processing', 'purposes', 'in', 'applications', 'such', 'as', 'automatic', 'speech', 'recognition', 'and', 'speaker', 'verification']] | [-0.010399179038358852, -0.04044400391535419, -0.08842537375448956, 0.04568442541130935, -0.12557039250532398, -0.2702578727839864, -0.08488681040762458, 0.4722361979074776, -0.26034928929766465, -0.29723795216796134, 0.1246267325241206, -0.2906332696948084, -0.1796280498674605, 0.32630986893491354, -0.10537125982955331, 0.1435676994969981, 0.169620913475228, 0.07754074560625668, 0.014957431361835916, -0.20358835712431755, 0.1860546873358544, 0.08609815192176029, 0.3206474878534209, 0.03190499966876814, 0.07673697511927458, 0.007692384184338152, -0.13814516452112002, -0.18286291172989877, -0.025062048622771727, 0.16121351133915596, 0.47577917292073835, 0.30710215473663993, 0.272379411268048, -0.33871485250710975, -0.17775168817024678, 0.02064533598786511, 0.1457711603034113, 0.14889509076238028, -0.1076807953795651, -0.3634124417549174, 0.06776816387719009, -0.1551382525358349, 0.05543201552791288, -0.14062403960269876, 0.03477572379051708, -0.024058422357484233, -0.29163252291618846, 0.030272026589955203, 0.1470278606575448, 0.193441795068793, -0.0014583535776182543, -0.13321234220347833, 0.04733146152830159, 0.22898081994935637, 0.02685965762793785, 0.0587411222531955, 0.1540183095548855, -0.16732573012586727, -0.12029900003108196, 0.427526643674355, -0.09635327158321161, -0.18455353025638033, 0.2522615814523306, 0.0918689394275134, -0.21619555601500906, 0.08750729667553969, 0.23266794229857624, 0.05564232613687636, -0.23446065686584916, 0.0341877496066445, 0.09811662481661187, 0.2780380765834707, 0.0877138520590961, 0.04383228175720433, 0.169635898724664, 0.2303747185796965, -0.031599772002664395, 0.2082867509452626, -0.14462349312088918, 0.07426073896931484, -0.22703918046317995, -0.13117956116911955, -0.17435111186932772, -0.10357885299345071, -0.0785817209389279, -0.19886072597000748, 0.44609153567580506, 0.22389148161164485, 0.10054949218465481, 0.021766950372693827, 0.39782758890942205, 0.04136398864466173, 0.15770844244980253, 0.09535923019575421, 0.06096065657766303, 0.017181594317776216, 0.15037897086585872, -0.13448939767658885, 0.07546112351701595, 0.06858560784894507] |
1,803.01095 | Matrix-product structure of constacyclic codes over finite chain rings
$\mathbb{F}_{p^m}[u]/\langle u^e\rangle$ | Let $m,e$ be positive integers, $p$ a prime number, $\mathbb{F}_{p^m}$ be a
finite field of $p^m$ elements and $R=\mathbb{F}_{p^m}[u]/\langle u^e\rangle$
which is a finite chain ring. For any $\omega\in R^\times$ and positive
integers $k, n$ satisfying ${\rm gcd}(p,n)=1$, we prove that any $(1+\omega
u)$-constacyclic code of length $p^kn$ over $R$ is monomially equivalent to a
matrix-product code of a nested sequence of $p^k$ cyclic codes with length $n$
over $R$ and a $p^k\times p^k$ matrix $A_{p^k}$ over $\mathbb{F}_p$. Using the
matrix-product structures, we give an iterative construction of every
$(1+\omega u)$-constacyclic code by $(1+\omega u)$-constacyclic codes of
shorter lengths over $R$.
| cs.IT math.IT | let me be positive integers p a prime number mathbbf_pm be a finite field of pm elements and rmathbbf_pmulangle uerangle which is a finite chain ring for any omegain rtimes and positive integers k n satisfying rm gcdpn1 we prove that any 1omega uconstacyclic code of length pkn over r is monomially equivalent to a matrixproduct code of a nested sequence of pk cyclic codes with length n over r and a pktimes pk matrix a_pk over mathbbf_p using the matrixproduct structures we give an iterative construction of every 1omega uconstacyclic code by 1omega uconstacyclic codes of shorter lengths over r | [['let', 'me', 'be', 'positive', 'integers', 'p', 'a', 'prime', 'number', 'mathbbf_pm', 'be', 'a', 'finite', 'field', 'of', 'pm', 'elements', 'and', 'rmathbbf_pmulangle', 'uerangle', 'which', 'is', 'a', 'finite', 'chain', 'ring', 'for', 'any', 'omegain', 'rtimes', 'and', 'positive', 'integers', 'k', 'n', 'satisfying', 'rm', 'gcdpn1', 'we', 'prove', 'that', 'any', '1omega', 'uconstacyclic', 'code', 'of', 'length', 'pkn', 'over', 'r', 'is', 'monomially', 'equivalent', 'to', 'a', 'matrixproduct', 'code', 'of', 'a', 'nested', 'sequence', 'of', 'pk', 'cyclic', 'codes', 'with', 'length', 'n', 'over', 'r', 'and', 'a', 'pktimes', 'pk', 'matrix', 'a_pk', 'over', 'mathbbf_p', 'using', 'the', 'matrixproduct', 'structures', 'we', 'give', 'an', 'iterative', 'construction', 'of', 'every', '1omega', 'uconstacyclic', 'code', 'by', '1omega', 'uconstacyclic', 'codes', 'of', 'shorter', 'lengths', 'over', 'r']] | [-0.2797914212292964, 0.1577570647300085, -0.08705756208850163, -0.0012270103065794942, -0.0020312636826731413, -0.24037246563757705, -0.04931853517848482, 0.3348215790926525, -0.327673186446623, -0.147556251048636, 0.04645616953067555, -0.24834379555639063, -0.02897182083458151, 0.22017801691326175, -0.0006250824853040204, -0.004753054293693219, 0.02251882254985152, 0.11881631714208882, -0.11397884066659256, -0.30467102324387224, 0.2478809544705961, 0.024000406611046875, 0.10951535374336498, -0.013609750733173701, 0.08099162509252253, 0.03218998488426061, 0.026471908766739438, 0.014217946740641895, -0.24201942060759699, 0.029300820110089117, 0.3055479722443304, 0.14587718207564315, 0.24379967038962289, -0.30539375889699416, -0.16275738351396285, 0.2035139563797724, 0.17483510251968434, 0.027888456593488924, 0.056019635652053625, -0.19453572852555479, 0.25494481186096624, -0.2120267524981023, -0.07284179433608556, 0.01020253371530314, 0.1551028101089512, 0.026283458852679423, -0.36986403168169874, -0.05033289382492404, 0.06764390066007872, 0.17612906029023748, 0.006462937241678338, -0.21247409310855783, 0.019694652537455653, 0.020495216850892152, -0.07122504956891189, 0.1310151981461867, 0.008771139274853844, 0.05383964205658672, -0.07525101242388718, 0.3104224791842522, -0.12005149025359366, -0.19011863633658332, 0.004315409666425226, -0.11077956606790719, -0.059554602044846604, 0.19393219996133063, 0.0984286405791593, 0.17146007607847746, 0.041498232684455495, 0.25939826343478267, -0.1437062554264275, 0.23433929447564159, 0.1164426619537396, 0.0055145458110820245, 0.1371421085320192, 0.003999394304574338, 0.06683085177417633, 0.10260382992455201, 0.009559736821090452, 0.04008335110242709, -0.33510912460560843, -0.17032073658809185, -0.16997216073888363, 0.19444790322997488, -0.1671569648374271, -0.19499255256210962, 0.34682367985496426, 0.04177766199320266, 0.15531756781447348, 0.17174994079326972, 0.19411189392633219, 0.02466706865430247, 0.09300151290798486, 0.1554759516251633, -0.0901537743941097, 0.20836920040892437, -0.08355353602973542, -0.2174736433524159, -0.01067319833258591, 0.16091563159341712] |
1,803.01096 | Stable spin domains in a non-degenerate ultra-cold gas | We study the stability of two-domain spin structures in an ultra-cold gas of
magnetically trapped $^{87}$Rb atoms above quantum degeneracy. Adding a small
effective magnetic field gradient stabilizes the domains via coherent
collective spin rotation effects, despite negligibly perturbing the potential
energy relative to the thermal energy. We demonstrate that domain stabilization
is accomplished through decoupling the dynamics of longitudinal magnetization,
which remains in time-independent domains, from transverse magnetization, which
undergoes a purely transverse spin wave trapped within the domain wall. We
explore the effect of temperature and density on the steady-state domains, and
compare our results to a hydrodynamic solution to a quantum Boltzmann equation.
| cond-mat.quant-gas physics.atom-ph | we study the stability of twodomain spin structures in an ultracold gas of magnetically trapped 87rb atoms above quantum degeneracy adding a small effective magnetic field gradient stabilizes the domains via coherent collective spin rotation effects despite negligibly perturbing the potential energy relative to the thermal energy we demonstrate that domain stabilization is accomplished through decoupling the dynamics of longitudinal magnetization which remains in timeindependent domains from transverse magnetization which undergoes a purely transverse spin wave trapped within the domain wall we explore the effect of temperature and density on the steadystate domains and compare our results to a hydrodynamic solution to a quantum boltzmann equation | [['we', 'study', 'the', 'stability', 'of', 'twodomain', 'spin', 'structures', 'in', 'an', 'ultracold', 'gas', 'of', 'magnetically', 'trapped', '87rb', 'atoms', 'above', 'quantum', 'degeneracy', 'adding', 'a', 'small', 'effective', 'magnetic', 'field', 'gradient', 'stabilizes', 'the', 'domains', 'via', 'coherent', 'collective', 'spin', 'rotation', 'effects', 'despite', 'negligibly', 'perturbing', 'the', 'potential', 'energy', 'relative', 'to', 'the', 'thermal', 'energy', 'we', 'demonstrate', 'that', 'domain', 'stabilization', 'is', 'accomplished', 'through', 'decoupling', 'the', 'dynamics', 'of', 'longitudinal', 'magnetization', 'which', 'remains', 'in', 'timeindependent', 'domains', 'from', 'transverse', 'magnetization', 'which', 'undergoes', 'a', 'purely', 'transverse', 'spin', 'wave', 'trapped', 'within', 'the', 'domain', 'wall', 'we', 'explore', 'the', 'effect', 'of', 'temperature', 'and', 'density', 'on', 'the', 'steadystate', 'domains', 'and', 'compare', 'our', 'results', 'to', 'a', 'hydrodynamic', 'solution', 'to', 'a', 'quantum', 'boltzmann', 'equation']] | [-0.18620745329030366, 0.23369152003249596, -0.0533172554723075, 0.013478656041321679, -0.03675535822919798, -0.06753414253405524, 0.035215966965792316, 0.36470024831338244, -0.30194842269784716, -0.23955086182873203, 0.036318791659004146, -0.2509902181666134, -0.047632165749574885, 0.184533517508996, 0.04382667554331557, 0.023742825047657738, 0.02825307770728854, -0.011283126712407707, -0.07057377553483436, -0.15603950396531596, 0.32059556860828176, 0.006211589352460578, 0.30762728138053613, 0.08164862845145729, 0.12313660811896454, -0.003287551187998549, 0.11498202014723266, 0.041779632047521616, -0.15979419240349396, 0.051828360984558765, 0.1666623477072824, -0.06021109181631989, 0.22656877921402174, -0.4730741267777839, -0.2410850556718871, 0.0658948328785317, 0.16715251438496503, 0.2445934832970313, -0.07836195416990141, -0.2969968896139554, -0.014928045058798677, -0.1471110439314595, -0.18259213607811, -0.15481005958720762, -0.001086748094201299, 0.0072241101725870425, -0.24488396869691195, 0.1518306733833358, 0.08460468046164266, 0.08230979517453683, -0.1368211200680443, -0.04847893135991158, -0.056733557254291266, 0.03470882940773835, 0.043061867242081546, 0.06396170289756484, 0.21983009847847498, -0.16224521419191557, -0.10547419941000077, 0.3422490863463367, -0.12169519333028288, -0.19486168820305533, 0.1879681012338414, -0.17361478338387074, -0.021499816288749845, 0.14150152576841274, 0.17564922022053375, 0.11179154743616171, -0.12311873277034259, 0.09064931749203682, 0.01220305015474123, 0.19111719347958295, 0.06485014607831133, 0.019178675475556684, 0.26031569103306196, 0.18275681093229718, 0.06230492727119335, 0.19473694409199832, -0.1313766279271013, -0.16480091640743305, -0.24409564071387616, -0.12441672103530024, -0.22273461353736665, 0.08179957384860279, -0.0659977426696986, -0.1580633246120206, 0.4153383135233285, 0.14410509663406937, 0.18109011458549298, -0.05521360382587069, 0.3209479059496859, 0.10451861761426905, 0.03523803913508946, 0.07012002047959645, 0.26852648832257575, 0.20244855987444027, 0.12282231822170599, -0.3657776336734763, -0.01901067298274698, 0.009175211817184288] |
1,803.01097 | A Many-Objective Evolutionary Algorithm With Two Interacting Processes:
Cascade Clustering and Reference Point Incremental Learning | Researches have shown difficulties in obtaining proximity while maintaining
diversity for many-objective optimization problems. Complexities of the true
Pareto front pose challenges for the reference vector-based algorithms for
their insufficient adaptability to the diverse characteristics with no priori.
This paper proposes a many-objective optimization algorithm with two
interacting processes: cascade clustering and reference point incremental
learning (CLIA). In the population selection process based on cascade
clustering (CC), using the reference vectors provided by the process based on
incremental learning, the nondominated and the dominated individuals are
clustered and sorted with different manners in a cascade style and are selected
by round-robin for better proximity and diversity. In the reference vector
adaptation process based on reference point incremental learning, using the
feedbacks from the process based on CC, proper distribution of reference points
is gradually obtained by incremental learning. Experimental studies on several
benchmark problems show that CLIA is competitive compared with the
state-of-the-art algorithms and has impressive efficiency and versatility using
only the interactions between the two processes without incurring extra
evaluations.
| cs.NE | researches have shown difficulties in obtaining proximity while maintaining diversity for manyobjective optimization problems complexities of the true pareto front pose challenges for the reference vectorbased algorithms for their insufficient adaptability to the diverse characteristics with no priori this paper proposes a manyobjective optimization algorithm with two interacting processes cascade clustering and reference point incremental learning clia in the population selection process based on cascade clustering cc using the reference vectors provided by the process based on incremental learning the nondominated and the dominated individuals are clustered and sorted with different manners in a cascade style and are selected by roundrobin for better proximity and diversity in the reference vector adaptation process based on reference point incremental learning using the feedbacks from the process based on cc proper distribution of reference points is gradually obtained by incremental learning experimental studies on several benchmark problems show that clia is competitive compared with the stateoftheart algorithms and has impressive efficiency and versatility using only the interactions between the two processes without incurring extra evaluations | [['researches', 'have', 'shown', 'difficulties', 'in', 'obtaining', 'proximity', 'while', 'maintaining', 'diversity', 'for', 'manyobjective', 'optimization', 'problems', 'complexities', 'of', 'the', 'true', 'pareto', 'front', 'pose', 'challenges', 'for', 'the', 'reference', 'vectorbased', 'algorithms', 'for', 'their', 'insufficient', 'adaptability', 'to', 'the', 'diverse', 'characteristics', 'with', 'no', 'priori', 'this', 'paper', 'proposes', 'a', 'manyobjective', 'optimization', 'algorithm', 'with', 'two', 'interacting', 'processes', 'cascade', 'clustering', 'and', 'reference', 'point', 'incremental', 'learning', 'clia', 'in', 'the', 'population', 'selection', 'process', 'based', 'on', 'cascade', 'clustering', 'cc', 'using', 'the', 'reference', 'vectors', 'provided', 'by', 'the', 'process', 'based', 'on', 'incremental', 'learning', 'the', 'nondominated', 'and', 'the', 'dominated', 'individuals', 'are', 'clustered', 'and', 'sorted', 'with', 'different', 'manners', 'in', 'a', 'cascade', 'style', 'and', 'are', 'selected', 'by', 'roundrobin', 'for', 'better', 'proximity', 'and', 'diversity', 'in', 'the', 'reference', 'vector', 'adaptation', 'process', 'based', 'on', 'reference', 'point', 'incremental', 'learning', 'using', 'the', 'feedbacks', 'from', 'the', 'process', 'based', 'on', 'cc', 'proper', 'distribution', 'of', 'reference', 'points', 'is', 'gradually', 'obtained', 'by', 'incremental', 'learning', 'experimental', 'studies', 'on', 'several', 'benchmark', 'problems', 'show', 'that', 'clia', 'is', 'competitive', 'compared', 'with', 'the', 'stateoftheart', 'algorithms', 'and', 'has', 'impressive', 'efficiency', 'and', 'versatility', 'using', 'only', 'the', 'interactions', 'between', 'the', 'two', 'processes', 'without', 'incurring', 'extra', 'evaluations']] | [-0.05497420178109999, 0.0070694245945881395, -0.08019922556225484, 0.05521723403794835, -0.08590973443143038, -0.16393386158195106, 0.09108967340126743, 0.45078042631640153, -0.26953835681299954, -0.33873057510320315, 0.0822060703245156, -0.2557446590843884, -0.14417238544453592, 0.17832675463903477, -0.07762790707980885, 0.10044218518921887, 0.12599655145724467, -0.0002930068698547342, -0.054032575059682134, -0.2585740398629295, 0.3346616091417138, 0.0844793884699945, 0.35908740214620005, -0.04281632677405415, 0.13884411900276866, 0.002814429141033222, -0.07479059473912725, 0.01477277475188363, -0.05485950116883888, 0.15108289187500143, 0.2746421997613438, 0.21023483562064083, 0.34423094882958516, -0.3987462920575019, -0.19945635640007608, 0.0971707351587932, 0.1659612344468341, 0.07712279373423798, -0.09480466204489965, -0.3059743862927837, 0.09000225846231093, -0.10913356244444217, -0.0002633629722849411, -0.06803177814307514, -0.02186267242547782, 0.07319720977376325, -0.29922962650256096, 0.046699778713724195, 0.03684019770007581, 0.06569205722497666, -0.058352498493759945, -0.1829412035727942, 0.021776055133737187, 0.13179080637226648, 0.04033462394864353, 0.035280957085984374, 0.14425816732349203, -0.13151409786934143, -0.2103379447643152, 0.3819020186057862, -0.045787484853473656, -0.23016833690883634, 0.2353915208357862, -0.01042948317275766, -0.1256576043108533, 0.15474739434087978, 0.20045026416996467, 0.09772577805389815, -0.16199859777492853, 0.04068595916614868, 0.0357172744211686, 0.13137949400697835, 0.04009631927577121, 0.005378878592540893, 0.15514589167638299, 0.24639869467081393, 0.06823010326993159, 0.11754614038748995, -0.06474583372062839, -0.14774787289857427, -0.2147940410657183, -0.08170800101121559, -0.17808558408390074, -0.0600095322355628, -0.14249755725656596, -0.1437832382382647, 0.359627843494801, 0.1857317597413545, 0.20726597318014897, 0.0744799621444305, 0.34296561461626823, 0.05801554095746456, 0.049748402120381154, 0.1042535786927842, 0.22554451609304285, 0.020747393318999777, 0.11365495994002284, -0.21206457379876692, 0.14037298780749552, 0.056272091722006305] |
1,803.01098 | Storage-Efficient Shared Memory Emulation | We study the design of storage-efficient algorithms for emulating atomic
shared memory over an asynchronous, distributed message-passing system. Our
first algorithm is an atomic single-writer multi-reader algorithm based on a
novel erasure-coding technique, termed \emph{multi-version code}. Next, we
propose an extension of our single-writer algorithm to a multi-writer
multi-reader environment. Our second algorithm combines replication and
multi-version code, and is suitable in situations where we expect a large
number of concurrent writes. Moreover, when the number of concurrent writes is
bounded, we propose a simplified variant of the second algorithm that has a
simple structure similar to the single-writer algorithm.
Let $N$ be the number of servers, and the shared memory variable be of size 1
unit. Our algorithms have the following properties:
(i) The write operation terminates if the number of server failures is
bounded by a parameter $f$. The algorithms also guarantee the termination of
the read as long as the number of writes concurrent with the read is smaller
than a design parameter $\nu$, and the number of server failures is bounded by
$f$.
(ii) The overall storage size for the first algorithm, and the steady-state
storage size for the second algorithm, are all $N/\lceil \frac{N-2f}{\nu}
\rceil$ units. Moreover, our simplified variant of the second algorithm
achieves the worst-case storage cost of $N/\lceil \frac{N-2f}{\nu} \rceil$,
asymptotically matching a lower bound by Cadambe et al. for $N \gg f, \nu \le
f+1$.
(iii) The write and read operations only consist of a small number (2 to 3)
of communication rounds.
(iv) For all algorithms, the server maintains a simple data structure. A
server only needs to store the information associated with the latest value it
observes, similar to replication-based algorithms.
| cs.DC | we study the design of storageefficient algorithms for emulating atomic shared memory over an asynchronous distributed messagepassing system our first algorithm is an atomic singlewriter multireader algorithm based on a novel erasurecoding technique termed emphmultiversion code next we propose an extension of our singlewriter algorithm to a multiwriter multireader environment our second algorithm combines replication and multiversion code and is suitable in situations where we expect a large number of concurrent writes moreover when the number of concurrent writes is bounded we propose a simplified variant of the second algorithm that has a simple structure similar to the singlewriter algorithm let n be the number of servers and the shared memory variable be of size 1 unit our algorithms have the following properties i the write operation terminates if the number of server failures is bounded by a parameter f the algorithms also guarantee the termination of the read as long as the number of writes concurrent with the read is smaller than a design parameter nu and the number of server failures is bounded by f ii the overall storage size for the first algorithm and the steadystate storage size for the second algorithm are all nlceil fracn2fnu rceil units moreover our simplified variant of the second algorithm achieves the worstcase storage cost of nlceil fracn2fnu rceil asymptotically matching a lower bound by cadambe et al for n gg f nu le f1 iii the write and read operations only consist of a small number 2 to 3 of communication rounds iv for all algorithms the server maintains a simple data structure a server only needs to store the information associated with the latest value it observes similar to replicationbased algorithms | [['we', 'study', 'the', 'design', 'of', 'storageefficient', 'algorithms', 'for', 'emulating', 'atomic', 'shared', 'memory', 'over', 'an', 'asynchronous', 'distributed', 'messagepassing', 'system', 'our', 'first', 'algorithm', 'is', 'an', 'atomic', 'singlewriter', 'multireader', 'algorithm', 'based', 'on', 'a', 'novel', 'erasurecoding', 'technique', 'termed', 'emphmultiversion', 'code', 'next', 'we', 'propose', 'an', 'extension', 'of', 'our', 'singlewriter', 'algorithm', 'to', 'a', 'multiwriter', 'multireader', 'environment', 'our', 'second', 'algorithm', 'combines', 'replication', 'and', 'multiversion', 'code', 'and', 'is', 'suitable', 'in', 'situations', 'where', 'we', 'expect', 'a', 'large', 'number', 'of', 'concurrent', 'writes', 'moreover', 'when', 'the', 'number', 'of', 'concurrent', 'writes', 'is', 'bounded', 'we', 'propose', 'a', 'simplified', 'variant', 'of', 'the', 'second', 'algorithm', 'that', 'has', 'a', 'simple', 'structure', 'similar', 'to', 'the', 'singlewriter', 'algorithm', 'let', 'n', 'be', 'the', 'number', 'of', 'servers', 'and', 'the', 'shared', 'memory', 'variable', 'be', 'of', 'size', '1', 'unit', 'our', 'algorithms', 'have', 'the', 'following', 'properties', 'i', 'the', 'write', 'operation', 'terminates', 'if', 'the', 'number', 'of', 'server', 'failures', 'is', 'bounded', 'by', 'a', 'parameter', 'f', 'the', 'algorithms', 'also', 'guarantee', 'the', 'termination', 'of', 'the', 'read', 'as', 'long', 'as', 'the', 'number', 'of', 'writes', 'concurrent', 'with', 'the', 'read', 'is', 'smaller', 'than', 'a', 'design', 'parameter', 'nu', 'and', 'the', 'number', 'of', 'server', 'failures', 'is', 'bounded', 'by', 'f', 'ii', 'the', 'overall', 'storage', 'size', 'for', 'the', 'first', 'algorithm', 'and', 'the', 'steadystate', 'storage', 'size', 'for', 'the', 'second', 'algorithm', 'are', 'all', 'nlceil', 'fracn2fnu', 'rceil', 'units', 'moreover', 'our', 'simplified', 'variant', 'of', 'the', 'second', 'algorithm', 'achieves', 'the', 'worstcase', 'storage', 'cost', 'of', 'nlceil', 'fracn2fnu', 'rceil', 'asymptotically', 'matching', 'a', 'lower', 'bound', 'by', 'cadambe', 'et', 'al', 'for', 'n', 'gg', 'f', 'nu', 'le', 'f1', 'iii', 'the', 'write', 'and', 'read', 'operations', 'only', 'consist', 'of', 'a', 'small', 'number', '2', 'to', '3', 'of', 'communication', 'rounds', 'iv', 'for', 'all', 'algorithms', 'the', 'server', 'maintains', 'a', 'simple', 'data', 'structure', 'a', 'server', 'only', 'needs', 'to', 'store', 'the', 'information', 'associated', 'with', 'the', 'latest', 'value', 'it', 'observes', 'similar', 'to', 'replicationbased', 'algorithms']] | [-0.187638042900185, 0.07741657239993105, -0.03051833166260152, -0.002674818020163765, -0.05810081617953423, -0.2309035229368142, 0.11189836454594435, 0.336393047987874, -0.2887103231089677, -0.34671200117543605, 0.10041333127251115, -0.23355027374988388, -0.09674458908698251, 0.1758316815413508, -0.09938948002195747, 0.059245933795274375, 0.045625023799093015, 0.07768573529107035, -0.0017582814673989958, -0.32416500402274406, 0.21991212486446332, 0.07352422199489075, 0.2359443502133465, -0.014986236322684527, 0.08411317401837665, 0.02467353316941916, -0.0026365672321622944, -0.011813026361583021, -0.09276544609066707, 0.08523682530094806, 0.2193792782336687, 0.21806179715894616, 0.31821121998618634, -0.42568440836233395, -0.09728320401185275, 0.1105252047885947, 0.13854650730737836, 0.09296939105399855, -0.009484743988592058, -0.22028455017868923, 0.1448215352284545, -0.18133584941947234, -0.04508766278417574, -0.054595090558178266, 0.0350370810896669, 0.035964760500403606, -0.3329525670978845, -0.0171062208051371, 0.0766774532268338, 0.007831696584473588, 0.0045591054390782095, -0.0973989173663967, 0.030830755425069654, 0.10436232671724535, -0.05677070732371995, 0.06145839962739444, 0.11000037211240486, -0.07513707423562645, -0.1448612464608551, 0.3508756299985917, -0.03482204387207494, -0.16187334835435863, 0.13201514379485213, -0.040715387809560986, -0.17490038061748162, 0.13572497722274693, 0.17425720736519584, 0.1411227864951002, -0.10505300279904706, 0.12556996382814647, -0.07608992060626386, 0.23124735891872408, 0.0701626950940017, 0.04573812095471741, 0.08485645216707755, 0.20607573112830066, 0.10893574577241329, 0.15963701813608594, -0.07534661237171293, -0.07157644922164932, -0.2822784238418157, -0.18547509793850583, -0.22794740219136506, 0.004145613474284022, -0.12094307654943254, -0.1514027185844905, 0.35016576282172646, 0.14701798259811374, 0.19296688411808757, 0.14619584254399742, 0.3588355478987525, 0.0596560250740752, 0.0834518069677609, 0.20324193046338135, 0.0991357041724814, 0.058954730381234464, 0.09669150007403819, -0.2198504248177499, 0.10830996607640578, 0.07102101067439728] |
1,803.01099 | Temporo-Spatial Collaborative Filtering for Parameter Estimation in
Noisy DCE-MRI Sequences: Application to Breast Cancer Chemotherapy Response | Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is a minimally
invasive imaging technique which can be used for characterizing tumor biology
and tumor response to radiotherapy. Pharmacokinetic (PK) estimation is widely
used for DCE-MRI data analysis to extract quantitative parameters relating to
microvascu- lature characteristics of the cancerous tissues. Unavoidable noise
corruption during DCE-MRI data acquisition has a large effect on the accuracy
of PK estimation. In this paper, we propose a general denoising paradigm called
gather- noise attenuation and reduce (GNR) and a novel temporal-spatial
collaborative filtering (TSCF) denoising technique for DCE-MRI data. TSCF takes
advantage of temporal correlation in DCE-MRI, as well as anatomical spatial
similar- ity to collaboratively filter noisy DCE-MRI data. The proposed TSCF
denoising algorithm decreases the PK parameter normalized estimation error by
57% and improves the structural similarity of PK parameter estimation by 86%
com- pared to baseline without denoising, while being an order of magnitude
faster than state-of-the-art denoising methods. TSCF improves the univariate
linear regression (ULR) c-statistic value for early prediction of pathologic
response up to 18%, and shows complete separation of pathologic complete
response (pCR) and non-pCR groups on a challenge dataset.
| eess.IV | dynamic contrastenhanced magnetic resonance imaging dcemri is a minimally invasive imaging technique which can be used for characterizing tumor biology and tumor response to radiotherapy pharmacokinetic pk estimation is widely used for dcemri data analysis to extract quantitative parameters relating to microvascu lature characteristics of the cancerous tissues unavoidable noise corruption during dcemri data acquisition has a large effect on the accuracy of pk estimation in this paper we propose a general denoising paradigm called gather noise attenuation and reduce gnr and a novel temporalspatial collaborative filtering tscf denoising technique for dcemri data tscf takes advantage of temporal correlation in dcemri as well as anatomical spatial similar ity to collaboratively filter noisy dcemri data the proposed tscf denoising algorithm decreases the pk parameter normalized estimation error by 57 and improves the structural similarity of pk parameter estimation by 86 com pared to baseline without denoising while being an order of magnitude faster than stateoftheart denoising methods tscf improves the univariate linear regression ulr cstatistic value for early prediction of pathologic response up to 18 and shows complete separation of pathologic complete response pcr and nonpcr groups on a challenge dataset | [['dynamic', 'contrastenhanced', 'magnetic', 'resonance', 'imaging', 'dcemri', 'is', 'a', 'minimally', 'invasive', 'imaging', 'technique', 'which', 'can', 'be', 'used', 'for', 'characterizing', 'tumor', 'biology', 'and', 'tumor', 'response', 'to', 'radiotherapy', 'pharmacokinetic', 'pk', 'estimation', 'is', 'widely', 'used', 'for', 'dcemri', 'data', 'analysis', 'to', 'extract', 'quantitative', 'parameters', 'relating', 'to', 'microvascu', 'lature', 'characteristics', 'of', 'the', 'cancerous', 'tissues', 'unavoidable', 'noise', 'corruption', 'during', 'dcemri', 'data', 'acquisition', 'has', 'a', 'large', 'effect', 'on', 'the', 'accuracy', 'of', 'pk', 'estimation', 'in', 'this', 'paper', 'we', 'propose', 'a', 'general', 'denoising', 'paradigm', 'called', 'gather', 'noise', 'attenuation', 'and', 'reduce', 'gnr', 'and', 'a', 'novel', 'temporalspatial', 'collaborative', 'filtering', 'tscf', 'denoising', 'technique', 'for', 'dcemri', 'data', 'tscf', 'takes', 'advantage', 'of', 'temporal', 'correlation', 'in', 'dcemri', 'as', 'well', 'as', 'anatomical', 'spatial', 'similar', 'ity', 'to', 'collaboratively', 'filter', 'noisy', 'dcemri', 'data', 'the', 'proposed', 'tscf', 'denoising', 'algorithm', 'decreases', 'the', 'pk', 'parameter', 'normalized', 'estimation', 'error', 'by', '57', 'and', 'improves', 'the', 'structural', 'similarity', 'of', 'pk', 'parameter', 'estimation', 'by', '86', 'com', 'pared', 'to', 'baseline', 'without', 'denoising', 'while', 'being', 'an', 'order', 'of', 'magnitude', 'faster', 'than', 'stateoftheart', 'denoising', 'methods', 'tscf', 'improves', 'the', 'univariate', 'linear', 'regression', 'ulr', 'cstatistic', 'value', 'for', 'early', 'prediction', 'of', 'pathologic', 'response', 'up', 'to', '18', 'and', 'shows', 'complete', 'separation', 'of', 'pathologic', 'complete', 'response', 'pcr', 'and', 'nonpcr', 'groups', 'on', 'a', 'challenge', 'dataset']] | [-0.013713379425587513, -0.00689410263419299, -0.05845513679112198, 0.07422072702758414, -0.08866366664193676, -0.16180121819538776, -0.01368476767612431, 0.37949194625941335, -0.23271524258739046, -0.3581455156497497, 0.09693112533404341, -0.28009695006955054, -0.19322287541894262, 0.1951355802305844, -0.14610642379760663, 0.1332641233885986, 0.0824617220699707, 0.010351438781932516, -0.02548716643885259, -0.2273514120406421, 0.19376904366572978, 0.07405896889989674, 0.3564823207205101, -0.01951452622926163, 0.12896024226711722, 0.05820295759301473, -0.07507617187327004, 0.0022768483832678807, -0.09436103540237352, 0.10121759033126015, 0.3319861329841598, 0.1740451411648293, 0.32628811418419323, -0.36634549583178216, -0.25685069883011924, 0.11859854370085222, 0.1683400523637907, 0.09008295025228352, -0.002549975791255072, -0.31921653983293363, 0.08007734057353309, -0.10435110361500573, 0.009224868504711057, -0.1358350405553406, -0.014015512607906575, -0.042139223800854435, -0.3776321702746935, 0.19122947368430354, 0.026220984527245365, 0.12055069701095182, -0.08047264519332838, -0.14238609841171032, 0.04445082435549627, 0.1374303476198987, 0.00671441357467644, 0.09038061017210605, 0.19373619972517894, -0.1681093211218174, -0.09845414687472556, 0.3159718232865255, -0.0743339827196749, -0.17876745019889168, 0.14409619867701523, -0.07349364565164652, -0.1112857885365825, 0.19542808064524966, 0.23585427499886963, 0.07414499483282819, -0.17830628937520887, -0.014468302473961626, 0.05581141584953393, 0.22666826679293686, 0.07160782459522447, -0.024947642457298434, 0.06678227567544548, 0.25359819691768415, 0.05454629924403684, 0.1296711724535662, -0.20399777535649558, 0.015736881055824097, -0.16351531121018592, -0.11628873209639262, -0.16460398761480446, -0.025149693591795582, -0.14754507130826197, -0.17831304726085714, 0.4255296086431831, 0.1845778271615986, 0.17941708009569876, 0.07094080066270826, 0.37657178386542645, 0.03504177929848553, 0.08911450485879134, -0.00679014835842154, 0.16219738238961787, 0.10683727688188732, 0.1091245809051719, -0.24580026465538207, 0.10466352751809022, -0.0027024576425432197] |
1,803.011 | Shannon Entropy Quantum Entanglement Criterion and the Generalized
Uncertainty Principle | We examine quantum gravity effects by applying the generalized uncertainty
principle (GUP) to entropic uncertainty relation conditions on quantum
entanglement. In particular, we study the GUP corrections to the Shannon
entropic uncertainty condition for entanglement. As in an earlier paper [Blado,
Herrera, Erwin arxiv:1706.10013 [quant-ph]] which dealt with variance
relations, there is an increase in the upper bound for the entanglement
condition upon the application of the generalized uncertainty principle.
Fundamental concepts of the generalized uncertainty principle, entanglement and
the entropic uncertainty relations are also discussed.
| quant-ph | we examine quantum gravity effects by applying the generalized uncertainty principle gup to entropic uncertainty relation conditions on quantum entanglement in particular we study the gup corrections to the shannon entropic uncertainty condition for entanglement as in an earlier paper blado herrera erwin arxiv170610013 quantph which dealt with variance relations there is an increase in the upper bound for the entanglement condition upon the application of the generalized uncertainty principle fundamental concepts of the generalized uncertainty principle entanglement and the entropic uncertainty relations are also discussed | [['we', 'examine', 'quantum', 'gravity', 'effects', 'by', 'applying', 'the', 'generalized', 'uncertainty', 'principle', 'gup', 'to', 'entropic', 'uncertainty', 'relation', 'conditions', 'on', 'quantum', 'entanglement', 'in', 'particular', 'we', 'study', 'the', 'gup', 'corrections', 'to', 'the', 'shannon', 'entropic', 'uncertainty', 'condition', 'for', 'entanglement', 'as', 'in', 'an', 'earlier', 'paper', 'blado', 'herrera', 'erwin', 'arxiv170610013', 'quantph', 'which', 'dealt', 'with', 'variance', 'relations', 'there', 'is', 'an', 'increase', 'in', 'the', 'upper', 'bound', 'for', 'the', 'entanglement', 'condition', 'upon', 'the', 'application', 'of', 'the', 'generalized', 'uncertainty', 'principle', 'fundamental', 'concepts', 'of', 'the', 'generalized', 'uncertainty', 'principle', 'entanglement', 'and', 'the', 'entropic', 'uncertainty', 'relations', 'are', 'also', 'discussed']] | [-0.11617588687555067, 0.19398443768157103, -0.12231249051235084, 0.17240216495009095, -0.05882961163020116, -0.13011862186803705, 0.06973294040099495, 0.2440665190529433, -0.2665573357316178, -0.2900878968870356, 0.06291463885350995, -0.2830165827957292, -0.12713141229358457, 0.21393269185154212, -0.16726463777013123, 0.13115901067448293, 0.020236133958124333, 0.0557003834955616, -0.0786504122107068, -0.22270605440384575, 0.3554606268853171, 0.1056436409915997, 0.3360906699894085, 0.1284130934315423, 0.1155367592637915, 0.0201473913801324, 0.01324547337190736, 0.056806144304573536, -0.2745735436855328, 0.18367477334547966, 0.21367465047764458, 0.1267199240392074, 0.27209020796276273, -0.35900957647356246, -0.2543601335491985, 0.10139318012321989, 0.04778683978864657, 0.14256064880256808, 0.038983688526232504, -0.31741115504077505, -0.07311331754594687, -0.23946615723183468, -0.11331335409167445, -0.030643583153418842, 0.025966701319529897, -0.08272712804388166, -0.2214698665692205, 0.19210427482522346, 0.12454169612222661, 0.0407250698048128, -0.01609845511016569, -0.06291424359993211, 0.04391518272902994, 0.05699842864470113, 0.04759988794934803, -0.04338593956726115, 0.09986399980594537, -0.03936959600209126, -0.1663007765808808, 0.34555031993382035, -0.014797853760509974, -0.24107308244510067, 0.04004518900598798, -0.08889899469379868, -0.20515170485513018, -0.05229740395831565, 0.12247574163068618, 0.024599809546045782, -0.18940516542975924, 0.09838407432280724, 0.007724488076443474, 0.13608794207019465, 0.11358011798334441, 0.12026276359600681, 0.14244779303858413, 0.03257627778276358, 0.07332026471738659, 0.21339206519492326, -0.02867121037395139, -0.17725147845755732, -0.3950697810034312, -0.19069848742704684, -0.20762360407527358, 0.049170950771353784, -0.17393712452706364, -0.06638756022169089, 0.24011747790722265, 0.18023087577672586, 0.06986600938918335, 0.06581879344109136, 0.24842943151348404, 0.1967658124007617, 0.029647867062262127, 0.025415204049620246, 0.3381467832562824, 0.22986208679919531, 0.021497311378230473, -0.28290337242097374, 0.05209466471292433, 0.12645978075618455] |
1,803.01101 | Weak and Strong Solutions to the Forced Fractional Euler Alignment
System | We consider a hydrodynamic model of self-organized evolution of agents, with
singular interaction kernel $\phi_\alpha(x)=1/|x|^{1+\alpha}$ ($0<\alpha<2$),
in the presence of an additional external force. Well-posedness results are
already available for the unforced system in classical regularity spaces. We
define a notion of solution in larger function spaces, in particular in
$L^\infty$ ("weak solutions") and in $W^{1,\infty}$ ("strong solutions"), and
we discuss existence and uniqueness of these solutions. Furthermore, we show
that several important properties of classical solutions carry over to these
less regular ones. In particular, we give Onsager-type criteria for the
validity of the natural energy law for weak solutions of the system, and we
show that fast alignment (weak and strong solutions) and flocking (strong
solutions) still occur in the forceless case.
| math.AP | we consider a hydrodynamic model of selforganized evolution of agents with singular interaction kernel phi_alphax1x1alpha 0alpha2 in the presence of an additional external force wellposedness results are already available for the unforced system in classical regularity spaces we define a notion of solution in larger function spaces in particular in linfty weak solutions and in w1infty strong solutions and we discuss existence and uniqueness of these solutions furthermore we show that several important properties of classical solutions carry over to these less regular ones in particular we give onsagertype criteria for the validity of the natural energy law for weak solutions of the system and we show that fast alignment weak and strong solutions and flocking strong solutions still occur in the forceless case | [['we', 'consider', 'a', 'hydrodynamic', 'model', 'of', 'selforganized', 'evolution', 'of', 'agents', 'with', 'singular', 'interaction', 'kernel', 'phi_alphax1x1alpha', '0alpha2', 'in', 'the', 'presence', 'of', 'an', 'additional', 'external', 'force', 'wellposedness', 'results', 'are', 'already', 'available', 'for', 'the', 'unforced', 'system', 'in', 'classical', 'regularity', 'spaces', 'we', 'define', 'a', 'notion', 'of', 'solution', 'in', 'larger', 'function', 'spaces', 'in', 'particular', 'in', 'linfty', 'weak', 'solutions', 'and', 'in', 'w1infty', 'strong', 'solutions', 'and', 'we', 'discuss', 'existence', 'and', 'uniqueness', 'of', 'these', 'solutions', 'furthermore', 'we', 'show', 'that', 'several', 'important', 'properties', 'of', 'classical', 'solutions', 'carry', 'over', 'to', 'these', 'less', 'regular', 'ones', 'in', 'particular', 'we', 'give', 'onsagertype', 'criteria', 'for', 'the', 'validity', 'of', 'the', 'natural', 'energy', 'law', 'for', 'weak', 'solutions', 'of', 'the', 'system', 'and', 'we', 'show', 'that', 'fast', 'alignment', 'weak', 'and', 'strong', 'solutions', 'and', 'flocking', 'strong', 'solutions', 'still', 'occur', 'in', 'the', 'forceless', 'case']] | [-0.18382211245279606, 0.03293357480836929, -0.056534583088712856, 0.12969635394172835, -0.04210329784049851, -0.11551222816628755, -0.005598842901116634, 0.3483790988255231, -0.27932204029782387, -0.23592799890511593, 0.13452956803547617, -0.2690847091659232, -0.15604744814183624, 0.18232140825778917, -0.0397352492055077, 0.06856246198313769, 0.07220236757067872, 0.015776926426400172, -0.0564881104090419, -0.2125253442056538, 0.3690203363228528, -0.03254829916614489, 0.2495579734963716, 0.05100764925057282, 0.087354346216641, -0.011282872880015095, 0.02703614569780585, 0.05020020369318177, -0.2020043606043757, 0.07661637234297337, 0.1970449395875683, 0.08706253654671571, 0.29896230692593534, -0.45324371339844877, -0.19131628920507357, 0.1481797080257999, 0.12848179632813106, 0.11972638095164152, -0.07499933475628495, -0.2761647730787117, 0.1378560228999437, -0.14810553822880151, -0.19996014424431763, -0.1340765508700956, 0.031979839096120635, 0.12571116395248863, -0.2860039739800831, 0.11721218318571566, 0.1283961038570851, 0.049734262711383766, -0.19452805454522126, -0.037596013181323766, 0.020886869290003888, 0.08577010933630412, 0.0922806596948353, -0.0323777767279964, 0.018136529057271412, -0.19491259861340532, -0.07388216864745148, 0.3392052599324341, -0.10689076940437443, -0.24514794830599282, 0.25444815548320043, -0.15641978731546857, -0.14256380139239377, 0.08416124135561165, 0.16968920219643804, 0.14713773931898835, -0.11834003357980095, 0.11399162884087867, -0.058045179231977856, 0.14555741654953264, 0.06982537609769306, 0.07558184679307532, 0.10801272343111332, 0.1289143956106034, 0.14375620800620098, 0.15397425189224972, -0.005801172812515107, -0.139472700146859, -0.33975627816083737, -0.15005600092680665, -0.10068521811245162, 0.07495699815459733, -0.1275999586541133, -0.19021966254059988, 0.3485871876483081, 0.18252809618153137, 0.15592999136615468, 0.06475177120234145, 0.22422825678473063, 0.12548133170758907, -0.004288250421343007, 0.07439998291875617, 0.28513105981983244, 0.1084569274127239, 0.13293099495273114, -0.17898831765556739, 0.027130745397117295, 0.12284376411164394] |
1,803.01102 | The LABOCA/ACT Survey of Clusters at All Redshifts: multi-wavelength
analysis of background submillimeter galaxies | We present a multi-wavelength analysis of 48 submillimeter galaxies (SMGs)
detected in the LABOCA/ACT Survey of Clusters at All Redshifts, LASCAR, which
acquired new 870 $\mu$m and ATCA 2.1 GHz observations of ten galaxy clusters
detected through their Sunyaev-Zel'dovich effect (SZE) signal by the Atacama
Cosmology Telescope. Far-infrared observations were also conducted with the
PACS (100/160 $\mu$m) and SPIRE (250/350/500 $\mu$m) instruments on $Herschel$
for sample subsets of five and six clusters. LASCAR 870 $\mu$m, maps were
reduced using a multi-scale iterative pipeline that removes the SZE increment
signal, yielding point-source sensitivities of
$\sigma\sim2\rm{\,mJy\,beam}^{-1}$. We detect in total 49 sources at the
$4\sigma$ level, and conduct a detailed multi-wavelength analysis considering
our new radio and far-IR observations plus existing near-IR and optical data.
One source is identified as a foreground galaxy, 28 SMGs are matched to single
radio sources, 4 have double radio counterparts, and 16 are undetected at 2.1
GHz but tentatively associated in some cases to near-IR/optical sources. We
estimate photometric redshifts for 34 sources with secure (25) and tentative
(9) matches at different wavelengths, obtaining a median $z=2.8^{+2.1}_{-1.7}$.
Compared to previous results for single-dish surveys, our redshift distribution
has a comparatively larger fraction of sources at $z>3$ and the high-redshift
tail is more extended. This is consistent with millimeter spectroscopic
confirmation of a growing number of high-$z$ SMGs and relevant for testing of
cosmological models. Analytical lens modeling is applied to estimate
magnification factors for 42 SMGs at cluster-centric radii $>1.2$'; with the
demagnified flux densities and source-plane areas, we obtain integral number
counts that agree with previous submillimeter surveys.
| astro-ph.GA | we present a multiwavelength analysis of 48 submillimeter galaxies smgs detected in the labocaact survey of clusters at all redshifts lascar which acquired new 870 mum and atca 21 ghz observations of ten galaxy clusters detected through their sunyaevzeldovich effect sze signal by the atacama cosmology telescope farinfrared observations were also conducted with the pacs 100160 mum and spire 250350500 mum instruments on herschel for sample subsets of five and six clusters lascar 870 mum maps were reduced using a multiscale iterative pipeline that removes the sze increment signal yielding pointsource sensitivities of sigmasim2rmmjybeam1 we detect in total 49 sources at the 4sigma level and conduct a detailed multiwavelength analysis considering our new radio and farir observations plus existing nearir and optical data one source is identified as a foreground galaxy 28 smgs are matched to single radio sources 4 have double radio counterparts and 16 are undetected at 21 ghz but tentatively associated in some cases to neariroptical sources we estimate photometric redshifts for 34 sources with secure 25 and tentative 9 matches at different wavelengths obtaining a median z2821_17 compared to previous results for singledish surveys our redshift distribution has a comparatively larger fraction of sources at z3 and the highredshift tail is more extended this is consistent with millimeter spectroscopic confirmation of a growing number of highz smgs and relevant for testing of cosmological models analytical lens modeling is applied to estimate magnification factors for 42 smgs at clustercentric radii 12 with the demagnified flux densities and sourceplane areas we obtain integral number counts that agree with previous submillimeter surveys | [['we', 'present', 'a', 'multiwavelength', 'analysis', 'of', '48', 'submillimeter', 'galaxies', 'smgs', 'detected', 'in', 'the', 'labocaact', 'survey', 'of', 'clusters', 'at', 'all', 'redshifts', 'lascar', 'which', 'acquired', 'new', '870', 'mum', 'and', 'atca', '21', 'ghz', 'observations', 'of', 'ten', 'galaxy', 'clusters', 'detected', 'through', 'their', 'sunyaevzeldovich', 'effect', 'sze', 'signal', 'by', 'the', 'atacama', 'cosmology', 'telescope', 'farinfrared', 'observations', 'were', 'also', 'conducted', 'with', 'the', 'pacs', '100160', 'mum', 'and', 'spire', '250350500', 'mum', 'instruments', 'on', 'herschel', 'for', 'sample', 'subsets', 'of', 'five', 'and', 'six', 'clusters', 'lascar', '870', 'mum', 'maps', 'were', 'reduced', 'using', 'a', 'multiscale', 'iterative', 'pipeline', 'that', 'removes', 'the', 'sze', 'increment', 'signal', 'yielding', 'pointsource', 'sensitivities', 'of', 'sigmasim2rmmjybeam1', 'we', 'detect', 'in', 'total', '49', 'sources', 'at', 'the', '4sigma', 'level', 'and', 'conduct', 'a', 'detailed', 'multiwavelength', 'analysis', 'considering', 'our', 'new', 'radio', 'and', 'farir', 'observations', 'plus', 'existing', 'nearir', 'and', 'optical', 'data', 'one', 'source', 'is', 'identified', 'as', 'a', 'foreground', 'galaxy', '28', 'smgs', 'are', 'matched', 'to', 'single', 'radio', 'sources', '4', 'have', 'double', 'radio', 'counterparts', 'and', '16', 'are', 'undetected', 'at', '21', 'ghz', 'but', 'tentatively', 'associated', 'in', 'some', 'cases', 'to', 'neariroptical', 'sources', 'we', 'estimate', 'photometric', 'redshifts', 'for', '34', 'sources', 'with', 'secure', '25', 'and', 'tentative', '9', 'matches', 'at', 'different', 'wavelengths', 'obtaining', 'a', 'median', 'z2821_17', 'compared', 'to', 'previous', 'results', 'for', 'singledish', 'surveys', 'our', 'redshift', 'distribution', 'has', 'a', 'comparatively', 'larger', 'fraction', 'of', 'sources', 'at', 'z3', 'and', 'the', 'highredshift', 'tail', 'is', 'more', 'extended', 'this', 'is', 'consistent', 'with', 'millimeter', 'spectroscopic', 'confirmation', 'of', 'a', 'growing', 'number', 'of', 'highz', 'smgs', 'and', 'relevant', 'for', 'testing', 'of', 'cosmological', 'models', 'analytical', 'lens', 'modeling', 'is', 'applied', 'to', 'estimate', 'magnification', 'factors', 'for', '42', 'smgs', 'at', 'clustercentric', 'radii', '12', 'with', 'the', 'demagnified', 'flux', 'densities', 'and', 'sourceplane', 'areas', 'we', 'obtain', 'integral', 'number', 'counts', 'that', 'agree', 'with', 'previous', 'submillimeter', 'surveys']] | [-0.04668452772367835, 0.05180956328359361, -0.048572810083770984, 0.08457510392853203, -0.09535117904530264, -0.078986086711386, 0.06995837896113069, 0.474097656520294, -0.05720174041791604, -0.3729376347717614, 0.10777681512946191, -0.3653069490280289, 9.591880997714515e-05, 0.21019506922367817, 0.024768338751835893, 0.0007675325811410753, 0.05727630799385504, -0.20238653943703797, -0.007058497859879236, -0.2953947731889247, 0.23462427396040697, 0.12970303132270392, 0.19784931664650615, -0.0627650382277352, 0.10818886317429133, -0.13767840977346238, -0.2094425980736, -0.007560079251456605, -0.15403657040156898, 0.03560666108768111, 0.30591695563697824, 0.1129334164237102, 0.20342512365179852, -0.2856699381093886, -0.2112416559104951, 0.07231604090282837, 0.16206690856757072, 0.03526581893272053, 0.006322480743703916, -0.32022540658318366, 0.09932644011949798, -0.14078663161490113, -0.15255097042894564, 0.08158505676815717, 0.022344682628262, 0.026847149375288818, -0.19108178353968608, 0.16311139873880445, -0.10123826124920295, 0.1536390644999651, -0.14505937993078707, -0.1827760647588338, -0.024395882548280776, 0.08375769262202085, -0.07663318693745308, 0.11481675406293317, 0.17586561838487305, -0.13546962151035236, -0.08645692436526028, 0.33874973035059297, -0.07484699381569114, 0.012698267359071626, 0.22624905021288075, -0.2134746042886176, -0.2795559195252001, 0.19707899299996476, 0.13790374254055607, 0.06161109094615452, -0.1780051791418093, -0.013909566408479944, -0.010016612146193019, 0.2906245021230111, 0.08791477827247805, 0.11894426217779536, 0.3177665575729826, 0.07325737291875367, 0.0629138632681973, 0.15342925691780132, -0.3378480852198733, 0.052873490277068835, -0.26027202079466616, -0.05186399966881324, -0.1469634480420679, 0.13896572237359717, -0.15521240754779472, -0.05794785506777071, 0.3163828846044243, 0.1372906272765249, 0.17375057172567512, 0.15590291607345885, 0.3284694241001629, 0.03780610437254207, 0.1416526921206801, 0.058868041774258015, 0.30060998149128865, 0.14168025976888693, 0.08580342462026658, -0.13735899056415432, -0.04039375522854523, -0.046392718709858644] |
1,803.01103 | Blow up analysis for Boltzmann-Poisson equation in Onsager's theory for
point vortices with multi-intensities | In this paper we consider the minimizing sequence for some energy functional
of an elliptic equation associated with the mean field limit of the point
vortex distribution one-sided Borel probability measure. If such a sequence
blows up, we derive some estimate which is related to the behavior of solution
near the blow-up point. Moreover, we study the two intensities case to consider
the sufficient condition for this estimate. Our main results are new for the
standard mean field equation as well.
| math.AP | in this paper we consider the minimizing sequence for some energy functional of an elliptic equation associated with the mean field limit of the point vortex distribution onesided borel probability measure if such a sequence blows up we derive some estimate which is related to the behavior of solution near the blowup point moreover we study the two intensities case to consider the sufficient condition for this estimate our main results are new for the standard mean field equation as well | [['in', 'this', 'paper', 'we', 'consider', 'the', 'minimizing', 'sequence', 'for', 'some', 'energy', 'functional', 'of', 'an', 'elliptic', 'equation', 'associated', 'with', 'the', 'mean', 'field', 'limit', 'of', 'the', 'point', 'vortex', 'distribution', 'onesided', 'borel', 'probability', 'measure', 'if', 'such', 'a', 'sequence', 'blows', 'up', 'we', 'derive', 'some', 'estimate', 'which', 'is', 'related', 'to', 'the', 'behavior', 'of', 'solution', 'near', 'the', 'blowup', 'point', 'moreover', 'we', 'study', 'the', 'two', 'intensities', 'case', 'to', 'consider', 'the', 'sufficient', 'condition', 'for', 'this', 'estimate', 'our', 'main', 'results', 'are', 'new', 'for', 'the', 'standard', 'mean', 'field', 'equation', 'as', 'well']] | [-0.12044857085946901, 0.05735403597286621, -0.08442060483251641, 0.1013095093658194, -0.03752977629824553, -0.08357337064880097, 0.024456343543140885, 0.33502508079012233, -0.3127645137058686, -0.25140438602524406, 0.14368781932474425, -0.2847742079814643, -0.11907351487977315, 0.18193605914999397, -0.0798310669782905, 0.06234505859111654, 0.04128051517002376, 0.10521836262656215, -0.05723021602557029, -0.19780432124173752, 0.4006794539544685, -0.013611865678319224, 0.24367976061033983, 0.06239002507559403, 0.10372303941942475, -0.01575620060522155, 0.008924975700929393, -0.00963689404953685, -0.2180258958991387, 0.07353961425201025, 0.18058826745614226, 0.07394204724488067, 0.2963632569061937, -0.3726406854657847, -0.19127604440084578, 0.18208090175104177, 0.12950569425169148, 0.09289720929716426, -0.06457650292388818, -0.2374623829677103, 0.1345699849124584, -0.10847241217327983, -0.22676381200873924, -0.040205077104339446, -0.01823918789015784, 0.10408635104626969, -0.2965091067469782, 0.07765283568382815, 0.06753629212767852, 0.037214412100981045, -0.12035008880344254, -0.09084191979886388, 0.037670218040821726, 0.12582230306356962, 0.08720419216717099, 0.07343746608778558, 0.0685303099108515, -0.13416057325508676, -0.058589844320567304, 0.35060409980791585, -0.1271609126440721, -0.2202896033126263, 0.12860464158663412, -0.16978622137074484, -0.12672657049893413, 0.11249607713479134, 0.16114028186801774, 0.14555975309584612, -0.1606501488957876, 0.06963485724258202, -0.06064818008446399, 0.11552600967654682, 0.06412026753511142, 0.017985599874346343, 0.15291108246202822, 0.1322150307672995, 0.1446508422585917, 0.15544939394407895, -0.10995910099468964, -0.12176021849621593, -0.3982596646212501, -0.19942421525900747, -0.15816529168758864, 0.09649107149043293, -0.09308441899095972, -0.19199252452839305, 0.37632986684732234, 0.16563900161166617, 0.21501854277915827, 0.12042264165615456, 0.2459726505395439, 0.2423901374208925, -0.036631361068295384, 0.09137569148277427, 0.1846475718826067, 0.14187822095118463, 0.049713750231873105, -0.2126055781867493, 0.003923522440693629, 0.10509913114623891] |
1,803.01104 | Laser map aided visual inertial localization in changing environment | Long-term visual localization in outdoor environment is a challenging
problem, especially faced with the cross-seasonal, bi-directional tasks and
changing environment. In this paper we propose a novel visual inertial
localization framework that localizes against the LiDAR-built map. Based on the
geometry information of the laser map, a hybrid bundle adjustment framework is
proposed, which estimates the poses of the cameras with respect to the prior
laser map as well as optimizes the state variables of the online visual
inertial odometry system simultaneously. For more accurate cross-modal data
association, the laser map is optimized using multi-session laser and visual
data to extract the salient and stable subset for localization. To validate the
efficiency of the proposed method, we collect data in south part of our campus
in different seasons, along the same and opposite-direction route. In all
sessions of localization data, our proposed method gives satisfactory results,
and shows the superiority of the hybrid bundle adjustment and map optimization.
| cs.RO | longterm visual localization in outdoor environment is a challenging problem especially faced with the crossseasonal bidirectional tasks and changing environment in this paper we propose a novel visual inertial localization framework that localizes against the lidarbuilt map based on the geometry information of the laser map a hybrid bundle adjustment framework is proposed which estimates the poses of the cameras with respect to the prior laser map as well as optimizes the state variables of the online visual inertial odometry system simultaneously for more accurate crossmodal data association the laser map is optimized using multisession laser and visual data to extract the salient and stable subset for localization to validate the efficiency of the proposed method we collect data in south part of our campus in different seasons along the same and oppositedirection route in all sessions of localization data our proposed method gives satisfactory results and shows the superiority of the hybrid bundle adjustment and map optimization | [['longterm', 'visual', 'localization', 'in', 'outdoor', 'environment', 'is', 'a', 'challenging', 'problem', 'especially', 'faced', 'with', 'the', 'crossseasonal', 'bidirectional', 'tasks', 'and', 'changing', 'environment', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'visual', 'inertial', 'localization', 'framework', 'that', 'localizes', 'against', 'the', 'lidarbuilt', 'map', 'based', 'on', 'the', 'geometry', 'information', 'of', 'the', 'laser', 'map', 'a', 'hybrid', 'bundle', 'adjustment', 'framework', 'is', 'proposed', 'which', 'estimates', 'the', 'poses', 'of', 'the', 'cameras', 'with', 'respect', 'to', 'the', 'prior', 'laser', 'map', 'as', 'well', 'as', 'optimizes', 'the', 'state', 'variables', 'of', 'the', 'online', 'visual', 'inertial', 'odometry', 'system', 'simultaneously', 'for', 'more', 'accurate', 'crossmodal', 'data', 'association', 'the', 'laser', 'map', 'is', 'optimized', 'using', 'multisession', 'laser', 'and', 'visual', 'data', 'to', 'extract', 'the', 'salient', 'and', 'stable', 'subset', 'for', 'localization', 'to', 'validate', 'the', 'efficiency', 'of', 'the', 'proposed', 'method', 'we', 'collect', 'data', 'in', 'south', 'part', 'of', 'our', 'campus', 'in', 'different', 'seasons', 'along', 'the', 'same', 'and', 'oppositedirection', 'route', 'in', 'all', 'sessions', 'of', 'localization', 'data', 'our', 'proposed', 'method', 'gives', 'satisfactory', 'results', 'and', 'shows', 'the', 'superiority', 'of', 'the', 'hybrid', 'bundle', 'adjustment', 'and', 'map', 'optimization']] | [-0.10929079846734362, -0.010876317517531495, -0.08641457673342477, 0.016166045076979864, -0.07030658334824107, -0.1524495780558115, 0.04201041868542351, 0.4391189451059026, -0.25528746439564615, -0.3227626415979748, 0.08199856546782558, -0.2606750389020289, -0.17241867302105793, 0.20619692026126768, -0.1548948629789295, 0.09188386082889573, 0.13069193580999008, 0.0240492386638277, -0.03577187277166353, -0.20481289563129745, 0.30274206130735337, 0.08371131255501701, 0.3615340115472434, 0.02502092766245046, 0.18368011318868208, 0.03250733504762813, -0.04900046083475313, -0.02829082197239322, -0.04278536004848936, 0.17179865331404032, 0.28791101558224086, 0.17285696472672205, 0.27613318031353334, -0.37508157182845375, -0.2311328465659772, 0.05581644591725161, 0.11296772191361074, 0.06922798742795544, -0.059865661706463735, -0.37504625589616836, 0.08303909518665845, -0.15010003939631486, -0.036793415476906025, -0.08732065213093114, -0.0003427416506794191, 0.016149493207734438, -0.31861456650038883, 0.020990795470894344, 0.01089417966488268, 0.06875807902204895, -0.11843123508677367, -0.03734292929256035, 0.005932043404168179, 0.1971166564031474, 0.02800163469397493, 0.08839815419332515, 0.16268274363941482, -0.13223900519041043, -0.1069901003070446, 0.39812144357110224, -0.08590233134586484, -0.19632782940903018, 0.19175757368155305, -0.07993116811398537, -0.10817737281622906, 0.13294697056163943, 0.20014748216396377, 0.15194004665414293, -0.14179227869176575, 0.0051468149969174015, -0.045020566132640646, 0.175224267907681, 0.017091846171646347, 0.013104882522396022, 0.1766817863144341, 0.25099728141100175, 0.09763382803047857, 0.1427396287608351, -0.17570697876865105, -0.08130862045912973, -0.24027870071511115, -0.12533644743389524, -0.15231141957168978, -0.07512207631502421, -0.08968853237231322, -0.10229534359588738, 0.43683842920487925, 0.252168225887562, 0.20365883188562528, 0.05850245254489803, 0.38161496402124967, 0.031095712680009102, 0.049580636602495946, 0.04879800748500612, 0.20153979231272975, 0.028116407984447096, 0.14425485193308804, -0.21420540743837915, 0.04294140733207666, 0.05672458341164935] |
1,803.01105 | Isochronous solutions of Einstein's equations and their Newtonian limit | It has been recently demonstrated that it is possible to construct
isochronous cosmologies, extending to general relativity a result valid for
non-relativistic Hamiltonian systems. In this paper we review these findings
and we discuss the Newtonian limit of these isochronous spacetimes, showing
that it reproduces the analogous findings in the context of non-relativistic
dynamics.
| gr-qc math-ph math.MP | it has been recently demonstrated that it is possible to construct isochronous cosmologies extending to general relativity a result valid for nonrelativistic hamiltonian systems in this paper we review these findings and we discuss the newtonian limit of these isochronous spacetimes showing that it reproduces the analogous findings in the context of nonrelativistic dynamics | [['it', 'has', 'been', 'recently', 'demonstrated', 'that', 'it', 'is', 'possible', 'to', 'construct', 'isochronous', 'cosmologies', 'extending', 'to', 'general', 'relativity', 'a', 'result', 'valid', 'for', 'nonrelativistic', 'hamiltonian', 'systems', 'in', 'this', 'paper', 'we', 'review', 'these', 'findings', 'and', 'we', 'discuss', 'the', 'newtonian', 'limit', 'of', 'these', 'isochronous', 'spacetimes', 'showing', 'that', 'it', 'reproduces', 'the', 'analogous', 'findings', 'in', 'the', 'context', 'of', 'nonrelativistic', 'dynamics']] | [-0.1383687183605852, 0.09122206172388461, -0.1288266353033207, 0.1275819428610029, -0.048433186072442264, -0.14950683736242354, -0.056421820054917284, 0.35968326183070465, -0.16844029165804386, -0.2639751868253505, 0.04725299447481693, -0.23225826540685915, -0.19528770436429316, 0.2418260637463795, -0.07926925491645104, 0.07332886241514373, 0.052460799649081846, 0.014580080537901571, -0.05483970209132639, -0.2576576510478777, 0.3453086844679934, 0.07956686115789192, 0.22667212591127114, 0.04819221645421176, 0.09459971445095208, -0.033528297363469996, 0.00033722700620139086, 0.0679556978866458, -0.18371432777456465, 0.06813183318202694, 0.26793749575261716, 0.10140943914841584, 0.20509345348303518, -0.37886614762936477, -0.2884916517435125, 0.06606864195351524, 0.1755761596788135, 0.23525470681488514, -0.06865099819239091, -0.28730307753991197, 0.06381573419397076, -0.2194532425729213, -0.24322368873766176, -0.13637985114905019, 0.07306920543864921, -0.028822831617651024, -0.17124560761644883, 0.06478305246370535, 0.13846138516372, -0.04020801314187271, -0.08335585210955253, -0.04511933425803565, 0.05782608768937213, 0.061781780492445385, 0.10731182681586317, 0.010500844869831646, 0.07604483520198199, -0.04916837628223692, -0.11079130566644448, 0.4391705471056479, -0.052928699822923926, -0.17028929010309554, 0.2093852298265254, -0.18298478603914933, -0.22179865176548008, 0.01595965893594203, 0.1120482486396752, 0.13140509098216338, -0.16726203503397605, 0.15548119335155072, -0.07921383440218589, 0.06698913836023873, 0.08103469062458586, 0.0153112584796165, 0.2205759107514664, 0.14961227892760048, 0.011962952428600855, 0.10259726691853117, 0.015386799841912257, -0.18017347133287262, -0.33364311143479963, -0.15427896551166972, -0.13560197440286478, 0.06979968457448261, -0.03947756848167585, -0.09917059172962413, 0.36430234161929953, 0.24599065424667466, 0.12029003702035104, 0.07271662899034305, 0.23112575816749423, 0.1300555511067311, 0.029951825496499187, 0.08009290199347392, 0.3442166663482095, 0.16306892347832522, 0.1027022626992591, -0.1957669122989669, -0.08249712181794974, 0.04608722258773115] |
1,803.01106 | Model-Based Stochastic Search for Large Scale Optimization of
Multi-Agent UAV Swarms | Recent work from the reinforcement learning community has shown that
Evolution Strategies are a fast and scalable alternative to other reinforcement
learning methods. In this paper we show that Evolution Strategies are a special
case of model-based stochastic search methods. This class of algorithms has
nice asymptotic convergence properties and known convergence rates. We show how
these methods can be used to solve both cooperative and competitive multi-agent
problems in an efficient manner. We demonstrate the effectiveness of this
approach on two complex multi-agent UAV swarm combat scenarios: where a team of
fixed wing aircraft must attack a well-defended base, and where two teams of
agents go head to head to defeat each other.
| cs.MA | recent work from the reinforcement learning community has shown that evolution strategies are a fast and scalable alternative to other reinforcement learning methods in this paper we show that evolution strategies are a special case of modelbased stochastic search methods this class of algorithms has nice asymptotic convergence properties and known convergence rates we show how these methods can be used to solve both cooperative and competitive multiagent problems in an efficient manner we demonstrate the effectiveness of this approach on two complex multiagent uav swarm combat scenarios where a team of fixed wing aircraft must attack a welldefended base and where two teams of agents go head to head to defeat each other | [['recent', 'work', 'from', 'the', 'reinforcement', 'learning', 'community', 'has', 'shown', 'that', 'evolution', 'strategies', 'are', 'a', 'fast', 'and', 'scalable', 'alternative', 'to', 'other', 'reinforcement', 'learning', 'methods', 'in', 'this', 'paper', 'we', 'show', 'that', 'evolution', 'strategies', 'are', 'a', 'special', 'case', 'of', 'modelbased', 'stochastic', 'search', 'methods', 'this', 'class', 'of', 'algorithms', 'has', 'nice', 'asymptotic', 'convergence', 'properties', 'and', 'known', 'convergence', 'rates', 'we', 'show', 'how', 'these', 'methods', 'can', 'be', 'used', 'to', 'solve', 'both', 'cooperative', 'and', 'competitive', 'multiagent', 'problems', 'in', 'an', 'efficient', 'manner', 'we', 'demonstrate', 'the', 'effectiveness', 'of', 'this', 'approach', 'on', 'two', 'complex', 'multiagent', 'uav', 'swarm', 'combat', 'scenarios', 'where', 'a', 'team', 'of', 'fixed', 'wing', 'aircraft', 'must', 'attack', 'a', 'welldefended', 'base', 'and', 'where', 'two', 'teams', 'of', 'agents', 'go', 'head', 'to', 'head', 'to', 'defeat', 'each', 'other']] | [-0.08582168914464228, 0.008071827855856422, -0.10856539173364903, 0.03320759919418467, -0.1274587379920964, -0.2080371661721605, 0.027088545552306536, 0.47177919778412425, -0.292018850997453, -0.2894349520638651, 0.09585803837012664, -0.2112889461965193, -0.2293886233453919, 0.18125068438981157, -0.16113999097369017, 0.08046968046377982, 0.09444492255477646, 0.02721715214934233, -0.012447328113052434, -0.2883684371919495, 0.28557209185308124, 0.025581247519405013, 0.2953577120582351, -0.01091689391440786, 0.1179993150681587, -0.04849119720551952, 0.011751689209213349, 0.061131475627241014, -0.11302429939214803, 0.1333993814588912, 0.3525450067940803, 0.20749413678257733, 0.3976784911896803, -0.4137328458966407, -0.190375692958004, 0.16185476099433527, 0.1977237861114657, 0.1302840043090086, -0.06178630463700675, -0.30805735763129405, 0.08465675236780888, -0.22538838669888478, -0.07335064051656333, -0.10861458537473748, -0.028023316776297526, 0.0681670294678976, -0.30053104565734357, -0.049840393566847906, 0.05379432790904446, 0.02993528916607652, -0.05248644455146473, -0.12393790074475769, 0.07857234047033486, 0.1486201738790337, 0.08180202949231705, -0.024283935142829356, 0.1629224458124192, -0.12983812519711796, -0.22884394272139905, 0.3648828110632907, -0.01534254381647416, -0.18870070947960546, 0.2527365265496537, -0.023246120867541933, -0.1931960986951877, 0.07845128333480386, 0.2728751344705182, 0.1993741772119038, -0.1655922141667884, 0.049953050716714194, -0.02466655806926763, 0.13521938770185266, 0.0135976221264068, -0.03928117177127737, 0.11828521929734873, 0.23144379787691002, 0.14727572232600203, 0.10795023462084015, -0.05213525037248248, -0.16179038981795804, -0.1812750552986971, -0.1158999411339781, -0.12408438583720574, -0.03383347597920987, -0.08723011423279407, -0.10312629023034216, 0.3434242525063785, 0.20429172122488376, 0.1433623248126061, 0.11192289345065314, 0.3735487052626842, 0.04622623780165362, 0.01600461985464661, 0.10888786241000073, 0.24550086854281217, 0.02860483914959879, 0.11812145387819778, -0.2285019094103832, 0.114351790300488, 0.035651046980535034] |
1,803.01107 | Audio-only Bird Species Automated Identification Method with Limited
Training Data Based on Multi-Channel Deep Convolutional Neural Networks | Based on the transfer learning, we design a bird species identification model
that uses the VGG-16 model (pretrained on ImageNet) for feature extraction,
then a classifier consisting of two fully-connected hidden layers and a Softmax
layer is attached. We compare the performance of the proposed model with the
original VGG16 model. The results show that the former has higher train
efficiency, but lower mean average precisions(MAP). To improve the MAP of the
proposed model, we investigate the result fusion mode to form multi-channel
identification model, the best MAP reaches 0.9998. The number of model
parameters is 13110, which is only 0.0082% of the VGG16 model. Also, the size
demand of sample is decreased.
| cs.SD eess.AS | based on the transfer learning we design a bird species identification model that uses the vgg16 model pretrained on imagenet for feature extraction then a classifier consisting of two fullyconnected hidden layers and a softmax layer is attached we compare the performance of the proposed model with the original vgg16 model the results show that the former has higher train efficiency but lower mean average precisionsmap to improve the map of the proposed model we investigate the result fusion mode to form multichannel identification model the best map reaches 09998 the number of model parameters is 13110 which is only 00082 of the vgg16 model also the size demand of sample is decreased | [['based', 'on', 'the', 'transfer', 'learning', 'we', 'design', 'a', 'bird', 'species', 'identification', 'model', 'that', 'uses', 'the', 'vgg16', 'model', 'pretrained', 'on', 'imagenet', 'for', 'feature', 'extraction', 'then', 'a', 'classifier', 'consisting', 'of', 'two', 'fullyconnected', 'hidden', 'layers', 'and', 'a', 'softmax', 'layer', 'is', 'attached', 'we', 'compare', 'the', 'performance', 'of', 'the', 'proposed', 'model', 'with', 'the', 'original', 'vgg16', 'model', 'the', 'results', 'show', 'that', 'the', 'former', 'has', 'higher', 'train', 'efficiency', 'but', 'lower', 'mean', 'average', 'precisionsmap', 'to', 'improve', 'the', 'map', 'of', 'the', 'proposed', 'model', 'we', 'investigate', 'the', 'result', 'fusion', 'mode', 'to', 'form', 'multichannel', 'identification', 'model', 'the', 'best', 'map', 'reaches', '09998', 'the', 'number', 'of', 'model', 'parameters', 'is', '13110', 'which', 'is', 'only', '00082', 'of', 'the', 'vgg16', 'model', 'also', 'the', 'size', 'demand', 'of', 'sample', 'is', 'decreased']] | [-0.037445960955145505, 0.008290746020585564, -0.04256926502525208, 0.010182955048678975, -0.05554648773977533, -0.19980685928021558, 0.058546628815487826, 0.3799172453582287, -0.24797822937502392, -0.33322601506785887, 0.044267419642502706, -0.2848001063684933, -0.1576616112724878, 0.168532253128043, -0.06248277839871922, 0.04307765348390343, 0.1317874317537644, 0.09443473285812486, -0.04708526415301354, -0.29162529609831317, 0.26889964149034185, 0.09570543959333529, 0.381297435777794, 0.005182819730959766, 0.1536366409522348, -0.041554926158694015, 0.013231355152259181, -0.06815189233748242, -0.06306128151546934, 0.14381948256050237, 0.15037269193063757, 0.13744839222636074, 0.2569770018204248, -0.35808738126453526, -0.24440214387141168, 0.09097843679981972, 0.1080284912022762, 0.09165811240485969, 0.015356495774800092, -0.25636788276564665, 0.11160645218166922, -0.20659297036140092, -0.010287897391078462, -0.06970601107293208, -0.04201707457624642, -0.011460014023344098, -0.3196129197271408, 0.05557377811653298, 0.10142972495772742, 0.01697222471661267, -0.1023176223617546, -0.1520336634452438, -0.06502019183244556, 0.13056891133809195, -0.005877895829533892, 0.057311420872533096, 0.15005009552364104, -0.2112251634909106, -0.09892576967208047, 0.3172335238362263, -0.11642875863305692, -0.20208942753587117, 0.19017402850399126, -0.041127137740009596, -0.1055484953103587, 0.09346592080380235, 0.23323237557945373, 0.10667017976187967, -0.12274999750245895, 0.014534092439134838, -0.11284904453246522, 0.24042117932445503, 0.02724627760056007, -0.052858596825639585, 0.12256486044290275, 0.3154284319332094, 0.010443767283244856, 0.19585164217486245, -0.20539816905927313, -0.08079683606047183, -0.22345132914883184, -0.11583598690672911, -0.18381040083347347, -0.03390918307871159, -0.11753708538253704, -0.11923206646627348, 0.43565703356164576, 0.23286497225022426, 0.25401100354169365, 0.11348303329370017, 0.31589920467896654, 0.08060529004017424, 0.13295276732605998, 0.09533430159873595, 0.23766253027133644, 0.06879962069381561, 0.05149063742386976, -0.1874119675568571, 0.07641024173270645, 0.11450907290730226] |
1,803.01108 | On the Study of Chaos and Memory Effects in the Bonhoeffer-van der Pol
Oscillator with a Non-Ideal Capacitor | In this paper, the voltage fluctuations of the Bonhoeffer van der pol
oscillator system with a non-ideal capacitor were investigated. Here, the
capacitor was modeled, using a fractional differential equation in which the
order of the fractional derivative is also a measure of the memory in the
dielectric. The governing fractional differential equation was derived using
two methods, namely a differential and integral approach. The former method
utilized a hierarchical resistor-capacitor (RC) ladder model while the latter
utilized the theory of the universal dielectric-response. The dynamical
behavior of the potential across the capacitor was found to be affected by this
parameter, and, therefore, the memory of the system. Additionally, findings
indicate that an increase in the memory parameter was associated with an
increase in the energy stored in the dielectric. It was found that oscillation
death resulted in a higher amount of stored energy in the dielectric over time,
as compared to behavior, which displayed relaxation oscillations or chaotic
fluctuations. The relatively-lower stored energy resulting from the latter
types of dynamical behavior appeared to be a consequence of the memory effect,
where present accumulations of energy in the capacitor are affected by previous
decreases in the potential. Hence, in this type of scenario, the dielectric
material can be thought of as remembering the past behavior of the voltage,
which leads to either a decrease, or an enhancement in the stored energy. The
non-ideal capacitor was also found to have a transitory nature, where it
behaves more like a resistor as {\alpha} approaches 0, and conversely, more
like a capacitor as {\alpha} goes to 1. Here, a decrease in {\alpha} was linked
to an enhanced metallic character of the dielectric.
| physics.data-an | in this paper the voltage fluctuations of the bonhoeffer van der pol oscillator system with a nonideal capacitor were investigated here the capacitor was modeled using a fractional differential equation in which the order of the fractional derivative is also a measure of the memory in the dielectric the governing fractional differential equation was derived using two methods namely a differential and integral approach the former method utilized a hierarchical resistorcapacitor rc ladder model while the latter utilized the theory of the universal dielectricresponse the dynamical behavior of the potential across the capacitor was found to be affected by this parameter and therefore the memory of the system additionally findings indicate that an increase in the memory parameter was associated with an increase in the energy stored in the dielectric it was found that oscillation death resulted in a higher amount of stored energy in the dielectric over time as compared to behavior which displayed relaxation oscillations or chaotic fluctuations the relativelylower stored energy resulting from the latter types of dynamical behavior appeared to be a consequence of the memory effect where present accumulations of energy in the capacitor are affected by previous decreases in the potential hence in this type of scenario the dielectric material can be thought of as remembering the past behavior of the voltage which leads to either a decrease or an enhancement in the stored energy the nonideal capacitor was also found to have a transitory nature where it behaves more like a resistor as alpha approaches 0 and conversely more like a capacitor as alpha goes to 1 here a decrease in alpha was linked to an enhanced metallic character of the dielectric | [['in', 'this', 'paper', 'the', 'voltage', 'fluctuations', 'of', 'the', 'bonhoeffer', 'van', 'der', 'pol', 'oscillator', 'system', 'with', 'a', 'nonideal', 'capacitor', 'were', 'investigated', 'here', 'the', 'capacitor', 'was', 'modeled', 'using', 'a', 'fractional', 'differential', 'equation', 'in', 'which', 'the', 'order', 'of', 'the', 'fractional', 'derivative', 'is', 'also', 'a', 'measure', 'of', 'the', 'memory', 'in', 'the', 'dielectric', 'the', 'governing', 'fractional', 'differential', 'equation', 'was', 'derived', 'using', 'two', 'methods', 'namely', 'a', 'differential', 'and', 'integral', 'approach', 'the', 'former', 'method', 'utilized', 'a', 'hierarchical', 'resistorcapacitor', 'rc', 'ladder', 'model', 'while', 'the', 'latter', 'utilized', 'the', 'theory', 'of', 'the', 'universal', 'dielectricresponse', 'the', 'dynamical', 'behavior', 'of', 'the', 'potential', 'across', 'the', 'capacitor', 'was', 'found', 'to', 'be', 'affected', 'by', 'this', 'parameter', 'and', 'therefore', 'the', 'memory', 'of', 'the', 'system', 'additionally', 'findings', 'indicate', 'that', 'an', 'increase', 'in', 'the', 'memory', 'parameter', 'was', 'associated', 'with', 'an', 'increase', 'in', 'the', 'energy', 'stored', 'in', 'the', 'dielectric', 'it', 'was', 'found', 'that', 'oscillation', 'death', 'resulted', 'in', 'a', 'higher', 'amount', 'of', 'stored', 'energy', 'in', 'the', 'dielectric', 'over', 'time', 'as', 'compared', 'to', 'behavior', 'which', 'displayed', 'relaxation', 'oscillations', 'or', 'chaotic', 'fluctuations', 'the', 'relativelylower', 'stored', 'energy', 'resulting', 'from', 'the', 'latter', 'types', 'of', 'dynamical', 'behavior', 'appeared', 'to', 'be', 'a', 'consequence', 'of', 'the', 'memory', 'effect', 'where', 'present', 'accumulations', 'of', 'energy', 'in', 'the', 'capacitor', 'are', 'affected', 'by', 'previous', 'decreases', 'in', 'the', 'potential', 'hence', 'in', 'this', 'type', 'of', 'scenario', 'the', 'dielectric', 'material', 'can', 'be', 'thought', 'of', 'as', 'remembering', 'the', 'past', 'behavior', 'of', 'the', 'voltage', 'which', 'leads', 'to', 'either', 'a', 'decrease', 'or', 'an', 'enhancement', 'in', 'the', 'stored', 'energy', 'the', 'nonideal', 'capacitor', 'was', 'also', 'found', 'to', 'have', 'a', 'transitory', 'nature', 'where', 'it', 'behaves', 'more', 'like', 'a', 'resistor', 'as', 'alpha', 'approaches', '0', 'and', 'conversely', 'more', 'like', 'a', 'capacitor', 'as', 'alpha', 'goes', 'to', '1', 'here', 'a', 'decrease', 'in', 'alpha', 'was', 'linked', 'to', 'an', 'enhanced', 'metallic', 'character', 'of', 'the', 'dielectric']] | [-0.13734532191259516, 0.12079432140550732, -0.0698654962702742, 0.021027046427015972, -0.024013685569313922, -0.13513703709822553, 0.029196994006823566, 0.31684102917737933, -0.28389682541635103, -0.3198852655680283, 0.07442445508702118, -0.2805036773122307, -0.1503017351783785, 0.20371249615825524, -0.04513186029077548, 0.009325932885063146, -0.02078614895404114, 0.06305435605927547, -0.04109920116488997, -0.20167581672253815, 0.2798628026595933, 0.08035310690858118, 0.2590816127797724, 0.029093182111746104, 0.06688435683263115, -0.053497071960853224, 0.01622240144280258, 0.07491445796145801, -0.09032752022028655, 0.06295286891627652, 0.2096517748668439, -0.010594913160974207, 0.2822835051312881, -0.44414484733209497, -0.22387477546673862, 0.07749187410640382, 0.1405382775672057, 0.10217366882631947, -0.027265611434194252, -0.25212249435329187, 0.03839506186963315, -0.2010936228916103, -0.13149243560526858, -0.022883737766845286, 0.04214112404936358, 0.06019345428322213, -0.24735843649208275, 0.11110066501756935, 0.0672204264452718, 0.004946510623415014, -0.09399801960376941, -0.07950075754079212, -0.03059648576637973, 0.08929110419336686, 0.028892802400177046, 0.030888223090964922, 0.14849698693707478, -0.12121677187531242, -0.08824829077618061, 0.34556334142478695, -0.08139194583181171, -0.17697112095387033, 0.1332516237280156, -0.14268805256342867, -0.05434338985841074, 0.14668823863612357, 0.13868031925454305, 0.08320612236654953, -0.1681462319911984, 0.06087208422262768, 0.026332312901301877, 0.20899081297988154, 0.08603044863338109, 0.026820283270090062, 0.170670086536489, 0.19498483689528875, 0.013685744275183728, 0.18621345799276268, -0.085255163418259, -0.09098132801296162, -0.26718782722626044, -0.1762645150065773, -0.18947432340676154, 0.07156271173153073, -0.06332648160979801, -0.19764352459932907, 0.38910800436565623, 0.123943714989329, 0.18789826881687116, -0.02726143411248062, 0.27016051568215765, 0.17822727754769468, 0.10503989079354695, 0.038503109452996294, 0.26328817521309666, 0.11768222326308192, 0.191947181137579, -0.270471765574547, 0.09068706687927867, 0.00705872469689643] |
1,803.01109 | Strange quark star in dilaton gravity | In this work, we have first obtained the hydrostatic equilibrium equation in
dilaton gravity. Then we have examined some of the structural characteristics
of strange quark star in dilaton gravity with a background of Einstein gravity.
We have shown that the variations of dilaton parameter do not affect the
maximum mass of quark star, while the variations of the cosmological constant
lead to change in the structural characteristics of the quark star. We have
investigated the stability of strange quark stars that studied by MIT Bag
model, in dilaton gravity. We have also provided limiting values for the
dilaton field parameter and the cosmological constant.We have also studied the
effects of dilaton gravity on the other properties of quark star such as the
mean density and gravitational redshift. We have concluded that the last
reported value for cosmological constant does not affect on maximum mass of
strange quark star.
| gr-qc astro-ph.HE | in this work we have first obtained the hydrostatic equilibrium equation in dilaton gravity then we have examined some of the structural characteristics of strange quark star in dilaton gravity with a background of einstein gravity we have shown that the variations of dilaton parameter do not affect the maximum mass of quark star while the variations of the cosmological constant lead to change in the structural characteristics of the quark star we have investigated the stability of strange quark stars that studied by mit bag model in dilaton gravity we have also provided limiting values for the dilaton field parameter and the cosmological constantwe have also studied the effects of dilaton gravity on the other properties of quark star such as the mean density and gravitational redshift we have concluded that the last reported value for cosmological constant does not affect on maximum mass of strange quark star | [['in', 'this', 'work', 'we', 'have', 'first', 'obtained', 'the', 'hydrostatic', 'equilibrium', 'equation', 'in', 'dilaton', 'gravity', 'then', 'we', 'have', 'examined', 'some', 'of', 'the', 'structural', 'characteristics', 'of', 'strange', 'quark', 'star', 'in', 'dilaton', 'gravity', 'with', 'a', 'background', 'of', 'einstein', 'gravity', 'we', 'have', 'shown', 'that', 'the', 'variations', 'of', 'dilaton', 'parameter', 'do', 'not', 'affect', 'the', 'maximum', 'mass', 'of', 'quark', 'star', 'while', 'the', 'variations', 'of', 'the', 'cosmological', 'constant', 'lead', 'to', 'change', 'in', 'the', 'structural', 'characteristics', 'of', 'the', 'quark', 'star', 'we', 'have', 'investigated', 'the', 'stability', 'of', 'strange', 'quark', 'stars', 'that', 'studied', 'by', 'mit', 'bag', 'model', 'in', 'dilaton', 'gravity', 'we', 'have', 'also', 'provided', 'limiting', 'values', 'for', 'the', 'dilaton', 'field', 'parameter', 'and', 'the', 'cosmological', 'constantwe', 'have', 'also', 'studied', 'the', 'effects', 'of', 'dilaton', 'gravity', 'on', 'the', 'other', 'properties', 'of', 'quark', 'star', 'such', 'as', 'the', 'mean', 'density', 'and', 'gravitational', 'redshift', 'we', 'have', 'concluded', 'that', 'the', 'last', 'reported', 'value', 'for', 'cosmological', 'constant', 'does', 'not', 'affect', 'on', 'maximum', 'mass', 'of', 'strange', 'quark', 'star']] | [-0.09493946889024728, 0.17377274359682662, -0.13105512571664865, 0.08812111688249638, -0.11445289106427023, -0.10047285891631806, 0.031463460802981916, 0.3420123682426126, -0.13593610266423564, -0.29258727232906845, 0.02692980140106965, -0.25598696325499337, -0.06161315504136502, 0.13002811848176582, -0.03631076295766354, 0.07552601631362407, 5.7354481928300537e-05, 0.09489672275997649, -0.11322826660000297, -0.30295281633484683, 0.3992389001189762, 0.011999662596757379, 0.15984682153735386, 0.09099758486615044, 0.07648511076871081, -0.09143992775938654, -0.017512142414464648, 0.05484625663383295, -0.2024726044833828, -0.033660741685420874, 0.131521612428435, 0.10164090364721397, 0.18554452194944773, -0.3541855222464308, -0.3018062158500238, 0.07580597966521878, 0.12411216773786551, 0.11560668604879722, -0.1035218264785714, -0.2487790870836517, 0.10117716073361695, -0.21864034404396862, -0.12526185965265504, -0.06441104043768907, 0.029550524944933317, 0.013004941821657746, -0.22000411446300028, 0.12674531752545223, 0.00600759838488978, 0.00532302792315315, -0.10383954763274965, -0.17182648625074817, -0.0857582389948977, 0.07924605480351504, 0.15996497818159452, 0.059349711881262944, 0.1534233469853565, -0.21501209082600706, -0.046124175656586885, 0.4174146236689299, -0.16190612489270084, -0.18703161300966303, 0.11808166565567305, -0.23160839171130085, -0.18910157216725335, 0.03610819345652657, 0.17071536969668513, 0.12503276514701994, -0.17155164893054023, 0.12875233032356248, -0.00977941475661734, 0.17707585831854067, 0.12650437442423312, 0.05665862684344385, 0.3255405611164818, 0.13433694405693736, -0.006783107289381875, 0.07278891175324348, -0.06947244010903192, -0.08615287713043941, -0.3204941380606502, -0.09583250650723509, -0.11520949328918285, 0.054169441045350986, -0.177785871775263, -0.18213796381578443, 0.3759161593555004, 0.15063714446662457, 0.15762881898389966, 0.00865755826484837, 0.20807039890057039, 0.09375613042772216, 0.07790928651209945, 0.09707741418090843, 0.40235352559087817, 0.20266556881068137, 0.1576310766785837, -0.3382715373175006, 0.01574057979734252, 0.053247111063488076] |
1,803.0111 | Nickel Titanium Alloy failure analysis under thermal cycling and
mechanical Loading: A Preliminary Study | The electrochemical frequency modulation (EFM) technique can consider as a
new tool for electrochemical corrosion monitoring. The calculation of corrosion
rate with a non-destructive and rapid technique is a necessity to study
corrosion behavior of metals under loading and thermal cycling. NiTi shape
memory alloy (SMA) is characterized by differential scanning calorimetry (DSC)
and uniaxial tensile testing. The corrosion behavior and reliability of
technique have been examined for NiTi sample in artificial physiological
solution. The results show the sensitivity of EFM technique to temperature and
base frequencies.
| physics.app-ph cond-mat.mtrl-sci | the electrochemical frequency modulation efm technique can consider as a new tool for electrochemical corrosion monitoring the calculation of corrosion rate with a nondestructive and rapid technique is a necessity to study corrosion behavior of metals under loading and thermal cycling niti shape memory alloy sma is characterized by differential scanning calorimetry dsc and uniaxial tensile testing the corrosion behavior and reliability of technique have been examined for niti sample in artificial physiological solution the results show the sensitivity of efm technique to temperature and base frequencies | [['the', 'electrochemical', 'frequency', 'modulation', 'efm', 'technique', 'can', 'consider', 'as', 'a', 'new', 'tool', 'for', 'electrochemical', 'corrosion', 'monitoring', 'the', 'calculation', 'of', 'corrosion', 'rate', 'with', 'a', 'nondestructive', 'and', 'rapid', 'technique', 'is', 'a', 'necessity', 'to', 'study', 'corrosion', 'behavior', 'of', 'metals', 'under', 'loading', 'and', 'thermal', 'cycling', 'niti', 'shape', 'memory', 'alloy', 'sma', 'is', 'characterized', 'by', 'differential', 'scanning', 'calorimetry', 'dsc', 'and', 'uniaxial', 'tensile', 'testing', 'the', 'corrosion', 'behavior', 'and', 'reliability', 'of', 'technique', 'have', 'been', 'examined', 'for', 'niti', 'sample', 'in', 'artificial', 'physiological', 'solution', 'the', 'results', 'show', 'the', 'sensitivity', 'of', 'efm', 'technique', 'to', 'temperature', 'and', 'base', 'frequencies']] | [-0.09753910978271187, 0.11472624397686758, -0.08725026218506947, -0.05571375024269453, -0.029793860765452356, -0.18036296224521323, 0.07989205166044507, 0.42395821881705315, -0.24280178413094802, -0.30371899230555555, 0.11192177701875268, -0.23339893650959365, -0.16576827331392588, 0.24699605879341735, -0.042145413817602326, 0.16254750964627868, 0.01596580412581392, -0.08550726841257393, -0.04660482121224718, -0.18469174489132717, 0.19014568661136189, 0.12790631541404232, 0.39858834349132816, 0.08559731372776602, 0.07003743220495338, 0.004024443476214662, 0.03044310133722236, 0.04458139558194269, -0.15220566820781464, 0.02345949681154613, 0.2936049834236331, 0.024422532876139914, 0.2202941402685882, -0.4560978073734976, -0.2836862602859907, 0.0010189231131868116, 0.03459916517724572, 0.059647149781043504, -0.1091542726853627, -0.2159776748050989, 0.10689073418074384, -0.14169191037058487, -0.12912396843620072, -0.1620062485058931, 0.005971461662958409, 0.052825830347605865, -0.3111061622527824, 0.10192755001179617, 0.045713769421837795, 0.17624309060335075, -0.15638962226662914, -0.08356096828891628, 0.010039002388373188, 0.07282299744821656, 0.06320270615356878, -0.0252558095407426, 0.27939670895301233, -0.08428698094112091, -0.0599781595084859, 0.3361327094989347, -0.05818641821629014, -0.08510814573958345, 0.18924178332946767, -0.09778833236738012, -0.06712472852019744, 0.1687944831926076, 0.14022773163575122, 0.08539312203875048, -0.24901934903002634, 0.018831899975046473, 0.13538850321509371, 0.21029497134691938, 0.14996139335863548, -0.023644452101026458, 0.13862552058122968, 0.2764387160925002, 0.012770099642996987, 0.19777793168818214, -0.15472437841175446, 0.046057069524266255, -0.15839540264729796, -0.25269628391900884, -0.1513204823044696, 0.0734622971162778, -0.11508281768119664, -0.17637854372552628, 0.33516353228525525, 0.08149305151390104, 0.10283280784885089, -0.027144069537177854, 0.3039698353486842, 0.06051855582353156, 0.05282462385065596, -0.07402093726713424, 0.22483225855119954, 0.19465134971528902, 0.19318446844826911, -0.3478835822008122, 0.18164910449935445, 0.033968893613066826] |
1,803.01111 | Population Extinction under Bursty Reproduction in a Time Modulated
Environment | In recent years non-demographic variability has been shown to greatly affect
dynamics of stochastic populations. For example, non-demographic noise in the
form of a bursty reproduction process with an a-priori unknown burst size, or
environmental variability in the form of time-varying reaction rates, have been
separately found to dramatically impact the extinction risk of isolated
populations. In this work we investigate the extinction risk of an isolated
population under the combined influence of these two types of non-demographic
variation. Using the so-called momentum-space WKB approach we arrive at a set
of time-dependent Hamilton equations. In order to account for the explicit time
dependence, we find the instanton of the time-perturbed Hamiltonian
numerically, where analytical expressions are presented in particular limits
using various perturbation techniques. We focus on two classes of time-varying
environments: periodically-varying rates corresponding to seasonal effects, and
a sudden decrease in the birth rate corresponding to a catastrophe. All our
theoretical results are tested against numerical Monte Carlo simulations with
time-dependent rates and also against a numerical solution of the corresponding
time-dependent Hamilton equations.
| q-bio.PE cond-mat.stat-mech | in recent years nondemographic variability has been shown to greatly affect dynamics of stochastic populations for example nondemographic noise in the form of a bursty reproduction process with an apriori unknown burst size or environmental variability in the form of timevarying reaction rates have been separately found to dramatically impact the extinction risk of isolated populations in this work we investigate the extinction risk of an isolated population under the combined influence of these two types of nondemographic variation using the socalled momentumspace wkb approach we arrive at a set of timedependent hamilton equations in order to account for the explicit time dependence we find the instanton of the timeperturbed hamiltonian numerically where analytical expressions are presented in particular limits using various perturbation techniques we focus on two classes of timevarying environments periodicallyvarying rates corresponding to seasonal effects and a sudden decrease in the birth rate corresponding to a catastrophe all our theoretical results are tested against numerical monte carlo simulations with timedependent rates and also against a numerical solution of the corresponding timedependent hamilton equations | [['in', 'recent', 'years', 'nondemographic', 'variability', 'has', 'been', 'shown', 'to', 'greatly', 'affect', 'dynamics', 'of', 'stochastic', 'populations', 'for', 'example', 'nondemographic', 'noise', 'in', 'the', 'form', 'of', 'a', 'bursty', 'reproduction', 'process', 'with', 'an', 'apriori', 'unknown', 'burst', 'size', 'or', 'environmental', 'variability', 'in', 'the', 'form', 'of', 'timevarying', 'reaction', 'rates', 'have', 'been', 'separately', 'found', 'to', 'dramatically', 'impact', 'the', 'extinction', 'risk', 'of', 'isolated', 'populations', 'in', 'this', 'work', 'we', 'investigate', 'the', 'extinction', 'risk', 'of', 'an', 'isolated', 'population', 'under', 'the', 'combined', 'influence', 'of', 'these', 'two', 'types', 'of', 'nondemographic', 'variation', 'using', 'the', 'socalled', 'momentumspace', 'wkb', 'approach', 'we', 'arrive', 'at', 'a', 'set', 'of', 'timedependent', 'hamilton', 'equations', 'in', 'order', 'to', 'account', 'for', 'the', 'explicit', 'time', 'dependence', 'we', 'find', 'the', 'instanton', 'of', 'the', 'timeperturbed', 'hamiltonian', 'numerically', 'where', 'analytical', 'expressions', 'are', 'presented', 'in', 'particular', 'limits', 'using', 'various', 'perturbation', 'techniques', 'we', 'focus', 'on', 'two', 'classes', 'of', 'timevarying', 'environments', 'periodicallyvarying', 'rates', 'corresponding', 'to', 'seasonal', 'effects', 'and', 'a', 'sudden', 'decrease', 'in', 'the', 'birth', 'rate', 'corresponding', 'to', 'a', 'catastrophe', 'all', 'our', 'theoretical', 'results', 'are', 'tested', 'against', 'numerical', 'monte', 'carlo', 'simulations', 'with', 'timedependent', 'rates', 'and', 'also', 'against', 'a', 'numerical', 'solution', 'of', 'the', 'corresponding', 'timedependent', 'hamilton', 'equations']] | [-0.11828389886167964, 0.07930429484645304, -0.09184119561304604, 0.10144545669107174, -0.007498524518949645, -0.07455058219443475, 0.04734038218323674, 0.38260027169383, -0.22794060007535985, -0.29658667049769843, 0.10164761991705745, -0.26750091102706003, -0.15398919603787362, 0.19728909878193268, -0.04711595925103341, 0.0718727091620011, 0.058730371249839666, 0.01218946465690221, -0.04160285139190299, -0.25601475482008285, 0.3024805778105344, 0.0711425280092018, 0.24583384977387532, 0.01670676068103473, 0.08155650175841792, -0.016969733079895376, -0.05642892252786883, 0.030233717648578542, -0.15975715737257684, 0.04903149861842394, 0.2115261495512511, 0.09628605886495539, 0.2766217118342008, -0.4792748262839658, -0.2442896751580494, 0.12036268702309047, 0.15068229644542694, 0.14986861526700002, -0.06818988115726304, -0.2632726817578077, 0.02252085007394531, -0.20270342889108828, -0.15349662904960237, -0.05152639919559338, 0.049486498132880245, 0.0708938668535224, -0.28205756548526034, 0.10075919443857856, 0.0010484146300171102, 0.06641694176409926, -0.09473899494590504, -0.09838489233981818, -0.022464291020296515, 0.13248535316903143, 0.08354939022417446, -0.03680833870794491, 0.11709837825370155, -0.1026060061622411, -0.11060617149142282, 0.32556591169110366, -0.09326780765783042, -0.20678324651505267, 0.18090933972437467, -0.15928006398358516, -0.15396223738789558, 0.1721390215067991, 0.21407084350341132, 0.11850685891296182, -0.1972559681880687, 0.04758592283286686, 0.02512655595783144, 0.1260841156888221, 0.05419133364622082, 0.024060392701732262, 0.13676462804100342, 0.15507226033934526, 0.012248424674450819, 0.12580712585709988, -0.10501563631929457, -0.16107442625731763, -0.2607422943513042, -0.06251114228474243, -0.10522283877179558, 0.0744926052088184, -0.10911460498065155, -0.15074794966777388, 0.38433202129123467, 0.17038479395742928, 0.18332961696067027, 0.06877695133111307, 0.2683190629418407, 0.1648344775103864, 0.010577575106705938, 0.061799732060836894, 0.23729725308250635, 0.12148198059760035, 0.05637331326026469, -0.28830362557500067, 0.11783203963522933, 0.03776229639138494] |
1,803.01112 | An Improved Method of Total Variation Superiorization Applied to
Reconstruction in Proton Computed Tomography | Previous work showed that total variation superiorization (TVS) improves
reconstructed image quality in proton computed tomography (pCT). The structure
of the TVS algorithm has evolved since then and this work investigated if this
new algorithmic structure provides additional benefits to pCT image quality.
Structural and parametric changes introduced to the original TVS algorithm
included: (1) inclusion or exclusion of TV reduction requirement, (2) a
variable number, $N$, of TV perturbation steps per feasibility-seeking
iteration, and (3) introduction of a perturbation kernel $0<\alpha<1$. The
structural change of excluding the TV reduction requirement check tended to
have a beneficial effect for $3\le N\le 6$ and allows full parallelization of
the TVS algorithm. Repeated perturbations per feasibility-seeking iterations
reduced total variation (TV) and material dependent standard deviations for
$3\le N\le 6$. The perturbation kernel $\alpha$, equivalent to $\alpha=0.5$ in
the original TVS algorithm, reduced TV and standard deviations as $\alpha$ was
increased beyond $\alpha=0.5$, but negatively impacted reconstructed relative
stopping power (RSP) values for $\alpha>0.75$. The reductions in TV and
standard deviations allowed feasibility-seeking with a larger relaxation
parameter $\lambda$ than previously used, without the corresponding increases
in standard deviations experienced with the original TVS algorithm. This work
demonstrates that the modifications related to the evolution of the original
TVS algorithm provide benefits in terms of both pCT image quality and
computational efficiency for appropriately chosen parameter values.
| physics.med-ph cs.CY math.OC | previous work showed that total variation superiorization tvs improves reconstructed image quality in proton computed tomography pct the structure of the tvs algorithm has evolved since then and this work investigated if this new algorithmic structure provides additional benefits to pct image quality structural and parametric changes introduced to the original tvs algorithm included 1 inclusion or exclusion of tv reduction requirement 2 a variable number n of tv perturbation steps per feasibilityseeking iteration and 3 introduction of a perturbation kernel 0alpha1 the structural change of excluding the tv reduction requirement check tended to have a beneficial effect for 3le nle 6 and allows full parallelization of the tvs algorithm repeated perturbations per feasibilityseeking iterations reduced total variation tv and material dependent standard deviations for 3le nle 6 the perturbation kernel alpha equivalent to alpha05 in the original tvs algorithm reduced tv and standard deviations as alpha was increased beyond alpha05 but negatively impacted reconstructed relative stopping power rsp values for alpha075 the reductions in tv and standard deviations allowed feasibilityseeking with a larger relaxation parameter lambda than previously used without the corresponding increases in standard deviations experienced with the original tvs algorithm this work demonstrates that the modifications related to the evolution of the original tvs algorithm provide benefits in terms of both pct image quality and computational efficiency for appropriately chosen parameter values | [['previous', 'work', 'showed', 'that', 'total', 'variation', 'superiorization', 'tvs', 'improves', 'reconstructed', 'image', 'quality', 'in', 'proton', 'computed', 'tomography', 'pct', 'the', 'structure', 'of', 'the', 'tvs', 'algorithm', 'has', 'evolved', 'since', 'then', 'and', 'this', 'work', 'investigated', 'if', 'this', 'new', 'algorithmic', 'structure', 'provides', 'additional', 'benefits', 'to', 'pct', 'image', 'quality', 'structural', 'and', 'parametric', 'changes', 'introduced', 'to', 'the', 'original', 'tvs', 'algorithm', 'included', '1', 'inclusion', 'or', 'exclusion', 'of', 'tv', 'reduction', 'requirement', '2', 'a', 'variable', 'number', 'n', 'of', 'tv', 'perturbation', 'steps', 'per', 'feasibilityseeking', 'iteration', 'and', '3', 'introduction', 'of', 'a', 'perturbation', 'kernel', '0alpha1', 'the', 'structural', 'change', 'of', 'excluding', 'the', 'tv', 'reduction', 'requirement', 'check', 'tended', 'to', 'have', 'a', 'beneficial', 'effect', 'for', '3le', 'nle', '6', 'and', 'allows', 'full', 'parallelization', 'of', 'the', 'tvs', 'algorithm', 'repeated', 'perturbations', 'per', 'feasibilityseeking', 'iterations', 'reduced', 'total', 'variation', 'tv', 'and', 'material', 'dependent', 'standard', 'deviations', 'for', '3le', 'nle', '6', 'the', 'perturbation', 'kernel', 'alpha', 'equivalent', 'to', 'alpha05', 'in', 'the', 'original', 'tvs', 'algorithm', 'reduced', 'tv', 'and', 'standard', 'deviations', 'as', 'alpha', 'was', 'increased', 'beyond', 'alpha05', 'but', 'negatively', 'impacted', 'reconstructed', 'relative', 'stopping', 'power', 'rsp', 'values', 'for', 'alpha075', 'the', 'reductions', 'in', 'tv', 'and', 'standard', 'deviations', 'allowed', 'feasibilityseeking', 'with', 'a', 'larger', 'relaxation', 'parameter', 'lambda', 'than', 'previously', 'used', 'without', 'the', 'corresponding', 'increases', 'in', 'standard', 'deviations', 'experienced', 'with', 'the', 'original', 'tvs', 'algorithm', 'this', 'work', 'demonstrates', 'that', 'the', 'modifications', 'related', 'to', 'the', 'evolution', 'of', 'the', 'original', 'tvs', 'algorithm', 'provide', 'benefits', 'in', 'terms', 'of', 'both', 'pct', 'image', 'quality', 'and', 'computational', 'efficiency', 'for', 'appropriately', 'chosen', 'parameter', 'values']] | [-0.06031547240395513, 0.03474174889166736, -0.05866842405146195, 0.08811816277241127, -0.04493604375877314, -0.15857575262663887, 0.08920818946531249, 0.36813863444245526, -0.2656538914081951, -0.3546487227475478, 0.08354366583801393, -0.2719165285770497, -0.11040320927225467, 0.14758061637894976, -0.08950839770129985, 0.07686063435458992, 0.0821525260894042, 0.03050366614337286, -0.11713415646822088, -0.3055058658216149, 0.19912031630261076, 0.06489725549187925, 0.25554712374591165, 0.0002838909232781993, 0.0830777882386206, 0.041414423195852174, -0.05541416793337299, 0.07203573237897622, -0.102435296595213, 0.11246568032440134, 0.2046274156896268, 0.13531088897751437, 0.2907271577562723, -0.37656423195886113, -0.2178017744132214, 0.10893792170099914, 0.14068596254827248, 0.055676276334044005, -0.025413847780889936, -0.2281102472015967, 0.11898413218234459, -0.15597268589668803, -0.09118439255075322, -0.06489242557022307, 0.02677078255969617, -0.02642665821282814, -0.29527683743844846, 0.10336327305425787, 0.05152666579068561, 0.03223765418192165, -0.033848556820173854, -0.17445280633452867, -0.011248696775486072, 0.09731958775962185, 0.06037470725649554, 0.054443191710031695, 0.1563163390921222, -0.0914263813270049, -0.09483147641436922, 0.3690759796274102, -0.09007877284796753, -0.17971694371559555, 0.11978402210606469, -0.11585384065957947, -0.1354283452030116, 0.1906069795921859, 0.12106448481079295, 0.07856439999065414, -0.10717602911870927, 0.11151287891798549, 0.04599078187382676, 0.21945559432005718, 0.12736027273142503, 0.029207374123442504, 0.011488796816103989, 0.14387260398513818, 0.10380216307679398, 0.12330383154460126, -0.10245239330662621, -0.05569551618045403, -0.2503595318852199, -0.15147586201214128, -0.17080553123934403, 0.04009714755022691, -0.13457673573297346, -0.1301988136437204, 0.39752786662429573, 0.14246896223268576, 0.1793326901240895, 0.05309131974975268, 0.33326129084039063, 0.10726912838665562, 0.07003351101211996, 0.0602434857810537, 0.19846031819884147, 0.09666068710050442, 0.13493981127523713, -0.22650849061190254, 0.06253840333057774, 0.061097587475346195] |
1,803.01113 | Slow and Stale Gradients Can Win the Race: Error-Runtime Trade-offs in
Distributed SGD | Distributed Stochastic Gradient Descent (SGD) when run in a synchronous
manner, suffers from delays in waiting for the slowest learners (stragglers).
Asynchronous methods can alleviate stragglers, but cause gradient staleness
that can adversely affect convergence. In this work we present a novel
theoretical characterization of the speed-up offered by asynchronous methods by
analyzing the trade-off between the error in the trained model and the actual
training runtime (wallclock time). The novelty in our work is that our runtime
analysis considers random straggler delays, which helps us design and compare
distributed SGD algorithms that strike a balance between stragglers and
staleness. We also present a new convergence analysis of asynchronous SGD
variants without bounded or exponential delay assumptions, and a novel learning
rate schedule to compensate for gradient staleness.
| stat.ML cs.LG | distributed stochastic gradient descent sgd when run in a synchronous manner suffers from delays in waiting for the slowest learners stragglers asynchronous methods can alleviate stragglers but cause gradient staleness that can adversely affect convergence in this work we present a novel theoretical characterization of the speedup offered by asynchronous methods by analyzing the tradeoff between the error in the trained model and the actual training runtime wallclock time the novelty in our work is that our runtime analysis considers random straggler delays which helps us design and compare distributed sgd algorithms that strike a balance between stragglers and staleness we also present a new convergence analysis of asynchronous sgd variants without bounded or exponential delay assumptions and a novel learning rate schedule to compensate for gradient staleness | [['distributed', 'stochastic', 'gradient', 'descent', 'sgd', 'when', 'run', 'in', 'a', 'synchronous', 'manner', 'suffers', 'from', 'delays', 'in', 'waiting', 'for', 'the', 'slowest', 'learners', 'stragglers', 'asynchronous', 'methods', 'can', 'alleviate', 'stragglers', 'but', 'cause', 'gradient', 'staleness', 'that', 'can', 'adversely', 'affect', 'convergence', 'in', 'this', 'work', 'we', 'present', 'a', 'novel', 'theoretical', 'characterization', 'of', 'the', 'speedup', 'offered', 'by', 'asynchronous', 'methods', 'by', 'analyzing', 'the', 'tradeoff', 'between', 'the', 'error', 'in', 'the', 'trained', 'model', 'and', 'the', 'actual', 'training', 'runtime', 'wallclock', 'time', 'the', 'novelty', 'in', 'our', 'work', 'is', 'that', 'our', 'runtime', 'analysis', 'considers', 'random', 'straggler', 'delays', 'which', 'helps', 'us', 'design', 'and', 'compare', 'distributed', 'sgd', 'algorithms', 'that', 'strike', 'a', 'balance', 'between', 'stragglers', 'and', 'staleness', 'we', 'also', 'present', 'a', 'new', 'convergence', 'analysis', 'of', 'asynchronous', 'sgd', 'variants', 'without', 'bounded', 'or', 'exponential', 'delay', 'assumptions', 'and', 'a', 'novel', 'learning', 'rate', 'schedule', 'to', 'compensate', 'for', 'gradient', 'staleness']] | [-0.15195380663317337, 0.03687690157494217, -0.09898681846971158, 0.09859043163305614, -0.08814641193748685, -0.21490967335921596, 0.17572188328631455, 0.440909823984839, -0.3231958514152211, -0.34871888610359747, 0.06670853838932089, -0.18611618257273221, -0.15374598908056214, 0.17843091620670748, -0.22962057448603446, 0.07905556570767658, 0.16271358633821364, -0.04107815761381062, -0.07449783150696021, -0.33557700297023985, 0.20037488461093744, 0.07862925609879312, 0.2788493808693602, -0.04118558369555103, 0.0936234126547788, -0.037820267458300805, -0.021925015285205518, -0.016572863280089223, -0.034422290696909386, 0.09339202815499448, 0.24854290796793066, 0.211352245110902, 0.3972944544220809, -0.4470113360803225, -0.17524743326066528, 0.1585396071532159, 0.21225123113958944, 0.10639902200182405, -0.09470326720656885, -0.24157805469167215, 0.10662011834210716, -0.1457433821124141, -0.02335302771462011, -0.10185250912400079, -0.0572452451378922, 0.10794616718885663, -0.29244408062731964, 0.09626750303300469, 0.10888831771444529, 0.04146296306498698, -0.01750728810839064, -0.090850766906442, 0.06931431642078678, 0.10597599823199744, 0.09544007547538058, 0.028776127484889003, 0.13833758300097543, -0.07304447309979878, -0.15671514218593074, 0.3038576294420636, -0.09050118590312195, -0.18355584917298984, 0.16543576553522144, -0.013438679015962407, -0.1542638661521778, 0.09452292481364566, 0.30037035737768747, 0.11962152935302584, -0.19447544230808944, 0.03417312168494391, 0.07156645865870814, 0.18341460933879716, 0.05160864847675839, 0.003960825570175075, 0.07274244680320407, 0.2115218734888913, 0.14851036534673767, 0.14964933783267043, -0.08410441607702523, -0.18948222752078436, -0.2552987181879871, -0.12379930177121423, -0.14018365584342973, -0.01606882922897057, -0.16038682035059537, -0.12759140466914687, 0.3592823664403113, 0.2006590253804461, 0.1924515644859639, 0.20328645194513228, 0.42604998667229665, 0.07834289351012558, 0.058936379093211144, 0.22037660315180574, 0.21424054090493883, 0.053065666874317685, 0.19403137474364485, -0.30121317738121434, 0.1923847673169803, 0.035814132464452086] |
1,803.01114 | Focal Loss Dense Detector for Vehicle Surveillance | Deep learning has been widely recognized as a promising approach in different
computer vision applications. Specifically, one-stage object detector and
two-stage object detector are regarded as the most important two groups of
Convolutional Neural Network based object detection methods. One-stage object
detector could usually outperform two-stage object detector in speed; However,
it normally trails in detection accuracy, compared with two-stage object
detectors. In this study, focal loss based RetinaNet, which works as one-stage
object detector, is utilized to be able to well match the speed of regular
one-stage detectors and also defeat two-stage detectors in accuracy, for
vehicle detection. State-of-the-art performance result has been showed on the
DETRAC vehicle dataset.
| cs.CV | deep learning has been widely recognized as a promising approach in different computer vision applications specifically onestage object detector and twostage object detector are regarded as the most important two groups of convolutional neural network based object detection methods onestage object detector could usually outperform twostage object detector in speed however it normally trails in detection accuracy compared with twostage object detectors in this study focal loss based retinanet which works as onestage object detector is utilized to be able to well match the speed of regular onestage detectors and also defeat twostage detectors in accuracy for vehicle detection stateoftheart performance result has been showed on the detrac vehicle dataset | [['deep', 'learning', 'has', 'been', 'widely', 'recognized', 'as', 'a', 'promising', 'approach', 'in', 'different', 'computer', 'vision', 'applications', 'specifically', 'onestage', 'object', 'detector', 'and', 'twostage', 'object', 'detector', 'are', 'regarded', 'as', 'the', 'most', 'important', 'two', 'groups', 'of', 'convolutional', 'neural', 'network', 'based', 'object', 'detection', 'methods', 'onestage', 'object', 'detector', 'could', 'usually', 'outperform', 'twostage', 'object', 'detector', 'in', 'speed', 'however', 'it', 'normally', 'trails', 'in', 'detection', 'accuracy', 'compared', 'with', 'twostage', 'object', 'detectors', 'in', 'this', 'study', 'focal', 'loss', 'based', 'retinanet', 'which', 'works', 'as', 'onestage', 'object', 'detector', 'is', 'utilized', 'to', 'be', 'able', 'to', 'well', 'match', 'the', 'speed', 'of', 'regular', 'onestage', 'detectors', 'and', 'also', 'defeat', 'twostage', 'detectors', 'in', 'accuracy', 'for', 'vehicle', 'detection', 'stateoftheart', 'performance', 'result', 'has', 'been', 'showed', 'on', 'the', 'detrac', 'vehicle', 'dataset']] | [-0.014510675299574028, -0.04542390848086639, -0.08574550052766096, 0.03987584141220644, -0.08365410203960809, -0.26920874526470223, -0.09804629768160257, 0.48819800361313603, -0.16021304766499353, -0.38993349461392923, 0.12554464990759945, -0.2831529368561777, -0.17685665077614512, 0.2404278915227306, -0.19859757097861305, 0.17756469719302417, 0.17654738381864843, 0.08297546765005047, -0.048034622545608065, -0.2506411707494408, 0.19861314924730158, 0.12423157803052824, 0.37022969399324873, -0.0033860866996375, 0.19053896713832563, -0.051287394961003555, -0.021488724670118906, 0.013420112641655248, 0.026044775951992383, 0.0697148778877983, 0.39842735129323875, 0.170111862832511, 0.24494428052990275, -0.40468924186107785, -0.27049241103655236, 0.08912407846020703, 0.1591045786880634, 0.07041414001088758, -0.07444223171967844, -0.37442800115624614, 0.1106061205606569, -0.2575245180929249, 0.01189274952154268, -0.030454781964759935, -0.006961578824980693, -0.004814400624441491, -0.22230228549716147, -0.005257434351634319, 0.0715753355412744, 0.004364094572057101, -0.007646165063223717, -0.15134615287507502, 0.10489464454903183, 0.12986590297130698, 0.011195117597129534, 0.06794175532307814, 0.19427281243472613, -0.21638533584403127, -0.18998393286125395, 0.34534916437485, -0.07479216359894383, -0.2027072120627219, 0.26431592563590545, -0.02068569719876078, -0.12357217891311104, 0.1560497326353057, 0.26016595782288776, 0.19829880187118595, -0.17961905624040148, -0.0502718504444188, 0.00452850702303377, 0.17544545957141303, 0.10415935261090371, 0.0021097660064697266, 0.2092817465467802, 0.36441346760415894, 0.09411375277083028, 0.1380441775249148, -0.24676413839809935, -0.040312345499511466, -0.18925742401148785, -0.10980335259439677, -0.19111551790582862, -0.07278949730098247, -0.024282736242060888, -0.1210222380680286, 0.35620414231654485, 0.24244973892346025, 0.14639266122513536, 0.035195984463842415, 0.3730727490715005, 0.01213804278628562, 0.1582025459078564, 0.0488308507906781, 0.29084592658645386, -0.004218283536928621, 0.0950771553738212, -0.13470934928733516, 0.114501898473298, 0.11275020168501546] |
1,803.01115 | Fundamental gap estimate for convex domains on sphere -- the case $n=2$ | In [SWW16, HW17] it is shown that the difference of the first two eigenvalues
of the Laplacian with Dirichlet boundary condition on convex domain with
diameter $D$ of sphere $\mathbb S^n$ is $\geq 3 \frac{\pi^2}{D^2}$ when $n \geq
3$. We prove the same result when $n=2$. In fact our proof works for all
dimension. We also give an asymptotic expansion of the first and second
Dirichlet eigenvalues of the model in [SWW16].
| math.DG math.AP math.SP | in sww16 hw17 it is shown that the difference of the first two eigenvalues of the laplacian with dirichlet boundary condition on convex domain with diameter d of sphere mathbb sn is geq 3 fracpi2d2 when n geq 3 we prove the same result when n2 in fact our proof works for all dimension we also give an asymptotic expansion of the first and second dirichlet eigenvalues of the model in sww16 | [['in', 'sww16', 'hw17', 'it', 'is', 'shown', 'that', 'the', 'difference', 'of', 'the', 'first', 'two', 'eigenvalues', 'of', 'the', 'laplacian', 'with', 'dirichlet', 'boundary', 'condition', 'on', 'convex', 'domain', 'with', 'diameter', 'd', 'of', 'sphere', 'mathbb', 'sn', 'is', 'geq', '3', 'fracpi2d2', 'when', 'n', 'geq', '3', 'we', 'prove', 'the', 'same', 'result', 'when', 'n2', 'in', 'fact', 'our', 'proof', 'works', 'for', 'all', 'dimension', 'we', 'also', 'give', 'an', 'asymptotic', 'expansion', 'of', 'the', 'first', 'and', 'second', 'dirichlet', 'eigenvalues', 'of', 'the', 'model', 'in', 'sww16']] | [-0.12096453630669124, 0.08542805218557065, -0.0568170426008494, -0.010156487718737428, -0.04188609097584866, -0.1277829826121097, -0.047490042013426624, 0.32769041037375946, -0.2298629958236563, -0.2381068365783363, 0.12308287225238493, -0.3049194559562897, -0.1485781912604158, 0.13815071429395914, -0.05398141560347184, 0.02582395117243995, 0.06542853835592236, 0.12804572570367137, -0.046405652629049575, -0.3214863933676827, 0.3618963894339791, -0.07483710583461367, 0.19682857517719918, 0.1153513057683797, 0.057122070408102285, -0.02257243024887166, 0.02698456655944819, -0.04400025288729618, -0.18463132617224523, 0.10906306919439332, 0.20133209362140167, 0.08350060566368958, 0.24813696904026944, -0.4010611691282711, -0.17163902461069866, 0.155292679913396, 0.17926536244677677, 0.014030037650271603, 0.0317168760423859, -0.23237465762033843, 0.14134953690665789, -0.07981356152373811, -0.18597206646117612, 0.02402209760486216, 0.08981865744335928, -0.016366505155177867, -0.339384910043167, 0.08130055595403604, 0.17351161653472894, 0.053173793749748795, -0.10528368161370356, -0.17737313467786525, -0.011852862249276992, 0.0723032173995887, 0.038514576978860016, 0.003707373271817746, -0.03990315025726306, -0.07011507245023614, -0.05954986965904633, 0.32334275310859084, -0.055196415713947754, -0.2453982015342816, 0.12611513598349647, -0.23647600698514262, -0.15373746655287518, 0.06661314203106947, 0.10069054521728253, 0.1909825705072802, -0.050566223985262455, 0.17840678408063707, -0.0757140831573043, 0.15001929802415165, 0.13673951113731533, -0.046292667405382876, 0.056102194364412106, 0.12972084524622862, 0.15865314635785593, 0.1621729280070766, -0.05521587908025021, -0.040833652431172304, -0.38602438331514166, -0.1860640411319184, -0.28290531899192894, 0.11155182360738948, -0.20133130612721553, -0.16024878923570318, 0.32267092530062236, 0.07053612329173779, 0.2243237953255142, 0.12769256723855715, 0.2406227296029312, 0.1142831461156543, -0.009218522718689148, 0.1303939276739307, 0.15772664383647667, 0.1470770104315834, 0.04535368974388078, -0.18290212598293548, -0.009342118773771368, 0.14413993288695381] |
1,803.01116 | Theory of the supercyclotron resonance and Hall response in anomalous 2d
metals | Weakly disordered superconducting films can be driven into an anomalous low
temperature resistive state upon applying a magnetic field. Recent experiments
on weakly disordered amorphous InO$_x$ have established that both the Hall
resistivity and the frequency of a cyclotron-like resonance in the anomalous
metal are highly suppressed relative to the values expected for a conventional
metal. We show that both of these observations can be understood from the flux
flow dynamics of vortices in a superconductor with significant vortex pinning.
Results for flux flow transport are obtained using a systematic hydrodynamic
expansion, controlled by the diluteness of mobile vortices at low temperatures.
Hydrodynamic transport coefficients are related to microscopics through Kubo
formulae for the longitudinal and Hall vortex conductivities, as well as a
`vorto-electric' conductivity.
| cond-mat.supr-con | weakly disordered superconducting films can be driven into an anomalous low temperature resistive state upon applying a magnetic field recent experiments on weakly disordered amorphous ino_x have established that both the hall resistivity and the frequency of a cyclotronlike resonance in the anomalous metal are highly suppressed relative to the values expected for a conventional metal we show that both of these observations can be understood from the flux flow dynamics of vortices in a superconductor with significant vortex pinning results for flux flow transport are obtained using a systematic hydrodynamic expansion controlled by the diluteness of mobile vortices at low temperatures hydrodynamic transport coefficients are related to microscopics through kubo formulae for the longitudinal and hall vortex conductivities as well as a vortoelectric conductivity | [['weakly', 'disordered', 'superconducting', 'films', 'can', 'be', 'driven', 'into', 'an', 'anomalous', 'low', 'temperature', 'resistive', 'state', 'upon', 'applying', 'a', 'magnetic', 'field', 'recent', 'experiments', 'on', 'weakly', 'disordered', 'amorphous', 'ino_x', 'have', 'established', 'that', 'both', 'the', 'hall', 'resistivity', 'and', 'the', 'frequency', 'of', 'a', 'cyclotronlike', 'resonance', 'in', 'the', 'anomalous', 'metal', 'are', 'highly', 'suppressed', 'relative', 'to', 'the', 'values', 'expected', 'for', 'a', 'conventional', 'metal', 'we', 'show', 'that', 'both', 'of', 'these', 'observations', 'can', 'be', 'understood', 'from', 'the', 'flux', 'flow', 'dynamics', 'of', 'vortices', 'in', 'a', 'superconductor', 'with', 'significant', 'vortex', 'pinning', 'results', 'for', 'flux', 'flow', 'transport', 'are', 'obtained', 'using', 'a', 'systematic', 'hydrodynamic', 'expansion', 'controlled', 'by', 'the', 'diluteness', 'of', 'mobile', 'vortices', 'at', 'low', 'temperatures', 'hydrodynamic', 'transport', 'coefficients', 'are', 'related', 'to', 'microscopics', 'through', 'kubo', 'formulae', 'for', 'the', 'longitudinal', 'and', 'hall', 'vortex', 'conductivities', 'as', 'well', 'as', 'a', 'vortoelectric', 'conductivity']] | [-0.1618018526417332, 0.2600911277846402, -0.04815755456277147, -0.006897939785527505, -0.0348710096895513, -0.1292500697848637, 0.03296215273439884, 0.3750210778287998, -0.2606422766831105, -0.25053549626069826, 0.06597657115728693, -0.2951165455567643, -0.09528151084101055, 0.25757739512293365, 0.022410751471856262, 0.043188791451488275, -0.03596926422229385, -0.052853676928226206, -0.07618222860013688, -0.1791745838141296, 0.27367117690543336, 0.016606851079599645, 0.3404371838380651, 0.08610855914818925, 0.0404663171838757, -0.06905398111245255, 0.06301326688560771, 0.13814019267939456, -0.14414333492364617, 0.011926577312917245, 0.24563597793675718, -0.14854033368192915, 0.1395022261516774, -0.4994588271086294, -0.23509699932291983, -0.02107387805372719, 0.16323032171268592, 0.14846098322300164, -0.06918640501278536, -0.27130145234305686, 0.04077826595365456, -0.14952003505323233, -0.10316980074962404, -0.1343425011197938, -0.007408296200068198, 0.026186347696778734, -0.2698774100924895, 0.14086166293383007, 0.04298883259072341, 0.09246826275607677, -0.08010243927507199, -0.12477682315842892, -0.06924799566603894, 0.055390935050459895, 0.047706362893577756, 0.03392737217217199, 0.20214020559655094, -0.2041550589066635, -0.11926799688707825, 0.3294194344567453, -0.0981754384105798, -0.1249744801411057, 0.1941532311900481, -0.19550605941700136, -0.041438708134843565, 0.19990886897757287, 0.15513614277408375, 0.09198261265514221, -0.14403666527392872, 0.015334966698021636, -0.05542326380491135, 0.11799080406573063, 0.011412585084137271, 0.03267267614421321, 0.2957334006432353, 0.2048940818029933, -0.0002566267361455574, 0.13654871268303898, -0.12582367267724642, -0.03410277745830334, -0.2372316016808031, -0.15139860435714567, -0.22766089510566334, 0.09809247833843214, -0.07894177524712717, -0.1985865402398858, 0.34245055336202307, 0.1521983181997283, 0.2026302578846727, -0.0236256230789108, 0.269300240887011, 0.16729062138980905, 0.07876116105798268, 0.07549263225732053, 0.25697277358362103, 0.2025817787838812, 0.17838438871121168, -0.3066959467402288, 0.055172208674835056, 0.04694966196150678] |
1,803.01117 | A new quantity for statistical analysis: "Scaling invariable Benford
distance" | For the first time, we introduce "Scaling invariable Benford distance" and
"Benford cyclic graph", which can be used to analyze any data set. Using the
quantity and the graph, we analyze some date sets with common distributions,
such as normal, exponent, etc., find that different data set has a much
different value of "Scaling invariable Benford distance" and different figure
feature of "Benford cyclic graph". We also explore the influence of data size
on "Scaling invariable Benford distance", and find that it firstly reduces with
data size increasing, then approximate to a fixed value when the size is large
enough.
| physics.data-an | for the first time we introduce scaling invariable benford distance and benford cyclic graph which can be used to analyze any data set using the quantity and the graph we analyze some date sets with common distributions such as normal exponent etc find that different data set has a much different value of scaling invariable benford distance and different figure feature of benford cyclic graph we also explore the influence of data size on scaling invariable benford distance and find that it firstly reduces with data size increasing then approximate to a fixed value when the size is large enough | [['for', 'the', 'first', 'time', 'we', 'introduce', 'scaling', 'invariable', 'benford', 'distance', 'and', 'benford', 'cyclic', 'graph', 'which', 'can', 'be', 'used', 'to', 'analyze', 'any', 'data', 'set', 'using', 'the', 'quantity', 'and', 'the', 'graph', 'we', 'analyze', 'some', 'date', 'sets', 'with', 'common', 'distributions', 'such', 'as', 'normal', 'exponent', 'etc', 'find', 'that', 'different', 'data', 'set', 'has', 'a', 'much', 'different', 'value', 'of', 'scaling', 'invariable', 'benford', 'distance', 'and', 'different', 'figure', 'feature', 'of', 'benford', 'cyclic', 'graph', 'we', 'also', 'explore', 'the', 'influence', 'of', 'data', 'size', 'on', 'scaling', 'invariable', 'benford', 'distance', 'and', 'find', 'that', 'it', 'firstly', 'reduces', 'with', 'data', 'size', 'increasing', 'then', 'approximate', 'to', 'a', 'fixed', 'value', 'when', 'the', 'size', 'is', 'large', 'enough']] | [-0.09239162069745362, 0.11812596483156085, -0.11385285492986441, 0.06935380912967958, -0.09693838417122606, -0.13514365879818796, 0.09818978072144091, 0.37050091084092857, -0.3417556424252689, -0.3006923074508086, 0.10249097324442119, -0.3032522777467966, -0.12572183794574812, 0.16560909940861165, -0.0680569204268977, 0.08243008625227959, 0.034012253880500797, 0.09561056679114699, -0.05290422666352242, -0.21485351179464487, 0.3545893132511992, 0.04030822823755443, 0.32456775634549556, -0.01231441429350525, 0.06919929268304259, -0.010566646037623285, -0.04668872374109924, 0.08116151933558285, -0.1917837866822083, 0.03425015080254525, 0.2127490976115223, 0.17833440966438502, 0.24005699010100215, -0.33931156134232876, -0.1577583036478609, 0.19409269046969713, 0.13881653300486504, 0.09012937002000398, 0.001452650030842051, -0.1957687259046361, 0.1317111402004957, -0.145746470191516, -0.1253412016807124, -0.06750192016363143, 0.1301115675829351, 0.06396828969940543, -0.2698462690133601, 0.028762337357911748, 0.016249872245825827, 0.09818612937815488, 0.0006672688294202089, -0.1357166504394263, 0.016403687675483523, 0.17219246733846374, 0.08329537899931892, 0.030495235207490624, 0.1166839920784696, -0.03122757694683969, -0.07431507610250264, 0.3707027353718877, -0.04777723893057555, -0.16544495813548565, 0.15432064292021097, -0.167952800123021, -0.14542830109596253, 0.0663255202077562, 0.19543073462788016, 0.07285432482603937, -0.1404808522372332, 0.048904252664651725, -0.06477878854610025, 0.20834614409133792, 0.09053770090453327, 0.043994176232954485, 0.11889761651866138, 0.14986647101817652, 0.07827733218669891, 0.17586098305298947, -0.1061689892434515, -0.07512093191966414, -0.254508575941436, -0.12461794326081872, -0.27036502115428446, 0.07680670075118541, -0.23340880144794937, -0.17386424475349485, 0.38279046535491945, 0.17843297972576694, 0.25270462153013795, 0.1283288141421508, 0.2401858646608889, 0.10926950275577837, 0.11052718968130648, 0.14673693258780987, 0.14925684727408225, 0.04051739691756666, 0.045576761425472796, -0.17715329981409014, 0.11578671653522178, 0.0012946473993360997] |
1,803.01118 | Some Considerations on Learning to Explore via Meta-Reinforcement
Learning | We consider the problem of exploration in meta reinforcement learning. Two
new meta reinforcement learning algorithms are suggested: E-MAML and
E-$\text{RL}^2$. Results are presented on a novel environment we call `Krazy
World' and a set of maze environments. We show E-MAML and E-$\text{RL}^2$
deliver better performance on tasks where exploration is important.
| cs.AI | we consider the problem of exploration in meta reinforcement learning two new meta reinforcement learning algorithms are suggested emaml and etextrl2 results are presented on a novel environment we call krazy world and a set of maze environments we show emaml and etextrl2 deliver better performance on tasks where exploration is important | [['we', 'consider', 'the', 'problem', 'of', 'exploration', 'in', 'meta', 'reinforcement', 'learning', 'two', 'new', 'meta', 'reinforcement', 'learning', 'algorithms', 'are', 'suggested', 'emaml', 'and', 'etextrl2', 'results', 'are', 'presented', 'on', 'a', 'novel', 'environment', 'we', 'call', 'krazy', 'world', 'and', 'a', 'set', 'of', 'maze', 'environments', 'we', 'show', 'emaml', 'and', 'etextrl2', 'deliver', 'better', 'performance', 'on', 'tasks', 'where', 'exploration', 'is', 'important']] | [-0.06739329931108241, 0.022677918370971654, -0.08192541824772637, 0.06156989732915734, -0.12904901876847477, -0.14243343094007133, 0.03597393941054953, 0.5205224594695771, -0.24988600629520544, -0.34664276654415943, 0.04941711714243556, -0.24079809900611004, -0.23294528637160647, 0.24849345523150676, -0.15872231831258915, 0.06995980600093274, 0.11759098143653667, 0.04708153039137734, -0.022031409685757567, -0.2546393531622326, 0.3364265712493278, -0.025605024690640733, 0.310105100115563, 0.025994150958796765, 0.14943683947971526, -0.008727501750864248, -0.007265606308058697, 0.02153541991843822, -0.1047334528300277, 0.17539654753141184, 0.3229618195365084, 0.2623196316169614, 0.3653475044572607, -0.38394402946404954, -0.19438646034278134, 0.10379059105477434, 0.1268567749933201, 0.07131801970659736, -0.1092378103243623, -0.33674975302308163, 0.05287359696020313, -0.13934511812205644, 0.03713611110133377, -0.15610151030519542, -0.0561285267801995, -0.006754299430077539, -0.3035408872714702, -0.07139041691899617, 0.02995059365763309, 0.03884460701745875, -0.06762920462209335, -0.175226548894685, 0.12462597717332871, 0.1448712617436305, -0.014789094749659776, 0.020184680987942093, 0.1800550729075962, -0.1762764702769036, -0.21633248622628284, 0.3847173515786516, -0.0046989760024750485, -0.18093818834328906, 0.27594767776912354, 0.006369623256490585, -0.2064768791872453, 0.02387079621784072, 0.32737742814215576, 0.16955226814334698, -0.13887112718471822, 0.057707968659629606, -0.05174975443948457, 0.10864039912740601, -0.027324976478802398, -0.037303193947894775, 0.16758698629750374, 0.35489172722272416, 0.10793488732281517, 0.15144531241063267, -0.05570815679954087, -0.16265184135037533, -0.2017297419184383, -0.1812237585557902, -0.1573562520615598, -0.018448362107131074, -0.08661019525576155, -0.11029276237922146, 0.32723794294461767, 0.2354067335341205, 0.22973466858743352, 0.10584963475690877, 0.31356897538012646, 0.015293018464209572, 0.009149965275316797, 0.14598141161804187, 0.20700963557341157, -0.03125559835833438, 0.1256625977879826, -0.1703954793294852, 0.08941598282136182, 0.02902588374080493] |
1,803.01119 | Effective line elements and black-hole models in canonical (loop)
quantum gravity | Canonical quantization is often used to suggest new effects in quantum
gravity, in the dynamics as well as the structure of space-time. Usually,
possible phenomena are first seen in a modified version of the classical
dynamics, for instance in an effective Friedmann equation, but there should
also be implications for a modified space-time structure. Quantum space-time
effects, however, are often ignored in this setting because they are not
obvious: they require a careful analysis of gauge transformations and the
anomaly problem. It is shown here how modified space-time structures and
effective line elements can be derived unambiguously, provided an off-shell
anomaly-free system of modified constraints exists. The resulting effective
line elements reveal signature change as an inescapable consequence of
non-classical gauge transformations in the presence of holonomy modifications.
The general framework is then specialized to black-hole models in loop quantum
gravity. In contrast to previous studies, a self-consistent space-time
structure is taken into account, leading to a new picture of black-hole
interiors.
| gr-qc hep-th | canonical quantization is often used to suggest new effects in quantum gravity in the dynamics as well as the structure of spacetime usually possible phenomena are first seen in a modified version of the classical dynamics for instance in an effective friedmann equation but there should also be implications for a modified spacetime structure quantum spacetime effects however are often ignored in this setting because they are not obvious they require a careful analysis of gauge transformations and the anomaly problem it is shown here how modified spacetime structures and effective line elements can be derived unambiguously provided an offshell anomalyfree system of modified constraints exists the resulting effective line elements reveal signature change as an inescapable consequence of nonclassical gauge transformations in the presence of holonomy modifications the general framework is then specialized to blackhole models in loop quantum gravity in contrast to previous studies a selfconsistent spacetime structure is taken into account leading to a new picture of blackhole interiors | [['canonical', 'quantization', 'is', 'often', 'used', 'to', 'suggest', 'new', 'effects', 'in', 'quantum', 'gravity', 'in', 'the', 'dynamics', 'as', 'well', 'as', 'the', 'structure', 'of', 'spacetime', 'usually', 'possible', 'phenomena', 'are', 'first', 'seen', 'in', 'a', 'modified', 'version', 'of', 'the', 'classical', 'dynamics', 'for', 'instance', 'in', 'an', 'effective', 'friedmann', 'equation', 'but', 'there', 'should', 'also', 'be', 'implications', 'for', 'a', 'modified', 'spacetime', 'structure', 'quantum', 'spacetime', 'effects', 'however', 'are', 'often', 'ignored', 'in', 'this', 'setting', 'because', 'they', 'are', 'not', 'obvious', 'they', 'require', 'a', 'careful', 'analysis', 'of', 'gauge', 'transformations', 'and', 'the', 'anomaly', 'problem', 'it', 'is', 'shown', 'here', 'how', 'modified', 'spacetime', 'structures', 'and', 'effective', 'line', 'elements', 'can', 'be', 'derived', 'unambiguously', 'provided', 'an', 'offshell', 'anomalyfree', 'system', 'of', 'modified', 'constraints', 'exists', 'the', 'resulting', 'effective', 'line', 'elements', 'reveal', 'signature', 'change', 'as', 'an', 'inescapable', 'consequence', 'of', 'nonclassical', 'gauge', 'transformations', 'in', 'the', 'presence', 'of', 'holonomy', 'modifications', 'the', 'general', 'framework', 'is', 'then', 'specialized', 'to', 'blackhole', 'models', 'in', 'loop', 'quantum', 'gravity', 'in', 'contrast', 'to', 'previous', 'studies', 'a', 'selfconsistent', 'spacetime', 'structure', 'is', 'taken', 'into', 'account', 'leading', 'to', 'a', 'new', 'picture', 'of', 'blackhole', 'interiors']] | [-0.12029139932035181, 0.1275117525504435, -0.1325946649026994, 0.1529838213298964, -0.12722290922416213, -0.1478966793626041, -0.02511151395249468, 0.3452933214742828, -0.24323480982724346, -0.294931748887685, 0.06957602347204185, -0.22033342972604764, -0.195553538326266, 0.17082108162849405, -0.07975439411404048, 0.029814978857398217, 0.02608137917316829, 0.0383023955732768, -0.08446517387472588, -0.21205472810721898, 0.3319833778207087, 0.09097884261454628, 0.25215025767281557, 0.03321941714822947, 0.08871613630886983, -0.029245833849051484, -0.01943246173143479, 0.09333862297029959, -0.08408785790613174, 0.02687011832618557, 0.2409162784729738, 0.0937017528426454, 0.1873338976458152, -0.4494306908598469, -0.28641679269595094, 0.07118131833748868, 0.1821212403240533, 0.18651196015078897, -0.055296345303455986, -0.2841780179188828, 0.038022259265463945, -0.15875063719009452, -0.1426895912176136, -0.09623403086637457, 0.014443362462276847, -0.09520175108861431, -0.23105874554689596, 0.07053324678498837, 0.07934673768425084, 0.018385190873142377, -0.046021871123589395, -0.06572266729450842, -0.009001693290221378, 0.10552022483107852, 0.058614819930050015, 0.019871547457440124, 0.12733200060657834, -0.12073638973567911, -0.12369444930960459, 0.45087952065615006, -0.06143131523743778, -0.2521677747581522, 0.15266611309791053, -0.11336981911315686, -0.17687216790875904, 0.10002766552461702, 0.1447856053228513, 0.13067249597278768, -0.17092053966566542, 0.12801071188202773, -9.461646514404335e-05, 0.1616093795976521, 0.03670774122562121, 0.08388745532274809, 0.2650692329776508, 0.0888708588267665, 0.018949091397829493, 0.09579760862232681, 0.0027980253669536775, -0.14823345044077327, -0.3621447781994824, -0.15842456307929056, -0.11508718123343302, 0.08172627184822089, -0.09000332581930662, -0.1746414259144746, 0.3174147764623257, 0.1341329549527641, 0.16329820486314503, -0.04547424129796801, 0.25349499316480767, 0.13191623943584777, 0.0934266521319471, 0.05424202400774201, 0.2729852585995823, 0.14845823464961147, 0.0812687230166903, -0.20851932610615076, 0.01761901595077857, 0.07402524030709892] |
1,803.0112 | Sharp moderate maximal inequalities for upward skip-free Markov chains | The $L^p$ maximal inequalities for martingales are one of the classical
results in probability theory. Here we establish the sharp moderate maximal
inequalities for upward skip-free Markov chains, which include the $L^p$
maximal inequalities as special cases. Furthermore, we apply our theory to two
specific examples and obtain their moderate maximal inequalities: the first one
is the M/M/1 queue and the second one is an upward skip-free Markov chain with
large death jumps. These two examples have the same total birth and death
rates. However, the former exhibits a phase transition phenomenon while the
latter does not.
| math.PR | the lp maximal inequalities for martingales are one of the classical results in probability theory here we establish the sharp moderate maximal inequalities for upward skipfree markov chains which include the lp maximal inequalities as special cases furthermore we apply our theory to two specific examples and obtain their moderate maximal inequalities the first one is the mm1 queue and the second one is an upward skipfree markov chain with large death jumps these two examples have the same total birth and death rates however the former exhibits a phase transition phenomenon while the latter does not | [['the', 'lp', 'maximal', 'inequalities', 'for', 'martingales', 'are', 'one', 'of', 'the', 'classical', 'results', 'in', 'probability', 'theory', 'here', 'we', 'establish', 'the', 'sharp', 'moderate', 'maximal', 'inequalities', 'for', 'upward', 'skipfree', 'markov', 'chains', 'which', 'include', 'the', 'lp', 'maximal', 'inequalities', 'as', 'special', 'cases', 'furthermore', 'we', 'apply', 'our', 'theory', 'to', 'two', 'specific', 'examples', 'and', 'obtain', 'their', 'moderate', 'maximal', 'inequalities', 'the', 'first', 'one', 'is', 'the', 'mm1', 'queue', 'and', 'the', 'second', 'one', 'is', 'an', 'upward', 'skipfree', 'markov', 'chain', 'with', 'large', 'death', 'jumps', 'these', 'two', 'examples', 'have', 'the', 'same', 'total', 'birth', 'and', 'death', 'rates', 'however', 'the', 'former', 'exhibits', 'a', 'phase', 'transition', 'phenomenon', 'while', 'the', 'latter', 'does', 'not']] | [-0.09730208371573887, 0.18822957809727048, -0.018296825267451324, 0.14289029454572377, -0.0688540135731095, -0.21208467446363619, 0.07877598239766606, 0.34649876849821853, -0.28476869722482623, -0.21756225099940737, 0.20436139124416813, -0.3011242905559652, -0.1073677460711027, 0.2095988011659728, -0.07233823385070433, 0.03552099653116437, 0.03238058998969566, 0.07849849553145084, -0.08203581740753245, -0.2462988968688956, 0.2711109997147752, -0.019726996902033167, 0.2581086972699568, 0.05359376412960365, 0.09264631817578194, -0.021961945161876297, 0.01958798148582891, -0.03994079521896882, -0.19076160037621243, 0.10389659634416866, 0.22590174778489416, 0.10259402923036329, 0.3119808150090508, -0.4088692759096469, -0.1869680138746488, 0.16955549473221385, 0.10872053825080433, 0.12931413779673695, -0.010475802321716682, -0.2610290684213996, 0.022798298666080862, -0.1491486185695976, -0.15683809382188105, -0.02385495959291446, -0.012072866052850005, 0.08542218361801189, -0.2815072565512328, 0.11723330144568817, 0.15223051791953057, 0.027762458525290808, -0.04010449912994332, -0.09360582984806298, -0.03004354340523558, 0.1160879530076816, 0.08068966980154636, -0.0316471657223673, 0.07054009185335838, -0.04119935161290095, -0.18271351285931683, 0.2697831572503927, -0.06838891214508679, -0.17719957126906385, 0.19344236292713082, -0.2245104889164573, -0.193386579004414, 0.12981960292036654, 0.10546157239773071, 0.1414435228102447, -0.14684344071069175, 0.06850378804650523, -0.06203182490984189, 0.09036850180361689, 0.05983743204773625, 0.04624255047631018, 0.0972320549574095, 0.07971208667401801, 0.16422420840580784, 0.1973443111697615, -0.0685092058061555, -0.1878466581296867, -0.3476496683913715, -0.16498330018492705, -0.16591876174908937, 0.037133963687553014, -0.18424683247561466, -0.1687500549806762, 0.3288236184948191, 0.06889389570099495, 0.17161432527408926, 0.1390401766906713, 0.19119776028314048, 0.18360144413105145, 0.0397793128870466, 0.0779745389764994, 0.1964758951793012, 0.19857395413456505, 0.09495857291970133, -0.1777433014799452, 0.12522816107867613, 0.10556510082186804] |
1,803.01121 | A Spin Analogue of Kerov Polynomials | Kerov polynomials describe normalized irreducible characters of the symmetric
groups in terms of the free cumulants associated with Young diagrams. We
suggest well-suited counterparts of the Kerov polynomials in spin (or
projective) representation settings. We show that spin analogues of irreducible
characters are polynomials in even free cumulants associated with double
diagrams of strict partitions. Moreover, we present a conjecture for the
positivity of their coefficients.
| math.CO | kerov polynomials describe normalized irreducible characters of the symmetric groups in terms of the free cumulants associated with young diagrams we suggest wellsuited counterparts of the kerov polynomials in spin or projective representation settings we show that spin analogues of irreducible characters are polynomials in even free cumulants associated with double diagrams of strict partitions moreover we present a conjecture for the positivity of their coefficients | [['kerov', 'polynomials', 'describe', 'normalized', 'irreducible', 'characters', 'of', 'the', 'symmetric', 'groups', 'in', 'terms', 'of', 'the', 'free', 'cumulants', 'associated', 'with', 'young', 'diagrams', 'we', 'suggest', 'wellsuited', 'counterparts', 'of', 'the', 'kerov', 'polynomials', 'in', 'spin', 'or', 'projective', 'representation', 'settings', 'we', 'show', 'that', 'spin', 'analogues', 'of', 'irreducible', 'characters', 'are', 'polynomials', 'in', 'even', 'free', 'cumulants', 'associated', 'with', 'double', 'diagrams', 'of', 'strict', 'partitions', 'moreover', 'we', 'present', 'a', 'conjecture', 'for', 'the', 'positivity', 'of', 'their', 'coefficients']] | [-0.21166250808693637, 0.156870206812252, -0.0944396793475431, 0.10009899702290016, -0.06143234798571828, -0.05163192920471457, -0.005784242092913976, 0.3698049473689135, -0.280701658039382, -0.18180540599154704, 0.0600696899451908, -0.2568923066842906, -0.1709737222902759, 0.1946919231612066, -0.0945600264310611, -0.018998701520489925, 0.05782391270269838, 0.07941030722224351, -0.15692566925038895, -0.2887169696447073, 0.3698973313369083, -0.05000327773582698, 0.21179393760747078, 0.00821568347711229, 0.10832711423493245, 0.05000284712084315, -0.07609708903526718, -0.06487007120934625, -0.1190034021438447, 0.1410556792027571, 0.3188712915395048, 0.04427397677279783, 0.10407956046136943, -0.3458143597976728, -0.06339282750250828, 0.2251943816063982, 0.16610701579360687, 0.018050945166385536, -0.0110600325772821, -0.25062596240560664, 0.05453668797483922, -0.2341426067816263, -0.21696762617846782, -0.11903109840314949, 0.011122673598231015, 0.113997879776765, -0.22903306104920126, 0.11830154696310108, 0.09678333416355378, 0.14152416203058127, -0.05257000365633179, -0.19937383030738795, -0.022734879283234477, 0.08408735993417037, -0.036101387587912155, -0.0701104557339215, 0.03135465670405238, -0.2016649448566816, -0.21012355161435675, 0.36121196017572377, -0.0036060532244543233, -0.2520997170358896, 0.12828637675071755, -0.26790633481560333, -0.209318866480537, 0.13790319936180656, 0.09252479051550229, 0.1569512978153811, -0.02750495784549099, 0.1337653292681683, -0.10281179117560951, 0.035611130133144216, 0.13301519952559224, 0.03665073119301462, 0.19672192288844875, -0.05180626922766819, -0.012340216347101059, 0.24543820753354917, 0.0272554939200001, -0.0833894456595634, -0.31156235649673775, -0.21732397702042805, -0.1337975056446863, 0.05205108946062286, -0.16553195164482476, -0.2082303068424208, 0.3861254414712841, 0.10832025488894997, 0.14180682187769422, 0.15196214853362602, 0.17091649735459324, 0.1302333420819857, 0.08959480237822529, 0.02139831696298312, 0.06958514110495646, 0.29281607390183845, -0.019569673180354363, -0.1751789009537209, 0.046203191466206175, 0.20541263707546573] |
1,803.01122 | An Ensemble Framework of Voice-Based Emotion Recognition System for
Films and TV Programs | Employing voice-based emotion recognition function in artificial intelligence
(AI) product will improve the user experience. Most of researches that have
been done only focus on the speech collected under controlled conditions. The
scenarios evaluated in these research were well controlled. The conventional
approach may fail when background noise or nonspeech filler exist. In this
paper, we propose an ensemble framework combining several aspects of features
from audio. The framework incorporates gender and speaker information relying
on multi-task learning. Therefore it is able to dig and capture emotional
information as much as possible. This framework is evaluated on multimodal
emotion challenge (MEC) 2017 corpus which is close to real world. The proposed
framework outperformed the best baseline system by 29.5% (relative
improvement).
| eess.AS cs.SD | employing voicebased emotion recognition function in artificial intelligence ai product will improve the user experience most of researches that have been done only focus on the speech collected under controlled conditions the scenarios evaluated in these research were well controlled the conventional approach may fail when background noise or nonspeech filler exist in this paper we propose an ensemble framework combining several aspects of features from audio the framework incorporates gender and speaker information relying on multitask learning therefore it is able to dig and capture emotional information as much as possible this framework is evaluated on multimodal emotion challenge mec 2017 corpus which is close to real world the proposed framework outperformed the best baseline system by 295 relative improvement | [['employing', 'voicebased', 'emotion', 'recognition', 'function', 'in', 'artificial', 'intelligence', 'ai', 'product', 'will', 'improve', 'the', 'user', 'experience', 'most', 'of', 'researches', 'that', 'have', 'been', 'done', 'only', 'focus', 'on', 'the', 'speech', 'collected', 'under', 'controlled', 'conditions', 'the', 'scenarios', 'evaluated', 'in', 'these', 'research', 'were', 'well', 'controlled', 'the', 'conventional', 'approach', 'may', 'fail', 'when', 'background', 'noise', 'or', 'nonspeech', 'filler', 'exist', 'in', 'this', 'paper', 'we', 'propose', 'an', 'ensemble', 'framework', 'combining', 'several', 'aspects', 'of', 'features', 'from', 'audio', 'the', 'framework', 'incorporates', 'gender', 'and', 'speaker', 'information', 'relying', 'on', 'multitask', 'learning', 'therefore', 'it', 'is', 'able', 'to', 'dig', 'and', 'capture', 'emotional', 'information', 'as', 'much', 'as', 'possible', 'this', 'framework', 'is', 'evaluated', 'on', 'multimodal', 'emotion', 'challenge', 'mec', '2017', 'corpus', 'which', 'is', 'close', 'to', 'real', 'world', 'the', 'proposed', 'framework', 'outperformed', 'the', 'best', 'baseline', 'system', 'by', '295', 'relative', 'improvement']] | [-0.026174564461015966, 0.02356338579015718, -0.0703434596099883, 0.06598275393913385, -0.11212830914931049, -0.19074199193211133, 0.0025379866879233276, 0.43351852823018044, -0.20252898834310934, -0.34725209507823745, 0.06340231022447317, -0.29318930953741074, -0.21872862575437166, 0.20775541521739677, -0.16302703626931084, 0.07480923572559033, 0.0957459870462252, 0.09643519884321747, -0.019153560140874423, -0.303898113468, 0.3066589868827608, 0.056326040493955544, 0.40211608973601143, 0.06744980429297251, 0.104427443486292, -0.027765561116489867, -0.05802797114819073, -0.035879552848290745, -0.03423337682761485, 0.14134804362408077, 0.3573235085826706, 0.23054175107539746, 0.31325488572185933, -0.4171800553521588, -0.2265983862756205, 0.07648946961180177, 0.14618804041019157, 0.0831650205039273, -0.01707155265064125, -0.40190914220923235, 0.07289141923004439, -0.21811598236865, 0.026859317123043267, -0.1144719097536242, -0.020734030476286393, -0.046573720088763516, -0.26115235302997525, 0.024727098343601404, 0.08815605711695317, 0.13406631811560432, -0.059529895692186294, -0.1664735986591386, 0.0869495843302397, 0.19791503890522386, 0.07282079223058502, 0.06268808262784434, 0.20022480516917696, -0.14747153174840222, -0.1346970970573073, 0.37306474596223493, -0.06639920919941168, -0.2187508114301869, 0.1995869261949984, -0.02420977696445424, -0.13474742634498998, 0.05840924390099081, 0.2566944227115182, 0.0966300905974628, -0.2145557911468387, 0.012404192407415363, -0.024854300843844237, 0.2111469775030374, 0.08146268571390239, -0.004370340492483998, 0.18448759217492558, 0.24815102514025777, 0.008350768128471556, 0.10447511698642731, -0.09758625222824144, -0.08103331959708247, -0.1749921259200893, -0.06764071144563846, -0.18679106222034608, -0.034280782609731573, -0.024558418141514417, -0.0781548033614666, 0.36726956128735433, 0.23705612816212868, 0.1508587961785557, 0.03127762718676505, 0.34399257810239886, 0.04930749804759013, 0.08242472668162985, 0.06225352466091021, 0.1969971391978512, -0.024656292776507903, 0.15778280532541722, -0.17281932728740287, 0.12415390307745658, 0.005823978122847139] |
1,803.01123 | Relaxation rates of gene expression kinetics reveal the feedback signs
of autoregulatory gene networks | The transient response to a stimulus and subsequent recovery to a steady
state are the fundamental characteristics of a living organism. Here we study
the relaxation kinetics of autoregulatory gene networks based on the chemical
master equation model of single-cell stochastic gene expression with nonlinear
feedback regulation. We report a novel relation between the rate of relaxation,
characterized by the spectral gap of the Markov model, and the feedback sign of
the underlying gene circuit. When a network has no feedback, the relaxation
rate is exactly the decaying rate of the protein. We further show that positive
feedback always slows down the relaxation kinetics while negative feedback
always speeds it up. Numerical simulations demonstrate that this relation
provides a possible method to infer the feedback topology of autoregulatory
gene networks by using time-series data of gene expression.
| q-bio.MN cond-mat.stat-mech q-bio.QM | the transient response to a stimulus and subsequent recovery to a steady state are the fundamental characteristics of a living organism here we study the relaxation kinetics of autoregulatory gene networks based on the chemical master equation model of singlecell stochastic gene expression with nonlinear feedback regulation we report a novel relation between the rate of relaxation characterized by the spectral gap of the markov model and the feedback sign of the underlying gene circuit when a network has no feedback the relaxation rate is exactly the decaying rate of the protein we further show that positive feedback always slows down the relaxation kinetics while negative feedback always speeds it up numerical simulations demonstrate that this relation provides a possible method to infer the feedback topology of autoregulatory gene networks by using timeseries data of gene expression | [['the', 'transient', 'response', 'to', 'a', 'stimulus', 'and', 'subsequent', 'recovery', 'to', 'a', 'steady', 'state', 'are', 'the', 'fundamental', 'characteristics', 'of', 'a', 'living', 'organism', 'here', 'we', 'study', 'the', 'relaxation', 'kinetics', 'of', 'autoregulatory', 'gene', 'networks', 'based', 'on', 'the', 'chemical', 'master', 'equation', 'model', 'of', 'singlecell', 'stochastic', 'gene', 'expression', 'with', 'nonlinear', 'feedback', 'regulation', 'we', 'report', 'a', 'novel', 'relation', 'between', 'the', 'rate', 'of', 'relaxation', 'characterized', 'by', 'the', 'spectral', 'gap', 'of', 'the', 'markov', 'model', 'and', 'the', 'feedback', 'sign', 'of', 'the', 'underlying', 'gene', 'circuit', 'when', 'a', 'network', 'has', 'no', 'feedback', 'the', 'relaxation', 'rate', 'is', 'exactly', 'the', 'decaying', 'rate', 'of', 'the', 'protein', 'we', 'further', 'show', 'that', 'positive', 'feedback', 'always', 'slows', 'down', 'the', 'relaxation', 'kinetics', 'while', 'negative', 'feedback', 'always', 'speeds', 'it', 'up', 'numerical', 'simulations', 'demonstrate', 'that', 'this', 'relation', 'provides', 'a', 'possible', 'method', 'to', 'infer', 'the', 'feedback', 'topology', 'of', 'autoregulatory', 'gene', 'networks', 'by', 'using', 'timeseries', 'data', 'of', 'gene', 'expression']] | [-0.13140488293168073, 0.08561111540774931, -0.047400587904572924, 0.05638387008828458, -0.06185760799910955, -0.1557314849669372, 0.11634418114605122, 0.354964453706613, -0.3144652122889992, -0.2537028072758775, 0.06201224746590439, -0.22561781495524041, -0.24383063379158504, 0.1938698095826935, 0.010124646188405743, 0.02725247380044991, 0.08306132003420243, 0.056708784488430856, 0.01935364643280075, -0.19265085975911442, 0.29128002222749766, 0.09418833677412221, 0.30275568690654026, 0.021886683120154335, 0.16720703164757958, -0.08206392587400484, -0.03132848185317142, -0.010259026079438627, -0.15320189349872934, 0.08957023149097923, 0.2186709953536599, 0.18596579709403, 0.3063411275468712, -0.45976599954394964, -0.2516448765476472, 0.09217485856693101, 0.14344628109663798, 0.1952158245003109, -0.07654382302200619, -0.21497159755115744, 0.057885001600468465, -0.15142486591476703, -0.051003862474875074, -0.05760255625240342, 0.02130096829258395, 0.0380368754707171, -0.2843347863552507, 0.16817051341526046, 0.07686005876889031, 0.04709654294606978, -0.10037787971392709, -0.05143805440977542, -0.06742064763594718, 0.17508854833962634, 0.03613821064363349, 0.015689829960091543, 0.18592601371113293, -0.14885324012508522, -0.14903456561036243, 0.279918250559836, -0.05816187054670015, -0.207657426833617, 0.19482125966456196, -0.14543996244179505, -0.10139623903975326, 0.1602132686610966, 0.17293815352498507, 0.07483933275619889, -0.2378610801008015, 0.031658877233675525, 0.011967609762248114, 0.21771056667296557, 0.046307331790644536, -0.03290228397214962, 0.13969868068059865, 0.23996600850458075, 0.05289790117909221, 0.14731630072487098, -0.07145461539761673, -0.1234993677774111, -0.2263196769245241, -0.10405924467940944, -0.1413827713198253, 0.1203557975304714, -0.11510388947403853, -0.1612537156749707, 0.4124270281108626, 0.07741327853669433, 0.1962730360632069, 0.11812068882948944, 0.28471096898735004, 0.12922960224418636, 0.043913376599594434, 0.0455231629142089, 0.18043730320259385, 0.1533195294922449, 0.11445068591274321, -0.38333904925890155, 0.1501328010744259, 0.033950467332245875] |
1,803.01124 | High accuracy water potential energy surface for the calculation of
infrared spectra | Transition intensities for small molecules such as water and CO$_2$ can now
be computed with such high accuracy that they are being used to systematically
replace measurements in standard databases. These calculations use high
accuracy ab initio dipole moment surfaces and wavefunctions from
spectroscopically-determined potential energy surfaces. Here an extra high
accuracy potential energy surface (PES) of the water molecule (\hato) is
produced starting from an ab initio PES which is then refined to empirical
rovibrational energy levels. Variational nuclear motion calculations using this
PES reproduce the fitted energy levels with a standard deviation of 0.011 \cm,
approximately three times their stated uncertainty. Use of wavefunctions
computed with this refined PES is found to improve the predicted transition
intensities for selected (problematic) transitions. A new room temperature line
list for H2(16)O is presented. It is suggested that the associated set of line
intensities is the most accurate available to date for this species.
| physics.chem-ph physics.ao-ph | transition intensities for small molecules such as water and co_2 can now be computed with such high accuracy that they are being used to systematically replace measurements in standard databases these calculations use high accuracy ab initio dipole moment surfaces and wavefunctions from spectroscopicallydetermined potential energy surfaces here an extra high accuracy potential energy surface pes of the water molecule hato is produced starting from an ab initio pes which is then refined to empirical rovibrational energy levels variational nuclear motion calculations using this pes reproduce the fitted energy levels with a standard deviation of 0011 cm approximately three times their stated uncertainty use of wavefunctions computed with this refined pes is found to improve the predicted transition intensities for selected problematic transitions a new room temperature line list for h216o is presented it is suggested that the associated set of line intensities is the most accurate available to date for this species | [['transition', 'intensities', 'for', 'small', 'molecules', 'such', 'as', 'water', 'and', 'co_2', 'can', 'now', 'be', 'computed', 'with', 'such', 'high', 'accuracy', 'that', 'they', 'are', 'being', 'used', 'to', 'systematically', 'replace', 'measurements', 'in', 'standard', 'databases', 'these', 'calculations', 'use', 'high', 'accuracy', 'ab', 'initio', 'dipole', 'moment', 'surfaces', 'and', 'wavefunctions', 'from', 'spectroscopicallydetermined', 'potential', 'energy', 'surfaces', 'here', 'an', 'extra', 'high', 'accuracy', 'potential', 'energy', 'surface', 'pes', 'of', 'the', 'water', 'molecule', 'hato', 'is', 'produced', 'starting', 'from', 'an', 'ab', 'initio', 'pes', 'which', 'is', 'then', 'refined', 'to', 'empirical', 'rovibrational', 'energy', 'levels', 'variational', 'nuclear', 'motion', 'calculations', 'using', 'this', 'pes', 'reproduce', 'the', 'fitted', 'energy', 'levels', 'with', 'a', 'standard', 'deviation', 'of', '0011', 'cm', 'approximately', 'three', 'times', 'their', 'stated', 'uncertainty', 'use', 'of', 'wavefunctions', 'computed', 'with', 'this', 'refined', 'pes', 'is', 'found', 'to', 'improve', 'the', 'predicted', 'transition', 'intensities', 'for', 'selected', 'problematic', 'transitions', 'a', 'new', 'room', 'temperature', 'line', 'list', 'for', 'h216o', 'is', 'presented', 'it', 'is', 'suggested', 'that', 'the', 'associated', 'set', 'of', 'line', 'intensities', 'is', 'the', 'most', 'accurate', 'available', 'to', 'date', 'for', 'this', 'species']] | [-0.031455226217052636, 0.0930421210666038, -0.033916981330786654, 0.10535052861771821, 0.006825219715026274, -0.120957231316472, 0.06555902069393436, 0.43187869531315526, -0.227278603969014, -0.3632941648449286, 0.031089717740637367, -0.30845835667371363, -0.046688635748199696, 0.16926339885609504, 0.007590509814155453, 0.07726224925935123, 0.08586103810161791, 0.005767078084104201, -0.06969185001323353, -0.19275096422243937, 0.237748815994588, 0.1142855282124205, 0.21538799123083746, 0.09891030915671947, 0.05838232080214748, -0.07763326980076195, 0.04606583804535844, 0.006154854008867071, -0.14396441189218023, 0.1707944843029372, 0.2793250110683646, 0.05807309443118915, 0.16011357731703255, -0.43288069080829233, -0.23184150614885285, 0.053237030310008454, 0.09366936716738042, 0.13490155483124278, -0.04001902571863729, -0.25195283213100744, 0.0395907411029185, -0.1332860984596016, -0.1493096731837498, -0.15241233897060644, 0.031933445787799906, 0.037099224080033355, -0.2628509440380179, 0.076201346595589, -0.08148403344976447, 0.10911964652730757, -0.10654378435239682, -0.205934945490893, -0.08526425827766336, 0.10345419998633755, 0.003130954105918314, 0.09370479991376474, 0.16737615509457837, -0.07102454494946679, -0.0651053278798274, 0.4257337225759341, -0.09676436174149607, -0.13048678765596908, 0.18916841448905566, -0.12249297591754132, -0.14752244533897907, 0.24695025600365125, 0.10101950809578686, 0.11652924919963564, -0.15849810380342544, 0.034640859102592896, 0.03784462031634415, 0.21084975464318215, 0.09048892424314045, -0.009269705920303666, 0.19176781556745565, 0.12897945116304493, -0.005162342810650277, 0.050493547826049714, -0.16602661749203476, -0.06646592213218314, -0.2463363112753951, -0.13665191990882997, -0.22790176130746023, 0.04391402885351282, -0.03423486362813266, -0.13865021606481154, 0.34714051758493086, 0.13050323252732032, 0.16121560095328522, 0.027433391758605985, 0.283676497793446, 0.1570570290955491, 0.05518279157980692, 0.040848362095215744, 0.26179720178319543, 0.11303099499272755, 0.043508694519355795, -0.2123317314582737, 0.04032168558378722, 0.011792841201550722] |
1,803.01125 | Dispersively Formed Quasi-Periodic Fast Magnetosonic Wavefronts Due to
the Eruption of a Nearby Mini-filament | The observational analysis is performed to study the excitation mechanism and
the propagation properties of a quasi-periodic fast-propagating (QFP)
magnetosonic wave. The QFP wave was associated with the eruption of a nearby
mini-filament and a small B4 GOES flare, which may indicate that the generation
of a QFP wave do not need too much flare energy. The propagation of the QFP
wave was along a bundle of funnel-shaped open loops with a speed of about
1100+/-78, and an acceleration of -2.2+/-1.1. Periodicity analysis indicates
that the periods of the QFP wave are 43+/-6, 79+/-18 second. For the first
time, we find that the periods of the QFP wave and the accompanying flare are
inconsistent, which is different from the findings as reported in previous
studies. We propose that the present QFP wave was possibly caused by the
mechanism of dispersive evolution of an initially broadband disturbance
resulted from the nearby mini-filament eruption.
| astro-ph.SR | the observational analysis is performed to study the excitation mechanism and the propagation properties of a quasiperiodic fastpropagating qfp magnetosonic wave the qfp wave was associated with the eruption of a nearby minifilament and a small b4 goes flare which may indicate that the generation of a qfp wave do not need too much flare energy the propagation of the qfp wave was along a bundle of funnelshaped open loops with a speed of about 110078 and an acceleration of 2211 periodicity analysis indicates that the periods of the qfp wave are 436 7918 second for the first time we find that the periods of the qfp wave and the accompanying flare are inconsistent which is different from the findings as reported in previous studies we propose that the present qfp wave was possibly caused by the mechanism of dispersive evolution of an initially broadband disturbance resulted from the nearby minifilament eruption | [['the', 'observational', 'analysis', 'is', 'performed', 'to', 'study', 'the', 'excitation', 'mechanism', 'and', 'the', 'propagation', 'properties', 'of', 'a', 'quasiperiodic', 'fastpropagating', 'qfp', 'magnetosonic', 'wave', 'the', 'qfp', 'wave', 'was', 'associated', 'with', 'the', 'eruption', 'of', 'a', 'nearby', 'minifilament', 'and', 'a', 'small', 'b4', 'goes', 'flare', 'which', 'may', 'indicate', 'that', 'the', 'generation', 'of', 'a', 'qfp', 'wave', 'do', 'not', 'need', 'too', 'much', 'flare', 'energy', 'the', 'propagation', 'of', 'the', 'qfp', 'wave', 'was', 'along', 'a', 'bundle', 'of', 'funnelshaped', 'open', 'loops', 'with', 'a', 'speed', 'of', 'about', '110078', 'and', 'an', 'acceleration', 'of', '2211', 'periodicity', 'analysis', 'indicates', 'that', 'the', 'periods', 'of', 'the', 'qfp', 'wave', 'are', '436', '7918', 'second', 'for', 'the', 'first', 'time', 'we', 'find', 'that', 'the', 'periods', 'of', 'the', 'qfp', 'wave', 'and', 'the', 'accompanying', 'flare', 'are', 'inconsistent', 'which', 'is', 'different', 'from', 'the', 'findings', 'as', 'reported', 'in', 'previous', 'studies', 'we', 'propose', 'that', 'the', 'present', 'qfp', 'wave', 'was', 'possibly', 'caused', 'by', 'the', 'mechanism', 'of', 'dispersive', 'evolution', 'of', 'an', 'initially', 'broadband', 'disturbance', 'resulted', 'from', 'the', 'nearby', 'minifilament', 'eruption']] | [-0.21356957621018713, 0.2052391405669429, -0.055267693571125466, 0.07796883555905272, -0.11639176946133376, -0.035296742925420406, 0.029626487724793454, 0.4007220594398677, -0.1938948323080937, -0.2844919673353434, 0.12738292889281486, -0.2575099753111135, -0.14741841934155672, 0.23487222257458296, 0.02716708227992058, 0.020101987045879167, 0.11102464633838584, 0.006937094237655401, -0.023994719410936036, -0.1390089047366443, 0.27869332416448744, 0.09745947149582207, 0.21531644376344047, 0.0019134270586073398, 0.06466058077601095, -0.0684561950294301, -0.032322640083730224, -0.06072269577222566, -0.08230730543941414, 0.05587522624991834, 0.1493998016168674, 0.11555502374346058, 0.2731604219848911, -0.45240337781608103, -0.2976854563007752, 0.0012476586177945137, 0.17196942895806083, 0.07275319744988035, -0.023808763753622772, -0.2892208397264282, 0.050523424409329894, -0.1351942602607111, -0.1829114633705467, 0.07381506501076122, 0.05160166149027646, 0.07033988175797276, -0.246729043967401, 0.11666102436681589, 0.05939061276925107, 0.03763789790992936, -0.1196035784141471, -0.01885762804498275, -0.07884590994566679, 0.05838510246326526, 0.1365841780323535, 0.1110970034248506, 0.08520992503152229, -0.09107811621113797, -0.12185881501063704, 0.3588847941082592, -0.05811810446747889, -0.03664616983383894, 0.17967550063350549, -0.19473407927706526, -0.10970769727059329, 0.2321590909206619, 0.15554313015503188, 0.07478795468186339, -0.10006527113417785, -0.05536134398697565, -0.025362852115746744, 0.16517705300434804, 0.10076999611842136, 0.0058808727376163, 0.23110321979348858, 0.12352074003312737, 0.015487745294036964, 0.12936077322810888, -0.19507154724289041, -0.027011541876321037, -0.3171953998350849, -0.13244983363275728, -0.11663891539598505, 0.06635743166999115, -0.018063607373818135, -0.1879925716202706, 0.4675030596368015, 0.13097912357111152, 0.19396363742649556, -0.017583704341668636, 0.2448754292850693, 0.1485492431682845, 0.05630026215532174, 0.1431029124992589, 0.3245607492576043, 0.137550260804904, 0.1792900474431614, -0.23369206341468574, 0.07404626504828532, 0.020773419067263602] |
1,803.01126 | On Developers' Personality in Large-scale Distributed Projects: The Case
of the Apache Ecosystem | Large-scale distributed projects are typically the results of collective
efforts performed by multiple developers, each one having a different
personality. The study of developers' personalities has the potential of
explaining their' behavior in various contexts. For example, the propensity to
trust others, a critical factor to the success of global software engineering -
has been found to influence positively the result of code reviews in
distributed projects. In this paper, we perform a quantitative analysis of
developers' personality in open source software projects, intended as an
extreme form of distributed projects in which no single organization controls
the project. We mine ecosystem-level data from the code commits and email
messages contributed by the developers working on the Apache Software
Foundation (ASF) projects, as representative of large scale-distributed
projects. We find that developers become over time more conscientious,
agreeable, and neurotic. Moreover, personality traits do not vary with their
role, membership, and extent of contribution to the projects. We also find
evidence that more open and more agreeable developers are more likely to become
project contributors.
| cs.SE | largescale distributed projects are typically the results of collective efforts performed by multiple developers each one having a different personality the study of developers personalities has the potential of explaining their behavior in various contexts for example the propensity to trust others a critical factor to the success of global software engineering has been found to influence positively the result of code reviews in distributed projects in this paper we perform a quantitative analysis of developers personality in open source software projects intended as an extreme form of distributed projects in which no single organization controls the project we mine ecosystemlevel data from the code commits and email messages contributed by the developers working on the apache software foundation asf projects as representative of large scaledistributed projects we find that developers become over time more conscientious agreeable and neurotic moreover personality traits do not vary with their role membership and extent of contribution to the projects we also find evidence that more open and more agreeable developers are more likely to become project contributors | [['largescale', 'distributed', 'projects', 'are', 'typically', 'the', 'results', 'of', 'collective', 'efforts', 'performed', 'by', 'multiple', 'developers', 'each', 'one', 'having', 'a', 'different', 'personality', 'the', 'study', 'of', 'developers', 'personalities', 'has', 'the', 'potential', 'of', 'explaining', 'their', 'behavior', 'in', 'various', 'contexts', 'for', 'example', 'the', 'propensity', 'to', 'trust', 'others', 'a', 'critical', 'factor', 'to', 'the', 'success', 'of', 'global', 'software', 'engineering', 'has', 'been', 'found', 'to', 'influence', 'positively', 'the', 'result', 'of', 'code', 'reviews', 'in', 'distributed', 'projects', 'in', 'this', 'paper', 'we', 'perform', 'a', 'quantitative', 'analysis', 'of', 'developers', 'personality', 'in', 'open', 'source', 'software', 'projects', 'intended', 'as', 'an', 'extreme', 'form', 'of', 'distributed', 'projects', 'in', 'which', 'no', 'single', 'organization', 'controls', 'the', 'project', 'we', 'mine', 'ecosystemlevel', 'data', 'from', 'the', 'code', 'commits', 'and', 'email', 'messages', 'contributed', 'by', 'the', 'developers', 'working', 'on', 'the', 'apache', 'software', 'foundation', 'asf', 'projects', 'as', 'representative', 'of', 'large', 'scaledistributed', 'projects', 'we', 'find', 'that', 'developers', 'become', 'over', 'time', 'more', 'conscientious', 'agreeable', 'and', 'neurotic', 'moreover', 'personality', 'traits', 'do', 'not', 'vary', 'with', 'their', 'role', 'membership', 'and', 'extent', 'of', 'contribution', 'to', 'the', 'projects', 'we', 'also', 'find', 'evidence', 'that', 'more', 'open', 'and', 'more', 'agreeable', 'developers', 'are', 'more', 'likely', 'to', 'become', 'project', 'contributors']] | [-0.11858954481145291, 0.03285135656692467, -0.08877020370688914, 0.08987858638670726, -0.1265844167344746, -0.16820400070958916, 0.058497081853239395, 0.4254339471502456, -0.22584564539178603, -0.3482841112559414, 0.09720328347851667, -0.32411046712921737, -0.12685272745004816, 0.20800421275050418, -0.05593004972657802, 0.022750862855248886, 0.08225364085539874, 0.022379297467023995, -0.0056875053163337914, -0.3184322750766498, 0.31336255651842154, 0.10816185109753355, 0.29254010217425797, 0.04647047945831208, -0.026871720305543037, -0.04861621745199913, -0.1126368167376781, -0.02189001341005841, -0.08272744828037382, 0.1530226896822485, 0.3664009596000431, 0.24920686860461155, 0.3995659142904888, -0.40738967704893536, -0.13404129763709843, 0.0493292544774625, 0.15226174438220175, 0.07139054957893004, -0.047794438335665025, -0.30782137838100765, 0.07594276109247367, -0.21414749872617725, -0.13263143462161237, -0.05233890353676774, 0.03972072592001769, 0.02711123768428631, -0.17923014959713413, -0.03505925049637229, 0.027792863859574652, 0.13948185184992032, -0.020618951567206424, -0.13989020000895583, -0.009876287874033557, 0.26201649307074143, 0.11557990042062077, 0.027736296784401888, 0.17139156871728298, -0.15278119002092047, -0.12680639849701153, 0.3767702389896088, -0.012098787007907223, -0.1404088686551425, 0.20963052398864332, -0.06650925117845626, -0.19411491813418064, 0.06134602170695976, 0.2382569682617494, 0.06824397220884616, -0.21136414063717587, 0.020516176695930043, -0.009056607167091156, 0.22885463041027287, 0.03385459824405998, -0.010461113855075845, 0.21390967224482338, 0.16130688528374182, 0.04168643898362929, 0.09700632334493015, 0.0007655988215210422, -0.09667569324858702, -0.21680025647379556, -0.1510107482990756, -0.08848884705766347, 0.022123280999528625, -0.03558848399064649, -0.1694586185087057, 0.38633016113466395, 0.19865195594951401, 0.08764725983024418, 0.0010040521733072516, 0.2517670599496089, -0.012026220639814983, 0.1344051420516782, 0.1207018107218894, 0.1545564198665956, -0.009229465246448196, 0.1545263032551392, -0.16654101506849978, 0.12992257562148346, -0.07505599424415241] |
1,803.01127 | Classification and syzygies of smooth projective varieties with
2-regular structure sheaf | The geometric and algebraic properties of smooth projective varieties with
1-regular structure sheaf are well understood, and the complete classification
of these varieties is a classical result. The aim of this paper is to study the
next case: smooth projective varieties with 2-regular structure sheaf. First,
we give a classification of such varieties using adjunction mappings. Next,
under suitable conditions, we study the syzygies of section rings of those
varieties to understand the structure of the Betti tables, and show a sharp
bound for Castelnuovo-Mumford regularity.
| math.AG | the geometric and algebraic properties of smooth projective varieties with 1regular structure sheaf are well understood and the complete classification of these varieties is a classical result the aim of this paper is to study the next case smooth projective varieties with 2regular structure sheaf first we give a classification of such varieties using adjunction mappings next under suitable conditions we study the syzygies of section rings of those varieties to understand the structure of the betti tables and show a sharp bound for castelnuovomumford regularity | [['the', 'geometric', 'and', 'algebraic', 'properties', 'of', 'smooth', 'projective', 'varieties', 'with', '1regular', 'structure', 'sheaf', 'are', 'well', 'understood', 'and', 'the', 'complete', 'classification', 'of', 'these', 'varieties', 'is', 'a', 'classical', 'result', 'the', 'aim', 'of', 'this', 'paper', 'is', 'to', 'study', 'the', 'next', 'case', 'smooth', 'projective', 'varieties', 'with', '2regular', 'structure', 'sheaf', 'first', 'we', 'give', 'a', 'classification', 'of', 'such', 'varieties', 'using', 'adjunction', 'mappings', 'next', 'under', 'suitable', 'conditions', 'we', 'study', 'the', 'syzygies', 'of', 'section', 'rings', 'of', 'those', 'varieties', 'to', 'understand', 'the', 'structure', 'of', 'the', 'betti', 'tables', 'and', 'show', 'a', 'sharp', 'bound', 'for', 'castelnuovomumford', 'regularity']] | [-0.19909631532649402, -0.0398579144547152, -0.07812526965308068, 0.11394378419039598, -0.0964261161266328, -0.10544104607191024, -0.03057348353891135, 0.35375205782610314, -0.3727305077102988, -0.20109738049985365, 0.11565764114222771, -0.19609479422052933, -0.1745484091969597, 0.19370904158554472, -0.18531996690191674, 0.022883412005856286, 0.053605448438374455, 0.07439717631462182, -0.11507022238964605, -0.3653730085081702, 0.49883082032550213, -0.014066067502595658, 0.25547907606503645, 0.08774506471588189, 0.07010005074444899, -0.0004327613427195438, -0.003679500670757058, -0.028915838046042724, -0.2129805669957382, 0.1912133438000997, 0.3451694333357303, 0.08658554025947354, 0.14020943770802385, -0.40553363390959973, -0.1097420435561257, 0.20386532107692992, 0.08013062814770397, 0.07275944432720195, 0.014236637272027343, -0.2424979631783614, 0.09331485838629305, -0.1256220530945981, -0.2013234945100754, -0.12992253061383963, 0.003878079484715018, 0.08674590114699027, -0.22095256787115644, -0.027847907635881457, 0.14070319341154508, 0.19548440913041665, -0.07213530041342385, -0.06494303291452355, -0.08297367036331792, 0.0405113828141069, -0.049638604209216876, 0.016596833681200393, 0.0774047813854765, -0.14094126763547835, -0.14251260082562303, 0.3610523179346739, -0.03881540621609189, -0.17883714360623557, 0.13376909443502163, -0.19280500120894853, -0.13855507209095672, 0.12978188972378712, 0.10441508598972199, 0.2134448825354623, -0.012277108294277474, 0.13333178644926763, -0.1468050551795682, 0.030067554501773314, 0.10814071310749061, 0.02931123965982954, 0.11159470733688322, 0.16493108988263058, 0.0724631554858629, 0.1545256396842211, -0.028149540130005674, -0.004165794481090162, -0.3795040008113828, -0.22113302700170098, -0.06091600047900926, 0.17379864357238592, -0.09939236592905472, -0.16592938722609435, 0.4300033115067108, 0.053631656317901254, 0.24692797098785293, 0.15066940138971996, 0.2829967123391323, -0.0052830735221505165, -0.012877334022981137, 0.03311701353942586, 0.15773983581294848, 0.27722383656560684, -0.02802354313952978, -0.07529713216151089, 0.03985274151552382, 0.2099363414007564] |
1,803.01128 | Seq2Sick: Evaluating the Robustness of Sequence-to-Sequence Models with
Adversarial Examples | Crafting adversarial examples has become an important technique to evaluate
the robustness of deep neural networks (DNNs). However, most existing works
focus on attacking the image classification problem since its input space is
continuous and output space is finite.
In this paper, we study the much more challenging problem of crafting
adversarial examples for sequence-to-sequence (seq2seq) models, whose inputs
are discrete text strings and outputs have an almost infinite number of
possibilities. To address the challenges caused by the discrete input space, we
propose a projected gradient method combined with group lasso and gradient
regularization. To handle the almost infinite output space, we design some
novel loss functions to conduct non-overlapping attack and targeted keyword
attack. We apply our algorithm to machine translation and text summarization
tasks, and verify the effectiveness of the proposed algorithm: by changing less
than 3 words, we can make seq2seq model to produce desired outputs with high
success rates. On the other hand, we recognize that, compared with the
well-evaluated CNN-based classifiers, seq2seq models are intrinsically more
robust to adversarial attacks.
| cs.LG | crafting adversarial examples has become an important technique to evaluate the robustness of deep neural networks dnns however most existing works focus on attacking the image classification problem since its input space is continuous and output space is finite in this paper we study the much more challenging problem of crafting adversarial examples for sequencetosequence seq2seq models whose inputs are discrete text strings and outputs have an almost infinite number of possibilities to address the challenges caused by the discrete input space we propose a projected gradient method combined with group lasso and gradient regularization to handle the almost infinite output space we design some novel loss functions to conduct nonoverlapping attack and targeted keyword attack we apply our algorithm to machine translation and text summarization tasks and verify the effectiveness of the proposed algorithm by changing less than 3 words we can make seq2seq model to produce desired outputs with high success rates on the other hand we recognize that compared with the wellevaluated cnnbased classifiers seq2seq models are intrinsically more robust to adversarial attacks | [['crafting', 'adversarial', 'examples', 'has', 'become', 'an', 'important', 'technique', 'to', 'evaluate', 'the', 'robustness', 'of', 'deep', 'neural', 'networks', 'dnns', 'however', 'most', 'existing', 'works', 'focus', 'on', 'attacking', 'the', 'image', 'classification', 'problem', 'since', 'its', 'input', 'space', 'is', 'continuous', 'and', 'output', 'space', 'is', 'finite', 'in', 'this', 'paper', 'we', 'study', 'the', 'much', 'more', 'challenging', 'problem', 'of', 'crafting', 'adversarial', 'examples', 'for', 'sequencetosequence', 'seq2seq', 'models', 'whose', 'inputs', 'are', 'discrete', 'text', 'strings', 'and', 'outputs', 'have', 'an', 'almost', 'infinite', 'number', 'of', 'possibilities', 'to', 'address', 'the', 'challenges', 'caused', 'by', 'the', 'discrete', 'input', 'space', 'we', 'propose', 'a', 'projected', 'gradient', 'method', 'combined', 'with', 'group', 'lasso', 'and', 'gradient', 'regularization', 'to', 'handle', 'the', 'almost', 'infinite', 'output', 'space', 'we', 'design', 'some', 'novel', 'loss', 'functions', 'to', 'conduct', 'nonoverlapping', 'attack', 'and', 'targeted', 'keyword', 'attack', 'we', 'apply', 'our', 'algorithm', 'to', 'machine', 'translation', 'and', 'text', 'summarization', 'tasks', 'and', 'verify', 'the', 'effectiveness', 'of', 'the', 'proposed', 'algorithm', 'by', 'changing', 'less', 'than', '3', 'words', 'we', 'can', 'make', 'seq2seq', 'model', 'to', 'produce', 'desired', 'outputs', 'with', 'high', 'success', 'rates', 'on', 'the', 'other', 'hand', 'we', 'recognize', 'that', 'compared', 'with', 'the', 'wellevaluated', 'cnnbased', 'classifiers', 'seq2seq', 'models', 'are', 'intrinsically', 'more', 'robust', 'to', 'adversarial', 'attacks']] | [-0.05522461026773921, 0.021817550378618763, -0.03618955504415291, 0.11413641606923193, -0.1528059427759477, -0.23320312520755188, 0.025614759524219804, 0.47145485904333845, -0.26785359071368087, -0.3123068454595549, 0.09677018881043685, -0.2892415616022689, -0.20677362128426985, 0.19837124041580995, -0.17796201774318304, 0.14829325489999196, 0.09455840861158711, 0.03859115655533969, -0.0597586400088455, -0.3536757451402289, 0.32876081586948463, 0.026322454587789253, 0.3216502741017445, -0.02946256728044578, 0.13132129763652173, -0.03626100920514935, -0.037268951532563994, -0.031189309119779084, -0.0438001492461938, 0.16762150771516773, 0.30933338224808854, 0.20989537877163716, 0.356837539861777, -0.40917877167995487, -0.24646851690353028, 0.1434113638688411, 0.14797996276191303, 0.15803402471223046, -0.0421956120492957, -0.33225351472119136, 0.13678637907042035, -0.1806962871604732, 0.029493743064148085, -0.15420223137363792, -0.016233622626002347, -0.015728031723493976, -0.2594227870577015, -0.03339671058314187, 0.10022688630569195, 0.03788511896772044, -0.03957978801735278, -0.10557664368833815, 0.020471620092700635, 0.1252548605655985, 0.0752842169008883, 0.08664367234068257, 0.12470856057812593, -0.17156208277509513, -0.1655924946734948, 0.35389802665582726, -0.05186758949595969, -0.2626478227680283, 0.19796419110939106, 0.014872146084505532, -0.16635968202458962, 0.09590522903949023, 0.26635080786687987, 0.1392055983681764, -0.10268456210249237, 0.015780358068711524, -0.02874603929796389, 0.20309645289821285, 0.05359562262227493, 0.001588859966473787, 0.1221720373923225, 0.2431577764717596, 0.06691023522588824, 0.1803467993002518, -0.10058911879247587, -0.05540864543324071, -0.19101748500551496, -0.05709399674087763, -0.17560594419815712, -0.03289741049254579, -0.08212374514451118, -0.17187114238739012, 0.40188573869743516, 0.2593069325626961, 0.22221337910209382, 0.15103259541626488, 0.3720190905034542, 0.03999935458081642, 0.081142545456865, 0.11182806680245058, 0.15567849303279738, 0.03937446284773094, 0.06907095486896911, -0.1516548047753583, 0.09824865430992628, 0.07392345258966088] |
1,803.01129 | OIL: Observational Imitation Learning | Recent work has explored the problem of autonomous navigation by imitating a
teacher and learning an end-to-end policy, which directly predicts controls
from raw images. However, these approaches tend to be sensitive to mistakes by
the teacher and do not scale well to other environments or vehicles. To this
end, we propose Observational Imitation Learning (OIL), a novel imitation
learning variant that supports online training and automatic selection of
optimal behavior by observing multiple imperfect teachers. We apply our
proposed methodology to the challenging problems of autonomous driving and UAV
racing. For both tasks, we utilize the Sim4CV simulator that enables the
generation of large amounts of synthetic training data and also allows for
online learning and evaluation. We train a perception network to predict
waypoints from raw image data and use OIL to train another network to predict
controls from these waypoints. Extensive experiments demonstrate that our
trained network outperforms its teachers, conventional imitation learning (IL)
and reinforcement learning (RL) baselines and even humans in simulation. The
project website is available at https://sites.google.com/kaust.edu.sa/oil/ and
a video at https://youtu.be/_rhq8a0qgeg
| cs.CV cs.LG cs.RO | recent work has explored the problem of autonomous navigation by imitating a teacher and learning an endtoend policy which directly predicts controls from raw images however these approaches tend to be sensitive to mistakes by the teacher and do not scale well to other environments or vehicles to this end we propose observational imitation learning oil a novel imitation learning variant that supports online training and automatic selection of optimal behavior by observing multiple imperfect teachers we apply our proposed methodology to the challenging problems of autonomous driving and uav racing for both tasks we utilize the sim4cv simulator that enables the generation of large amounts of synthetic training data and also allows for online learning and evaluation we train a perception network to predict waypoints from raw image data and use oil to train another network to predict controls from these waypoints extensive experiments demonstrate that our trained network outperforms its teachers conventional imitation learning il and reinforcement learning rl baselines and even humans in simulation the project website is available at httpssitesgooglecomkaustedusaoil and a video at httpsyoutube_rhq8a0qgeg | [['recent', 'work', 'has', 'explored', 'the', 'problem', 'of', 'autonomous', 'navigation', 'by', 'imitating', 'a', 'teacher', 'and', 'learning', 'an', 'endtoend', 'policy', 'which', 'directly', 'predicts', 'controls', 'from', 'raw', 'images', 'however', 'these', 'approaches', 'tend', 'to', 'be', 'sensitive', 'to', 'mistakes', 'by', 'the', 'teacher', 'and', 'do', 'not', 'scale', 'well', 'to', 'other', 'environments', 'or', 'vehicles', 'to', 'this', 'end', 'we', 'propose', 'observational', 'imitation', 'learning', 'oil', 'a', 'novel', 'imitation', 'learning', 'variant', 'that', 'supports', 'online', 'training', 'and', 'automatic', 'selection', 'of', 'optimal', 'behavior', 'by', 'observing', 'multiple', 'imperfect', 'teachers', 'we', 'apply', 'our', 'proposed', 'methodology', 'to', 'the', 'challenging', 'problems', 'of', 'autonomous', 'driving', 'and', 'uav', 'racing', 'for', 'both', 'tasks', 'we', 'utilize', 'the', 'sim4cv', 'simulator', 'that', 'enables', 'the', 'generation', 'of', 'large', 'amounts', 'of', 'synthetic', 'training', 'data', 'and', 'also', 'allows', 'for', 'online', 'learning', 'and', 'evaluation', 'we', 'train', 'a', 'perception', 'network', 'to', 'predict', 'waypoints', 'from', 'raw', 'image', 'data', 'and', 'use', 'oil', 'to', 'train', 'another', 'network', 'to', 'predict', 'controls', 'from', 'these', 'waypoints', 'extensive', 'experiments', 'demonstrate', 'that', 'our', 'trained', 'network', 'outperforms', 'its', 'teachers', 'conventional', 'imitation', 'learning', 'il', 'and', 'reinforcement', 'learning', 'rl', 'baselines', 'and', 'even', 'humans', 'in', 'simulation', 'the', 'project', 'website', 'is', 'available', 'at', 'httpssitesgooglecomkaustedusaoil', 'and', 'a', 'video', 'at', 'httpsyoutube_rhq8a0qgeg']] | [-0.009266988189086656, 0.03522852251370006, -0.08603316091069825, 0.0668098885058002, -0.17694517012304542, -0.21234737797931302, 0.08104060571151256, 0.4863488687921993, -0.2685792945161335, -0.3682988991945008, 0.08402809053884332, -0.26669002841208567, -0.20718815495406903, 0.2060453944399011, -0.1763513725335625, 0.08510957357826886, 0.15886315320610514, 0.021494167069084306, -0.0015017579135019332, -0.2902426175318066, 0.2950426311713686, 0.03829010834240101, 0.35837653782436973, -0.000345828997193497, 0.18371640710392967, -0.013902259149207648, -0.017112240887813226, -0.034294637543842495, -0.04740352244231293, 0.1686540212401517, 0.3902119808269411, 0.23745695296251637, 0.3767414983409584, -0.4296327765544199, -0.19366473516989077, 0.09829027256769636, 0.12274459868918215, 0.1221839060063675, -0.04380724933633411, -0.37786863244202157, 0.05208213414086706, -0.1922009073739239, 0.01327929569709919, -0.152613263762429, -0.05253457194339717, 0.0011506498002828184, -0.3455137778549794, -0.04193391166220615, 0.02722740882745711, 0.08157826262388633, -0.06574455367775624, -0.07230976535753474, 0.023823631950521798, 0.2325119443928336, 0.05602094945524269, 0.044051434540464965, 0.19309033454225177, -0.20691333945697724, -0.16693925102167254, 0.3505818666043607, -0.0466711568283658, -0.14121360050260343, 0.23910540663002228, 0.002346546542619101, -0.11699054322988642, 0.08060368871189315, 0.2859039047007999, 0.1142922834181015, -0.15338119758234825, -0.026186732755873396, -0.020934317911848088, 0.17723467865620146, 0.004530187139277008, -0.09929588894804263, 0.15877170451097877, 0.2652147774245929, 0.05124797956853978, 0.11605798631386609, -0.12057576441888655, -0.0890279313634065, -0.18931718226237784, -0.09474860897435891, -0.1999358183179125, -0.012109650125570293, -0.06226811265564307, -0.09115213049252899, 0.3407043998463037, 0.27596640081107826, 0.1688834315652705, 0.15648640874066835, 0.3710820011170158, -0.01860275014636996, 0.1074231245121072, 0.12091638385688631, 0.2029446051217912, -0.07579238576396495, 0.20888215822527523, -0.20303524329607503, 0.1117729301933485, -0.005586197159242478] |
1,803.0113 | Berestycki-Lions conditions on ground state solutions for a Nonlinear
Schr\"odinger equation with variable potentials | This paper is dedicated to studying the nonlinear Schr\"odinger equations of
the form \begin{equation*}\label{KE}
\left\{
\begin{array}{ll}
-\triangle u+V(x)u=f(u), & x\in \R^N;
u\in H^1(\R^N),
\end{array}
\right. \end{equation*} where $V\in \mathcal{C}^1(\R^N, [0, \infty))$
satisfies some weak assumptions, and $f\in \mathcal{C}(\R, \R)$ satisfies the
general Berestycki-Lions assumptions. By introducing some new tricks, we prove
that the above problem admits a ground state solution of Poho\u{z}aev type and
a least energy solution. These results generalize and improve some ones in [L.
Jeanjean, K. Tanka,Indiana Univ. Math. J. 54 (2005), 443-464], [L. Jeanjean, K.
Tanka, Proc. Amer. Math. Soc. 131 (2003) 2399-2408], [H. Berestycki, P.L.
Lions, Arch. Rational Mech. Anal. 82 (1983) 313-345] and some other related
literature. In particular, our assumptions are "almost" necessary when
$V(x)\equiv V_{\infty}>0$, moreover, our approach could be useful for the study
of other problems where radial symmetry of bounded sequence either fails or is
not readily available, or where the ground state solutions of the problem at
infinity are not sign definite.
| math.AP | this paper is dedicated to studying the nonlinear schrodinger equations of the form beginequationlabelke left beginarrayll triangle uvxufu xin rn uin h1rn endarray right endequation where vin mathcalc1rn 0 infty satisfies some weak assumptions and fin mathcalcr r satisfies the general berestyckilions assumptions by introducing some new tricks we prove that the above problem admits a ground state solution of pohouzaev type and a least energy solution these results generalize and improve some ones in l jeanjean k tankaindiana univ math j 54 2005 443464 l jeanjean k tanka proc amer math soc 131 2003 23992408 h berestycki pl lions arch rational mech anal 82 1983 313345 and some other related literature in particular our assumptions are almost necessary when vxequiv v_infty0 moreover our approach could be useful for the study of other problems where radial symmetry of bounded sequence either fails or is not readily available or where the ground state solutions of the problem at infinity are not sign definite | [['this', 'paper', 'is', 'dedicated', 'to', 'studying', 'the', 'nonlinear', 'schrodinger', 'equations', 'of', 'the', 'form', 'beginequationlabelke', 'left', 'beginarrayll', 'triangle', 'uvxufu', 'xin', 'rn', 'uin', 'h1rn', 'endarray', 'right', 'endequation', 'where', 'vin', 'mathcalc1rn', '0', 'infty', 'satisfies', 'some', 'weak', 'assumptions', 'and', 'fin', 'mathcalcr', 'r', 'satisfies', 'the', 'general', 'berestyckilions', 'assumptions', 'by', 'introducing', 'some', 'new', 'tricks', 'we', 'prove', 'that', 'the', 'above', 'problem', 'admits', 'a', 'ground', 'state', 'solution', 'of', 'pohouzaev', 'type', 'and', 'a', 'least', 'energy', 'solution', 'these', 'results', 'generalize', 'and', 'improve', 'some', 'ones', 'in', 'l', 'jeanjean', 'k', 'tankaindiana', 'univ', 'math', 'j', '54', '2005', '443464', 'l', 'jeanjean', 'k', 'tanka', 'proc', 'amer', 'math', 'soc', '131', '2003', '23992408', 'h', 'berestycki', 'pl', 'lions', 'arch', 'rational', 'mech', 'anal', '82', '1983', '313345', 'and', 'some', 'other', 'related', 'literature', 'in', 'particular', 'our', 'assumptions', 'are', 'almost', 'necessary', 'when', 'vxequiv', 'v_infty0', 'moreover', 'our', 'approach', 'could', 'be', 'useful', 'for', 'the', 'study', 'of', 'other', 'problems', 'where', 'radial', 'symmetry', 'of', 'bounded', 'sequence', 'either', 'fails', 'or', 'is', 'not', 'readily', 'available', 'or', 'where', 'the', 'ground', 'state', 'solutions', 'of', 'the', 'problem', 'at', 'infinity', 'are', 'not', 'sign', 'definite']] | [-0.12264372466904062, 0.030779802286384727, -0.013111899876476903, 0.015988898441336413, -0.1331008773229673, -0.24360671124151467, 0.010233127338946551, 0.3185812100847742, -0.294721469736511, -0.23714070863360048, 0.14482656709457697, -0.3494536457338223, -0.10858286047464628, 0.16290153433127622, -0.10027011412909671, 0.04965206886730524, 0.04386121928339554, -0.0035663587653911428, -0.04239686767074378, -0.2558410436215222, 0.28010670975536894, -0.07174396054592523, 0.1830286028587005, 0.07786948155262507, 0.061026226705029045, -0.0014258698946306187, 0.02244205863251792, -0.04267262648423448, -0.24961324630322979, 0.029123423513833825, 0.2584765902077044, 0.0942445719571735, 0.3346043685206065, -0.37078102346276864, -0.15582483839917635, 0.17690016869700662, 0.10060022822213605, -0.020730176061318304, 0.0415267180283799, -0.34056767219628553, 0.12364285802974145, -0.08097632743929832, -0.17906127683511985, -0.054797645321262904, 0.12103696995243234, 0.047212008163018925, -0.3483252924373741, 0.13549359559577792, 0.18628858110069382, 0.06580790543950188, -0.07962091976323311, -0.20453012256046732, -0.05490808796725775, 0.011638040430912761, -0.00471607058180349, 0.12049935943612486, 0.019122649125883504, -0.07503907167885795, -0.06100630536552911, 0.348556858377139, -0.05513520833674671, -0.20832170262981795, 0.16357636482050447, -0.11254769404063393, -0.16411072281602843, 0.06969093051539905, 0.0841157846826766, 0.16648933330419058, -0.12556670490841115, 0.2598853995763133, -0.11385298988745107, 0.12883892873038635, 0.17951334601170138, -0.025042712977569624, 0.03981892230283273, 0.0238785665975516, 0.09246553526272212, 0.04737620618911215, -0.006242802881292607, -0.04422624801640938, -0.35386309498234797, -0.14746856424761445, -0.14288023385444448, 0.15362487176437417, -0.03694770787038387, -0.09224416804270157, 0.2943694792170151, 0.10806148121819685, 0.1372938301794516, 0.06546270389624528, 0.12120564135502239, 0.12564082499164597, -0.07442071327731307, 0.18289073668634764, 0.16098755145350496, 0.1449167245416806, 0.1395742296192207, -0.17637466633459553, -0.0003364230843113833, 0.12559941781737985] |
1,803.01131 | Hilbert curve characterizations of some relevant polarized manifolds | Hilbert curves of special varieties like Fano manifolds of low coindex as
well as fibrations having such a manifold as general fiber, endowed with
appropriate polarizations, are investigated. In particular, all most relevant
varieties arising in adjunction theory are characterized in terms of their
Hilbert curves.
| math.AG | hilbert curves of special varieties like fano manifolds of low coindex as well as fibrations having such a manifold as general fiber endowed with appropriate polarizations are investigated in particular all most relevant varieties arising in adjunction theory are characterized in terms of their hilbert curves | [['hilbert', 'curves', 'of', 'special', 'varieties', 'like', 'fano', 'manifolds', 'of', 'low', 'coindex', 'as', 'well', 'as', 'fibrations', 'having', 'such', 'a', 'manifold', 'as', 'general', 'fiber', 'endowed', 'with', 'appropriate', 'polarizations', 'are', 'investigated', 'in', 'particular', 'all', 'most', 'relevant', 'varieties', 'arising', 'in', 'adjunction', 'theory', 'are', 'characterized', 'in', 'terms', 'of', 'their', 'hilbert', 'curves']] | [-0.20881511385390616, 0.08088062646920266, -0.01123907384665116, 0.15454054966002054, -0.06804197890501794, -0.23068263939500827, -0.10587205254705623, 0.387059534413983, -0.27951890444028715, -0.2265830028032803, 0.1412909578395319, -0.24982873780106235, -0.18684519423455323, 0.2759050439597796, -0.20094727940411997, 0.014845375449943316, -0.008194613250215416, 0.05502495890402276, -0.119177615047311, -0.2750423992376613, 0.5110078116413206, -0.0310891122435746, 0.2199007255308654, 0.010084865270587414, 0.12137183133998643, 0.045794043426766344, 0.03859229873278704, 0.030996890384298953, -0.07309155919305656, 0.1308243954959123, 0.42093027099643066, 0.04223095299676061, 0.1202898673751485, -0.40210136528248375, -0.20873020160133424, 0.19210809509715307, 0.12268155228103632, 0.023606690831239455, 0.02229967877349776, -0.23625072456248428, 0.008530111750587821, -0.13477055193937343, -0.21467561189733123, -0.17070059564329035, -0.0036348936593402987, 0.10880919136916814, -0.12303243083474429, -0.03212359932291767, 0.06475407839499657, 0.20899431237384028, -0.06239050486550221, -0.12669504227106582, -0.15237763972001392, 0.05023742890815534, 0.02801809702878413, 0.01995846916637991, 0.09694084039200908, -0.11840864880334424, -0.11180083494147529, 0.43394431730975275, -0.09455544096367109, -0.2249643384382817, 0.11485213480646843, -0.1622459885623792, -0.11522053954515445, 0.13331862953339663, 0.13162104692310095, 0.21350662951337415, 0.0008351836434524993, 0.16023006023517708, -0.07389389264964215, -0.051256622329516256, 0.15792760001900402, 0.16165183822285262, 0.1127195262208419, 0.09540615837676855, 0.014107654539301344, 0.1012583521609802, 0.0032885322023345075, -0.11102111326814022, -0.3837288374121746, -0.14996476395501065, -0.07545904218188851, 0.17862242551358498, -0.14339444195122822, -0.18096486324667121, 0.3587850323959213, -0.09563111868160575, 0.2803285816562888, 0.05583063357145242, 0.2092066133475822, 0.03887441222120643, 0.03649948293889832, -0.004748552490997574, 0.18504358977889238, 0.2562079240122567, -0.044558087115823895, -0.047075527193753616, -0.0250631391333983, 0.11740068971867794] |
1,803.01132 | Manifolds of isospectral matrices and Hessenberg varieties | We study the space $X_h$ of Hermitian matrices having staircase form and the
given simple spectrum. There is a natural action of a compact torus on this
space. Using generalized Toda flow, we show that $X_h$ is a smooth manifold and
its smooth type is independent of the spectrum. Morse theory is then used to
show the vanishing of odd degree cohomology, so that $X_h$ is an equivariantly
formal manifold. The equivariant and ordinary cohomology of $X_h$ are described
using GKM-theory. The main goal of this paper is to show the connection between
the manifolds $X_h$ and the semisimple Hessenberg varieties well-known in
algebraic geometry. Both the spaces $X_h$ and Hessenberg varieties form
wonderful families of submanifolds in the complete flag variety. There is a
certain symmetry between these families which can be generalized to other
submanifolds of the flag variety.
| math.AT math.CO math.DS | we study the space x_h of hermitian matrices having staircase form and the given simple spectrum there is a natural action of a compact torus on this space using generalized toda flow we show that x_h is a smooth manifold and its smooth type is independent of the spectrum morse theory is then used to show the vanishing of odd degree cohomology so that x_h is an equivariantly formal manifold the equivariant and ordinary cohomology of x_h are described using gkmtheory the main goal of this paper is to show the connection between the manifolds x_h and the semisimple hessenberg varieties wellknown in algebraic geometry both the spaces x_h and hessenberg varieties form wonderful families of submanifolds in the complete flag variety there is a certain symmetry between these families which can be generalized to other submanifolds of the flag variety | [['we', 'study', 'the', 'space', 'x_h', 'of', 'hermitian', 'matrices', 'having', 'staircase', 'form', 'and', 'the', 'given', 'simple', 'spectrum', 'there', 'is', 'a', 'natural', 'action', 'of', 'a', 'compact', 'torus', 'on', 'this', 'space', 'using', 'generalized', 'toda', 'flow', 'we', 'show', 'that', 'x_h', 'is', 'a', 'smooth', 'manifold', 'and', 'its', 'smooth', 'type', 'is', 'independent', 'of', 'the', 'spectrum', 'morse', 'theory', 'is', 'then', 'used', 'to', 'show', 'the', 'vanishing', 'of', 'odd', 'degree', 'cohomology', 'so', 'that', 'x_h', 'is', 'an', 'equivariantly', 'formal', 'manifold', 'the', 'equivariant', 'and', 'ordinary', 'cohomology', 'of', 'x_h', 'are', 'described', 'using', 'gkmtheory', 'the', 'main', 'goal', 'of', 'this', 'paper', 'is', 'to', 'show', 'the', 'connection', 'between', 'the', 'manifolds', 'x_h', 'and', 'the', 'semisimple', 'hessenberg', 'varieties', 'wellknown', 'in', 'algebraic', 'geometry', 'both', 'the', 'spaces', 'x_h', 'and', 'hessenberg', 'varieties', 'form', 'wonderful', 'families', 'of', 'submanifolds', 'in', 'the', 'complete', 'flag', 'variety', 'there', 'is', 'a', 'certain', 'symmetry', 'between', 'these', 'families', 'which', 'can', 'be', 'generalized', 'to', 'other', 'submanifolds', 'of', 'the', 'flag', 'variety']] | [-0.1962930534649244, 0.05698018787019632, -0.08633276542767565, 0.08055797190956956, -0.12341135152424058, -0.12051643695721918, -0.06130281107579457, 0.34475709977460667, -0.3182705023874205, -0.1974174462172949, 0.10240219250909244, -0.2178808761106685, -0.205115423920888, 0.1864259537137675, -0.16930566278306095, -0.02656872744600995, 0.03892901526592302, 0.08905784095512002, -0.12333022358873529, -0.2923558088445108, 0.47465786079261846, -0.06495412685644172, 0.22222464072108533, 0.04175310368907261, 0.1177976965171067, -0.02831764773842185, 0.03358884093827231, -0.0022885184004367825, -0.13517773867444818, 0.15696591868871124, 0.2965317122829774, 0.10481897959726531, 0.16055026125321362, -0.3378374169825028, -0.15158964862637486, 0.23587723031098431, 0.12563827861651963, 0.024532866998615257, -0.004694261935750907, -0.2719927614567973, 0.08802259849476898, -0.13889590372153515, -0.19386512884566337, -0.0906570542220634, 0.0449469392220919, 0.026339550104639526, -0.23183184600573906, -0.049618941936303416, 0.0880145496682178, 0.11968101535970015, -0.03357453931020639, -0.09194857336115092, -0.10428776202726686, 0.07277149277745831, -0.006859869588866619, 0.06465972392449935, 0.08193618087973181, -0.05243102757669721, -0.077104715306761, 0.3981952883752314, -0.07616316204137624, -0.2782863193184983, 0.12438629239843828, -0.1473675806154596, -0.16781928119124145, 0.1382913922111616, 0.11465099916284811, 0.17027951398507712, -0.01589868536073688, 0.17839153725634277, -0.12690912170916901, 0.06566996511785274, 0.05353210785538486, -0.02705508584143422, 0.1473695479856857, 0.09883740788048252, 0.06780148101045835, 0.10787086734335195, 0.019033183411411043, -0.07389615019841173, -0.3469310391534133, -0.19484101392408001, -0.14960629205675202, 0.18118358892718897, -0.13278432495853656, -0.17421957507650268, 0.4039711109692799, 0.0039094555297377685, 0.21605775632452986, 0.10320264416650195, 0.2302079578772425, 0.08576620315822463, 0.01801357205943964, 0.05315086622400447, 0.14846760642893136, 0.26355954163199197, -0.024595579485811873, -0.13369165602675143, -0.053929669307776006, 0.1818761793856925] |
1,803.01133 | Cyclic $m$-isometries, and Dirichlet type spaces | We consider cyclic $m$-isometries on a complex separable Hilbert space. Such
operators are characterized in terms of shifts on abstract spaces of weighted
Dirichlet type. Our results resemble those of Agler and Stankus, but our model
spaces are described in terms of Dirichlet integrals rather than analytic
Dirichlet operators. The chosen point of view allows us to construct a variety
of examples. An interesting feature among all of these is that the
corresponding model spaces are contained in a certain subspace of the Hardy
space $H^2$, depending only on the order of the corresponding operator. We also
demonstrate how our framework allows for the construction of unbounded
$m$-isometries.
| math.FA | we consider cyclic misometries on a complex separable hilbert space such operators are characterized in terms of shifts on abstract spaces of weighted dirichlet type our results resemble those of agler and stankus but our model spaces are described in terms of dirichlet integrals rather than analytic dirichlet operators the chosen point of view allows us to construct a variety of examples an interesting feature among all of these is that the corresponding model spaces are contained in a certain subspace of the hardy space h2 depending only on the order of the corresponding operator we also demonstrate how our framework allows for the construction of unbounded misometries | [['we', 'consider', 'cyclic', 'misometries', 'on', 'a', 'complex', 'separable', 'hilbert', 'space', 'such', 'operators', 'are', 'characterized', 'in', 'terms', 'of', 'shifts', 'on', 'abstract', 'spaces', 'of', 'weighted', 'dirichlet', 'type', 'our', 'results', 'resemble', 'those', 'of', 'agler', 'and', 'stankus', 'but', 'our', 'model', 'spaces', 'are', 'described', 'in', 'terms', 'of', 'dirichlet', 'integrals', 'rather', 'than', 'analytic', 'dirichlet', 'operators', 'the', 'chosen', 'point', 'of', 'view', 'allows', 'us', 'to', 'construct', 'a', 'variety', 'of', 'examples', 'an', 'interesting', 'feature', 'among', 'all', 'of', 'these', 'is', 'that', 'the', 'corresponding', 'model', 'spaces', 'are', 'contained', 'in', 'a', 'certain', 'subspace', 'of', 'the', 'hardy', 'space', 'h2', 'depending', 'only', 'on', 'the', 'order', 'of', 'the', 'corresponding', 'operator', 'we', 'also', 'demonstrate', 'how', 'our', 'framework', 'allows', 'for', 'the', 'construction', 'of', 'unbounded', 'misometries']] | [-0.09887076920185621, 0.0868560265387663, -0.05884378276347557, 0.1069168526751085, -0.09662397244997392, -0.06637369522337462, -0.0014438801510346549, 0.36472177710906367, -0.276264871670821, -0.20980630162232947, 0.12965641043771267, -0.26204745854913675, -0.15692949816845705, 0.2503817269717839, -0.09487236550983007, 0.021515656271340135, 0.054903943962025865, 0.08788965215088329, -0.12173526558946714, -0.26006013992521043, 0.44850659243344704, -0.03211389005480108, 0.20167112591563263, -0.000675695143187436, 0.09112397096964105, 0.0018520723271105335, -0.06650794593391017, -0.01755545260526118, -0.14144710135662755, 0.21195114043837188, 0.25710816507306056, 0.08057012140019754, 0.26035250457456316, -0.386583810324006, -0.20417634395759543, 0.1828193995757812, 0.13006102897783864, 0.017906508486822386, 0.0413897221953669, -0.30242688976506765, 0.049076177469219696, -0.13866617562788947, -0.12473938624139562, -0.15246083387761228, -0.029017221287032154, 0.03918400213936187, -0.3062526302969205, 0.033242374886791264, 0.08576515051057544, 0.038650553721377504, -0.15842412349389362, -0.11544785964102527, -0.027718288778266476, 0.07505940444871922, -0.03293256074838584, 0.017961837220762934, 0.0756491518135522, -0.0573566199201986, -0.10629449384374039, 0.36859727471579457, -0.03393514323492739, -0.2688722918332319, 0.1867029589957723, -0.16036559411576976, -0.11567513597258758, 0.07352193614476682, 0.14624746687161935, 0.1619793962530583, -0.07783500911128298, 0.1708725838107737, -0.10957908436273024, 0.09296151983609345, 0.07946591650649348, 0.08072472037747502, 0.10157329430716618, 0.10645350768605125, 0.0983585335105379, 0.1609767020536395, -0.001710863577100779, -0.14591566515949372, -0.37501488021949186, -0.16087711375521138, -0.15798981055708725, 0.02949536179201068, -0.13616555109475936, -0.22215766193362596, 0.4103497286179216, 0.11182753517396887, 0.2334432423900308, 0.06554220065422287, 0.17686281562130027, 0.11852269531684606, 0.05386915980516193, 0.0485902826049339, 0.13096930561630735, 0.11313703360262319, 0.04467508102828097, -0.1506636549553303, 0.032684170170991775, 0.15299074213503572] |
1,803.01134 | Inversion symmetry breaking induced triply degenerate points in orderly
arranged PtSeTe family materials | $k$ paths exactly with $C_{3v}$ symmetry allow to find triply degenerate
points (TDPs) in band structures. The paths that host the type-II Dirac points
in PtSe$_2$ family materials also have the $C_{3v}$ spatial symmetry. However,
due to Kramers degeneracy (the systems have both inversion symmetry and time
reversal symmetry), the crossing points in them are Dirac ones. In this work,
based on symmetry analysis, first-principles calculations, and $k\cdot p$
method, we predict that PtSe$_2$ family materials should undergo topological
transitions if the inversion symmetry is broken, \emph{i.e.} the Dirac fermions
in PtSe$_2$ family materials split into TDPs in PtSeTe family materials (PtSSe,
PtSeTe, and PdSeTe) with orderly arranged S/Se (Se/Te). It is different from
the case in high-energy physics that breaking inversion symmetry $I$ leads to
the splitting of Dirac fermion into Weyl fermions. We also address a possible
method to achieve the orderly arranged in PtSeTe family materials in
experiments. Our study provides a real example that Dirac points transform into
TDPs, and is helpful to investigate the topological transition between Dirac
fermions and TDP fermions.
| cond-mat.mtrl-sci | k paths exactly with c_3v symmetry allow to find triply degenerate points tdps in band structures the paths that host the typeii dirac points in ptse_2 family materials also have the c_3v spatial symmetry however due to kramers degeneracy the systems have both inversion symmetry and time reversal symmetry the crossing points in them are dirac ones in this work based on symmetry analysis firstprinciples calculations and kcdot p method we predict that ptse_2 family materials should undergo topological transitions if the inversion symmetry is broken emphie the dirac fermions in ptse_2 family materials split into tdps in ptsete family materials ptsse ptsete and pdsete with orderly arranged sse sete it is different from the case in highenergy physics that breaking inversion symmetry i leads to the splitting of dirac fermion into weyl fermions we also address a possible method to achieve the orderly arranged in ptsete family materials in experiments our study provides a real example that dirac points transform into tdps and is helpful to investigate the topological transition between dirac fermions and tdp fermions | [['k', 'paths', 'exactly', 'with', 'c_3v', 'symmetry', 'allow', 'to', 'find', 'triply', 'degenerate', 'points', 'tdps', 'in', 'band', 'structures', 'the', 'paths', 'that', 'host', 'the', 'typeii', 'dirac', 'points', 'in', 'ptse_2', 'family', 'materials', 'also', 'have', 'the', 'c_3v', 'spatial', 'symmetry', 'however', 'due', 'to', 'kramers', 'degeneracy', 'the', 'systems', 'have', 'both', 'inversion', 'symmetry', 'and', 'time', 'reversal', 'symmetry', 'the', 'crossing', 'points', 'in', 'them', 'are', 'dirac', 'ones', 'in', 'this', 'work', 'based', 'on', 'symmetry', 'analysis', 'firstprinciples', 'calculations', 'and', 'kcdot', 'p', 'method', 'we', 'predict', 'that', 'ptse_2', 'family', 'materials', 'should', 'undergo', 'topological', 'transitions', 'if', 'the', 'inversion', 'symmetry', 'is', 'broken', 'emphie', 'the', 'dirac', 'fermions', 'in', 'ptse_2', 'family', 'materials', 'split', 'into', 'tdps', 'in', 'ptsete', 'family', 'materials', 'ptsse', 'ptsete', 'and', 'pdsete', 'with', 'orderly', 'arranged', 'sse', 'sete', 'it', 'is', 'different', 'from', 'the', 'case', 'in', 'highenergy', 'physics', 'that', 'breaking', 'inversion', 'symmetry', 'i', 'leads', 'to', 'the', 'splitting', 'of', 'dirac', 'fermion', 'into', 'weyl', 'fermions', 'we', 'also', 'address', 'a', 'possible', 'method', 'to', 'achieve', 'the', 'orderly', 'arranged', 'in', 'ptsete', 'family', 'materials', 'in', 'experiments', 'our', 'study', 'provides', 'a', 'real', 'example', 'that', 'dirac', 'points', 'transform', 'into', 'tdps', 'and', 'is', 'helpful', 'to', 'investigate', 'the', 'topological', 'transition', 'between', 'dirac', 'fermions', 'and', 'tdp', 'fermions']] | [-0.18241995730570384, 0.218538160619459, -0.06147145081577556, 0.04783342285480882, -0.09922356181378876, -0.20275871915476662, 0.0960063885504912, 0.39450089199202404, -0.2549207149845149, -0.2955146883960281, -0.001555816308329148, -0.3331012740411929, -0.18216147597080895, 0.0898707268905959, 0.03872227451631001, 0.03787440568508048, -0.01658254143382822, -0.06333871738852134, -0.14014228486489239, -0.2022575613623485, 0.30270910133616, -0.053175561619656427, 0.3345428329333663, 0.01669851152492421, -0.0075816776796377135, -0.02545751859566995, 0.12877439968287946, -0.04207170126161405, -0.10145543582288415, 0.07395910196671529, 0.23872931546664664, -0.08227165817748755, 0.1283290080140744, -0.42264820864158015, -0.19375056312386213, 0.0793106070387044, 0.15030464207487446, 0.12943311019135373, -0.12576167556881307, -0.31612488847092857, 0.07230192851275205, -0.09697055062944336, -0.16246380352016007, -0.12199777167556541, -0.04552565925621561, -0.0840627206429573, -0.20641143781798227, 0.042732106738258155, 0.05869949650817684, 0.08138670828289053, -0.04488515956460365, -0.1157365280090432, -0.12415615626078631, 0.031132913710815564, 0.08044092986067491, -0.046716669807210565, 0.022875283741658287, -0.05200454835513873, -0.15626029105857014, 0.4946033889690547, -0.006438203753371324, -0.1632272949389049, 0.15685558473026115, -0.13879888382873365, -0.1563392674896334, 0.15640642850526743, 0.1527714622978653, 0.08822430136746594, -0.09368252623826265, 0.14225563238873812, -0.06739843959471077, 0.09505718744160341, 0.04216336545534432, 0.03376765910003866, 0.27615468676068955, 0.10502705201107476, 0.0780434052140585, 0.09895847601549966, -0.07328071504714899, -0.09192571804492868, -0.2607614155983486, -0.21843360931745598, -0.22589586285608154, 0.05645760585221329, -0.020187213048422043, -0.18088434906609888, 0.45176472521253996, 0.12334202506712505, 0.19712133751782987, -0.055692207519231096, 0.16170937849740896, 0.10944951476595764, 0.12297292462550104, 0.0467638994387484, 0.19901811175580536, 0.10078244032670877, 0.04375375228834205, -0.244708944517853, -0.043266907113471205, 0.09028432065621018] |
1,803.01135 | MaskLink: Efficient Link Discovery for Spatial Relations via Masking
Areas | In this paper, we study the problem of spatial link discovery (LD), focusing
primarily on topological and proximity relations between spatial objects. The
problem is timely due to the large number of sources that generate spatial
data, including streaming sources (e.g., surveillance of moving objects) but
also archival sources (such as static areas of interest). To address the
problem of integrating data from such diverse sources, link discovery
techniques are required to identify various spatial relations efficiently.
Existing approaches typically adopt the filter and refine methodology by
exploiting a blocking technique for effective filtering.
In this paper, we present a new spatial LD technique, called MaskLink, that
improves the effectiveness of the filtering step. We show that MaskLink
outperforms the state-of-the-art algorithm for link discovery of topological
relations, while also addressing some of its limitations, such as applicability
for streaming data, low memory requirements, and parallelization. Furthermore,
we show that MaskLink can be extended and generalized to the case of
proximity-based link discovery, which has not been studied before for spatial
data.
Our empirical study demonstrates the superiority of MaskLink against the
state-of-the-art in the case of topological relations, and its performance gain
compared to a baseline technique in the case of proximity-based LD.
| cs.DB | in this paper we study the problem of spatial link discovery ld focusing primarily on topological and proximity relations between spatial objects the problem is timely due to the large number of sources that generate spatial data including streaming sources eg surveillance of moving objects but also archival sources such as static areas of interest to address the problem of integrating data from such diverse sources link discovery techniques are required to identify various spatial relations efficiently existing approaches typically adopt the filter and refine methodology by exploiting a blocking technique for effective filtering in this paper we present a new spatial ld technique called masklink that improves the effectiveness of the filtering step we show that masklink outperforms the stateoftheart algorithm for link discovery of topological relations while also addressing some of its limitations such as applicability for streaming data low memory requirements and parallelization furthermore we show that masklink can be extended and generalized to the case of proximitybased link discovery which has not been studied before for spatial data our empirical study demonstrates the superiority of masklink against the stateoftheart in the case of topological relations and its performance gain compared to a baseline technique in the case of proximitybased ld | [['in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'spatial', 'link', 'discovery', 'ld', 'focusing', 'primarily', 'on', 'topological', 'and', 'proximity', 'relations', 'between', 'spatial', 'objects', 'the', 'problem', 'is', 'timely', 'due', 'to', 'the', 'large', 'number', 'of', 'sources', 'that', 'generate', 'spatial', 'data', 'including', 'streaming', 'sources', 'eg', 'surveillance', 'of', 'moving', 'objects', 'but', 'also', 'archival', 'sources', 'such', 'as', 'static', 'areas', 'of', 'interest', 'to', 'address', 'the', 'problem', 'of', 'integrating', 'data', 'from', 'such', 'diverse', 'sources', 'link', 'discovery', 'techniques', 'are', 'required', 'to', 'identify', 'various', 'spatial', 'relations', 'efficiently', 'existing', 'approaches', 'typically', 'adopt', 'the', 'filter', 'and', 'refine', 'methodology', 'by', 'exploiting', 'a', 'blocking', 'technique', 'for', 'effective', 'filtering', 'in', 'this', 'paper', 'we', 'present', 'a', 'new', 'spatial', 'ld', 'technique', 'called', 'masklink', 'that', 'improves', 'the', 'effectiveness', 'of', 'the', 'filtering', 'step', 'we', 'show', 'that', 'masklink', 'outperforms', 'the', 'stateoftheart', 'algorithm', 'for', 'link', 'discovery', 'of', 'topological', 'relations', 'while', 'also', 'addressing', 'some', 'of', 'its', 'limitations', 'such', 'as', 'applicability', 'for', 'streaming', 'data', 'low', 'memory', 'requirements', 'and', 'parallelization', 'furthermore', 'we', 'show', 'that', 'masklink', 'can', 'be', 'extended', 'and', 'generalized', 'to', 'the', 'case', 'of', 'proximitybased', 'link', 'discovery', 'which', 'has', 'not', 'been', 'studied', 'before', 'for', 'spatial', 'data', 'our', 'empirical', 'study', 'demonstrates', 'the', 'superiority', 'of', 'masklink', 'against', 'the', 'stateoftheart', 'in', 'the', 'case', 'of', 'topological', 'relations', 'and', 'its', 'performance', 'gain', 'compared', 'to', 'a', 'baseline', 'technique', 'in', 'the', 'case', 'of', 'proximitybased', 'ld']] | [-0.10462871127574723, 0.021090742157242607, -0.06565829028612842, 0.07458107523773067, -0.10732345855406795, -0.12318232364943434, 0.08812545932154285, 0.39152141262357143, -0.2662805727735509, -0.34048878224383966, 0.13248632719121672, -0.26937562212640165, -0.17833030341745482, 0.21559341427614437, -0.08632641079077753, 0.05700960191875221, 0.06476459876570266, -0.015438402409427891, -0.0633268141947851, -0.24346872250944393, 0.312320861200729, 0.052054388731074354, 0.34892618666886915, 0.05790966551970033, 0.09253049848598939, 0.020900713987465874, -0.10420516159501858, 0.055146522436510116, -0.08163348937081287, 0.13989140267321823, 0.2636117482576154, 0.183965680141495, 0.2656114693233451, -0.3787793938764462, -0.25891799370612145, 0.08366943445677559, 0.1774337766899621, 0.09537877044674721, -0.0637761916315118, -0.2955239529358497, 0.12566704264392292, -0.1927455333129996, -0.0853317664507046, -0.0984954207943862, 0.007411857078527557, 0.03671843888849823, -0.24635796587430306, 0.060103821663063835, 0.061547045297487, 0.050764913638761525, -0.037684481255436206, -0.08968208460867697, 0.035616316559254284, 0.14814468548980123, 0.04555800714068955, 0.003962851939814202, 0.06747142333587558, -0.1602907181616448, -0.15579573147560416, 0.37721673850262283, -0.045220279936021304, -0.18883683367747317, 0.22921160378438585, -0.062045725597771724, -0.16590118853777064, 0.0932691719105659, 0.20899740879551745, 0.11331800316967179, -0.16504778085486488, 0.05725823406015372, -0.01521446486003697, 0.16027561889267436, 0.05327789331831988, 0.09517187332761858, 0.16210194427392208, 0.2135333270062784, 0.07074462003805035, 0.1591896359134219, -0.156063669898739, -0.07635364388332556, -0.21089969478620618, -0.14151051589322058, -0.16661752511144562, -0.04450758534371476, -0.09131848926571205, -0.1205308515014693, 0.3790558585548983, 0.24296194031907647, 0.1789376716193396, 0.06877692467727077, 0.33875014836781236, 0.061905336404914336, 0.08863236191203161, 0.05338896160452243, 0.2017212062601888, 0.059964180411542674, 0.10458261592144731, -0.20194580836401904, 0.05282489546259646, 0.019494077279209616] |
1,803.01136 | Coverage and Connectivity Analysis of Millimeter Wave Vehicular Networks | The next generations of vehicles will require data transmission rates in the
order of terabytes per driving hour, to support advanced automotive services.
This unprecedented amount of data to be exchanged goes beyond the capabilities
of existing communication technologies for vehicular communication and calls
for new solutions. A possible answer to this growing demand for ultra-high
transmission speeds can be found in the millimeter-wave (mmWave) bands which,
however, are subject to high signal attenuation and challenging propagation
characteristics. In particular, mmWave links are typically directional, to
benefit from the resulting beamforming gain, and require precise alignment of
the transmitter and the receiver beams, an operation which may increase the
latency of the communication and lead to deafness due to beam misalignment. In
this paper, we propose a stochastic model for characterizing the beam coverage
and connectivity probability in mmWave automotive networks. The purpose is to
exemplify some of the complex and interesting tradeoffs that have to be
considered when designing solutions for vehicular scenarios based on mmWave
links. The results show that the performance of the automotive nodes in highly
mobile mmWave systems strictly depends on the specific environment in which the
vehicles are deployed, and must account for several automotive-specific
features such as the nodes speed, the beam alignment periodicity, the base
stations density and the antenna geometry.
| cs.NI | the next generations of vehicles will require data transmission rates in the order of terabytes per driving hour to support advanced automotive services this unprecedented amount of data to be exchanged goes beyond the capabilities of existing communication technologies for vehicular communication and calls for new solutions a possible answer to this growing demand for ultrahigh transmission speeds can be found in the millimeterwave mmwave bands which however are subject to high signal attenuation and challenging propagation characteristics in particular mmwave links are typically directional to benefit from the resulting beamforming gain and require precise alignment of the transmitter and the receiver beams an operation which may increase the latency of the communication and lead to deafness due to beam misalignment in this paper we propose a stochastic model for characterizing the beam coverage and connectivity probability in mmwave automotive networks the purpose is to exemplify some of the complex and interesting tradeoffs that have to be considered when designing solutions for vehicular scenarios based on mmwave links the results show that the performance of the automotive nodes in highly mobile mmwave systems strictly depends on the specific environment in which the vehicles are deployed and must account for several automotivespecific features such as the nodes speed the beam alignment periodicity the base stations density and the antenna geometry | [['the', 'next', 'generations', 'of', 'vehicles', 'will', 'require', 'data', 'transmission', 'rates', 'in', 'the', 'order', 'of', 'terabytes', 'per', 'driving', 'hour', 'to', 'support', 'advanced', 'automotive', 'services', 'this', 'unprecedented', 'amount', 'of', 'data', 'to', 'be', 'exchanged', 'goes', 'beyond', 'the', 'capabilities', 'of', 'existing', 'communication', 'technologies', 'for', 'vehicular', 'communication', 'and', 'calls', 'for', 'new', 'solutions', 'a', 'possible', 'answer', 'to', 'this', 'growing', 'demand', 'for', 'ultrahigh', 'transmission', 'speeds', 'can', 'be', 'found', 'in', 'the', 'millimeterwave', 'mmwave', 'bands', 'which', 'however', 'are', 'subject', 'to', 'high', 'signal', 'attenuation', 'and', 'challenging', 'propagation', 'characteristics', 'in', 'particular', 'mmwave', 'links', 'are', 'typically', 'directional', 'to', 'benefit', 'from', 'the', 'resulting', 'beamforming', 'gain', 'and', 'require', 'precise', 'alignment', 'of', 'the', 'transmitter', 'and', 'the', 'receiver', 'beams', 'an', 'operation', 'which', 'may', 'increase', 'the', 'latency', 'of', 'the', 'communication', 'and', 'lead', 'to', 'deafness', 'due', 'to', 'beam', 'misalignment', 'in', 'this', 'paper', 'we', 'propose', 'a', 'stochastic', 'model', 'for', 'characterizing', 'the', 'beam', 'coverage', 'and', 'connectivity', 'probability', 'in', 'mmwave', 'automotive', 'networks', 'the', 'purpose', 'is', 'to', 'exemplify', 'some', 'of', 'the', 'complex', 'and', 'interesting', 'tradeoffs', 'that', 'have', 'to', 'be', 'considered', 'when', 'designing', 'solutions', 'for', 'vehicular', 'scenarios', 'based', 'on', 'mmwave', 'links', 'the', 'results', 'show', 'that', 'the', 'performance', 'of', 'the', 'automotive', 'nodes', 'in', 'highly', 'mobile', 'mmwave', 'systems', 'strictly', 'depends', 'on', 'the', 'specific', 'environment', 'in', 'which', 'the', 'vehicles', 'are', 'deployed', 'and', 'must', 'account', 'for', 'several', 'automotivespecific', 'features', 'such', 'as', 'the', 'nodes', 'speed', 'the', 'beam', 'alignment', 'periodicity', 'the', 'base', 'stations', 'density', 'and', 'the', 'antenna', 'geometry']] | [-0.2381176636767907, 0.08023418527671378, 0.018081359308930713, 0.02076638436399896, -0.08799420640410838, -0.17371039287135895, 0.06577980824919212, 0.40378727010809584, -0.24872488666266, -0.31755044820094736, 0.125721751584633, -0.25709815095221505, -0.14607151065431878, 0.19229198054842, -0.10297633878621829, 0.07943226070647393, 0.07981503092301497, 0.010551014968510205, -0.002968169309021563, -0.21474340645376905, 0.26212716578728085, 0.11669872758200887, 0.3577351219943562, 0.07975770682822741, 0.061310109036222714, -0.012646195497961903, -0.01513248041257211, -0.05353184395956747, -0.07766528379145653, 0.14461994949843598, 0.34938417724427157, 0.17447431105052316, 0.25500333848155166, -0.48942451473803966, -0.2724783878886662, 0.09836480180666687, 0.1652620101924035, 0.0572055953970273, -0.0390908800121856, -0.28636345494679527, 0.09429670024957987, -0.20415431111965568, -0.10395286389447134, -0.003583750117745319, -0.022440335831878315, 0.10613241397995724, -0.3011749351371524, -0.02389395427398828, -0.029875384513374178, 0.04251133168218743, -0.02638917445598187, -0.07271142201679716, 0.009595923527323325, 0.16797012885044, 0.05165297484363107, -0.010938141163899948, 0.09800145783730774, -0.15768215503787125, -0.09229832346371691, 0.41356892934509065, 0.023462316016517066, -0.21586607965862875, 0.19309313874798528, -0.11219243204940448, -0.1095356987853355, 0.15074794807384825, 0.2858054763295713, 0.029735975309249457, -0.18175356408695684, -0.003492928686532525, 0.05838717910441903, 0.16860761362076696, 0.08795512636478375, 0.12108535051437676, 0.1945127586913167, 0.1968453847151677, 0.14947500111804335, 0.07695254390800817, -0.1575542763964948, -0.08664799019306633, -0.2170692817457533, -0.14732743094359105, -0.1741694008905885, 0.02939046982680063, -0.09071434224220666, -0.08272275932607404, 0.3845374291600369, 0.20013003477698818, 0.13124941225770279, 0.06481560451670661, 0.3858078985449371, 0.09125387390654688, 0.10080147416698276, 0.0902433153070988, 0.23741093684917577, 0.05324209575998434, 0.18926057981224645, -0.16293365495501583, 0.07707427104896601, -0.07600204013458906] |
1,803.01137 | Security issues in a group key establishment protocol | Major shortcomings in a recently published group key establishment protocol
are described. These shortcomings are sufficiently serious that the protocol
should not be used.
| cs.CR | major shortcomings in a recently published group key establishment protocol are described these shortcomings are sufficiently serious that the protocol should not be used | [['major', 'shortcomings', 'in', 'a', 'recently', 'published', 'group', 'key', 'establishment', 'protocol', 'are', 'described', 'these', 'shortcomings', 'are', 'sufficiently', 'serious', 'that', 'the', 'protocol', 'should', 'not', 'be', 'used']] | [-0.17804798771006367, 0.06456480897031724, -0.09489821464133759, 0.09436201086888711, -0.05777603519770006, -0.29299992906938616, 0.0076707791692266864, 0.4025597218424082, -0.23604367968315879, -0.3208503616042435, 0.1480464547397181, -0.21232361920798817, -0.1396005857580652, 0.22278699930757284, -0.19702979235444218, 0.12423987799168874, 0.09829692992692192, -0.08021658317496379, 0.019156877737259492, -0.29992154939100146, 0.2930125437366466, 0.07293155168493588, 0.3206349737786998, 0.0858403582436343, -0.012914776802062988, -0.07107504602754489, -0.06616935642280926, 0.04830323105367521, -0.07347607132548244, 0.04210349824279547, 0.3274446406091253, 0.15625082592790326, 0.3673405977897346, -0.4539341165994604, -0.278555897413753, 0.13863773570240787, 0.22058399898620942, 0.1678499518505608, -0.10825871862471104, -0.2772609693153451, 0.13147518772166222, -0.28763380584617454, -0.1655741383243973, -0.10417000716552138, -0.029786236487173785, 0.04924811182233194, -0.09258506441256031, 0.04770384061945757, 0.007544167727852861, -0.004347816109657288, 0.03663402539677918, -0.16728969907853752, 0.042785489718274526, 0.20494930547041199, 0.027494907214228686, 0.04539557910175063, 0.10194239153255087, -0.01939063655057301, -0.15390278561972082, 0.3964786818251014, -0.00645825903241833, -0.12956398632377386, 0.14186174942490956, -0.030108677960621815, -0.23792767024133354, 0.05086410390989234, 0.08149387431330979, 0.003945810875544946, -0.19801096218482903, -0.012201920423043097, -0.02846227982081473, 0.1478579887188971, 0.018487096880562603, 0.047434013666740306, 0.2016521181600789, 0.10210008496263374, -0.019727726350538433, -0.05081294652093978, 0.010307221751039227, -0.16128345532342792, -0.3305223447581132, -0.11323369123662512, -0.17254172118070224, 0.010001674459999776, 0.041597768935995795, -0.08294912443185846, 0.3237522852917512, 0.23670624988153577, 0.12329729514506955, -0.10424306290224195, 0.32960786142696935, 0.05529967163844655, 0.16799134202301502, 0.11219820162902276, 0.26551915317152935, 0.1018927702292179, 0.05750629360166689, -0.09449726017192006, 0.22757794510107487, 0.04875786399740415] |
1,803.01138 | Wiseman-Milburn Control for the Lipkin-Meshkov-Glick Model | We apply a measurement-based closed-loop control scheme to the dissipative
Lipkin-Meshkov-Glick model. Specifically, we use the Wiseman-Milburn feedback
master equation to control its quantum phase transition.For the steady state
properties of the Lipkin-Meshkov-Glick system under feedback we show that the
considered control scheme changes the critical point of the phase transition.
Finite-size corrections blur these signatures in operator expectation values
but entanglement measures such as concurrence can be used to locate the
transition point more precisely. We find that with feedback, the position of
the critical point can be shifted to smaller spin-spin interactions, which is
potentially useful for setups with limited control on these.
| quant-ph cond-mat.quant-gas cond-mat.stat-mech | we apply a measurementbased closedloop control scheme to the dissipative lipkinmeshkovglick model specifically we use the wisemanmilburn feedback master equation to control its quantum phase transitionfor the steady state properties of the lipkinmeshkovglick system under feedback we show that the considered control scheme changes the critical point of the phase transition finitesize corrections blur these signatures in operator expectation values but entanglement measures such as concurrence can be used to locate the transition point more precisely we find that with feedback the position of the critical point can be shifted to smaller spinspin interactions which is potentially useful for setups with limited control on these | [['we', 'apply', 'a', 'measurementbased', 'closedloop', 'control', 'scheme', 'to', 'the', 'dissipative', 'lipkinmeshkovglick', 'model', 'specifically', 'we', 'use', 'the', 'wisemanmilburn', 'feedback', 'master', 'equation', 'to', 'control', 'its', 'quantum', 'phase', 'transitionfor', 'the', 'steady', 'state', 'properties', 'of', 'the', 'lipkinmeshkovglick', 'system', 'under', 'feedback', 'we', 'show', 'that', 'the', 'considered', 'control', 'scheme', 'changes', 'the', 'critical', 'point', 'of', 'the', 'phase', 'transition', 'finitesize', 'corrections', 'blur', 'these', 'signatures', 'in', 'operator', 'expectation', 'values', 'but', 'entanglement', 'measures', 'such', 'as', 'concurrence', 'can', 'be', 'used', 'to', 'locate', 'the', 'transition', 'point', 'more', 'precisely', 'we', 'find', 'that', 'with', 'feedback', 'the', 'position', 'of', 'the', 'critical', 'point', 'can', 'be', 'shifted', 'to', 'smaller', 'spinspin', 'interactions', 'which', 'is', 'potentially', 'useful', 'for', 'setups', 'with', 'limited', 'control', 'on', 'these']] | [-0.14751609459702963, 0.1489271684549749, -0.11188358728731355, 0.06997264526412786, -0.03848888680267219, -0.21156892224322432, 0.08500112812572087, 0.3841978420700448, -0.2905364597514003, -0.2432935256466198, 0.0928077372003687, -0.267539813532494, -0.1567830647791897, 0.21034677130340312, -0.033335177411432736, 0.10879092825010818, 0.01535828504487514, 0.037076389184221625, -0.09309977799421176, -0.1975941303110001, 0.34049020127769414, 0.032854248737119354, 0.2636423144834295, 0.02105572256158876, 0.08104254566849424, -0.04163346558030193, 0.09140037850906643, 0.013761001087214727, -0.14566113789917906, 0.017556397843831152, 0.24675479696060604, 0.05519481795804145, 0.23640405152064675, -0.38321310527121216, -0.23298711836441027, 0.1600131834140764, 0.13470591052184597, 0.18144517426508872, -0.03820298520734538, -0.3247472802356172, 0.02508560817491693, -0.19196912427791035, -0.1426310342235061, -0.13849514220447207, -0.032952399763207026, 0.003527804791754254, -0.2984336764515879, 0.06866774460873924, 0.027700468062203772, 0.0053501183955142135, -0.04742605968091924, -0.028919837942409616, -0.03414160854075677, 0.18621442166980928, -0.06351022483991423, 0.01679507570840472, 0.21012709035914248, -0.13488422671798617, -0.1287079659803287, 0.363469154215776, -0.03662783349640309, -0.218564627548823, 0.15942630999220106, -0.15084653340566617, -0.09779340009061763, 0.11661504220235376, 0.16757158000109484, 0.09274539234152493, -0.15346397115186286, 0.010894035544389715, 0.033359222539449826, 0.1885375546225987, -0.030697256872931924, 0.08367591399403934, 0.16907868472089133, 0.11753680882975459, 0.10204079176764935, 0.193247962687075, -0.06551428719271477, -0.20627887669699982, -0.3074592817462802, -0.10574492126425657, -0.1639525845575218, 0.05524145018380995, -0.10018464051133308, -0.14677493492714488, 0.37876362398135544, 0.24022040161519095, 0.16910406317149934, 0.020341364511226017, 0.29052550400284904, 0.2031983744628423, 0.055396769634591274, 0.07520145409328577, 0.2614279553706113, 0.10135453043935391, 0.09195297158126217, -0.31615714879052786, 0.05206961400150389, 0.05870366763645926] |
1,803.01139 | State and Parameter Estimation Based on Filtered Transformation for a
Class of Second-Order Systems | This paper addresses the problem of state and parameter estimation for a
class of second-order systems with single output. A new filtered transformation
is proposed for the system via dynamic vector and matrix. In this method, the
dynamics of the vector and matrix are derived by immersion and invariance
technique such that the state estimation condition is guaranteed. Compared to
the classical approaches that persistency of excitation (PE) condition is
required for parameter convergence, the proposed method needs a weaker one, so
called non-square-integrability condition, in the transformation via dynamic
matrix. Simulation results are concluded for a class of regressors which are
not PE but satisfy the new condition.
| cs.SY | this paper addresses the problem of state and parameter estimation for a class of secondorder systems with single output a new filtered transformation is proposed for the system via dynamic vector and matrix in this method the dynamics of the vector and matrix are derived by immersion and invariance technique such that the state estimation condition is guaranteed compared to the classical approaches that persistency of excitation pe condition is required for parameter convergence the proposed method needs a weaker one so called nonsquareintegrability condition in the transformation via dynamic matrix simulation results are concluded for a class of regressors which are not pe but satisfy the new condition | [['this', 'paper', 'addresses', 'the', 'problem', 'of', 'state', 'and', 'parameter', 'estimation', 'for', 'a', 'class', 'of', 'secondorder', 'systems', 'with', 'single', 'output', 'a', 'new', 'filtered', 'transformation', 'is', 'proposed', 'for', 'the', 'system', 'via', 'dynamic', 'vector', 'and', 'matrix', 'in', 'this', 'method', 'the', 'dynamics', 'of', 'the', 'vector', 'and', 'matrix', 'are', 'derived', 'by', 'immersion', 'and', 'invariance', 'technique', 'such', 'that', 'the', 'state', 'estimation', 'condition', 'is', 'guaranteed', 'compared', 'to', 'the', 'classical', 'approaches', 'that', 'persistency', 'of', 'excitation', 'pe', 'condition', 'is', 'required', 'for', 'parameter', 'convergence', 'the', 'proposed', 'method', 'needs', 'a', 'weaker', 'one', 'so', 'called', 'nonsquareintegrability', 'condition', 'in', 'the', 'transformation', 'via', 'dynamic', 'matrix', 'simulation', 'results', 'are', 'concluded', 'for', 'a', 'class', 'of', 'regressors', 'which', 'are', 'not', 'pe', 'but', 'satisfy', 'the', 'new', 'condition']] | [-0.10457505324329422, 0.09163039076331726, -0.0784738239556275, 0.0379885598376859, -0.06666176820053132, -0.1684811909131154, 0.02004416591457643, 0.34462109073582625, -0.29530438787683294, -0.2732673491937695, 0.13659002806310094, -0.2046934822746725, -0.17859826226615244, 0.19270815702017258, -0.051897031888883144, 0.12622923684237455, 0.08565020497836587, 0.054787569892747946, -0.07755866549538311, -0.21315226686635502, 0.34641895903688336, 0.03117315418569854, 0.32510265459616977, 0.024284992862872227, 0.14827680153151354, 0.020484430368351576, 0.01667268155573833, 0.04580482542169867, -0.10164788292079013, 0.09764261482632719, 0.20579029554156242, 0.17484457099689515, 0.29400369417163785, -0.358112626588317, -0.21551377822093112, 0.10569753836736911, 0.1064952194682081, 0.1025754171973353, -0.0424194845750376, -0.2713638818370075, 0.14443486549512105, -0.14641890628694523, -0.09220185486548063, -0.09983680873928177, -0.04015701924692149, 0.00378952710458112, -0.36889133838876326, 0.07999488354585925, 0.08501508106322338, 0.018312978211152194, -0.06859340377505524, -0.0778570707566191, 0.01180117699119297, 0.07972833349076272, 0.02841431702081873, 0.014266545556623626, 0.10018979166893081, -0.12301805248501262, -0.06968268443381896, 0.3728099296524845, -0.05695679420562185, -0.28298247981109415, 0.1470064677996561, -0.07651714011121334, -0.14110943323747185, 0.15085703135870668, 0.13477951752159884, 0.13950242052130676, -0.15124882302350467, 0.06402358965284226, -0.03826053566471846, 0.16718753632502975, -0.004116048462930377, 0.024857278870142722, 0.10737666148795849, 0.1380285338446912, 0.11694284480203081, 0.1523679246138609, -0.06672163433109678, -0.09625975226151275, -0.3120545104525431, -0.17455099405143065, -0.19685871782928221, -0.024576765310350177, -0.06473325624042277, -0.15038230480557238, 0.3940021728544875, 0.13985195383591215, 0.17367060523031763, 0.07614374060627867, 0.29967623328169185, 0.1730186420372101, 0.05160281598498976, 0.058355994216442386, 0.22404936475127382, 0.1441745441062031, 0.09520758901446781, -0.20894344270453546, 0.10736591915203328, 0.12023651513219294] |
1,803.0114 | A note on homotopy categories of FP-Injectives | For a locally finitely presented Grothendieck category $\mathcal{A}$, we
consider a certain subcategory of the homotopy category of FP-injective objects
in $\mathcal{A}$ which we show is compactly generated. In the case where
$\mathcal{A}$ is locally coherent, we identify this subcategory with the
derived category of FP-injective objects in $\mathcal{A}$. Our results are, in
a sense, dual to the ones obtained by Neeman on the homotopy category of flat
modules. Our proof is based on extending a characterization of the pure acyclic
complexes which is due to Emmanouil.
| math.RA math.CT | for a locally finitely presented grothendieck category mathcala we consider a certain subcategory of the homotopy category of fpinjective objects in mathcala which we show is compactly generated in the case where mathcala is locally coherent we identify this subcategory with the derived category of fpinjective objects in mathcala our results are in a sense dual to the ones obtained by neeman on the homotopy category of flat modules our proof is based on extending a characterization of the pure acyclic complexes which is due to emmanouil | [['for', 'a', 'locally', 'finitely', 'presented', 'grothendieck', 'category', 'mathcala', 'we', 'consider', 'a', 'certain', 'subcategory', 'of', 'the', 'homotopy', 'category', 'of', 'fpinjective', 'objects', 'in', 'mathcala', 'which', 'we', 'show', 'is', 'compactly', 'generated', 'in', 'the', 'case', 'where', 'mathcala', 'is', 'locally', 'coherent', 'we', 'identify', 'this', 'subcategory', 'with', 'the', 'derived', 'category', 'of', 'fpinjective', 'objects', 'in', 'mathcala', 'our', 'results', 'are', 'in', 'a', 'sense', 'dual', 'to', 'the', 'ones', 'obtained', 'by', 'neeman', 'on', 'the', 'homotopy', 'category', 'of', 'flat', 'modules', 'our', 'proof', 'is', 'based', 'on', 'extending', 'a', 'characterization', 'of', 'the', 'pure', 'acyclic', 'complexes', 'which', 'is', 'due', 'to', 'emmanouil']] | [-0.13904782893114734, 0.01069176121047516, -0.047469161389309955, 0.06019942749200667, -0.07174209852692211, -0.10983466277776778, -0.05360974617644973, 0.3986320260098611, -0.37510097078208265, -0.14791782601099546, 0.08560060399274032, -0.18793035795291266, -0.0921761464680834, 0.18801128552776986, -0.23700715659785715, -0.11099119412702048, 0.10103499482856827, 0.13549949052133436, 0.013954951716908094, -0.25584444626041786, 0.4705443613916293, -0.04474465189308956, 0.26119181080615944, 0.0035390726279938356, 0.12263770500497742, -0.0024483579200232164, -0.022972528073380048, 0.04534709931019394, -0.14688965176692467, 0.18452116144799638, 0.3546565804930254, 0.06223202422368287, 0.2022524781835576, -0.3103796809633402, -0.08133557515925374, 0.1709800747105445, 0.10077790616798729, 0.06584887655355551, -0.05717933404088106, -0.3716802377997758, 0.1902220614720136, -0.23602902032863135, -0.04581950168692689, -0.030266376982988983, 0.0957280670924262, 0.026222845041674787, -0.28658627323677827, -0.05264054414623513, 0.08635325918252441, 0.06490744214676235, -0.13711363426677284, -0.04214139186894928, -0.09772830265145963, 0.0707741220610152, -0.0992685599619223, 0.020437940387804616, 0.13180087628806458, -0.1025978179953607, -0.12006041733146613, 0.3839613376399395, -0.050057288644642664, -0.24690265523205543, 0.15799241289817567, -0.16237687471258486, -0.14130094279160446, 0.14193783130967755, -0.022569254511731796, 0.2250773861265645, -0.023886265040471637, 0.22020454558104963, -0.20448730182138153, 0.10036610380543032, 0.06376099598797402, 0.039634654052213, 0.1325992039597497, 0.15274033721151023, 0.04057861710617576, 0.18172150225399983, 0.01877477010390882, -0.03163729397173243, -0.36074126535362894, -0.1376896839396193, -0.10413467549269312, 0.12619135548071614, -0.03621505096490527, -0.2029878147168556, 0.3817197461023755, 0.12130002631409757, 0.1791378716542118, 0.17714993971742518, 0.2055617799961019, -0.004572837696485649, 0.047179833006370686, 0.027832912655825586, 0.1655452292969172, 0.23523424837963078, -0.04836292901536685, -0.05344403048056638, -0.00023008612701776385, 0.23520266112668076] |
1,803.01141 | An Application of Neural Networks to Channel Estimation of the ISDB-TB
FBMC System | Due to the evolution of technology and the diffusion of digital television,
many researchers are studying more efficient transmission and reception
methods. This fact occurs because of the demand of transmitting videos with
better quality using new standards such 8K SUPER Hi-VISION. In this scenario,
modulation techniques such as Filter Bank Multi Carrier, associated with
advanced coding and synchronization methods, are being applied, aiming to
achieve the desired data rate to support ultra-high definition videos.
Simultaneously, it is also important to investigate ways of channel estimation
that enable a better reception of the transmitted signal. This task is not
always trivial, depending on the characteristics of the channel. Thus, the use
of artificial intelligence can contribute to estimate the channel frequency
response, from the transmitted pilots. A classical algorithm called
Back-propagation Training can be applied to find the channel equalizer
coefficients, making possible the correct reception of TV signals. Therefore,
this work presents a method of channel estimation that uses neural network
techniques to obtain the channel response in the Brazilian Digital System
Television, called ISDB-TB, using Filter Bank Multi Carrier.
| eess.SP | due to the evolution of technology and the diffusion of digital television many researchers are studying more efficient transmission and reception methods this fact occurs because of the demand of transmitting videos with better quality using new standards such 8k super hivision in this scenario modulation techniques such as filter bank multi carrier associated with advanced coding and synchronization methods are being applied aiming to achieve the desired data rate to support ultrahigh definition videos simultaneously it is also important to investigate ways of channel estimation that enable a better reception of the transmitted signal this task is not always trivial depending on the characteristics of the channel thus the use of artificial intelligence can contribute to estimate the channel frequency response from the transmitted pilots a classical algorithm called backpropagation training can be applied to find the channel equalizer coefficients making possible the correct reception of tv signals therefore this work presents a method of channel estimation that uses neural network techniques to obtain the channel response in the brazilian digital system television called isdbtb using filter bank multi carrier | [['due', 'to', 'the', 'evolution', 'of', 'technology', 'and', 'the', 'diffusion', 'of', 'digital', 'television', 'many', 'researchers', 'are', 'studying', 'more', 'efficient', 'transmission', 'and', 'reception', 'methods', 'this', 'fact', 'occurs', 'because', 'of', 'the', 'demand', 'of', 'transmitting', 'videos', 'with', 'better', 'quality', 'using', 'new', 'standards', 'such', '8k', 'super', 'hivision', 'in', 'this', 'scenario', 'modulation', 'techniques', 'such', 'as', 'filter', 'bank', 'multi', 'carrier', 'associated', 'with', 'advanced', 'coding', 'and', 'synchronization', 'methods', 'are', 'being', 'applied', 'aiming', 'to', 'achieve', 'the', 'desired', 'data', 'rate', 'to', 'support', 'ultrahigh', 'definition', 'videos', 'simultaneously', 'it', 'is', 'also', 'important', 'to', 'investigate', 'ways', 'of', 'channel', 'estimation', 'that', 'enable', 'a', 'better', 'reception', 'of', 'the', 'transmitted', 'signal', 'this', 'task', 'is', 'not', 'always', 'trivial', 'depending', 'on', 'the', 'characteristics', 'of', 'the', 'channel', 'thus', 'the', 'use', 'of', 'artificial', 'intelligence', 'can', 'contribute', 'to', 'estimate', 'the', 'channel', 'frequency', 'response', 'from', 'the', 'transmitted', 'pilots', 'a', 'classical', 'algorithm', 'called', 'backpropagation', 'training', 'can', 'be', 'applied', 'to', 'find', 'the', 'channel', 'equalizer', 'coefficients', 'making', 'possible', 'the', 'correct', 'reception', 'of', 'tv', 'signals', 'therefore', 'this', 'work', 'presents', 'a', 'method', 'of', 'channel', 'estimation', 'that', 'uses', 'neural', 'network', 'techniques', 'to', 'obtain', 'the', 'channel', 'response', 'in', 'the', 'brazilian', 'digital', 'system', 'television', 'called', 'isdbtb', 'using', 'filter', 'bank', 'multi', 'carrier']] | [-0.14103271373529402, 0.044997977908419744, -0.08228436455536405, 0.03604859757684587, -0.12461334467454496, -0.21861555970237492, 0.07085622430846678, 0.4100436778041904, -0.2899942400958909, -0.2907111378355399, 0.13828815062538144, -0.23262795103797118, -0.20970974708471563, 0.19033523127124463, -0.11843590176138798, 0.05774307762163395, 0.05811400001402944, 0.05718032793433265, -0.026883909383505145, -0.2566227666258437, 0.23318326108511434, 0.11658982535844992, 0.37755694114421, -0.01837084605358541, 0.10829232603879958, 0.03187424211082238, -0.07566132150263936, -0.08456085124001032, -0.06305369075594858, 0.1351652891276269, 0.33031840410926405, 0.18174984479354248, 0.28757274656572157, -0.41073638160177117, -0.2532242111310196, 0.08787838937506579, 0.15512187134958388, 0.12048029493509307, -0.0393467305385665, -0.2813099792471686, 0.11635741467298888, -0.19243231449697645, -0.03695167041794714, -0.028870979136678094, -0.06183573266480888, 0.031206977356279884, -0.31216391231266355, 0.0429043373775567, 0.00842201103997422, 0.028581072698612618, -0.03854352089201813, -0.10035431338148972, 0.013821791365805119, 0.1937004345698105, 0.02281340906479755, 0.01706498049137146, 0.13681850254057007, -0.13778106696115464, -0.12292758789428578, 0.3641024439299073, -0.05339943301374894, -0.20082710818296517, 0.1667671795360817, -0.08720756515173772, -0.05276290340578007, 0.17206718780584218, 0.24554256377182382, 0.052465135551593656, -0.18561409744915328, -0.008385836254407303, 0.028034161523962653, 0.21632276787669735, 0.08600906776030179, 0.10275952142855808, 0.17274632550484642, 0.19589690574543686, 0.08272778902263979, 0.11712829130584655, -0.13376397661788014, -0.04468264666314368, -0.18564018580181962, -0.13244723846782103, -0.19763504209090543, 0.002030239332621454, -0.04326586044166177, -0.1351815813309487, 0.39102971788454155, 0.20881383452016872, 0.13597951389266458, 0.04383647713196261, 0.3860639799308219, 0.0946030788762266, 0.09382340020900748, 0.0634312028317015, 0.19471461019561986, 0.08650145638349087, 0.17977319255356766, -0.18437261738054786, 0.09387811045708687, -0.009494682516403206] |
1,803.01142 | Management of Network Slicing in 5G Radio Access Networks: Functional
Framework and Information Models | Network slicing is one of the key features for 5G networks to be able to
accommodate the anticipated diversity of applications and business actors in a
resource-efficient manner. While significant progress has already been achieved
at 3GPP specifications level with regard to the system architectural and
functional aspects for the realisation of network slicing in 5G networks,
management solutions for the exploitation of this feature in the Next
Generation Radio Access Network (NG-RAN) are still at a very incipient stage.
In this context, this paper presents a framework for the management of network
slicing in a NG-RAN infrastructure, identifying the functions, interfaces and
information models that are necessary to enable the automation of the RAN
slicing provisioning and management processes. Accordingly, a plausible
information model intended to describe the manageable characteristics and
behaviour of a RAN slice is developed and its applicability discussed in an
illustrative neutral host provider scenario.
| cs.NI | network slicing is one of the key features for 5g networks to be able to accommodate the anticipated diversity of applications and business actors in a resourceefficient manner while significant progress has already been achieved at 3gpp specifications level with regard to the system architectural and functional aspects for the realisation of network slicing in 5g networks management solutions for the exploitation of this feature in the next generation radio access network ngran are still at a very incipient stage in this context this paper presents a framework for the management of network slicing in a ngran infrastructure identifying the functions interfaces and information models that are necessary to enable the automation of the ran slicing provisioning and management processes accordingly a plausible information model intended to describe the manageable characteristics and behaviour of a ran slice is developed and its applicability discussed in an illustrative neutral host provider scenario | [['network', 'slicing', 'is', 'one', 'of', 'the', 'key', 'features', 'for', '5g', 'networks', 'to', 'be', 'able', 'to', 'accommodate', 'the', 'anticipated', 'diversity', 'of', 'applications', 'and', 'business', 'actors', 'in', 'a', 'resourceefficient', 'manner', 'while', 'significant', 'progress', 'has', 'already', 'been', 'achieved', 'at', '3gpp', 'specifications', 'level', 'with', 'regard', 'to', 'the', 'system', 'architectural', 'and', 'functional', 'aspects', 'for', 'the', 'realisation', 'of', 'network', 'slicing', 'in', '5g', 'networks', 'management', 'solutions', 'for', 'the', 'exploitation', 'of', 'this', 'feature', 'in', 'the', 'next', 'generation', 'radio', 'access', 'network', 'ngran', 'are', 'still', 'at', 'a', 'very', 'incipient', 'stage', 'in', 'this', 'context', 'this', 'paper', 'presents', 'a', 'framework', 'for', 'the', 'management', 'of', 'network', 'slicing', 'in', 'a', 'ngran', 'infrastructure', 'identifying', 'the', 'functions', 'interfaces', 'and', 'information', 'models', 'that', 'are', 'necessary', 'to', 'enable', 'the', 'automation', 'of', 'the', 'ran', 'slicing', 'provisioning', 'and', 'management', 'processes', 'accordingly', 'a', 'plausible', 'information', 'model', 'intended', 'to', 'describe', 'the', 'manageable', 'characteristics', 'and', 'behaviour', 'of', 'a', 'ran', 'slice', 'is', 'developed', 'and', 'its', 'applicability', 'discussed', 'in', 'an', 'illustrative', 'neutral', 'host', 'provider', 'scenario']] | [-0.1603525638473346, -0.005601393032840271, -0.03899457299377065, 0.05773816549304143, -0.06745325902955153, -0.15186403739278684, 0.054363318438157185, 0.38462811889680654, -0.24652323591824923, -0.27962598054845994, 0.1301579344750231, -0.2128054542062691, -0.1730299349024741, 0.15007431304154642, -0.0772970363095, 0.07078991353950728, 0.05619134765819999, -0.015846819209400564, -0.011323313991385009, -0.22883856457160986, 0.3056465618979387, 0.12287026054439815, 0.3694421273760019, 0.08799019112641848, 0.06543899127250738, -0.04492164307393486, -0.04923153886173512, -0.03210192549001501, -0.06804106290149542, 0.16686573024403392, 0.35007177250620747, 0.21332006756824126, 0.32049154205801517, -0.45034367318038604, -0.24970927819250957, 0.05617212985698889, 0.15485231524232673, 0.06427968618604732, -0.038825920402273735, -0.2800976385777766, 0.11628743575105595, -0.25080648973282127, -0.14547099829793, -0.07259805464009578, -0.0022632391663972994, 0.001261541644674474, -0.27210602840106635, -0.04037147195304971, 0.019124898479030643, 0.030812318307014083, -0.041462793748832084, -0.04447598479345214, -0.013237968360929674, 0.18048672447912395, 0.008664522788053177, 0.027002615991993995, 0.10736840674488465, -0.1799084637266886, -0.15155433576768013, 0.42212803077229577, 0.014623127117866298, -0.1846159139806971, 0.1789958829349662, -0.056579033710452656, -0.2153031431308419, 0.07809134589734713, 0.2300962786523726, 0.04107795298615521, -0.23564082731467648, 0.045804693565760564, 0.05325748492661562, 0.14233033290774738, 0.043979260974525904, 0.08233275799697416, 0.22325027569329264, 0.30322356642274234, 0.09486080386292038, 0.11853062264492258, -0.05523347541866069, -0.12490766624466994, -0.2680125172577194, -0.16405601283170385, -0.13040650862652958, -0.009302643014470468, -0.05036097974457457, -0.12651961965712946, 0.4403489628850759, 0.18410456775863832, 0.13417790889286915, 0.075282725052455, 0.3647906306951709, 0.048275000085374595, 0.14444427674548146, 0.09381164052536257, 0.17290189398241834, 0.033186321711557845, 0.23865408381931735, -0.12465452113365, 0.11362448859821402, 0.0036848512245342135] |
1,803.01143 | On the Fredholm Lagrangian Grassmannian, Spectral Flow and ODEs in
Hilbert Spaces | We consider homoclinic solutions for Hamiltonian systems in symplectic
Hilbert spaces and generalise spectral flow formulas that were proved by
Pejsachowicz and the author in finite dimensions some years ago. Roughly
speaking, our main theorem relates the spectra of infinite dimensional
Hamiltonian systems under homoclinic boundary conditions to intersections of
their stable and unstable spaces. Our proof has some interest in its own.
Firstly, we extend a celebrated theorem by Cappell, Lee and Miller about the
classical Maslov index in $\mathbb{R}^{2n}$ to symplectic Hilbert spaces.
Secondly, we generalise the classical index bundle for families of Fredholm
operators of Atiyah and J\"anich to unbounded operators for applying it to
Hamiltonian systems under varying boundary conditions. Finally, we
substantially make use of striking results by Abbondandolo and Majer to study
Fredholm properties of infinite dimensional Hamiltonian systems.
| math.DS math.AP math.FA math.KT math.SP | we consider homoclinic solutions for hamiltonian systems in symplectic hilbert spaces and generalise spectral flow formulas that were proved by pejsachowicz and the author in finite dimensions some years ago roughly speaking our main theorem relates the spectra of infinite dimensional hamiltonian systems under homoclinic boundary conditions to intersections of their stable and unstable spaces our proof has some interest in its own firstly we extend a celebrated theorem by cappell lee and miller about the classical maslov index in mathbbr2n to symplectic hilbert spaces secondly we generalise the classical index bundle for families of fredholm operators of atiyah and janich to unbounded operators for applying it to hamiltonian systems under varying boundary conditions finally we substantially make use of striking results by abbondandolo and majer to study fredholm properties of infinite dimensional hamiltonian systems | [['we', 'consider', 'homoclinic', 'solutions', 'for', 'hamiltonian', 'systems', 'in', 'symplectic', 'hilbert', 'spaces', 'and', 'generalise', 'spectral', 'flow', 'formulas', 'that', 'were', 'proved', 'by', 'pejsachowicz', 'and', 'the', 'author', 'in', 'finite', 'dimensions', 'some', 'years', 'ago', 'roughly', 'speaking', 'our', 'main', 'theorem', 'relates', 'the', 'spectra', 'of', 'infinite', 'dimensional', 'hamiltonian', 'systems', 'under', 'homoclinic', 'boundary', 'conditions', 'to', 'intersections', 'of', 'their', 'stable', 'and', 'unstable', 'spaces', 'our', 'proof', 'has', 'some', 'interest', 'in', 'its', 'own', 'firstly', 'we', 'extend', 'a', 'celebrated', 'theorem', 'by', 'cappell', 'lee', 'and', 'miller', 'about', 'the', 'classical', 'maslov', 'index', 'in', 'mathbbr2n', 'to', 'symplectic', 'hilbert', 'spaces', 'secondly', 'we', 'generalise', 'the', 'classical', 'index', 'bundle', 'for', 'families', 'of', 'fredholm', 'operators', 'of', 'atiyah', 'and', 'janich', 'to', 'unbounded', 'operators', 'for', 'applying', 'it', 'to', 'hamiltonian', 'systems', 'under', 'varying', 'boundary', 'conditions', 'finally', 'we', 'substantially', 'make', 'use', 'of', 'striking', 'results', 'by', 'abbondandolo', 'and', 'majer', 'to', 'study', 'fredholm', 'properties', 'of', 'infinite', 'dimensional', 'hamiltonian', 'systems']] | [-0.15694255816903133, 0.10680835626657996, -0.11133913383054644, 0.11589921992133136, -0.06312061204755706, -0.15637210001752003, -0.010285609040353725, 0.3246636617539534, -0.2505300334696449, -0.21478864501244319, 0.12290209483914773, -0.2519862537459929, -0.18259498201755445, 0.21635399363698687, -0.2054797571491052, 0.08875324732038442, 0.08743445217998615, 0.016632162041461736, -0.10827208580205967, -0.2825200441423734, 0.44347596003104056, -0.022684074729792218, 0.18777638182579193, 0.05920172598014878, 0.09366075845379661, 0.03224574670598689, -0.007612858579229952, -0.03233400665557207, -0.18870449662687466, 0.13415241047892887, 0.2673125059253522, 0.045460310674258576, 0.23325285935468637, -0.37809164682403207, -0.22065836573784142, 0.12961532553282581, 0.1202897418345978, 0.032355418129921404, 0.043038395190665345, -0.32176226473399505, 0.08839321884138983, -0.15819442438295306, -0.22418337800790236, -0.12907758273302453, 0.06659314090233129, 0.014691081726854084, -0.2076740537582438, 0.02228033436295479, 0.15333885514636092, 0.10458670296608957, -0.12523054216950158, -0.0685229220813307, -0.06848046194011373, 0.06462696575170467, 0.0454611489644844, -0.04221746197783513, 0.04727175475946113, -0.012120278574436826, -0.15002237632870674, 0.32035817489299034, -0.06027859516360701, -0.21740256176232847, 0.17320269409483716, -0.11983826240427348, -0.17688167472925984, 0.09557642509036614, 0.09751466790617291, 0.15313606722447187, -0.06417598777082262, 0.17444576505213671, -0.08674249029197077, 0.062310601174553386, 0.16662668768288708, 0.008631650577368798, 0.08127849129959941, 0.049160417200608264, 0.13187898384796373, 0.1653485403295412, 0.06414191413031363, -0.15636133669515892, -0.2798596530068499, -0.18721885279641112, -0.1380662580729643, 0.12653068104175044, -0.10558039544488185, -0.15636913224867086, 0.3951385784268713, 0.135560290109533, 0.16684451379896656, 0.1028089546928627, 0.2168565163208144, 0.1181297178411467, 0.0201554480547419, 0.08717353985325169, 0.1657307868004158, 0.2696422887027764, 0.09112758853180862, -0.12303167740717086, -0.07566641417632589, 0.23633047161318027] |
1,803.01144 | Inducing and controlling rotation on small objects using photonic
topological materials | Photonic topological insulator plates violate Lorentz reciprocity which leads
to a directionality of surface-guided modes. This in-plane directionality can
be imprinted via an applied magnetic field. On the basis of macroscopic quantum
electrodynamics in nonreciprocal media, we show that two photonic topological
insulator surfaces are subject to a tuneable, magnetic-field dependent Casimir
torque. Due to the directionality, this torque exhibits a unique $2\pi$
periodicity, in contradistinction to the Casimir torques encountered for
reciprocal uniaxial birefringent media or corrugated surfaces which are
$\pi$-periodic. Remarkably, the torque direction and strength can be externally
driven in situ by simply applying a magnetic field on the system, and we show
that this can be exploited to induce a control the rotation of small objects.
Our predictions can be relevant for nano-opto-mechanical experiments and
devices.
| cond-mat.mes-hall quant-ph | photonic topological insulator plates violate lorentz reciprocity which leads to a directionality of surfaceguided modes this inplane directionality can be imprinted via an applied magnetic field on the basis of macroscopic quantum electrodynamics in nonreciprocal media we show that two photonic topological insulator surfaces are subject to a tuneable magneticfield dependent casimir torque due to the directionality this torque exhibits a unique 2pi periodicity in contradistinction to the casimir torques encountered for reciprocal uniaxial birefringent media or corrugated surfaces which are piperiodic remarkably the torque direction and strength can be externally driven in situ by simply applying a magnetic field on the system and we show that this can be exploited to induce a control the rotation of small objects our predictions can be relevant for nanooptomechanical experiments and devices | [['photonic', 'topological', 'insulator', 'plates', 'violate', 'lorentz', 'reciprocity', 'which', 'leads', 'to', 'a', 'directionality', 'of', 'surfaceguided', 'modes', 'this', 'inplane', 'directionality', 'can', 'be', 'imprinted', 'via', 'an', 'applied', 'magnetic', 'field', 'on', 'the', 'basis', 'of', 'macroscopic', 'quantum', 'electrodynamics', 'in', 'nonreciprocal', 'media', 'we', 'show', 'that', 'two', 'photonic', 'topological', 'insulator', 'surfaces', 'are', 'subject', 'to', 'a', 'tuneable', 'magneticfield', 'dependent', 'casimir', 'torque', 'due', 'to', 'the', 'directionality', 'this', 'torque', 'exhibits', 'a', 'unique', '2pi', 'periodicity', 'in', 'contradistinction', 'to', 'the', 'casimir', 'torques', 'encountered', 'for', 'reciprocal', 'uniaxial', 'birefringent', 'media', 'or', 'corrugated', 'surfaces', 'which', 'are', 'piperiodic', 'remarkably', 'the', 'torque', 'direction', 'and', 'strength', 'can', 'be', 'externally', 'driven', 'in', 'situ', 'by', 'simply', 'applying', 'a', 'magnetic', 'field', 'on', 'the', 'system', 'and', 'we', 'show', 'that', 'this', 'can', 'be', 'exploited', 'to', 'induce', 'a', 'control', 'the', 'rotation', 'of', 'small', 'objects', 'our', 'predictions', 'can', 'be', 'relevant', 'for', 'nanooptomechanical', 'experiments', 'and', 'devices']] | [-0.239522137332621, 0.2417227385770719, -0.07397596500705668, -0.013934887280550519, -0.1480977684836979, -0.16056143588841307, -0.006970718929854532, 0.4426981458194958, -0.2931169564077674, -0.277236667293613, 0.00014558323711344554, -0.23150246674483715, -0.19699903437687272, 0.27036726739539135, -0.030093285312890544, 0.03530748265022917, -0.02730095519344936, -0.04722535336758335, -0.041842739563435316, -0.15991292668275478, 0.28021937328239166, -0.02335276491055626, 0.33203481161577064, 0.07584692439237653, 0.05978414978716494, -0.01802788472503366, 0.1054302507708239, 0.09574267285891318, -0.11295796266286327, 0.0833054830991598, 0.21221157844366087, -0.11794132021681746, 0.168138877160183, -0.5091961056730429, -0.22118937352522414, 0.049439509882945425, 0.11622598735695026, 0.17135956903825722, -0.07499448643715749, -0.33015411229833036, 0.036938781599160427, -0.15098691177590526, -0.12161037966402792, -0.1373342758084308, 6.62665593964878e-05, 0.01839720365742958, -0.25839843609922586, 0.06404862228903717, 0.07680717501392256, 0.08606980747160639, -0.06348543047560685, 0.009464307335320889, -0.05704035540472341, 0.07658216702100251, 0.05822877512970405, 0.06184089857030862, 0.21275531888989976, -0.12062615936788074, -0.1338039290867457, 0.39161800827773274, -0.0637834386533675, -0.22741268283521482, 0.16421767021439132, -0.15253136611034618, -0.006820816639630312, 0.11182212255544989, 0.19870949885266465, 0.07871619220678658, -0.12709203682291184, 0.04479675072781352, -0.011333034615674916, 0.19757167040550894, 0.10221836263992527, 0.04021878043088571, 0.29446628512886835, 0.10526769329133162, 0.06935786671463631, 0.1591932666754213, -0.07792060948229691, -0.013466270230782703, -0.26328231349168707, -0.18594832103266273, -0.23299581190758897, 0.10125182964827761, -0.0688451325062657, -0.1651622574206066, 0.3585718490269988, 0.1657684154794082, 0.1439338374031029, -0.06018582691597326, 0.2853276402393515, 0.1377725329533465, 0.14136736842897513, 0.01934174532540027, 0.33068365602963423, 0.1850008500808518, 0.11001695214604684, -0.2632418005734451, 0.0444445719675327, -0.008124009446175985] |
1,803.01145 | Designing Interactions with Furniture: Towards Multi-Sensorial
Interaction Design Processes for Interactive Furniture | In this paper, we argue for novel user experience design methods, in the
context of reimagining ergonomics of interactive furniture.
| cs.HC | in this paper we argue for novel user experience design methods in the context of reimagining ergonomics of interactive furniture | [['in', 'this', 'paper', 'we', 'argue', 'for', 'novel', 'user', 'experience', 'design', 'methods', 'in', 'the', 'context', 'of', 'reimagining', 'ergonomics', 'of', 'interactive', 'furniture']] | [-0.09728330690413714, 0.0021739813964813948, -0.0748827999457717, 0.01932918929378502, -0.11582357827574015, -0.14108345210552214, 0.037507058080518615, 0.42566735446453097, -0.2159654837101698, -0.3364789020270109, 0.013591440871823578, -0.20058487122878432, -0.2919375903904438, 0.2062628279440105, -0.24166463855654002, 0.011456041224300861, 0.06210438646376133, 0.024633343052119016, -0.05442373640835285, -0.22002735873684287, 0.35485199000686407, 0.048784416541457175, 0.3090421974658966, 0.08311956068500877, 0.05338235585950315, 0.07230756327044219, -0.07844227035529912, -0.017722344398498534, -0.13591767018660902, 0.20234005618840456, 0.35975292734801767, 0.2550354513339698, 0.3940200209617615, -0.44285787269473076, -0.1799062632024288, 0.0020640631671994926, 0.1837497885338962, 0.08068375112488865, -0.12735514380037785, -0.30651999562978743, 0.08025495866313577, -0.263177353143692, -0.06380352089181543, -0.021032282896339894, -0.08992247032001614, -0.012946813832968473, -0.26947847472620196, -0.044299562060041354, 0.09366952278651297, 0.13268192457035183, -0.07099906224757432, -0.04251944432035089, 0.14917271956801414, 0.1691051496192813, 0.023489984218031168, -0.028285540943033993, 0.12452127796132118, -0.18972991498885677, -0.18910086639225482, 0.3861476719379425, 0.02015474299550988, -0.18040808516088874, 0.18436505333520473, -0.036746546532958745, -0.2199645021930337, 0.030356830754317343, 0.3689115891233087, 0.14180279151769354, -0.19045851062983274, 0.04512288820696995, -0.004241145495325327, 0.1234284014441073, 0.0038546566007426008, 0.024333423725329338, 0.22679085682611913, 0.28361486587673423, 0.032545823510736226, 0.1442327719181776, -0.0033964469097554685, -0.04002746529877186, -0.24696573978289962, -0.27108555026352404, -0.14060104871168733, -0.07002592575736344, -0.011752650723792613, -0.14079390158876776, 0.36531982086598874, 0.2980051662772894, 0.08774686548858882, 0.06269980897195637, 0.3795737573876977, -0.026373598584905268, 0.011538531119003891, 0.05846908609382808, 0.16975290409754962, -0.11024797917343676, 0.2466670169495046, -0.15404492758680136, 0.07577155262115412, 0.03967898625414819] |
1,803.01146 | Stylize Aesthetic QR Code | With the continued proliferation of smart mobile devices, Quick Response (QR)
code has become one of the most-used types of two-dimensional code in the
world. Aiming at beautifying the visual-unpleasant appearance of QR codes,
existing works have developed a series of techniques. However, these works
still leave much to be desired, such as personalization, artistry, and
robustness. To address these issues, in this paper, we propose a novel type of
aesthetic QR codes, SEE (Stylize aEsthEtic) QR code, and a three-stage approach
to automatically produce such robust style-oriented codes. Specifically, in the
first stage, we propose a method to generate an optimized baseline aesthetic QR
code, which reduces the visual contrast between the noise-like black/white
modules and the blended image. In the second stage, to obtain art style QR
code, we tailor an appropriate neural style transformation network to endow the
baseline aesthetic QR code with artistic elements. In the third stage, we
design an error-correction mechanism by balancing two competing terms, visual
quality and readability, to ensure the performance robust. Extensive
experiments demonstrate that SEE QR code has high quality in terms of both
visual appearance and robustness, and also offers a greater variety of
personalized choices to users.
| cs.MM | with the continued proliferation of smart mobile devices quick response qr code has become one of the mostused types of twodimensional code in the world aiming at beautifying the visualunpleasant appearance of qr codes existing works have developed a series of techniques however these works still leave much to be desired such as personalization artistry and robustness to address these issues in this paper we propose a novel type of aesthetic qr codes see stylize aesthetic qr code and a threestage approach to automatically produce such robust styleoriented codes specifically in the first stage we propose a method to generate an optimized baseline aesthetic qr code which reduces the visual contrast between the noiselike blackwhite modules and the blended image in the second stage to obtain art style qr code we tailor an appropriate neural style transformation network to endow the baseline aesthetic qr code with artistic elements in the third stage we design an errorcorrection mechanism by balancing two competing terms visual quality and readability to ensure the performance robust extensive experiments demonstrate that see qr code has high quality in terms of both visual appearance and robustness and also offers a greater variety of personalized choices to users | [['with', 'the', 'continued', 'proliferation', 'of', 'smart', 'mobile', 'devices', 'quick', 'response', 'qr', 'code', 'has', 'become', 'one', 'of', 'the', 'mostused', 'types', 'of', 'twodimensional', 'code', 'in', 'the', 'world', 'aiming', 'at', 'beautifying', 'the', 'visualunpleasant', 'appearance', 'of', 'qr', 'codes', 'existing', 'works', 'have', 'developed', 'a', 'series', 'of', 'techniques', 'however', 'these', 'works', 'still', 'leave', 'much', 'to', 'be', 'desired', 'such', 'as', 'personalization', 'artistry', 'and', 'robustness', 'to', 'address', 'these', 'issues', 'in', 'this', 'paper', 'we', 'propose', 'a', 'novel', 'type', 'of', 'aesthetic', 'qr', 'codes', 'see', 'stylize', 'aesthetic', 'qr', 'code', 'and', 'a', 'threestage', 'approach', 'to', 'automatically', 'produce', 'such', 'robust', 'styleoriented', 'codes', 'specifically', 'in', 'the', 'first', 'stage', 'we', 'propose', 'a', 'method', 'to', 'generate', 'an', 'optimized', 'baseline', 'aesthetic', 'qr', 'code', 'which', 'reduces', 'the', 'visual', 'contrast', 'between', 'the', 'noiselike', 'blackwhite', 'modules', 'and', 'the', 'blended', 'image', 'in', 'the', 'second', 'stage', 'to', 'obtain', 'art', 'style', 'qr', 'code', 'we', 'tailor', 'an', 'appropriate', 'neural', 'style', 'transformation', 'network', 'to', 'endow', 'the', 'baseline', 'aesthetic', 'qr', 'code', 'with', 'artistic', 'elements', 'in', 'the', 'third', 'stage', 'we', 'design', 'an', 'errorcorrection', 'mechanism', 'by', 'balancing', 'two', 'competing', 'terms', 'visual', 'quality', 'and', 'readability', 'to', 'ensure', 'the', 'performance', 'robust', 'extensive', 'experiments', 'demonstrate', 'that', 'see', 'qr', 'code', 'has', 'high', 'quality', 'in', 'terms', 'of', 'both', 'visual', 'appearance', 'and', 'robustness', 'and', 'also', 'offers', 'a', 'greater', 'variety', 'of', 'personalized', 'choices', 'to', 'users']] | [-0.08297854118748818, -0.01571489973822526, -0.0774146955715421, 0.06052758955209975, -0.09359996118180945, -0.22462913565819864, -0.005237936564049858, 0.4337311733069683, -0.26926338051913806, -0.32462301711802405, 0.09547980495038333, -0.22844834938092243, -0.1858481509784747, 0.15823240139932954, -0.16382750028243223, 0.1002805990776813, 0.09556390330588993, 0.010515835243135426, -0.11322185365237333, -0.3070925192028133, 0.3097986321622118, 0.1275185468165809, 0.3364967388776958, 0.02192856043312453, 0.0798201254488626, -0.015051183721353773, -0.07143655527787293, -0.021275898319347595, -0.06631317517270605, 0.14036283207150782, 0.3089744941671828, 0.21316283055227178, 0.3144097178488932, -0.41160907807670116, -0.16183351590841782, 0.03584081892084879, 0.1488781697896834, 0.1393161219075502, -0.08304245521546091, -0.2644183275568758, 0.14605403630781522, -0.22921372915093366, -0.046321843591147, -0.12441182804062281, -0.01594370884140055, -0.015736135655037852, -0.2929885931937071, -0.05910766343973582, 0.0687917711622162, 0.08200078464567018, 0.0027122027816122093, -0.12206117098508072, 0.04639161743582959, 0.17407188081149447, 0.007289555597445233, 0.05315063334705998, 0.11365321179530417, -0.15869721143505286, -0.1369454352625972, 0.38713111882547135, -0.031074016050052673, -0.1929593565909258, 0.19362728628991785, -0.017058719890333977, -0.08115014687728912, 0.10997646905689827, 0.23235982297896052, 0.1021541936091398, -0.09848882517006796, -0.013548854484960323, 0.0009823502112312366, 0.20235964849231963, 0.06233067465189674, 0.05288950029788964, 0.2119287152852636, 0.1576180830444233, 0.015720146104249027, 0.1486333996987651, -0.07612796076975271, -0.03019297020368013, -0.18067068567376604, -0.16613279879660472, -0.1370600880014942, -0.03476963739671986, -0.1110979342511985, -0.20210260957441656, 0.45988483624981935, 0.22620034943036924, 0.17801499440746033, 0.04803518195066903, 0.36508374981733444, 0.020839446029852753, 0.10248052396192239, 0.08392528507936518, 0.15688124908722917, 0.009607533899462086, 0.1409730206829907, -0.20619479398822843, 0.09925236895462962, 0.10143942526866077] |
1,803.01147 | Decameter Type IV Burst Associated with a behind-the-limb CME Observed
on 7 November 2013 | We report on the results of observations of a type IV burst by URAN-2
(Ukrainian Radio interferometer of Academy Scienses) in the frequency range 22
- 33 MHz, which is associated with the CME (coronal mass ejection) initiated by
a behind-the-limb active region (N05E151). This burst was observed also by the
radio telescope NDA (Nancay Decameter Array) in the frequency band 30 - 60 MHz.
The purpose of the article is the determination of the source of this type IV
burst. After analysis of the observational data obtained with the URAN-2, NDA,
STEREO (Solar-Terrestrial Relations Observatory) A and B spacecraft, and SOHO
(Solar and Heliospheric Observatory)spacecraft we come to the conclusion that
it is a core of a behind-the-limb CME. We conclude that the radio emission can
escape the center of the CME core at a frequency of 60 MHz and originates from
the periphery of the core at frequency 30 MHz due to occultation by the solar
corona at corresponding frequencies. We find plasma densities in these regions
supposing the plasma mechanism of radio emission. We show that the frequency
drift of the start of the type IV burst is governed by an expansion of the CME
core. Type III bursts, which were observed against this type IV burst, are
shown to be generated by fast electrons propagating through the CME core
plasma. A type II burst registered at frequencies 44 - 64 MHz and 3 - 16 MHz
was radiated by a shock with a velocity of about 1000 km s^{-1} and 800 km
s^{-1}, respectively.
| astro-ph.SR | we report on the results of observations of a type iv burst by uran2 ukrainian radio interferometer of academy scienses in the frequency range 22 33 mhz which is associated with the cme coronal mass ejection initiated by a behindthelimb active region n05e151 this burst was observed also by the radio telescope nda nancay decameter array in the frequency band 30 60 mhz the purpose of the article is the determination of the source of this type iv burst after analysis of the observational data obtained with the uran2 nda stereo solarterrestrial relations observatory a and b spacecraft and soho solar and heliospheric observatoryspacecraft we come to the conclusion that it is a core of a behindthelimb cme we conclude that the radio emission can escape the center of the cme core at a frequency of 60 mhz and originates from the periphery of the core at frequency 30 mhz due to occultation by the solar corona at corresponding frequencies we find plasma densities in these regions supposing the plasma mechanism of radio emission we show that the frequency drift of the start of the type iv burst is governed by an expansion of the cme core type iii bursts which were observed against this type iv burst are shown to be generated by fast electrons propagating through the cme core plasma a type ii burst registered at frequencies 44 64 mhz and 3 16 mhz was radiated by a shock with a velocity of about 1000 km s1 and 800 km s1 respectively | [['we', 'report', 'on', 'the', 'results', 'of', 'observations', 'of', 'a', 'type', 'iv', 'burst', 'by', 'uran2', 'ukrainian', 'radio', 'interferometer', 'of', 'academy', 'scienses', 'in', 'the', 'frequency', 'range', '22', '33', 'mhz', 'which', 'is', 'associated', 'with', 'the', 'cme', 'coronal', 'mass', 'ejection', 'initiated', 'by', 'a', 'behindthelimb', 'active', 'region', 'n05e151', 'this', 'burst', 'was', 'observed', 'also', 'by', 'the', 'radio', 'telescope', 'nda', 'nancay', 'decameter', 'array', 'in', 'the', 'frequency', 'band', '30', '60', 'mhz', 'the', 'purpose', 'of', 'the', 'article', 'is', 'the', 'determination', 'of', 'the', 'source', 'of', 'this', 'type', 'iv', 'burst', 'after', 'analysis', 'of', 'the', 'observational', 'data', 'obtained', 'with', 'the', 'uran2', 'nda', 'stereo', 'solarterrestrial', 'relations', 'observatory', 'a', 'and', 'b', 'spacecraft', 'and', 'soho', 'solar', 'and', 'heliospheric', 'observatoryspacecraft', 'we', 'come', 'to', 'the', 'conclusion', 'that', 'it', 'is', 'a', 'core', 'of', 'a', 'behindthelimb', 'cme', 'we', 'conclude', 'that', 'the', 'radio', 'emission', 'can', 'escape', 'the', 'center', 'of', 'the', 'cme', 'core', 'at', 'a', 'frequency', 'of', '60', 'mhz', 'and', 'originates', 'from', 'the', 'periphery', 'of', 'the', 'core', 'at', 'frequency', '30', 'mhz', 'due', 'to', 'occultation', 'by', 'the', 'solar', 'corona', 'at', 'corresponding', 'frequencies', 'we', 'find', 'plasma', 'densities', 'in', 'these', 'regions', 'supposing', 'the', 'plasma', 'mechanism', 'of', 'radio', 'emission', 'we', 'show', 'that', 'the', 'frequency', 'drift', 'of', 'the', 'start', 'of', 'the', 'type', 'iv', 'burst', 'is', 'governed', 'by', 'an', 'expansion', 'of', 'the', 'cme', 'core', 'type', 'iii', 'bursts', 'which', 'were', 'observed', 'against', 'this', 'type', 'iv', 'burst', 'are', 'shown', 'to', 'be', 'generated', 'by', 'fast', 'electrons', 'propagating', 'through', 'the', 'cme', 'core', 'plasma', 'a', 'type', 'ii', 'burst', 'registered', 'at', 'frequencies', '44', '64', 'mhz', 'and', '3', '16', 'mhz', 'was', 'radiated', 'by', 'a', 'shock', 'with', 'a', 'velocity', 'of', 'about', '1000', 'km', 's1', 'and', '800', 'km', 's1', 'respectively']] | [-0.10720673753008937, 0.19214054391599042, 0.03249126371363571, 0.04753062243905453, -0.08561454966768207, -0.0646360090087758, 0.07358946426367143, 0.4170272010508405, -0.17432388270355434, -0.3521150796566589, 0.11050687942781905, -0.2610338573377446, -0.06695478693470804, 0.23975305595695862, 0.01467988768161601, -0.06636788800407008, 0.10024172575973657, -0.02636854115788235, -0.04104031396165223, -0.11711409285597771, 0.24194067131924588, 0.15375730068333804, 0.24191432188944964, -0.0021798560985798144, 0.10611607364065337, -0.11652698851305532, -0.07086789331573295, -0.0427306050405025, -0.07821474187876737, 0.048045701200728756, 0.2071491764056908, 0.157809330667165, 0.22502641915621985, -0.3812916382175102, -0.2008259251502257, -0.006539173659857407, 0.11334758123894968, -0.0046882798229214324, -0.0052176281736525465, -0.3307599809421486, 0.07582354282522463, -0.21006024969867856, -0.1748560971424607, 0.16782781597508853, 0.06872239121536454, 0.06118099228107923, -0.22195892390355365, 0.09712466006378265, -0.0034083604666059353, 0.09135280661210715, -0.09506927440276897, -0.05261002801380962, 0.005329580516999669, 0.06609198550899621, 0.03732013675306304, 0.08224164845933953, 0.15390501509186816, -0.05277279582138051, -0.061750329407562775, 0.3697789449734517, -0.06481142751353076, 0.03250546841715199, 0.19623258228198553, -0.2514349662158935, -0.12356630828188903, 0.22537445407212375, 0.12673911730762558, 0.02325082539610446, -0.1398763230373801, 0.01040124812903647, -0.002875051485741904, 0.1987619072308326, 0.12395120291707229, 0.0007717319192787803, 0.24579449651755422, 0.10330047359712333, 0.016532379310147696, 0.10204052086594882, -0.2943152809152435, 0.035907723280449076, -0.2893446035863112, -0.07987664696812422, -0.12643345597893949, 0.08328758860591325, -0.07344324284442329, -0.10676795594332521, 0.44325539860707447, 0.09718970232573616, 0.16653777261550326, 0.011504280450475584, 0.2490426434085248, 0.10469464764956281, 0.0764904343135807, 0.15126742341692942, 0.32665756727713513, 0.16771064133519462, 0.19057286554108935, -0.22234041471520358, 0.014186824124632959, 0.04304136236409742] |
1,803.01148 | Event Display in the JUNO Experiment | The current event display system in the offline software of Jiangmen
Underground Neutrino Observatory Experiment(JUNO) is based on the ROOT EVE
package. We use Unity, a renowned game engine, to improve its performance and
make it available on different platforms. Compared to ROOT, Unity provides a
more vivid demonstration for high energy physics experiments and can be ported
to different platforms easily. We build a tool for event display in JUNO with
Unity. It provides us an intuitive way to observe the detector model, the
particle trajectories and the hit distributions.
| physics.ins-det hep-ex | the current event display system in the offline software of jiangmen underground neutrino observatory experimentjuno is based on the root eve package we use unity a renowned game engine to improve its performance and make it available on different platforms compared to root unity provides a more vivid demonstration for high energy physics experiments and can be ported to different platforms easily we build a tool for event display in juno with unity it provides us an intuitive way to observe the detector model the particle trajectories and the hit distributions | [['the', 'current', 'event', 'display', 'system', 'in', 'the', 'offline', 'software', 'of', 'jiangmen', 'underground', 'neutrino', 'observatory', 'experimentjuno', 'is', 'based', 'on', 'the', 'root', 'eve', 'package', 'we', 'use', 'unity', 'a', 'renowned', 'game', 'engine', 'to', 'improve', 'its', 'performance', 'and', 'make', 'it', 'available', 'on', 'different', 'platforms', 'compared', 'to', 'root', 'unity', 'provides', 'a', 'more', 'vivid', 'demonstration', 'for', 'high', 'energy', 'physics', 'experiments', 'and', 'can', 'be', 'ported', 'to', 'different', 'platforms', 'easily', 'we', 'build', 'a', 'tool', 'for', 'event', 'display', 'in', 'juno', 'with', 'unity', 'it', 'provides', 'us', 'an', 'intuitive', 'way', 'to', 'observe', 'the', 'detector', 'model', 'the', 'particle', 'trajectories', 'and', 'the', 'hit', 'distributions']] | [-0.0675809295162455, 0.06436329698853013, -0.15093289735313092, 0.12565356002111608, -0.12220932796804442, -0.19315951147841082, 0.0036310036175159943, 0.384626060931219, -0.21816027621971443, -0.38312697673423424, 0.088083687520379, -0.3245459264247782, -0.10309540927410125, 0.28805412214844384, -0.03691910846035979, 0.05255465883593489, 0.1295129533753627, 0.05876184001099318, -0.028410890062029164, -0.23154689481274948, 0.2133917912116481, 0.18609429880873196, 0.31131606651728766, 0.059374412231975135, 0.13725048633706238, -0.037264595381242945, -0.008955299233396849, -0.0399162626799403, -0.11040349375689403, 0.08260916082395448, 0.2966703910535822, 0.20611147157227, 0.2181768480533113, -0.4256937438622117, -0.11275656352647477, 0.0775587099759529, 0.11081177132825057, 0.06633034695858239, -0.06763120373895314, -0.3003372458120187, 0.06092888325866726, -0.26621601581573484, -0.13124069826056559, -0.060845731638578905, -0.04001512372762793, -0.016675678182703754, -0.2576193569590234, -0.03943406218507638, -0.04599258316836009, 0.06955820086101691, 0.027188146175144035, -0.10769736973129006, 0.06633071549650696, 0.17564412157775627, -0.0022169593243031864, 0.011105018098735146, 0.17005103757449735, -0.11272421551014607, -0.13168520455559093, 0.40723917819559574, -0.04426205202212764, -0.17730245392045213, 0.23003446779265585, -0.14867548902208608, -0.08912824452337291, 0.12514603369765812, 0.22071767407986853, 0.05747209219262004, -0.15505477560477124, 0.024414955812325286, 0.0023419877307282555, 0.19146962041656176, 0.002559581748209894, -0.005793238058686256, 0.23373773214148563, 0.2487842684611678, 0.08409592566183871, 0.11757031061246784, -0.09049405952553369, -0.07778055323805246, -0.24400262925773858, -0.19757412445421021, -0.14334860578075878, 0.024527951340294545, -0.05263334649773444, -0.15276581978218423, 0.3911142940219078, 0.23884700056320676, 0.1439241232143508, 0.016907412995998232, 0.3254712401785784, 0.05714400264744957, 0.10337945298395224, 0.05650411527086463, 0.23340178830549121, 0.01062557457674605, 0.1851019248780277, -0.17312022214755415, 0.06017503079492599, 0.03270635431011518] |
1,803.01149 | Relative cyclic subgroup commutativity degrees of finite groups | In this paper we introduce and study the relative cyclic subgroup
commutativity degrees of a finite group. We show that there is a finite group
with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$
and we indicate some classes of finite groups with few relative cyclic subgroup
commutativity degrees. Using this new concept, we are able to show that the set
containing all cyclic subgroup commutativity degrees of finite groups is not
dense in $[0, 1]$.
| math.GR | in this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group we show that there is a finite group with n such degrees for all n in mathbbnsetminus lbrace 2rbrace and we indicate some classes of finite groups with few relative cyclic subgroup commutativity degrees using this new concept we are able to show that the set containing all cyclic subgroup commutativity degrees of finite groups is not dense in 0 1 | [['in', 'this', 'paper', 'we', 'introduce', 'and', 'study', 'the', 'relative', 'cyclic', 'subgroup', 'commutativity', 'degrees', 'of', 'a', 'finite', 'group', 'we', 'show', 'that', 'there', 'is', 'a', 'finite', 'group', 'with', 'n', 'such', 'degrees', 'for', 'all', 'n', 'in', 'mathbbnsetminus', 'lbrace', '2rbrace', 'and', 'we', 'indicate', 'some', 'classes', 'of', 'finite', 'groups', 'with', 'few', 'relative', 'cyclic', 'subgroup', 'commutativity', 'degrees', 'using', 'this', 'new', 'concept', 'we', 'are', 'able', 'to', 'show', 'that', 'the', 'set', 'containing', 'all', 'cyclic', 'subgroup', 'commutativity', 'degrees', 'of', 'finite', 'groups', 'is', 'not', 'dense', 'in', '0', '1']] | [-0.23193269830148716, 0.1966898753852039, -0.04416666061363437, -0.030520156558070864, -0.0688639934047718, -0.09298231589378088, 0.032890840870473385, 0.4017881628053335, -0.3375555177690921, -0.23225655879631832, 0.09436761118114817, -0.27285636845347166, -0.10974074114573659, 0.12372594089670615, -0.12827334039566385, -0.07184067272956109, 0.02542856288922636, 0.12989879612411773, -0.09875313286342985, -0.26796126717326607, 0.3532475381605811, -0.1001455547021968, 0.18771872917407906, 0.015973496625756287, 0.12785272907417317, -0.0025653251652400216, -0.012735935756573816, 0.04464210007436477, -0.11385195693942302, 0.06030456813705432, 0.26963413069810865, 0.09551865270046832, 0.259284630079161, -0.32707546162721396, -0.17202624475414102, 0.24739554861874938, 0.12519196954906567, 0.06856393148554127, -0.07328548337115193, -0.2140544640783269, 0.21523580475190243, -0.2486345952032013, -0.1419944080506004, -0.08609493183389355, 0.06516775130838542, 0.035178759579800746, -0.2122248241786736, 0.020892851072811074, 0.08536213016619017, 0.19381147981077046, 0.023749742396901568, -0.14011694637260266, 0.011010768911015097, 0.12721124311376894, -0.0012168609295282271, -0.026963905283165248, 0.024893978078450476, -0.046749847306107935, -0.0866135966347216, 0.41918479535099745, -0.06343308418940802, -0.21892235511551042, 0.18112603567734167, -0.21133305922803747, -0.23872583995682078, 0.09490010957535985, 0.10132378858647176, 0.17105298592140536, -0.053302379566934205, 0.13247669281818988, -0.1448910291270389, 0.16262780957818998, 0.0540872356225434, 0.0441323636196457, 0.09275232507036878, 0.08420303264366728, 0.09859836920370142, 0.15385146941022051, 0.010257557548534173, 0.012710777812867195, -0.4131016040873992, -0.1756074492178567, -0.09152402767802698, 0.08865303467893398, -0.11961994566251645, -0.14306870783836423, 0.3994784051818507, 0.13126698126653571, 0.13424482461452097, 0.09569511023144443, 0.1657188404593375, -0.0055296235767347355, 0.07953775787798616, 0.14537896426370392, 0.08770000958375258, 0.1906357193849497, -0.14280638731895134, -0.2098335289432631, -0.03569116335144484, 0.13408671536591726] |
1,803.0115 | Confidence intervals for high-dimensional Cox models | The purpose of this paper is to construct confidence intervals for the
regression coefficients in high-dimensional Cox proportional hazards regression
models where the number of covariates may be larger than the sample size. Our
debiased estimator construction is similar to those in Zhang and Zhang (2014)
and van de Geer et al. (2014), but the time-dependent covariates and censored
risk sets introduce considerable additional challenges. Our theoretical
results, which provide conditions under which our confidence intervals are
asymptotically valid, are supported by extensive numerical experiments.
| stat.ME math.ST stat.TH | the purpose of this paper is to construct confidence intervals for the regression coefficients in highdimensional cox proportional hazards regression models where the number of covariates may be larger than the sample size our debiased estimator construction is similar to those in zhang and zhang 2014 and van de geer et al 2014 but the timedependent covariates and censored risk sets introduce considerable additional challenges our theoretical results which provide conditions under which our confidence intervals are asymptotically valid are supported by extensive numerical experiments | [['the', 'purpose', 'of', 'this', 'paper', 'is', 'to', 'construct', 'confidence', 'intervals', 'for', 'the', 'regression', 'coefficients', 'in', 'highdimensional', 'cox', 'proportional', 'hazards', 'regression', 'models', 'where', 'the', 'number', 'of', 'covariates', 'may', 'be', 'larger', 'than', 'the', 'sample', 'size', 'our', 'debiased', 'estimator', 'construction', 'is', 'similar', 'to', 'those', 'in', 'zhang', 'and', 'zhang', '2014', 'and', 'van', 'de', 'geer', 'et', 'al', '2014', 'but', 'the', 'timedependent', 'covariates', 'and', 'censored', 'risk', 'sets', 'introduce', 'considerable', 'additional', 'challenges', 'our', 'theoretical', 'results', 'which', 'provide', 'conditions', 'under', 'which', 'our', 'confidence', 'intervals', 'are', 'asymptotically', 'valid', 'are', 'supported', 'by', 'extensive', 'numerical', 'experiments']] | [-0.04310783567180967, 0.0442821244490059, -0.07170467743759647, 0.09825696568963502, -0.09612476027241963, -0.15297856706687632, 0.05493384514360086, 0.3497721452704247, -0.1780785040710779, -0.30675457249231197, 0.12883719351306996, -0.28438581190455486, -0.15808663581881452, 0.2227211006314439, -0.18948568896773985, 0.10834107556763817, 0.07327382858185207, -0.09742610100759468, 0.016887428721084313, -0.42028149189701414, 0.23777434517739013, 0.15168668563642046, 0.2918264162014512, -0.031052056451410275, 0.04976945860749658, 0.022901828674709097, -0.08554245909018551, 0.023212030869634713, -0.17184241077698328, 0.12408901393851814, 0.3143272708983739, 0.09098310564261149, 0.35138778949485105, -0.35572992261894637, -0.22314788415062461, 0.09809229217250558, 0.06377258798217073, 0.07615128572044128, 0.026743216615389375, -0.3192641159546945, 0.0501575212679146, -0.1808892998734818, -0.079399013949339, -0.09927960272111437, 0.04264021957950557, 0.030393694790408893, -0.4001625756678336, 0.15861329295782042, 0.05121666000169866, 0.07164852301425793, -0.0323701179065906, -0.18368158714078806, -0.012306946014766307, 0.0061504051486468495, 0.08220665449933971, -0.004856616149053854, 0.07354926585274583, -0.006273309686495101, -0.11799547601052944, 0.2508202716379481, -0.019228367165915722, -0.22867856769384268, 0.22669623784501763, -0.14164070331710665, -0.14890700695926654, 0.07969160377979279, 0.2037825661848354, 0.08517445836435346, -0.15667479812879773, 0.12556672693189125, -0.08716976205434869, 0.12770959013963448, 0.08267175866126576, -0.0634546955828281, 0.1276584014077397, 0.13480224501998986, 0.04854415656231782, 0.061552570279523294, -0.100185805271544, -0.0676954825881266, -0.33827280078959815, -0.10970032197895789, -0.1856661277001395, -0.033109300994478605, -0.12637097659633797, -0.19780420430881135, 0.36926991680965704, 0.21371859285898287, 0.23099896637175013, 0.13684803866781295, 0.23189036271753996, 0.09906522984315148, -0.025410407463855603, 0.12567513249266674, 0.1793288211831275, 0.09245228534290457, -0.03080650054548374, -0.14124217753517715, 0.13040739870904122, 0.033783803748733854] |
1,803.01151 | Three-dimensional optical diffraction tomographic microscopy with
optimal frequency combination with partially coherent illuminations | We demonstrate a three-dimensional (3D) optical diffraction tomographic
technique with optimal frequency combination (OFC-ODT) for the 3D quantitative
phase imaging of unlabeled specimens. Three sets of through-focus intensity
images are captured under an annular aperture and two circular apertures with
different coherence parameters. The 3D phase optical transfer functions (POTF)
corresponding to different illumination apertures are combined to obtain an
optimally synthesized frequency response, achieving high-quality, low-noise 3D
reconstructions with imaging resolution up to the incoherent diffraction limit.
Besides, the 3D imaging performance of annular illumination is explored and the
expression of 3D POTF for arbitrary illumination pupils is derived and
analyzed. It is shown that the phase-contrast washout effect in high-NA
circular apertures can be effectively addressed by introducing a complementary
annular aperture, which strongly boosts the phase contrast and improves the
practical imaging resolution. To test the feasibility of the proposed OFC-ODT
technique, the 3D refractive index reconstruction results based on a simulated
3D resolution target and experimental investigations of micro polystyrene bead
and unstained biological samples are presented. Due to its capability of
high-resolution 3D phase imaging as well as the compatibility with widely
available commercial microscope, the OFC-ODT is expected to find versatile
applications in biological and biomedical research.
| physics.optics physics.bio-ph | we demonstrate a threedimensional 3d optical diffraction tomographic technique with optimal frequency combination ofcodt for the 3d quantitative phase imaging of unlabeled specimens three sets of throughfocus intensity images are captured under an annular aperture and two circular apertures with different coherence parameters the 3d phase optical transfer functions potf corresponding to different illumination apertures are combined to obtain an optimally synthesized frequency response achieving highquality lownoise 3d reconstructions with imaging resolution up to the incoherent diffraction limit besides the 3d imaging performance of annular illumination is explored and the expression of 3d potf for arbitrary illumination pupils is derived and analyzed it is shown that the phasecontrast washout effect in highna circular apertures can be effectively addressed by introducing a complementary annular aperture which strongly boosts the phase contrast and improves the practical imaging resolution to test the feasibility of the proposed ofcodt technique the 3d refractive index reconstruction results based on a simulated 3d resolution target and experimental investigations of micro polystyrene bead and unstained biological samples are presented due to its capability of highresolution 3d phase imaging as well as the compatibility with widely available commercial microscope the ofcodt is expected to find versatile applications in biological and biomedical research | [['we', 'demonstrate', 'a', 'threedimensional', '3d', 'optical', 'diffraction', 'tomographic', 'technique', 'with', 'optimal', 'frequency', 'combination', 'ofcodt', 'for', 'the', '3d', 'quantitative', 'phase', 'imaging', 'of', 'unlabeled', 'specimens', 'three', 'sets', 'of', 'throughfocus', 'intensity', 'images', 'are', 'captured', 'under', 'an', 'annular', 'aperture', 'and', 'two', 'circular', 'apertures', 'with', 'different', 'coherence', 'parameters', 'the', '3d', 'phase', 'optical', 'transfer', 'functions', 'potf', 'corresponding', 'to', 'different', 'illumination', 'apertures', 'are', 'combined', 'to', 'obtain', 'an', 'optimally', 'synthesized', 'frequency', 'response', 'achieving', 'highquality', 'lownoise', '3d', 'reconstructions', 'with', 'imaging', 'resolution', 'up', 'to', 'the', 'incoherent', 'diffraction', 'limit', 'besides', 'the', '3d', 'imaging', 'performance', 'of', 'annular', 'illumination', 'is', 'explored', 'and', 'the', 'expression', 'of', '3d', 'potf', 'for', 'arbitrary', 'illumination', 'pupils', 'is', 'derived', 'and', 'analyzed', 'it', 'is', 'shown', 'that', 'the', 'phasecontrast', 'washout', 'effect', 'in', 'highna', 'circular', 'apertures', 'can', 'be', 'effectively', 'addressed', 'by', 'introducing', 'a', 'complementary', 'annular', 'aperture', 'which', 'strongly', 'boosts', 'the', 'phase', 'contrast', 'and', 'improves', 'the', 'practical', 'imaging', 'resolution', 'to', 'test', 'the', 'feasibility', 'of', 'the', 'proposed', 'ofcodt', 'technique', 'the', '3d', 'refractive', 'index', 'reconstruction', 'results', 'based', 'on', 'a', 'simulated', '3d', 'resolution', 'target', 'and', 'experimental', 'investigations', 'of', 'micro', 'polystyrene', 'bead', 'and', 'unstained', 'biological', 'samples', 'are', 'presented', 'due', 'to', 'its', 'capability', 'of', 'highresolution', '3d', 'phase', 'imaging', 'as', 'well', 'as', 'the', 'compatibility', 'with', 'widely', 'available', 'commercial', 'microscope', 'the', 'ofcodt', 'is', 'expected', 'to', 'find', 'versatile', 'applications', 'in', 'biological', 'and', 'biomedical', 'research']] | [-0.04179593177821571, 0.08527950471019793, -0.045063211948643274, 0.011066212256286127, -0.040197894192620445, -0.147148492203942, -0.03351978122011123, 0.48084016453789835, -0.24535751189406388, -0.3574944111467594, 0.11918591573227438, -0.27253910640616025, -0.14135441451509534, 0.2560030338655583, -0.08370318451192026, 0.14464162612091797, 0.07850774762565872, -0.06552671486817634, -0.07056842086516987, -0.16460024716045282, 0.23437956401346186, 0.07398812654683024, 0.3795511150392078, 0.013686284830328077, 0.13245210316106307, 0.03159000814211235, -0.032176115577901475, 0.06598828552958014, -0.11854059748579336, 0.12511797903054722, 0.27052248516282185, 0.09423521961507142, 0.1660150349700814, -0.4288397072979471, -0.25692052314919767, 0.012534268217772912, 0.13790748105818795, 0.08512532917854483, -0.11415840106476469, -0.3068096379086894, 0.04700643803451711, -0.06190463110795291, -0.10832051247525126, -0.09150390863529782, -0.0456994047605048, 0.010907468060494878, -0.31895651024261223, 0.033126625391094025, -0.011550151268645788, 0.10733712599867612, -0.0799284819762607, -0.07126061230972039, -0.007243897926887099, 0.1563580946728068, -0.04345219410722496, 0.025529327948313595, 0.14124970922746988, -0.16049423776288976, -0.06786433959250056, 0.3688046860865396, -0.009546650304020741, -0.16493762435567616, 0.19439699938196447, -0.1872687337767166, -0.00777128623886525, 0.18885928434574634, 0.15700938699729927, 0.13688679741445317, -0.1396328438952593, 0.01576871633794928, -0.0380749015707467, 0.23042406921566866, 0.13388990316382465, 0.05443640131577479, 0.2007279625424272, 0.21855418002742588, 0.02708993286394806, 0.17126215345444, -0.243938394728353, 0.0057969438630290585, -0.17969948677485115, -0.12748378926230158, -0.19631160077736226, 0.010809966349112453, -0.09198509253955629, -0.14868788485139012, 0.3515574867160648, 0.1699406251112064, 0.1545645546681243, 0.012421102761707978, 0.4041834942885299, 0.048903612174390265, 0.08498235623264194, -0.07505919313433566, 0.23764505027909183, 0.11918741332127282, 0.12894226800631825, -0.2251322728040772, -0.013311753517470847, 0.0106886186965959] |
1,803.01152 | Polymer Schwarzschild black hole: An effective metric | We consider the modified Einstein equations obtained in the framework of
effective spherically symmetric polymer models inspired by Loop Quantum
Gravity. When one takes into account the anomaly free point-wise holonomy
quantum corrections, the modification of Einstein equations is parametrized by
a function $f(x)$ of one phase space variable. We solve explicitly these
equations for a static interior black hole geometry and find the effective
metric describing the trapped region, inside the black hole, for any $f(x)$.
This general resolution allows to take into account a standard ambiguity
inherent to the polymer regularization: namely the choice of the spin $j$
labelling the SU$(2)$-representation of the holonomy corrections. When $j=1/2$,
the function $f(x)$ is the usual sine function used in the polymer litterature.
For this simple case, the effective exterior metric remains the classical
Schwarzschild's one but acquires modifications inside the hole. The interior
metric describes a regular trapped region and presents strong similarities with
the Reissner-Nordstr\"om metric, with a new inner horizon generated by quantum
effects. We discuss the gluing of our interior solution to the exterior
Schwarzschild metric and the challenge to extend the solution outside the
trapped region due to covariance requirement. By starting from the anomaly free
polymer regularization for inhomogeneous spherically symmetric geometry, and
then reducing to the homogeneous interior problem, we provide an alternative
treatment to existing polymer interior black hole models which focus directly
on the interior geometry, ignoring covariance issue when introducing the
polymer regularization.
| gr-qc hep-th | we consider the modified einstein equations obtained in the framework of effective spherically symmetric polymer models inspired by loop quantum gravity when one takes into account the anomaly free pointwise holonomy quantum corrections the modification of einstein equations is parametrized by a function fx of one phase space variable we solve explicitly these equations for a static interior black hole geometry and find the effective metric describing the trapped region inside the black hole for any fx this general resolution allows to take into account a standard ambiguity inherent to the polymer regularization namely the choice of the spin j labelling the su2representation of the holonomy corrections when j12 the function fx is the usual sine function used in the polymer litterature for this simple case the effective exterior metric remains the classical schwarzschilds one but acquires modifications inside the hole the interior metric describes a regular trapped region and presents strong similarities with the reissnernordstrom metric with a new inner horizon generated by quantum effects we discuss the gluing of our interior solution to the exterior schwarzschild metric and the challenge to extend the solution outside the trapped region due to covariance requirement by starting from the anomaly free polymer regularization for inhomogeneous spherically symmetric geometry and then reducing to the homogeneous interior problem we provide an alternative treatment to existing polymer interior black hole models which focus directly on the interior geometry ignoring covariance issue when introducing the polymer regularization | [['we', 'consider', 'the', 'modified', 'einstein', 'equations', 'obtained', 'in', 'the', 'framework', 'of', 'effective', 'spherically', 'symmetric', 'polymer', 'models', 'inspired', 'by', 'loop', 'quantum', 'gravity', 'when', 'one', 'takes', 'into', 'account', 'the', 'anomaly', 'free', 'pointwise', 'holonomy', 'quantum', 'corrections', 'the', 'modification', 'of', 'einstein', 'equations', 'is', 'parametrized', 'by', 'a', 'function', 'fx', 'of', 'one', 'phase', 'space', 'variable', 'we', 'solve', 'explicitly', 'these', 'equations', 'for', 'a', 'static', 'interior', 'black', 'hole', 'geometry', 'and', 'find', 'the', 'effective', 'metric', 'describing', 'the', 'trapped', 'region', 'inside', 'the', 'black', 'hole', 'for', 'any', 'fx', 'this', 'general', 'resolution', 'allows', 'to', 'take', 'into', 'account', 'a', 'standard', 'ambiguity', 'inherent', 'to', 'the', 'polymer', 'regularization', 'namely', 'the', 'choice', 'of', 'the', 'spin', 'j', 'labelling', 'the', 'su2representation', 'of', 'the', 'holonomy', 'corrections', 'when', 'j12', 'the', 'function', 'fx', 'is', 'the', 'usual', 'sine', 'function', 'used', 'in', 'the', 'polymer', 'litterature', 'for', 'this', 'simple', 'case', 'the', 'effective', 'exterior', 'metric', 'remains', 'the', 'classical', 'schwarzschilds', 'one', 'but', 'acquires', 'modifications', 'inside', 'the', 'hole', 'the', 'interior', 'metric', 'describes', 'a', 'regular', 'trapped', 'region', 'and', 'presents', 'strong', 'similarities', 'with', 'the', 'reissnernordstrom', 'metric', 'with', 'a', 'new', 'inner', 'horizon', 'generated', 'by', 'quantum', 'effects', 'we', 'discuss', 'the', 'gluing', 'of', 'our', 'interior', 'solution', 'to', 'the', 'exterior', 'schwarzschild', 'metric', 'and', 'the', 'challenge', 'to', 'extend', 'the', 'solution', 'outside', 'the', 'trapped', 'region', 'due', 'to', 'covariance', 'requirement', 'by', 'starting', 'from', 'the', 'anomaly', 'free', 'polymer', 'regularization', 'for', 'inhomogeneous', 'spherically', 'symmetric', 'geometry', 'and', 'then', 'reducing', 'to', 'the', 'homogeneous', 'interior', 'problem', 'we', 'provide', 'an', 'alternative', 'treatment', 'to', 'existing', 'polymer', 'interior', 'black', 'hole', 'models', 'which', 'focus', 'directly', 'on', 'the', 'interior', 'geometry', 'ignoring', 'covariance', 'issue', 'when', 'introducing', 'the', 'polymer', 'regularization']] | [-0.11004578301486798, 0.06468035118450643, -0.07135702063058202, 0.09977729911223239, -0.11167920794153263, -0.16360033181022607, -0.01762729886561355, 0.3030624051601434, -0.25856878852456316, -0.24359935834572827, 0.08831165841547772, -0.2790712723643774, -0.1219642749152431, 0.11743634328061392, -0.08147475981499426, 0.04490237711343822, 0.013311286918094481, 0.045116976043137275, -0.1369047215293077, -0.1969978048231391, 0.38965331399640113, 0.051470226797271396, 0.2392937081308183, 0.03078103787169507, 0.1457305764943007, 0.04295025830597748, 0.008186031761675426, 0.0671254548123674, -0.17486847408908643, 0.09745095176420228, 0.2085016720676239, 0.08687177855783135, 0.23907425937489107, -0.43389814212814376, -0.2674704209655092, 0.09273303308224012, 0.1218939522639194, 0.13567581695498715, -0.057058635986052174, -0.2937298174928258, 0.04618281556073526, -0.17402858451135794, -0.17707460495443197, -0.03957137218407117, 0.01727816180426104, -0.0701117957542912, -0.24040266292743107, 0.07483402454721923, 0.07593686465118157, -0.06094528035290081, -0.11073984471577882, -0.07543367407744565, 0.00895143752967677, 0.10747698979336318, 0.0677833964087046, 0.051491695638045606, 0.15990137506453397, -0.1074784288090492, -0.03602707824955525, 0.36361006110106125, -0.07453619026625144, -0.2835022835075386, 0.10705723795146982, -0.17558434760546282, -0.06182896350664356, 0.12079147883586985, 0.12739495796436243, 0.16836073294605228, -0.14866422160430223, 0.19001799441723938, 0.009223044401829415, 0.1309477844834039, 0.0951991322068382, 0.0009341921326839019, 0.27931069236341094, 0.10158173164712604, 0.05367653500789022, 0.18397198918406382, -0.059406240875755766, -0.16044447338978243, -0.32678029865934705, -0.1404798685007561, -0.14182331748422206, 0.08857496931363852, -0.1818999976580212, -0.2203122276210511, 0.3405929629773687, 0.08989032379939406, 0.16067520072799146, 0.011784337078555956, 0.28811435170533245, 0.10560526545707921, 0.048279024128780955, 0.09961950513659322, 0.26170306616224165, 0.13432037096070357, 0.09757051213686778, -0.2532548392355088, -0.020341274343923597, 0.15385406087960832] |
1,803.01153 | Lower bound of Riesz transform kernels and Commutator Theorems on
stratified nilpotent Lie groups | We provide a study of the Riesz transforms on stratified nilpotent Lie
groups, and obtain a certain version of the pointwise lower bound of the Riesz
transform kernel. Then we establish the characterisation of the BMO space on
stratified nilpotent Lie groups via the boundedness of the commutator of the
Riesz transforms and the BMO function. This extends the well-known Coifman,
Rochberg, Weiss theorem from Euclidean space to the setting of stratified
nilpotent Lie groups. In particular, these results apply to the well-known
example of the Heisenberg group. As an application, we also study the curl
operator on the Heisenberg group and stratified nilpotent Lie groups, and
establish the div-curl lemma with respect to the Hardy space on stratified
nilpotent Lie groups.
| math.CA | we provide a study of the riesz transforms on stratified nilpotent lie groups and obtain a certain version of the pointwise lower bound of the riesz transform kernel then we establish the characterisation of the bmo space on stratified nilpotent lie groups via the boundedness of the commutator of the riesz transforms and the bmo function this extends the wellknown coifman rochberg weiss theorem from euclidean space to the setting of stratified nilpotent lie groups in particular these results apply to the wellknown example of the heisenberg group as an application we also study the curl operator on the heisenberg group and stratified nilpotent lie groups and establish the divcurl lemma with respect to the hardy space on stratified nilpotent lie groups | [['we', 'provide', 'a', 'study', 'of', 'the', 'riesz', 'transforms', 'on', 'stratified', 'nilpotent', 'lie', 'groups', 'and', 'obtain', 'a', 'certain', 'version', 'of', 'the', 'pointwise', 'lower', 'bound', 'of', 'the', 'riesz', 'transform', 'kernel', 'then', 'we', 'establish', 'the', 'characterisation', 'of', 'the', 'bmo', 'space', 'on', 'stratified', 'nilpotent', 'lie', 'groups', 'via', 'the', 'boundedness', 'of', 'the', 'commutator', 'of', 'the', 'riesz', 'transforms', 'and', 'the', 'bmo', 'function', 'this', 'extends', 'the', 'wellknown', 'coifman', 'rochberg', 'weiss', 'theorem', 'from', 'euclidean', 'space', 'to', 'the', 'setting', 'of', 'stratified', 'nilpotent', 'lie', 'groups', 'in', 'particular', 'these', 'results', 'apply', 'to', 'the', 'wellknown', 'example', 'of', 'the', 'heisenberg', 'group', 'as', 'an', 'application', 'we', 'also', 'study', 'the', 'curl', 'operator', 'on', 'the', 'heisenberg', 'group', 'and', 'stratified', 'nilpotent', 'lie', 'groups', 'and', 'establish', 'the', 'divcurl', 'lemma', 'with', 'respect', 'to', 'the', 'hardy', 'space', 'on', 'stratified', 'nilpotent', 'lie', 'groups']] | [-0.11106645140308337, 0.09415054471018727, -0.09222416782782214, 0.12073227837796277, -0.18764799703523272, -0.023508508491222976, 0.02799496505233902, 0.3550323806245063, -0.3373891095875106, -0.1511431403298763, 0.16853777615670268, -0.21959416852828847, -0.1191226763003811, 0.23286492462636385, -0.13952435912625466, -0.05016061481561695, 0.017652801451746556, 0.11284227759532485, -0.14036444757042116, -0.27739007923691, 0.43179060790504586, -0.03809936971357856, 0.22802205247132748, -0.024808229092264274, 0.07297345590548682, 0.053817009545679466, -0.041373842395842075, -0.09090396705857424, -0.19469281257756177, 0.17613730159756102, 0.2368495099124361, 0.00430514885124094, 0.27723421426642625, -0.364276192410559, -0.15462484848151198, 0.18926440938910255, 0.12848677737142158, -0.05054162904528565, -0.05568633357933188, -0.38171454256431003, 0.0551608212818926, -0.1427594400526284, -0.15032137269688556, -0.0907572236629661, -0.013970910060051524, 0.040212191011542914, -0.23436201147383964, 0.10391865705963431, 0.1688340424643982, 0.11142438456232918, -0.1714961960392653, -0.09328819568983192, -0.04431483809278942, 0.07403047946205393, -0.027641723817977748, 0.011429458121353089, 0.12411636276338554, 0.015849557794920612, -0.11340632806455747, 0.37750977062482816, -0.06811547244242469, -0.2447578303638052, 0.14715008571224866, -0.22833088714415667, -0.15878351685041409, 0.012006058426360126, 0.1304514649110373, 0.16672469490039787, -0.03512028434130623, 0.2337126173365281, -0.1533054310110871, 0.019204026240794383, 0.07986796811818465, 0.01594698601631356, 0.002848786105340744, 0.10058819480263247, 0.18597186738472493, 0.15868480037325292, 0.040563640249706996, -0.01820732228702209, -0.3753803402364834, -0.23743726559542502, -0.13827905858691295, 0.07775298482738435, -0.1471855914650569, -0.20255575529261508, 0.3779458989748029, 0.08118412780315905, 0.1380023230105776, 0.14294256449325896, 0.17622525573204287, 0.09465083654599692, 0.07590848823520736, 0.05712984487047938, 0.14733546357754557, 0.3421192306769462, -0.006361971761970247, -0.14675900613560844, -0.10503658006486834, 0.2887752459529543] |
1,803.01154 | Unified evaluation of surface-enhanced resonance Raman scattering and
fluorescence under strong coupling regime | We demonstrate importance of molecular multiple excitons and higher-order
plasmons for both enhancement and quenching of resonance Raman and fluorescence
of single dye molecule located at plasmonic hotspot under strong coupling
regime. The multiple excitons induce complicated spectral changes in plasmon
resonance and higher-order plasmons yield drastic quenching for both resonant
Raman and fluorescence. A coupled oscillator model composed of plasmon and
multiple excitons reproduces the complicated spectral changes. Purcell factors
derived from higher-order plasmons reproduce the drastic quenching with
considering ultra-fast surface enhanced fluorescence.
| physics.optics | we demonstrate importance of molecular multiple excitons and higherorder plasmons for both enhancement and quenching of resonance raman and fluorescence of single dye molecule located at plasmonic hotspot under strong coupling regime the multiple excitons induce complicated spectral changes in plasmon resonance and higherorder plasmons yield drastic quenching for both resonant raman and fluorescence a coupled oscillator model composed of plasmon and multiple excitons reproduces the complicated spectral changes purcell factors derived from higherorder plasmons reproduce the drastic quenching with considering ultrafast surface enhanced fluorescence | [['we', 'demonstrate', 'importance', 'of', 'molecular', 'multiple', 'excitons', 'and', 'higherorder', 'plasmons', 'for', 'both', 'enhancement', 'and', 'quenching', 'of', 'resonance', 'raman', 'and', 'fluorescence', 'of', 'single', 'dye', 'molecule', 'located', 'at', 'plasmonic', 'hotspot', 'under', 'strong', 'coupling', 'regime', 'the', 'multiple', 'excitons', 'induce', 'complicated', 'spectral', 'changes', 'in', 'plasmon', 'resonance', 'and', 'higherorder', 'plasmons', 'yield', 'drastic', 'quenching', 'for', 'both', 'resonant', 'raman', 'and', 'fluorescence', 'a', 'coupled', 'oscillator', 'model', 'composed', 'of', 'plasmon', 'and', 'multiple', 'excitons', 'reproduces', 'the', 'complicated', 'spectral', 'changes', 'purcell', 'factors', 'derived', 'from', 'higherorder', 'plasmons', 'reproduce', 'the', 'drastic', 'quenching', 'with', 'considering', 'ultrafast', 'surface', 'enhanced', 'fluorescence']] | [-0.116438097945031, 0.1801268044311334, -0.001229792707325781, 0.07986128732240211, -0.00316503898733679, -0.1740035679355702, 0.02213347045266453, 0.4730077854083741, -0.20761452521033147, -0.2877420230275568, -0.13580401687855448, -0.2968562609570868, -0.17801659370692077, 0.22874922925222885, 0.05350708438850501, 0.03147595605867751, 0.0629058444961522, -0.1450445001177928, 0.055514935535543104, -0.04356914985212771, 0.2561189659049406, 0.028927343191839205, 0.3369820166598348, 0.1784601319437463, 0.04506859457229867, 0.06245247539242401, 0.08035305043038747, -0.1023842927725876, -0.09788520658827003, 0.1287298567361979, 0.2668229056193548, -0.1094577699297053, 0.20400103201322695, -0.4737453637151595, -0.24808670773225672, 0.011926690983476446, 0.24861449344795855, 0.15866605934193906, -0.08341538852940122, -0.28830575570464134, -0.04946826111990958, -0.09281893295838553, -0.08187899598303963, -0.07796740754069213, -0.07682501095730593, 0.019968117275001373, -0.25674159683506276, 0.11400652892394539, 0.04383134638123652, 0.09677390082574942, -0.04488414283841848, -0.04332202360691393, -0.08867976943797926, 0.05175953925422886, 0.012884082030231024, -0.0378920366823235, 0.3348606817040812, -0.13609639643417562, -0.11041632804690915, 0.3717527934582904, -0.17557141345323007, -0.04568118861712077, 0.2140207983964287, -0.21428740629378487, -0.026046518302139113, 0.3164917099782649, 0.13482553367776906, 0.12205914338941083, -0.06982065947342883, -0.013517189106684835, 0.05184805545517627, 0.22687366181874977, 0.17328498784233543, 0.22052357832298558, 0.21497206381138634, 0.16337455984424143, -0.0465817269485663, 0.12185977696276763, -0.15407139590174398, -0.02881755287594655, -0.181121684552636, -0.10981703512644504, -0.17948296111734474, 0.03970423391455209, -0.07753663822248413, -0.16156505381633693, 0.4513690645149087, 0.02703450162182836, 0.17124738857588348, -0.03413850969141897, 0.26593434161999646, 0.1972876912640298, 0.10752695265828686, -0.05134376178440802, 0.3164360041894457, 0.19223170800901512, 0.048312465671230764, -0.4506824433009195, -0.018682459300822195, -0.07271894828471191] |
1,803.01155 | A mathematical and numerical framework for near-field optics | This paper is concerned with the inverse problem of reconstructing small and
local perturbations of a planar surface using the field interaction between a
known plasmonic particle and the planar surface. The aim is to perform a
super-resolved reconstruction of these perturbations from shifts in the
plasmonic frequencies of the particle-surface system. In order to analyze the
interaction between the plasmonic particle and the planar surface, a well
chosen conformal mapping, which transforms the particle-surface system into a
coated structure, is used. Then the even Fourier coefficients of the
transformed domain are related to the shifts in the plasmonic resonances of the
particle-surface system. A direct reconstruction of the perturbations of the
planar surface is proposed. Its viability and limitations are documented by
numerical examples.
| math.AP | this paper is concerned with the inverse problem of reconstructing small and local perturbations of a planar surface using the field interaction between a known plasmonic particle and the planar surface the aim is to perform a superresolved reconstruction of these perturbations from shifts in the plasmonic frequencies of the particlesurface system in order to analyze the interaction between the plasmonic particle and the planar surface a well chosen conformal mapping which transforms the particlesurface system into a coated structure is used then the even fourier coefficients of the transformed domain are related to the shifts in the plasmonic resonances of the particlesurface system a direct reconstruction of the perturbations of the planar surface is proposed its viability and limitations are documented by numerical examples | [['this', 'paper', 'is', 'concerned', 'with', 'the', 'inverse', 'problem', 'of', 'reconstructing', 'small', 'and', 'local', 'perturbations', 'of', 'a', 'planar', 'surface', 'using', 'the', 'field', 'interaction', 'between', 'a', 'known', 'plasmonic', 'particle', 'and', 'the', 'planar', 'surface', 'the', 'aim', 'is', 'to', 'perform', 'a', 'superresolved', 'reconstruction', 'of', 'these', 'perturbations', 'from', 'shifts', 'in', 'the', 'plasmonic', 'frequencies', 'of', 'the', 'particlesurface', 'system', 'in', 'order', 'to', 'analyze', 'the', 'interaction', 'between', 'the', 'plasmonic', 'particle', 'and', 'the', 'planar', 'surface', 'a', 'well', 'chosen', 'conformal', 'mapping', 'which', 'transforms', 'the', 'particlesurface', 'system', 'into', 'a', 'coated', 'structure', 'is', 'used', 'then', 'the', 'even', 'fourier', 'coefficients', 'of', 'the', 'transformed', 'domain', 'are', 'related', 'to', 'the', 'shifts', 'in', 'the', 'plasmonic', 'resonances', 'of', 'the', 'particlesurface', 'system', 'a', 'direct', 'reconstruction', 'of', 'the', 'perturbations', 'of', 'the', 'planar', 'surface', 'is', 'proposed', 'its', 'viability', 'and', 'limitations', 'are', 'documented', 'by', 'numerical', 'examples']] | [-0.13469359308481216, 0.1093051638007164, -0.05991397495567798, 0.03167565387394279, -0.05793270033597946, -0.0810707551650703, -0.03134290764760226, 0.36544353565573695, -0.2915450686737895, -0.28887494567781685, 0.1040521839344874, -0.28124878361821176, -0.19718798436969517, 0.18248848954774438, -0.016735737606883048, 0.09528022466925905, 0.03508676173910499, 0.0270259351413697, -0.06347767277620733, -0.15672396834008395, 0.3260534177310765, 0.04369078523665666, 0.2526103455219418, 0.047293516639620066, 0.08028308833763004, 0.007437091862782836, 0.006413193255662918, 0.031981752328574656, -0.1187520591635257, 0.15465480926912278, 0.2110688647889765, 0.04112685056775808, 0.22580510543100535, -0.4429373165369034, -0.2044727829694748, 0.0543141947099939, 0.12666833510063588, 0.1293890211461112, -0.07376962683815509, -0.29807644797861577, 0.06970986356586217, -0.08940383686125278, -0.13147350386157633, -0.011666469775140286, -0.020099697908386588, 0.027421048432588576, -0.2612524783522822, 0.04318704515695572, 0.08154274748358875, 0.04006769923120737, -0.07514686700992752, -0.05059413763228804, -0.03536596087552607, 0.14408016101270915, 0.020844353295862674, 0.005170058578252792, 0.14600223907455803, -0.13956198049150406, -0.07385081517323852, 0.4064954605549574, -0.07286407009046525, -0.23937700957991181, 0.21355007431656123, -0.1650128032155335, -0.010530457992106676, 0.15989083256293088, 0.2027378637394868, 0.12784191700816155, -0.13641964338021353, 0.11553760893456638, 7.849624007940292e-05, 0.16232699008286, 0.09155893266201019, 0.006716494500637054, 0.20491069258935748, 0.17662912908941508, 0.05092470410838723, 0.185697332944721, -0.1057396041341126, -0.015332740142941476, -0.28900937371701, -0.1419754648953676, -0.2261896904706955, -0.027380953807383777, -0.07245054198266007, -0.20898583931475878, 0.4492235890775919, 0.10316994173452258, 0.1920673747137189, 0.019051959560252726, 0.30887749469280246, 0.12667173989117145, 0.07280016622319818, 0.012896798443049192, 0.2633215680420399, 0.18009773668833076, 0.06763517599832267, -0.27599293415434656, -0.004889822848141193, 0.04061483760736883] |
1,803.01156 | A Generalization of the Exponential-Logarithmic Distribution for
Reliability and Life Data Analysis | In this paper, we introduce a new two-parameter lifetime distribution, called
the exponential-generalized truncated logarithmic (EGTL) distribution, by
compounding the exponential and generalized truncated logarithmic
distributions. Our procedure generalizes the exponential-logarithmic (EL)
distribution modelling the reliability of systems by the use of first-order
concepts, where the minimum lifetime is considered (Tahmasbi 2008). In our
approach, we assume that a system fails if a given number k of the components
fails and then, we consider the kth-smallest value of lifetime instead of the
minimum lifetime. The reliability and failure rate functions as well as their
properties are presented for some special cases. The estimation of the
parameters is attained by the maximum likelihood, the expectation maximization
algorithm, the method of moments and the Bayesian approach, with a simulation
study performed to illustrate the different methods of estimation. The
application study is illustrated based on two real data sets used in many
applications of reliability.
| math.ST stat.OT stat.TH | in this paper we introduce a new twoparameter lifetime distribution called the exponentialgeneralized truncated logarithmic egtl distribution by compounding the exponential and generalized truncated logarithmic distributions our procedure generalizes the exponentiallogarithmic el distribution modelling the reliability of systems by the use of firstorder concepts where the minimum lifetime is considered tahmasbi 2008 in our approach we assume that a system fails if a given number k of the components fails and then we consider the kthsmallest value of lifetime instead of the minimum lifetime the reliability and failure rate functions as well as their properties are presented for some special cases the estimation of the parameters is attained by the maximum likelihood the expectation maximization algorithm the method of moments and the bayesian approach with a simulation study performed to illustrate the different methods of estimation the application study is illustrated based on two real data sets used in many applications of reliability | [['in', 'this', 'paper', 'we', 'introduce', 'a', 'new', 'twoparameter', 'lifetime', 'distribution', 'called', 'the', 'exponentialgeneralized', 'truncated', 'logarithmic', 'egtl', 'distribution', 'by', 'compounding', 'the', 'exponential', 'and', 'generalized', 'truncated', 'logarithmic', 'distributions', 'our', 'procedure', 'generalizes', 'the', 'exponentiallogarithmic', 'el', 'distribution', 'modelling', 'the', 'reliability', 'of', 'systems', 'by', 'the', 'use', 'of', 'firstorder', 'concepts', 'where', 'the', 'minimum', 'lifetime', 'is', 'considered', 'tahmasbi', '2008', 'in', 'our', 'approach', 'we', 'assume', 'that', 'a', 'system', 'fails', 'if', 'a', 'given', 'number', 'k', 'of', 'the', 'components', 'fails', 'and', 'then', 'we', 'consider', 'the', 'kthsmallest', 'value', 'of', 'lifetime', 'instead', 'of', 'the', 'minimum', 'lifetime', 'the', 'reliability', 'and', 'failure', 'rate', 'functions', 'as', 'well', 'as', 'their', 'properties', 'are', 'presented', 'for', 'some', 'special', 'cases', 'the', 'estimation', 'of', 'the', 'parameters', 'is', 'attained', 'by', 'the', 'maximum', 'likelihood', 'the', 'expectation', 'maximization', 'algorithm', 'the', 'method', 'of', 'moments', 'and', 'the', 'bayesian', 'approach', 'with', 'a', 'simulation', 'study', 'performed', 'to', 'illustrate', 'the', 'different', 'methods', 'of', 'estimation', 'the', 'application', 'study', 'is', 'illustrated', 'based', 'on', 'two', 'real', 'data', 'sets', 'used', 'in', 'many', 'applications', 'of', 'reliability']] | [-0.09578772111174962, 0.03761424484352271, -0.08560870432139685, 0.07887325018333892, -0.020801683214182656, -0.07955943478271366, 0.05587748169549741, 0.3249333478603512, -0.257381253549053, -0.2972779454073558, 0.12434911574004218, -0.2423435557462896, -0.16174140689894556, 0.19786698928723734, -0.07688437595342597, 0.10776123092509807, 0.052762427798782784, 0.04254797500713418, -0.07296288510629287, -0.26369730378190676, 0.31412015193452436, 0.06630803723121062, 0.309221899608771, 0.03167987852667769, 0.08534309893303241, 0.05798599945846945, -0.020883545875549317, 0.026765121747048398, -0.15551678029999796, 0.1296174162408958, 0.18998779430675009, 0.1887774279527366, 0.31544248894788324, -0.35747286181896926, -0.21810365714753668, 0.12967298979560535, 0.12234544376454627, 0.04503601131184647, -0.015808998921420424, -0.23003746955965956, 0.08948353820946067, -0.20839123555924743, -0.12925684495052944, -0.05638314962697526, -0.014902186769371231, 0.07638361832437415, -0.29454452538241943, 0.08655400426747899, 0.04335615641825522, 0.02182512602147957, -0.0445185413894554, -0.14655877252652622, 0.008715118826366962, 0.09243379014233748, 0.05102461542856569, -0.03545537525205873, 0.09150673446866374, -0.1017683993159638, -0.12475082962463299, 0.3463730979400376, -0.06965002227186536, -0.20011223473275702, 0.14261350847858315, -0.10945256286300718, -0.1251649411022663, 0.09055949366108204, 0.17606302168841162, 0.17195905840490014, -0.14637536810090143, 0.08502509553761532, -0.028634146482994158, 0.13308830870315433, 0.017995946584269406, -0.0031176986762632927, 0.14219520109239966, 0.16596540501651666, 0.05017860400796053, 0.1750377330960085, -0.11118345685613652, -0.11418758998004098, -0.31921462661897143, -0.14608163287087034, -0.22866944476030768, -0.011723406401773294, -0.10214620299288071, -0.160701148994267, 0.410795198927323, 0.17646344168887784, 0.2335268407035619, 0.10608641832135618, 0.3126576948041717, 0.16375797586825988, 0.0179066925868392, 0.07662152036185338, 0.19283590186484315, 0.1398508329798157, 0.049129432202316824, -0.21133391006384045, 0.10715272514304768, 0.04808379345263044] |
1,803.01157 | Parametrizing theories of gravity on large and small scales in cosmology | We present a link between parametrizations of alternative theories of gravity
on large and small scales in cosmology. This relationship is established using
theoretical consistency conditions only. We find that in both limits the "slip"
and "effective Newton's constant" can be written in terms of a set of four
functions of time, two of which are direct generalizations of the $\alpha$ and
$\gamma$ parameters from post-Newtonian physics. This generalizes previous work
that has constructed frameworks for testing gravity on small scales, and is to
the best of our knowledge the first time that a link between parametrizations
of gravity on such very different scales has been established. We expect our
result to facilitate the imposition of observational constraints, by
drastically reducing the number of functional degrees of freedom required to
consistently test gravity on multiple scales in cosmology.
| gr-qc astro-ph.CO | we present a link between parametrizations of alternative theories of gravity on large and small scales in cosmology this relationship is established using theoretical consistency conditions only we find that in both limits the slip and effective newtons constant can be written in terms of a set of four functions of time two of which are direct generalizations of the alpha and gamma parameters from postnewtonian physics this generalizes previous work that has constructed frameworks for testing gravity on small scales and is to the best of our knowledge the first time that a link between parametrizations of gravity on such very different scales has been established we expect our result to facilitate the imposition of observational constraints by drastically reducing the number of functional degrees of freedom required to consistently test gravity on multiple scales in cosmology | [['we', 'present', 'a', 'link', 'between', 'parametrizations', 'of', 'alternative', 'theories', 'of', 'gravity', 'on', 'large', 'and', 'small', 'scales', 'in', 'cosmology', 'this', 'relationship', 'is', 'established', 'using', 'theoretical', 'consistency', 'conditions', 'only', 'we', 'find', 'that', 'in', 'both', 'limits', 'the', 'slip', 'and', 'effective', 'newtons', 'constant', 'can', 'be', 'written', 'in', 'terms', 'of', 'a', 'set', 'of', 'four', 'functions', 'of', 'time', 'two', 'of', 'which', 'are', 'direct', 'generalizations', 'of', 'the', 'alpha', 'and', 'gamma', 'parameters', 'from', 'postnewtonian', 'physics', 'this', 'generalizes', 'previous', 'work', 'that', 'has', 'constructed', 'frameworks', 'for', 'testing', 'gravity', 'on', 'small', 'scales', 'and', 'is', 'to', 'the', 'best', 'of', 'our', 'knowledge', 'the', 'first', 'time', 'that', 'a', 'link', 'between', 'parametrizations', 'of', 'gravity', 'on', 'such', 'very', 'different', 'scales', 'has', 'been', 'established', 'we', 'expect', 'our', 'result', 'to', 'facilitate', 'the', 'imposition', 'of', 'observational', 'constraints', 'by', 'drastically', 'reducing', 'the', 'number', 'of', 'functional', 'degrees', 'of', 'freedom', 'required', 'to', 'consistently', 'test', 'gravity', 'on', 'multiple', 'scales', 'in', 'cosmology']] | [-0.1509181947508098, 0.10312462290006595, -0.11567972611932867, 0.062323472928255796, -0.08865032085737186, -0.10160115039637448, 0.01962058779621578, 0.30190562070819776, -0.22770626961078116, -0.36261014261053526, 0.07260249001294564, -0.21655203067306159, -0.11888408512416956, 0.22951105558920815, -0.02590701921397577, 0.040775077343257006, 0.024269156272698572, 0.0057637493692986345, -0.0875594526886994, -0.25759085307430907, 0.33273051621939015, 0.06749382945776418, 0.2299724055721553, 0.06590387952325029, 0.10543557585460013, -0.05401512238777418, -0.051590229107903826, 0.06487419296973858, -0.15693164568142823, 0.09594233285473741, 0.21840102065091385, 0.13556148052262817, 0.23569330323379542, -0.44063281763911893, -0.2494136181363053, 0.06751080570013626, 0.10795474053778942, 0.11099316586531105, -0.011972816353933751, -0.23780294320802542, 0.057026385100207466, -0.16410417304765704, -0.08023537588778182, -0.06972382729535626, 0.022838402890424797, 0.00837450928689129, -0.2562661084069776, 0.08100270919996969, 0.006400766964677883, 0.024239303636958524, -0.04046536246112183, -0.12845760265000813, 0.032596461712787655, 0.1344477639000431, 0.11779323098438697, 0.03368013552255065, 0.06947337081520885, -0.1393031024178355, -0.11007415252211301, 0.40325910946948157, -0.10204253392294049, -0.22853443486636263, 0.24161727878980446, -0.15269796306307873, -0.18640508250994742, 0.03848655190507787, 0.15558082136271548, 0.12755899396522538, -0.1400172665708469, 0.13156566717088278, -0.015727458865908178, 0.16973656438969317, 0.08893183780415659, 0.03988538793814571, 0.21145501886949997, 0.1660463588343481, 0.0522068167321276, 0.08820833958790003, -0.06392492471175079, -0.09044093763130123, -0.35670923986649344, -0.13013617013432627, -0.18064576237921373, 0.014410659274342808, -0.15341582805432036, -0.13234478277424216, 0.3829909378959649, 0.17236873997371996, 0.17697706837477029, 0.10847122683712834, 0.26937028299342247, 0.07083014093191393, 0.09130241178006501, 0.03399101983877304, 0.3017234725378238, 0.11176461176238144, 0.03199524294746959, -0.2046549600921065, 0.04727194231826866, 0.0510871853929121] |
1,803.01158 | Quench dynamics of the Ising field theory in a magnetic field | We numerically simulate the time evolution of the Ising field theory after
quenches starting from the $E_8$ integrable model using the Truncated Conformal
Space Approach. The results are compared with two different analytic
predictions based on form factor expansions in the pre-quench and post-quench
basis, respectively. Our results clarify the domain of validity of these
expansions and suggest directions for further improvement. We show for quenches
in the $E_8$ model that the initial state is not of the integrable pair state
form. We also construct quench overlap functions and show that their
high-energy asymptotics are markedly different from those constructed before in
the sinh/sine-Gordon theory, and argue that this is related to properties of
the ultraviolet fixed point.
| cond-mat.stat-mech hep-th | we numerically simulate the time evolution of the ising field theory after quenches starting from the e_8 integrable model using the truncated conformal space approach the results are compared with two different analytic predictions based on form factor expansions in the prequench and postquench basis respectively our results clarify the domain of validity of these expansions and suggest directions for further improvement we show for quenches in the e_8 model that the initial state is not of the integrable pair state form we also construct quench overlap functions and show that their highenergy asymptotics are markedly different from those constructed before in the sinhsinegordon theory and argue that this is related to properties of the ultraviolet fixed point | [['we', 'numerically', 'simulate', 'the', 'time', 'evolution', 'of', 'the', 'ising', 'field', 'theory', 'after', 'quenches', 'starting', 'from', 'the', 'e_8', 'integrable', 'model', 'using', 'the', 'truncated', 'conformal', 'space', 'approach', 'the', 'results', 'are', 'compared', 'with', 'two', 'different', 'analytic', 'predictions', 'based', 'on', 'form', 'factor', 'expansions', 'in', 'the', 'prequench', 'and', 'postquench', 'basis', 'respectively', 'our', 'results', 'clarify', 'the', 'domain', 'of', 'validity', 'of', 'these', 'expansions', 'and', 'suggest', 'directions', 'for', 'further', 'improvement', 'we', 'show', 'for', 'quenches', 'in', 'the', 'e_8', 'model', 'that', 'the', 'initial', 'state', 'is', 'not', 'of', 'the', 'integrable', 'pair', 'state', 'form', 'we', 'also', 'construct', 'quench', 'overlap', 'functions', 'and', 'show', 'that', 'their', 'highenergy', 'asymptotics', 'are', 'markedly', 'different', 'from', 'those', 'constructed', 'before', 'in', 'the', 'sinhsinegordon', 'theory', 'and', 'argue', 'that', 'this', 'is', 'related', 'to', 'properties', 'of', 'the', 'ultraviolet', 'fixed', 'point']] | [-0.07712551857977627, 0.12538817192181054, -0.12324622550453895, 0.09779295483783174, 0.004222247650066757, -0.09481767502525805, 0.007850126994168784, 0.38664843945198846, -0.23727497751386756, -0.23387430320119756, 0.10455751135392098, -0.2677174804445643, -0.15678590743476126, 0.19066366245651728, 0.03755827093672039, 0.032789776961390786, 0.06380157606700101, 0.03277884976954287, -0.15738806984403259, -0.26111805588643777, 0.3676087603482426, -0.009262480886462025, 0.2928443103710301, 0.02849082542089825, 0.04130082650997668, 0.0059410107011596365, -0.004556309849692461, -0.02064817904670818, -0.1580213376819768, 0.07149766006285094, 0.21198869267136305, 0.07821268827901182, 0.20217456282554275, -0.44417312199998105, -0.1875903965332187, 0.06199981905838363, 0.15677915841070378, 0.15074026734074658, -0.019645611154568247, -0.27087143727013063, 0.058857132812552, -0.16918677316071132, -0.1895969211896006, -0.09890118593939094, -0.02385133628745396, 0.03817530550285537, -0.2529486372607211, 0.09083780263322724, 0.03259082078639195, 0.040672994149116494, -0.11152940061596087, -0.10323134791026385, -0.03118086614821138, 0.12230976750978674, 0.06044766886167738, 0.05239126757662903, 0.10693688470567776, -0.16000299689630604, -0.13008547843330437, 0.33436973492463684, -0.0606226427689529, -0.1858432205974992, 0.1809462459347983, -0.18199406483043462, -0.14917139095278123, 0.09450814149812119, 0.10431860320859103, 0.10237780001917933, -0.11729592739074077, 0.11267354410802388, -0.0316307320096331, 0.10615128100552182, 0.03693155156305203, 0.025700837552834015, 0.19298445528898484, 0.11240036043728519, -0.014425725986560186, 0.15154742223855394, -0.03963728097235609, -0.16525592091373908, -0.3511405503138518, -0.09262110265847455, -0.20098626125667596, 0.07301123299186703, -0.11786530592675823, -0.15065160744751876, 0.4208586480325231, 0.2019691898294229, 0.21586093574993184, 0.08405115169425233, 0.18237518226234323, 0.1376848141831927, 0.02882623318861374, 0.07822713766318674, 0.2396942446103845, 0.08913229626372583, 0.05416481371503323, -0.23622735208905357, -0.028890847622488555, 0.12101273624719973] |
1,803.01159 | Enhancement of land-use change modeling using convolutional neural
networks and convolutional denoising autoencoders | The neighborhood effect is a key driving factor for the land-use change (LUC)
process. This study applies convolutional neural networks (CNN) to capture
neighborhood characteristics from satellite images and to enhance the
performance of LUC modeling. We develop a hybrid CNN model (conv-net) to
predict the LU transition probability by combining satellite images and
geographical features. A spatial weight layer is designed to incorporate the
distance-decay characteristics of neighborhood effect into conv-net. As an
alternative model, we also develop a hybrid convolutional denoising autoencoder
and multi-layer perceptron model (CDAE-net), which specifically learns latent
representations from satellite images and denoises the image data. Finally, a
DINAMICA-based cellular automata (CA) model simulates the LU pattern. The
results show that the convolutional-based models improve the modeling
performances compared with a model that accepts only the geographical features.
Overall, conv-net outperforms CDAE-net in terms of LUC predictive performance.
Nonetheless, CDAE-net performs better when the data are noisy.
| stat.AP cs.CV | the neighborhood effect is a key driving factor for the landuse change luc process this study applies convolutional neural networks cnn to capture neighborhood characteristics from satellite images and to enhance the performance of luc modeling we develop a hybrid cnn model convnet to predict the lu transition probability by combining satellite images and geographical features a spatial weight layer is designed to incorporate the distancedecay characteristics of neighborhood effect into convnet as an alternative model we also develop a hybrid convolutional denoising autoencoder and multilayer perceptron model cdaenet which specifically learns latent representations from satellite images and denoises the image data finally a dinamicabased cellular automata ca model simulates the lu pattern the results show that the convolutionalbased models improve the modeling performances compared with a model that accepts only the geographical features overall convnet outperforms cdaenet in terms of luc predictive performance nonetheless cdaenet performs better when the data are noisy | [['the', 'neighborhood', 'effect', 'is', 'a', 'key', 'driving', 'factor', 'for', 'the', 'landuse', 'change', 'luc', 'process', 'this', 'study', 'applies', 'convolutional', 'neural', 'networks', 'cnn', 'to', 'capture', 'neighborhood', 'characteristics', 'from', 'satellite', 'images', 'and', 'to', 'enhance', 'the', 'performance', 'of', 'luc', 'modeling', 'we', 'develop', 'a', 'hybrid', 'cnn', 'model', 'convnet', 'to', 'predict', 'the', 'lu', 'transition', 'probability', 'by', 'combining', 'satellite', 'images', 'and', 'geographical', 'features', 'a', 'spatial', 'weight', 'layer', 'is', 'designed', 'to', 'incorporate', 'the', 'distancedecay', 'characteristics', 'of', 'neighborhood', 'effect', 'into', 'convnet', 'as', 'an', 'alternative', 'model', 'we', 'also', 'develop', 'a', 'hybrid', 'convolutional', 'denoising', 'autoencoder', 'and', 'multilayer', 'perceptron', 'model', 'cdaenet', 'which', 'specifically', 'learns', 'latent', 'representations', 'from', 'satellite', 'images', 'and', 'denoises', 'the', 'image', 'data', 'finally', 'a', 'dinamicabased', 'cellular', 'automata', 'ca', 'model', 'simulates', 'the', 'lu', 'pattern', 'the', 'results', 'show', 'that', 'the', 'convolutionalbased', 'models', 'improve', 'the', 'modeling', 'performances', 'compared', 'with', 'a', 'model', 'that', 'accepts', 'only', 'the', 'geographical', 'features', 'overall', 'convnet', 'outperforms', 'cdaenet', 'in', 'terms', 'of', 'luc', 'predictive', 'performance', 'nonetheless', 'cdaenet', 'performs', 'better', 'when', 'the', 'data', 'are', 'noisy']] | [-0.01924689596870433, -0.0285027106006326, -0.07971255927167784, 0.09207493484809554, -0.08446843899317727, -0.1972148687060651, 0.029691405908901566, 0.42979853513915806, -0.2906641448718428, -0.29845978554634267, 0.017538564319476417, -0.29071017917220954, -0.2578736085148639, 0.13853302612031088, -0.1427423501809726, 0.05012187553725409, 0.13174958515369536, 0.024852944988239284, -0.053768682565352104, -0.23728055471480386, 0.2884347340884612, 0.11323450625078468, 0.3790730567439305, -0.059338384005703675, 0.12881623361481737, -0.03636772731713803, -0.031728730671915735, -0.009559498828471891, -0.044262160229923, 0.1206804747933781, 0.2665287658509026, 0.16744471571041233, 0.27260091960806376, -0.42325265811669904, -0.30972010000849404, 0.050485573119995804, 0.11033967461449322, 0.06147202732433127, 0.004667016739235414, -0.33279869408155516, 0.10256108102567543, -0.18001625900286317, 0.017643713431636378, -0.10305616789727182, -0.05599501420086903, -0.010948154442351534, -0.3272145159961964, 0.035485169608014885, 0.0988032313446138, 0.041197562500809796, -0.0785454096964912, -0.10032766935221284, -0.041843358908366685, 0.1521252448640113, -0.05086151607252121, 0.04655790753471387, 0.15842747508505026, -0.1800793869627504, -0.11795533812429065, 0.34236978535657586, -0.09469613688728087, -0.19869799425344395, 0.14729852792159315, -0.03368998178525574, -0.13153445155942653, 0.08735547708779179, 0.24302700772844502, 0.05136908128524557, -0.15066614947083254, 0.01042622765557014, -0.0663540954115671, 0.20538475410935672, 0.021050582504183644, -0.0027797016383006874, 0.1624163799897601, 0.2905245810201305, -0.0019020604194043241, 0.13671297790476472, -0.21185438220531044, -0.06639858204270066, -0.15232368969414012, -0.09313054191756574, -0.1592871276445884, -0.05254522988739244, -0.12282161936680447, -0.13333617153713195, 0.4650804873259849, 0.22544859984383875, 0.24360265528215774, 0.124546037568242, 0.3376610252222922, 0.032471379375436794, 0.1216598669890413, 0.09527022782589821, 0.14278089279148554, 0.043629823248703896, 0.12202553042759563, -0.16285792118962236, 0.10640768636737345, 0.09529330540411421] |
1,803.0116 | Real-Time Deep Learning Method for Abandoned Luggage Detection in Video | Recent terrorist attacks in major cities around the world have brought many
casualties among innocent citizens. One potential threat is represented by
abandoned luggage items (that could contain bombs or biological warfare) in
public areas. In this paper, we describe an approach for real-time automatic
detection of abandoned luggage in video captured by surveillance cameras. The
approach is comprised of two stages: (i) static object detection based on
background subtraction and motion estimation and (ii) abandoned luggage
recognition based on a cascade of convolutional neural networks (CNN). To train
our neural networks we provide two types of examples: images collected from the
Internet and realistic examples generated by imposing various suitcases and
bags over the scene's background. We present empirical results demonstrating
that our approach yields better performance than a strong CNN baseline method.
| cs.CV | recent terrorist attacks in major cities around the world have brought many casualties among innocent citizens one potential threat is represented by abandoned luggage items that could contain bombs or biological warfare in public areas in this paper we describe an approach for realtime automatic detection of abandoned luggage in video captured by surveillance cameras the approach is comprised of two stages i static object detection based on background subtraction and motion estimation and ii abandoned luggage recognition based on a cascade of convolutional neural networks cnn to train our neural networks we provide two types of examples images collected from the internet and realistic examples generated by imposing various suitcases and bags over the scenes background we present empirical results demonstrating that our approach yields better performance than a strong cnn baseline method | [['recent', 'terrorist', 'attacks', 'in', 'major', 'cities', 'around', 'the', 'world', 'have', 'brought', 'many', 'casualties', 'among', 'innocent', 'citizens', 'one', 'potential', 'threat', 'is', 'represented', 'by', 'abandoned', 'luggage', 'items', 'that', 'could', 'contain', 'bombs', 'or', 'biological', 'warfare', 'in', 'public', 'areas', 'in', 'this', 'paper', 'we', 'describe', 'an', 'approach', 'for', 'realtime', 'automatic', 'detection', 'of', 'abandoned', 'luggage', 'in', 'video', 'captured', 'by', 'surveillance', 'cameras', 'the', 'approach', 'is', 'comprised', 'of', 'two', 'stages', 'i', 'static', 'object', 'detection', 'based', 'on', 'background', 'subtraction', 'and', 'motion', 'estimation', 'and', 'ii', 'abandoned', 'luggage', 'recognition', 'based', 'on', 'a', 'cascade', 'of', 'convolutional', 'neural', 'networks', 'cnn', 'to', 'train', 'our', 'neural', 'networks', 'we', 'provide', 'two', 'types', 'of', 'examples', 'images', 'collected', 'from', 'the', 'internet', 'and', 'realistic', 'examples', 'generated', 'by', 'imposing', 'various', 'suitcases', 'and', 'bags', 'over', 'the', 'scenes', 'background', 'we', 'present', 'empirical', 'results', 'demonstrating', 'that', 'our', 'approach', 'yields', 'better', 'performance', 'than', 'a', 'strong', 'cnn', 'baseline', 'method']] | [-0.08241097706797204, 0.008366676704906439, -0.058261598250303505, 0.06598950831195045, -0.06826265232945632, -0.17362786033295824, -0.0031674838724679182, 0.41845727599176924, -0.18370713524763732, -0.3434009927892147, 0.08812120496610501, -0.3106115565572242, -0.21002143396316728, 0.2220186161041904, -0.18882551175521167, 0.035370292745117465, 0.13676702156505385, 0.03369341366701143, 0.03594201295531558, -0.30920431540081544, 0.3056169552045797, 0.016528634753610407, 0.3409782722872451, 0.029391067645239428, 0.11745487262855488, -0.012910310850352665, -0.07825129725217567, 0.019148176185842743, -0.00818611859027524, 0.16196858191414548, 0.3266291381945287, 0.2417701795991314, 0.31821463475199907, -0.46748621122477424, -0.24379743835223572, 0.09316171475911961, 0.14474369175697124, 0.08028309131251242, -0.06722795861927246, -0.42441553185532865, 0.0931326634954325, -0.23541608606150052, -0.02834275018080677, -0.0947524483247373, 0.0038490313450154617, -0.020762175823127695, -0.22621876308764505, 0.033969413639655464, 0.030838547309482454, 0.1161241099519368, -0.05265503395453824, -0.09317403302801058, 0.04124132486907555, 0.17828848100393394, 0.05782735415736977, -0.0036967125252113306, 0.1839257374614183, -0.21347808382557915, -0.16060771698594317, 0.36111352326614515, -0.04138245050415933, -0.15439859801081457, 0.1995862677301231, -0.007641532475871027, -0.1511406602400978, 0.11192659261335332, 0.24785151626018428, 0.1118824334212936, -0.1855002838060876, -0.04937002302718146, -0.040982019956244675, 0.15988504629463127, 0.10111843533218748, -0.007441994044369548, 0.23066879804876345, 0.2679799277321401, 0.013972745964538194, 0.09779831758154121, -0.1520373285608016, -0.07102929576321092, -0.21460439649907717, -0.050188098948350864, -0.15290068641578064, 0.020771444039909465, -0.07435373093230874, -0.12643695376372258, 0.3997071129339922, 0.24563306761919557, 0.15105547568641772, 0.048815672170314794, 0.36732724757823054, -0.034794410856972845, 0.1284732178441788, 0.07844091223244716, 0.19058701744271597, -0.038216535037005304, 0.17732504870360927, -0.09514987384865439, 0.09119830575081891, 0.058468544593122895] |
1,803.01161 | Room Temperature Electrically Detected Nuclear Spin Coherence of NV
Centers in Diamond | We demonstrate electrical detection of the $^{14}$N nuclear spin coherence of
NV centers at room temperature. Nuclear spins are candidates for quantum
memories in quantum-information devices and quantum sensors, and hence the
electrical detection of nuclear spin coherence is essential to develop and
integrate such quantum devices. In the present study, we used a pulsed
electrically detected electron-nuclear double resonance technique to measure
the Rabi oscillations and coherence time ($T_2$) of $^{14}$N nuclear spins in
NV centers at room temperature. We observed $T_2 \approx$ 0.9 ms at room
temperature. Our results will pave the way for the development of novel
electron- and nuclear-spin-based diamond quantum devices.
| cond-mat.mes-hall quant-ph | we demonstrate electrical detection of the 14n nuclear spin coherence of nv centers at room temperature nuclear spins are candidates for quantum memories in quantuminformation devices and quantum sensors and hence the electrical detection of nuclear spin coherence is essential to develop and integrate such quantum devices in the present study we used a pulsed electrically detected electronnuclear double resonance technique to measure the rabi oscillations and coherence time t_2 of 14n nuclear spins in nv centers at room temperature we observed t_2 approx 09 ms at room temperature our results will pave the way for the development of novel electron and nuclearspinbased diamond quantum devices | [['we', 'demonstrate', 'electrical', 'detection', 'of', 'the', '14n', 'nuclear', 'spin', 'coherence', 'of', 'nv', 'centers', 'at', 'room', 'temperature', 'nuclear', 'spins', 'are', 'candidates', 'for', 'quantum', 'memories', 'in', 'quantuminformation', 'devices', 'and', 'quantum', 'sensors', 'and', 'hence', 'the', 'electrical', 'detection', 'of', 'nuclear', 'spin', 'coherence', 'is', 'essential', 'to', 'develop', 'and', 'integrate', 'such', 'quantum', 'devices', 'in', 'the', 'present', 'study', 'we', 'used', 'a', 'pulsed', 'electrically', 'detected', 'electronnuclear', 'double', 'resonance', 'technique', 'to', 'measure', 'the', 'rabi', 'oscillations', 'and', 'coherence', 'time', 't_2', 'of', '14n', 'nuclear', 'spins', 'in', 'nv', 'centers', 'at', 'room', 'temperature', 'we', 'observed', 't_2', 'approx', '09', 'ms', 'at', 'room', 'temperature', 'our', 'results', 'will', 'pave', 'the', 'way', 'for', 'the', 'development', 'of', 'novel', 'electron', 'and', 'nuclearspinbased', 'diamond', 'quantum', 'devices']] | [-0.10848185978390558, 0.27599715736237757, -0.008141885103025246, 0.0013377256570647489, 0.0575087535533316, -0.17002636123501327, 0.06115143799512946, 0.47044938057661057, -0.22279338441560712, -0.28687403340964523, 0.04353224849526085, -0.3337287620272277, -0.0019041725241069525, 0.24458892344725583, 0.03656611748408737, 0.0636589271016419, 0.006244208470408646, 0.03730083733164477, -0.07300370902082233, -0.15079740783252385, 0.18483310247708842, 0.02674355259920769, 0.33209805346955107, 0.1459996718386153, 0.1407035369127286, 0.02843647302712648, 0.11956178628452965, -0.07058793034861391, -0.10681207696723265, 0.09500153154521337, 0.367984538476141, 0.008324415909504201, 0.1820154699655074, -0.47685679510446655, -0.1646710069913786, 0.07562838811515216, 0.12730364186495965, 0.22705898796980278, -0.13162635963515573, -0.30842909754587794, 0.06442432202627214, -0.14278746364563527, -0.11540020545595875, -0.14038334801828242, 0.013406418654891962, -0.03494523174155785, -0.19423672916227072, 0.11146632208651423, 0.05333573051359294, 0.06396801300557717, -0.06697131088099614, -0.09353928255655293, 0.07969567481700753, 0.0926877063619992, -0.11353717520525504, 0.0375641998549361, 0.3101819826351514, -0.09439975826974677, -0.2039001457358025, 0.29608001533614575, -0.04059242692617875, -3.7973395214890535e-05, 0.14583452327291146, -0.21945414480089895, -0.1000051495996919, 0.05448910044857635, 0.13459897957871808, 0.14692673254494537, -0.18340699253428094, 0.02808371280432011, 0.10232295339294481, 0.19924087913812333, 0.04047518084923965, 0.18492731600472667, 0.26817338938280094, 0.2017113113740705, 0.09450237365562539, 0.12157810346074051, -0.19539952301090793, -0.03572752701891762, -0.1794867222636657, -0.19302085238807606, -0.2017490323720816, 0.1485505224126479, -0.0611029176060978, -0.06293940175992419, 0.4068676649311663, 0.17153926308811554, 0.150259449257612, -0.07008926506277244, 0.3038663948218356, 0.08041486546577323, 0.11752304404354566, 0.0315777692320001, 0.23184811038334133, 0.26735294366009393, 0.12005491702342933, -0.3919490340455734, 0.0032808231453428853, -0.07064683055329435] |
1,803.01162 | A hierarchical Bayesian model to infer PL(Z) relations using Gaia
parallaxes | Aims. We aim at creating a Bayesian model to infer the coefficients of PL or
PLZ relations that propagates uncertainties in the observables in a rigorous
and well founded way. Methods. We propose a directed acyclic graph to encode
the conditional probabilities of the inference model that will allow us to
infer probability distributions for the PL and PL(Z) relations. We evaluate the
model with several semi-synthetic data sets and apply it to a sample of 200
fundamental mode and first overtone mode RR Lyrae stars for which Gaia DR1
parallaxes and literature Ks-band mean magnitudes are available. We define and
test several hyperprior probabilities to verify their adequacy and check the
sensitivity of the solution with respect to the prior choice. Results. The main
conclusion of this work is the absolute necessity of incorporating the existing
correlations between the observed variables (periods, metallicities and
parallaxes) in the form of model priors in order to avoid systematically biased
results, especially in the case of non-negligible uncertainties in the
parallaxes. The tests with the semi-synthetic data based on the data set used
in Gaia Collaboration et al. (2017) reveal the significant impact that the
existing correlations between parallax, metallicity and periods have on the
inferred parameters. The relation coefficients obtained here have been
superseded by those presented in Muraveva et al. (2018a), that incorporates the
findings of this work and the more recent Gaia DR2 measurements.
| astro-ph.IM | aims we aim at creating a bayesian model to infer the coefficients of pl or plz relations that propagates uncertainties in the observables in a rigorous and well founded way methods we propose a directed acyclic graph to encode the conditional probabilities of the inference model that will allow us to infer probability distributions for the pl and plz relations we evaluate the model with several semisynthetic data sets and apply it to a sample of 200 fundamental mode and first overtone mode rr lyrae stars for which gaia dr1 parallaxes and literature ksband mean magnitudes are available we define and test several hyperprior probabilities to verify their adequacy and check the sensitivity of the solution with respect to the prior choice results the main conclusion of this work is the absolute necessity of incorporating the existing correlations between the observed variables periods metallicities and parallaxes in the form of model priors in order to avoid systematically biased results especially in the case of nonnegligible uncertainties in the parallaxes the tests with the semisynthetic data based on the data set used in gaia collaboration et al 2017 reveal the significant impact that the existing correlations between parallax metallicity and periods have on the inferred parameters the relation coefficients obtained here have been superseded by those presented in muraveva et al 2018a that incorporates the findings of this work and the more recent gaia dr2 measurements | [['aims', 'we', 'aim', 'at', 'creating', 'a', 'bayesian', 'model', 'to', 'infer', 'the', 'coefficients', 'of', 'pl', 'or', 'plz', 'relations', 'that', 'propagates', 'uncertainties', 'in', 'the', 'observables', 'in', 'a', 'rigorous', 'and', 'well', 'founded', 'way', 'methods', 'we', 'propose', 'a', 'directed', 'acyclic', 'graph', 'to', 'encode', 'the', 'conditional', 'probabilities', 'of', 'the', 'inference', 'model', 'that', 'will', 'allow', 'us', 'to', 'infer', 'probability', 'distributions', 'for', 'the', 'pl', 'and', 'plz', 'relations', 'we', 'evaluate', 'the', 'model', 'with', 'several', 'semisynthetic', 'data', 'sets', 'and', 'apply', 'it', 'to', 'a', 'sample', 'of', '200', 'fundamental', 'mode', 'and', 'first', 'overtone', 'mode', 'rr', 'lyrae', 'stars', 'for', 'which', 'gaia', 'dr1', 'parallaxes', 'and', 'literature', 'ksband', 'mean', 'magnitudes', 'are', 'available', 'we', 'define', 'and', 'test', 'several', 'hyperprior', 'probabilities', 'to', 'verify', 'their', 'adequacy', 'and', 'check', 'the', 'sensitivity', 'of', 'the', 'solution', 'with', 'respect', 'to', 'the', 'prior', 'choice', 'results', 'the', 'main', 'conclusion', 'of', 'this', 'work', 'is', 'the', 'absolute', 'necessity', 'of', 'incorporating', 'the', 'existing', 'correlations', 'between', 'the', 'observed', 'variables', 'periods', 'metallicities', 'and', 'parallaxes', 'in', 'the', 'form', 'of', 'model', 'priors', 'in', 'order', 'to', 'avoid', 'systematically', 'biased', 'results', 'especially', 'in', 'the', 'case', 'of', 'nonnegligible', 'uncertainties', 'in', 'the', 'parallaxes', 'the', 'tests', 'with', 'the', 'semisynthetic', 'data', 'based', 'on', 'the', 'data', 'set', 'used', 'in', 'gaia', 'collaboration', 'et', 'al', '2017', 'reveal', 'the', 'significant', 'impact', 'that', 'the', 'existing', 'correlations', 'between', 'parallax', 'metallicity', 'and', 'periods', 'have', 'on', 'the', 'inferred', 'parameters', 'the', 'relation', 'coefficients', 'obtained', 'here', 'have', 'been', 'superseded', 'by', 'those', 'presented', 'in', 'muraveva', 'et', 'al', '2018a', 'that', 'incorporates', 'the', 'findings', 'of', 'this', 'work', 'and', 'the', 'more', 'recent', 'gaia', 'dr2', 'measurements']] | [-0.036079787195741765, 0.0664119731155264, -0.11211264021018058, 0.0798307629973771, -0.13179777555553737, -0.05177972686892916, 0.1154779631497227, 0.402389359795767, -0.21372238855856734, -0.3719200173297869, 0.042405271938002996, -0.30744224292963435, -0.09752223942066646, 0.20517927860546634, -0.09262898265439858, 0.07514915898298988, 0.11173954617896746, -0.026552394189688768, -0.03935306327632414, -0.2727336896452284, 0.2881430833457181, 0.06053404677977674, 0.25816971050280857, -0.03279977488086726, 0.0640186105410043, -0.04972685326555441, -0.1387406437096592, 0.019173940886448845, -0.20222543327510456, 0.13564609720085102, 0.22551531106846517, 0.14982658981755534, 0.2352595179536754, -0.37502059714184477, -0.18665693875036052, 0.08866175489046693, 0.10846706979478207, 0.09967236140894387, 0.002688211846276302, -0.2981682493715571, 0.04102424622123313, -0.17313436716874567, -0.12022227315746077, -0.06685801011183833, 0.05704032720472568, 0.04052993662592668, -0.27701267765229964, 0.09859882858551991, 0.042889850813612886, 0.09196710439884447, -0.08337571448745987, -0.15577095601723617, -0.03111816627275931, 0.1372461232633338, 0.026468579033509087, 0.04836133924018369, 0.05408311325013956, -0.08408313676284931, -0.11239825044042216, 0.37060898454445934, -0.067016381900469, -0.149082340602564, 0.16682743408312248, -0.16561567226353174, -0.17553503445795396, 0.01479523890834843, 0.17516420083020964, 0.10146874885151161, -0.20403601976437893, 0.030974692304351997, -0.0010901990798839296, 0.18350916375350365, 0.04021374944350722, 0.03957311449369463, 0.18761087684000596, 0.11425735815388398, 0.005858420356550914, 0.06426640552977045, -0.17666661315677193, -0.07747025325999826, -0.27884595969723713, -0.10854927300073557, -0.13416368230798234, -0.011094751534983516, -0.10825218550766855, -0.10708668551996796, 0.36024267793708664, 0.21959531998647872, 0.21396434330779454, 0.07704861441469935, 0.2874366813000992, 0.07848598896711119, 0.07939464097512233, 0.07553759429695356, 0.29898352401418626, 0.17023150915276006, 0.07470933279285255, -0.19657974342146936, 0.11235408950348297, 0.022631951723184086] |
1,803.01163 | The two-particle correlation function for systems with long-range
interactions | In this paper, we study the truncated two-particle correlation function in
particle systems with long range interactions. For Coulombian and soft
potentials, we define and give well-posedness results for the equilibrium
correlations. In the Coulombian case, we prove the onset of the Debye screening
length in the equilibrium correlations, for suitable velocity distributions.
Additionally, we give precise estimates on the effective range of interaction
between particles. In the case of soft potential interaction the equilibrium
correlations and their fluxes in the space of velocities are shown to be
linearly stable.
| math-ph math.MP | in this paper we study the truncated twoparticle correlation function in particle systems with long range interactions for coulombian and soft potentials we define and give wellposedness results for the equilibrium correlations in the coulombian case we prove the onset of the debye screening length in the equilibrium correlations for suitable velocity distributions additionally we give precise estimates on the effective range of interaction between particles in the case of soft potential interaction the equilibrium correlations and their fluxes in the space of velocities are shown to be linearly stable | [['in', 'this', 'paper', 'we', 'study', 'the', 'truncated', 'twoparticle', 'correlation', 'function', 'in', 'particle', 'systems', 'with', 'long', 'range', 'interactions', 'for', 'coulombian', 'and', 'soft', 'potentials', 'we', 'define', 'and', 'give', 'wellposedness', 'results', 'for', 'the', 'equilibrium', 'correlations', 'in', 'the', 'coulombian', 'case', 'we', 'prove', 'the', 'onset', 'of', 'the', 'debye', 'screening', 'length', 'in', 'the', 'equilibrium', 'correlations', 'for', 'suitable', 'velocity', 'distributions', 'additionally', 'we', 'give', 'precise', 'estimates', 'on', 'the', 'effective', 'range', 'of', 'interaction', 'between', 'particles', 'in', 'the', 'case', 'of', 'soft', 'potential', 'interaction', 'the', 'equilibrium', 'correlations', 'and', 'their', 'fluxes', 'in', 'the', 'space', 'of', 'velocities', 'are', 'shown', 'to', 'be', 'linearly', 'stable']] | [-0.14180590807227417, 0.1842143519367609, -0.1158077566709835, 0.1381824486513829, 0.034363839583885336, -0.08598834930194749, -0.0193987984662979, 0.3881264448579815, -0.2626015920036783, -0.2796493154226078, 0.022868796828616825, -0.30680271464710435, -0.0906670100055635, 0.12478107212551146, 0.045761029981076715, 0.0470496893239518, 0.032824054220691325, 0.02077975214148561, -0.08272883959321511, -0.1979050438747638, 0.3482166748235209, 0.03678874514169163, 0.22579304634645167, 0.13552961158048776, 0.055581034776858156, 0.09534766013837523, 0.017607625811878178, 0.034769955530646254, -0.18385471945835485, 0.07157190384136305, 0.19142548985514118, 0.0008677352970052096, 0.22295025969441568, -0.4038826789706945, -0.19916069840805398, 0.13377610575407745, 0.1456758372226937, 0.11178585380936662, -0.03751708166706117, -0.24115201375033293, 0.013334527761778897, -0.1781577609324207, -0.178828694153991, -0.09663869713743528, 0.09310203616817793, 0.10315892926882952, -0.2988763952213857, 0.15097103157927955, 0.031765003398888644, 0.05913630203447408, -0.14064406384713948, -0.07870392250931925, 0.02470942861917946, 0.12441881223478252, 0.06520034958504968, -0.02211058579850942, 0.10655219511439402, -0.1616102794987253, -0.042535798411376564, 0.3711163206025958, -0.09191003120116269, -0.21427295556188458, 0.22775285340224702, -0.17179329293366108, -0.09601114920547439, 0.10885403302187721, 0.17527104429900647, 0.1372460424175693, -0.14769847721068396, 0.07754991020192392, 0.004750959016382695, 0.1261321879716383, 0.0378789284111311, 0.07041305834944878, 0.17479029018431902, 0.12666769770698416, 0.0925626520688335, 0.16275980814178992, -0.08623588753398508, -0.1266130793736213, -0.3277237545698881, -0.12335457842176159, -0.15266175841809146, 0.010578612817658319, -0.10252374180854532, -0.16808670728253977, 0.38596059380927017, 0.18298210085938788, 0.2037766632830931, 0.09872805640981015, 0.22066954230217056, 0.12750957413421324, 0.02945284106406487, 0.04813402988430526, 0.3201482098083943, 0.14090089306312922, 0.10808539964362152, -0.23388245476202832, 0.03358718943264749, 0.07332544562717279] |
1,803.01164 | The History Began from AlexNet: A Comprehensive Survey on Deep Learning
Approaches | Deep learning has demonstrated tremendous success in variety of application
domains in the past few years. This new field of machine learning has been
growing rapidly and applied in most of the application domains with some new
modalities of applications, which helps to open new opportunity. There are
different methods have been proposed on different category of learning
approaches, which includes supervised, semi-supervised and un-supervised
learning. The experimental results show state-of-the-art performance of deep
learning over traditional machine learning approaches in the field of Image
Processing, Computer Vision, Speech Recognition, Machine Translation, Art,
Medical imaging, Medical information processing, Robotics and control,
Bio-informatics, Natural Language Processing (NLP), Cyber security, and many
more. This report presents a brief survey on development of DL approaches,
including Deep Neural Network (DNN), Convolutional Neural Network (CNN),
Recurrent Neural Network (RNN) including Long Short Term Memory (LSTM) and
Gated Recurrent Units (GRU), Auto-Encoder (AE), Deep Belief Network (DBN),
Generative Adversarial Network (GAN), and Deep Reinforcement Learning (DRL). In
addition, we have included recent development of proposed advanced variant DL
techniques based on the mentioned DL approaches. Furthermore, DL approaches
have explored and evaluated in different application domains are also included
in this survey. We have also comprised recently developed frameworks, SDKs, and
benchmark datasets that are used for implementing and evaluating deep learning
approaches. There are some surveys have published on Deep Learning in Neural
Networks [1, 38] and a survey on RL [234]. However, those papers have not
discussed the individual advanced techniques for training large scale deep
learning models and the recently developed method of generative models [1].
| cs.CV | deep learning has demonstrated tremendous success in variety of application domains in the past few years this new field of machine learning has been growing rapidly and applied in most of the application domains with some new modalities of applications which helps to open new opportunity there are different methods have been proposed on different category of learning approaches which includes supervised semisupervised and unsupervised learning the experimental results show stateoftheart performance of deep learning over traditional machine learning approaches in the field of image processing computer vision speech recognition machine translation art medical imaging medical information processing robotics and control bioinformatics natural language processing nlp cyber security and many more this report presents a brief survey on development of dl approaches including deep neural network dnn convolutional neural network cnn recurrent neural network rnn including long short term memory lstm and gated recurrent units gru autoencoder ae deep belief network dbn generative adversarial network gan and deep reinforcement learning drl in addition we have included recent development of proposed advanced variant dl techniques based on the mentioned dl approaches furthermore dl approaches have explored and evaluated in different application domains are also included in this survey we have also comprised recently developed frameworks sdks and benchmark datasets that are used for implementing and evaluating deep learning approaches there are some surveys have published on deep learning in neural networks 1 38 and a survey on rl 234 however those papers have not discussed the individual advanced techniques for training large scale deep learning models and the recently developed method of generative models 1 | [['deep', 'learning', 'has', 'demonstrated', 'tremendous', 'success', 'in', 'variety', 'of', 'application', 'domains', 'in', 'the', 'past', 'few', 'years', 'this', 'new', 'field', 'of', 'machine', 'learning', 'has', 'been', 'growing', 'rapidly', 'and', 'applied', 'in', 'most', 'of', 'the', 'application', 'domains', 'with', 'some', 'new', 'modalities', 'of', 'applications', 'which', 'helps', 'to', 'open', 'new', 'opportunity', 'there', 'are', 'different', 'methods', 'have', 'been', 'proposed', 'on', 'different', 'category', 'of', 'learning', 'approaches', 'which', 'includes', 'supervised', 'semisupervised', 'and', 'unsupervised', 'learning', 'the', 'experimental', 'results', 'show', 'stateoftheart', 'performance', 'of', 'deep', 'learning', 'over', 'traditional', 'machine', 'learning', 'approaches', 'in', 'the', 'field', 'of', 'image', 'processing', 'computer', 'vision', 'speech', 'recognition', 'machine', 'translation', 'art', 'medical', 'imaging', 'medical', 'information', 'processing', 'robotics', 'and', 'control', 'bioinformatics', 'natural', 'language', 'processing', 'nlp', 'cyber', 'security', 'and', 'many', 'more', 'this', 'report', 'presents', 'a', 'brief', 'survey', 'on', 'development', 'of', 'dl', 'approaches', 'including', 'deep', 'neural', 'network', 'dnn', 'convolutional', 'neural', 'network', 'cnn', 'recurrent', 'neural', 'network', 'rnn', 'including', 'long', 'short', 'term', 'memory', 'lstm', 'and', 'gated', 'recurrent', 'units', 'gru', 'autoencoder', 'ae', 'deep', 'belief', 'network', 'dbn', 'generative', 'adversarial', 'network', 'gan', 'and', 'deep', 'reinforcement', 'learning', 'drl', 'in', 'addition', 'we', 'have', 'included', 'recent', 'development', 'of', 'proposed', 'advanced', 'variant', 'dl', 'techniques', 'based', 'on', 'the', 'mentioned', 'dl', 'approaches', 'furthermore', 'dl', 'approaches', 'have', 'explored', 'and', 'evaluated', 'in', 'different', 'application', 'domains', 'are', 'also', 'included', 'in', 'this', 'survey', 'we', 'have', 'also', 'comprised', 'recently', 'developed', 'frameworks', 'sdks', 'and', 'benchmark', 'datasets', 'that', 'are', 'used', 'for', 'implementing', 'and', 'evaluating', 'deep', 'learning', 'approaches', 'there', 'are', 'some', 'surveys', 'have', 'published', 'on', 'deep', 'learning', 'in', 'neural', 'networks', '1', '38', 'and', 'a', 'survey', 'on', 'rl', '234', 'however', 'those', 'papers', 'have', 'not', 'discussed', 'the', 'individual', 'advanced', 'techniques', 'for', 'training', 'large', 'scale', 'deep', 'learning', 'models', 'and', 'the', 'recently', 'developed', 'method', 'of', 'generative', 'models', '1']] | [-0.014749602251950737, -0.043545494826200105, -0.03237275698373913, 0.06481151169767448, -0.13473624394938463, -0.23054175157625595, -0.040495793067031736, 0.5043991789419978, -0.2749396481495668, -0.31968038785557973, 0.06918732272672722, -0.25829844822168746, -0.24848619411226758, 0.23672891097587787, -0.1521050853577132, 0.15904862526142757, 0.15805398505251628, 0.03992530971917211, -0.04805433002051855, -0.3456540715212186, 0.28879018371773063, -0.018054333278224945, 0.4054580840148088, 0.00638173752866516, 0.1327739258360287, -0.04922577963037783, -0.043028239913947997, -0.03720160102018395, -0.08407854824473003, 0.2182309777161925, 0.3955336142463707, 0.27454865651706123, 0.41982428727814375, -0.46115141706347157, -0.30766786111141275, 0.07204246114203917, 0.17986889266775866, 0.09185448580975583, -0.06996180736760751, -0.3492126378343638, 0.07974945234177126, -0.22783832631610107, 0.10856089736052761, -0.1886305487348705, 0.012495993185880114, 0.016016813529087372, -0.2050357116152582, -0.036073036048037466, 0.10095439296988347, 0.15026088821821648, -0.06349924604221473, -0.19085162854444757, 0.11082971975680045, 0.1325674886571836, 0.04843111479766032, 0.1266650760058617, 0.1473377747390645, -0.2508085527277382, -0.2033449044966167, 0.2582815484149085, -0.06735174753703177, -0.1342180688706955, 0.24233407416393288, 0.047840316190779435, -0.23613682967455438, 0.044856579254635355, 0.29118315746062295, 0.10534819651917188, -0.18528783508350677, 0.07133633552659761, -0.0014887496610313203, 0.1339372096518866, 0.044493599677507795, 0.002780526077417149, 0.16493063403851754, 0.35417043797276687, -0.04177812405418301, 0.0943725194603868, -0.17347267495069624, -0.11225049746589678, -0.1381825124650883, -0.06247179968473078, -0.1706752677220555, -0.014736941638947235, -0.07348305270875932, -0.1352370914466905, 0.3886387537755637, 0.23555170934670253, 0.15043510908391466, 0.09651572019951841, 0.347666473134957, -0.001169187998377972, 0.2110210738469367, 0.10701063748230367, 0.22414204763812118, 0.055288838063874704, 0.22375160853588374, -0.09502591694939783, 0.0626178881171985, 0.010876500744140658] |
1,803.01165 | Tag-Enhanced Tree-Structured Neural Networks for Implicit Discourse
Relation Classification | Identifying implicit discourse relations between text spans is a challenging
task because it requires understanding the meaning of the text. To tackle this
task, recent studies have tried several deep learning methods but few of them
exploited the syntactic information. In this work, we explore the idea of
incorporating syntactic parse tree into neural networks. Specifically, we
employ the Tree-LSTM model and Tree-GRU model, which are based on the tree
structure, to encode the arguments in a relation. Moreover, we further leverage
the constituent tags to control the semantic composition process in these
tree-structured neural networks. Experimental results show that our method
achieves state-of-the-art performance on PDTB corpus.
| cs.CL | identifying implicit discourse relations between text spans is a challenging task because it requires understanding the meaning of the text to tackle this task recent studies have tried several deep learning methods but few of them exploited the syntactic information in this work we explore the idea of incorporating syntactic parse tree into neural networks specifically we employ the treelstm model and treegru model which are based on the tree structure to encode the arguments in a relation moreover we further leverage the constituent tags to control the semantic composition process in these treestructured neural networks experimental results show that our method achieves stateoftheart performance on pdtb corpus | [['identifying', 'implicit', 'discourse', 'relations', 'between', 'text', 'spans', 'is', 'a', 'challenging', 'task', 'because', 'it', 'requires', 'understanding', 'the', 'meaning', 'of', 'the', 'text', 'to', 'tackle', 'this', 'task', 'recent', 'studies', 'have', 'tried', 'several', 'deep', 'learning', 'methods', 'but', 'few', 'of', 'them', 'exploited', 'the', 'syntactic', 'information', 'in', 'this', 'work', 'we', 'explore', 'the', 'idea', 'of', 'incorporating', 'syntactic', 'parse', 'tree', 'into', 'neural', 'networks', 'specifically', 'we', 'employ', 'the', 'treelstm', 'model', 'and', 'treegru', 'model', 'which', 'are', 'based', 'on', 'the', 'tree', 'structure', 'to', 'encode', 'the', 'arguments', 'in', 'a', 'relation', 'moreover', 'we', 'further', 'leverage', 'the', 'constituent', 'tags', 'to', 'control', 'the', 'semantic', 'composition', 'process', 'in', 'these', 'treestructured', 'neural', 'networks', 'experimental', 'results', 'show', 'that', 'our', 'method', 'achieves', 'stateoftheart', 'performance', 'on', 'pdtb', 'corpus']] | [-0.052077243559358416, -0.01071959489817235, -0.07816950752286711, 0.11809730925551351, -0.1845277152589966, -0.11124470839538028, 0.08812532043867857, 0.4790145643751755, -0.30458489214026624, -0.34570786997536634, 0.00476215612339117, -0.27143706480545976, -0.22157485210380265, 0.16730977873814024, -0.09240127058055635, 0.07673242317390776, 0.12688773548204416, 0.06907734156272888, -0.05396889483830326, -0.27699275868161466, 0.34553825434636776, 0.021180221173100644, 0.36278415304199557, 0.058194104978101, 0.1338217393016425, -0.06206463653350545, -0.09274230055754708, -0.033029329370071886, -0.0961495249896777, 0.22414709349972345, 0.33007027537814365, 0.23427428352150403, 0.30709825287503406, -0.43567898091381396, -0.23725890142138106, 0.061674982418140796, 0.1330993324811962, 0.1389064513371004, 0.008898434061644095, -0.3201426177538026, 0.10899891708890481, -0.18654383049633738, 0.0819075494813167, -0.15665426717148484, -0.02746506720328721, -0.038648837515823195, -0.1997120911413238, 0.011603697020316793, 0.1704100309740578, 0.05414776296885771, -0.01968747441424057, -0.12170576237176901, 0.03833884438369249, 0.18134419314528458, 0.023815541305942635, 0.053939501466621236, 0.09944206366541787, -0.1833146242729484, -0.15320798112014222, 0.3528514988024101, -0.027602547821023057, -0.23641800003944435, 0.20736743038232985, -0.021703849259380983, -0.22300739624215482, 0.03154117034891812, 0.22986639906090867, 0.10313818753026774, -0.18829009669373753, 0.0349940261014772, -0.08667976217709969, 0.22804896976955444, 0.07184907312235125, 0.011020677717985742, 0.1811779814567765, 0.3122548061449116, -0.037221797939964406, 0.12033738320580223, -0.08489165255156886, -0.07791524645045539, -0.17803386789441944, -0.08872680241355202, -0.15126885079439276, -0.03953050599633672, -0.09987620699258029, -0.14086894696212818, 0.3805891213781923, 0.296329359184498, 0.2165225695244202, 0.14390293739531537, 0.3202471104450524, 0.01088824996694261, 0.1223324236816892, 0.08254008011339738, 0.15086264128439894, 0.05568387593516958, 0.14003700477987197, -0.15188031044362166, 0.13078745846989104, 0.10423319366821479] |
1,803.01166 | AdaM: Adapting Multi-User Interfaces for Collaborative Environments in
Real-Time | Developing cross-device multi-user interfaces (UIs) is a challenging problem.
There are numerous ways in which content and interactivity can be distributed.
However, good solutions must consider multiple users, their roles, their
preferences and access rights, as well as device capabilities. Manual and
rule-based solutions are tedious to create and do not scale to larger problems
nor do they adapt to dynamic changes, such as users leaving or joining an
activity. In this paper, we cast the problem of UI distribution as an
assignment problem and propose to solve it using combinatorial optimization. We
present a mixed integer programming formulation which allows real-time
applications in dynamically changing collaborative settings. It optimizes the
allocation of UI elements based on device capabilities, user roles,
preferences, and access rights. We present a proof-of-concept
designer-in-the-loop tool, allowing for quick solution exploration. Finally, we
compare our approach to traditional paper prototyping in a lab study.
| cs.HC | developing crossdevice multiuser interfaces uis is a challenging problem there are numerous ways in which content and interactivity can be distributed however good solutions must consider multiple users their roles their preferences and access rights as well as device capabilities manual and rulebased solutions are tedious to create and do not scale to larger problems nor do they adapt to dynamic changes such as users leaving or joining an activity in this paper we cast the problem of ui distribution as an assignment problem and propose to solve it using combinatorial optimization we present a mixed integer programming formulation which allows realtime applications in dynamically changing collaborative settings it optimizes the allocation of ui elements based on device capabilities user roles preferences and access rights we present a proofofconcept designerintheloop tool allowing for quick solution exploration finally we compare our approach to traditional paper prototyping in a lab study | [['developing', 'crossdevice', 'multiuser', 'interfaces', 'uis', 'is', 'a', 'challenging', 'problem', 'there', 'are', 'numerous', 'ways', 'in', 'which', 'content', 'and', 'interactivity', 'can', 'be', 'distributed', 'however', 'good', 'solutions', 'must', 'consider', 'multiple', 'users', 'their', 'roles', 'their', 'preferences', 'and', 'access', 'rights', 'as', 'well', 'as', 'device', 'capabilities', 'manual', 'and', 'rulebased', 'solutions', 'are', 'tedious', 'to', 'create', 'and', 'do', 'not', 'scale', 'to', 'larger', 'problems', 'nor', 'do', 'they', 'adapt', 'to', 'dynamic', 'changes', 'such', 'as', 'users', 'leaving', 'or', 'joining', 'an', 'activity', 'in', 'this', 'paper', 'we', 'cast', 'the', 'problem', 'of', 'ui', 'distribution', 'as', 'an', 'assignment', 'problem', 'and', 'propose', 'to', 'solve', 'it', 'using', 'combinatorial', 'optimization', 'we', 'present', 'a', 'mixed', 'integer', 'programming', 'formulation', 'which', 'allows', 'realtime', 'applications', 'in', 'dynamically', 'changing', 'collaborative', 'settings', 'it', 'optimizes', 'the', 'allocation', 'of', 'ui', 'elements', 'based', 'on', 'device', 'capabilities', 'user', 'roles', 'preferences', 'and', 'access', 'rights', 'we', 'present', 'a', 'proofofconcept', 'designerintheloop', 'tool', 'allowing', 'for', 'quick', 'solution', 'exploration', 'finally', 'we', 'compare', 'our', 'approach', 'to', 'traditional', 'paper', 'prototyping', 'in', 'a', 'lab', 'study']] | [-0.12523803242003997, 0.0014012673748987476, -0.06984074982795613, 0.05791022063302178, -0.20540142672709064, -0.2151478731806541, 0.08997048614420802, 0.44305289305142453, -0.3049055882414954, -0.3676830961658443, 0.11588037324553305, -0.24846173599340743, -0.18216673734855862, 0.15762449175157156, -0.13993188731114356, 0.07630306618237817, 0.04658526032407944, -0.029035662445617286, -0.015618290634134807, -0.215868520261358, 0.28125039547936664, 0.04007369197898771, 0.2942177791312035, 0.06523243203126775, 0.05917087776705975, 0.0552153577619056, -0.03727593004382593, 0.025514754415584123, -0.06577784168640957, 0.10795448644042867, 0.37552015917262416, 0.2468807123620315, 0.35243847876129597, -0.4640288660680321, -0.15877078687677765, 0.08175633062067367, 0.1970595043102229, 0.0783655039220419, -0.08230990895724578, -0.26218546052287156, 0.09863776910414516, -0.20971149773450215, -0.06486066810100817, -0.11579621242708527, -0.015795764909755136, -0.005213948567649601, -0.3106575165655011, -0.030939834929036757, 0.0020663730235380194, 0.06664786673826638, -0.06896133193269535, -0.08784805370551357, 0.06551241093138988, 0.210343304126385, 0.027875192181798757, -0.016370611367558408, 0.15976177704067449, -0.11805573872422699, -0.16990766682382044, 0.4366910005290363, 0.03370388547340848, -0.2519477750678119, 0.22307417555114356, -0.00042690054003803715, -0.1412328728663458, 0.05055545322751198, 0.23951263993198202, 0.1566611280589289, -0.1884360595864269, 0.043255179564349, -0.012488066232952013, 0.19319958859626707, 0.04013887948885157, 0.051102238839391516, 0.21091408261909728, 0.17325808742001803, 0.11184276132907316, 0.12266681290379525, 0.01140575875635133, -0.077993247035035, -0.21309233665493052, -0.15026836029436388, -0.11708334658445942, -0.005576804366707645, -0.025417845189056952, -0.16104179301859206, 0.36589786772792404, 0.19897112650230425, 0.14337325396607756, 0.08017514993696602, 0.344564020105109, 0.07175828250379905, 0.07142080223019474, 0.09177166280160481, 0.12019347352907062, -0.003046732007311909, 0.21120718839213354, -0.17891603214760637, 0.1139757782173645, -0.014288007055182714] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.