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,801.06669 | A frequency domain analysis of the error distribution from noisy
high-frequency data | Data observed at high sampling frequency are typically assumed to be an
additive composite of a relatively slow-varying continuous-time component, a
latent stochastic process or a smooth random function, and measurement error.
Supposing that the latent component is an It\^{o} diffusion process, we propose
to estimate... | math.ST stat.TH | data observed at high sampling frequency are typically assumed to be an additive composite of a relatively slowvarying continuoustime component a latent stochastic process or a smooth random function and measurement error supposing that the latent component is an ito diffusion process we propose to estimate the measure... | [['data', 'observed', 'at', 'high', 'sampling', 'frequency', 'are', 'typically', 'assumed', 'to', 'be', 'an', 'additive', 'composite', 'of', 'a', 'relatively', 'slowvarying', 'continuoustime', 'component', 'a', 'latent', 'stochastic', 'process', 'or', 'a', 'smooth', 'random', 'function', 'and', 'measurement', 'error', ... | [-0.07714305570892369, 0.03966821815338335, -0.1172872070572339, 0.09978285581623822, -0.0561373046056057, -0.1138253872646601, 0.08154592716600746, 0.43264609404529136, -0.293260553968139, -0.2753480297823747, 0.1767541581687207, -0.2333772409396867, -0.14601727544844229, 0.17467868186649865, -0.08855684789208075, 0.0... |
1,801.0667 | Bayesian Distributed Lag Models | Distributed lag models (DLMs) express the cumulative and delayed dependence
between pairs of time-indexed response and explanatory variables. In practical
application, users of DLMs examine the estimated influence of a series of
lagged covariates to assess patterns of dependence. Much recent methodological
work has s... | stat.AP | distributed lag models dlms express the cumulative and delayed dependence between pairs of timeindexed response and explanatory variables in practical application users of dlms examine the estimated influence of a series of lagged covariates to assess patterns of dependence much recent methodological work has sought to... | [['distributed', 'lag', 'models', 'dlms', 'express', 'the', 'cumulative', 'and', 'delayed', 'dependence', 'between', 'pairs', 'of', 'timeindexed', 'response', 'and', 'explanatory', 'variables', 'in', 'practical', 'application', 'users', 'of', 'dlms', 'examine', 'the', 'estimated', 'influence', 'of', 'a', 'series', 'of'... | [-0.05719436001215529, 0.06339388106883104, -0.09596683896878468, 0.11752502748692807, -0.13771300623858615, -0.17785102090066565, 0.0660873138370724, 0.41608644191707883, -0.2532769748309095, -0.3658491861341255, 0.08371804234588386, -0.2655144786287565, -0.13504759635730545, 0.16668158806860447, -0.10136734046308057,... |
1,801.06671 | Total and differential cross sections of $\eta$-production in
proton-deuteron fusion for excess energies between $Q_\eta=13\;\text{MeV}$
and $Q_\eta=81\;\text{MeV}$ | New data on both total and differential cross sections of the production of
$\eta$ mesons in proton-deuteron fusion to ${}^3\text{He}\,\eta$ in the excess
energy region $13.6\;\text{MeV}\leq Q_\eta \leq 80.9\;\text{MeV}$ are
presented. These data have been obtained with the WASA-at-COSY detector setup
located at the ... | nucl-ex nucl-th | new data on both total and differential cross sections of the production of eta mesons in protondeuteron fusion to 3textheeta in the excess energy region 136textmevleq q_eta leq 809textmev are presented these data have been obtained with the wasaatcosy detector setup located at the forschungszentrum julich using a prot... | [['new', 'data', 'on', 'both', 'total', 'and', 'differential', 'cross', 'sections', 'of', 'the', 'production', 'of', 'eta', 'mesons', 'in', 'protondeuteron', 'fusion', 'to', '3textheeta', 'in', 'the', 'excess', 'energy', 'region', '136textmevleq', 'q_eta', 'leq', '809textmev', 'are', 'presented', 'these', 'data', 'have... | [-0.08795435925588078, 0.1518920829029022, -0.07080523432731363, 0.086541625814529, 0.005554483712850404, -0.07015265448457544, 0.005449333519209176, 0.39404617580917795, -0.20492844565472165, -0.3733509865789009, 0.022615816788207406, -0.3432585093666733, 0.047265101390491636, 0.21190327626495023, 0.02627046467335146,... |
1,801.06672 | Magnetic Behaviour of Assemblies of Interacting Cobalt-Carbide
Nanoparticles | Recent work [1] demonstrated high coercivity and magnetic moment in cobalt
carbide nanoparticle assemblies and explained the high coercivity from first
principles in terms of the high magnetocrystalline anisotropy of the cobalt
carbide nanoparticles. In this work, we comprehensively model the interaction
between the ... | cond-mat.mes-hall | recent work 1 demonstrated high coercivity and magnetic moment in cobalt carbide nanoparticle assemblies and explained the high coercivity from first principles in terms of the high magnetocrystalline anisotropy of the cobalt carbide nanoparticles in this work we comprehensively model the interaction between the nanopa... | [['recent', 'work', '1', 'demonstrated', 'high', 'coercivity', 'and', 'magnetic', 'moment', 'in', 'cobalt', 'carbide', 'nanoparticle', 'assemblies', 'and', 'explained', 'the', 'high', 'coercivity', 'from', 'first', 'principles', 'in', 'terms', 'of', 'the', 'high', 'magnetocrystalline', 'anisotropy', 'of', 'the', 'cobal... | [-0.11701677639888028, 0.18658989740491616, -0.024146742884099015, 0.012744026158672326, -0.04874264918942386, -0.04584369674786984, 0.012924062047799037, 0.4494104891076801, -0.25712782257570205, -0.38374073266493536, -0.017721924321234636, -0.2703204342626094, -0.10537335675532424, 0.17092159337191806, 0.043520845942... |
1,801.06673 | Generalized coupled mode formalism in reciprocal waveguides with
gain/loss, anisotropy or bianisotropy | In anisotropic or bianisotropic waveguides, the standard coupled mode theory
fails due to the broken link between the forward and backward propagating
modes, which together form the dual mode sets that are crucial in constructing
couple mode equations. We generalize the coupled mode theory by treating the
forward and... | physics.optics | in anisotropic or bianisotropic waveguides the standard coupled mode theory fails due to the broken link between the forward and backward propagating modes which together form the dual mode sets that are crucial in constructing couple mode equations we generalize the coupled mode theory by treating the forward and back... | [['in', 'anisotropic', 'or', 'bianisotropic', 'waveguides', 'the', 'standard', 'coupled', 'mode', 'theory', 'fails', 'due', 'to', 'the', 'broken', 'link', 'between', 'the', 'forward', 'and', 'backward', 'propagating', 'modes', 'which', 'together', 'form', 'the', 'dual', 'mode', 'sets', 'that', 'are', 'crucial', 'in', '... | [-0.15019917408378958, 0.17977060425682398, -0.07017730064335806, 0.048495714833615755, -0.1268338906368666, -0.17352756079154738, -0.019215747054144944, 0.3471535191891472, -0.30272404237083445, -0.2241723488727787, 0.0694838297083903, -0.30619522976263874, -0.16985809584746123, 0.15562655542390016, 0.0210487768617104... |
1,801.06674 | On the automorphism group of a closed G$_2$-structure | We study the automorphism group of a compact 7-manifold $M$ endowed with a
closed non-parallel G$_2$-structure, showing that its identity component is
abelian with dimension bounded by min$\{6,b_2(M)\}$. This implies the
non-existence of compact homogeneous manifolds endowed with an invariant closed
non-parallel G$_2... | math.DG | we study the automorphism group of a compact 7manifold m endowed with a closed nonparallel g_2structure showing that its identity component is abelian with dimension bounded by min6b_2m this implies the nonexistence of compact homogeneous manifolds endowed with an invariant closed nonparallel g_2structure we also discu... | [['we', 'study', 'the', 'automorphism', 'group', 'of', 'a', 'compact', '7manifold', 'm', 'endowed', 'with', 'a', 'closed', 'nonparallel', 'g_2structure', 'showing', 'that', 'its', 'identity', 'component', 'is', 'abelian', 'with', 'dimension', 'bounded', 'by', 'min6b_2m', 'this', 'implies', 'the', 'nonexistence', 'of', ... | [-0.2859726769383997, 0.14536962325200875, -0.024206002153126367, 0.06276121382446338, -0.1896708096707395, -0.1657219213763407, -0.08450776321114972, 0.43057363115561503, -0.25779235377558507, -0.17402903246693313, 0.12813019378033155, -0.27526743106621626, -0.16045396532475328, 0.20479074007501671, -0.142159739392809... |
1,801.06675 | On Gamov states of $\Sigma^+$ hyperons | Both the FINUDA and AMADEUS experiments evidenced a low $\Sigma^+$ momentum
component when investigating $\Sigma^+ \pi^-$ pairs produced in K$^-$ nuclear
capture. This component is interpreted as a consequence of Gamov state
formation, with the hyperon trapped in the Coulomb field of the residual
nucleus. Description... | nucl-th | both the finuda and amadeus experiments evidenced a low sigma momentum component when investigating sigma pi pairs produced in k nuclear capture this component is interpreted as a consequence of gamov state formation with the hyperon trapped in the coulomb field of the residual nucleus description of such states and th... | [['both', 'the', 'finuda', 'and', 'amadeus', 'experiments', 'evidenced', 'a', 'low', 'sigma', 'momentum', 'component', 'when', 'investigating', 'sigma', 'pi', 'pairs', 'produced', 'in', 'k', 'nuclear', 'capture', 'this', 'component', 'is', 'interpreted', 'as', 'a', 'consequence', 'of', 'gamov', 'state', 'formation', 'w... | [-0.11426109053014268, 0.18776158499531448, -0.07341221955862091, 0.10421591529419887, 0.013331050920720783, -0.07802318421477873, -0.0061323077327782105, 0.3194614706500884, -0.25049661516752697, -0.26669936068356037, 0.009493949103935232, -0.32362920298211034, -0.053969908580784834, 0.13484411736229254, 0.06077199300... |
1,801.06676 | Higher genera for proper actions of Lie groups | Let G be a Lie group with finitely many connected components and let K be a
maximal compact subgroup. We assume that G satisfies the rapid decay (RD)
property and that G/K has non-positive sectional curvature. As an example, we
can take G to be a connected semisimple Lie group. Let M be a G-proper manifold
with compa... | math.KT math.DG | let g be a lie group with finitely many connected components and let k be a maximal compact subgroup we assume that g satisfies the rapid decay rd property and that gk has nonpositive sectional curvature as an example we can take g to be a connected semisimple lie group let m be a gproper manifold with compact quotient... | [['let', 'g', 'be', 'a', 'lie', 'group', 'with', 'finitely', 'many', 'connected', 'components', 'and', 'let', 'k', 'be', 'a', 'maximal', 'compact', 'subgroup', 'we', 'assume', 'that', 'g', 'satisfies', 'the', 'rapid', 'decay', 'rd', 'property', 'and', 'that', 'gk', 'has', 'nonpositive', 'sectional', 'curvature', 'as', ... | [-0.2353499537539177, 0.11207037880135824, -0.11544212157742714, 0.02764343526342693, -0.1546347508954955, -0.16848890828775373, -0.034553326291442796, 0.3697224121859781, -0.2446035728464453, -0.2192164395393173, 0.09465716656950104, -0.2574141545965534, -0.13303748536561652, 0.179870050563202, -0.13279084928011095, -... |
1,801.06677 | Nonfractional Memory: Filtering, Antipersistence, and Forecasting | The fractional difference operator remains to be the most popular mechanism
to generate long memory due to the existence of efficient algorithms for their
simulation and forecasting. Nonetheless, there is no theoretical argument
linking the fractional difference operator with the presence of long memory in
real data.... | math.ST econ.EM stat.TH | the fractional difference operator remains to be the most popular mechanism to generate long memory due to the existence of efficient algorithms for their simulation and forecasting nonetheless there is no theoretical argument linking the fractional difference operator with the presence of long memory in real data in t... | [['the', 'fractional', 'difference', 'operator', 'remains', 'to', 'be', 'the', 'most', 'popular', 'mechanism', 'to', 'generate', 'long', 'memory', 'due', 'to', 'the', 'existence', 'of', 'efficient', 'algorithms', 'for', 'their', 'simulation', 'and', 'forecasting', 'nonetheless', 'there', 'is', 'no', 'theoretical', 'arg... | [-0.09865707775098312, 0.12483268820195116, -0.05591359962191847, 0.10156322575301632, -0.0878458576521669, -0.13743069137916222, 0.02471352075216655, 0.4086003244066468, -0.3052278072065793, -0.2797544861479033, 0.16773255456151426, -0.24692295140658432, -0.12381491276861416, 0.19502914709717625, -0.09592804099277903,... |
1,801.06678 | $\mathcal {PT}$-symmetric circuit-QED | The Hermiticity axiom of quantum mechanics guarantees that the energy
spectrum is real and the time evolution is unitary (probability-preserving).
Nevertheless, non-Hermitian but $\mathcal{PT}$-symmetric Hamiltonians may also
have real eigenvalues. Systems described by such effective $\mathcal
{PT}$-symmetric Hamilto... | quant-ph | the hermiticity axiom of quantum mechanics guarantees that the energy spectrum is real and the time evolution is unitary probabilitypreserving nevertheless nonhermitian but mathcalptsymmetric hamiltonians may also have real eigenvalues systems described by such effective mathcal ptsymmetric hamiltonians have been reali... | [['the', 'hermiticity', 'axiom', 'of', 'quantum', 'mechanics', 'guarantees', 'that', 'the', 'energy', 'spectrum', 'is', 'real', 'and', 'the', 'time', 'evolution', 'is', 'unitary', 'probabilitypreserving', 'nevertheless', 'nonhermitian', 'but', 'mathcalptsymmetric', 'hamiltonians', 'may', 'also', 'have', 'real', 'eigenv... | [-0.18454878752721318, 0.18010373782329095, -0.03711889537018059, 0.02824034825011733, -0.03915791448782242, -0.20649561267346145, -0.011169828848159384, 0.3769219726057989, -0.26028979877453473, -0.27402381050799574, 0.06897113842812057, -0.26907536161930434, -0.1864010679773942, 0.1685699937865138, -0.019487816080384... |
1,801.06679 | Riding on the Primary: A New Spectrum Sharing Paradigm for
Wireless-Powered IoT Devices | In this paper, a new spectrum sharing model referred to as riding on the
primary (ROP) is proposed for wireless-powered IoT devices with ambient
backscatter communication capabilities. The key idea of ROP is that the
secondary transmitter harvests energy from the primary signal, then modulates
its information bits to... | cs.IT math.IT | in this paper a new spectrum sharing model referred to as riding on the primary rop is proposed for wirelesspowered iot devices with ambient backscatter communication capabilities the key idea of rop is that the secondary transmitter harvests energy from the primary signal then modulates its information bits to the pri... | [['in', 'this', 'paper', 'a', 'new', 'spectrum', 'sharing', 'model', 'referred', 'to', 'as', 'riding', 'on', 'the', 'primary', 'rop', 'is', 'proposed', 'for', 'wirelesspowered', 'iot', 'devices', 'with', 'ambient', 'backscatter', 'communication', 'capabilities', 'the', 'key', 'idea', 'of', 'rop', 'is', 'that', 'the', '... | [-0.24115218741963693, 0.06935819126615789, -0.04205990542114817, 0.016569077982604603, -0.08317637762781929, -0.23892929286940054, 0.05050273166028135, 0.33885478403140357, -0.3266671803197201, -0.31340908818444946, 0.06421067114523488, -0.29551455847430913, -0.14924952120241275, 0.15220657036076973, -0.10742375531786... |
1,801.0668 | Integrability and correspondence of classical and quantum non-linear
three-mode system | The relationship between classical and quantum three one-mode systems
interacting in a non-linear way is described. We investigate the integrability
of these systems by using the reduction procedure. The reduced coherent states
for the quantum system are constructed. We find the explicit formulas for the
reproducing ... | math-ph math.MP | the relationship between classical and quantum three onemode systems interacting in a nonlinear way is described we investigate the integrability of these systems by using the reduction procedure the reduced coherent states for the quantum system are constructed we find the explicit formulas for the reproducing measure... | [['the', 'relationship', 'between', 'classical', 'and', 'quantum', 'three', 'onemode', 'systems', 'interacting', 'in', 'a', 'nonlinear', 'way', 'is', 'described', 'we', 'investigate', 'the', 'integrability', 'of', 'these', 'systems', 'by', 'using', 'the', 'reduction', 'procedure', 'the', 'reduced', 'coherent', 'states'... | [-0.13134569069734425, 0.12308235586169758, -0.06046149147732649, 0.1063502969500405, 0.04288479743991047, -0.13887507346953498, -0.009768736850674031, 0.3493824251345359, -0.259134345309576, -0.26426988319144584, 0.08922179839100863, -0.2834758616008912, -0.21457911626930581, 0.30053648895409424, -0.009009124026079007... |
1,801.06681 | Gauge transformations of Jacobi structures and contact groupoids | We define gauge transformations of Jacobi structures on a manifold. This is
related to gauge transformations of Poisson structures via the Poissonization.
Finally, we discuss how the contact structure of a contact groupoid is effected
by a gauge transformation of the Jacobi structure on its base.
| math-ph math.DG math.MP math.SG | we define gauge transformations of jacobi structures on a manifold this is related to gauge transformations of poisson structures via the poissonization finally we discuss how the contact structure of a contact groupoid is effected by a gauge transformation of the jacobi structure on its base | [['we', 'define', 'gauge', 'transformations', 'of', 'jacobi', 'structures', 'on', 'a', 'manifold', 'this', 'is', 'related', 'to', 'gauge', 'transformations', 'of', 'poisson', 'structures', 'via', 'the', 'poissonization', 'finally', 'we', 'discuss', 'how', 'the', 'contact', 'structure', 'of', 'a', 'contact', 'groupoid',... | [-0.2259557560167235, 0.12427611146932063, -0.12202363983606515, 0.07083597335124227, -0.14710488984280307, -0.07594497230551812, 0.05195046333677095, 0.42781771670864976, -0.33837247639894485, -0.20212454680839312, 0.06303667829817404, -0.20658861317307406, -0.2802989983364292, 0.1076754271660162, -0.06327870330753048... |
1,801.06682 | Securing UAV Communications via Joint Trajectory and Power Control | Unmanned aerial vehicle (UAV) communication is anticipated to be widely
applied in the forthcoming fifth-generation (5G) wireless networks, due to its
many advantages such as low cost, high mobility, and on-demand deployment.
However, the broadcast and line-of-sight (LoS) nature of air-to-ground wireless
channels giv... | cs.IT math.DS math.IT | unmanned aerial vehicle uav communication is anticipated to be widely applied in the forthcoming fifthgeneration 5g wireless networks due to its many advantages such as low cost high mobility and ondemand deployment however the broadcast and lineofsight los nature of airtoground wireless channels gives rise to a new ch... | [['unmanned', 'aerial', 'vehicle', 'uav', 'communication', 'is', 'anticipated', 'to', 'be', 'widely', 'applied', 'in', 'the', 'forthcoming', 'fifthgeneration', '5g', 'wireless', 'networks', 'due', 'to', 'its', 'many', 'advantages', 'such', 'as', 'low', 'cost', 'high', 'mobility', 'and', 'ondemand', 'deployment', 'howev... | [-0.23849491063114744, 0.009665909449603454, 0.008326034868233715, -0.0005975141271090742, -0.05995056147892935, -0.269375483194987, 0.11211676789972624, 0.40307388136560995, -0.29162985926026597, -0.3033738684062654, 0.11227629627519695, -0.24157547174991292, -0.16832063471975175, 0.15055319394354713, -0.1658958756759... |
1,801.06683 | Gravitational wave speed: Implications for models without a mass scale | The recent report that the gravitational wave speed equals the light speed
puts strong constraints on the anisotropic stress parameter of many modified
gravity models, a quantity that is directly observable through large-scale
structure. We show here that models without a mass scale completely escape
these constraint... | astro-ph.CO gr-qc | the recent report that the gravitational wave speed equals the light speed puts strong constraints on the anisotropic stress parameter of many modified gravity models a quantity that is directly observable through largescale structure we show here that models without a mass scale completely escape these constraints we ... | [['the', 'recent', 'report', 'that', 'the', 'gravitational', 'wave', 'speed', 'equals', 'the', 'light', 'speed', 'puts', 'strong', 'constraints', 'on', 'the', 'anisotropic', 'stress', 'parameter', 'of', 'many', 'modified', 'gravity', 'models', 'a', 'quantity', 'that', 'is', 'directly', 'observable', 'through', 'largesc... | [-0.19126720672413225, 0.16036646245347877, -0.07965571545965729, 0.1136604389269656, -0.13722491091597946, -0.12669202010522806, -0.004282609734218568, 0.32824442543149474, -0.2686642204456392, -0.29405925869040433, 0.06547567999974314, -0.226922463403166, -0.1899063149166684, 0.20703830843370769, 0.004878514566488804... |
1,801.06684 | Exponential ergodicity of some Markov dynamical system with application
to a Poisson driven stochastic differential equation | We are concerned with the asymptotics of the Markov chain given by the
post-jump locations of a certain piecewise-deterministic Markov process with a
state-dependent jump intensity. We provide sufficient conditions for such a
model to possess a unique invariant distribution, which is exponentially
attracting in the d... | math.PR | we are concerned with the asymptotics of the markov chain given by the postjump locations of a certain piecewisedeterministic markov process with a statedependent jump intensity we provide sufficient conditions for such a model to possess a unique invariant distribution which is exponentially attracting in the dual bou... | [['we', 'are', 'concerned', 'with', 'the', 'asymptotics', 'of', 'the', 'markov', 'chain', 'given', 'by', 'the', 'postjump', 'locations', 'of', 'a', 'certain', 'piecewisedeterministic', 'markov', 'process', 'with', 'a', 'statedependent', 'jump', 'intensity', 'we', 'provide', 'sufficient', 'conditions', 'for', 'such', 'a... | [-0.15757182457794747, 0.1308091956143005, -0.06569723955666025, 0.06437488686680855, -0.06139772168945712, -0.15009937467029652, 0.041084843944423854, 0.36686239441713464, -0.31739313697490174, -0.19659965272204807, 0.13355245381274308, -0.23302124144557196, -0.11776643728789611, 0.14177854559443986, -0.06529856726933... |
1,801.06685 | Boron monosulfide: equation of state and pressure-induced phase
transition | Quasi-hydrostatic compression of rhombohedral boron monosulfide (r-BS) has
been studied up to 50 GPa at room temperature using diamond-anvil cells and
angle-dispersive synchrotron X-ray diffraction. A fit of the experimental P-V
data to the Vinet equation of state yields bulk modulus of 42.2(1.4) GPa and
its first pr... | cond-mat.mtrl-sci | quasihydrostatic compression of rhombohedral boron monosulfide rbs has been studied up to 50 gpa at room temperature using diamondanvil cells and angledispersive synchrotron xray diffraction a fit of the experimental pv data to the vinet equation of state yields bulk modulus of 42214 gpa and its first pressure derivati... | [['quasihydrostatic', 'compression', 'of', 'rhombohedral', 'boron', 'monosulfide', 'rbs', 'has', 'been', 'studied', 'up', 'to', '50', 'gpa', 'at', 'room', 'temperature', 'using', 'diamondanvil', 'cells', 'and', 'angledispersive', 'synchrotron', 'xray', 'diffraction', 'a', 'fit', 'of', 'the', 'experimental', 'pv', 'data... | [-0.06282441584181374, 0.166597388714445, -0.1260805177621589, -0.06487818700128908, -0.04238647898674253, -0.08078497356349011, 0.16447968629181264, 0.47771927378163104, -0.26742877657487385, -0.2992971433266028, 0.026667232045002768, -0.3692355348645308, -0.07605687889262913, 0.13680058050279817, 0.07587186553008188,... |
1,801.06686 | Cohomology of $p$-adic Stein spaces | We compute the $p$-adic \'etale and the pro-\'etale cohomologies of the
Drinfeld half-space of any dimension. The main input is a new comparison
theorem for the $p$-adic pro-\'etale cohomology of $p$-adic Stein spaces.
| math.NT math.AG math.RT | we compute the padic etale and the proetale cohomologies of the drinfeld halfspace of any dimension the main input is a new comparison theorem for the padic proetale cohomology of padic stein spaces | [['we', 'compute', 'the', 'padic', 'etale', 'and', 'the', 'proetale', 'cohomologies', 'of', 'the', 'drinfeld', 'halfspace', 'of', 'any', 'dimension', 'the', 'main', 'input', 'is', 'a', 'new', 'comparison', 'theorem', 'for', 'the', 'padic', 'proetale', 'cohomology', 'of', 'padic', 'stein', 'spaces']] | [-0.22695732864579468, -0.012038270265541294, -0.21230203967372124, 0.17241417714324075, -0.14458894146832102, -0.08852335177079747, -0.014005604933834436, 0.21126164891051524, -0.4012060555431879, -0.15733043838179472, 0.055101533152275915, -0.17193277276149302, -0.1092739541958453, 0.2693937281852193, -0.261415989928... |
1,801.06687 | A Directionally Selective Small Target Motion Detecting Visual Neural
Network in Cluttered Backgrounds | Discriminating targets moving against a cluttered background is a huge
challenge, let alone detecting a target as small as one or a few pixels and
tracking it in flight. In the fly's visual system, a class of specific neurons,
called small target motion detectors (STMDs), have been identified as showing
exquisite sel... | cs.CV cs.NE | discriminating targets moving against a cluttered background is a huge challenge let alone detecting a target as small as one or a few pixels and tracking it in flight in the flys visual system a class of specific neurons called small target motion detectors stmds have been identified as showing exquisite selectivity f... | [['discriminating', 'targets', 'moving', 'against', 'a', 'cluttered', 'background', 'is', 'a', 'huge', 'challenge', 'let', 'alone', 'detecting', 'a', 'target', 'as', 'small', 'as', 'one', 'or', 'a', 'few', 'pixels', 'and', 'tracking', 'it', 'in', 'flight', 'in', 'the', 'flys', 'visual', 'system', 'a', 'class', 'of', 's... | [-0.10424617400116404, 0.12181996451290615, -0.008733126425649971, 0.033209003475494686, -0.08646252035163343, -0.2005654385802336, 0.014153245050547412, 0.46767032345756887, -0.23514647240052, -0.3195155756408349, 0.043182791247963905, -0.2596406217291951, -0.2183677059854381, 0.16523306560120546, -0.12440645330760162... |
1,801.06688 | The effect of AC electric field on the dynamics of a vesicle under shear
flow in the small deformation regime | Vesicles or biological cells under simultaneous shear and electric field can
be encountered in dielectrophoretic devices or devices used for continuous flow
electrofusion or electroporation. In this work, the dynamics of a vesicle
subjected to simultaneous shear and uniform AC electric field is investigated
in the sm... | cond-mat.soft | vesicles or biological cells under simultaneous shear and electric field can be encountered in dielectrophoretic devices or devices used for continuous flow electrofusion or electroporation in this work the dynamics of a vesicle subjected to simultaneous shear and uniform ac electric field is investigated in the small ... | [['vesicles', 'or', 'biological', 'cells', 'under', 'simultaneous', 'shear', 'and', 'electric', 'field', 'can', 'be', 'encountered', 'in', 'dielectrophoretic', 'devices', 'or', 'devices', 'used', 'for', 'continuous', 'flow', 'electrofusion', 'or', 'electroporation', 'in', 'this', 'work', 'the', 'dynamics', 'of', 'a', '... | [-0.17679257658880806, 0.19531174020142536, -0.04353724175644486, -0.010864880169730766, -0.05023586694261597, -0.1262845405038785, -0.003703505044670503, 0.37589368115551036, -0.31292522114815685, -0.28870064677696367, 0.0733143211716948, -0.2215870664815746, -0.143236554381456, 0.20329844964605576, -0.025077755518787... |
1,801.06689 | Learning model-based strategies in simple environments with hierarchical
q-networks | Recent advances in deep learning have allowed artificial agents to rival
human-level performance on a wide range of complex tasks; however, the ability
of these networks to learn generalizable strategies remains a pressing
challenge. This critical limitation is due in part to two factors: the opaque
information repre... | cs.AI | recent advances in deep learning have allowed artificial agents to rival humanlevel performance on a wide range of complex tasks however the ability of these networks to learn generalizable strategies remains a pressing challenge this critical limitation is due in part to two factors the opaque information representati... | [['recent', 'advances', 'in', 'deep', 'learning', 'have', 'allowed', 'artificial', 'agents', 'to', 'rival', 'humanlevel', 'performance', 'on', 'a', 'wide', 'range', 'of', 'complex', 'tasks', 'however', 'the', 'ability', 'of', 'these', 'networks', 'to', 'learn', 'generalizable', 'strategies', 'remains', 'a', 'pressing',... | [-0.04838548396765772, 0.05388599343449136, -0.09635907148735391, 0.07746190052065584, -0.13630648033331252, -0.1996621028644343, 0.10468629999293222, 0.4525390526569552, -0.27881971053158244, -0.3311003325631221, 0.04894667463273638, -0.20104057231711017, -0.23157495750321283, 0.14539374312799838, -0.18134638380880158... |
1,801.0669 | Pseudorapidity dependence of multiplicity and transverse momentum
fluctuations in pp collisions at SPS energies | A search for the critical behavior of strongly interacting matter was
performed at the NA61/SHINE experiment by studying event-by-event fluctuations
of multiplicity and transverse momentum of charged hadrons produced in
inelastic p+p collisions at 20, 31, 40, 80 and 158 GeV/c beam momentum. Results
for the energy dep... | nucl-ex | a search for the critical behavior of strongly interacting matter was performed at the na61shine experiment by studying eventbyevent fluctuations of multiplicity and transverse momentum of charged hadrons produced in inelastic pp collisions at 20 31 40 80 and 158 gevc beam momentum results for the energy dependence of ... | [['a', 'search', 'for', 'the', 'critical', 'behavior', 'of', 'strongly', 'interacting', 'matter', 'was', 'performed', 'at', 'the', 'na61shine', 'experiment', 'by', 'studying', 'eventbyevent', 'fluctuations', 'of', 'multiplicity', 'and', 'transverse', 'momentum', 'of', 'charged', 'hadrons', 'produced', 'in', 'inelastic'... | [-0.10581417840114947, 0.23630418377484433, -0.1502787489985484, 0.15253854640231598, 0.03347337353151551, -0.07568845913141728, -0.04578227901000118, 0.33872791567443716, -0.16978606506153335, -0.3408828379348094, -0.012214942783155196, -0.353021377925003, 0.08567553103040514, 0.1592926573993768, 0.04750572349388846, ... |
1,801.06691 | Tomography of asymmetric molecular orbitals with one-color inhomogeneous
field | We demonstrate to image asymmetric molecular orbitals via high-order harmonic
generation in a one-color inhomogeneous field. Due to the broken inversion
symmetry of the inhomogeneous field in space, the returning electrons with
energy in a broad range can be forced to recollide from only one direction for
all the ori... | physics.optics physics.atom-ph | we demonstrate to image asymmetric molecular orbitals via highorder harmonic generation in a onecolor inhomogeneous field due to the broken inversion symmetry of the inhomogeneous field in space the returning electrons with energy in a broad range can be forced to recollide from only one direction for all the orientati... | [['we', 'demonstrate', 'to', 'image', 'asymmetric', 'molecular', 'orbitals', 'via', 'highorder', 'harmonic', 'generation', 'in', 'a', 'onecolor', 'inhomogeneous', 'field', 'due', 'to', 'the', 'broken', 'inversion', 'symmetry', 'of', 'the', 'inhomogeneous', 'field', 'in', 'space', 'the', 'returning', 'electrons', 'with'... | [-0.10566378144599567, 0.17125520016562856, -0.04328192677131253, 0.042908834664490525, -0.05062036515892457, -0.13871274036834033, 0.008636229184116715, 0.43844040667760037, -0.30447887872981133, -0.286371911292739, 0.014605518379335719, -0.17332167697582987, -0.04719953694615826, 0.15604752970633107, 0.02677027116068... |
1,801.06692 | Primitive ideals of ${\rm U}(\frak{sl}(\infty))$ and the
Robinson-Schensted algorithm at infinity | We present an algorithm which computes the annihilator in ${\rm
U}(\frak{sl}(\infty))$ of any simple highest weight $\frak{sl}(\infty)$-module
$L_\frak b(\lambda)$. This algorithm is based on an infinite version of the
Robinson-Schensted algorithm.
| math.RT math.CO math.RA | we present an algorithm which computes the annihilator in rm ufrakslinfty of any simple highest weight frakslinftymodule l_frak blambda this algorithm is based on an infinite version of the robinsonschensted algorithm | [['we', 'present', 'an', 'algorithm', 'which', 'computes', 'the', 'annihilator', 'in', 'rm', 'ufrakslinfty', 'of', 'any', 'simple', 'highest', 'weight', 'frakslinftymodule', 'l_frak', 'blambda', 'this', 'algorithm', 'is', 'based', 'on', 'an', 'infinite', 'version', 'of', 'the', 'robinsonschensted', 'algorithm']] | [-0.14409064557403325, 0.017398359231689635, -0.11408391227790465, -0.007638484270622333, -0.09692457895725966, -0.12058207839727401, -0.0011698878447835644, 0.40905054671068986, -0.2851044020925959, -0.22192132758597533, 0.051867894141469154, -0.17844677610943716, -0.1848323885972301, 0.20500008190671604, -0.114403423... |
1,801.06693 | Real-time photoacoustic projection imaging using deep learning | Photoacoustic tomography (PAT) is an emerging and non-invasive hybrid imaging
modality for visualizing light absorbing structures in biological tissue. The
recently invented PAT systems using arrays of 64 parallel integrating line
detectors allow capturing photoacoustic projection images in fractions of a
second. Sta... | math.NA physics.med-ph physics.optics | photoacoustic tomography pat is an emerging and noninvasive hybrid imaging modality for visualizing light absorbing structures in biological tissue the recently invented pat systems using arrays of 64 parallel integrating line detectors allow capturing photoacoustic projection images in fractions of a second standard i... | [['photoacoustic', 'tomography', 'pat', 'is', 'an', 'emerging', 'and', 'noninvasive', 'hybrid', 'imaging', 'modality', 'for', 'visualizing', 'light', 'absorbing', 'structures', 'in', 'biological', 'tissue', 'the', 'recently', 'invented', 'pat', 'systems', 'using', 'arrays', 'of', '64', 'parallel', 'integrating', 'line'... | [-0.04266822029123582, 0.008905601071523257, -0.021968674956108013, 0.03448747278004525, -0.051740524332643936, -0.15515535066777975, -0.02174954333753066, 0.4278848571990876, -0.28015047015583855, -0.3299408010639173, 0.10495180474953082, -0.2532359115280134, -0.18084192289442746, 0.21768989504528588, -0.1216049538871... |
1,801.06694 | Determination of Digital Straight Segments Using the Slope | We present a new method for the recognition of digital straight lines based
on the slope. This method combines the Freeman's chain coding scheme and new
discovered properties of the digital slope introduced in this paper. We also
present the efficiency of our method from a testbed.
| cs.CV cs.CG | we present a new method for the recognition of digital straight lines based on the slope this method combines the freemans chain coding scheme and new discovered properties of the digital slope introduced in this paper we also present the efficiency of our method from a testbed | [['we', 'present', 'a', 'new', 'method', 'for', 'the', 'recognition', 'of', 'digital', 'straight', 'lines', 'based', 'on', 'the', 'slope', 'this', 'method', 'combines', 'the', 'freemans', 'chain', 'coding', 'scheme', 'and', 'new', 'discovered', 'properties', 'of', 'the', 'digital', 'slope', 'introduced', 'in', 'this', ... | [-0.09394161236730028, -0.056298535307274855, -0.13517133435828887, -0.023584690782182078, -0.05874493088018387, -0.1056279371829426, 0.10136015793714831, 0.38810278744773663, -0.24973270479351917, -0.2775579602952967, 0.06800283133696289, -0.19806759623176556, -0.22425842950952815, 0.26862526823707084, -0.103509982096... |
1,801.06695 | Crystallization in the Fractional Quantum Hall Regime Induced by
Landau-level Mixing | The interplay between strongly correlated liquid and crystal phases for
two-dimensional electrons exposed to a high transverse magnetic field is of
fundamental interest. Through the non-perturbative fixed phase diffusion Monte
Carlo method, we determine the phase diagram of the Wigner crystal in the
$\nu-\kappa$ plan... | cond-mat.str-el | the interplay between strongly correlated liquid and crystal phases for twodimensional electrons exposed to a high transverse magnetic field is of fundamental interest through the nonperturbative fixed phase diffusion monte carlo method we determine the phase diagram of the wigner crystal in the nukappa plane where nu ... | [['the', 'interplay', 'between', 'strongly', 'correlated', 'liquid', 'and', 'crystal', 'phases', 'for', 'twodimensional', 'electrons', 'exposed', 'to', 'a', 'high', 'transverse', 'magnetic', 'field', 'is', 'of', 'fundamental', 'interest', 'through', 'the', 'nonperturbative', 'fixed', 'phase', 'diffusion', 'monte', 'car... | [-0.12560171740880746, 0.29198866438586957, -0.058880503954631944, 0.06385741504796204, 0.0067809074271714224, -0.16039937414461747, 0.10292964805211384, 0.3560187486332974, -0.2353689110715918, -0.2951973062951029, 0.0028707073700691885, -0.32075652556626927, -0.10815437272096806, 0.15603406569321773, 0.04820838617438... |
1,801.06696 | Martingale solutions for the three-dimensional stochastic nonhomogeneous
incompressible Navier-Stokes equations driven by Levy processes | In this paper, the three-dimensional stochastic nonhomogeneous incompressible
Navier-Stokes equations driven by L\'evy process consisting of the Brownian
motion, the compensated Poisson random measure and the Poisson random measure
are considered in a bounded domain. We obtain the existence of martingale
solutions. T... | math.AP math.PR | in this paper the threedimensional stochastic nonhomogeneous incompressible navierstokes equations driven by levy process consisting of the brownian motion the compensated poisson random measure and the poisson random measure are considered in a bounded domain we obtain the existence of martingale solutions the constru... | [['in', 'this', 'paper', 'the', 'threedimensional', 'stochastic', 'nonhomogeneous', 'incompressible', 'navierstokes', 'equations', 'driven', 'by', 'levy', 'process', 'consisting', 'of', 'the', 'brownian', 'motion', 'the', 'compensated', 'poisson', 'random', 'measure', 'and', 'the', 'poisson', 'random', 'measure', 'are'... | [-0.1085490265654193, 0.0852437977206021, -0.11200601895827622, 0.03321871221068871, -0.06029071821461594, -0.08352187177580264, 0.009833857640697961, 0.3043554306680721, -0.35405108167065513, -0.19177201724359913, 0.15030333324564651, -0.23809500647679208, -0.11607995275999346, 0.1399504631639473, -0.106693496055428, ... |
1,801.06697 | Maximally Random Discrete-Spin Systems with Symmetric and Asymmetric
Interactions and Maximally Degenerate Ordering | Discrete-spin systems with maximally random nearest-neighbor interactions
that can be symmetric or asymmetric, ferromagnetic or antiferromagnetic,
including off-diagonal disorder, are studied, for the number of states $q=3,4$
in $d$ dimensions. We use renormalization-group theory that is exact for
hierarchical lattic... | cond-mat.dis-nn cond-mat.stat-mech | discretespin systems with maximally random nearestneighbor interactions that can be symmetric or asymmetric ferromagnetic or antiferromagnetic including offdiagonal disorder are studied for the number of states q34 in d dimensions we use renormalizationgroup theory that is exact for hierarchical lattices and approximat... | [['discretespin', 'systems', 'with', 'maximally', 'random', 'nearestneighbor', 'interactions', 'that', 'can', 'be', 'symmetric', 'or', 'asymmetric', 'ferromagnetic', 'or', 'antiferromagnetic', 'including', 'offdiagonal', 'disorder', 'are', 'studied', 'for', 'the', 'number', 'of', 'states', 'q34', 'in', 'd', 'dimensions... | [-0.19066038150763648, 0.26251731739577017, -0.013693896968933668, 0.05917125564901102, 0.008915453288478382, -0.21258265263203419, 0.04913690017296397, 0.37440612366931003, -0.228648344692633, -0.2176169947643454, 0.07727779380652602, -0.3375439120230801, -0.10540088408654838, 0.1088479744792549, 0.08696757078057889, ... |
1,801.06698 | Polymer Solutions | The article provides a brief general introduction into the concepts of
scaling, universality, and crossover scaling, plus the blob concept that
provides an intuitive picture of crossover phenomena. We present the most
important static and dynamic scaling laws for unentangled uncharged polymer
solutions, together with... | cond-mat.soft | the article provides a brief general introduction into the concepts of scaling universality and crossover scaling plus the blob concept that provides an intuitive picture of crossover phenomena we present the most important static and dynamic scaling laws for unentangled uncharged polymer solutions together with their ... | [['the', 'article', 'provides', 'a', 'brief', 'general', 'introduction', 'into', 'the', 'concepts', 'of', 'scaling', 'universality', 'and', 'crossover', 'scaling', 'plus', 'the', 'blob', 'concept', 'that', 'provides', 'an', 'intuitive', 'picture', 'of', 'crossover', 'phenomena', 'we', 'present', 'the', 'most', 'importa... | [-0.08363227088314791, 0.11616714290499254, -0.15131020114414342, 0.08536675926815304, -0.06807872471917006, -0.20193509145691577, 0.008311626077758975, 0.32725523523468936, -0.20508119504827643, -0.2918345483032883, 0.1055508999270387, -0.26443524631516385, -0.17860621403734614, 0.2067507747528402, -0.0101595366270177... |
1,801.06699 | Deuterated Formaldehyde in the low mass protostar HH212 | HH212, a nearby (400 pc) object in Orion, is a Class 0 protostellar system
with a Keplerian disk and collimated bipolar SiO jets. Deuterated water, HDO
and a deuterated complex molecule, methanol (CH2DOH) have been reported in the
source. Here, we report the HDCO (deuterated formaldehyde) line observation
from ALMA d... | astro-ph.GA | hh212 a nearby 400 pc object in orion is a class 0 protostellar system with a keplerian disk and collimated bipolar sio jets deuterated water hdo and a deuterated complex molecule methanol ch2doh have been reported in the source here we report the hdco deuterated formaldehyde line observation from alma data to probe th... | [['hh212', 'a', 'nearby', '400', 'pc', 'object', 'in', 'orion', 'is', 'a', 'class', '0', 'protostellar', 'system', 'with', 'a', 'keplerian', 'disk', 'and', 'collimated', 'bipolar', 'sio', 'jets', 'deuterated', 'water', 'hdo', 'and', 'a', 'deuterated', 'complex', 'molecule', 'methanol', 'ch2doh', 'have', 'been', 'report... | [-0.08021940256488354, 0.07396376048638605, -0.013199049543637114, 0.010042977033523269, -0.07759010893268845, -0.10527276332812527, 0.01906146864609745, 0.459639811124175, -0.19770802510249316, -0.25425770528948843, 0.07541201923800728, -0.23699945228275818, -8.742983202235057e-05, 0.12760545501786952, 0.0332145174298... |
1,801.067 | A Deep Reinforcement Learning Chatbot (Short Version) | We present MILABOT: a deep reinforcement learning chatbot developed by the
Montreal Institute for Learning Algorithms (MILA) for the Amazon Alexa Prize
competition. MILABOT is capable of conversing with humans on popular small talk
topics through both speech and text. The system consists of an ensemble of
natural lan... | cs.CL cs.AI cs.LG cs.NE stat.ML | we present milabot a deep reinforcement learning chatbot developed by the montreal institute for learning algorithms mila for the amazon alexa prize competition milabot is capable of conversing with humans on popular small talk topics through both speech and text the system consists of an ensemble of natural language g... | [['we', 'present', 'milabot', 'a', 'deep', 'reinforcement', 'learning', 'chatbot', 'developed', 'by', 'the', 'montreal', 'institute', 'for', 'learning', 'algorithms', 'mila', 'for', 'the', 'amazon', 'alexa', 'prize', 'competition', 'milabot', 'is', 'capable', 'of', 'conversing', 'with', 'humans', 'on', 'popular', 'smal... | [-0.033726068059583815, 0.019667404482194305, -0.056323061076150545, 0.041835526346346345, -0.11436111740419626, -0.20642232826331586, 0.005097928165465476, 0.43475030424205335, -0.23934729822625325, -0.3550761374154524, 0.04664583334710273, -0.33600357856865476, -0.20337108102458434, 0.2270463439379269, -0.06297320491... |
1,801.06701 | On the $\infty$-stack of complexes over a scheme | We study fppf descent for enhanced derived categories. We revisit the work of
[HS] and [TV08] in a lax context. More precisely, we construct a Cartesian and
coCartesian fibration ${}^{\mathrm{op}}\mathscr D^+_S\rightarrow
N(\mathop{\mathrm{Sch}}_S)$ whose fibre over an $S$-scheme $T$ is the opposite
$\mathscr D^+(T)^... | math.AG math.AT math.CT | we study fppf descent for enhanced derived categories we revisit the work of hs and tv08 in a lax context more precisely we construct a cartesian and cocartesian fibration mathrmopmathscr d_srightarrow nmathopmathrmsch_s whose fibre over an sscheme t is the opposite mathscr dtmathrmop of the quasicategory of bounded be... | [['we', 'study', 'fppf', 'descent', 'for', 'enhanced', 'derived', 'categories', 'we', 'revisit', 'the', 'work', 'of', 'hs', 'and', 'tv08', 'in', 'a', 'lax', 'context', 'more', 'precisely', 'we', 'construct', 'a', 'cartesian', 'and', 'cocartesian', 'fibration', 'mathrmopmathscr', 'd_srightarrow', 'nmathopmathrmsch_s', '... | [-0.183793511314434, 0.04408463677542126, -0.04252120543969795, 0.09843038897296148, -0.03906087708725993, -0.1363998715865559, -0.016017805907592577, 0.40315236022745793, -0.35131011616405367, -0.13288484372398152, 0.049376564805113175, -0.23043740116658487, -0.12376237901792463, 0.19827817014551588, -0.17661188695845... |
1,801.06702 | Secrecy Capacity of Colored Gaussian Noise Channels with Feedback | In this paper, the k-th order autoregressive moving average (ARMA(k))
Gaussian wiretap channel with noiseless causal feedback is considered, in which
an eavesdropper receives noisy observations of the signals in both forward and
feedback channels. It is shown that a variant of the generalized
Schalkwijk-Kailath schem... | cs.IT math.IT | in this paper the kth order autoregressive moving average armak gaussian wiretap channel with noiseless causal feedback is considered in which an eavesdropper receives noisy observations of the signals in both forward and feedback channels it is shown that a variant of the generalized schalkwijkkailath scheme a capacit... | [['in', 'this', 'paper', 'the', 'kth', 'order', 'autoregressive', 'moving', 'average', 'armak', 'gaussian', 'wiretap', 'channel', 'with', 'noiseless', 'causal', 'feedback', 'is', 'considered', 'in', 'which', 'an', 'eavesdropper', 'receives', 'noisy', 'observations', 'of', 'the', 'signals', 'in', 'both', 'forward', 'and... | [-0.24540508500126143, 0.05115567403290632, -0.04445898392499029, 0.02941828124851605, -0.039340251989716246, -0.2989575849249691, 0.12679007332650577, 0.35666714008334727, -0.2867112138154481, -0.18648297905506525, 0.11218526141245669, -0.25839715525373924, -0.14719899474281362, 0.13126066118049964, -0.158435815650460... |
1,801.06703 | Decision Rules for Robotic Mobile Fulfillment Systems | The Robotic Mobile Fulfillment Systems (RMFS) is a new type of robotized,
parts-to-picker material handling system, designed especially for e-commerce
warehouses. Robots bring movable shelves, called pods, to workstations where
inventory is put on or removed from the pods. This paper simulates both the
pick and reple... | cs.MA | the robotic mobile fulfillment systems rmfs is a new type of robotized partstopicker material handling system designed especially for ecommerce warehouses robots bring movable shelves called pods to workstations where inventory is put on or removed from the pods this paper simulates both the pick and replenishment proc... | [['the', 'robotic', 'mobile', 'fulfillment', 'systems', 'rmfs', 'is', 'a', 'new', 'type', 'of', 'robotized', 'partstopicker', 'material', 'handling', 'system', 'designed', 'especially', 'for', 'ecommerce', 'warehouses', 'robots', 'bring', 'movable', 'shelves', 'called', 'pods', 'to', 'workstations', 'where', 'inventory... | [-0.17563144149994314, 0.08013271294591899, -0.004213675934887301, -0.004349775066037714, -0.09337097273385399, -0.14864041288465724, 0.1213002325956652, 0.37938224979206525, -0.26764368747600015, -0.33163978991668414, 0.15913290088271012, -0.2919626805325558, -0.07282112905059207, 0.15919294175114976, -0.1141466870780... |
1,801.06704 | A more reasonable proof of Cobham's theorem | We present a short new proof of Cobham's theorem without using Kronecker's
approximation theorem, making it suitable for generalization beyond automatic
sequences.
| cs.FL | we present a short new proof of cobhams theorem without using kroneckers approximation theorem making it suitable for generalization beyond automatic sequences | [['we', 'present', 'a', 'short', 'new', 'proof', 'of', 'cobhams', 'theorem', 'without', 'using', 'kroneckers', 'approximation', 'theorem', 'making', 'it', 'suitable', 'for', 'generalization', 'beyond', 'automatic', 'sequences']] | [-0.10005319156599315, -0.03017319379035722, -0.17960801178758795, 0.20284670108759945, -0.14176371304148977, -0.1856787253848531, 0.17418907037724488, 0.29897147008556535, -0.2585356407375498, -0.2592869053002108, 0.1268608999142254, -0.13892840454354882, -0.16937110903249544, 0.3305300883948803, -0.16007196026938883,... |
1,801.06705 | On closed Lie ideals of certain tensor products of C*-algebras II | We identify all closed Lie ideals of $A \otimes^{\alpha} B$ and $B(H)
\otimes^{\alpha} B(H)$, where $\otimes^{\alpha}$ is either the Haagerup tensor
product, the Banach space projective tensor product or the operator space
projective tensor product, $A$ is any simple C*-algebra, $B$ is any C*-algebra
with one of them... | math.OA | we identify all closed lie ideals of a otimesalpha b and bh otimesalpha bh where otimesalpha is either the haagerup tensor product the banach space projective tensor product or the operator space projective tensor product a is any simple calgebra b is any calgebra with one of them admitting no tracial states and h is a... | [['we', 'identify', 'all', 'closed', 'lie', 'ideals', 'of', 'a', 'otimesalpha', 'b', 'and', 'bh', 'otimesalpha', 'bh', 'where', 'otimesalpha', 'is', 'either', 'the', 'haagerup', 'tensor', 'product', 'the', 'banach', 'space', 'projective', 'tensor', 'product', 'or', 'the', 'operator', 'space', 'projective', 'tensor', 'p... | [-0.14173990712956863, 0.16211757047904998, -0.04650905950767721, 0.01723622621601804, -0.14805828001191643, -0.21849743032610006, -0.04900049102155769, 0.3612587773736487, -0.33325458396885027, -0.0767067197829168, 0.12732626094502655, -0.27693621246540484, -0.03672297903524831, 0.13427483088069378, -0.099300069853346... |
1,801.06706 | One way quantum repeaters with quantum Reed-Solomon codes | We show that quantum Reed-Solomon codes constructed from classical
Reed-Solomon codes can approach the capacity on the quantum erasure channel of
$d$-level systems for large dimension $d$. We study the performance of one-way
quantum repeaters with these codes and obtain a significant improvement in key
generation rat... | quant-ph | we show that quantum reedsolomon codes constructed from classical reedsolomon codes can approach the capacity on the quantum erasure channel of dlevel systems for large dimension d we study the performance of oneway quantum repeaters with these codes and obtain a significant improvement in key generation rate compared ... | [['we', 'show', 'that', 'quantum', 'reedsolomon', 'codes', 'constructed', 'from', 'classical', 'reedsolomon', 'codes', 'can', 'approach', 'the', 'capacity', 'on', 'the', 'quantum', 'erasure', 'channel', 'of', 'dlevel', 'systems', 'for', 'large', 'dimension', 'd', 'we', 'study', 'the', 'performance', 'of', 'oneway', 'qu... | [-0.21217690552363083, 0.11156432058418259, -0.030550410940555765, 0.09964959149891954, 0.06507691248164822, -0.34979361010205356, 0.06902509493963971, 0.3391729857151707, -0.3078323799806337, -0.23419161430848318, 0.08224995163202818, -0.2486470431266796, -0.16613222126172678, 0.29855884086074574, -0.09802653878882882... |
1,801.06707 | Knotty protostellar jets as a signature of episodic protostellar
accretion? | We aim at studying the causal link between the knotty jet structure in CARMA
7, a young Class 0 protostar in the Serpens South cluster, and episodic
accretion in young protostellar disks. We used numerical hydrodynamics
simulations to derive the protostellar accretion history in gravitationally
unstable disks around ... | astro-ph.SR astro-ph.GA | we aim at studying the causal link between the knotty jet structure in carma 7 a young class 0 protostar in the serpens south cluster and episodic accretion in young protostellar disks we used numerical hydrodynamics simulations to derive the protostellar accretion history in gravitationally unstable disks around solar... | [['we', 'aim', 'at', 'studying', 'the', 'causal', 'link', 'between', 'the', 'knotty', 'jet', 'structure', 'in', 'carma', '7', 'a', 'young', 'class', '0', 'protostar', 'in', 'the', 'serpens', 'south', 'cluster', 'and', 'episodic', 'accretion', 'in', 'young', 'protostellar', 'disks', 'we', 'used', 'numerical', 'hydrodyna... | [-0.11598972700260303, 0.15351483809192562, -0.05158446201088804, 0.15090624052229235, -0.04716545225431522, -0.0763987679336289, 0.023977699183376024, 0.46895249829524094, -0.1820215091508106, -0.33363193964383014, 0.06927373125260972, -0.23257444972157287, 0.0026807103444028784, 0.188455912269031, 0.00735882145387155... |
1,801.06708 | Hubbard pair cluster in the external fields. Studies of the magnetic
properties | The magnetic properties of the two-site Hubbard cluster (dimer or pair),
embedded in the external electric and magnetic fields and treated as the open
system, are studied by means of the exact diagonalization of the Hamiltonian.
The formalism of the grand canonical ensemble is adopted. The phase diagrams,
on-site mag... | cond-mat.stat-mech cond-mat.mes-hall cond-mat.str-el | the magnetic properties of the twosite hubbard cluster dimer or pair embedded in the external electric and magnetic fields and treated as the open system are studied by means of the exact diagonalization of the hamiltonian the formalism of the grand canonical ensemble is adopted the phase diagrams onsite magnetization ... | [['the', 'magnetic', 'properties', 'of', 'the', 'twosite', 'hubbard', 'cluster', 'dimer', 'or', 'pair', 'embedded', 'in', 'the', 'external', 'electric', 'and', 'magnetic', 'fields', 'and', 'treated', 'as', 'the', 'open', 'system', 'are', 'studied', 'by', 'means', 'of', 'the', 'exact', 'diagonalization', 'of', 'the', 'h... | [-0.2113736068715945, 0.20615392530811022, -0.015807777844464122, 0.11034142654941623, 0.022108856507703282, -0.0797191876128821, 0.03514875243891472, 0.3928691163911658, -0.23524799894036377, -0.32409189278417727, 0.018205352033827834, -0.28026207781917717, -0.10891171413379074, 0.18547483911871973, 0.0897744269646956... |
1,801.06709 | Vector valued Hardy spaces related to analytic functions having
distributional boundary values | The Hardy space $H^{p}$ of vector valued analytic functions in tube domains
in $\mathbb{C}^{n}$ and with values in Banach space are defined. Vector valued
analytic functions in tube domains in $\mathbb{C}^{n}$ with values in Hilbert
space and which have vector valued tempered distributions as boundary value are
prove... | math.FA | the hardy space hp of vector valued analytic functions in tube domains in mathbbcn and with values in banach space are defined vector valued analytic functions in tube domains in mathbbcn with values in hilbert space and which have vector valued tempered distributions as boundary value are proved to be in hp correspond... | [['the', 'hardy', 'space', 'hp', 'of', 'vector', 'valued', 'analytic', 'functions', 'in', 'tube', 'domains', 'in', 'mathbbcn', 'and', 'with', 'values', 'in', 'banach', 'space', 'are', 'defined', 'vector', 'valued', 'analytic', 'functions', 'in', 'tube', 'domains', 'in', 'mathbbcn', 'with', 'values', 'in', 'hilbert', 's... | [-0.11696144480956719, 0.14423557183908997, -0.06969154388643801, 0.07921361500921194, -0.11910447568516247, -0.04217903836979531, -0.06869499729946256, 0.4308683234732598, -0.3089216310530901, -0.1223858044249937, 0.13036480141890933, -0.19796811611158774, -0.1204549731919542, 0.22433465495705604, -0.07552421773434617... |
1,801.0671 | Learning Light Field Reconstruction from a Single Coded Image | Light field imaging is a rich way of representing the 3D world around us.
However, due to limited sensor resolution capturing light field data inherently
poses spatio-angular resolution trade-off. In this paper, we propose a deep
learning based solution to tackle the resolution trade-off. Specifically, we
reconstruct... | cs.CV | light field imaging is a rich way of representing the 3d world around us however due to limited sensor resolution capturing light field data inherently poses spatioangular resolution tradeoff in this paper we propose a deep learning based solution to tackle the resolution tradeoff specifically we reconstruct full senso... | [['light', 'field', 'imaging', 'is', 'a', 'rich', 'way', 'of', 'representing', 'the', '3d', 'world', 'around', 'us', 'however', 'due', 'to', 'limited', 'sensor', 'resolution', 'capturing', 'light', 'field', 'data', 'inherently', 'poses', 'spatioangular', 'resolution', 'tradeoff', 'in', 'this', 'paper', 'we', 'propose',... | [-0.059598125453139174, -0.022178850990041674, -0.10005155967484261, 0.053454709440823, -0.09375132722137818, -0.1664506036186077, 0.02991008650720248, 0.4627874558406143, -0.30716879805228836, -0.3688240636910858, 0.08345375594538476, -0.2620272313212526, -0.1753278094889789, 0.13583848939582321, -0.18761909029061166,... |
1,801.06711 | HAZMAT III: The UV Evolution of Mid- to Late-M Stars with GALEX | Low-mass stars are currently the most promising targets for detecting and
characterizing habitable planets in the solar neighborhood. However, the
ultraviolet (UV) radiation emitted by such stars can erode and modify planetary
atmospheres over time, drastically affecting their habitability. Thus knowledge
of the UV e... | astro-ph.SR | lowmass stars are currently the most promising targets for detecting and characterizing habitable planets in the solar neighborhood however the ultraviolet uv radiation emitted by such stars can erode and modify planetary atmospheres over time drastically affecting their habitability thus knowledge of the uv evolution ... | [['lowmass', 'stars', 'are', 'currently', 'the', 'most', 'promising', 'targets', 'for', 'detecting', 'and', 'characterizing', 'habitable', 'planets', 'in', 'the', 'solar', 'neighborhood', 'however', 'the', 'ultraviolet', 'uv', 'radiation', 'emitted', 'by', 'such', 'stars', 'can', 'erode', 'and', 'modify', 'planetary', ... | [-0.005451383246898851, 0.19012401406819532, -0.034857478055138405, 0.11713979242592489, -0.09120960098724547, -0.035645847659907304, 0.09081964482122983, 0.43453921863277045, -0.10183462089727462, -0.4197973920797397, 0.031445611435888816, -0.2857559719252874, -0.0455192910763539, 0.1931569892907906, -0.11114909809839... |
1,801.06712 | Cool Spot and Flare Activities of a RS CVn Binary KIC 7885570 | We present here the results on the physical nature a RS CVn binary KIC
7885570 and its chromospheric activity based on the Kepler Mission data.
Assuming the primary component temperature, 6530 K, the temperature of the
secondary component was found to be 5732+-4 K. The mass ratio of the components
(q) was found to be... | astro-ph.SR | we present here the results on the physical nature a rs cvn binary kic 7885570 and its chromospheric activity based on the kepler mission data assuming the primary component temperature 6530 k the temperature of the secondary component was found to be 57324 k the mass ratio of the components q was found to be 043pm001 ... | [['we', 'present', 'here', 'the', 'results', 'on', 'the', 'physical', 'nature', 'a', 'rs', 'cvn', 'binary', 'kic', '7885570', 'and', 'its', 'chromospheric', 'activity', 'based', 'on', 'the', 'kepler', 'mission', 'data', 'assuming', 'the', 'primary', 'component', 'temperature', '6530', 'k', 'the', 'temperature', 'of', '... | [-0.1066508638036404, 0.1720843602540429, -0.05848529255350254, 0.07913204484783429, -0.03639003163220228, -0.11565592747813623, 0.0726089578812077, 0.3913047595814403, -0.21684086129036068, -0.3815036538622475, 0.11879151177251646, -0.31011779469471157, -0.08698471725344592, 0.20700982661468775, -0.04382654573086516, ... |
1,801.06713 | Optical/infrared polarised emission in X-ray binaries | Recently, evidence for synchrotron emission in both black hole and neutron
star X-ray binaries has been mounting, from optical/infrared spectral,
polarimetric, and fast timing signatures. The synchrotron emission of jets can
be highly linearly polarised, depending on the configuration of the magnetic
field. Optical a... | astro-ph.HE | recently evidence for synchrotron emission in both black hole and neutron star xray binaries has been mounting from opticalinfrared spectral polarimetric and fast timing signatures the synchrotron emission of jets can be highly linearly polarised depending on the configuration of the magnetic field optical and infrared... | [['recently', 'evidence', 'for', 'synchrotron', 'emission', 'in', 'both', 'black', 'hole', 'and', 'neutron', 'star', 'xray', 'binaries', 'has', 'been', 'mounting', 'from', 'opticalinfrared', 'spectral', 'polarimetric', 'and', 'fast', 'timing', 'signatures', 'the', 'synchrotron', 'emission', 'of', 'jets', 'can', 'be', '... | [-0.09884582751843515, 0.1673195085769414, -0.05481434756020119, 0.1300653617077876, -0.11547391648724992, -0.09050530600603143, -0.00880287729757223, 0.484093103540253, -0.18957713575658108, -0.32703930046189716, 0.09509720557197963, -0.3091519245095902, 0.002525035110697642, 0.25717569146204283, -0.016089891794248582... |
1,801.06714 | Life Beyond the Solar System: Remotely Detectable Biosignatures | For the first time in human history, we will soon be able to apply the
scientific method to the question "Are We Alone?" The rapid advance of
exoplanet discovery, planetary systems science, and telescope technology will
soon allow scientists to search for life beyond our Solar System through direct
observation of ext... | astro-ph.EP | for the first time in human history we will soon be able to apply the scientific method to the question are we alone the rapid advance of exoplanet discovery planetary systems science and telescope technology will soon allow scientists to search for life beyond our solar system through direct observation of extrasolar ... | [['for', 'the', 'first', 'time', 'in', 'human', 'history', 'we', 'will', 'soon', 'be', 'able', 'to', 'apply', 'the', 'scientific', 'method', 'to', 'the', 'question', 'are', 'we', 'alone', 'the', 'rapid', 'advance', 'of', 'exoplanet', 'discovery', 'planetary', 'systems', 'science', 'and', 'telescope', 'technology', 'wil... | [-0.06526549862660837, 0.13109139707008616, -0.047490672070053544, 0.05394285669467311, -0.17389765671352939, -0.06752690785219559, 0.0972327657930304, 0.34322315975470413, -0.21529643718236227, -0.3819739420202072, 0.16768323303238342, -0.3038141926805867, -0.16358119959823123, 0.27157872864898147, -0.0963888776311097... |
1,801.06715 | Outlook for inverse design in nanophotonics | Recent advancements in computational inverse design have begun to reshape the
landscape of structures and techniques available to nanophotonics. Here, we
outline a cross section of key developments at the intersection of these two
fields: moving from a recap of foundational results to motivation of emerging
applicati... | physics.optics | recent advancements in computational inverse design have begun to reshape the landscape of structures and techniques available to nanophotonics here we outline a cross section of key developments at the intersection of these two fields moving from a recap of foundational results to motivation of emerging applications i... | [['recent', 'advancements', 'in', 'computational', 'inverse', 'design', 'have', 'begun', 'to', 'reshape', 'the', 'landscape', 'of', 'structures', 'and', 'techniques', 'available', 'to', 'nanophotonics', 'here', 'we', 'outline', 'a', 'cross', 'section', 'of', 'key', 'developments', 'at', 'the', 'intersection', 'of', 'th... | [-0.07890513315106984, 0.08411991522923389, -0.0937687931323631, -0.0028151375483031625, -0.10864475598834732, -0.11793841011132356, -0.024014868853825005, 0.4070408030378598, -0.3045107280076654, -0.2835656523152634, 0.08357278204143599, -0.28077443023384724, -0.2271425280271581, 0.27533358537281555, -0.07628715713508... |
1,801.06716 | Mitigation of Human Exposure to RF Fields in Downlink of Millimeter-Wave
Cellular Systems | Out of the very few studies that paid proper attention to the harmful health
impacts in millimeter-wave (mmW) communications, most of them are concerned
about uplink cases due to closer contact with the human body. Our recent study
revealed that even the human exposure to radio frequency (RF) fields in
downlink mmW t... | cs.NI | out of the very few studies that paid proper attention to the harmful health impacts in millimeterwave mmw communications most of them are concerned about uplink cases due to closer contact with the human body our recent study revealed that even the human exposure to radio frequency rf fields in downlink mmw technology... | [['out', 'of', 'the', 'very', 'few', 'studies', 'that', 'paid', 'proper', 'attention', 'to', 'the', 'harmful', 'health', 'impacts', 'in', 'millimeterwave', 'mmw', 'communications', 'most', 'of', 'them', 'are', 'concerned', 'about', 'uplink', 'cases', 'due', 'to', 'closer', 'contact', 'with', 'the', 'human', 'body', 'ou... | [-0.18975948865693482, 0.031533041069130026, 0.02927418593737416, 0.028741213879057842, -0.08866014522045179, -0.21248021888497629, 0.1257702189793502, 0.4415284966388227, -0.18825315279077345, -0.2799467129870913, 0.09101453773008618, -0.2668810589659147, -0.18026309093474446, 0.21597506962996676, -0.16645542780791683... |
1,801.06717 | Using Deep Learning for Title-Based Semantic Subject Indexing to Reach
Competitive Performance to Full-Text | For (semi-)automated subject indexing systems in digital libraries, it is
often more practical to use metadata such as the title of a publication instead
of the full-text or the abstract. Therefore, it is desirable to have good text
mining and text classification algorithms that operate well already on the
title of a... | cs.DL | for semiautomated subject indexing systems in digital libraries it is often more practical to use metadata such as the title of a publication instead of the fulltext or the abstract therefore it is desirable to have good text mining and text classification algorithms that operate well already on the title of a publicat... | [['for', 'semiautomated', 'subject', 'indexing', 'systems', 'in', 'digital', 'libraries', 'it', 'is', 'often', 'more', 'practical', 'to', 'use', 'metadata', 'such', 'as', 'the', 'title', 'of', 'a', 'publication', 'instead', 'of', 'the', 'fulltext', 'or', 'the', 'abstract', 'therefore', 'it', 'is', 'desirable', 'to', 'h... | [-0.019446980513166637, -0.008019190771505237, -0.010911661606281996, 0.09757445363351144, -0.12939468185789882, -0.1081569356918335, 0.09665151925431564, 0.40965459209680555, -0.2299596097934991, -0.3859495323970914, 0.11953482155501842, -0.36301792215253226, -0.09788943826500326, 0.2584326427805936, -0.11560486842878... |
1,801.06718 | Analog-to-Digital Compression: A New Paradigm for Converting Signals to
Bits | Processing, storing and communicating information that originates as an
analog signal involves conversion of this information to bits. This conversion
can be described by the combined effect of sampling and quantization, as
illustrated in Fig. 1. The digital representation is achieved by first sampling
the analog sig... | cs.IT cs.SY math.IT | processing storing and communicating information that originates as an analog signal involves conversion of this information to bits this conversion can be described by the combined effect of sampling and quantization as illustrated in fig 1 the digital representation is achieved by first sampling the analog signal so ... | [['processing', 'storing', 'and', 'communicating', 'information', 'that', 'originates', 'as', 'an', 'analog', 'signal', 'involves', 'conversion', 'of', 'this', 'information', 'to', 'bits', 'this', 'conversion', 'can', 'be', 'described', 'by', 'the', 'combined', 'effect', 'of', 'sampling', 'and', 'quantization', 'as', '... | [-0.10799632926644412, 0.10274782857495503, -0.05857937509322282, 0.05613436908086028, -0.07982689557836843, -0.12871462976961526, 0.09107527795978292, 0.3618815433928286, -0.3203851295032812, -0.3765990873798728, 0.14763335118552637, -0.25877625618999944, -0.12693088965261812, 0.18947031769572484, -0.11593064931806868... |
1,801.06719 | A Tutorial on Modeling and Analysis of Dynamic Social Networks. Part II | Recent years have witnessed a significant trend towards filling the gap
between Social Network Analysis (SNA) and control theory. This trend was
enabled by the introduction of new mathematical models describing dynamics of
social groups, the development of algorithms and software for data analysis and
the tremendous ... | cs.SI cs.SY math.OC nlin.AO physics.soc-ph | recent years have witnessed a significant trend towards filling the gap between social network analysis sna and control theory this trend was enabled by the introduction of new mathematical models describing dynamics of social groups the development of algorithms and software for data analysis and the tremendous progre... | [['recent', 'years', 'have', 'witnessed', 'a', 'significant', 'trend', 'towards', 'filling', 'the', 'gap', 'between', 'social', 'network', 'analysis', 'sna', 'and', 'control', 'theory', 'this', 'trend', 'was', 'enabled', 'by', 'the', 'introduction', 'of', 'new', 'mathematical', 'models', 'describing', 'dynamics', 'of',... | [-0.11010801524675216, 0.026527590678999076, -0.06867451468436904, 0.015019798371369488, -0.08591973768444332, -0.12087504131479497, 0.00928215972902082, 0.407657342660098, -0.2560322727369533, -0.31942790350448225, 0.11527489775154694, -0.27251258246783466, -0.2620415851856622, 0.19401997780324493, -0.0676667950357878... |
1,801.0672 | Optimal Rates for Spectral Algorithms with Least-Squares Regression over
Hilbert Spaces | In this paper, we study regression problems over a separable Hilbert space
with the square loss, covering non-parametric regression over a reproducing
kernel Hilbert space. We investigate a class of spectral/regularized
algorithms, including ridge regression, principal component regression, and
gradient methods. We p... | stat.ML cs.LG math.FA | in this paper we study regression problems over a separable hilbert space with the square loss covering nonparametric regression over a reproducing kernel hilbert space we investigate a class of spectralregularized algorithms including ridge regression principal component regression and gradient methods we prove optima... | [['in', 'this', 'paper', 'we', 'study', 'regression', 'problems', 'over', 'a', 'separable', 'hilbert', 'space', 'with', 'the', 'square', 'loss', 'covering', 'nonparametric', 'regression', 'over', 'a', 'reproducing', 'kernel', 'hilbert', 'space', 'we', 'investigate', 'a', 'class', 'of', 'spectralregularized', 'algorithm... | [-0.06306612452644171, -0.0362244454718537, -0.08717816185244188, 0.11644625158538585, -0.043252219118139874, -0.11396560120415322, 0.07147150036132875, 0.4388445253122826, -0.2702626419700302, -0.20420786364916332, 0.16552213958597609, -0.23470666630630743, -0.15483672424856268, 0.23326655770937094, -0.113883387972125... |
1,801.06721 | On the unicity of types for tame toral supercuspidal representations | For tame arbitrary-length toral, also called positive regular, supercuspidal
representations of a simply connected and semisimple $p$-adic group $G$,
constructed as per Adler-Yu, we determine which components of their restriction
to a maximal compact subgroup are types. We give conditions under which there
is a uniqu... | math.RT | for tame arbitrarylength toral also called positive regular supercuspidal representations of a simply connected and semisimple padic group g constructed as per adleryu we determine which components of their restriction to a maximal compact subgroup are types we give conditions under which there is a unique such compone... | [['for', 'tame', 'arbitrarylength', 'toral', 'also', 'called', 'positive', 'regular', 'supercuspidal', 'representations', 'of', 'a', 'simply', 'connected', 'and', 'semisimple', 'padic', 'group', 'g', 'constructed', 'as', 'per', 'adleryu', 'we', 'determine', 'which', 'components', 'of', 'their', 'restriction', 'to', 'a'... | [-0.19448861641060447, 0.07840558680370882, -0.11279345171276442, 0.07257072368550316, -0.11769750637251922, -0.1545373719886483, 0.03989803875297231, 0.3582732091782634, -0.2905835948654057, -0.20885327190506398, 0.1514662587745163, -0.19558777186039059, -0.12894405283456303, 0.2476400093837958, -0.14245268459114985, ... |
1,801.06722 | Solid-state qubits | The quantum world is fascinating. It presents a description of nature that
defies our most rooted concepts about what reality is. For example, quantum
objects possess \lq\lq spooky\rq\rq\ properties that allow them to be in
multiple places at the same time, to move in different directions
simultaneously, or to exist ... | cond-mat.mes-hall | the quantum world is fascinating it presents a description of nature that defies our most rooted concepts about what reality is for example quantum objects possess lqlq spookyrqrq properties that allow them to be in multiple places at the same time to move in different directions simultaneously or to exist and not to e... | [['the', 'quantum', 'world', 'is', 'fascinating', 'it', 'presents', 'a', 'description', 'of', 'nature', 'that', 'defies', 'our', 'most', 'rooted', 'concepts', 'about', 'what', 'reality', 'is', 'for', 'example', 'quantum', 'objects', 'possess', 'lqlq', 'spookyrqrq', 'properties', 'that', 'allow', 'them', 'to', 'be', 'in... | [-0.09171526738694005, 0.1277568781305271, -0.10409892929962626, 0.07921134274160611, -0.15270349291581525, -0.14859113142057492, -0.0005744504648852196, 0.38602564996448313, -0.2953715923120757, -0.3444249998254661, 0.11919116324670341, -0.29576267603866374, -0.15363952121527416, 0.26553205396329144, -0.08374168435906... |
1,801.06723 | Influence of a Thermal Bath on The Transport Properties of an Open
Molecular Junction | In a molecular junction (MJ) which connects two electrical leads,
electron-phonon coupling has significant effects on the transport properties.
However, the MJ is not thermally isolated and the phonons can be coupled to
another thermal bath. For strong enough couplings, the bath thermalizes phonons
on the MJ so that ... | cond-mat.mes-hall | in a molecular junction mj which connects two electrical leads electronphonon coupling has significant effects on the transport properties however the mj is not thermally isolated and the phonons can be coupled to another thermal bath for strong enough couplings the bath thermalizes phonons on the mj so that their numb... | [['in', 'a', 'molecular', 'junction', 'mj', 'which', 'connects', 'two', 'electrical', 'leads', 'electronphonon', 'coupling', 'has', 'significant', 'effects', 'on', 'the', 'transport', 'properties', 'however', 'the', 'mj', 'is', 'not', 'thermally', 'isolated', 'and', 'the', 'phonons', 'can', 'be', 'coupled', 'to', 'anot... | [-0.14609561232436036, 0.23696002930454496, -0.05974672294428779, -0.010286016535246745, -0.05086995644960553, -0.16573139981418433, 0.09071365056637054, 0.34333647655633587, -0.23597334616610574, -0.3046786549352368, 0.016571933840815394, -0.3616209032634894, -0.013976342551824119, 0.23816493092001312, -0.000710184729... |
1,801.06724 | DeepISP: Towards Learning an End-to-End Image Processing Pipeline | We present DeepISP, a full end-to-end deep neural model of the camera image
signal processing (ISP) pipeline. Our model learns a mapping from the raw
low-light mosaiced image to the final visually compelling image and encompasses
low-level tasks such as demosaicing and denoising as well as higher-level tasks
such as ... | eess.IV cs.CV | we present deepisp a full endtoend deep neural model of the camera image signal processing isp pipeline our model learns a mapping from the raw lowlight mosaiced image to the final visually compelling image and encompasses lowlevel tasks such as demosaicing and denoising as well as higherlevel tasks such as color corre... | [['we', 'present', 'deepisp', 'a', 'full', 'endtoend', 'deep', 'neural', 'model', 'of', 'the', 'camera', 'image', 'signal', 'processing', 'isp', 'pipeline', 'our', 'model', 'learns', 'a', 'mapping', 'from', 'the', 'raw', 'lowlight', 'mosaiced', 'image', 'to', 'the', 'final', 'visually', 'compelling', 'image', 'and', 'e... | [-0.011532574858543256, -0.13911529838965148, -0.07794637730840942, 0.06598094184447428, -0.08294828951847907, -0.18034594705020138, 0.010373661338130561, 0.49833789995784383, -0.21729659184599096, -0.4044647371972636, 0.08154455099754009, -0.2957996816890274, -0.16798035654560964, 0.21259685822347138, -0.2090881902979... |
1,801.06725 | A Comparison Framework for Interleaved Persistence Modules | We present a generalization of the induced matching theorem and use it to
prove a generalization of the algebraic stability theorem for
$\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via
numerous examples, we show how the generalized algebraic stability theorem
enables the computation of rigor... | math.AT | we present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for mathbbrindexed pointwise finitedimensional persistence modules via numerous examples we show how the generalized algebraic stability theorem enables the computation of rigorous error b... | [['we', 'present', 'a', 'generalization', 'of', 'the', 'induced', 'matching', 'theorem', 'and', 'use', 'it', 'to', 'prove', 'a', 'generalization', 'of', 'the', 'algebraic', 'stability', 'theorem', 'for', 'mathbbrindexed', 'pointwise', 'finitedimensional', 'persistence', 'modules', 'via', 'numerous', 'examples', 'we', '... | [-0.13298457057680935, 0.020373757579363883, -0.11608078009157907, 0.15560451667988673, -0.061435755123966374, -0.09446802829552325, 0.1217620497009193, 0.2720474505331367, -0.3475687129684957, -0.26621063900529407, 0.12163961369878962, -0.19928294606506824, -0.2112980080601119, 0.2420941368873173, -0.13050325850008448... |
1,801.06726 | Design Guidelines for High-Performance SCM Hierarchies | With emerging storage-class memory (SCM) nearing commercialization, there is
evidence that it will deliver the much-anticipated high density and access
latencies within only a few factors of DRAM. Nevertheless, the
latency-sensitive nature of memory-resident services makes seamless integration
of SCM in servers quest... | cs.AR | with emerging storageclass memory scm nearing commercialization there is evidence that it will deliver the muchanticipated high density and access latencies within only a few factors of dram nevertheless the latencysensitive nature of memoryresident services makes seamless integration of scm in servers questionable in ... | [['with', 'emerging', 'storageclass', 'memory', 'scm', 'nearing', 'commercialization', 'there', 'is', 'evidence', 'that', 'it', 'will', 'deliver', 'the', 'muchanticipated', 'high', 'density', 'and', 'access', 'latencies', 'within', 'only', 'a', 'few', 'factors', 'of', 'dram', 'nevertheless', 'the', 'latencysensitive', ... | [-0.17517264635845992, 0.033997511373097894, 0.006479416321607605, 0.022082648460419123, -0.062412774060561345, -0.19709313824952346, 0.13828263686346032, 0.4088635363257028, -0.25022199014619434, -0.34117953301201226, 0.11316853197725163, -0.21990842399905428, -0.1326949304412519, 0.18849679679904874, -0.1418053058859... |
1,801.06727 | A Second Order Cumulant Spectrum Test That a Stochastic Process is
Strictly Stationary and a Step Toward a Test for Graph Signal Strict
Stationarity | This article develops a statistical test for the null hypothesis of strict
stationarity of a discrete time stochastic process in the frequency domain.
When the null hypothesis is true, the second order cumulant spectrum is zero at
all the discrete Fourier frequency pairs in the principal domain. The test uses
a windo... | q-fin.ST math.ST stat.ML stat.TH | this article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain when the null hypothesis is true the second order cumulant spectrum is zero at all the discrete fourier frequency pairs in the principal domain the test uses a window ave... | [['this', 'article', 'develops', 'a', 'statistical', 'test', 'for', 'the', 'null', 'hypothesis', 'of', 'strict', 'stationarity', 'of', 'a', 'discrete', 'time', 'stochastic', 'process', 'in', 'the', 'frequency', 'domain', 'when', 'the', 'null', 'hypothesis', 'is', 'true', 'the', 'second', 'order', 'cumulant', 'spectrum'... | [-0.09261568787239366, 0.03005826819436013, -0.12021093496508202, 0.11530743629266954, -0.08304564282692717, -0.09766114307804254, 0.031251641033785575, 0.3547403658187743, -0.26062673053869945, -0.2645303243652807, 0.11136400920508618, -0.2509917963801299, -0.0927871079485019, 0.18679696865482415, -0.03207006576960369... |
1,801.06728 | Limiting optical diodes enabled by the phase transition of vanadium
dioxide | A limiting optical diode is an asymmetric nonlinear device that is
bidirectionally transparent at low power, but becomes opaque when illuminated
by sufficiently intense light incident from a particular direction. We explore
the use of a phase-transition material, vanadium dioxide (VO2), as an active
element of limiti... | physics.app-ph physics.optics | a limiting optical diode is an asymmetric nonlinear device that is bidirectionally transparent at low power but becomes opaque when illuminated by sufficiently intense light incident from a particular direction we explore the use of a phasetransition material vanadium dioxide vo2 as an active element of limiting optica... | [['a', 'limiting', 'optical', 'diode', 'is', 'an', 'asymmetric', 'nonlinear', 'device', 'that', 'is', 'bidirectionally', 'transparent', 'at', 'low', 'power', 'but', 'becomes', 'opaque', 'when', 'illuminated', 'by', 'sufficiently', 'intense', 'light', 'incident', 'from', 'a', 'particular', 'direction', 'we', 'explore', ... | [-0.1192402389144615, 0.1801685375629008, -0.03681994048698294, -0.06650332906959398, -0.04568225331754694, -0.2031569098663186, 0.06997497384060895, 0.5448374825619882, -0.22895828759477985, -0.2850569748529984, 0.07607406153974514, -0.2864600056061341, -0.12767666408852224, 0.25285183537841566, -0.04424878507777447, ... |
1,801.06729 | EnKCF: Ensemble of Kernelized Correlation Filters for High-Speed Object
Tracking | Computer vision technologies are very attractive for practical applications
running on embedded systems. For such an application, it is desirable for the
deployed algorithms to run in high-speed and require no offline training. To
develop a single-target tracking algorithm with these properties, we propose an
ensembl... | cs.CV | computer vision technologies are very attractive for practical applications running on embedded systems for such an application it is desirable for the deployed algorithms to run in highspeed and require no offline training to develop a singletarget tracking algorithm with these properties we propose an ensemble of the... | [['computer', 'vision', 'technologies', 'are', 'very', 'attractive', 'for', 'practical', 'applications', 'running', 'on', 'embedded', 'systems', 'for', 'such', 'an', 'application', 'it', 'is', 'desirable', 'for', 'the', 'deployed', 'algorithms', 'to', 'run', 'in', 'highspeed', 'and', 'require', 'no', 'offline', 'traini... | [-0.06762842907072891, 0.015050501083367801, -0.06416510791195006, 0.02897234757653099, -0.0379230567000129, -0.1717032331814566, 0.04306527297740104, 0.47070352560417217, -0.17270412810400806, -0.37539508488367906, 0.10858775959456, -0.29421900650168853, -0.10321564213584432, 0.2630733852044531, -0.09713652480435982, ... |
1,801.0673 | Web password recovery --- a necessary evil? | Web password recovery, enabling a user who forgets their password to
re-establish a shared secret with a website, is very widely implemented.
However, use of such a fall-back system brings with it additional
vulnerabilities to user authentication. This paper provides a framework within
which such systems can be analy... | cs.CR | web password recovery enabling a user who forgets their password to reestablish a shared secret with a website is very widely implemented however use of such a fallback system brings with it additional vulnerabilities to user authentication this paper provides a framework within which such systems can be analysed syste... | [['web', 'password', 'recovery', 'enabling', 'a', 'user', 'who', 'forgets', 'their', 'password', 'to', 'reestablish', 'a', 'shared', 'secret', 'with', 'a', 'website', 'is', 'very', 'widely', 'implemented', 'however', 'use', 'of', 'such', 'a', 'fallback', 'system', 'brings', 'with', 'it', 'additional', 'vulnerabilities'... | [-0.11302479399936431, -0.0009036688055148569, -0.10878380899459629, 0.08748118738126862, -0.13550499155209794, -0.22196556905174028, 0.09739057606646508, 0.38021969863300414, -0.29160701578198855, -0.3507715506258152, 0.13292950201558612, -0.25592255947906206, -0.14614352650971987, 0.2091616747892951, -0.1312163556586... |
1,801.06731 | Regularity and Gr\"obner bases of the Rees algebra of edge ideals of
bipartite graphs | Let $G$ be a bipartite graph and $I=I(G)$ be its edge ideal. The aim of this
note is to investigate different aspects of the Rees algebra $\mathcal{R}(I)$
of $I$. We compute its regularity and the universal Gr\"obner basis of its
defining equations; interestingly, both of them are described in terms of the
combinator... | math.AC math.CO | let g be a bipartite graph and iig be its edge ideal the aim of this note is to investigate different aspects of the rees algebra mathcalri of i we compute its regularity and the universal grobner basis of its defining equations interestingly both of them are described in terms of the combinatorics of g we apply these ... | [['let', 'g', 'be', 'a', 'bipartite', 'graph', 'and', 'iig', 'be', 'its', 'edge', 'ideal', 'the', 'aim', 'of', 'this', 'note', 'is', 'to', 'investigate', 'different', 'aspects', 'of', 'the', 'rees', 'algebra', 'mathcalri', 'of', 'i', 'we', 'compute', 'its', 'regularity', 'and', 'the', 'universal', 'grobner', 'basis', '... | [-0.15665922907049742, 0.07312173439333072, -0.08379669729859018, 0.025814537185793504, -0.07091019624987474, -0.12446178591404206, -0.01779582550844703, 0.32068143111581987, -0.3464380904363516, -0.23426416663763425, 0.1283006051611991, -0.26651029096534234, -0.1354106324426352, 0.1355599701129951, -0.0905342205600717... |
1,801.06732 | Boundary-based Image Forgery Detection by Fast Shallow CNN | Image forgery detection is the task of detecting and localizing forged parts
in tampered images. Previous works mostly focus on high resolution images using
traces of resampling features, demosaicing features or sharpness of edges.
However, a good detection method should also be applicable to low resolution
images be... | cs.CV | image forgery detection is the task of detecting and localizing forged parts in tampered images previous works mostly focus on high resolution images using traces of resampling features demosaicing features or sharpness of edges however a good detection method should also be applicable to low resolution images because ... | [['image', 'forgery', 'detection', 'is', 'the', 'task', 'of', 'detecting', 'and', 'localizing', 'forged', 'parts', 'in', 'tampered', 'images', 'previous', 'works', 'mostly', 'focus', 'on', 'high', 'resolution', 'images', 'using', 'traces', 'of', 'resampling', 'features', 'demosaicing', 'features', 'or', 'sharpness', 'o... | [-0.06084941466604023, 0.002613825025036931, -0.061317344614113846, 0.06089262220467138, -0.07075032252251698, -0.1823057218690414, 0.009457867907455573, 0.4747274660067745, -0.22559161011286707, -0.3434093264969492, 0.1268480882870527, -0.32133815432505974, -0.15293949043815844, 0.16337895841219924, -0.189298282496817... |
1,801.06733 | Probabilistic Tools for the Analysis of Randomized Optimization
Heuristics | This chapter collects several probabilistic tools that proved to be useful in
the analysis of randomized search heuristics. This includes classic material
like Markov, Chebyshev and Chernoff inequalities, but also lesser known topics
like stochastic domination and coupling or Chernoff bounds for geometrically
distrib... | cs.DS cs.DM cs.NE math.PR | this chapter collects several probabilistic tools that proved to be useful in the analysis of randomized search heuristics this includes classic material like markov chebyshev and chernoff inequalities but also lesser known topics like stochastic domination and coupling or chernoff bounds for geometrically distributed ... | [['this', 'chapter', 'collects', 'several', 'probabilistic', 'tools', 'that', 'proved', 'to', 'be', 'useful', 'in', 'the', 'analysis', 'of', 'randomized', 'search', 'heuristics', 'this', 'includes', 'classic', 'material', 'like', 'markov', 'chebyshev', 'and', 'chernoff', 'inequalities', 'but', 'also', 'lesser', 'known'... | [-0.061467825734784994, 0.11370314803841237, -0.08563318594109894, 0.11869333715795881, -0.10883728564154393, -0.20183849440758475, 0.07561595118973441, 0.3532410975843023, -0.2748298004078264, -0.3366941425045676, 0.16897733932439385, -0.2640881389195081, -0.1920555805151194, 0.2608464402469373, -0.09082438786615535, ... |
1,801.06734 | End-to-end Multi-Modal Multi-Task Vehicle Control for Self-Driving Cars
with Visual Perception | Convolutional Neural Networks (CNN) have been successfully applied to
autonomous driving tasks, many in an end-to-end manner. Previous end-to-end
steering control methods take an image or an image sequence as the input and
directly predict the steering angle with CNN. Although single task learning on
steering angles ... | cs.CV | convolutional neural networks cnn have been successfully applied to autonomous driving tasks many in an endtoend manner previous endtoend steering control methods take an image or an image sequence as the input and directly predict the steering angle with cnn although single task learning on steering angles has reporte... | [['convolutional', 'neural', 'networks', 'cnn', 'have', 'been', 'successfully', 'applied', 'to', 'autonomous', 'driving', 'tasks', 'many', 'in', 'an', 'endtoend', 'manner', 'previous', 'endtoend', 'steering', 'control', 'methods', 'take', 'an', 'image', 'or', 'an', 'image', 'sequence', 'as', 'the', 'input', 'and', 'dir... | [-0.0935073694480317, 0.01958941861092891, -0.058240197747331725, 0.033823553629470274, -0.1069854173584135, -0.23666808397284003, 0.029855584341950795, 0.5047573523984833, -0.2761740338870908, -0.35403422035972826, 0.0565658956113691, -0.22666298158103498, -0.18889606020101193, 0.22500250208099465, -0.15762323391327, ... |
1,801.06735 | Long time dynamics for weakly damped nonlinear Klein-Gordon equations | We continue our study of damped nonlinear Klein-Gordon equations. In our
previous work we considered fixed positive damping and proved a form of the
soliton resolution conjecture for radial solutions. In contrast, here we
consider damping which decreases in time to 0. In the class of radial data we
again establish so... | math.AP | we continue our study of damped nonlinear kleingordon equations in our previous work we considered fixed positive damping and proved a form of the soliton resolution conjecture for radial solutions in contrast here we consider damping which decreases in time to 0 in the class of radial data we again establish soliton r... | [['we', 'continue', 'our', 'study', 'of', 'damped', 'nonlinear', 'kleingordon', 'equations', 'in', 'our', 'previous', 'work', 'we', 'considered', 'fixed', 'positive', 'damping', 'and', 'proved', 'a', 'form', 'of', 'the', 'soliton', 'resolution', 'conjecture', 'for', 'radial', 'solutions', 'in', 'contrast', 'here', 'we'... | [-0.15619855835783955, 0.06977462238155124, -0.09116264285019986, 0.05020380465643162, -0.0975517799379304, -0.15213379832893248, 0.013830491328873195, 0.33613714787018734, -0.24959588121259357, -0.2233158562491398, 0.07962858693591864, -0.2667788458823385, -0.152861091217435, 0.18890612813212523, -0.046485132776291634... |
1,801.06736 | On the Construction of Quasi-Binary and Quasi-Orthogonal Matrices over
Finite Fields | Orthogonal and quasi-orthogonal matrices have a long history of use in
digital image processing, digital and wireless communications, cryptography and
many other areas of computer science and coding theory. The practical benefits
of using orthogonal matrices come from the fact that the computation of inverse
matrices... | cs.IT cs.CR cs.DM math.IT | orthogonal and quasiorthogonal matrices have a long history of use in digital image processing digital and wireless communications cryptography and many other areas of computer science and coding theory the practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is av... | [['orthogonal', 'and', 'quasiorthogonal', 'matrices', 'have', 'a', 'long', 'history', 'of', 'use', 'in', 'digital', 'image', 'processing', 'digital', 'and', 'wireless', 'communications', 'cryptography', 'and', 'many', 'other', 'areas', 'of', 'computer', 'science', 'and', 'coding', 'theory', 'the', 'practical', 'benefit... | [-0.15091276881146695, 0.12108374048909921, -0.04726908474671885, 0.014616342832560254, -0.05678021051289311, -0.16374676106820382, 0.05070966347766173, 0.3913554697583365, -0.2994013769773416, -0.2461596763609807, 0.1483606318528257, -0.24935385669779844, -0.20026308871312343, 0.183205753436893, -0.08923566961268511, ... |
1,801.06737 | At What Frequency Should the Kelly Bettor Bet? | We study the problem of optimizing the betting frequency in a dynamic game
setting using Kelly's celebrated expected logarithmic growth criterion as the
performance metric. The game is defined by a sequence of bets with independent
and identically distributed returns X(k). The bettor selects the fraction of
wealth K ... | math.OC q-fin.CP q-fin.MF q-fin.PM | we study the problem of optimizing the betting frequency in a dynamic game setting using kellys celebrated expected logarithmic growth criterion as the performance metric the game is defined by a sequence of bets with independent and identically distributed returns xk the bettor selects the fraction of wealth k wagered... | [['we', 'study', 'the', 'problem', 'of', 'optimizing', 'the', 'betting', 'frequency', 'in', 'a', 'dynamic', 'game', 'setting', 'using', 'kellys', 'celebrated', 'expected', 'logarithmic', 'growth', 'criterion', 'as', 'the', 'performance', 'metric', 'the', 'game', 'is', 'defined', 'by', 'a', 'sequence', 'of', 'bets', 'wi... | [-0.12601723394796963, 0.09595774334964319, -0.07520881981193904, 0.07409497384971248, -0.06050117655225997, -0.18752832715091539, 0.10169064727938437, 0.3567577623254855, -0.2630322841412826, -0.2577794461661917, 0.10146082039552846, -0.285978085466512, -0.1283821479633907, 0.15869897883928993, -0.1182190263517027, 0.... |
1,801.06738 | Two classes of finite groups whose Chermak-Delgado lattice is a chain of
length zero | It is an open question in the study of Chermak-Delgado lattices precisely
which finite groups $G$ have the property that $CD(G)$ is a chain of length
$0$. In this note, we determine two classes of groups with this property. We
prove that if $G=AB$ is a finite group, where $A$ and $B$ are abelian subgroups
of relative... | math.GR | it is an open question in the study of chermakdelgado lattices precisely which finite groups g have the property that cdg is a chain of length 0 in this note we determine two classes of groups with this property we prove that if gab is a finite group where a and b are abelian subgroups of relatively prime orders with a... | [['it', 'is', 'an', 'open', 'question', 'in', 'the', 'study', 'of', 'chermakdelgado', 'lattices', 'precisely', 'which', 'finite', 'groups', 'g', 'have', 'the', 'property', 'that', 'cdg', 'is', 'a', 'chain', 'of', 'length', '0', 'in', 'this', 'note', 'we', 'determine', 'two', 'classes', 'of', 'groups', 'with', 'this', '... | [-0.20590781133815453, 0.20370175598915696, -0.10684917702690347, 0.014918170864814772, -0.07561565589087156, -0.11812478983049075, 0.046653715990387, 0.41219631313987365, -0.3055498916413877, -0.2162137504836375, 0.11408182446596926, -0.2678029341260334, -0.1012013613839041, 0.17621513684703546, -0.07705768501361857, ... |
1,801.06739 | Missing at random: a stochastic process perspective | We offer a natural and extensible measure-theoretic treatment of missingness
at random. Within the standard missing data framework, we give a novel
characterisation of the observed data as a stopping-set sigma algebra. We
demonstrate that the usual missingness at random conditions are equivalent to
requiring particul... | stat.ME | we offer a natural and extensible measuretheoretic treatment of missingness at random within the standard missing data framework we give a novel characterisation of the observed data as a stoppingset sigma algebra we demonstrate that the usual missingness at random conditions are equivalent to requiring particular stoc... | [['we', 'offer', 'a', 'natural', 'and', 'extensible', 'measuretheoretic', 'treatment', 'of', 'missingness', 'at', 'random', 'within', 'the', 'standard', 'missing', 'data', 'framework', 'we', 'give', 'a', 'novel', 'characterisation', 'of', 'the', 'observed', 'data', 'as', 'a', 'stoppingset', 'sigma', 'algebra', 'we', 'd... | [-0.08264211583098033, 0.08292720056867794, -0.136975978491018, 0.1563646106730195, -0.1337433476557793, -0.15320229943861943, 0.06798624960482931, 0.3731068175933931, -0.2841956768002685, -0.238906519533054, 0.11792919266989212, -0.20925650543168836, -0.1103373616123977, 0.1215767613409654, -0.14430720584072254, 0.083... |
1,801.0674 | Knowledge Representation for High-Level Norms and Violation Inference in
Logic Programming | Most of the knowledge Representation formalisms developed for representing
prescriptive norms can be categorized as either suitable for representing
either low level or high level norms.We argue that low level norm
representations do not advance the cause of autonomy in agents in the sense
that it is not the agent it... | cs.MA cs.AI | most of the knowledge representation formalisms developed for representing prescriptive norms can be categorized as either suitable for representing either low level or high level normswe argue that low level norm representations do not advance the cause of autonomy in agents in the sense that it is not the agent itsel... | [['most', 'of', 'the', 'knowledge', 'representation', 'formalisms', 'developed', 'for', 'representing', 'prescriptive', 'norms', 'can', 'be', 'categorized', 'as', 'either', 'suitable', 'for', 'representing', 'either', 'low', 'level', 'or', 'high', 'level', 'normswe', 'argue', 'that', 'low', 'level', 'norm', 'representa... | [-0.10091861032843824, 0.09893650210742103, -0.0905438503500115, 0.1073743087628264, -0.12253634905087991, -0.15215237998446474, 0.06338267244649934, 0.3554044959747143, -0.28546413938294724, -0.296051819849697, 0.12690781072078264, -0.24780120055880944, -0.12142034781664204, 0.14261538979561345, -0.1161884374100185, -... |
1,801.06741 | Special polarization characteristic features of a three dimensional
terahertz photonic crystal not apparently apply to physical and optical basic
rules | A silicon inverse diamond structure whose lattice point shape was vacant
regular octahedrons had a complete photonic band gap at around 0.4 THz and X
point's photonic band gap (0.36 THz to 0.44 THz) by plane wave expansion
method. It is said that three-dimensional photonic crystals have no
polarization anisotropy in ... | physics.optics | a silicon inverse diamond structure whose lattice point shape was vacant regular octahedrons had a complete photonic band gap at around 04 thz and x points photonic band gap 036 thz to 044 thz by plane wave expansion method it is said that threedimensional photonic crystals have no polarization anisotropy in photonic b... | [['a', 'silicon', 'inverse', 'diamond', 'structure', 'whose', 'lattice', 'point', 'shape', 'was', 'vacant', 'regular', 'octahedrons', 'had', 'a', 'complete', 'photonic', 'band', 'gap', 'at', 'around', '04', 'thz', 'and', 'x', 'points', 'photonic', 'band', 'gap', '036', 'thz', 'to', '044', 'thz', 'by', 'plane', 'wave', ... | [-0.1887989895631533, 0.203202624739652, -0.02093215842521595, -0.012894786001622641, -0.1066312576409116, -0.1000370023854808, 0.06909436665618984, 0.495846554854554, -0.2968184787488464, -0.2994120740440509, 0.030766600443737878, -0.29577092166607066, -0.09811850938789338, 0.18510768581323203, 0.039177728209766415, 0... |
1,801.06742 | Multi-pseudo Regularized Label for Generated Data in Person
Re-Identification | Sufficient training data normally is required to train deeply learned models.
However, due to the expensive manual process for labelling large number of
images, the amount of available training data is always limited. To produce
more data for training a deep network, Generative Adversarial Network (GAN) can
be used t... | cs.CV | sufficient training data normally is required to train deeply learned models however due to the expensive manual process for labelling large number of images the amount of available training data is always limited to produce more data for training a deep network generative adversarial network gan can be used to generat... | [['sufficient', 'training', 'data', 'normally', 'is', 'required', 'to', 'train', 'deeply', 'learned', 'models', 'however', 'due', 'to', 'the', 'expensive', 'manual', 'process', 'for', 'labelling', 'large', 'number', 'of', 'images', 'the', 'amount', 'of', 'available', 'training', 'data', 'is', 'always', 'limited', 'to',... | [-0.04685089660786999, 0.00858023187938032, -0.028707377117519316, 0.055887651450661664, -0.13504914701344412, -0.14894697773352003, 0.04732409603607825, 0.4452182642461961, -0.2514676463953628, -0.3602826089581899, 0.05838742927697144, -0.3076086572077321, -0.1229655444099192, 0.20837154987088422, -0.1321825858642625,... |
1,801.06743 | Ce$_{3-x}$Mg$_x$Co$_{9}$: transformation of a Pauli paramagnet into a
strong permanent magnet | We report on the synthesis of single crystalline and polycrystalline samples
of Ce$_{3-x}$Mg$_x$Co$_9$ solid solution ($0\leq x \lesssim 1.4$) and
characterization of their structural and magnetic properties. The crystal
structure remains rhombohedral in the whole composition range and Mg partially
replaces Ce in the... | cond-mat.mtrl-sci | we report on the synthesis of single crystalline and polycrystalline samples of ce_3xmg_xco_9 solid solution 0leq x lesssim 14 and characterization of their structural and magnetic properties the crystal structure remains rhombohedral in the whole composition range and mg partially replaces ce in the 6textitc site of t... | [['we', 'report', 'on', 'the', 'synthesis', 'of', 'single', 'crystalline', 'and', 'polycrystalline', 'samples', 'of', 'ce_3xmg_xco_9', 'solid', 'solution', '0leq', 'x', 'lesssim', '14', 'and', 'characterization', 'of', 'their', 'structural', 'and', 'magnetic', 'properties', 'the', 'crystal', 'structure', 'remains', 'rh... | [-0.12974554376876693, 0.21793587145720994, 0.02267056661220455, -0.047635698871883944, -0.047018039672738626, -0.11137713581923671, 0.08788399632095091, 0.41792187089688027, -0.24955756323499567, -0.3551152930063689, 0.03356973575928167, -0.3185449175899161, -0.05050924148460562, 0.17377602343522514, 0.051890736708305... |
1,801.06744 | Bilinear pseudo-differential operators with exotic symbols | The boundedness from $L^p \times L^q$ to $L^r$, $1<p,q \le \infty$,
$0<1/p+1/q=1/r \le 1$, of bilinear pseudo-differential operators with symbols
in the bilinear H\"ormander class $BS^m_{\rho,\rho}$, $0 \le \rho <1$, is
proved for the critical order $m$. Related results for the cases $p=1$, $q=1$
or $r=\infty$ are al... | math.CA | the boundedness from lp times lq to lr 1pq le infty 01p1q1r le 1 of bilinear pseudodifferential operators with symbols in the bilinear hormander class bsm_rhorho 0 le rho 1 is proved for the critical order m related results for the cases p1 q1 or rinfty are also obtained | [['the', 'boundedness', 'from', 'lp', 'times', 'lq', 'to', 'lr', '1pq', 'le', 'infty', '01p1q1r', 'le', '1', 'of', 'bilinear', 'pseudodifferential', 'operators', 'with', 'symbols', 'in', 'the', 'bilinear', 'hormander', 'class', 'bsm_rhorho', '0', 'le', 'rho', '1', 'is', 'proved', 'for', 'the', 'critical', 'order', 'm',... | [-0.1534204682573042, 0.13018370285367672, 0.03027809316668897, 0.13579873353530197, -0.035467416270972885, -0.23335222531347832, -0.03916635011580396, 0.2748915287566946, -0.31877206583963114, -0.1616630802362008, 0.16642776723366548, -0.3650339256892813, -0.05872328684942678, 0.16858249076424128, -0.06720607678227603... |
1,801.06745 | Bilinear pseudo-differential operators with exotic symbols, II | The boundedness from $H^p \times L^2$ to $L^r$, $1/p+1/2=1/r$, and from $H^p
\times L^{\infty}$ to $L^p$ of bilinear pseudo-differential operators is proved
under the assumption that their symbols are in the bilinear H\"ormander class
$BS^m_{\rho,\rho}$, $0 \le \rho <1$, of critical order $m$, where $H^p$ is the
Hard... | math.CA | the boundedness from hp times l2 to lr 1p121r and from hp times linfty to lp of bilinear pseudodifferential operators is proved under the assumption that their symbols are in the bilinear hormander class bsm_rhorho 0 le rho 1 of critical order m where hp is the hardy space this combined with the previous results of the... | [['the', 'boundedness', 'from', 'hp', 'times', 'l2', 'to', 'lr', '1p121r', 'and', 'from', 'hp', 'times', 'linfty', 'to', 'lp', 'of', 'bilinear', 'pseudodifferential', 'operators', 'is', 'proved', 'under', 'the', 'assumption', 'that', 'their', 'symbols', 'are', 'in', 'the', 'bilinear', 'hormander', 'class', 'bsm_rhorho'... | [-0.12378656629997509, 0.14519838743639746, -0.0360135432043723, 0.09173584285449109, -0.05108907271776049, -0.12671713291228504, 0.00812999869097324, 0.29889224131388226, -0.3227275513198184, -0.16004952593524566, 0.12312052091690658, -0.3025780352068016, -0.035214915446102106, 0.14611617380207212, -0.0836615523580333... |
1,801.06746 | The Effect of Gravitational Settling on Concentration Profiles and
Dispersion Within and Above Fractured Media | The transport of heavy particles in a medium that consists of fluid and solid
phases such as stream gravel beds, cracked soils and wetlands is affected by
processes such as attachment-detachment, gravity and drag, and by mixing
processes that are induced by Taylor dispersion and mechanical dispersion. This
paper addr... | physics.flu-dyn | the transport of heavy particles in a medium that consists of fluid and solid phases such as stream gravel beds cracked soils and wetlands is affected by processes such as attachmentdetachment gravity and drag and by mixing processes that are induced by taylor dispersion and mechanical dispersion this paper addresses a... | [['the', 'transport', 'of', 'heavy', 'particles', 'in', 'a', 'medium', 'that', 'consists', 'of', 'fluid', 'and', 'solid', 'phases', 'such', 'as', 'stream', 'gravel', 'beds', 'cracked', 'soils', 'and', 'wetlands', 'is', 'affected', 'by', 'processes', 'such', 'as', 'attachmentdetachment', 'gravity', 'and', 'drag', 'and',... | [-0.10548681871333315, 0.20112445760770262, -0.0880538250785321, 0.025844159496975314, -0.04578998626505507, -0.0910888442949793, -0.0010163888915605082, 0.34667376874789707, -0.28637869248547365, -0.32842085415830524, 0.05793606118769827, -0.26665499394616776, -0.09272677843615304, 0.18013879801588553, -0.047232046460... |
1,801.06747 | Connectivity of cubical polytopes | A cubical polytope is a polytope with all its facets being combinatorially
equivalent to cubes. We deal with the connectivity of the graphs of cubical
polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical
$d$-polytope with minimum degree $\delta$ is $\min\{\delta,2d-2\}$-connected.
Second, we s... | math.CO | a cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes we deal with the connectivity of the graphs of cubical polytopes we first establish that for any dge 3 the graph of a cubical dpolytope with minimum degree delta is mindelta2d2connected second we show for any dge 4 that every... | [['a', 'cubical', 'polytope', 'is', 'a', 'polytope', 'with', 'all', 'its', 'facets', 'being', 'combinatorially', 'equivalent', 'to', 'cubes', 'we', 'deal', 'with', 'the', 'connectivity', 'of', 'the', 'graphs', 'of', 'cubical', 'polytopes', 'we', 'first', 'establish', 'that', 'for', 'any', 'dge', '3', 'the', 'graph', 'o... | [-0.14981861212678874, 0.09457780458615161, -0.014665964966601072, 0.01160502605731987, -0.08179567945383799, -0.15031820229584505, 0.01652445261424873, 0.3645344999774049, -0.2963549299032214, -0.23984421784310447, 0.10829073209000246, -0.3761357640226682, -0.12876849634146006, 0.05667656661292616, -0.1048341137405562... |
1,801.06748 | Microwave fields driven domain wall motions in antiferromagnetic
nanowires | In this work, we study the microwave field driven antiferromagnetic domain
wall motion in an antiferromagnetic nanowire, using the numerical calculations
based on a classical Heisenberg spin model. We show that a proper combination
of a static magnetic field plus an oscillating field perpendicular to the
nanowire axi... | physics.app-ph cond-mat.mes-hall | in this work we study the microwave field driven antiferromagnetic domain wall motion in an antiferromagnetic nanowire using the numerical calculations based on a classical heisenberg spin model we show that a proper combination of a static magnetic field plus an oscillating field perpendicular to the nanowire axis is ... | [['in', 'this', 'work', 'we', 'study', 'the', 'microwave', 'field', 'driven', 'antiferromagnetic', 'domain', 'wall', 'motion', 'in', 'an', 'antiferromagnetic', 'nanowire', 'using', 'the', 'numerical', 'calculations', 'based', 'on', 'a', 'classical', 'heisenberg', 'spin', 'model', 'we', 'show', 'that', 'a', 'proper', 'c... | [-0.19606234814397924, 0.18492038455712775, -0.031750118556166336, -0.0017658457796122613, -0.14100285986039254, -0.093843299146725, -0.017730711942671666, 0.4599244679723467, -0.2634074042584481, -0.2587129461845117, 0.04961259984785491, -0.23323797141867025, -0.08990087575013084, 0.23746111779141107, 0.05842815742694... |
1,801.06749 | A general approach to approximation theory of operator semigroups | We develop a general, functional calculus approach to approximation of
$C_0$-semigroups on Banach spaces by bounded completely monotone functions of
their generators. The approach comprises most of well-known approximation
formulas, yields optimal convergence rates, and sometimes even leads to sharp
constants. In an ... | math.FA math.AP math.NA | we develop a general functional calculus approach to approximation of c_0semigroups on banach spaces by bounded completely monotone functions of their generators the approach comprises most of wellknown approximation formulas yields optimal convergence rates and sometimes even leads to sharp constants in an important p... | [['we', 'develop', 'a', 'general', 'functional', 'calculus', 'approach', 'to', 'approximation', 'of', 'c_0semigroups', 'on', 'banach', 'spaces', 'by', 'bounded', 'completely', 'monotone', 'functions', 'of', 'their', 'generators', 'the', 'approach', 'comprises', 'most', 'of', 'wellknown', 'approximation', 'formulas', 'y... | [-0.05989782110349658, 0.060919735921882365, -0.0545719012946767, 0.1344072540564572, -0.06998252751963104, -0.09394923439797233, 0.044944090745411815, 0.38534576904905193, -0.27093500095720896, -0.22546545510344645, 0.11933823442223537, -0.24652882229317638, -0.18728094002341522, 0.2612935785423307, -0.101508245357955... |
1,801.0675 | A Formal Framework For Probabilistic Unclean Databases | Most theoretical frameworks that focus on data errors and inconsistencies
follow logic-based reasoning. Yet, practical data cleaning tools need to
incorporate statistical reasoning to be effective in real-world data cleaning
tasks. Motivated by these empirical successes, we propose a formal framework
for unclean data... | cs.DB | most theoretical frameworks that focus on data errors and inconsistencies follow logicbased reasoning yet practical data cleaning tools need to incorporate statistical reasoning to be effective in realworld data cleaning tasks motivated by these empirical successes we propose a formal framework for unclean databases wh... | [['most', 'theoretical', 'frameworks', 'that', 'focus', 'on', 'data', 'errors', 'and', 'inconsistencies', 'follow', 'logicbased', 'reasoning', 'yet', 'practical', 'data', 'cleaning', 'tools', 'need', 'to', 'incorporate', 'statistical', 'reasoning', 'to', 'be', 'effective', 'in', 'realworld', 'data', 'cleaning', 'tasks'... | [-0.07304187357436354, 0.018443978475622267, -0.07750851849142021, 0.10899438395943378, -0.14803454101899682, -0.1625970235638292, 0.09156349445835381, 0.3731516799942825, -0.28277075992682094, -0.3213035227048374, 0.07119504425395635, -0.26468887629932975, -0.17050918153214326, 0.19307111113115377, -0.1621475306460420... |
1,801.06751 | A Tractable Approach for designing Piecewise Affine Policies in
Two-stage Adjustable Robust Optimization | We consider the problem of designing piecewise affine policies for two-stage
adjustable robust linear optimization problems under right-hand side
uncertainty. It is well known that a piecewise affine policy is optimal
although the number of pieces can be exponentially large. A significant
challenge in designing a pra... | math.OC | we consider the problem of designing piecewise affine policies for twostage adjustable robust linear optimization problems under righthand side uncertainty it is well known that a piecewise affine policy is optimal although the number of pieces can be exponentially large a significant challenge in designing a practical... | [['we', 'consider', 'the', 'problem', 'of', 'designing', 'piecewise', 'affine', 'policies', 'for', 'twostage', 'adjustable', 'robust', 'linear', 'optimization', 'problems', 'under', 'righthand', 'side', 'uncertainty', 'it', 'is', 'well', 'known', 'that', 'a', 'piecewise', 'affine', 'policy', 'is', 'optimal', 'although'... | [-0.09455671039750983, 0.05032558660488849, -0.08305475518693317, 0.08314900151880222, -0.12290572156657426, -0.16895178785468912, 0.0848927838998921, 0.38859036388509677, -0.35387510946239104, -0.2669355268896221, 0.1673896633101706, -0.22875863405058222, -0.14746401448703497, 0.23487475120348794, -0.1306188612101827,... |
1,801.06752 | Translating the Architectural Complexity of the Colon or Polyp into a
Sinusoid Wave for Classification via the Fast Fourier Transform | There is no method to quantify the spatial complexity within colon polyps.
This paper describes a spatial transformation that translates the tissue
architecture within a polyp, or a normal colon lining, into a complex sinusoid
wave composed of discrete points. This sinusoid wave can then undergo the Fast
Fourier Tran... | q-bio.QM q-bio.TO | there is no method to quantify the spatial complexity within colon polyps this paper describes a spatial transformation that translates the tissue architecture within a polyp or a normal colon lining into a complex sinusoid wave composed of discrete points this sinusoid wave can then undergo the fast fourier transform ... | [['there', 'is', 'no', 'method', 'to', 'quantify', 'the', 'spatial', 'complexity', 'within', 'colon', 'polyps', 'this', 'paper', 'describes', 'a', 'spatial', 'transformation', 'that', 'translates', 'the', 'tissue', 'architecture', 'within', 'a', 'polyp', 'or', 'a', 'normal', 'colon', 'lining', 'into', 'a', 'complex', '... | [-0.12392702936115911, 0.0980418497224445, -0.07846655040916245, -4.592644429560435e-05, -0.06216832169063263, -0.12265614909988086, 0.026203913486491637, 0.4018428789499074, -0.28462332491210457, -0.22051610739870092, 0.0971444067375545, -0.28427705480322496, -0.1271618253054192, 0.17197478072228448, -0.06907905505543... |
1,801.06753 | Unitary dual of quasi-split $PGSO_8^E$ | In this paper, we first determine the explicit Langlands classification for
the quasi-split group $PGSO_8^E$ by following Casselman-Tadi$\acute{c}$'s
Jacquet module machine. Based on the classification, we furthur sort out the
unitary dual of $PGSO_8^E$ and compute the Aubert duality.
| math.RT | in this paper we first determine the explicit langlands classification for the quasisplit group pgso_8e by following casselmantadiacutecs jacquet module machine based on the classification we furthur sort out the unitary dual of pgso_8e and compute the aubert duality | [['in', 'this', 'paper', 'we', 'first', 'determine', 'the', 'explicit', 'langlands', 'classification', 'for', 'the', 'quasisplit', 'group', 'pgso_8e', 'by', 'following', 'casselmantadiacutecs', 'jacquet', 'module', 'machine', 'based', 'on', 'the', 'classification', 'we', 'furthur', 'sort', 'out', 'the', 'unitary', 'dua... | [-0.137700824946579, -0.021255268880243722, -0.17296826743727756, 0.04754808636627988, -0.12946897116489708, -0.1281416471530166, 0.05049942128890608, 0.3105522059938974, -0.2912365215209623, -0.20963456269560587, 0.10126541531968138, -0.14956889152785557, -0.19837108337216908, 0.1819649008102715, -0.15995433000433776,... |
1,801.06754 | The Slow-coloring Game on Sparse Graphs: $k$-Degenerate, Planar, and
Outerplanar | The \emph{slow-coloring game} is played by Lister and Painter on a graph $G$.
Initially, all vertices of $G$ are uncolored. In each round, Lister marks a
nonempty set $M$ of uncolored vertices, and Painter colors a subset of $M$ that
is independent in $G$. The game ends when all vertices are colored. The score
of the... | math.CO | the emphslowcoloring game is played by lister and painter on a graph g initially all vertices of g are uncolored in each round lister marks a nonempty set m of uncolored vertices and painter colors a subset of m that is independent in g the game ends when all vertices are colored the score of the game is the sum of the... | [['the', 'emphslowcoloring', 'game', 'is', 'played', 'by', 'lister', 'and', 'painter', 'on', 'a', 'graph', 'g', 'initially', 'all', 'vertices', 'of', 'g', 'are', 'uncolored', 'in', 'each', 'round', 'lister', 'marks', 'a', 'nonempty', 'set', 'm', 'of', 'uncolored', 'vertices', 'and', 'painter', 'colors', 'a', 'subset', ... | [-0.15556376471760727, 0.1736549498892557, -0.06919661535426885, -0.02786856988677755, -0.11748524498848599, -0.19303500696384748, 0.05917863181024413, 0.45301708080140607, -0.22084758643385222, -0.3574997926895906, 0.05132020525273956, -0.39505361663621097, -0.12798407514873406, 0.051272943459307066, -0.16142591754795... |
1,801.06755 | Observations of Electron-driven Evaporation during a Flare Precursor | We investigate the relationship between the blue shifts of a hot emission
line and the nonthermal emissions in microwave and hard X-ray (HXR) wavelengths
during the precursor of a solar flare on 2014 October 27. The flare precursor
is identified as a small but well-developed peak in soft X-ray and
extreme-ultraviolet... | astro-ph.SR | we investigate the relationship between the blue shifts of a hot emission line and the nonthermal emissions in microwave and hard xray hxr wavelengths during the precursor of a solar flare on 2014 october 27 the flare precursor is identified as a small but welldeveloped peak in soft xray and extremeultraviolet passband... | [['we', 'investigate', 'the', 'relationship', 'between', 'the', 'blue', 'shifts', 'of', 'a', 'hot', 'emission', 'line', 'and', 'the', 'nonthermal', 'emissions', 'in', 'microwave', 'and', 'hard', 'xray', 'hxr', 'wavelengths', 'during', 'the', 'precursor', 'of', 'a', 'solar', 'flare', 'on', '2014', 'october', '27', 'the'... | [-0.039975047106900724, 0.2592157399997785, 0.010407984597921962, 0.12889689786099173, -0.05307671206652897, -0.1336433813644407, 0.051754043979275195, 0.5241961770755524, -0.1653145837279424, -0.3454677915525632, 0.06864237550376352, -0.340415676633855, -0.04707152287171471, 0.21856603775367067, -0.016037729630012775,... |
1,801.06756 | Denoising Prior Driven Deep Neural Network for Image Restoration | Deep neural networks (DNNs) have shown very promising results for various
image restoration (IR) tasks. However, the design of network architectures
remains a major challenging for achieving further improvements. While most
existing DNN-based methods solve the IR problems by directly mapping low
quality images to des... | cs.CV | deep neural networks dnns have shown very promising results for various image restoration ir tasks however the design of network architectures remains a major challenging for achieving further improvements while most existing dnnbased methods solve the ir problems by directly mapping low quality images to desirable hig... | [['deep', 'neural', 'networks', 'dnns', 'have', 'shown', 'very', 'promising', 'results', 'for', 'various', 'image', 'restoration', 'ir', 'tasks', 'however', 'the', 'design', 'of', 'network', 'architectures', 'remains', 'a', 'major', 'challenging', 'for', 'achieving', 'further', 'improvements', 'while', 'most', 'existin... | [-0.04022446475051439, -0.06519275344191836, -0.08042768394956604, 0.06206801936202212, -0.07720797462747074, -0.21106893544395763, -0.017964291112282527, 0.5204619617416308, -0.3086437606557201, -0.3172417476659832, 0.1199565411085645, -0.21506950431861557, -0.26161441112307304, 0.1841761537696211, -0.1465019019750448... |
1,801.06757 | La falacia del empate t\'ecnico electoral | It is argued that the concept of "technical tie" in electoral polls and quick
counts has no probabilistic basis, and that instead the uncertainty associated
with these statistical exercises should be expressed in terms of a probability
of victory of the leading candidate.
-----
Se argumenta que el concepto de "em... | stat.AP | it is argued that the concept of technical tie in electoral polls and quick counts has no probabilistic basis and that instead the uncertainty associated with these statistical exercises should be expressed in terms of a probability of victory of the leading candidate se argumenta que el concepto de empate tecnico en e... | [['it', 'is', 'argued', 'that', 'the', 'concept', 'of', 'technical', 'tie', 'in', 'electoral', 'polls', 'and', 'quick', 'counts', 'has', 'no', 'probabilistic', 'basis', 'and', 'that', 'instead', 'the', 'uncertainty', 'associated', 'with', 'these', 'statistical', 'exercises', 'should', 'be', 'expressed', 'in', 'terms', ... | [-0.17348424325579068, 0.014145523014570206, -0.18841635803757628, 0.11186093659448425, -0.07880142571168466, -0.16644210384135516, 0.002889362832819912, 0.20599953788267056, -0.14566696454233058, -0.28193732842960406, 0.017695231251680935, -0.3518469525684773, -0.16969909921655774, 0.14090888097252643, -0.240858744567... |
1,801.06758 | List strong edge-coloring of graphs with maximum degree 4 | A strong edge-coloring of a graph $G$ is an edge-coloring such that any two
edges on a path of length three receive distinct colors. We denote the strong
chromatic index by $\chi_{s}'(G)$ which is the minimum number of colors that
allow a strong edge-coloring of $G$. Erd\H{o}s and Ne\v{s}et\v{r}il conjectured
in 1985... | math.CO | a strong edgecoloring of a graph g is an edgecoloring such that any two edges on a path of length three receive distinct colors we denote the strong chromatic index by chi_sg which is the minimum number of colors that allow a strong edgecoloring of g erdhos and nevsetvril conjectured in 1985 that the upper bound of chi... | [['a', 'strong', 'edgecoloring', 'of', 'a', 'graph', 'g', 'is', 'an', 'edgecoloring', 'such', 'that', 'any', 'two', 'edges', 'on', 'a', 'path', 'of', 'length', 'three', 'receive', 'distinct', 'colors', 'we', 'denote', 'the', 'strong', 'chromatic', 'index', 'by', 'chi_sg', 'which', 'is', 'the', 'minimum', 'number', 'of'... | [-0.2062328127754289, 0.16635885695097047, -0.05919083385807715, 0.044491941139080324, -0.1298275716104653, -0.17737162069511392, 0.06516408091573435, 0.3482179348014093, -0.20996252161472342, -0.398050142965386, 0.0592177274236239, -0.31602718566847576, -0.15609616925127717, 0.1267619434881291, -0.12383963966511133, -... |
1,801.06759 | Efficient algorithms for computing a minimal homology basis | Efficient computation of shortest cycles which form a homology basis under
$\mathbb{Z}_2$-additions in a given simplicial complex $\mathcal{K}$ has been
researched actively in recent years. When the complex $\mathcal{K}$ is a
weighted graph with $n$ vertices and $m$ edges, the problem of computing a
shortest (homolog... | math.AT cs.CG math.CO | efficient computation of shortest cycles which form a homology basis under mathbbz_2additions in a given simplicial complex mathcalk has been researched actively in recent years when the complex mathcalk is a weighted graph with n vertices and m edges the problem of computing a shortest homology cycle basis is known to... | [['efficient', 'computation', 'of', 'shortest', 'cycles', 'which', 'form', 'a', 'homology', 'basis', 'under', 'mathbbz_2additions', 'in', 'a', 'given', 'simplicial', 'complex', 'mathcalk', 'has', 'been', 'researched', 'actively', 'in', 'recent', 'years', 'when', 'the', 'complex', 'mathcalk', 'is', 'a', 'weighted', 'gra... | [-0.1715338196486069, 0.08185840356267271, -0.07625021840745615, 0.05954928586448906, -0.06675645040068973, -0.13969333746107454, 0.0759517535635357, 0.37655427915407186, -0.28652737481061813, -0.2945975232553684, 0.0908693476847444, -0.2265421436828639, -0.1648426524667322, 0.17193263953687796, -0.11227269638199024, 0... |
1,801.0676 | Every planar graph without $i$-cycles adjacent simultaneously to
$j$-cycles and $k$-cycles is DP-$4$-colorable when $\{i,j,k\}=\{3,4,5\}$ | DP-coloring is a generalization of a list coloring in simple graphs. Many
results in list coloring can be generalized in those of DP-coloring. Kim and
Ozeki showed that planar graphs without $k$-cycles where $k=3,4,5,$ or $6$ are
DP-$4$-colorable. Recently, Kim and Yu extended the result on $3$- and
$4$-cycles by sho... | math.CO | dpcoloring is a generalization of a list coloring in simple graphs many results in list coloring can be generalized in those of dpcoloring kim and ozeki showed that planar graphs without kcycles where k345 or 6 are dp4colorable recently kim and yu extended the result on 3 and 4cycles by showing that planar graphs witho... | [['dpcoloring', 'is', 'a', 'generalization', 'of', 'a', 'list', 'coloring', 'in', 'simple', 'graphs', 'many', 'results', 'in', 'list', 'coloring', 'can', 'be', 'generalized', 'in', 'those', 'of', 'dpcoloring', 'kim', 'and', 'ozeki', 'showed', 'that', 'planar', 'graphs', 'without', 'kcycles', 'where', 'k345', 'or', '6',... | [-0.14489773100484973, 0.11388010169915935, 0.04227576292064243, 0.019554357517146223, -0.12320056014653781, -0.18988073613170697, 0.0680170792610506, 0.43626975005735524, -0.2064599024886063, -0.4154184904111468, 0.07583882383111379, -0.3234736798979018, -0.2130296009329512, 0.10058314479259856, -0.21940475206255264, ... |
1,801.06761 | PU-Net: Point Cloud Upsampling Network | Learning and analyzing 3D point clouds with deep networks is challenging due
to the sparseness and irregularity of the data. In this paper, we present a
data-driven point cloud upsampling technique. The key idea is to learn
multi-level features per point and expand the point set via a multi-branch
convolution unit im... | cs.CV cs.GR | learning and analyzing 3d point clouds with deep networks is challenging due to the sparseness and irregularity of the data in this paper we present a datadriven point cloud upsampling technique the key idea is to learn multilevel features per point and expand the point set via a multibranch convolution unit implicitly... | [['learning', 'and', 'analyzing', '3d', 'point', 'clouds', 'with', 'deep', 'networks', 'is', 'challenging', 'due', 'to', 'the', 'sparseness', 'and', 'irregularity', 'of', 'the', 'data', 'in', 'this', 'paper', 'we', 'present', 'a', 'datadriven', 'point', 'cloud', 'upsampling', 'technique', 'the', 'key', 'idea', 'is', 't... | [-0.028384554397133697, -0.02187159863286878, -0.12404654049249883, 0.040176223687821117, -0.08731178347564612, -0.10244757731157329, 0.06477587944229729, 0.44465358638101155, -0.3192050816627064, -0.28176332189630354, 0.08597410309044386, -0.2768494119906488, -0.18672317557502538, 0.1733427368130328, -0.09466294426884... |
1,801.06762 | Infinite staircases in the symplectic embedding problem for
four-dimensional ellipsoids into polydisks | We study the symplectic embedding capacity function $C_{\beta}$ for
ellipsoids $E(1,\alpha)\subset R^4$ into dilates of polydisks $P(1,\beta)$ as
both $\alpha$ and $\beta$ vary through $[1,\infty)$. For $\beta=1$ Frenkel and
Mueller showed that $C_{\beta}$ has an infinite staircase accumulating at
$\alpha=3+2\sqrt{2}... | math.SG | we study the symplectic embedding capacity function c_beta for ellipsoids e1alphasubset r4 into dilates of polydisks p1beta as both alpha and beta vary through 1infty for beta1 frenkel and mueller showed that c_beta has an infinite staircase accumulating at alpha32sqrt2 while for integer betageq 2 cristofarogardiner fr... | [['we', 'study', 'the', 'symplectic', 'embedding', 'capacity', 'function', 'c_beta', 'for', 'ellipsoids', 'e1alphasubset', 'r4', 'into', 'dilates', 'of', 'polydisks', 'p1beta', 'as', 'both', 'alpha', 'and', 'beta', 'vary', 'through', '1infty', 'for', 'beta1', 'frenkel', 'and', 'mueller', 'showed', 'that', 'c_beta', 'ha... | [-0.15353996139745435, 0.17981264890302365, -0.042984663508832455, 0.0702453266176117, -0.017696244574103553, -0.18395585679243526, 0.04368912694785236, 0.3504119651730765, -0.26312235715857996, -0.24928372864786827, 0.09754620548322579, -0.3074039053413775, -0.1342584854664656, 0.1699285948915141, -0.06699397281423065... |
1,801.06763 | Spectral extremal results with forbidding linear forests | The Tur\'an type extremal problem asks to maximize the number of edges over
all graphs which do not contain fixed subgraphs. Similarly, the spectral
Tur\'an type extremal problem asks to maximize spectral radius of all graphs
which do not contain fixed subgraphs.
In this paper, we determine the maximum spectral rad... | math.CO | the turan type extremal problem asks to maximize the number of edges over all graphs which do not contain fixed subgraphs similarly the spectral turan type extremal problem asks to maximize spectral radius of all graphs which do not contain fixed subgraphs in this paper we determine the maximum spectral radius of all g... | [['the', 'turan', 'type', 'extremal', 'problem', 'asks', 'to', 'maximize', 'the', 'number', 'of', 'edges', 'over', 'all', 'graphs', 'which', 'do', 'not', 'contain', 'fixed', 'subgraphs', 'similarly', 'the', 'spectral', 'turan', 'type', 'extremal', 'problem', 'asks', 'to', 'maximize', 'spectral', 'radius', 'of', 'all', ... | [-0.13322252002463006, 0.0920229311654622, 0.03642137130526336, 0.1029477236463623, -0.14808694313672421, -0.13947533474205748, 0.04201305414072091, 0.38719177059829235, -0.24956112670336375, -0.3631980878284626, 0.14546264271995282, -0.3722163525965522, -0.12389069557059229, 0.09920226420447427, -0.12349526017185367, ... |
1,801.06764 | Exact ghost-free bigravitational waves | We study the propagation of exact gravitational waves in the ghost-free
bimetric theory. Our focus is on type N spacetimes compatible with the
cosmological constants provided by the bigravity interaction potential, and
particularly in the single class known by allowing at least a Killing symmetry:
the AdS waves. They... | hep-th gr-qc | we study the propagation of exact gravitational waves in the ghostfree bimetric theory our focus is on type n spacetimes compatible with the cosmological constants provided by the bigravity interaction potential and particularly in the single class known by allowing at least a killing symmetry the ads waves they have t... | [['we', 'study', 'the', 'propagation', 'of', 'exact', 'gravitational', 'waves', 'in', 'the', 'ghostfree', 'bimetric', 'theory', 'our', 'focus', 'is', 'on', 'type', 'n', 'spacetimes', 'compatible', 'with', 'the', 'cosmological', 'constants', 'provided', 'by', 'the', 'bigravity', 'interaction', 'potential', 'and', 'parti... | [-0.14754196160639177, 0.10596922145309069, -0.0858978790079458, 0.09978281409335624, -0.1627147898962386, -0.12752172754945154, -0.003455279839288765, 0.2951044351220124, -0.22357002020689573, -0.2681751211656244, 0.07002803168698003, -0.23662871943177236, -0.1810216838948298, 0.15445326851503322, -0.01740532343630953... |
1,801.06765 | Ultra-High Brightness Electron Beams from Very-High Field Cryogenic
Radio-frequency Photocathode Sources | Recent investigations of RF copper structures operated at cryogenic
temperatures performed by a SLAC-UCLA collaboration have shown a dramatic
increase in the maximum surface electric field, to 500 MV/m. We examine use of
these fields to enable very high field cryogenic photoinjectors that can attain
over an order of ... | physics.acc-ph | recent investigations of rf copper structures operated at cryogenic temperatures performed by a slacucla collaboration have shown a dramatic increase in the maximum surface electric field to 500 mvm we examine use of these fields to enable very high field cryogenic photoinjectors that can attain over an order of magnit... | [['recent', 'investigations', 'of', 'rf', 'copper', 'structures', 'operated', 'at', 'cryogenic', 'temperatures', 'performed', 'by', 'a', 'slacucla', 'collaboration', 'have', 'shown', 'a', 'dramatic', 'increase', 'in', 'the', 'maximum', 'surface', 'electric', 'field', 'to', '500', 'mvm', 'we', 'examine', 'use', 'of', 't... | [-0.10290858055256095, 0.16070025781274247, -0.04680936782352012, 0.015776837176820935, -0.015611533729657148, -0.12982451170922937, 0.030195981262914222, 0.4698532790908129, -0.184667754531886, -0.35262738073427113, 0.09026460545365554, -0.26533138560438435, -0.01967956888076571, 0.2788628484410493, -0.077534602304498... |
1,801.06766 | Learning to Speed Up Query Planning in Graph Databases | Querying graph structured data is a fundamental operation that enables
important applications including knowledge graph search, social network
analysis, and cyber-network security. However, the growing size of real-world
data graphs poses severe challenges for graph databases to meet the
response-time requirements of... | cs.DB cs.IR | querying graph structured data is a fundamental operation that enables important applications including knowledge graph search social network analysis and cybernetwork security however the growing size of realworld data graphs poses severe challenges for graph databases to meet the responsetime requirements of the appl... | [['querying', 'graph', 'structured', 'data', 'is', 'a', 'fundamental', 'operation', 'that', 'enables', 'important', 'applications', 'including', 'knowledge', 'graph', 'search', 'social', 'network', 'analysis', 'and', 'cybernetwork', 'security', 'however', 'the', 'growing', 'size', 'of', 'realworld', 'data', 'graphs', '... | [-0.07734957229023656, -0.01888829739331973, -0.036758947793994315, 0.07015526866374645, -0.17638992159313951, -0.12922522750271198, 0.1267115326386724, 0.4340758597076134, -0.2915653661072541, -0.40584771879590475, 0.0702608545336541, -0.2839600122712839, -0.12021851089118102, 0.1947149428899418, -0.12395238756986461,... |
1,801.06767 | On the Existence of $C^{1,1}$ Isometric Immersions of Several Classes of
Negatively Curved Surfaces Into $\mathbb{R}^3$ | We prove the existence of $C^{1,1}$ isometric immersions of several classes
of metrics on surfaces $(\mathcal{M},g)$ into the three-dimensional Euclidean
space $\mathbb{R}^3$, where the metrics $g$ have strictly negative curvature.
These include the standard hyperbolic plane, generalised helicoid-type metrics
and gen... | math.AP math.DG | we prove the existence of c11 isometric immersions of several classes of metrics on surfaces mathcalmg into the threedimensional euclidean space mathbbr3 where the metrics g have strictly negative curvature these include the standard hyperbolic plane generalised helicoidtype metrics and generalised enneper metrics our ... | [['we', 'prove', 'the', 'existence', 'of', 'c11', 'isometric', 'immersions', 'of', 'several', 'classes', 'of', 'metrics', 'on', 'surfaces', 'mathcalmg', 'into', 'the', 'threedimensional', 'euclidean', 'space', 'mathbbr3', 'where', 'the', 'metrics', 'g', 'have', 'strictly', 'negative', 'curvature', 'these', 'include', '... | [-0.18115375423803926, 0.09483812216632559, -0.06755133558947005, 0.10749491287769113, -0.11335342099865604, -0.11234647415480331, -0.06606226958530514, 0.36695926369314913, -0.21073715616703817, -0.2504389804334527, 0.121176730340506, -0.3305176062582943, -0.1548823026149828, 0.2154012079791803, -0.15275075584404954, ... |
1,801.06768 | Embedded Model Error Representation for Bayesian Model Calibration | Model error estimation remains one of the key challenges in uncertainty
quantification and predictive science. For computational models of complex
physical systems, model error, also known as structural error or model
inadequacy, is often the largest contributor to the overall predictive
uncertainty. This work builds... | stat.CO physics.comp-ph physics.data-an stat.ME | model error estimation remains one of the key challenges in uncertainty quantification and predictive science for computational models of complex physical systems model error also known as structural error or model inadequacy is often the largest contributor to the overall predictive uncertainty this work builds on a r... | [['model', 'error', 'estimation', 'remains', 'one', 'of', 'the', 'key', 'challenges', 'in', 'uncertainty', 'quantification', 'and', 'predictive', 'science', 'for', 'computational', 'models', 'of', 'complex', 'physical', 'systems', 'model', 'error', 'also', 'known', 'as', 'structural', 'error', 'or', 'model', 'inadequac... | [-0.03691311271506406, -0.02568420734522598, -0.051969437830386656, 0.11598134018935352, -0.07385945818313057, -0.14996160414912516, 0.08356504111378897, 0.36891048596358844, -0.2775505458278256, -0.4019184766581193, 0.12196140761460854, -0.23377955632491243, -0.17814375610379057, 0.21453492818880707, -0.12295347958662... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.