id float64 706 1.8k | title stringlengths 1 343 | abstract stringlengths 6 6.09k | categories stringlengths 5 125 | processed_abstract stringlengths 2 5.96k | tokenized_abstract stringlengths 8 8.74k | centroid stringlengths 2.1k 2.17k |
|---|---|---|---|---|---|---|
1,802.0646 | Embedding distance graphs in finite field vector spaces | We show that large subsets of vector spaces over finite fields determine
certain point configurations with prescribed distance structure. More
specifically, we consider the complete graph with vertices as the points of $A
\subseteq \mathbf{F}_q^d$ and edges assigned the algebraic distance between
pairs of vertices. W... | math.CO math.CA math.NT | we show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure more specifically we consider the complete graph with vertices as the points of a subseteq mathbff_qd and edges assigned the algebraic distance between pairs of vertices we prove nont... | [['we', 'show', 'that', 'large', 'subsets', 'of', 'vector', 'spaces', 'over', 'finite', 'fields', 'determine', 'certain', 'point', 'configurations', 'with', 'prescribed', 'distance', 'structure', 'more', 'specifically', 'we', 'consider', 'the', 'complete', 'graph', 'with', 'vertices', 'as', 'the', 'points', 'of', 'a', ... | [-0.2157941811656201, 0.14617879346042173, 0.020431963388546137, 0.011503745692607481, -0.0705333607911598, -0.1469767046146444, 0.0847850144491531, 0.3887315859319642, -0.2835949230593542, -0.25904212692694273, -0.0017091198988055112, -0.35067662596702576, -0.10042093296942767, 0.07748619736230467, -0.0468649315880611... |
1,802.06461 | Octupole deformation in neutron-rich actinides and superheavy nuclei and
the role of nodal structure of single-particle wavefunctions in extremely
deformed structures of light nuclei | Octupole deformed shapes in neutron-rich actinides and superheavy nuclei as
well as extremely deformed shapes of the N~Z light nuclei have been
investigated within the framework of covariant density functional theory. We
confirmed the presence of new region of octupole deformation in neutron-rich
actinides with the c... | nucl-th | octupole deformed shapes in neutronrich actinides and superheavy nuclei as well as extremely deformed shapes of the nz light nuclei have been investigated within the framework of covariant density functional theory we confirmed the presence of new region of octupole deformation in neutronrich actinides with the center ... | [['octupole', 'deformed', 'shapes', 'in', 'neutronrich', 'actinides', 'and', 'superheavy', 'nuclei', 'as', 'well', 'as', 'extremely', 'deformed', 'shapes', 'of', 'the', 'nz', 'light', 'nuclei', 'have', 'been', 'investigated', 'within', 'the', 'framework', 'of', 'covariant', 'density', 'functional', 'theory', 'we', 'con... | [-0.05571123784869721, 0.18579052286144315, -0.07470238452949443, 0.14393254811679865, 0.03630179160532831, -0.04912269309538753, 0.024845469319418136, 0.3472153742400491, -0.1732370498347558, -0.29782822910312784, -0.06958996353596605, -0.2673994924017363, -0.05778543959457834, 0.09171595848498068, 0.02554215749450802... |
1,802.06462 | Heuristic Based Induction of Answer Set Programs: From Default theories
to combinatorial problems | Significant research has been conducted in recent years to extend Inductive
Logic Programming (ILP) methods to induce Answer Set Programs (ASP). These
methods perform an exhaustive search for the correct hypothesis by encoding an
ILP problem instance as an ASP program. Exhaustive search, however, results in
loss of s... | cs.LO | significant research has been conducted in recent years to extend inductive logic programming ilp methods to induce answer set programs asp these methods perform an exhaustive search for the correct hypothesis by encoding an ilp problem instance as an asp program exhaustive search however results in loss of scalability... | [['significant', 'research', 'has', 'been', 'conducted', 'in', 'recent', 'years', 'to', 'extend', 'inductive', 'logic', 'programming', 'ilp', 'methods', 'to', 'induce', 'answer', 'set', 'programs', 'asp', 'these', 'methods', 'perform', 'an', 'exhaustive', 'search', 'for', 'the', 'correct', 'hypothesis', 'by', 'encoding... | [-0.08198187161137217, -0.046624752710028715, -0.07190986265860765, 0.10661877286370977, -0.17713375397392417, -0.1816685127992449, 0.08666076719444911, 0.40973113857741866, -0.2883618628972077, -0.39334946469004667, 0.08442092014925688, -0.2216867353667372, -0.15041412571112492, 0.2210120982357434, -0.0935578610972567... |
1,802.06463 | Guaranteed Recovery of One-Hidden-Layer Neural Networks via Cross
Entropy | We study model recovery for data classification, where the training labels
are generated from a one-hidden-layer neural network with sigmoid activations,
also known as a single-layer feedforward network, and the goal is to recover
the weights of the neural network. We consider two network models, the
fully-connected ... | stat.ML cs.LG | we study model recovery for data classification where the training labels are generated from a onehiddenlayer neural network with sigmoid activations also known as a singlelayer feedforward network and the goal is to recover the weights of the neural network we consider two network models the fullyconnected network fcn... | [['we', 'study', 'model', 'recovery', 'for', 'data', 'classification', 'where', 'the', 'training', 'labels', 'are', 'generated', 'from', 'a', 'onehiddenlayer', 'neural', 'network', 'with', 'sigmoid', 'activations', 'also', 'known', 'as', 'a', 'singlelayer', 'feedforward', 'network', 'and', 'the', 'goal', 'is', 'to', 'r... | [-0.06099142334502003, 0.013498265905694012, -0.046992171878338526, 0.07445268324113258, -0.04433552611244624, -0.1803442519340227, 0.07138485438060328, 0.4451378295250112, -0.3409347130329083, -0.2630028406684235, 0.08513456020717555, -0.2587878790491536, -0.2045992211979819, 0.12784341634927557, -0.11347834624391695,... |
1,802.06464 | Robust Fitting in Computer Vision: Easy or Hard? | Robust model fitting plays a vital role in computer vision, and research into
algorithms for robust fitting continues to be active. Arguably the most popular
paradigm for robust fitting in computer vision is consensus maximisation, which
strives to find the model parameters that maximise the number of inliers.
Despit... | cs.CV cs.CC | robust model fitting plays a vital role in computer vision and research into algorithms for robust fitting continues to be active arguably the most popular paradigm for robust fitting in computer vision is consensus maximisation which strives to find the model parameters that maximise the number of inliers despite the ... | [['robust', 'model', 'fitting', 'plays', 'a', 'vital', 'role', 'in', 'computer', 'vision', 'and', 'research', 'into', 'algorithms', 'for', 'robust', 'fitting', 'continues', 'to', 'be', 'active', 'arguably', 'the', 'most', 'popular', 'paradigm', 'for', 'robust', 'fitting', 'in', 'computer', 'vision', 'is', 'consensus', ... | [-0.05893689442544858, -0.023952319892783853, -0.09499492975453852, 0.08913809311632331, -0.12359054637610489, -0.17023188735074396, 0.02561088453760331, 0.4248734563060686, -0.2670536573608043, -0.37401421455309747, 0.13181453806361354, -0.2194742128510583, -0.17907361970250066, 0.22388271415104152, -0.156068239143078... |
1,802.06465 | The class of a fibre in Noncommutative Geometry | This paper studies the K-homology of a crossed product of a discrete group
acting smoothly on a manifold, with a better understanding of the
noncommutative geometry of the crossed-product as the primary goal, and the
Baum-Connes apparatus as the main tool. Examples suggest that the correct
notion of the `Dirac class'... | math.KT | this paper studies the khomology of a crossed product of a discrete group acting smoothly on a manifold with a better understanding of the noncommutative geometry of the crossedproduct as the primary goal and the baumconnes apparatus as the main tool examples suggest that the correct notion of the dirac class of such a... | [['this', 'paper', 'studies', 'the', 'khomology', 'of', 'a', 'crossed', 'product', 'of', 'a', 'discrete', 'group', 'acting', 'smoothly', 'on', 'a', 'manifold', 'with', 'a', 'better', 'understanding', 'of', 'the', 'noncommutative', 'geometry', 'of', 'the', 'crossedproduct', 'as', 'the', 'primary', 'goal', 'and', 'the', ... | [-0.1475061169239106, 0.08314151193854617, -0.10451266483725681, 0.06827433122376578, -0.08137687495737164, -0.07918345434936108, -0.0007629751358583662, 0.34247395274355824, -0.30766423432915296, -0.2645674530836397, 0.11572998195073142, -0.2180408245893224, -0.18496681302987086, 0.20982292700949826, -0.13244533041088... |
1,802.06466 | Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from
Billion-Scale Semantic Vectors | Rapid advances in GPU hardware and multiple areas of Deep Learning open up a
new opportunity for billion-scale information retrieval with exhaustive search.
Building on top of the powerful concept of semantic learning, this paper
proposes a Recurrent Binary Embedding (RBE) model that learns compact
representations fo... | cs.IR cs.DC cs.LG | rapid advances in gpu hardware and multiple areas of deep learning open up a new opportunity for billionscale information retrieval with exhaustive search building on top of the powerful concept of semantic learning this paper proposes a recurrent binary embedding rbe model that learns compact representations for realt... | [['rapid', 'advances', 'in', 'gpu', 'hardware', 'and', 'multiple', 'areas', 'of', 'deep', 'learning', 'open', 'up', 'a', 'new', 'opportunity', 'for', 'billionscale', 'information', 'retrieval', 'with', 'exhaustive', 'search', 'building', 'on', 'top', 'of', 'the', 'powerful', 'concept', 'of', 'semantic', 'learning', 'th... | [-0.044274577675515424, 0.017715510065358136, -0.0459834241207877, 0.020148700753060262, -0.08335932176944655, -0.1807393398087305, 0.08752359122351888, 0.4159642792640066, -0.2680810955694851, -0.34117503831117124, 0.07969694300164862, -0.2798991788845133, -0.14866638855705328, 0.22140906152311166, -0.0748153288522681... |
1,802.06467 | Memorize or generalize? Searching for a compositional RNN in a haystack | Neural networks are very powerful learning systems, but they do not readily
generalize from one task to the other. This is partly due to the fact that they
do not learn in a compositional way, that is, by discovering skills that are
shared by different tasks, and recombining them to solve new problems. In this
paper,... | cs.AI cs.LG cs.NE | neural networks are very powerful learning systems but they do not readily generalize from one task to the other this is partly due to the fact that they do not learn in a compositional way that is by discovering skills that are shared by different tasks and recombining them to solve new problems in this paper we explo... | [['neural', 'networks', 'are', 'very', 'powerful', 'learning', 'systems', 'but', 'they', 'do', 'not', 'readily', 'generalize', 'from', 'one', 'task', 'to', 'the', 'other', 'this', 'is', 'partly', 'due', 'to', 'the', 'fact', 'that', 'they', 'do', 'not', 'learn', 'in', 'a', 'compositional', 'way', 'that', 'is', 'by', 'di... | [-0.05870098105275322, 0.07853339275359608, -0.0848718883911359, 0.11600747870967829, -0.16323622246992955, -0.2078479331289178, 0.06971205115023059, 0.45529207796549676, -0.3450525620491388, -0.325571191435789, 0.06509312636221365, -0.21320313722802536, -0.2022609599570734, 0.15171466450406162, -0.12707007997252412, 0... |
1,802.06468 | Dose evaluation of fast synthetic-CT generation using a generative
adversarial network for general pelvis MR-only radiotherapy | To enable magnetic resonance (MR)-only radiotherapy and facilitate modelling
of radiation attenuation in humans, synthetic-CT (sCT) images need to be
generated. Considering the application of MR-guided radiotherapy and online
adaptive replanning, sCT generation should occur within minutes. This work aims
at assessing... | physics.med-ph | to enable magnetic resonance mronly radiotherapy and facilitate modelling of radiation attenuation in humans syntheticct sct images need to be generated considering the application of mrguided radiotherapy and online adaptive replanning sct generation should occur within minutes this work aims at assessing whether an e... | [['to', 'enable', 'magnetic', 'resonance', 'mronly', 'radiotherapy', 'and', 'facilitate', 'modelling', 'of', 'radiation', 'attenuation', 'in', 'humans', 'syntheticct', 'sct', 'images', 'need', 'to', 'be', 'generated', 'considering', 'the', 'application', 'of', 'mrguided', 'radiotherapy', 'and', 'online', 'adaptive', 'r... | [0.045090082700231245, 0.060352171705744695, -0.021328309040871404, 0.0962077597773353, -0.06956784495259709, -0.16159443512174582, 0.04410734501924173, 0.4649347932953831, -0.12601887772695, -0.3264749325582728, 0.06936871926281749, -0.32343743182718754, -0.0784812557773428, 0.24769760276346156, -0.17242974881729525, ... |
1,802.06469 | Active fluids at circular boundaries: Swim pressure and anomalous
droplet ripening | We investigate the swim pressure exerted by non-chiral and chiral active
particles on convex or concave circular boundaries. Active particles are
modeled as non-interacting and non-aligning self-propelled Brownian particles.
The convex and concave circular boundaries are used as models representing a
fixed inclusion ... | cond-mat.soft cond-mat.stat-mech physics.bio-ph physics.chem-ph | we investigate the swim pressure exerted by nonchiral and chiral active particles on convex or concave circular boundaries active particles are modeled as noninteracting and nonaligning selfpropelled brownian particles the convex and concave circular boundaries are used as models representing a fixed inclusion immersed... | [['we', 'investigate', 'the', 'swim', 'pressure', 'exerted', 'by', 'nonchiral', 'and', 'chiral', 'active', 'particles', 'on', 'convex', 'or', 'concave', 'circular', 'boundaries', 'active', 'particles', 'are', 'modeled', 'as', 'noninteracting', 'and', 'nonaligning', 'selfpropelled', 'brownian', 'particles', 'the', 'conv... | [-0.11788180837784272, 0.2737168603475224, -0.08983908484383933, -0.01126744437438271, -0.02081005805380481, -0.15180984109687193, 0.02525586978610807, 0.3448343217271609, -0.2282751560638178, -0.2910343355731198, 0.060328610157358735, -0.3127946246697799, -0.1096069929938064, 0.13077264577268022, -0.051492619941797824... |
1,802.0647 | A model for a network of conveyor belts with discontinuous speed and
capacity | We introduce a macroscopic model for a network of conveyor belts with various
speeds and capacities. In a different way from traffic flow models, the product
densities are forced to move with a constant velocity unless they reach a
maximal capacity and start to queue. This kind of dynamics is governed by
scalar conse... | math.AP | we introduce a macroscopic model for a network of conveyor belts with various speeds and capacities in a different way from traffic flow models the product densities are forced to move with a constant velocity unless they reach a maximal capacity and start to queue this kind of dynamics is governed by scalar conservati... | [['we', 'introduce', 'a', 'macroscopic', 'model', 'for', 'a', 'network', 'of', 'conveyor', 'belts', 'with', 'various', 'speeds', 'and', 'capacities', 'in', 'a', 'different', 'way', 'from', 'traffic', 'flow', 'models', 'the', 'product', 'densities', 'are', 'forced', 'to', 'move', 'with', 'a', 'constant', 'velocity', 'un... | [-0.17242943046827955, 0.12490231345388263, -0.08340104694798356, 0.03392094474596282, -0.0547364203351511, -0.1609598820844743, 0.05185353573566923, 0.3447627716814168, -0.262879128184674, -0.2928848340525292, 0.10420280870918457, -0.26651321704654646, -0.1060143974100356, 0.174780011747013, -0.05210366190294735, 0.07... |
1,802.06471 | Solitons and rogue waves in spinor Bose-Einstein condensates | We present a general classification of one-soliton solutions as well as novel
families of rogue-wave solutions for $F=1$ spinor Bose-Einstein condensates
(BECs). These solutions are obtained from the inverse scattering transform for
a focusing matrix nonlinear Schr\"odinger equation which models condensates in
the ca... | nlin.SI | we present a general classification of onesoliton solutions as well as novel families of roguewave solutions for f1 spinor boseeinstein condensates becs these solutions are obtained from the inverse scattering transform for a focusing matrix nonlinear schrodinger equation which models condensates in the case of attract... | [['we', 'present', 'a', 'general', 'classification', 'of', 'onesoliton', 'solutions', 'as', 'well', 'as', 'novel', 'families', 'of', 'roguewave', 'solutions', 'for', 'f1', 'spinor', 'boseeinstein', 'condensates', 'becs', 'these', 'solutions', 'are', 'obtained', 'from', 'the', 'inverse', 'scattering', 'transform', 'for'... | [-0.17187166330782552, 0.1102252873991217, -0.051339924048977095, 0.08337085894550886, -0.08485581426179738, -0.17112613025472148, -0.042341615223059695, 0.3632092703823242, -0.21627598483865332, -0.2075217499975236, 0.11550146445492887, -0.32853120809735414, -0.1794459352832191, 0.19547194786454467, 0.0412711571567909... |
1,802.06472 | Online convex optimization for cumulative constraints | We propose the algorithms for online convex optimization which lead to
cumulative squared constraint violations of the form
$\sum\limits_{t=1}^T\big([g(x_t)]_+\big)^2=O(T^{1-\beta})$, where
$\beta\in(0,1)$. Previous literature has focused on long-term constraints of
the form $\sum\limits_{t=1}^Tg(x_t)$. There, strict... | cs.LG | we propose the algorithms for online convex optimization which lead to cumulative squared constraint violations of the form sumlimits_t1tbiggx_t_big2ot1beta where betain01 previous literature has focused on longterm constraints of the form sumlimits_t1tgx_t there strictly feasible solutions can cancel out the effects o... | [['we', 'propose', 'the', 'algorithms', 'for', 'online', 'convex', 'optimization', 'which', 'lead', 'to', 'cumulative', 'squared', 'constraint', 'violations', 'of', 'the', 'form', 'sumlimits_t1tbiggx_t_big2ot1beta', 'where', 'betain01', 'previous', 'literature', 'has', 'focused', 'on', 'longterm', 'constraints', 'of', ... | [-0.14125391280274172, 0.057198688752492365, -0.09386386368344077, 0.12783061845649807, -0.15100366106248056, -0.1844764978466731, 0.09834735812004304, 0.3110508619860377, -0.24068370272563594, -0.33209580518656745, 0.12941121543924552, -0.2774922839664626, -0.15160473803154914, 0.19474633822639315, -0.1214599443318427... |
1,802.06473 | Examples of tropical-to-Lagrangian correspondence | The paper associates Lagrangian submanifolds in symplectic toric varieties to
certain tropical curves inside the convex polyhedral domains of $\R^n$ that
appear as the images of the moment map of the toric varieties.
We pay a particular attention to the case $n=2$, where we reprove Givental's
theorem on Lagrangian ... | math.SG | the paper associates lagrangian submanifolds in symplectic toric varieties to certain tropical curves inside the convex polyhedral domains of rn that appear as the images of the moment map of the toric varieties we pay a particular attention to the case n2 where we reprove giventals theorem on lagrangian embeddability ... | [['the', 'paper', 'associates', 'lagrangian', 'submanifolds', 'in', 'symplectic', 'toric', 'varieties', 'to', 'certain', 'tropical', 'curves', 'inside', 'the', 'convex', 'polyhedral', 'domains', 'of', 'rn', 'that', 'appear', 'as', 'the', 'images', 'of', 'the', 'moment', 'map', 'of', 'the', 'toric', 'varieties', 'we', '... | [-0.18871143368866156, 0.014412529174781715, -0.07026836676047205, 0.1418283142168851, -0.08267040974546776, -0.12264179528466668, -0.04384513832768856, 0.31409656149507675, -0.3156281616452529, -0.23521176554021184, 0.10850630927813688, -0.26412860718038345, -0.19416570878928285, 0.16322152205328974, -0.24637842120568... |
1,802.06474 | A Closed-form Solution to Photorealistic Image Stylization | Photorealistic image stylization concerns transferring style of a reference
photo to a content photo with the constraint that the stylized photo should
remain photorealistic. While several photorealistic image stylization methods
exist, they tend to generate spatially inconsistent stylizations with
noticeable artifac... | cs.CV | photorealistic image stylization concerns transferring style of a reference photo to a content photo with the constraint that the stylized photo should remain photorealistic while several photorealistic image stylization methods exist they tend to generate spatially inconsistent stylizations with noticeable artifacts i... | [['photorealistic', 'image', 'stylization', 'concerns', 'transferring', 'style', 'of', 'a', 'reference', 'photo', 'to', 'a', 'content', 'photo', 'with', 'the', 'constraint', 'that', 'the', 'stylized', 'photo', 'should', 'remain', 'photorealistic', 'while', 'several', 'photorealistic', 'image', 'stylization', 'methods',... | [-0.012219802055894857, -0.001997813746385591, -0.08268378657603663, 0.07860173508902014, -0.07502493991608351, -0.1787333977998982, 0.0050497541940298825, 0.4901729559814426, -0.254605434392251, -0.351593867180423, 0.08139116219884361, -0.3111762057294623, -0.11381937747552309, 0.19027509916127777, -0.131921462493319,... |
1,802.06475 | A multivariate Berry--Esseen theorem with explicit constants | We provide a Lyapunov type bound in the multivariate central limit theorem
for sums of independent, but not necessarily identically distributed random
vectors. The error in the normal approximation is estimated for certain classes
of sets, which include the class of measurable convex sets. The error bound is
stated w... | math.PR | we provide a lyapunov type bound in the multivariate central limit theorem for sums of independent but not necessarily identically distributed random vectors the error in the normal approximation is estimated for certain classes of sets which include the class of measurable convex sets the error bound is stated with ex... | [['we', 'provide', 'a', 'lyapunov', 'type', 'bound', 'in', 'the', 'multivariate', 'central', 'limit', 'theorem', 'for', 'sums', 'of', 'independent', 'but', 'not', 'necessarily', 'identically', 'distributed', 'random', 'vectors', 'the', 'error', 'in', 'the', 'normal', 'approximation', 'is', 'estimated', 'for', 'certain'... | [-0.12968241182260226, 0.09952396606760365, -0.08217613719548884, 0.0858275230275467, -0.006001974214110282, -0.12012769899999287, 0.10272201489318501, 0.30023544044657186, -0.2904854787441043, -0.2243558296921675, 0.11856427253828711, -0.2345519139213705, -0.11883508716709912, 0.2423448479952073, -0.12848226027563214,... |
1,802.06476 | Simultaneous Modeling of Multiple Complications for Risk Profiling in
Diabetes Care | Type 2 diabetes mellitus (T2DM) is a chronic disease that often results in
multiple complications. Risk prediction and profiling of T2DM complications is
critical for healthcare professionals to design personalized treatment plans
for patients in diabetes care for improved outcomes. In this paper, we study
the risk o... | cs.LG cs.AI stat.ML | type 2 diabetes mellitus t2dm is a chronic disease that often results in multiple complications risk prediction and profiling of t2dm complications is critical for healthcare professionals to design personalized treatment plans for patients in diabetes care for improved outcomes in this paper we study the risk of devel... | [['type', '2', 'diabetes', 'mellitus', 't2dm', 'is', 'a', 'chronic', 'disease', 'that', 'often', 'results', 'in', 'multiple', 'complications', 'risk', 'prediction', 'and', 'profiling', 'of', 't2dm', 'complications', 'is', 'critical', 'for', 'healthcare', 'professionals', 'to', 'design', 'personalized', 'treatment', 'pl... | [-0.017480987759137697, -0.0007920973063485572, -0.05301814804769357, 0.1338732048666381, -0.1083243677089588, -0.16255347461007427, 0.11447017321097955, 0.41601411062493276, -0.23219177190940737, -0.3052369051782245, 0.10568928112984416, -0.3182560080221217, -0.21193277888427797, 0.2029075596256529, -0.193315328384023... |
1,802.06477 | On the sheaf of smooth forms on Lie algebroids over triangulated spaces | Cohomology of a compatible family of Lie algebroids defined on a family of
transverse manifolds is defined. A sheaf of differential forms on a compatible
family of Lie algebroids defined over regular open subsets of a simplicial
complex is constructed. It is proved that sheaf is fine.
| math.AT | cohomology of a compatible family of lie algebroids defined on a family of transverse manifolds is defined a sheaf of differential forms on a compatible family of lie algebroids defined over regular open subsets of a simplicial complex is constructed it is proved that sheaf is fine | [['cohomology', 'of', 'a', 'compatible', 'family', 'of', 'lie', 'algebroids', 'defined', 'on', 'a', 'family', 'of', 'transverse', 'manifolds', 'is', 'defined', 'a', 'sheaf', 'of', 'differential', 'forms', 'on', 'a', 'compatible', 'family', 'of', 'lie', 'algebroids', 'defined', 'over', 'regular', 'open', 'subsets', 'of'... | [-0.309283853667055, 0.003969580430458201, -0.05305768569257665, 0.12246958440803785, -0.19881030390078716, -0.12046054618908687, -0.08231728678529567, 0.3782302905270394, -0.35708245222872875, -0.1846508969493369, 0.07747631994611089, -0.18608809579560098, -0.14328790523428866, 0.25874976029104374, -0.2086164173571036... |
1,802.06478 | An Efficient Local Search for the Minimum Independent Dominating Set
Problem | In the present paper, we propose an efficient local search for the minimum
independent dominating set problem. We consider a local search that uses
$k$-swap as the neighborhood operation. Given a feasible solution $S$, it is
the operation of obtaining another feasible solution by dropping exactly $k$
vertices from $S... | cs.DS | in the present paper we propose an efficient local search for the minimum independent dominating set problem we consider a local search that uses kswap as the neighborhood operation given a feasible solution s it is the operation of obtaining another feasible solution by dropping exactly k vertices from s and then by a... | [['in', 'the', 'present', 'paper', 'we', 'propose', 'an', 'efficient', 'local', 'search', 'for', 'the', 'minimum', 'independent', 'dominating', 'set', 'problem', 'we', 'consider', 'a', 'local', 'search', 'that', 'uses', 'kswap', 'as', 'the', 'neighborhood', 'operation', 'given', 'a', 'feasible', 'solution', 's', 'it', ... | [-0.15328390303707823, 0.06788453241103255, -0.02995412924727581, 0.021027120945301406, -0.0737929515717499, -0.1734539627373302, 0.10390472977081387, 0.3473043641629603, -0.28421441205470255, -0.34355192786952815, 0.12187858193126824, -0.32825267223339505, -0.1493146853006377, 0.12888531962035005, -0.03448066395556544... |
1,802.06479 | Optimal leader selection and demotion in leader-follower multi-agent
systems | We consider leader-follower multi-agent systems that have many leaders,
defined on any connected weighted undirected graphs, and address the leader
selection and demotion problems. The leader selection problem is formulated as
a minimization problem for the $H^2$ norm of the difference between the
transfer functions ... | math.OC | we consider leaderfollower multiagent systems that have many leaders defined on any connected weighted undirected graphs and address the leader selection and demotion problems the leader selection problem is formulated as a minimization problem for the h2 norm of the difference between the transfer functions of the ori... | [['we', 'consider', 'leaderfollower', 'multiagent', 'systems', 'that', 'have', 'many', 'leaders', 'defined', 'on', 'any', 'connected', 'weighted', 'undirected', 'graphs', 'and', 'address', 'the', 'leader', 'selection', 'and', 'demotion', 'problems', 'the', 'leader', 'selection', 'problem', 'is', 'formulated', 'as', 'a'... | [-0.1313759634660076, 0.018521746030089513, -0.06753515465699785, 0.06854722572199914, -0.11373362067045972, -0.17764471044149127, 0.1026381436235871, 0.3783869735555711, -0.3409976942306445, -0.28655272302540397, 0.11775195769801297, -0.2558438712430454, -0.161678202334621, 0.09746654501817877, -0.12030776172002863, 0... |
1,802.0648 | Accelerated Primal-Dual Policy Optimization for Safe Reinforcement
Learning | Constrained Markov Decision Process (CMDP) is a natural framework for
reinforcement learning tasks with safety constraints, where agents learn a
policy that maximizes the long-term reward while satisfying the constraints on
the long-term cost. A canonical approach for solving CMDPs is the primal-dual
method which upd... | cs.AI cs.LG stat.ML | constrained markov decision process cmdp is a natural framework for reinforcement learning tasks with safety constraints where agents learn a policy that maximizes the longterm reward while satisfying the constraints on the longterm cost a canonical approach for solving cmdps is the primaldual method which updates para... | [['constrained', 'markov', 'decision', 'process', 'cmdp', 'is', 'a', 'natural', 'framework', 'for', 'reinforcement', 'learning', 'tasks', 'with', 'safety', 'constraints', 'where', 'agents', 'learn', 'a', 'policy', 'that', 'maximizes', 'the', 'longterm', 'reward', 'while', 'satisfying', 'the', 'constraints', 'on', 'the'... | [-0.024518846202322017, -0.006904965413299062, -0.1029198118555012, 0.0791715191527594, -0.15550466108747493, -0.20677084797896, 0.12379732026124317, 0.4768616350492768, -0.2947591884172897, -0.30904465617695404, 0.11222401039793031, -0.19300410506461482, -0.14187166258456435, 0.18527991563575202, -0.15860057615939138,... |
1,802.06481 | Finite-Length Construction of High Performance Spatially-Coupled Codes
via Optimized Partitioning and Lifting | Spatially-coupled (SC) codes are a family of graph-based codes that have
attracted significant attention thanks to their capacity approaching
performance and low decoding latency. An SC code is constructed by partitioning
an underlying block code into a number of components and coupling their copies
together. In this... | cs.IT math.IT | spatiallycoupled sc codes are a family of graphbased codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency an sc code is constructed by partitioning an underlying block code into a number of components and coupling their copies together in this paper w... | [['spatiallycoupled', 'sc', 'codes', 'are', 'a', 'family', 'of', 'graphbased', 'codes', 'that', 'have', 'attracted', 'significant', 'attention', 'thanks', 'to', 'their', 'capacity', 'approaching', 'performance', 'and', 'low', 'decoding', 'latency', 'an', 'sc', 'code', 'is', 'constructed', 'by', 'partitioning', 'an', 'u... | [-0.15145329866785234, 0.06571947097053532, -0.030100155326296684, 0.07272530182650039, -0.043121444593245156, -0.172275156406733, 0.08491509300857536, 0.3919391446713793, -0.29029063819931245, -0.32250926952081055, 0.08853300376960696, -0.23345194156352564, -0.15817128106724793, 0.1723247047556271, -0.1393125102462880... |
1,802.06482 | Optimal Graph Laplacian | This paper provides a construction method of the nearest graph Laplacian to a
matrix identified from measurement data of graph Laplacian dynamics that
include biochemical systems, synchronization systems, and multi-agent systems.
We consider the case where the network structure, i.e., the connection
relationship of e... | math.OC | this paper provides a construction method of the nearest graph laplacian to a matrix identified from measurement data of graph laplacian dynamics that include biochemical systems synchronization systems and multiagent systems we consider the case where the network structure ie the connection relationship of edges of a ... | [['this', 'paper', 'provides', 'a', 'construction', 'method', 'of', 'the', 'nearest', 'graph', 'laplacian', 'to', 'a', 'matrix', 'identified', 'from', 'measurement', 'data', 'of', 'graph', 'laplacian', 'dynamics', 'that', 'include', 'biochemical', 'systems', 'synchronization', 'systems', 'and', 'multiagent', 'systems',... | [-0.13524324782947833, -0.0019431205394023375, -0.07056136879868605, 0.03622270637975276, -0.1128218385038545, -0.15156725994500056, 0.05975877470415514, 0.3666377215570695, -0.3197887871238227, -0.3190898975432926, 0.12580509862006717, -0.2687532322204395, -0.23178890289902385, 0.1337774110127341, -0.06767399107637764... |
1,802.06483 | Committee Scoring Rules: Axiomatic Characterization and Hierarchy | Committee scoring voting rules are multiwinner analogues of positional
scoring rules which constitute an important subclass of single-winner voting
rules. We identify several natural subclasses of committee scoring rules,
namely, weakly separable, representation-focused, top-$k$-counting, OWA-based,
and decomposable ... | cs.GT | committee scoring voting rules are multiwinner analogues of positional scoring rules which constitute an important subclass of singlewinner voting rules we identify several natural subclasses of committee scoring rules namely weakly separable representationfocused topkcounting owabased and decomposable rules we charact... | [['committee', 'scoring', 'voting', 'rules', 'are', 'multiwinner', 'analogues', 'of', 'positional', 'scoring', 'rules', 'which', 'constitute', 'an', 'important', 'subclass', 'of', 'singlewinner', 'voting', 'rules', 'we', 'identify', 'several', 'natural', 'subclasses', 'of', 'committee', 'scoring', 'rules', 'namely', 'w... | [-0.09970384931326479, 0.04887320090604001, -0.06004110303725682, 0.1365923167482548, -0.19075833374917434, -0.1958239907490126, 0.1417553534493873, 0.42880139222332075, -0.27913828258055684, -0.19397586201518482, 0.10763211729913476, -0.2482926743835503, -0.18988648462383187, 0.151838096570881, -0.09770719017650858, 0... |
1,802.06484 | A positive fraction mutually avoiding sets theorem | Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if
no line generated by any two points in $A$ intersects the convex hull of $B$,
and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach,
and Schulman showed that every set of $n$ points in the plane in general
position con... | math.CO | two sets a and b of points in the plane are emphmutually avoiding if no line generated by any two points in a intersects the convex hull of b and vice versa in 1994 aronov erdh os goddard kleitman klugerman pach and schulman showed that every set of n points in the plane in general position contains a pair of mutually ... | [['two', 'sets', 'a', 'and', 'b', 'of', 'points', 'in', 'the', 'plane', 'are', 'emphmutually', 'avoiding', 'if', 'no', 'line', 'generated', 'by', 'any', 'two', 'points', 'in', 'a', 'intersects', 'the', 'convex', 'hull', 'of', 'b', 'and', 'vice', 'versa', 'in', '1994', 'aronov', 'erdh', 'os', 'goddard', 'kleitman', 'klu... | [-0.21379254334480377, 0.13513641752038352, -0.028311974811996963, -0.011287941784925155, 0.01599525726979246, -0.1593954543784462, 0.07091112716274486, 0.3591176439479396, -0.26652612547213966, -0.1966679152629867, 0.06140233585862694, -0.3795614845245271, -0.09468393660326664, 0.15719970175241296, -0.0683447017032351... |
1,802.06485 | Robust Estimation via Robust Gradient Estimation | We provide a new computationally-efficient class of estimators for risk
minimization. We show that these estimators are robust for general statistical
models: in the classical Huber epsilon-contamination model and in heavy-tailed
settings. Our workhorse is a novel robust variant of gradient descent, and we
provide co... | stat.ML cs.AI cs.LG | we provide a new computationallyefficient class of estimators for risk minimization we show that these estimators are robust for general statistical models in the classical huber epsiloncontamination model and in heavytailed settings our workhorse is a novel robust variant of gradient descent and we provide conditions ... | [['we', 'provide', 'a', 'new', 'computationallyefficient', 'class', 'of', 'estimators', 'for', 'risk', 'minimization', 'we', 'show', 'that', 'these', 'estimators', 'are', 'robust', 'for', 'general', 'statistical', 'models', 'in', 'the', 'classical', 'huber', 'epsiloncontamination', 'model', 'and', 'in', 'heavytailed', ... | [-0.00830307941840485, -0.06089185043172676, -0.1294703444090578, 0.15421493288649377, -0.05891425361633012, -0.19238507453814263, 0.03371762004482394, 0.43616248766869997, -0.2648371692111557, -0.251532891519772, 0.12815691514731234, -0.22268159138832905, -0.23724027959875357, 0.2861181550836118, -0.15932826173867193,... |
1,802.06486 | Attractor Cosmology from non-minimally Coupled Gravity | By using a bottom-up reconstruction technique for non-minimally coupled
scalar-tensor theories, we realize the Einstein frame attractor cosmologies in
the $\Omega (\phi)$-Jordan frame. For our approach, what is needed for the
reconstruction method to work is the functional form of the non-minimal
coupling $\Omega(\ph... | gr-qc astro-ph.CO hep-th | by using a bottomup reconstruction technique for nonminimally coupled scalartensor theories we realize the einstein frame attractor cosmologies in the omega phijordan frame for our approach what is needed for the reconstruction method to work is the functional form of the nonminimal coupling omegaphi and of the scalart... | [['by', 'using', 'a', 'bottomup', 'reconstruction', 'technique', 'for', 'nonminimally', 'coupled', 'scalartensor', 'theories', 'we', 'realize', 'the', 'einstein', 'frame', 'attractor', 'cosmologies', 'in', 'the', 'omega', 'phijordan', 'frame', 'for', 'our', 'approach', 'what', 'is', 'needed', 'for', 'the', 'reconstruct... | [-0.1451875480543454, 0.08182554244268096, -0.1011832339262126, 0.10489670710459631, -0.06671912391051621, -0.09967710148992216, -0.007741575512166315, 0.3407375610363578, -0.20905570391190087, -0.28669707817135914, 0.046145322893676254, -0.22900942888335424, -0.14960176168421924, 0.13640343682014977, -0.07015268220897... |
1,802.06487 | Poisson geometry and representations of PI 4-dimensional Sklyanin
algebras | Take S to be a 4-dimensional Sklyanin (elliptic) algebra that is
module-finite over its center Z; thus, S is PI. Our first result is the
construction of a Poisson Z-order structure on S such that the induced Poisson
bracket on Z is non-vanishing. We also provide the explicit Jacobian structure
of this bracket, leadin... | math.RT math.QA math.RA math.SG | take s to be a 4dimensional sklyanin elliptic algebra that is modulefinite over its center z thus s is pi our first result is the construction of a poisson zorder structure on s such that the induced poisson bracket on z is nonvanishing we also provide the explicit jacobian structure of this bracket leading to a descri... | [['take', 's', 'to', 'be', 'a', '4dimensional', 'sklyanin', 'elliptic', 'algebra', 'that', 'is', 'modulefinite', 'over', 'its', 'center', 'z', 'thus', 's', 'is', 'pi', 'our', 'first', 'result', 'is', 'the', 'construction', 'of', 'a', 'poisson', 'zorder', 'structure', 'on', 's', 'such', 'that', 'the', 'induced', 'poisso... | [-0.1613980922787901, 0.039138011111607474, -0.12313427471315429, 0.038555398795964015, -0.08589244033059766, -0.13241026610917142, 0.0007884366437792778, 0.33725777838018633, -0.33883893963910877, -0.20862830765845794, 0.07475714018313034, -0.26325249851591165, -0.10982486182643521, 0.19849233432642877, -0.07529875134... |
1,802.06488 | Tiny SSD: A Tiny Single-shot Detection Deep Convolutional Neural Network
for Real-time Embedded Object Detection | Object detection is a major challenge in computer vision, involving both
object classification and object localization within a scene. While deep neural
networks have been shown in recent years to yield very powerful techniques for
tackling the challenge of object detection, one of the biggest challenges with
enablin... | cs.CV cs.AI cs.NE | object detection is a major challenge in computer vision involving both object classification and object localization within a scene while deep neural networks have been shown in recent years to yield very powerful techniques for tackling the challenge of object detection one of the biggest challenges with enabling suc... | [['object', 'detection', 'is', 'a', 'major', 'challenge', 'in', 'computer', 'vision', 'involving', 'both', 'object', 'classification', 'and', 'object', 'localization', 'within', 'a', 'scene', 'while', 'deep', 'neural', 'networks', 'have', 'been', 'shown', 'in', 'recent', 'years', 'to', 'yield', 'very', 'powerful', 'tec... | [-0.10448978582894088, 0.017370793141655398, 0.016061064728740353, 0.014219307789637502, -0.05338331659203353, -0.22695711009505085, -0.031065123004843, 0.44336156842754026, -0.20426048701545516, -0.3822468842250282, 0.10613743830921187, -0.2438089747165618, -0.2005577491120761, 0.22555020115559613, -0.1585287897306757... |
1,802.06489 | Local field theory construction of Very Special Conformal Symmetry | Cohen and Glashow argued that very special conformal field theories of a
particular kind (i.e. with HOM(2) or SIM(2) invariance) cannot be constructed
within the framework of local field theories. We, however, show examples of
local construction by using non-linear realization. We further construct linear
realization... | hep-th hep-ph | cohen and glashow argued that very special conformal field theories of a particular kind ie with hom2 or sim2 invariance cannot be constructed within the framework of local field theories we however show examples of local construction by using nonlinear realization we further construct linear realization from the topol... | [['cohen', 'and', 'glashow', 'argued', 'that', 'very', 'special', 'conformal', 'field', 'theories', 'of', 'a', 'particular', 'kind', 'ie', 'with', 'hom2', 'or', 'sim2', 'invariance', 'can', 'not', 'be', 'constructed', 'within', 'the', 'framework', 'of', 'local', 'field', 'theories', 'we', 'however', 'show', 'examples',... | [-0.08831842689086562, 0.12107366422508452, -0.08243856844289796, 0.05646516217013308, -0.10759476045200574, -0.13343449194065254, -0.003075945855833698, 0.3301345352353393, -0.25015168117723713, -0.2904110438041929, 0.06989489515325513, -0.18908367317129413, -0.23796233706567707, 0.1769014565051412, -0.072752041989166... |
1,802.0649 | On the exact solvability of the anisotropic central spin model: An
operator approach | Using an operator approach based on a commutator scheme that has been
previously applied to Richardson's reduced BCS model and the inhomogeneous
Dicke model, we obtain general exact solvability requirements for an
anisotropic central spin model with $XXZ$-type hyperfine coupling between the
central spin and the spin ... | cond-mat.stat-mech quant-ph | using an operator approach based on a commutator scheme that has been previously applied to richardsons reduced bcs model and the inhomogeneous dicke model we obtain general exact solvability requirements for an anisotropic central spin model with xxztype hyperfine coupling between the central spin and the spin bath wi... | [['using', 'an', 'operator', 'approach', 'based', 'on', 'a', 'commutator', 'scheme', 'that', 'has', 'been', 'previously', 'applied', 'to', 'richardsons', 'reduced', 'bcs', 'model', 'and', 'the', 'inhomogeneous', 'dicke', 'model', 'we', 'obtain', 'general', 'exact', 'solvability', 'requirements', 'for', 'an', 'anisotrop... | [-0.11007568918113761, 0.12202991158483201, -0.053624866724182055, 0.040754839076886554, -0.08208482078899738, -0.1653295694165589, 0.00503728336736779, 0.37965515151325446, -0.25143140186007845, -0.2692839701194316, 0.06926647109674591, -0.24386417807545513, -0.10489070273401654, 0.178010971242603, 0.02716713396469405... |
1,802.06491 | Trace Ideals and the Gorenstein Property | Let R be a local Noetherian commutative ring. We prove that R is an Artinian
Gorenstein ring if and only if every ideal in R is a trace ideal. We discuss
when the trace ideal of a module coincides with its double annihilator.
| math.AC | let r be a local noetherian commutative ring we prove that r is an artinian gorenstein ring if and only if every ideal in r is a trace ideal we discuss when the trace ideal of a module coincides with its double annihilator | [['let', 'r', 'be', 'a', 'local', 'noetherian', 'commutative', 'ring', 'we', 'prove', 'that', 'r', 'is', 'an', 'artinian', 'gorenstein', 'ring', 'if', 'and', 'only', 'if', 'every', 'ideal', 'in', 'r', 'is', 'a', 'trace', 'ideal', 'we', 'discuss', 'when', 'the', 'trace', 'ideal', 'of', 'a', 'module', 'coincides', 'with'... | [-0.2458913477440906, -0.04508709843334103, -0.10639461420129898, 0.00421014062648769, -0.0468996386585194, -0.3056892585659096, -0.16040923704154963, 0.3572593182325363, -0.4705908886308587, 8.711816613064256e-05, 0.15303930894439216, -0.23159744397758744, -0.032243925948129144, 0.15182988085719043, -0.141316418211127... |
1,802.06492 | Attributed Hierarchical Port Graphs and Applications | We present attributed hierarchical port graphs (AHP) as an extension of port
graphs that aims at facilitating the design of modular port graph models for
complex systems. AHP consist of a number of interconnected layers, where each
layer defines a port graph whose nodes may link to layers further down the
hierarchy; ... | cs.LO cs.SE cs.SI | we present attributed hierarchical port graphs ahp as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems ahp consist of a number of interconnected layers where each layer defines a port graph whose nodes may link to layers further down the hierarchy attribu... | [['we', 'present', 'attributed', 'hierarchical', 'port', 'graphs', 'ahp', 'as', 'an', 'extension', 'of', 'port', 'graphs', 'that', 'aims', 'at', 'facilitating', 'the', 'design', 'of', 'modular', 'port', 'graph', 'models', 'for', 'complex', 'systems', 'ahp', 'consist', 'of', 'a', 'number', 'of', 'interconnected', 'layer... | [-0.1408515788135948, 0.027986261842231436, -0.019798437382319366, 0.04114910165763235, -0.1677736283263898, -0.187100216605829, 0.07519705585055535, 0.3709494425947296, -0.33620388788203226, -0.3660598278350743, 0.09028704759789277, -0.2589894740537194, -0.1736510360436835, 0.13466133725636736, -0.09667546208747181, 0... |
1,802.06493 | A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras | Order-sorted algebras and many sorted algebras exist in a long history with
many different implementations and applications. A lot of language
specifications have been defined in order-sorted algebra frameworks such as the
language specifications in K (an order-sorted algebra framework). The biggest
problem in a lot ... | cs.PL cs.LO | ordersorted algebras and many sorted algebras exist in a long history with many different implementations and applications a lot of language specifications have been defined in ordersorted algebra frameworks such as the language specifications in k an ordersorted algebra framework the biggest problem in a lot of the or... | [['ordersorted', 'algebras', 'and', 'many', 'sorted', 'algebras', 'exist', 'in', 'a', 'long', 'history', 'with', 'many', 'different', 'implementations', 'and', 'applications', 'a', 'lot', 'of', 'language', 'specifications', 'have', 'been', 'defined', 'in', 'ordersorted', 'algebra', 'frameworks', 'such', 'as', 'the', 'l... | [-0.11875769325589802, 0.0288268238015857, -0.09617682173678203, 0.10650215998468716, -0.1855523280228359, -0.15260135109985015, 0.010015148564962412, 0.3393205156066305, -0.3660000535883825, -0.2984929905327404, 0.1371158122286425, -0.21849264079759265, -0.08812024049039413, 0.17492314692914662, -0.15855211425694998, ... |
1,802.06494 | Transforming Proof Tableaux of Hoare Logic into Inference Sequences of
Rewriting Induction | A proof tableau of Hoare logic is an annotated program with pre- and
post-conditions, which corresponds to an inference tree of Hoare logic. In this
paper, we show that a proof tableau for partial correctness can be transformed
into an inference sequence of rewriting induction for constrained rewriting. We
also show ... | cs.LO | a proof tableau of hoare logic is an annotated program with pre and postconditions which corresponds to an inference tree of hoare logic in this paper we show that a proof tableau for partial correctness can be transformed into an inference sequence of rewriting induction for constrained rewriting we also show that the... | [['a', 'proof', 'tableau', 'of', 'hoare', 'logic', 'is', 'an', 'annotated', 'program', 'with', 'pre', 'and', 'postconditions', 'which', 'corresponds', 'to', 'an', 'inference', 'tree', 'of', 'hoare', 'logic', 'in', 'this', 'paper', 'we', 'show', 'that', 'a', 'proof', 'tableau', 'for', 'partial', 'correctness', 'can', 'b... | [-0.11368768150726008, -0.01579083805388239, -0.11905051339122039, 0.08377767191083717, -0.1639562370292547, -0.1503128317805628, 0.0976256361214577, 0.2965508899429724, -0.3465298612616838, -0.3447305661559637, 0.09632307833101275, -0.19196467748325732, -0.055913876158200086, 0.18195108438117635, -0.14122065942039683,... |
1,802.06495 | Efficient Implementation of Evaluation Strategies via Token-Guided Graph
Rewriting | In implementing evaluation strategies of the lambda-calculus, both
correctness and efficiency of implementation are valid concerns. While the
notion of correctness is determined by the evaluation strategy, regarding
efficiency there is a larger design space that can be explored, in particular
the trade-off between sp... | cs.PL cs.LO | in implementing evaluation strategies of the lambdacalculus both correctness and efficiency of implementation are valid concerns while the notion of correctness is determined by the evaluation strategy regarding efficiency there is a larger design space that can be explored in particular the tradeoff between space vers... | [['in', 'implementing', 'evaluation', 'strategies', 'of', 'the', 'lambdacalculus', 'both', 'correctness', 'and', 'efficiency', 'of', 'implementation', 'are', 'valid', 'concerns', 'while', 'the', 'notion', 'of', 'correctness', 'is', 'determined', 'by', 'the', 'evaluation', 'strategy', 'regarding', 'efficiency', 'there',... | [-0.12760645238626184, 0.032363745795120136, -0.08548634842913033, 0.06916235002449178, -0.11638801910378264, -0.15997543627974775, 0.11437341892407417, 0.38269664117163327, -0.31303125278050586, -0.32929465042958106, 0.06884172938809956, -0.20806544868162635, -0.09881030975675183, 0.1881986701028478, -0.14840096582228... |
1,802.06496 | Reduced Dependency Spaces for Existential Parameterised Boolean Equation
Systems | A parameterised Boolean equation system (PBES) is a set of equations that
defines sets satisfying the equations as the least and/or greatest
fixed-points. Thus this system is regarded as a declarative program defining
predicates, where a program execution returns whether a given ground atomic
formula holds or not. Th... | cs.LO | a parameterised boolean equation system pbes is a set of equations that defines sets satisfying the equations as the least andor greatest fixedpoints thus this system is regarded as a declarative program defining predicates where a program execution returns whether a given ground atomic formula holds or not the program... | [['a', 'parameterised', 'boolean', 'equation', 'system', 'pbes', 'is', 'a', 'set', 'of', 'equations', 'that', 'defines', 'sets', 'satisfying', 'the', 'equations', 'as', 'the', 'least', 'andor', 'greatest', 'fixedpoints', 'thus', 'this', 'system', 'is', 'regarded', 'as', 'a', 'declarative', 'program', 'defining', 'predi... | [-0.13144687074549796, 0.05060418574574076, -0.09660301758226993, 0.12170692999020319, -0.1415894251868062, -0.13315494972878375, 0.07580160022130646, 0.3419140476624861, -0.3186673109206651, -0.30770507237102396, 0.12789946903094582, -0.2407716660146422, -0.14851089811888044, 0.17514069043747213, -0.08840368055776879,... |
1,802.06497 | Transforming Dependency Chains of Constrained TRSs into Bounded Monotone
Sequences of Integers | In the dependency pair framework for proving termination of rewriting
systems, polynomial interpretations are used to transform dependency chains
into bounded decreasing sequences of integers, and they play an important role
for the success of proving termination, especially for constrained rewriting
systems. In this... | cs.LO | in the dependency pair framework for proving termination of rewriting systems polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers and they play an important role for the success of proving termination especially for constrained rewriting systems in this paper... | [['in', 'the', 'dependency', 'pair', 'framework', 'for', 'proving', 'termination', 'of', 'rewriting', 'systems', 'polynomial', 'interpretations', 'are', 'used', 'to', 'transform', 'dependency', 'chains', 'into', 'bounded', 'decreasing', 'sequences', 'of', 'integers', 'and', 'they', 'play', 'an', 'important', 'role', 'f... | [-0.17996419867691862, 0.12554227311361893, -0.05263292292342676, 0.08993897072289336, -0.062331699918869214, -0.18290729892273613, 0.02239158174519532, 0.3455899142573853, -0.38992137283037437, -0.27118017151643403, 0.06889026186317945, -0.27608133389287637, -0.13103043604549638, 0.1727755843856008, -0.042839377667502... |
1,802.06498 | Space Improvements and Equivalences in a Functional Core Language | We explore space improvements in LRP, a polymorphically typed call-by-need
functional core language. A relaxed space measure is chosen for the maximal
size usage during an evaluation. It abstracts from the details of the
implementation via abstract machines, but it takes garbage collection into
account and thus can b... | cs.PL | we explore space improvements in lrp a polymorphically typed callbyneed functional core language a relaxed space measure is chosen for the maximal size usage during an evaluation it abstracts from the details of the implementation via abstract machines but it takes garbage collection into account and thus can be seen a... | [['we', 'explore', 'space', 'improvements', 'in', 'lrp', 'a', 'polymorphically', 'typed', 'callbyneed', 'functional', 'core', 'language', 'a', 'relaxed', 'space', 'measure', 'is', 'chosen', 'for', 'the', 'maximal', 'size', 'usage', 'during', 'an', 'evaluation', 'it', 'abstracts', 'from', 'the', 'details', 'of', 'the', ... | [-0.08445289515350994, 0.07555479823244432, -0.09201513636722475, 0.13671897659782858, -0.13272146904522455, -0.09586563842535006, 0.06727577397281206, 0.408070651887867, -0.31132363628498033, -0.3127038865350187, 0.14019211835004267, -0.24150275924138873, -0.12133753528101615, 0.23945321541549147, -0.09094738512986193... |
1,802.06499 | Higher order Hamiltonians for the trigonometric Gaudin model | We consider the trigonometric classical $r$-matrix for $\mathfrak{gl}_N$ and
the associated quantum Gaudin model. We produce higher Hamiltonians in an
explicit form by applying the limit $q\to 1$ to elements of the Bethe
subalgebra for the $XXZ$ model.
| math.QA math-ph math.MP | we consider the trigonometric classical rmatrix for mathfrakgl_n and the associated quantum gaudin model we produce higher hamiltonians in an explicit form by applying the limit qto 1 to elements of the bethe subalgebra for the xxz model | [['we', 'consider', 'the', 'trigonometric', 'classical', 'rmatrix', 'for', 'mathfrakgl_n', 'and', 'the', 'associated', 'quantum', 'gaudin', 'model', 'we', 'produce', 'higher', 'hamiltonians', 'in', 'an', 'explicit', 'form', 'by', 'applying', 'the', 'limit', 'qto', '1', 'to', 'elements', 'of', 'the', 'bethe', 'subalgebr... | [-0.11756595538922977, 0.06363744371131026, 0.006029114421260984, 0.08800315979476038, -0.052719788527802416, -0.176907834449881, -0.02286232716869563, 0.32491198721292774, -0.3006055501142615, -0.16943913906518565, 0.06829451345593522, -0.28392950098618475, -0.09889341486421854, 0.23251061689255662, 0.0001462763052825... |
1,802.065 | The Initial Approximations for Achromatic Doublets of the XVIII Century | Analysis of the both type (flint-forward and crown-forward) achromatic
doublets was carried out. The investigation revealed possible initial
approximations which could be used by opticians at producing of the achromatic
doublets in last half of XVIII century. The comparative analysis of approximate
versions of achrom... | physics.hist-ph | analysis of the both type flintforward and crownforward achromatic doublets was carried out the investigation revealed possible initial approximations which could be used by opticians at producing of the achromatic doublets in last half of xviii century the comparative analysis of approximate versions of achromatic dou... | [['analysis', 'of', 'the', 'both', 'type', 'flintforward', 'and', 'crownforward', 'achromatic', 'doublets', 'was', 'carried', 'out', 'the', 'investigation', 'revealed', 'possible', 'initial', 'approximations', 'which', 'could', 'be', 'used', 'by', 'opticians', 'at', 'producing', 'of', 'the', 'achromatic', 'doublets', '... | [-0.11249932690272824, 0.07913379576057196, -0.12406268912869003, 0.13955856328024172, -0.11877583293244243, -0.23136903092068117, 0.03657178758428647, 0.3738679809639087, -0.11067214501448548, -0.36037977372224517, 0.14410066940427685, -0.2866246695128771, -0.07402520516457466, 0.1433171251645455, -0.00858728617716294... |
1,802.06501 | Recommendations with Negative Feedback via Pairwise Deep Reinforcement
Learning | Recommender systems play a crucial role in mitigating the problem of
information overload by suggesting users' personalized items or services. The
vast majority of traditional recommender systems consider the recommendation
procedure as a static process and make recommendations following a fixed
strategy. In this pap... | cs.IR cs.LG stat.ML | recommender systems play a crucial role in mitigating the problem of information overload by suggesting users personalized items or services the vast majority of traditional recommender systems consider the recommendation procedure as a static process and make recommendations following a fixed strategy in this paper we... | [['recommender', 'systems', 'play', 'a', 'crucial', 'role', 'in', 'mitigating', 'the', 'problem', 'of', 'information', 'overload', 'by', 'suggesting', 'users', 'personalized', 'items', 'or', 'services', 'the', 'vast', 'majority', 'of', 'traditional', 'recommender', 'systems', 'consider', 'the', 'recommendation', 'proce... | [-0.06720459590652164, 0.03439047496751732, -0.025016242684911715, 0.056574432504750784, -0.1652564461087107, -0.22044938651955512, 0.10915852291855298, 0.4215511118527502, -0.2545369760419178, -0.34041301408174013, 0.07183107584749468, -0.3212793831722719, -0.21615074876705093, 0.1583316619997835, -0.08345990978863717... |
1,802.06502 | EA-CG: An Approximate Second-Order Method for Training Fully-Connected
Neural Networks | For training fully-connected neural networks (FCNNs), we propose a practical
approximate second-order method including: 1) an approximation of the Hessian
matrix and 2) a conjugate gradient (CG) based method. Our proposed approximate
Hessian matrix is memory-efficient and can be applied to any FCNNs where the
activat... | cs.LG | for training fullyconnected neural networks fcnns we propose a practical approximate secondorder method including 1 an approximation of the hessian matrix and 2 a conjugate gradient cg based method our proposed approximate hessian matrix is memoryefficient and can be applied to any fcnns where the activation and criter... | [['for', 'training', 'fullyconnected', 'neural', 'networks', 'fcnns', 'we', 'propose', 'a', 'practical', 'approximate', 'secondorder', 'method', 'including', '1', 'an', 'approximation', 'of', 'the', 'hessian', 'matrix', 'and', '2', 'a', 'conjugate', 'gradient', 'cg', 'based', 'method', 'our', 'proposed', 'approximate',... | [-0.022767895006767985, -0.011962648642437207, -0.08148860064212163, 0.04958033657584445, -0.11088073418150603, -0.19820407248664437, 0.03067485049788682, 0.41948832655852697, -0.290490675609963, -0.2648451487656753, 0.08698884261561171, -0.20858813225805653, -0.2506050355380999, 0.1610116641254621, -0.0331184386785300... |
1,802.06503 | Multicolor Gallai-Ramsey numbers of $C_9$ and $C_{11}$ | A Gallai coloring is a coloring of the edges of a complete graph without
rainbow triangles, and a Gallai $k$-coloring is a Gallai coloring that uses $k$
colors. We study Ramsey-type problems in Gallai colorings. Given an integer
$k\ge1$ and a graph $H$, the Gallai-Ramsey number $GR_k(H)$ is the least
positive integer... | math.CO | a gallai coloring is a coloring of the edges of a complete graph without rainbow triangles and a gallai kcoloring is a gallai coloring that uses k colors we study ramseytype problems in gallai colorings given an integer kge1 and a graph h the gallairamsey number gr_kh is the least positive integer n such that every gal... | [['a', 'gallai', 'coloring', 'is', 'a', 'coloring', 'of', 'the', 'edges', 'of', 'a', 'complete', 'graph', 'without', 'rainbow', 'triangles', 'and', 'a', 'gallai', 'kcoloring', 'is', 'a', 'gallai', 'coloring', 'that', 'uses', 'k', 'colors', 'we', 'study', 'ramseytype', 'problems', 'in', 'gallai', 'colorings', 'given', '... | [-0.2221778994925054, 0.11654566757821677, -0.07218758157853569, 0.04760139822893377, -0.12658928659345423, -0.14451320406847767, 0.0835138047865725, 0.34425190793616434, -0.23004777641434754, -0.33219975518328804, 0.0643301970338715, -0.3343802188376763, -0.16217986749884272, 0.12400309752273772, -0.13670222252873437,... |
1,802.06504 | Compiling Diderot: From Tensor Calculus to C | Diderot is a parallel domain-specific language for analysis and visualization
of multidimensional scientific images, such as those produced by CT and MRI
scanners. In particular, it supports algorithms where tensor fields (i.e.,
functions from 3D points to tensor values) are used to represent the underlying
physical ... | cs.PL cs.MS | diderot is a parallel domainspecific language for analysis and visualization of multidimensional scientific images such as those produced by ct and mri scanners in particular it supports algorithms where tensor fields ie functions from 3d points to tensor values are used to represent the underlying physical objects tha... | [['diderot', 'is', 'a', 'parallel', 'domainspecific', 'language', 'for', 'analysis', 'and', 'visualization', 'of', 'multidimensional', 'scientific', 'images', 'such', 'as', 'those', 'produced', 'by', 'ct', 'and', 'mri', 'scanners', 'in', 'particular', 'it', 'supports', 'algorithms', 'where', 'tensor', 'fields', 'ie', '... | [-0.07137996752218928, 0.02531107569196307, -0.055200960520094475, 0.053674212022812265, -0.13713155131976623, -0.13145188687459888, 0.005319314046847362, 0.3829726321144705, -0.29789364173085287, -0.3469886734282734, 0.09665612521451543, -0.24691507449802175, -0.14215125309394064, 0.2229456949929616, -0.08951941325545... |
1,802.06505 | What Do Your Friends Think? Efficient Polling Methods for Networks Using
Friendship Paradox | This paper deals with randomized polling of a social network. In the case of
forecasting the outcome of an election between two candidates A and B,
classical intent polling asks randomly sampled individuals: who will you vote
for? Expectation polling asks: who do you think will win? In this paper, we
propose a novel ... | cs.SI physics.soc-ph | this paper deals with randomized polling of a social network in the case of forecasting the outcome of an election between two candidates a and b classical intent polling asks randomly sampled individuals who will you vote for expectation polling asks who do you think will win in this paper we propose a novel neighborh... | [['this', 'paper', 'deals', 'with', 'randomized', 'polling', 'of', 'a', 'social', 'network', 'in', 'the', 'case', 'of', 'forecasting', 'the', 'outcome', 'of', 'an', 'election', 'between', 'two', 'candidates', 'a', 'and', 'b', 'classical', 'intent', 'polling', 'asks', 'randomly', 'sampled', 'individuals', 'who', 'will',... | [-0.11014703330171682, 0.041172382881395346, -0.06927326221562673, 0.08408895005420759, -0.12533340452184052, -0.17306760722396974, 0.1485228852099298, 0.42305121992037376, -0.24821727618944953, -0.30453733675519973, 0.09289482183883671, -0.3135811220631716, -0.2010031060694993, 0.1399590352546807, -0.16657039155497363... |
1,802.06506 | Equidistribution of zeros of polynomials | A classical result of Erdos and Turan states that if a monic polynomial has
small size on the unit circle and its constant coefficient is not too small,
then its zeros cluster near the unit circle and become equidistributed in
angle. Using Fourier analysis we give a short and self-contained proof of this
result.
| math.CA | a classical result of erdos and turan states that if a monic polynomial has small size on the unit circle and its constant coefficient is not too small then its zeros cluster near the unit circle and become equidistributed in angle using fourier analysis we give a short and selfcontained proof of this result | [['a', 'classical', 'result', 'of', 'erdos', 'and', 'turan', 'states', 'that', 'if', 'a', 'monic', 'polynomial', 'has', 'small', 'size', 'on', 'the', 'unit', 'circle', 'and', 'its', 'constant', 'coefficient', 'is', 'not', 'too', 'small', 'then', 'its', 'zeros', 'cluster', 'near', 'the', 'unit', 'circle', 'and', 'become... | [-0.16393777013204439, 0.11394956499269163, -0.11132420206235515, 0.043467641411418165, -0.09070137905439844, -0.15410427834528187, 0.08612954021534985, 0.3067055058803547, -0.2972763685026654, -0.20738219374066424, 0.16342969651816897, -0.2987612354120723, -0.15506475993121663, 0.2044838311633578, -0.11916425667220244... |
1,802.06507 | Modeling communication processes in the human connectome through
cooperative learning | Communication processes within the human brain at different cognitive states
are neither well understood nor completely characterized. We assess
communication processes in the human connectome using ant colony-inspired
cooperative learning algorithm, starting from a source with no a priori
information about the netwo... | q-bio.NC | communication processes within the human brain at different cognitive states are neither well understood nor completely characterized we assess communication processes in the human connectome using ant colonyinspired cooperative learning algorithm starting from a source with no a priori information about the network to... | [['communication', 'processes', 'within', 'the', 'human', 'brain', 'at', 'different', 'cognitive', 'states', 'are', 'neither', 'well', 'understood', 'nor', 'completely', 'characterized', 'we', 'assess', 'communication', 'processes', 'in', 'the', 'human', 'connectome', 'using', 'ant', 'colonyinspired', 'cooperative', 'l... | [-0.15940805709455164, 0.09949932514988177, -0.05627150462125428, 0.07128697414067574, -0.04497503710910678, -0.17610447173938154, 0.09741314435726962, 0.416168604362756, -0.28439259973354636, -0.3620102548319846, 0.055867495913989845, -0.25406636675819755, -0.19880370082566515, 0.16076668515888742, -0.0438928863161709... |
1,802.06508 | Exactly Solvable Pairing Models | Some results for two distinct but complementary exactly solvable algebraic
models for pairing in atomic nuclei are presented: 1) binding energy
predictions for isotopic chains of nuclei based on an extended pairing model
that includes multi-pair excitations; and 2) fine structure effects among
excited $0^+$ states in... | nucl-th | some results for two distinct but complementary exactly solvable algebraic models for pairing in atomic nuclei are presented 1 binding energy predictions for isotopic chains of nuclei based on an extended pairing model that includes multipair excitations and 2 fine structure effects among excited 0 states in n approx z... | [['some', 'results', 'for', 'two', 'distinct', 'but', 'complementary', 'exactly', 'solvable', 'algebraic', 'models', 'for', 'pairing', 'in', 'atomic', 'nuclei', 'are', 'presented', '1', 'binding', 'energy', 'predictions', 'for', 'isotopic', 'chains', 'of', 'nuclei', 'based', 'on', 'an', 'extended', 'pairing', 'model', ... | [-0.09938841737417993, 0.16036476347017897, -0.05356259840072666, 0.16643255732578308, -0.008979769337705328, -0.19145361948035006, 0.027426924350789014, 0.3967009990937212, -0.21769681457176948, -0.29183844572783096, -0.026737637704835067, -0.29969350783407545, -0.07643899167256342, 0.1773274937074957, 0.0546653339327... |
1,802.06509 | On the Optimization of Deep Networks: Implicit Acceleration by
Overparameterization | Conventional wisdom in deep learning states that increasing depth improves
expressiveness but complicates optimization. This paper suggests that,
sometimes, increasing depth can speed up optimization. The effect of depth on
optimization is decoupled from expressiveness by focusing on settings where
additional layers ... | cs.LG | conventional wisdom in deep learning states that increasing depth improves expressiveness but complicates optimization this paper suggests that sometimes increasing depth can speed up optimization the effect of depth on optimization is decoupled from expressiveness by focusing on settings where additional layers amount... | [['conventional', 'wisdom', 'in', 'deep', 'learning', 'states', 'that', 'increasing', 'depth', 'improves', 'expressiveness', 'but', 'complicates', 'optimization', 'this', 'paper', 'suggests', 'that', 'sometimes', 'increasing', 'depth', 'can', 'speed', 'up', 'optimization', 'the', 'effect', 'of', 'depth', 'on', 'optimiz... | [-0.04155057735672434, 0.04901989441952805, -0.08191536028571732, 0.07409734617571392, -0.14396473282535913, -0.20285145639533514, 0.03254957276789593, 0.4393720817981196, -0.37906479829594064, -0.2947523058964642, 0.10495528309189973, -0.24971082184051516, -0.19928641635619226, 0.2167306449550555, -0.13652621485964686... |
1,802.0651 | Thermodynamics and structural transition of binary atomic Bose-Fermi
mixtures in box or harmonic potentials: A path-integral study | Experimental realizations of a variety of atomic binary Bose-Fermi mixtures
have brought opportunities for studying composite quantum systems with
different spin-statistics. The binary atomic mixtures can exhibit a structural
transition from a mixture into phase separation as the boson-fermion
interaction increases. ... | cond-mat.quant-gas cond-mat.stat-mech quant-ph | experimental realizations of a variety of atomic binary bosefermi mixtures have brought opportunities for studying composite quantum systems with different spinstatistics the binary atomic mixtures can exhibit a structural transition from a mixture into phase separation as the bosonfermion interaction increases by usin... | [['experimental', 'realizations', 'of', 'a', 'variety', 'of', 'atomic', 'binary', 'bosefermi', 'mixtures', 'have', 'brought', 'opportunities', 'for', 'studying', 'composite', 'quantum', 'systems', 'with', 'different', 'spinstatistics', 'the', 'binary', 'atomic', 'mixtures', 'can', 'exhibit', 'a', 'structural', 'transit... | [-0.1012522807146457, 0.22149009522784838, -0.10674091579211462, 0.05046477583520331, 0.03670254425717291, -0.1488228023678025, 0.09539492187464718, 0.36656757283256086, -0.24821900702007707, -0.2847350772923578, 0.05324060973100286, -0.246843066771155, -0.09708104927891067, 0.11813762537006624, 0.04583144477610452, 0.... |
1,802.06511 | Reconfiguration of Colorable Sets in Classes of Perfect Graphs | A set of vertices in a graph is c-colorable if the subgraph induced by the
set has a proper c-coloring. In this paper, we study the problem of finding a
step-by-step transformation (reconfiguration) between two c-colorable sets in
the same graph. This problem generalizes the well-studied Independent Set
Reconfigurati... | cs.DS cs.DM math.CO | a set of vertices in a graph is ccolorable if the subgraph induced by the set has a proper ccoloring in this paper we study the problem of finding a stepbystep transformation reconfiguration between two ccolorable sets in the same graph this problem generalizes the wellstudied independent set reconfiguration problem as... | [['a', 'set', 'of', 'vertices', 'in', 'a', 'graph', 'is', 'ccolorable', 'if', 'the', 'subgraph', 'induced', 'by', 'the', 'set', 'has', 'a', 'proper', 'ccoloring', 'in', 'this', 'paper', 'we', 'study', 'the', 'problem', 'of', 'finding', 'a', 'stepbystep', 'transformation', 'reconfiguration', 'between', 'two', 'ccolorabl... | [-0.17659245541124324, 0.06239435015047283, 0.00792792489708856, 0.084979005182855, -0.12531153704689513, -0.1417996092049708, 0.08005373514863814, 0.4400155853393466, -0.3182487660282573, -0.320033569629629, 0.11556961312890053, -0.2570341339443139, -0.14603820627685202, 0.17323971993701404, -0.09473196696923222, 0.05... |
1,802.06512 | Asymmetric Modulation Design for Wireless Information and Power Transfer
with Nonlinear Energy Harvesting | Far-field wireless power transfer (WPT) and simultaneous wireless information
and power transfer (SWIPT) have become increasingly important in radio
frequency (RF) and communication communities recently. The problem of
modulation design for SWIPT has however been scarcely addressed. In this paper,
a modulation scheme... | cs.IT math.IT | farfield wireless power transfer wpt and simultaneous wireless information and power transfer swipt have become increasingly important in radio frequency rf and communication communities recently the problem of modulation design for swipt has however been scarcely addressed in this paper a modulation scheme based on as... | [['farfield', 'wireless', 'power', 'transfer', 'wpt', 'and', 'simultaneous', 'wireless', 'information', 'and', 'power', 'transfer', 'swipt', 'have', 'become', 'increasingly', 'important', 'in', 'radio', 'frequency', 'rf', 'and', 'communication', 'communities', 'recently', 'the', 'problem', 'of', 'modulation', 'design',... | [-0.2747200428070878, 0.017257804486714146, -0.02247861504391138, -0.026384758464897656, -0.10424366236563672, -0.27674197161841957, 0.07463097248802188, 0.4009731670808538, -0.2825510619503975, -0.2406528276868001, 0.06874314175267401, -0.22970464423132078, -0.1852293740682669, 0.2550180268873511, -0.09589024035223112... |
1,802.06513 | Constrained Least Squares, SDP, and QCQP Perspectives on Joint Biconvex
Radar Receiver and Waveform design | Joint radar receive filter and waveform design is non-convex, but is
individually convex for a fixed receiver filter while optimizing the waveform,
and vice versa. Such classes of problems are fre- quently encountered in
optimization, and are referred to biconvex programs. Alternating minimization
(AM) is perhaps the... | eess.SP | joint radar receive filter and waveform design is nonconvex but is individually convex for a fixed receiver filter while optimizing the waveform and vice versa such classes of problems are fre quently encountered in optimization and are referred to biconvex programs alternating minimization am is perhaps the most popu ... | [['joint', 'radar', 'receive', 'filter', 'and', 'waveform', 'design', 'is', 'nonconvex', 'but', 'is', 'individually', 'convex', 'for', 'a', 'fixed', 'receiver', 'filter', 'while', 'optimizing', 'the', 'waveform', 'and', 'vice', 'versa', 'such', 'classes', 'of', 'problems', 'are', 'fre', 'quently', 'encountered', 'in', ... | [-0.12335274628670947, 0.02478563328413597, -0.038912057050266395, 0.07970666508966436, -0.1376848957559179, -0.22528168472637927, -0.0041550411074270125, 0.3919410766269768, -0.37990025755739315, -0.3000526644009488, 0.18880104616716553, -0.2403082352442046, -0.1863114429589093, 0.17341536937244967, -0.149706538638793... |
1,802.06514 | Anti-adiabatic evolution in quantum-classical hybrid system | The adiabatic theorem is an important concept in quantum mechanics, it tells
that a quantum system subjected to gradually changing external conditions
remains to the same instantaneous eigenstate of its Hamiltonian as it initially
in. In this paper, we study the another extreme circumstance where the external
conditi... | quant-ph | the adiabatic theorem is an important concept in quantum mechanics it tells that a quantum system subjected to gradually changing external conditions remains to the same instantaneous eigenstate of its hamiltonian as it initially in in this paper we study the another extreme circumstance where the external conditions v... | [['the', 'adiabatic', 'theorem', 'is', 'an', 'important', 'concept', 'in', 'quantum', 'mechanics', 'it', 'tells', 'that', 'a', 'quantum', 'system', 'subjected', 'to', 'gradually', 'changing', 'external', 'conditions', 'remains', 'to', 'the', 'same', 'instantaneous', 'eigenstate', 'of', 'its', 'hamiltonian', 'as', 'it',... | [-0.17089784223048446, 0.19420605338821972, -0.10482263726675335, 0.046954728941243876, -0.020000405057383912, -0.11360336210389427, 0.01438181932435376, 0.3388600130391153, -0.2902359331143711, -0.2736568316931831, 0.07563276809607856, -0.2410368207981561, -0.12545362808791433, 0.16513744957638, -0.03286686473536021, ... |
1,802.06515 | Image Forensics: Detecting duplication of scientific images with
manipulation-invariant image similarity | Manipulation and re-use of images in scientific publications is a concerning
problem that currently lacks a scalable solution. Current tools for detecting
image duplication are mostly manual or semi-automated, despite the availability
of an overwhelming target dataset for a learning-based approach. This paper
address... | cs.CV | manipulation and reuse of images in scientific publications is a concerning problem that currently lacks a scalable solution current tools for detecting image duplication are mostly manual or semiautomated despite the availability of an overwhelming target dataset for a learningbased approach this paper addresses the p... | [['manipulation', 'and', 'reuse', 'of', 'images', 'in', 'scientific', 'publications', 'is', 'a', 'concerning', 'problem', 'that', 'currently', 'lacks', 'a', 'scalable', 'solution', 'current', 'tools', 'for', 'detecting', 'image', 'duplication', 'are', 'mostly', 'manual', 'or', 'semiautomated', 'despite', 'the', 'availa... | [-0.066941010899326, 0.004246239943515522, -0.05285760334582948, 0.05400849891399654, -0.10964927230573569, -0.16712434094289266, 0.03047898013755912, 0.42082429653964937, -0.27243251802994767, -0.3294785998425343, 0.10490232527606874, -0.32264567577254233, -0.14719915527894045, 0.19502082659164444, -0.1525178794044121... |
1,802.06516 | Subspace Network: Deep Multi-Task Censored Regression for Modeling
Neurodegenerative Diseases | Over the past decade a wide spectrum of machine learning models have been
developed to model the neurodegenerative diseases, associating biomarkers,
especially non-intrusive neuroimaging markers, with key clinical scores
measuring the cognitive status of patients. Multi-task learning (MTL) has been
commonly utilized ... | cs.LG cs.AI stat.ML | over the past decade a wide spectrum of machine learning models have been developed to model the neurodegenerative diseases associating biomarkers especially nonintrusive neuroimaging markers with key clinical scores measuring the cognitive status of patients multitask learning mtl has been commonly utilized by these s... | [['over', 'the', 'past', 'decade', 'a', 'wide', 'spectrum', 'of', 'machine', 'learning', 'models', 'have', 'been', 'developed', 'to', 'model', 'the', 'neurodegenerative', 'diseases', 'associating', 'biomarkers', 'especially', 'nonintrusive', 'neuroimaging', 'markers', 'with', 'key', 'clinical', 'scores', 'measuring', '... | [-0.011272914889292957, 0.0008139067166576318, -0.028176814392367525, 0.08846674943086813, -0.1273875723858681, -0.23130984728941353, 0.031840433242867325, 0.4460136236827723, -0.29419451434606675, -0.2641603655269594, 0.10102431747711298, -0.28396170918893127, -0.18976622378009894, 0.19127233442362807, -0.152005326446... |
1,802.06517 | Goal-Oriented Optimal Design of Experiments for Large-Scale Bayesian
Linear Inverse Problems | We develop a framework for goal-oriented optimal design of experiments
(GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This
framework differs from classical Bayesian optimal design of experiments (ODE)
in the following sense: we seek experimental designs that minimize the
posterior uncertai... | cs.CE math.NA math.OC stat.AP | we develop a framework for goaloriented optimal design of experiments goode for largescale bayesian linear inverse problems governed by pdes this framework differs from classical bayesian optimal design of experiments ode in the following sense we seek experimental designs that minimize the posterior uncertainty in the... | [['we', 'develop', 'a', 'framework', 'for', 'goaloriented', 'optimal', 'design', 'of', 'experiments', 'goode', 'for', 'largescale', 'bayesian', 'linear', 'inverse', 'problems', 'governed', 'by', 'pdes', 'this', 'framework', 'differs', 'from', 'classical', 'bayesian', 'optimal', 'design', 'of', 'experiments', 'ode', 'in... | [-0.07085151905339444, -0.0017303983891906682, -0.08484789097468214, 0.08523744773313714, -0.11398463616108832, -0.14445704525569453, 0.06933157385938102, 0.37657953169740116, -0.30772710537227493, -0.3256345273150752, 0.14838447594520404, -0.23341613843488934, -0.19275755531756053, 0.2099398348170022, -0.0994009047222... |
1,802.06518 | Frequency-domain gravitational waveform models for inspiraling binary
neutron stars | We develop a model for frequency-domain gravitational waveforms from
inspiraling binary neutron stars. Our waveform model is calibrated by
comparison with hybrid waveforms constructed from our latest high-precision
numerical-relativity waveforms and the SEOBNRv2T waveforms in the frequency
range of $10$--$1000\,{\rm ... | gr-qc astro-ph.HE | we develop a model for frequencydomain gravitational waveforms from inspiraling binary neutron stars our waveform model is calibrated by comparison with hybrid waveforms constructed from our latest highprecision numericalrelativity waveforms and the seobnrv2t waveforms in the frequency range of 101000rm hz we show that... | [['we', 'develop', 'a', 'model', 'for', 'frequencydomain', 'gravitational', 'waveforms', 'from', 'inspiraling', 'binary', 'neutron', 'stars', 'our', 'waveform', 'model', 'is', 'calibrated', 'by', 'comparison', 'with', 'hybrid', 'waveforms', 'constructed', 'from', 'our', 'latest', 'highprecision', 'numericalrelativity',... | [-0.1006819544678652, 0.10763672269929789, -0.014094662394276576, 0.05396906849560573, -0.019496654478931112, -0.06869055512361229, 0.04203449080845243, 0.3531993252862441, -0.16754952561796496, -0.3465313120000677, 0.06492417782152954, -0.3108969925559665, -0.09676927290611753, 0.29939287463080533, -0.0250411042499380... |
1,802.06519 | Quantum key distribution with an efficient countermeasure against
correlated intensity fluctuations in optical pulses | Quantum key distribution (QKD) allows two distant parties to share secret
keys with the proven security even in the presence of an eavesdropper with
unbounded computational power. Recently, GHz-clock decoy QKD systems have been
realized by employing ultrafast optical communication devices. However,
security loopholes... | quant-ph | quantum key distribution qkd allows two distant parties to share secret keys with the proven security even in the presence of an eavesdropper with unbounded computational power recently ghzclock decoy qkd systems have been realized by employing ultrafast optical communication devices however security loopholes of highs... | [['quantum', 'key', 'distribution', 'qkd', 'allows', 'two', 'distant', 'parties', 'to', 'share', 'secret', 'keys', 'with', 'the', 'proven', 'security', 'even', 'in', 'the', 'presence', 'of', 'an', 'eavesdropper', 'with', 'unbounded', 'computational', 'power', 'recently', 'ghzclock', 'decoy', 'qkd', 'systems', 'have', '... | [-0.25265592716138374, 0.06335193828716285, -0.11176383610385433, 0.03072281410258457, -0.017946820349323673, -0.33364825256701025, 0.08284776468229081, 0.43270504674209015, -0.2528183687237914, -0.2892962798427839, 0.08120268422508516, -0.23332404399257797, -0.0952128895691463, 0.2935844800955096, -0.162706380988193, ... |
1,802.0652 | Pricing Options with Exponential Levy Neural Network | In this paper, we propose the exponential Levy neural network (ELNN) for
option pricing, which is a new non-parametric exponential Levy model using
artificial neural networks (ANN). The ELNN fully integrates the ANNs with the
exponential Levy model, a conventional pricing model. So, the ELNN can improve
ANN-based mod... | q-fin.PR q-fin.CP q-fin.ST | in this paper we propose the exponential levy neural network elnn for option pricing which is a new nonparametric exponential levy model using artificial neural networks ann the elnn fully integrates the anns with the exponential levy model a conventional pricing model so the elnn can improve annbased models to avoid s... | [['in', 'this', 'paper', 'we', 'propose', 'the', 'exponential', 'levy', 'neural', 'network', 'elnn', 'for', 'option', 'pricing', 'which', 'is', 'a', 'new', 'nonparametric', 'exponential', 'levy', 'model', 'using', 'artificial', 'neural', 'networks', 'ann', 'the', 'elnn', 'fully', 'integrates', 'the', 'anns', 'with', 't... | [-0.0038981220148893636, -0.0027788461207650427, -0.09059839240860107, 0.14524031989727632, -0.09784070027147442, -0.21394143680240527, 0.056287661912244595, 0.4182106279876343, -0.2579958580881935, -0.2602982817419855, 0.14659487363853485, -0.24191335777124, -0.20137928353348214, 0.2007196563360996, -0.157418151257032... |
1,802.06521 | Human and Smart Machine Co-Learning with Brain Computer Interface | Machine learning has become a very popular approach for cybernetics systems,
and it has always been considered important research in the Computational
Intelligence area. Nevertheless, when it comes to smart machines, it is not
just about the methodologies. We need to consider systems and cybernetics as
well as includ... | cs.AI cs.HC | machine learning has become a very popular approach for cybernetics systems and it has always been considered important research in the computational intelligence area nevertheless when it comes to smart machines it is not just about the methodologies we need to consider systems and cybernetics as well as include human... | [['machine', 'learning', 'has', 'become', 'a', 'very', 'popular', 'approach', 'for', 'cybernetics', 'systems', 'and', 'it', 'has', 'always', 'been', 'considered', 'important', 'research', 'in', 'the', 'computational', 'intelligence', 'area', 'nevertheless', 'when', 'it', 'comes', 'to', 'smart', 'machines', 'it', 'is', ... | [-0.012315006846901627, 0.06042163892525624, -0.09088877411121862, 0.0950498160628283, -0.16434524050857152, -0.25144822495727087, 0.043995710894419136, 0.4068507869877127, -0.26164491772548765, -0.33881473477713725, 0.10876034160260158, -0.31759291509608867, -0.1629100531810452, 0.1909859058738542, -0.1385651631152144... |
1,802.06522 | Spin-Orbit Coupling Induced Resonance in an Ultracold Bose Gas | We study a two-component Bose gas with artificial spin-orbit coupling (SOC)
which couples the center-of-mass momentum of atom to its internal states. We
show that in this system resonance can be induced by tuning SOC strength. With
a two-dimensional SOC, resonances in two scattering channels can be induced by
tuning ... | cond-mat.quant-gas | we study a twocomponent bose gas with artificial spinorbit coupling soc which couples the centerofmass momentum of atom to its internal states we show that in this system resonance can be induced by tuning soc strength with a twodimensional soc resonances in two scattering channels can be induced by tuning the aspect r... | [['we', 'study', 'a', 'twocomponent', 'bose', 'gas', 'with', 'artificial', 'spinorbit', 'coupling', 'soc', 'which', 'couples', 'the', 'centerofmass', 'momentum', 'of', 'atom', 'to', 'its', 'internal', 'states', 'we', 'show', 'that', 'in', 'this', 'system', 'resonance', 'can', 'be', 'induced', 'by', 'tuning', 'soc', 'st... | [-0.22004337043351066, 0.24251871163141914, 0.027001734483443823, -0.011441401726187905, -0.016463910767924972, -0.19744220350306327, 0.04593308925783882, 0.3979149913260092, -0.2647031358986472, -0.35096874557590735, -0.061011278344570506, -0.21170499528913447, -0.157319326698295, 0.16022095959973134, 0.06858318327188... |
1,802.06523 | Casimir interaction of two dielectric half spaces with Chern-Simons
boundary layers | A diffraction problem for a flat Chern-Simons layer at plane boundary of a
dielectric half space is solved. The Casimir energy of two dielectric half
spaces with Chern-Simons layers at plane-parallel boundaries separated by a
vacuum slit is derived. Crossing from the repulsive to the attractive Casimir
force is analy... | cond-mat.mes-hall cond-mat.mtrl-sci hep-th quant-ph | a diffraction problem for a flat chernsimons layer at plane boundary of a dielectric half space is solved the casimir energy of two dielectric half spaces with chernsimons layers at planeparallel boundaries separated by a vacuum slit is derived crossing from the repulsive to the attractive casimir force is analyzed for... | [['a', 'diffraction', 'problem', 'for', 'a', 'flat', 'chernsimons', 'layer', 'at', 'plane', 'boundary', 'of', 'a', 'dielectric', 'half', 'space', 'is', 'solved', 'the', 'casimir', 'energy', 'of', 'two', 'dielectric', 'half', 'spaces', 'with', 'chernsimons', 'layers', 'at', 'planeparallel', 'boundaries', 'separated', 'b... | [-0.2094900712028754, 0.20064485385747893, -0.03482662114535687, 0.03861613103963093, -0.06239390243985215, -0.21616045919684124, -0.024852542216148302, 0.38862526428182514, -0.2657500056939542, -0.2854163459708857, 0.01330239341739204, -0.31699821221813257, -0.11759882705400185, 0.14506269475131542, 0.0367685169057578... |
1,802.06524 | Non-self-averaging behaviors and ergodicity in quenched trap model with
finite system size | Tracking tracer particles in heterogeneous environments plays an important
role in unraveling the material properties. These heterogeneous structures are
often static and depend on the sample realizations. Sample-to-sample
fluctuations of such disorder realizations sometimes become considerably large.
When we investi... | cond-mat.stat-mech | tracking tracer particles in heterogeneous environments plays an important role in unraveling the material properties these heterogeneous structures are often static and depend on the sample realizations sampletosample fluctuations of such disorder realizations sometimes become considerably large when we investigate th... | [['tracking', 'tracer', 'particles', 'in', 'heterogeneous', 'environments', 'plays', 'an', 'important', 'role', 'in', 'unraveling', 'the', 'material', 'properties', 'these', 'heterogeneous', 'structures', 'are', 'often', 'static', 'and', 'depend', 'on', 'the', 'sample', 'realizations', 'sampletosample', 'fluctuations',... | [-0.15355037837933586, 0.23148408961790223, -0.08031630069427427, 0.052248606265012945, 0.01626462662744822, -0.10574611034478594, 0.012259852526264277, 0.376577250310952, -0.23265632670724168, -0.2697108303366592, 0.11102410201159008, -0.2692505043913733, -0.1300204307098621, 0.1631949826505375, -0.033018744970911985,... |
1,802.06525 | Efficiency and power of minimally nonlinear irreversible heat engines
with broken time-reversal symmetry | We study the minimally nonlinear irreversible heat engines in which the
time-reversal symmetry for the systems may b e broken. The expressions for the
power and the efficiency are derived, in which the effects of the nonlinear
terms due to dissipations are included. We show that, as within the linear
responses, the m... | cond-mat.stat-mech | we study the minimally nonlinear irreversible heat engines in which the timereversal symmetry for the systems may b e broken the expressions for the power and the efficiency are derived in which the effects of the nonlinear terms due to dissipations are included we show that as within the linear responses the minimally... | [['we', 'study', 'the', 'minimally', 'nonlinear', 'irreversible', 'heat', 'engines', 'in', 'which', 'the', 'timereversal', 'symmetry', 'for', 'the', 'systems', 'may', 'b', 'e', 'broken', 'the', 'expressions', 'for', 'the', 'power', 'and', 'the', 'efficiency', 'are', 'derived', 'in', 'which', 'the', 'effects', 'of', 'th... | [-0.1416679578939114, 0.14766440909906206, -0.0016753882889381864, 0.035763326681758786, -0.07680607959628105, -0.12433952518569474, 0.05919564591551369, 0.30443859405138274, -0.2755211165852167, -0.2776726963718168, 0.09367249553906731, -0.31435820242305373, -0.1086920881326395, 0.24016333661380818, -0.036612955178663... |
1,802.06526 | Heron Inference for Bayesian Graphical Models | Bayesian graphical models have been shown to be a powerful tool for
discovering uncertainty and causal structure from real-world data in many
application fields. Current inference methods primarily follow different kinds
of trade-offs between computational complexity and predictive accuracy. At one
end of the spectru... | cs.LG stat.ML | bayesian graphical models have been shown to be a powerful tool for discovering uncertainty and causal structure from realworld data in many application fields current inference methods primarily follow different kinds of tradeoffs between computational complexity and predictive accuracy at one end of the spectrum vari... | [['bayesian', 'graphical', 'models', 'have', 'been', 'shown', 'to', 'be', 'a', 'powerful', 'tool', 'for', 'discovering', 'uncertainty', 'and', 'causal', 'structure', 'from', 'realworld', 'data', 'in', 'many', 'application', 'fields', 'current', 'inference', 'methods', 'primarily', 'follow', 'different', 'kinds', 'of', ... | [0.012012405183726135, -0.004774894521519881, -0.10443286077291677, 0.1339645006732929, -0.1362059153724096, -0.19819013322461287, 0.06055689251186283, 0.441284942036936, -0.2695674901731269, -0.3656075597536142, 0.11032339206648079, -0.22900141692435036, -0.12637301417056881, 0.2325819815035285, -0.10156550016684857, ... |
1,802.06527 | Salient Object Detection by Lossless Feature Reflection | Salient object detection, which aims to identify and locate the most salient
pixels or regions in images, has been attracting more and more interest due to
its various real-world applications. However, this vision task is quite
challenging, especially under complex image scenes. Inspired by the intrinsic
reflection o... | cs.CV | salient object detection which aims to identify and locate the most salient pixels or regions in images has been attracting more and more interest due to its various realworld applications however this vision task is quite challenging especially under complex image scenes inspired by the intrinsic reflection of natural... | [['salient', 'object', 'detection', 'which', 'aims', 'to', 'identify', 'and', 'locate', 'the', 'most', 'salient', 'pixels', 'or', 'regions', 'in', 'images', 'has', 'been', 'attracting', 'more', 'and', 'more', 'interest', 'due', 'to', 'its', 'various', 'realworld', 'applications', 'however', 'this', 'vision', 'task', 'i... | [-0.03114119698688366, -0.0577710253698479, -0.07428425705817403, 0.07005494989983041, -0.1520391905241869, -0.1913026924468359, -0.021006751075054775, 0.5095696970711501, -0.2442861890646, -0.331470703966548, 0.07328417899743354, -0.2728315132968972, -0.23881348318553786, 0.1639706310366787, -0.19605550157690518, 0.12... |
1,802.06528 | Scaling theory for Mott-Hubbard transitions | We present a $T=0K$ renormalization group (RG) phase diagram for the
electronic Hubbard model in two dimensions on the square lattice at, and away
from, half filling. The RG procedure treats quantum fluctuations in the single
particle occupation number nonperturbatively via the unitarily decoupling of
one electronic ... | cond-mat.str-el cond-mat.supr-con | we present a t0k renormalization group rg phase diagram for the electronic hubbard model in two dimensions on the square lattice at and away from half filling the rg procedure treats quantum fluctuations in the single particle occupation number nonperturbatively via the unitarily decoupling of one electronic state at e... | [['we', 'present', 'a', 't0k', 'renormalization', 'group', 'rg', 'phase', 'diagram', 'for', 'the', 'electronic', 'hubbard', 'model', 'in', 'two', 'dimensions', 'on', 'the', 'square', 'lattice', 'at', 'and', 'away', 'from', 'half', 'filling', 'the', 'rg', 'procedure', 'treats', 'quantum', 'fluctuations', 'in', 'the', 's... | [-0.16708195366577624, 0.24665220033170449, -0.10435050873310063, 0.0670220769187263, 0.012435724016244489, -0.17710804739725536, 0.13257835413829458, 0.325395859686951, -0.22424107144448768, -0.2540717008980681, 0.018609815532841755, -0.3567593562658186, -0.09497424653576066, 0.15253548459149896, 0.07339991980117905, ... |
1,802.06529 | Automatic supermartingales acting on sequences | This paper describes a construction of supermartingales realized as automatic
functions. A capital of supermartingales is represented using automatic capital
groups~(ACG). Properties of these automatic supermartingales are then studied.
Automatic supermartingales induce a notion of random infinite binary sequence.
We... | cs.FL | this paper describes a construction of supermartingales realized as automatic functions a capital of supermartingales is represented using automatic capital groupsacg properties of these automatic supermartingales are then studied automatic supermartingales induce a notion of random infinite binary sequence we show tha... | [['this', 'paper', 'describes', 'a', 'construction', 'of', 'supermartingales', 'realized', 'as', 'automatic', 'functions', 'a', 'capital', 'of', 'supermartingales', 'is', 'represented', 'using', 'automatic', 'capital', 'groupsacg', 'properties', 'of', 'these', 'automatic', 'supermartingales', 'are', 'then', 'studied', ... | [-0.12868270629013961, 0.12481803124627242, -0.07419233142326657, 0.12640937929973006, -0.04695369759932733, -0.10867237296994202, 0.06794960765490451, 0.43118456049034226, -0.2887086831391431, -0.19100249064369842, 0.1366792292952036, -0.20977908895852473, -0.17988686686238417, 0.19828620180487633, -0.1734888021601364... |
1,802.0653 | Alternative renormalizable minimal SO(10) GUT and the Seesaw Scale | Alternative renormalizable minimal non-SUSY SO(10) GUT model is proposed.
Instead of a ${\bf 126}$-dimensional Higgs field, a ${\bf 120}$-dimensional
Higgs filed is ntroducedin addition to a ${\bf 10}$-dimensional Higgs field and
plays a crucial role to reproduce the realistic charged fermion mass matrices.
With cont... | hep-ph | alternative renormalizable minimal nonsusy so10 gut model is proposed instead of a bf 126dimensional higgs field a bf 120dimensional higgs filed is ntroducedin addition to a bf 10dimensional higgs field and plays a crucial role to reproduce the realistic charged fermion mass matrices with contributions of bf 120 higgs ... | [['alternative', 'renormalizable', 'minimal', 'nonsusy', 'so10', 'gut', 'model', 'is', 'proposed', 'instead', 'of', 'a', 'bf', '126dimensional', 'higgs', 'field', 'a', 'bf', '120dimensional', 'higgs', 'filed', 'is', 'ntroducedin', 'addition', 'to', 'a', 'bf', '10dimensional', 'higgs', 'field', 'and', 'plays', 'a', 'cru... | [-0.15729653613992256, 0.2936896565554682, 0.02620601691167322, 0.2277925820101403, -0.16220100101609114, -0.25374120970182856, 0.005918468929605909, 0.2682929903840517, -0.12864195072267315, -0.29270187207027387, -0.03659663039563906, -0.18990181659412855, -0.08171045993626784, 0.06372694340119563, -0.0156010189600805... |
1,802.06531 | Hardy-type and Heisenberg's inequality in Morrey spaces | We use the Morrey norm estimate for the imaginary power of the Laplacian to
prove an interpolation inequality for the fractional power of the Laplacian on
Morrey spaces. We then prove a Hardy-type inequality and use it together with
the interpolation inequality to obtain a Heisenberg-type inequality in Morrey
spaces.... | math.AP | we use the morrey norm estimate for the imaginary power of the laplacian to prove an interpolation inequality for the fractional power of the laplacian on morrey spaces we then prove a hardytype inequality and use it together with the interpolation inequality to obtain a heisenbergtype inequality in morrey spaces | [['we', 'use', 'the', 'morrey', 'norm', 'estimate', 'for', 'the', 'imaginary', 'power', 'of', 'the', 'laplacian', 'to', 'prove', 'an', 'interpolation', 'inequality', 'for', 'the', 'fractional', 'power', 'of', 'the', 'laplacian', 'on', 'morrey', 'spaces', 'we', 'then', 'prove', 'a', 'hardytype', 'inequality', 'and', 'us... | [-0.07910859335213899, 0.007868998882186133, -0.1122603929467732, 0.19499315666034817, -0.11965174052864314, -0.12899833051487802, -0.004672475568950177, 0.3208318960666656, -0.36242182940244677, -0.18419433751725592, 0.17538314672885463, -0.33578632444143297, -0.10991531034582294, 0.19862419679760934, -0.1527555201575... |
1,802.06532 | Discrepancy Analysis of a New Randomized Diffusion Algorithm | For an arbitrary initial configuration of discrete loads over vertices of a
distributed graph, we consider the problem of minimizing the {\em discrepancy}
between the maximum and minimum loads among all vertices. For this problem,
this paper is concerned with the ability of natural diffusion-based iterative
algorithm... | cs.DS cs.DC | for an arbitrary initial configuration of discrete loads over vertices of a distributed graph we consider the problem of minimizing the em discrepancy between the maximum and minimum loads among all vertices for this problem this paper is concerned with the ability of natural diffusionbased iterative algorithms at each... | [['for', 'an', 'arbitrary', 'initial', 'configuration', 'of', 'discrete', 'loads', 'over', 'vertices', 'of', 'a', 'distributed', 'graph', 'we', 'consider', 'the', 'problem', 'of', 'minimizing', 'the', 'em', 'discrepancy', 'between', 'the', 'maximum', 'and', 'minimum', 'loads', 'among', 'all', 'vertices', 'for', 'this',... | [-0.15499816432054486, 0.10645342217626862, -0.02514452292854267, 0.009121746279209132, -0.08194166453435056, -0.20357337201374673, 0.1186356023855267, 0.4029487004007904, -0.2768274439228398, -0.345868094175333, 0.06618939838447277, -0.28407110568556576, -0.130007929624539, 0.10751417709304201, -0.0886289054678092, 0.... |
1,802.06533 | Arc spaces and chiral symplectic cores | We introduce the notion of chiral symplectic cores in a vertex Poisson
variety, which can be viewed as analogs of symplectic leaves in Poisson
varieties. As an application we show that any quasi-lisse vertex algebra is a
quantization of the arc space of its associated variety, in the sense that its
reduced singular s... | math.RT math.AG | we introduce the notion of chiral symplectic cores in a vertex poisson variety which can be viewed as analogs of symplectic leaves in poisson varieties as an application we show that any quasilisse vertex algebra is a quantization of the arc space of its associated variety in the sense that its reduced singular support... | [['we', 'introduce', 'the', 'notion', 'of', 'chiral', 'symplectic', 'cores', 'in', 'a', 'vertex', 'poisson', 'variety', 'which', 'can', 'be', 'viewed', 'as', 'analogs', 'of', 'symplectic', 'leaves', 'in', 'poisson', 'varieties', 'as', 'an', 'application', 'we', 'show', 'that', 'any', 'quasilisse', 'vertex', 'algebra', ... | [-0.1723530662774637, 0.057150544229656805, -0.07667651467511917, 0.008753630334746328, -0.12131589555038928, -0.07548497753167474, -0.017685911853101338, 0.3633817470556981, -0.3592771318749533, -0.1652592579657967, 0.10431758403727734, -0.21046099924222306, -0.16073304432368762, 0.17179153012195686, -0.13044549287338... |
1,802.06534 | A Simple and Effective Solution to the Constrained QM/MM Simulations | It is a promising extension of the quantum mechanical/molecular mechanical
(QM/MM) approach to incorporate the solvent molecules surrounding the QM solute
into the QM region to ensure the adequate description of the electronic
polarization of the solute. However, the solvent molecules in the QM region
inevitably diff... | cond-mat.soft physics.chem-ph | it is a promising extension of the quantum mechanicalmolecular mechanical qmmm approach to incorporate the solvent molecules surrounding the qm solute into the qm region to ensure the adequate description of the electronic polarization of the solute however the solvent molecules in the qm region inevitably diffuse into... | [['it', 'is', 'a', 'promising', 'extension', 'of', 'the', 'quantum', 'mechanicalmolecular', 'mechanical', 'qmmm', 'approach', 'to', 'incorporate', 'the', 'solvent', 'molecules', 'surrounding', 'the', 'qm', 'solute', 'into', 'the', 'qm', 'region', 'to', 'ensure', 'the', 'adequate', 'description', 'of', 'the', 'electroni... | [-0.08198450251167577, 0.07892396144353288, -0.10493078238373114, 0.026319006095714442, 0.004955292648678137, -0.12097090645269915, 0.05818474666659974, 0.35635725071399726, -0.2680072430627082, -0.3037301888096739, 0.017053942469117993, -0.26532901537350634, -0.11243817072298208, 0.10937014713206074, -0.02641506199010... |
1,802.06535 | The long-period massive binary HD~54662 revisited | HD54662 is an O-type binary star belonging to the CMa OB1 association. Due to
its long-period orbit, this system is an interesting target to test the
adiabatic wind shock model. The goal is to improve our knowledge of the orbital
and stellar parameters of HD54662 and to analyze its X-ray emission to test the
theoreti... | astro-ph.SR | hd54662 is an otype binary star belonging to the cma ob1 association due to its longperiod orbit this system is an interesting target to test the adiabatic wind shock model the goal is to improve our knowledge of the orbital and stellar parameters of hd54662 and to analyze its xray emission to test the theoretical scal... | [['hd54662', 'is', 'an', 'otype', 'binary', 'star', 'belonging', 'to', 'the', 'cma', 'ob1', 'association', 'due', 'to', 'its', 'longperiod', 'orbit', 'this', 'system', 'is', 'an', 'interesting', 'target', 'to', 'test', 'the', 'adiabatic', 'wind', 'shock', 'model', 'the', 'goal', 'is', 'to', 'improve', 'our', 'knowledge... | [-0.07140584320937231, 0.09975392471977991, -0.07361042420548869, 0.11915253298572286, -0.09956044415181053, -0.07534504980432859, 0.06707640022051709, 0.44516758917655685, -0.21921737195014118, -0.35018823169503766, 0.053203207664283936, -0.27996206907832094, 0.015824137820336637, 0.2033588459520069, -0.02287378436797... |
1,802.06536 | Ferromagnetic Peierls insulator state in
$\mathit{A}$Mg$_4$Mn$_6$O$_{15}$ ($\mathit{A}$ = K, Rb, Cs) | Using the density-functional-theory based electronic structure calculations,
we study the electronic state of recently discovered mixed-valent manganese
oxides $A$Mg$_4$Mn$_6$O$_{15}$ ($A=$ K, Rb, Cs), which are fully spin-polarized
ferromagnetic insulators with a cubic crystal structure. We show that the
system may ... | cond-mat.str-el cond-mat.mtrl-sci | using the densityfunctionaltheory based electronic structure calculations we study the electronic state of recently discovered mixedvalent manganese oxides amg_4mn_6o_15 a k rb cs which are fully spinpolarized ferromagnetic insulators with a cubic crystal structure we show that the system may be described as a threedim... | [['using', 'the', 'densityfunctionaltheory', 'based', 'electronic', 'structure', 'calculations', 'we', 'study', 'the', 'electronic', 'state', 'of', 'recently', 'discovered', 'mixedvalent', 'manganese', 'oxides', 'amg_4mn_6o_15', 'a', 'k', 'rb', 'cs', 'which', 'are', 'fully', 'spinpolarized', 'ferromagnetic', 'insulator... | [-0.1961436604500038, 0.1763544498048354, -0.008518354487743709, 0.0012937221620785127, -0.02746721654484915, -0.13727270088407514, 0.08206106643054155, 0.43656143542416026, -0.28203028857265366, -0.2576938535796829, 0.02769289015317428, -0.306329482548529, -0.13743614883042207, 0.1081819914461178, 0.10433713035049415,... |
1,802.06537 | Average Behavior of Minimal Free Resolutions of Monomial Ideals | We describe the typical homological properties of monomial ideals defined by
random generating sets. We show that, under mild assumptions, random monomial
ideals (RMI's) will almost always have resolutions of maximal length; that is,
the projective dimension will almost always be $n$, where $n$ is the number of
varia... | math.AC math.CO math.PR | we describe the typical homological properties of monomial ideals defined by random generating sets we show that under mild assumptions random monomial ideals rmis will almost always have resolutions of maximal length that is the projective dimension will almost always be n where n is the number of variables in the pol... | [['we', 'describe', 'the', 'typical', 'homological', 'properties', 'of', 'monomial', 'ideals', 'defined', 'by', 'random', 'generating', 'sets', 'we', 'show', 'that', 'under', 'mild', 'assumptions', 'random', 'monomial', 'ideals', 'rmis', 'will', 'almost', 'always', 'have', 'resolutions', 'of', 'maximal', 'length', 'tha... | [-0.18651196060658204, 0.13996206344699755, -0.06810738031539744, 0.06837536064691578, -0.0749086365910379, -0.19325153439445056, -0.03442827070967888, 0.35520571362095205, -0.3030641985338504, -0.20190028688232378, 0.11040178986585251, -0.25911674533391327, -0.13663923464656816, 0.2023882956567631, -0.1220358992362116... |
1,802.06538 | Link Selection for Secure Cooperative Networks with Buffer-Aided
Relaying | This paper investigates the secure communication in a two-hop cooperative
wireless network, where a buffer-aided relay is utilized to forward data from
the source to destination, and a passive eavesdropper attempts to intercept
data transmission from both the source and relay. Depending on the availability
of instant... | cs.IT math.IT | this paper investigates the secure communication in a twohop cooperative wireless network where a bufferaided relay is utilized to forward data from the source to destination and a passive eavesdropper attempts to intercept data transmission from both the source and relay depending on the availability of instantaneous ... | [['this', 'paper', 'investigates', 'the', 'secure', 'communication', 'in', 'a', 'twohop', 'cooperative', 'wireless', 'network', 'where', 'a', 'bufferaided', 'relay', 'is', 'utilized', 'to', 'forward', 'data', 'from', 'the', 'source', 'to', 'destination', 'and', 'a', 'passive', 'eavesdropper', 'attempts', 'to', 'interce... | [-0.2858543680784391, -0.07204410618993157, -0.014139170373410153, 0.021305893134200872, -0.058068405905759284, -0.2916132261034871, 0.1807368485707082, 0.40755800117722935, -0.2534333438815435, -0.24703086689426745, 0.09187298213839323, -0.2736780412765688, -0.1766608678969924, 0.13484998982771712, -0.1206682504814211... |
1,802.06539 | Existence of cocompact lattices in Lie groups with a bi-invariant metric
of index 2 | We study the existence of cocompact lattices in Lie groups with bi-invariant
metric of signature $(2,n-2)$. We assume in addition that the Lie groups under
consideration are simply-connected, indecomposable and solvable. Then their
centre is one- or two-dimensional. In both cases, a parametrisation of the set
of such... | math.DG | we study the existence of cocompact lattices in lie groups with biinvariant metric of signature 2n2 we assume in addition that the lie groups under consideration are simplyconnected indecomposable and solvable then their centre is one or twodimensional in both cases a parametrisation of the set of such lie groups is kn... | [['we', 'study', 'the', 'existence', 'of', 'cocompact', 'lattices', 'in', 'lie', 'groups', 'with', 'biinvariant', 'metric', 'of', 'signature', '2n2', 'we', 'assume', 'in', 'addition', 'that', 'the', 'lie', 'groups', 'under', 'consideration', 'are', 'simplyconnected', 'indecomposable', 'and', 'solvable', 'then', 'their'... | [-0.1987193492014052, 0.10551796697659373, -0.05396841853720749, 0.0649919286852975, -0.11771070993528134, -0.11219023456001972, 0.020632539537917004, 0.41957837602169046, -0.2613108304226998, -0.24420782286537493, 0.16391470282702003, -0.2257410717482832, -0.1528100998647704, 0.19770259516052446, -0.07934701158210816,... |
1,802.0654 | Generalized perspective on chiral measurements without magnetic
interactions | We present a unified description of several methods of chiral discrimination
based exclusively on electric-dipole interactions. It includes photoelectron
circular dichroism (PECD), enantio-sensitive microwave spectroscopy (EMWS),
photoexcitation circular dichroism (PXCD), and photoelectron-photoexcitation
circular di... | physics.atom-ph physics.atm-clus physics.chem-ph physics.optics quant-ph | we present a unified description of several methods of chiral discrimination based exclusively on electricdipole interactions it includes photoelectron circular dichroism pecd enantiosensitive microwave spectroscopy emws photoexcitation circular dichroism pxcd and photoelectronphotoexcitation circular dichroism pxecd w... | [['we', 'present', 'a', 'unified', 'description', 'of', 'several', 'methods', 'of', 'chiral', 'discrimination', 'based', 'exclusively', 'on', 'electricdipole', 'interactions', 'it', 'includes', 'photoelectron', 'circular', 'dichroism', 'pecd', 'enantiosensitive', 'microwave', 'spectroscopy', 'emws', 'photoexcitation', ... | [-0.1457293385587212, 0.18016242498396745, -0.0695472974335046, 0.026037231418153933, -0.062867735268458, -0.08958205696035293, 0.0011947994691229636, 0.3869001037260938, -0.2387531671950954, -0.2571352699155649, 0.041337778320256244, -0.2702932696631779, -0.16878638824451744, 0.15067152649956575, 0.051872268218674786,... |
1,802.06541 | Electroweak probes with ATLAS | Measuring electroweak bosons in relativistic heavy ion collisions at high
energy provide an opportunity to understand temporal evolution of the
quark-gluon plasma created in such collisions by constraining the initial state
of the interaction. Due to lack of color charges the bosons and or particles
produced in their... | nucl-ex | measuring electroweak bosons in relativistic heavy ion collisions at high energy provide an opportunity to understand temporal evolution of the quarkgluon plasma created in such collisions by constraining the initial state of the interaction due to lack of color charges the bosons and or particles produced in their lep... | [['measuring', 'electroweak', 'bosons', 'in', 'relativistic', 'heavy', 'ion', 'collisions', 'at', 'high', 'energy', 'provide', 'an', 'opportunity', 'to', 'understand', 'temporal', 'evolution', 'of', 'the', 'quarkgluon', 'plasma', 'created', 'in', 'such', 'collisions', 'by', 'constraining', 'the', 'initial', 'state', 'o... | [-0.0655346403196454, 0.22470168487034972, -0.1255266796182841, 0.14739507939134638, -0.0058526203241199256, -0.12000091403536499, -0.02238375817751512, 0.32574764579627663, -0.23402793426439167, -0.3100316506177187, -0.00251682454184629, -0.3272761066220701, 0.055999575268942864, 0.09767130828043447, 0.049606836177408... |
1,802.06542 | Seismic Cross-coupling Noise in Torsion Pendulums | Detection of low frequency gravitational waves around 0.1 Hz is one of the
important targets for future gravitational wave observation. One of the main
sources of the expected signals is gravi- tational waves from binary
intermediate-mass black hole coalescences which is proposed as one of the
formation scenarios of ... | physics.ins-det | detection of low frequency gravitational waves around 01 hz is one of the important targets for future gravitational wave observation one of the main sources of the expected signals is gravi tational waves from binary intermediatemass black hole coalescences which is proposed as one of the formation scenarios of superm... | [['detection', 'of', 'low', 'frequency', 'gravitational', 'waves', 'around', '01', 'hz', 'is', 'one', 'of', 'the', 'important', 'targets', 'for', 'future', 'gravitational', 'wave', 'observation', 'one', 'of', 'the', 'main', 'sources', 'of', 'the', 'expected', 'signals', 'is', 'gravi', 'tational', 'waves', 'from', 'bina... | [-0.16924695110825635, 0.1419220830427197, -0.03567816542027883, 0.05031527267034762, -0.10411430662128306, -0.11559602569187523, 0.03721400229420473, 0.34161087272383234, -0.22487177405686232, -0.32484658976287517, 0.10722345025056884, -0.2777337865243671, -0.14861499861119284, 0.26269429545139983, -0.0767726493166592... |
1,802.06543 | Optimal Beamforming for Physical Layer Security in MISO Wireless
Networks | A wireless network of multiple transmitter-user pairs overheard by an
eavesdropper, where the transmitters are equipped with multiple antennas while
the users and eavesdropper are equipped with a single antenna, is considered.
At different levels of wireless channel knowledge, the problem of interest is
beamforming t... | cs.IT math.IT | a wireless network of multiple transmitteruser pairs overheard by an eavesdropper where the transmitters are equipped with multiple antennas while the users and eavesdropper are equipped with a single antenna is considered at different levels of wireless channel knowledge the problem of interest is beamforming to optim... | [['a', 'wireless', 'network', 'of', 'multiple', 'transmitteruser', 'pairs', 'overheard', 'by', 'an', 'eavesdropper', 'where', 'the', 'transmitters', 'are', 'equipped', 'with', 'multiple', 'antennas', 'while', 'the', 'users', 'and', 'eavesdropper', 'are', 'equipped', 'with', 'a', 'single', 'antenna', 'is', 'considered',... | [-0.29213796032233796, -0.014959456064656094, 0.045860493166901925, 0.014552744291913017, -0.12507481406946933, -0.29130905466378504, 0.07310228714604067, 0.42800462433914527, -0.2794353058647125, -0.30251856320836673, 0.09404950859580496, -0.2879169427687217, -0.1608915884974797, 0.12924742865923006, -0.15396056308863... |
1,802.06544 | Cooperative ligation breaks sequence symmetry and stabilizes early
molecular replication | Each living species carries a complex DNA sequence that determines their
unique features and functionalities. It is generally assumed that life started
from a random pool of oligonucleotides sequences, generated by a prebiotic
polymerization of nucleotides. The mechanism that initially facilitated the
emergence of se... | physics.bio-ph q-bio.BM | each living species carries a complex dna sequence that determines their unique features and functionalities it is generally assumed that life started from a random pool of oligonucleotides sequences generated by a prebiotic polymerization of nucleotides the mechanism that initially facilitated the emergence of sequenc... | [['each', 'living', 'species', 'carries', 'a', 'complex', 'dna', 'sequence', 'that', 'determines', 'their', 'unique', 'features', 'and', 'functionalities', 'it', 'is', 'generally', 'assumed', 'that', 'life', 'started', 'from', 'a', 'random', 'pool', 'of', 'oligonucleotides', 'sequences', 'generated', 'by', 'a', 'prebio... | [-0.13557269625273285, 0.2032806084578303, -0.07778925341314308, 0.04652146102289541, -0.04655352923916379, -0.16124593681803057, 0.09527757380419644, 0.3690594795950935, -0.31844272322761, -0.27857927998925064, 0.05688761282769573, -0.2395339569542129, -0.17946114060374813, 0.14089284035863409, -0.03306214227546554, -... |
1,802.06545 | Upper and lower bounds for dynamic data structures on strings | We consider a range of simply stated dynamic data structure problems on
strings. An update changes one symbol in the input and a query asks us to
compute some function of the pattern of length $m$ and a substring of a longer
text. We give both conditional and unconditional lower bounds for variants of
exact matching ... | cs.DS cs.CC | we consider a range of simply stated dynamic data structure problems on strings an update changes one symbol in the input and a query asks us to compute some function of the pattern of length m and a substring of a longer text we give both conditional and unconditional lower bounds for variants of exact matching with w... | [['we', 'consider', 'a', 'range', 'of', 'simply', 'stated', 'dynamic', 'data', 'structure', 'problems', 'on', 'strings', 'an', 'update', 'changes', 'one', 'symbol', 'in', 'the', 'input', 'and', 'a', 'query', 'asks', 'us', 'to', 'compute', 'some', 'function', 'of', 'the', 'pattern', 'of', 'length', 'm', 'and', 'a', 'sub... | [-0.1593277447557609, 0.06329205164404682, -0.043581318555100425, 0.11372922328155255, -0.0844556385730227, -0.1309945586295466, 0.10429191977371895, 0.38222224309408503, -0.30968643382844413, -0.33031411740064087, 0.1462335399607712, -0.2400446777754561, -0.1317526245256886, 0.21863565567348683, -0.08740106834089342, ... |
1,802.06546 | A spectral interpolation scheme on the unit sphere based on the nodes of
spherical Lissajous curves | For sampling values along spherical Lissajous curves we establish a spectral
interpolation and quadrature scheme on the sphere. We provide a mathematical
analysis of spherical Lissajous curves and study the characteristic properties
of their intersection points. Based on a discrete orthogonality structure we
are able... | math.NA | for sampling values along spherical lissajous curves we establish a spectral interpolation and quadrature scheme on the sphere we provide a mathematical analysis of spherical lissajous curves and study the characteristic properties of their intersection points based on a discrete orthogonality structure we are able to ... | [['for', 'sampling', 'values', 'along', 'spherical', 'lissajous', 'curves', 'we', 'establish', 'a', 'spectral', 'interpolation', 'and', 'quadrature', 'scheme', 'on', 'the', 'sphere', 'we', 'provide', 'a', 'mathematical', 'analysis', 'of', 'spherical', 'lissajous', 'curves', 'and', 'study', 'the', 'characteristic', 'pro... | [-0.12148279947621271, -0.0102531997212026, -0.17702296185730534, 0.08788345379404693, -0.0941577307217993, -0.09577934914614913, 0.0914176128631985, 0.39941562056803137, -0.27620190033335085, -0.2298707434395713, 0.12575284715968932, -0.21123444151014478, -0.18784431005445162, 0.2626782459291545, -0.07546591124264523,... |
1,802.06547 | Weighted Linear Discriminant Analysis based on Class Saliency
Information | In this paper, we propose a new variant of Linear Discriminant Analysis to
overcome underlying drawbacks of traditional LDA and other LDA variants
targeting problems involving imbalanced classes. Traditional LDA sets
assumptions related to Gaussian class distribution and neglects influence of
outlier classes, that mi... | cs.CV | in this paper we propose a new variant of linear discriminant analysis to overcome underlying drawbacks of traditional lda and other lda variants targeting problems involving imbalanced classes traditional lda sets assumptions related to gaussian class distribution and neglects influence of outlier classes that might h... | [['in', 'this', 'paper', 'we', 'propose', 'a', 'new', 'variant', 'of', 'linear', 'discriminant', 'analysis', 'to', 'overcome', 'underlying', 'drawbacks', 'of', 'traditional', 'lda', 'and', 'other', 'lda', 'variants', 'targeting', 'problems', 'involving', 'imbalanced', 'classes', 'traditional', 'lda', 'sets', 'assumptio... | [-0.004003483968976457, -0.08260734592753965, -0.107441885166068, 0.14410183302938642, -0.14493244976645944, -0.17988336948364708, 0.05641022170543572, 0.43163389283998876, -0.33144453176157135, -0.2921755438035898, 0.06542656400686014, -0.30826300809539, -0.17982830168201333, 0.1652685722358838, -0.19386692939787709, ... |
1,802.06548 | Level Zero Trigger Processor for the NA62 experiment | The NA62 experiment is designed to measure the ultra-rare decay $K^+
\rightarrow \pi^+ \nu \bar{\nu}$ branching ratio with a precision of $\sim
10\%$ at the CERN Super Proton Synchrotron (SPS). The trigger system of NA62
consists in three different levels designed to select events of physics
interest in a high beam r... | physics.ins-det hep-ex | the na62 experiment is designed to measure the ultrarare decay k rightarrow pi nu barnu branching ratio with a precision of sim 10 at the cern super proton synchrotron sps the trigger system of na62 consists in three different levels designed to select events of physics interest in a high beam rate environment the l0 t... | [['the', 'na62', 'experiment', 'is', 'designed', 'to', 'measure', 'the', 'ultrarare', 'decay', 'k', 'rightarrow', 'pi', 'nu', 'barnu', 'branching', 'ratio', 'with', 'a', 'precision', 'of', 'sim', '10', 'at', 'the', 'cern', 'super', 'proton', 'synchrotron', 'sps', 'the', 'trigger', 'system', 'of', 'na62', 'consists', 'i... | [-0.15921322857141368, 0.13818281180050956, -0.06039932659151007, 0.042449822353803, -0.03462514756289927, -0.19483093544282656, 0.05199354757303925, 0.35533236780259164, -0.22616884534855344, -0.3446509043205546, 0.09844946908311637, -0.2987011776871333, -0.02512479684322001, 0.2429096337480122, -0.008978528119453556,... |
1,802.06549 | Thermodynamics of energy, charge and spin currents in thermoelectric
quantum-dot spin valve | We provide a thermodynamically consistent description of energy, charge and
spin transfers in a thermoelectric quantum-dot spin valve in the collinear
configuration based on nonequilibrium Green's function and full counting
statistics. We use the fluctuation theorem symmetry and the concept of entropy
production to c... | cond-mat.mes-hall cond-mat.stat-mech | we provide a thermodynamically consistent description of energy charge and spin transfers in a thermoelectric quantumdot spin valve in the collinear configuration based on nonequilibrium greens function and full counting statistics we use the fluctuation theorem symmetry and the concept of entropy production to charact... | [['we', 'provide', 'a', 'thermodynamically', 'consistent', 'description', 'of', 'energy', 'charge', 'and', 'spin', 'transfers', 'in', 'a', 'thermoelectric', 'quantumdot', 'spin', 'valve', 'in', 'the', 'collinear', 'configuration', 'based', 'on', 'nonequilibrium', 'greens', 'function', 'and', 'full', 'counting', 'statis... | [-0.10138749741402102, 0.13333098131042082, -0.10741770854762313, 0.06458338422958458, -0.054910712563477966, -0.1199411753818248, 0.08179085422533303, 0.3448913618198876, -0.27830209666682243, -0.2662252659448287, 0.017200415816103803, -0.31478103255690304, -0.10926450807736843, 0.17684858254138922, 0.0071161927573961... |
1,802.0655 | Non-perturbative results for the luminosity and area distances | The notion of luminosity distance is most often defined in purely FLRW
(Friedmann-Lemaitre-Robertson-Walker) cosmological spacetimes, or small
perturbations thereof. However, the abstract notion of luminosity distance is
actually much more robust than this, and can be defined non-perturbatively in
almost arbitrary sp... | gr-qc astro-ph.CO | the notion of luminosity distance is most often defined in purely flrw friedmannlemaitrerobertsonwalker cosmological spacetimes or small perturbations thereof however the abstract notion of luminosity distance is actually much more robust than this and can be defined nonperturbatively in almost arbitrary spacetimes som... | [['the', 'notion', 'of', 'luminosity', 'distance', 'is', 'most', 'often', 'defined', 'in', 'purely', 'flrw', 'friedmannlemaitrerobertsonwalker', 'cosmological', 'spacetimes', 'or', 'small', 'perturbations', 'thereof', 'however', 'the', 'abstract', 'notion', 'of', 'luminosity', 'distance', 'is', 'actually', 'much', 'mor... | [-0.13353803953087545, 0.1146198395138566, -0.0874565160831243, 0.1390012687294549, -0.12411721338234517, -0.1358273437371795, -0.011704910883766032, 0.3333319412701277, -0.26046140484686475, -0.2578086098352366, 0.09115447116757582, -0.2943817355933235, -0.14771881020557054, 0.20013015488360036, -0.08260837309669865, ... |
1,802.06551 | Verifying Semantic Conflict-Freedom in Three-Way Program Merges | Even though many programmers rely on 3-way merge tools to integrate changes
from different branches, such tools can introduce subtle bugs in the
integration process. This paper aims to mitigate this problem by defining a
semantic notion of confict-freedom, which ensures that the merged program does
not introduce new ... | cs.PL | even though many programmers rely on 3way merge tools to integrate changes from different branches such tools can introduce subtle bugs in the integration process this paper aims to mitigate this problem by defining a semantic notion of confictfreedom which ensures that the merged program does not introduce new unwante... | [['even', 'though', 'many', 'programmers', 'rely', 'on', '3way', 'merge', 'tools', 'to', 'integrate', 'changes', 'from', 'different', 'branches', 'such', 'tools', 'can', 'introduce', 'subtle', 'bugs', 'in', 'the', 'integration', 'process', 'this', 'paper', 'aims', 'to', 'mitigate', 'this', 'problem', 'by', 'defining', ... | [-0.06544557113496315, 0.01178949031746015, -0.13802236180054023, 0.11708358015998784, -0.16070127760370573, -0.1563688768655993, 0.06997537761829638, 0.3739016520480315, -0.2934504299191758, -0.3360925044553975, 0.05290976838344553, -0.2576238999453684, -0.1922938634486248, 0.23120078762682775, -0.10846962666837498, 0... |
1,802.06552 | Are Generative Classifiers More Robust to Adversarial Attacks? | There is a rising interest in studying the robustness of deep neural network
classifiers against adversaries, with both advanced attack and defence
techniques being actively developed. However, most recent work focuses on
discriminative classifiers, which only model the conditional distribution of
the labels given th... | cs.LG stat.ML | there is a rising interest in studying the robustness of deep neural network classifiers against adversaries with both advanced attack and defence techniques being actively developed however most recent work focuses on discriminative classifiers which only model the conditional distribution of the labels given the inpu... | [['there', 'is', 'a', 'rising', 'interest', 'in', 'studying', 'the', 'robustness', 'of', 'deep', 'neural', 'network', 'classifiers', 'against', 'adversaries', 'with', 'both', 'advanced', 'attack', 'and', 'defence', 'techniques', 'being', 'actively', 'developed', 'however', 'most', 'recent', 'work', 'focuses', 'on', 'di... | [0.0021027601043377736, -0.022150906310084144, -0.06324444981458198, 0.1243351595309962, -0.0945357220501007, -0.28785641249019783, 0.0633444952057159, 0.44458426945493557, -0.20582374880593438, -0.2977694481877344, 0.057894715061203375, -0.29538136131928433, -0.26736984566585825, 0.17752202373685577, -0.16998295395335... |
1,802.06553 | On the quantum improved Schwarzschild black hole | Deriving the gravitational effective action directly from exact
renormalization group is very complicated, if not impossible. Hence, to study
the effects of running gravitational coupling which tends to a non--Gaussian UV
fixed point (as it is supposed by the asymptotic safety conjecture), two steps
are usually adopt... | gr-qc | deriving the gravitational effective action directly from exact renormalization group is very complicated if not impossible hence to study the effects of running gravitational coupling which tends to a nongaussian uv fixed point as it is supposed by the asymptotic safety conjecture two steps are usually adopted cutoff ... | [['deriving', 'the', 'gravitational', 'effective', 'action', 'directly', 'from', 'exact', 'renormalization', 'group', 'is', 'very', 'complicated', 'if', 'not', 'impossible', 'hence', 'to', 'study', 'the', 'effects', 'of', 'running', 'gravitational', 'coupling', 'which', 'tends', 'to', 'a', 'nongaussian', 'uv', 'fixed',... | [-0.1462382414256031, 0.12405304155305874, -0.11748713972575381, 0.09613297205064975, -0.1271461532764956, -0.14818249051690313, -0.00998059932905388, 0.3230960100413637, -0.21750093029204307, -0.3061881374686639, 0.11477962117113755, -0.25276786603978074, -0.14257127081839935, 0.14901649093929123, -0.02876258994195055... |
1,802.06554 | Speed Limit for Classical Stochastic Processes | Speed limit for classical stochastic Markov processes with discrete states is
studied. We find that a trade-off inequality exists between the speed of the
state transformation and the entropy production. The dynamical activity
determines the time scale and plays a crucial role in the inequality. For
systems with stat... | cond-mat.stat-mech quant-ph | speed limit for classical stochastic markov processes with discrete states is studied we find that a tradeoff inequality exists between the speed of the state transformation and the entropy production the dynamical activity determines the time scale and plays a crucial role in the inequality for systems with stationary... | [['speed', 'limit', 'for', 'classical', 'stochastic', 'markov', 'processes', 'with', 'discrete', 'states', 'is', 'studied', 'we', 'find', 'that', 'a', 'tradeoff', 'inequality', 'exists', 'between', 'the', 'speed', 'of', 'the', 'state', 'transformation', 'and', 'the', 'entropy', 'production', 'the', 'dynamical', 'activi... | [-0.14418823844012382, 0.1478940551380881, -0.11812286248790439, 0.10903948962169868, -0.011989828199148178, -0.15597014390964017, 0.0912221548020501, 0.2872457255355336, -0.28210924129995296, -0.2963997727598656, 0.07476970833853226, -0.28293312062636355, -0.10103284784550355, 0.2285745828253725, -0.031233023486989128... |
1,802.06555 | On an Algebraic Structure of Dimensionally Reduced Magical Supergravity
Theories | We study an algebraic structure of magical supergravities in three
dimensions. We show that if the commutation relations among the generators of
the quasi-conformal group in the super-Ehlers decomposition are in a particular
form, then one can always find a parameterization of the group element in terms
of various 3d... | hep-th | we study an algebraic structure of magical supergravities in three dimensions we show that if the commutation relations among the generators of the quasiconformal group in the superehlers decomposition are in a particular form then one can always find a parameterization of the group element in terms of various 3d boson... | [['we', 'study', 'an', 'algebraic', 'structure', 'of', 'magical', 'supergravities', 'in', 'three', 'dimensions', 'we', 'show', 'that', 'if', 'the', 'commutation', 'relations', 'among', 'the', 'generators', 'of', 'the', 'quasiconformal', 'group', 'in', 'the', 'superehlers', 'decomposition', 'are', 'in', 'a', 'particular... | [-0.14098034701531842, 0.1052072395586514, -0.07587399641938862, 0.09008082957006991, -0.10945373203694111, -0.09169319990859737, -0.030927042550747356, 0.31179616512362995, -0.2199837967369055, -0.2634729628953787, 0.06202268291316512, -0.25413601797088864, -0.21703766726164353, 0.169444213961325, -0.06356676021916052... |
1,802.06556 | Plasma boosted electron beams for driving Free Electron Lasers | In this paper, we report results of simulations, in the framework of both
EuPRAXIA \cite{Walk2017} and EuPRAXIA@SPARC\_LAB \cite{Ferr2017} projects,
aimed at delivering a high brightness electron bunch for driving a Free
Electron Laser (FEL) by employing a plasma post acceleration scheme. The
boosting plasma wave is ... | physics.acc-ph | in this paper we report results of simulations in the framework of both eupraxia citewalk2017 and eupraxiasparc_lab citeferr2017 projects aimed at delivering a high brightness electron bunch for driving a free electron laser fel by employing a plasma post acceleration scheme the boosting plasma wave is driven by a tens... | [['in', 'this', 'paper', 'we', 'report', 'results', 'of', 'simulations', 'in', 'the', 'framework', 'of', 'both', 'eupraxia', 'citewalk2017', 'and', 'eupraxiasparc_lab', 'citeferr2017', 'projects', 'aimed', 'at', 'delivering', 'a', 'high', 'brightness', 'electron', 'bunch', 'for', 'driving', 'a', 'free', 'electron', 'la... | [-0.0728850140471549, 0.2045660119089082, -0.07402241070149947, 0.022851580137041274, 0.01657634199904182, -0.13712315495034738, 0.015333881055619376, 0.45435914109201775, -0.21323301495513736, -0.34736442909643206, 0.0191332081851271, -0.28749584683130697, 0.06838349247178466, 0.3130236072369765, 0.0010114712328602052... |
1,802.06557 | Symmetry and Contextuality | The general concept of symmetry is realized in manifold ways in different
realms of reality, such as plants, animals, minerals, mathematical objects or
human artefacts in literature, fine arts and society. In order to arrive at a
common ground for this variedness a very general conceptualization of symmetry
is propos... | physics.hist-ph | the general concept of symmetry is realized in manifold ways in different realms of reality such as plants animals minerals mathematical objects or human artefacts in literature fine arts and society in order to arrive at a common ground for this variedness a very general conceptualization of symmetry is proposed exist... | [['the', 'general', 'concept', 'of', 'symmetry', 'is', 'realized', 'in', 'manifold', 'ways', 'in', 'different', 'realms', 'of', 'reality', 'such', 'as', 'plants', 'animals', 'minerals', 'mathematical', 'objects', 'or', 'human', 'artefacts', 'in', 'literature', 'fine', 'arts', 'and', 'society', 'in', 'order', 'to', 'arr... | [-0.10893283285634336, 0.13129737993812762, -0.0954766394057241, 0.09832653891099917, -0.14291081093351848, -0.11192079639232527, 0.04913363784366358, 0.36088250024664786, -0.2586658675278667, -0.32254359379075265, 0.07773075983746938, -0.23715344383268647, -0.18544112780489408, 0.10473424934228802, -0.1125589936748848... |
1,802.06558 | Slowest kinetic modes revealed by metabasin renormalization | Understanding the slowest relaxations of complex systems, such as relaxation
of glass-forming materials, diffusion in nanoclusters, and folding of
biomolecules, is important for physics, chemistry, and biology. For a kinetic
system, the relaxation modes are determined by diagonalizing its transition
rate matrix. Howe... | cond-mat.mes-hall cond-mat.dis-nn | understanding the slowest relaxations of complex systems such as relaxation of glassforming materials diffusion in nanoclusters and folding of biomolecules is important for physics chemistry and biology for a kinetic system the relaxation modes are determined by diagonalizing its transition rate matrix however for real... | [['understanding', 'the', 'slowest', 'relaxations', 'of', 'complex', 'systems', 'such', 'as', 'relaxation', 'of', 'glassforming', 'materials', 'diffusion', 'in', 'nanoclusters', 'and', 'folding', 'of', 'biomolecules', 'is', 'important', 'for', 'physics', 'chemistry', 'and', 'biology', 'for', 'a', 'kinetic', 'system', '... | [-0.06377706682770261, 0.11009902676579007, -0.06167832682195333, 0.01830082510511043, -0.045867764259161184, -0.12484695337550064, 0.04622781521876354, 0.3106376920007618, -0.23926363335147427, -0.3413306709087218, 0.03842872114857681, -0.23945347209045864, -0.19747659805965756, 0.21309247998105563, -0.007300454657524... |
1,802.06559 | Remarks on BMS${}_3$ invariant field theories: correlation functions and
nonunitary CFTs | We use the isomorphism between the BMS${}_3$ and the $W(2,2)$ algebras to
reconsider some generic aspects of CFTs with the BMS${}_3$ algebra defined as a
chiral symmetry. For unitarity theories, it is known that the extended symmetry
generator acts trivially, and the resulting theory is equivalent to a CFT with
a Vir... | hep-th | we use the isomorphism between the bms_3 and the w22 algebras to reconsider some generic aspects of cfts with the bms_3 algebra defined as a chiral symmetry for unitarity theories it is known that the extended symmetry generator acts trivially and the resulting theory is equivalent to a cft with a virasoro symmetry onl... | [['we', 'use', 'the', 'isomorphism', 'between', 'the', 'bms_3', 'and', 'the', 'w22', 'algebras', 'to', 'reconsider', 'some', 'generic', 'aspects', 'of', 'cfts', 'with', 'the', 'bms_3', 'algebra', 'defined', 'as', 'a', 'chiral', 'symmetry', 'for', 'unitarity', 'theories', 'it', 'is', 'known', 'that', 'the', 'extended', ... | [-0.15369860261368254, 0.13567098898234287, -0.09761103492023217, 0.052801942231599244, -0.14855006183756309, -0.17435227068555023, -0.03319449604411299, 0.32712115100067524, -0.291186087537143, -0.17972456488447885, 0.1444445377940105, -0.2567254557377762, -0.18038039669497974, 0.1030978098925617, -0.08041682371921423... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.