Unnamed: 0
int64 0
20k
| id
stringlengths 9
16
| submitter
stringlengths 1
50
⌀ | authors
stringlengths 5
15.2k
| title
stringlengths 7
294
| comments
stringlengths 1
682
⌀ | journal-ref
stringlengths 4
256
⌀ | doi
stringlengths 13
133
⌀ | report-no
stringlengths 2
187
⌀ | categories
stringlengths 5
90
| license
stringclasses 9
values | abstract
stringlengths 21
2.62k
| versions
stringlengths 62
2.35k
| update_date
stringlengths 10
10
| authors_parsed
stringlengths 39
44.4k
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3,400 |
hep-ex/0305109
|
Nicole Werner
|
Nicole Werner (University of Zurich)
|
Measurements of Proton Structure Functions, alpha_s and Parton
Distribution Functions at HERA
|
4 pages, 5 figures, talk given at 38th Rencontres de Moriond (QCD and
High Energy Hadronic Interactions), Les Arcs, March 22nd-29th, 2003
| null | null | null |
hep-ex
| null |
The measurement and QCD analysis of neutral and charged current cross
sections at HERA are presented. For the kinematic range of four-momentum
transfer Q^2 between approx. 1 GeV^2 and 30000 GeV^2 and Bjorken x between
0.0013 and 0.65 the data are compared to NLO QCD predictions. In dedicated NLO
QCD analyses the extraction of the parton distribution functions of the proton
is performed. Results for the measurement of the strong coupling constant
alpha_s are presented.
|
[{'version': 'v1', 'created': 'Fri, 30 May 2003 16:26:34 GMT'}
{'version': 'v2', 'created': 'Mon, 2 Jun 2003 09:43:14 GMT'}]
|
2007-05-23
|
[array(['Werner', 'Nicole', '', 'University of Zurich'], dtype=object)]
|
3,401 |
1410.3285
|
Frank Mousset
|
Hafsteinn Einarsson, Johannes Lengler, Konstantinos Panagiotou, Frank
Mousset, Angelika Steger
|
Connectivity Thresholds for Bounded Size Rules
| null | null | null | null |
math.PR math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an Achlioptas process, starting with a graph that has n vertices and no
edge, in each round $d \geq 1$ edges are drawn uniformly at random, and using
some rule exactly one of them is chosen and added to the evolving graph. For
the class of Achlioptas processes we investigate how much impact the rule has
on one of the most basic properties of a graph: connectivity. Our main results
are twofold. First, we study the prominent class of bounded size rules, which
select the edge to add according to the component sizes of its vertices,
treating all sizes larger than some constant equally. For such rules we provide
a fine analysis that exposes the limiting distribution of the number of rounds
until the graph gets connected, and we give a detailed picture of the dynamics
of the formation of the single component from smaller components. Second, our
results allow us to study the connectivity transition of all Achlioptas
processes, in the sense that we identify a process that accelerates it as much
as possible.
|
[{'version': 'v1', 'created': 'Mon, 13 Oct 2014 12:44:31 GMT'}]
|
2014-10-14
|
[array(['Einarsson', 'Hafsteinn', ''], dtype=object)
array(['Lengler', 'Johannes', ''], dtype=object)
array(['Panagiotou', 'Konstantinos', ''], dtype=object)
array(['Mousset', 'Frank', ''], dtype=object)
array(['Steger', 'Angelika', ''], dtype=object)]
|
3,402 |
2305.10121
|
Hamed Behzadi-Khormouji
|
Hamed Behzadi-Khormouji and Jos\'e Oramas
|
FICNN: A Framework for the Interpretation of Deep Convolutional Neural
Networks
| null | null | null | null |
cs.CV
|
http://creativecommons.org/licenses/by/4.0/
|
With the continue development of Convolutional Neural Networks (CNNs), there
is a growing concern regarding representations that they encode internally.
Analyzing these internal representations is referred to as model
interpretation. While the task of model explanation, justifying the predictions
of such models, has been studied extensively; the task of model interpretation
has received less attention. The aim of this paper is to propose a framework
for the study of interpretation methods designed for CNN models trained from
visual data. More specifically, we first specify the difference between the
interpretation and explanation tasks which are often considered the same in the
literature. Then, we define a set of six specific factors that can be used to
characterize interpretation methods. Third, based on the previous factors, we
propose a framework for the positioning of interpretation methods. Our
framework highlights that just a very small amount of the suggested factors,
and combinations thereof, have been actually studied. Consequently, leaving
significant areas unexplored. Following the proposed framework, we discuss
existing interpretation methods and give some attention to the evaluation
protocols followed to validate them. Finally, the paper highlights capabilities
of the methods in producing feedback for enabling interpretation and proposes
possible research problems arising from the framework.
|
[{'version': 'v1', 'created': 'Wed, 17 May 2023 10:59:55 GMT'}]
|
2023-05-18
|
[array(['Behzadi-Khormouji', 'Hamed', ''], dtype=object)
array(['Oramas', 'José', ''], dtype=object)]
|
3,403 |
1802.07866
|
Jacky Chow
|
Jacky C.K. Chow
|
Multi-Sensor Integration for Indoor 3D Reconstruction
|
PhD Thesis, 2014, University of Calgary (Canada),
http://hdl.handle.net/11023/1484
| null |
10.13140/RG.2.2.10534.42566
|
UCGE Reports Number 20399
|
cs.CV cs.RO
|
http://creativecommons.org/licenses/by/4.0/
|
Outdoor maps and navigation information delivered by modern services and
technologies like Google Maps and Garmin navigators have revolutionized the
lifestyle of many people. Motivated by the desire for similar navigation
systems for indoor usage from consumers, advertisers, emergency
rescuers/responders, etc., many indoor environments such as shopping malls,
museums, casinos, airports, transit stations, offices, and schools need to be
mapped. Typically, the environment is first reconstructed by capturing many
point clouds from various stations and defining their spatial relationships.
Currently, there is a lack of an accurate, rigorous, and speedy method for
relating point clouds in indoor, urban, satellite-denied environments. This
thesis presents a novel and automatic way for fusing calibrated point clouds
obtained using a terrestrial laser scanner and the Microsoft Kinect by
integrating them with a low-cost inertial measurement unit. The developed
system, titled the Scannect, is the first joint static-kinematic indoor 3D
mapper.
|
[{'version': 'v1', 'created': 'Thu, 22 Feb 2018 01:04:28 GMT'}]
|
2018-02-23
|
[array(['Chow', 'Jacky C. K.', ''], dtype=object)]
|
3,404 |
1108.6060
|
Pieter van Dokkum
|
Pieter G. van Dokkum, Gabriel Brammer, Mattia Fumagalli, Erica Nelson,
Marijn Franx, Hans-Walter Rix, Mariska Kriek, Rosalind E. Skelton, Shannon
Patel, Kasper B. Schmidt, Rachel Bezanson, Fuyan Bian, Elisabete da Cunha,
Dawn K. Erb, Xiaohui Fan, Natascha Forster Schreiber, Garth D. Illingworth,
Ivo Labbe, Britt Lundgren, Dan Magee, Danilo Marchesini, Patrick McCarthy,
Adam Muzzin, Ryan Quadri, Charles C. Steidel, Tomer Tal, David Wake,
Katherine E. Whitaker, Anna Williams
|
First Results from the 3D-HST Survey: The Striking Diversity of Massive
Galaxies at z>1
|
Accepted for publication in ApJ Letters
| null |
10.1088/2041-8205/743/1/L15
| null |
astro-ph.CO astro-ph.GA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present first results from the 3D-HST program, a near-IR spectroscopic
survey performed with the Wide Field Camera 3 on the Hubble Space Telescope. We
have used 3D-HST spectra to measure redshifts and Halpha equivalent widths for
a stellar mass-limited sample of 34 galaxies at 1<z<1.5 with M(stellar)>10^11
M(sun) in the COSMOS, GOODS, and AEGIS fields. We find that a substantial
fraction of massive galaxies at this epoch are forming stars at a high rate:
the fraction of galaxies with Halpha equivalent widths >10 A is 59%, compared
to 10% among SDSS galaxies of similar masses at z=0.1. Galaxies with weak
Halpha emission show absorption lines typical of 2-4 Gyr old stellar
populations. The structural parameters of the galaxies, derived from the
associated WFC3 F140W imaging data, correlate with the presence of Halpha:
quiescent galaxies are compact with high Sersic index and high inferred
velocity dispersion, whereas star-forming galaxies are typically large
two-armed spiral galaxies, with low Sersic index. Some of these star forming
galaxies might be progenitors of the most massive S0 and Sa galaxies. Our
results challenge the idea that galaxies at fixed mass form a homogeneous
population with small scatter in their properties. Instead we find that massive
galaxies form a highly diverse population at z>1, in marked contrast to the
local Universe.
|
[{'version': 'v1', 'created': 'Tue, 30 Aug 2011 20:00:04 GMT'}
{'version': 'v2', 'created': 'Wed, 5 Oct 2011 20:33:32 GMT'}
{'version': 'v3', 'created': 'Sat, 15 Oct 2011 12:11:09 GMT'}]
|
2015-05-30
|
[array(['van Dokkum', 'Pieter G.', ''], dtype=object)
array(['Brammer', 'Gabriel', ''], dtype=object)
array(['Fumagalli', 'Mattia', ''], dtype=object)
array(['Nelson', 'Erica', ''], dtype=object)
array(['Franx', 'Marijn', ''], dtype=object)
array(['Rix', 'Hans-Walter', ''], dtype=object)
array(['Kriek', 'Mariska', ''], dtype=object)
array(['Skelton', 'Rosalind E.', ''], dtype=object)
array(['Patel', 'Shannon', ''], dtype=object)
array(['Schmidt', 'Kasper B.', ''], dtype=object)
array(['Bezanson', 'Rachel', ''], dtype=object)
array(['Bian', 'Fuyan', ''], dtype=object)
array(['da Cunha', 'Elisabete', ''], dtype=object)
array(['Erb', 'Dawn K.', ''], dtype=object)
array(['Fan', 'Xiaohui', ''], dtype=object)
array(['Schreiber', 'Natascha Forster', ''], dtype=object)
array(['Illingworth', 'Garth D.', ''], dtype=object)
array(['Labbe', 'Ivo', ''], dtype=object)
array(['Lundgren', 'Britt', ''], dtype=object)
array(['Magee', 'Dan', ''], dtype=object)
array(['Marchesini', 'Danilo', ''], dtype=object)
array(['McCarthy', 'Patrick', ''], dtype=object)
array(['Muzzin', 'Adam', ''], dtype=object)
array(['Quadri', 'Ryan', ''], dtype=object)
array(['Steidel', 'Charles C.', ''], dtype=object)
array(['Tal', 'Tomer', ''], dtype=object)
array(['Wake', 'David', ''], dtype=object)
array(['Whitaker', 'Katherine E.', ''], dtype=object)
array(['Williams', 'Anna', ''], dtype=object)]
|
3,405 |
hep-ph/9407291
| null |
Ian Jack, D. R. Timothy Jones, Stephen P. Martin, Michael T. Vaughn
and Youichi Yamada
|
Decoupling of the $\epsilon$-scalar mass in softly broken supersymmetry
|
7 pages, LTH-336, NUB-3094-94TH, KEK-TH-404
|
Phys.Rev.D50:5481-5483,1994
|
10.1103/PhysRevD.50.R5481
| null |
hep-ph
| null |
It has been shown recently that the introduction of an unphysical
$\epsilon$-scalar mass $\tilde{m}$ is necessary for the proper renormalization
of softly broken supersymmetric theories by dimensional reduction ($\drbar$).
In these theories, both the two-loop $\beta$-functions of the scalar masses and
their one-loop finite corrections depend on $\tilde{m}^2$. We find, however,
that the dependence on $\tilde{m}^2$ can be completely removed by slightly
modifying the \drbar renormalization scheme. We also show that previous \drbar
calculations of one-loop corrections in supersymmetry which ignored the
$\tilde{m}^2$ contribution correspond to using this modified scheme.
|
[{'version': 'v1', 'created': 'Thu, 14 Jul 1994 14:06:12 GMT'}]
|
2009-12-30
|
[array(['Jack', 'Ian', ''], dtype=object)
array(['Jones', 'D. R. Timothy', ''], dtype=object)
array(['Martin', 'Stephen P.', ''], dtype=object)
array(['Vaughn', 'Michael T.', ''], dtype=object)
array(['Yamada', 'Youichi', ''], dtype=object)]
|
3,406 |
0812.4524
|
Sergey Bastrukov
|
S. I. Bastrukov, H.-K. Chang, I. V. Molodtsova and J. Takata
|
Nodeless differentially rotational Alfv\'en oscillations of crustal
solid-state plasma in quaking neutron star
| null | null | null | null |
astro-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The two-component, core-crust, model of a neutron star with homogenous
internal and dipolar external magnetic field is studied responding to
quake-induced perturbation by substantially nodeless differentially rotational
Alfv\'en oscillations of the perfectly conducting crustal matter about axis of
fossil magnetic field frozen in the immobile core. The energy variational
method of the magneto-solid-mechanical theory of a viscoelastic perfectly
conducting medium pervaded by magnetic field is utilized to compute the
frequency and lifetime of nodeless torsional vibrations of crustal solid-state
plasma about the dipole magnetic-moment axis of the star. It is found that
obtained two-parametric spectral formula for the frequency of this toroidal
Alfven mode provides fairly accurate account of rapid oscillations of the X-ray
flux during the flare of SGR 1806-20 and SGR 1900+14, supporting the
investigated conjecture that these quasi-periodic oscillations owe its origin
to axisymmetric torsional oscillations predominately driven by Lorentz force of
magnetic field stresses in the finite-depth crustal region of the above
magnetars.
|
[{'version': 'v1', 'created': 'Wed, 24 Dec 2008 12:09:46 GMT'}
{'version': 'v2', 'created': 'Sun, 28 Dec 2008 11:16:30 GMT'}]
|
2009-02-19
|
[array(['Bastrukov', 'S. I.', ''], dtype=object)
array(['Chang', 'H. -K.', ''], dtype=object)
array(['Molodtsova', 'I. V.', ''], dtype=object)
array(['Takata', 'J.', ''], dtype=object)]
|
3,407 |
1803.00115
|
Richard Kenyon
|
Richard Kenyon, Wai Yeung Lam
|
Holomorphic quadratic differentials on graphs and the chromatic
polynomial
| null | null | null | null |
math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study "holomorphic quadratic differentials" on graphs. We relate them to
the reactive power in an LC circuit, and also to the chromatic polynomial of a
graph. Specifically, we show that the chromatic polynomial $\chi$ of a graph
$G$, at negative integer values, can be evaluated as the degree of a certain
rational mapping, arising from the defining equations for a holomorphic
quadratic differential. This allows us to give an explicit integral expression
for $\chi(-k)$.
|
[{'version': 'v1', 'created': 'Wed, 28 Feb 2018 22:28:03 GMT'}]
|
2018-03-02
|
[array(['Kenyon', 'Richard', ''], dtype=object)
array(['Lam', 'Wai Yeung', ''], dtype=object)]
|
3,408 |
1710.00484
|
Pranav Kumar Jha
|
Pranav Kumar Jha, Nitin Kachare, K Kalyani and D. Sriram Kumar
|
Performance analysis of FSO using relays and spatial diversity under
log-normal fading channel
|
4 pages, 4 figures, 4th International Conference on Electrical Energy
Systems (ICEES), Feb. 7-9, 2018, SSNCE, Chennai, TN, INDIA
| null | null | null |
eess.SP cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The performance analysis of free space optical communication (FSO) system
using relays and spatial diversity at the source is studied in this paper. The
effect of atmospheric turbulence and attenuation, caused by different weather
conditions and geometric losses, has also been considered for analysis. The
exact closed-form expressions are presented for bit error rate (BER) of M-ary
quadrature amplitude modulation (M-QAM) technique for multi-hop multiple-input
single-output (MISO) FSO system under log-normal fading channel. Furthermore,
the link performance of multi-hop MISO and multi-hop single-input and
single-output (SISO) FSO systems are compared to the different systems using
on-off keying (OOK), repetition codes (RCs) and M-ary pulse amplitude
modulation (M-PAM) techniques. A significant performance enhancement in terms
of BER analysis and SNR gains is shown for multi-hop MISO and multi-hop SISO
FSO systems with M-QAM over other existing systems with different modulation
schemes. Moreover, Monte-Carlo simulations are used to validate the accuracy
and consistency of the derived analytical results. Numerical results show that
M-QAM modulated multi-hop MISO and multi-hop SISO FSO system with relays and
spatial diversity outperforms other systems while having the same spectral
efficiency of each system.
|
[{'version': 'v1', 'created': 'Mon, 2 Oct 2017 04:56:59 GMT'}
{'version': 'v2', 'created': 'Thu, 18 Jan 2018 15:20:20 GMT'}
{'version': 'v3', 'created': 'Sun, 4 Feb 2018 04:44:18 GMT'}
{'version': 'v4', 'created': 'Sat, 31 Mar 2018 12:07:33 GMT'}]
|
2018-04-03
|
[array(['Jha', 'Pranav Kumar', ''], dtype=object)
array(['Kachare', 'Nitin', ''], dtype=object)
array(['Kalyani', 'K', ''], dtype=object)
array(['Kumar', 'D. Sriram', ''], dtype=object)]
|
3,409 |
1610.03245
|
Frank D\"urr
|
Frank D\"urr
|
A Flat and Scalable Data Center Network Topology Based on De Bruijn
Graphs
| null | null | null |
TR-2016-05
|
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the requirement of hosting tens of thousands of hosts in today's data
centers, data center networks strive for scalability and high throughput on the
one hand. On the other hand, the cost for networking hardware should be
minimized. Consequently, the number and complexity (e.g. TCAM size) of switches
has to be minimized. These requirements led to network topologies like Clos and
Leaf-Spine networks only requiring a shallow hierarchy of switches---two levels
for Leaf-Spine networks. The drawback of these topologies is that switches at
higher levels like Spine switches need a high port density and, thus, are
expensive and limit the scalability of the network.
In this paper, we propose a data center network topology based on De Bruijn
graphs completely avoiding a switch hierarchy and implementing a flat network
topology of top-of-rack switches instead. This topology guarantees logarithmic
(short) path length. We show that the required routing logic can be implemented
by standard prefix matching operations in hardware (TCAM) allowing for using
commodity switches without any modification. Moreover, forwarding requires only
a very small number of forwarding table entries, saving costly and
energy-intensive TCAM.
|
[{'version': 'v1', 'created': 'Tue, 11 Oct 2016 09:18:33 GMT'}]
|
2016-10-12
|
[array(['Dürr', 'Frank', ''], dtype=object)]
|
3,410 |
1708.06247
|
Ratna Pal
|
Ratna Pal, Kaushal Verma
|
Ergodic properties of families of H\'enon maps
|
arXiv admin note: text overlap with arXiv:1507.07097
| null | null | null |
math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\{H_{\lambda}\}$ be a continuous family of H\'{e}non maps parametrized
by $\lambda\in M$, where $M\subset\mathbb C^k$ is compact. The purpose of this
paper is to understand some aspects of the random dynamical system obtained by
iterating maps from this family. As an application, we study skew products of
H\'{e}non maps and obtain lower bounds for their entropy.
|
[{'version': 'v1', 'created': 'Fri, 18 Aug 2017 06:09:05 GMT'}]
|
2017-08-22
|
[array(['Pal', 'Ratna', ''], dtype=object)
array(['Verma', 'Kaushal', ''], dtype=object)]
|
3,411 |
1607.00570
|
Cedric De Boom
|
Cedric De Boom, Steven Van Canneyt, Thomas Demeester, Bart Dhoedt
|
Representation learning for very short texts using weighted word
embedding aggregation
|
8 pages, 3 figures, 2 tables, appears in Pattern Recognition Letters
| null |
10.1016/j.patrec.2016.06.012
| null |
cs.IR cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Short text messages such as tweets are very noisy and sparse in their use of
vocabulary. Traditional textual representations, such as tf-idf, have
difficulty grasping the semantic meaning of such texts, which is important in
applications such as event detection, opinion mining, news recommendation, etc.
We constructed a method based on semantic word embeddings and frequency
information to arrive at low-dimensional representations for short texts
designed to capture semantic similarity. For this purpose we designed a
weight-based model and a learning procedure based on a novel median-based loss
function. This paper discusses the details of our model and the optimization
methods, together with the experimental results on both Wikipedia and Twitter
data. We find that our method outperforms the baseline approaches in the
experiments, and that it generalizes well on different word embeddings without
retraining. Our method is therefore capable of retaining most of the semantic
information in the text, and is applicable out-of-the-box.
|
[{'version': 'v1', 'created': 'Sat, 2 Jul 2016 23:10:09 GMT'}]
|
2016-07-05
|
[array(['De Boom', 'Cedric', ''], dtype=object)
array(['Van Canneyt', 'Steven', ''], dtype=object)
array(['Demeester', 'Thomas', ''], dtype=object)
array(['Dhoedt', 'Bart', ''], dtype=object)]
|
3,412 |
1107.2006
|
Arjan van der Schaft
|
A.J. van der Schaft and B.M. Maschke
|
Port-Hamiltonian systems on graphs
|
45 pages, 2 figures
| null | null | null |
math.OC cs.SY math.DS math.SG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we present a unifying geometric and compositional framework for
modeling complex physical network dynamics as port-Hamiltonian systems on open
graphs. Basic idea is to associate with the incidence matrix of the graph a
Dirac structure relating the flow and effort variables associated to the edges,
internal vertices, as well as boundary vertices of the graph, and to formulate
energy-storing or energy-dissipating relations between the flow and effort
variables of the edges and internal vertices. This allows for state variables
associated to the edges, and formalizes the interconnection of networks.
Examples from different origins such as consensus algorithms are shown to share
the same structure. It is shown how the identified Hamiltonian structure offers
systematic tools for the analysis of the resulting dynamics.
|
[{'version': 'v1', 'created': 'Mon, 11 Jul 2011 12:08:10 GMT'}
{'version': 'v2', 'created': 'Thu, 6 Sep 2012 10:36:13 GMT'}]
|
2012-09-07
|
[array(['van der Schaft', 'A. J.', ''], dtype=object)
array(['Maschke', 'B. M.', ''], dtype=object)]
|
3,413 |
1312.2416
|
Rong-Jia Yang
|
Rong-Jia Yang
|
Large-scale structure in superfluid Chaplygin gas cosmology
|
10 pages, 6 figures, minor errors are corrected
|
Phys. Rev. D 89, 063014 (2014)
|
10.1103/PhysRevD.89.063014
| null |
gr-qc astro-ph.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We investigate the growth of large-scale structure in the superfluid
Chaplygin gas (SCG) model. Both linear and non-linear growth, such as
$\sigma_8$ and the skewness $S_3$, are discussed. We find the growth factor of
SCG reduces to the EdS case at early times while differs from the $\Lambda$CDM
case in the large $a$ limit. We also find there will be much stricture growth
on large scales in the SCG scenario than in $\Lambda$CDM and the variations of
$\sigma_{8}$ and $S_3$ between SCG and $\Lambda$CDM can not be discriminated.
|
[{'version': 'v1', 'created': 'Mon, 9 Dec 2013 13:03:37 GMT'}
{'version': 'v2', 'created': 'Tue, 10 Dec 2013 08:29:25 GMT'}
{'version': 'v3', 'created': 'Mon, 7 Apr 2014 14:59:57 GMT'}]
|
2014-04-08
|
[array(['Yang', 'Rong-Jia', ''], dtype=object)]
|
3,414 |
2106.00293
|
Antonios Varvitsiotis
|
Yong Sheng Soh, Antonios Varvitsiotis
|
A Non-commutative Extension of Lee-Seung's Algorithm for Positive
Semidefinite Factorizations
|
Comments welcome
| null | null | null |
math.OC cs.LG eess.SP stat.ML
|
http://creativecommons.org/licenses/by/4.0/
|
Given a matrix $X\in \mathbb{R}_+^{m\times n}$ with nonnegative entries, a
Positive Semidefinite (PSD) factorization of $X$ is a collection of $r \times
r$-dimensional PSD matrices $\{A_i\}$ and $\{B_j\}$ satisfying $X_{ij}=
\mathrm{tr}(A_i B_j)$ for all $\ i\in [m],\ j\in [n]$. PSD factorizations are
fundamentally linked to understanding the expressiveness of semidefinite
programs as well as the power and limitations of quantum resources in
information theory. The PSD factorization task generalizes the Non-negative
Matrix Factorization (NMF) problem where we seek a collection of
$r$-dimensional nonnegative vectors $\{a_i\}$ and $\{b_j\}$ satisfying $X_{ij}=
a_i^\top b_j$, for all $i\in [m],\ j\in [n]$ -- one can recover the latter
problem by choosing matrices in the PSD factorization to be diagonal. The most
widely used algorithm for computing NMFs of a matrix is the Multiplicative
Update algorithm developed by Lee and Seung, in which nonnegativity of the
updates is preserved by scaling with positive diagonal matrices. In this paper,
we describe a non-commutative extension of Lee-Seung's algorithm, which we call
the Matrix Multiplicative Update (MMU) algorithm, for computing PSD
factorizations. The MMU algorithm ensures that updates remain PSD by congruence
scaling with the matrix geometric mean of appropriate PSD matrices, and it
retains the simplicity of implementation that Lee-Seung's algorithm enjoys.
Building on the Majorization-Minimization framework, we show that under our
update scheme the squared loss objective is non-increasing and fixed points
correspond to critical points. The analysis relies on Lieb's Concavity Theorem.
Beyond PSD factorizations, we use the MMU algorithm as a primitive to calculate
block-diagonal PSD factorizations and tensor PSD factorizations. We demonstrate
the utility of our method with experiments on real and synthetic data.
|
[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 07:55:09 GMT'}]
|
2021-06-02
|
[array(['Soh', 'Yong Sheng', ''], dtype=object)
array(['Varvitsiotis', 'Antonios', ''], dtype=object)]
|
3,415 |
astro-ph/0002315
| null |
Naoki Seto
|
Perturbative Analysis of Adaptive Smoothing Methods in Quantifying
Large-Scale Structure
|
42 pages including 9 figure, ApJ 537 in press
|
ApJ 538 (2000) 11
|
10.1086/309102
| null |
astro-ph
| null |
Smoothing operation to make continuous density field from observed point-like
distribution of galaxies is crucially important for topological or
morphological analysis of the large-scale structure, such as, the genus
statistics or the area statistics (equivalently the level crossing statistics).
It has been pointed out that the adaptive smoothing filters are more efficient
tools to resolve cosmic structures than the traditional spatially fixed
filters. We study weakly nonlinear effects caused by two representative
adaptive methods often used in smoothed hydrodynamical particle (SPH)
simulations. Using framework of second-order perturbation theory, we calculate
the generalized skewness parameters for the adaptive methods in the case of
initially power-law fluctuations.
Then we apply the multidimensional Edgeworth expansion method and investigate
weakly nonlinear evolution of the genus statistics and the area statistics.
Isodensity contour surfaces are often parameterized by the volume fraction of
the regions above a given density threshold. We also discuss this
parameterization method in perturbative manner.
|
[{'version': 'v1', 'created': 'Wed, 16 Feb 2000 04:13:36 GMT'}]
|
2016-08-30
|
[array(['Seto', 'Naoki', ''], dtype=object)]
|
3,416 |
2303.02566
|
Zhiwei Wang
|
Zhiwei Wang, Fa Zhang, Cong Zheng, Xianghong Hu, Mingxuan Cai, Can
Yang
|
MFAI: A Scalable Bayesian Matrix Factorization Approach to Leveraging
Auxiliary Information
| null | null | null | null |
stat.ML cs.LG stat.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In various practical situations, matrix factorization methods suffer from
poor data quality, such as high data sparsity and low signal-to-noise ratio
(SNR). Here we consider a matrix factorization problem by utilizing auxiliary
information, which is massively available in real applications, to overcome the
challenges caused by poor data quality. Unlike existing methods that mainly
rely on simple linear models to combine auxiliary information with the main
data matrix, we propose to integrate gradient boosted trees in the
probabilistic matrix factorization framework to effectively leverage auxiliary
information (MFAI). Thus, MFAI naturally inherits several salient features of
gradient boosted trees, such as the capability of flexibly modeling nonlinear
relationships, and robustness to irrelevant features and missing values in
auxiliary information. The parameters in MAFI can be automatically determined
under the empirical Bayes framework, making it adaptive to the utilization of
auxiliary information and immune to overfitting. Moreover, MFAI is
computationally efficient and scalable to large-scale datasets by exploiting
variational inference. We demonstrate the advantages of MFAI through
comprehensive numerical results from simulation studies and real data analysis.
Our approach is implemented in the R package mfair available at
https://github.com/YangLabHKUST/mfair.
|
[{'version': 'v1', 'created': 'Sun, 5 Mar 2023 03:26:14 GMT'}]
|
2023-03-07
|
[array(['Wang', 'Zhiwei', ''], dtype=object)
array(['Zhang', 'Fa', ''], dtype=object)
array(['Zheng', 'Cong', ''], dtype=object)
array(['Hu', 'Xianghong', ''], dtype=object)
array(['Cai', 'Mingxuan', ''], dtype=object)
array(['Yang', 'Can', ''], dtype=object)]
|
3,417 |
1710.05019
|
Rolando de Santiago
|
Ionu\c{t} Chifan, Rolando de Santiago, and Wanchalerm Sucpikarnon
|
Tensor product decompositions of II$_1$ factors arising from extensions
of amalgamated free product groups
| null | null |
10.1007/s00220-018-3175-z
| null |
math.OA math.GR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a new family of icc groups $\Gamma$ which satisfy
the following product rigidity phenomenon, discovered in [DHI16] (see also
[dSP17]): all tensor product decompositions of the II$_1$ factor $L(\Gamma)$
arise only from the canonical direct product decompositions of the underlying
group $\Gamma$. Our groups are assembled from certain HNN-extensions and
amalgamated free products and include many remarkable groups studied throughout
mathematics such as graph product groups, poly-amalgam groups, Burger-Mozes
groups, Higman group, various integral two-dimensional Cremona groups, etc. As
a consequence, we obtain several new examples of groups that give rise to prime
factors.
|
[{'version': 'v1', 'created': 'Fri, 13 Oct 2017 17:38:56 GMT'}
{'version': 'v2', 'created': 'Tue, 28 Nov 2017 20:11:59 GMT'}]
|
2018-07-04
|
[array(['Chifan', 'Ionuţ', ''], dtype=object)
array(['de Santiago', 'Rolando', ''], dtype=object)
array(['Sucpikarnon', 'Wanchalerm', ''], dtype=object)]
|
3,418 |
1810.04138
|
Yu Jia
|
Feng Feng, Yu Jia
|
Next-to-leading-order QCD corrections to gluon fragmentation into
${}^1S_0^{(1,8)}$ quarkonia
|
10 pages, 2 figures, 2 tables
| null |
10.1088/1674-1137/aca1aa
| null |
hep-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Within the NRQCD factorization framework, we compute the
next-to-leading-order QCD corrections to the gluon fragmentation into the
${}^1S_0^{(1,8)}$ Fock components of a quarkonium, at the lowest order in
velocity expansion. We follow the operator definition of the fragmentation
function advanced by Collins and Soper. The key technique underpinning our
calculation is the sector decomposition method widely used in the area of
multi-loop computation. It is found that the NLO QCD corrections have
significant effects, and qualitatively modify the profiles of the corresponding
leading-order fragmentation functions.
|
[{'version': 'v1', 'created': 'Tue, 9 Oct 2018 17:15:37 GMT'}]
|
2023-02-15
|
[array(['Feng', 'Feng', ''], dtype=object)
array(['Jia', 'Yu', ''], dtype=object)]
|
3,419 |
2011.14213
|
Yuxuan Yu
|
Yuxuan Yu, Xiaodong Wei, Angran Li, Jialei Ginny Liu, Jeffrey He and
Yongjie Jessica Zhang
|
HexGen and Hex2Spline: Polycube-based Hexahedral Mesh Generation and
Spline Modeling for Isogeometric Analysis Applications in LS-DYNA
| null | null | null | null |
cs.CG
|
http://creativecommons.org/licenses/by/4.0/
|
In this paper, we present two software packages, HexGen and Hex2Spline, that
seamlessly integrate geometry design with isogeometric analysis (IGA) in
LS-DYNA. Given a boundary representation of a solid model, HexGen creates a
hexahedral mesh by utilizing a semi-automatic polycube-based mesh generation
method. Hex2Spline takes the output hexahedral mesh from HexGen as the input
control mesh and constructs volumetric truncated hierarchical splines. Through
B\'{e}zier extraction, Hex2Spline transfers spline information to LS-DYNA and
performs IGA therein. We explain the underlying algorithms in each software
package and use a rod model to explain how to run the software. We also apply
our software to several other complex models to test its robustness. Our goal
is to provide a robust volumetric modeling tool and thus expand the boundary of
IGA to volume-based industrial applications.
|
[{'version': 'v1', 'created': 'Sat, 28 Nov 2020 20:55:18 GMT'}]
|
2020-12-01
|
[array(['Yu', 'Yuxuan', ''], dtype=object)
array(['Wei', 'Xiaodong', ''], dtype=object)
array(['Li', 'Angran', ''], dtype=object)
array(['Liu', 'Jialei Ginny', ''], dtype=object)
array(['He', 'Jeffrey', ''], dtype=object)
array(['Zhang', 'Yongjie Jessica', ''], dtype=object)]
|
3,420 |
2206.04752
|
Krystian Gajdzica
|
Krystian Gajdzica
|
Log-concavity of the restricted partition function $p_\mathcal{A}(n,k)$
and the new Bessenrodt-Ono type inequality
|
25 pages, 12 figures
| null | null | null |
math.CO math.NT
|
http://creativecommons.org/licenses/by/4.0/
|
Let $\mathcal{A}=(a_i)_{i=1}^\infty$ be a non-decreasing sequence of positive
integers and let $k\in\mathbb{N}_+$ be fixed. The function $p_\mathcal{A}(n,k)$
counts the number of partitions of $n$ with parts in the multiset
$\{a_1,a_2,\ldots,a_k\}$. We find out a new type of Bessenrodt-Ono inequality
for the function $p_\mathcal{A}(n,k)$. Further, we discover when and under what
conditions on $k$, $\{a_1,a_2,\ldots,a_k\}$ and $N\in\mathbb{N}_+$, the
sequence $\left(p_\mathcal{A}(n,k)\right)_{n=N}^\infty$ is log-concave. Our
proofs are based on the asymptotic behavior of $p_\mathcal{A}(n,k)$, in
particular, we apply the results of Netto and P\'olya-Szeg\"o as well as the
Almkavist's estimation.
|
[{'version': 'v1', 'created': 'Thu, 9 Jun 2022 20:15:23 GMT'}]
|
2022-06-13
|
[array(['Gajdzica', 'Krystian', ''], dtype=object)]
|
3,421 |
hep-ex/0506069
|
Ivo Gough Eschrich
|
The BABAR Collaboration, B. Aubert, et al
|
Measurement of the B+- --> rho+- pi0 Branching Fraction and Direct CP
Asymmetry
|
17 pages, 5 postscript figures, contributed to Lepton-Photon 2005
| null | null |
BABAR-CONF-05/005, SLAC-PUB-11294
|
hep-ex
| null |
An improved measurement of the process B+- --> rho+- pi0 is presented. The
data sample of 211/fb comprises 232 million Y(4S) --> BBbar decays collected
with the BaBar detector at the PEP-II asymmetric-energy B Factory at SLAC. The
yield and CP asymmetry are calculated using an extended maximum likelihood
fitting method. The branching fraction and asymmetry are found to be BR(B+- -->
rho+- pi0) = [10.0 +- 1.4 (stat) +- 0.9 (syst)]x 10^-6 and Acp(B+- --> rho+-
pi0) = -0.01 +- 0.13 (stat) +- 0.02 (syst), superseding previous measurements.
The statistical significance of the branching fraction is calculated to be
8.7sigma.
|
[{'version': 'v1', 'created': 'Mon, 27 Jun 2005 21:50:48 GMT'}]
|
2007-05-23
|
[array(['The BABAR Collaboration', '', ''], dtype=object)
array(['Aubert', 'B.', ''], dtype=object)]
|
3,422 |
2106.13950
|
Amin Farajzadeh
|
Amin Farajzadeh, Mohammad G. Khoshkholgh, Halim Yanikomeroglu, Ozgur
Ercetin
|
Self-Evolving Integrated Vertical Heterogeneous Networks
|
29 pages, 5 figures, 3 tables. arXiv admin note: text overlap with
arXiv:1901.07955, arXiv:2006.02931 by other authors
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
6G and beyond networks tend towards fully intelligent and adaptive design in
order to provide better operational agility in maintaining universal wireless
access and supporting a wide range of services and use cases while dealing with
network complexity efficiently. Such enhanced network agility will require
developing a self-evolving capability in designing both the network
architecture and resource management to intelligently utilize resources, reduce
operational costs, and achieve the coveted quality of service (QoS). To enable
this capability, the necessity of considering an integrated vertical
heterogeneous network (VHetNet) architecture appears to be inevitable due to
its high inherent agility. Moreover, employing an intelligent framework is
another crucial requirement for self-evolving networks to deal with real-time
network optimization problems. Hence, in this work, to provide a better insight
on network architecture design in support of self-evolving networks, we
highlight the merits of integrated VHetNet architecture while proposing an
intelligent framework for self-evolving integrated vertical heterogeneous
networks (SEI-VHetNets). The impact of the challenges associated with
SEI-VHetNet architecture, on network management is also studied considering a
generalized network model. Furthermore, the current literature on network
management of integrated VHetNets along with the recent advancements in
artificial intelligence (AI)/machine learning (ML) solutions are discussed.
Accordingly, the core challenges of integrating AI/ML in SEI-VHetNets are
identified. Finally, the potential future research directions for advancing the
autonomous and self-evolving capabilities of SEI-VHetNets are discussed.
|
[{'version': 'v1', 'created': 'Sat, 26 Jun 2021 05:57:06 GMT'}
{'version': 'v2', 'created': 'Wed, 13 Oct 2021 18:03:45 GMT'}
{'version': 'v3', 'created': 'Sun, 25 Sep 2022 15:22:05 GMT'}
{'version': 'v4', 'created': 'Fri, 30 Dec 2022 03:14:50 GMT'}]
|
2023-01-02
|
[array(['Farajzadeh', 'Amin', ''], dtype=object)
array(['Khoshkholgh', 'Mohammad G.', ''], dtype=object)
array(['Yanikomeroglu', 'Halim', ''], dtype=object)
array(['Ercetin', 'Ozgur', ''], dtype=object)]
|
3,423 |
cond-mat/9506057
|
Manuel Fuentes
|
Manuel Fuentes, Ana Lopez and Eduardo Fradkin
|
Exact effective action for fermions in one dimension with backscattering
at a boundary
|
4 pages, revtex, no figures
| null |
10.1103/PhysRevB.53.16568
| null |
cond-mat hep-th
| null |
We report exact results for the partition function for free Dirac fermions on
a half line with physically sensible boundary conditions. An exact effective
action for general backscattering amplitudes is derived. The action also
includes the effects of both a (time-dependent) forward scattering amplitude
and a dynamical chiral twist of the fermion boundary conditions. For a small
backscattering amplitude, the effective action has the expected boundary
Sine-Gordon form. We discuss applications of our results to one-dimensional
Fermi systems with local backscattering.
|
[{'version': 'v1', 'created': 'Tue, 13 Jun 1995 20:19:46 GMT'}]
|
2009-10-28
|
[array(['Fuentes', 'Manuel', ''], dtype=object)
array(['Lopez', 'Ana', ''], dtype=object)
array(['Fradkin', 'Eduardo', ''], dtype=object)]
|
3,424 |
1507.03926
|
Thomas Kupfer TK
|
T. Kupfer, P. J. Groot, S. Bloemen, D. Levitan, D. Steeghs, T. R.
Marsh, R. G. M. Rutten, G. Nelemans, T. A. Prince, F. F\"urst and S. Geier
|
Phase resolved spectroscopy and Kepler photometry of the ultracompact AM
CVn binary SDSS J190817.07+394036.4
|
Accepted for publication in MNRAS, 15 pages, 14 figures, 5 tables
| null |
10.1093/mnras/stv1609
| null |
astro-ph.SR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
{\it Kepler} satellite photometry and phase-resolved spectroscopy of the
ultracompact AM CVn type binary SDSS J190817.07+394036.4 are presented. The
average spectra reveal a variety of weak metal lines of different species,
including silicon, sulphur and magnesium as well as many lines of nitrogen,
beside the strong absorption lines of neutral helium. The phase-folded spectra
and the Doppler tomograms reveal an S-wave in emission in the core of the He I
4471 \AA\,absorption line at a period of $P_{\rm orb}=1085.7\pm2.8$\,sec
identifying this as the orbital period of the system. The Si II, Mg II and the
core of some He I lines show an S-wave in absorption with a phase offset of
$170\pm15^\circ$ compared to the S-wave in emission. The N II, Si III and some
helium lines do not show any phase variability at all. The spectroscopic
orbital period is in excellent agreement with a period at $P_{\rm
orb}=1085.108(9)$\,sec detected in the three year {\it Kepler} lightcurve. A
Fourier analysis of the Q6 to Q17 short cadence data obtained by {\it Kepler}
revealed a large number of frequencies above the noise level where the majority
shows a large variability in frequency and amplitude. In an O-C analysis we
measured a $\vert\dot{P}\vert\sim1.0\,$x$\,10^{-8}\,$s\,s$^{-1}$ for some of
the strongest variations and set a limit for the orbital period to be
$\vert\dot{P}\vert<10^{-10}$s\,s$^{-1}$. The shape of the phase folded
lightcurve on the orbital period indicates the motion of the bright spot.
Models of the system were constructed to see whether the phases of the radial
velocity curves and the lightcurve variation can be combined to a coherent
picture. However, from the measured phases neither the absorption nor the
emission can be explained to originate in the bright spot.
|
[{'version': 'v1', 'created': 'Tue, 14 Jul 2015 16:58:28 GMT'}]
|
2015-08-26
|
[array(['Kupfer', 'T.', ''], dtype=object)
array(['Groot', 'P. J.', ''], dtype=object)
array(['Bloemen', 'S.', ''], dtype=object)
array(['Levitan', 'D.', ''], dtype=object)
array(['Steeghs', 'D.', ''], dtype=object)
array(['Marsh', 'T. R.', ''], dtype=object)
array(['Rutten', 'R. G. M.', ''], dtype=object)
array(['Nelemans', 'G.', ''], dtype=object)
array(['Prince', 'T. A.', ''], dtype=object)
array(['F\x7fürst', 'F.', ''], dtype=object)
array(['Geier', 'S.', ''], dtype=object)]
|
3,425 |
2110.07214
|
Pierre Gabriel
|
Matthieu Alfaro (UNIROUEN), Pierre Gabriel (UVSQ), Otared Kavian
(UVSQ)
|
Confining integro-differential equations originating from evolutionary
biology: ground states and long time dynamics
| null | null | null | null |
math.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider nonlinear mutation selection models, known as replicator-mutator
equations in evolutionary biology. They involve a nonlocal mutation kernel and
a confining fitness potential. We prove that the long time behaviour of the
Cauchy problem is determined by the principal eigenelement of the underlying
linear operator. The novelties compared to the literature on these models are
about the case of symmetric mutations: we propose a new milder sufficient
condition for the existence of a principal eigenfunction, and we provide what
is to our knowledge the first quantification of the spectral gap. We also
recover existing results in the non-symmetric case, through a new approach.
|
[{'version': 'v1', 'created': 'Thu, 14 Oct 2021 08:20:36 GMT'}
{'version': 'v2', 'created': 'Fri, 6 Jan 2023 10:05:19 GMT'}]
|
2023-01-09
|
[array(['Alfaro', 'Matthieu', '', 'UNIROUEN'], dtype=object)
array(['Gabriel', 'Pierre', '', 'UVSQ'], dtype=object)
array(['Kavian', 'Otared', '', 'UVSQ'], dtype=object)]
|
3,426 |
2009.06520
|
Nathan Cooper
|
Cody Watson, Nathan Cooper, David Nader Palacio, Kevin Moran and Denys
Poshyvanyk
|
A Systematic Literature Review on the Use of Deep Learning in Software
Engineering Research
|
59 pages, Accepted to TOSEM 2021
| null | null | null |
cs.SE cs.AI cs.LG cs.NE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An increasingly popular set of techniques adopted by software engineering
(SE) researchers to automate development tasks are those rooted in the concept
of Deep Learning (DL). The popularity of such techniques largely stems from
their automated feature engineering capabilities, which aid in modeling
software artifacts. However, due to the rapid pace at which DL techniques have
been adopted, it is difficult to distill the current successes, failures, and
opportunities of the current research landscape. In an effort to bring clarity
to this crosscutting area of work, from its modern inception to the present,
this paper presents a systematic literature review of research at the
intersection of SE & DL. The review canvases work appearing in the most
prominent SE and DL conferences and journals and spans 128 papers across 23
unique SE tasks. We center our analysis around the components of learning, a
set of principles that govern the application of machine learning techniques
(ML) to a given problem domain, discussing several aspects of the surveyed work
at a granular level. The end result of our analysis is a research roadmap that
both delineates the foundations of DL techniques applied to SE research, and
highlights likely areas of fertile exploration for the future.
|
[{'version': 'v1', 'created': 'Mon, 14 Sep 2020 15:28:28 GMT'}
{'version': 'v2', 'created': 'Thu, 23 Sep 2021 18:11:47 GMT'}]
|
2021-09-27
|
[array(['Watson', 'Cody', ''], dtype=object)
array(['Cooper', 'Nathan', ''], dtype=object)
array(['Palacio', 'David Nader', ''], dtype=object)
array(['Moran', 'Kevin', ''], dtype=object)
array(['Poshyvanyk', 'Denys', ''], dtype=object)]
|
3,427 |
2010.11023
|
Gergely Odor
|
Satvik Mashkaria, Gergely \'Odor, Patrick Thiran
|
On the robustness of the metric dimension of grid graphs to adding a
single edge
| null | null | null | null |
math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The metric dimension (MD) of a graph is a combinatorial notion capturing the
minimum number of landmark nodes needed to distinguish every pair of nodes in
the graph based on graph distance. We study how much the MD can increase if we
add a single edge to the graph. The extra edge can either be selected
adversarially, in which case we are interested in the largest possible value
that the MD can take, or uniformly at random, in which case we are interested
in the distribution of the MD. The adversarial setting has already been studied
by [Eroh et. al., 2015] for general graphs, who found an example where the MD
doubles on adding a single edge. By constructing a different example, we show
that this increase can be as large as exponential. However, we believe that
such a large increase can occur only in specially constructed graphs, and that
in most interesting graph families, the MD at most doubles on adding a single
edge. We prove this for $d$-dimensional grid graphs, by showing that $2d$
appropriately chosen corners and the endpoints of the extra edge can
distinguish every pair of nodes, no matter where the edge is added. For the
special case of $d=2$, we show that it suffices to choose the four corners as
landmarks. Finally, when the extra edge is sampled uniformly at random, we
conjecture that the MD of 2-dimensional grids converges in probability to
$3+\mathrm{Ber}(8/27)$, and we give an almost complete proof.
|
[{'version': 'v1', 'created': 'Wed, 21 Oct 2020 14:10:31 GMT'}
{'version': 'v2', 'created': 'Mon, 15 Nov 2021 10:41:33 GMT'}]
|
2021-11-16
|
[array(['Mashkaria', 'Satvik', ''], dtype=object)
array(['Ódor', 'Gergely', ''], dtype=object)
array(['Thiran', 'Patrick', ''], dtype=object)]
|
3,428 |
1701.07933
|
Zhaoliang Liao
|
Zhaoliang Liao, Rongying Jin, E. W. Plummer, Jiandi Zhang
|
Delicate competing electronic states in ultrathin manganite films
|
Accepted by Phys. Rev. B
| null |
10.1103/PhysRevB.95.085130
| null |
cond-mat.mtrl-sci
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The coupling between the electrical transport properties of La2/3Sr1/3MnO3
(LSMO) thin films and structural phase transitions of SrTiO3 (STO) substrates
at Ts = 105 K has been investigated. We found that the electrical resistivity
of LSMO films exhibit a cusp at Ts, which is greatly amplified by tuning films
to the verge of metallic and insulating phases, i.e., to the boundary of two
delicate competing electronic states. Our results demonstrate that small
amounts of strain can tip the subtle balance of competing interactions and tune
the electronic properties in correlated electron materials.
|
[{'version': 'v1', 'created': 'Fri, 27 Jan 2017 03:33:29 GMT'}]
|
2017-02-28
|
[array(['Liao', 'Zhaoliang', ''], dtype=object)
array(['Jin', 'Rongying', ''], dtype=object)
array(['Plummer', 'E. W.', ''], dtype=object)
array(['Zhang', 'Jiandi', ''], dtype=object)]
|
3,429 |
1907.12408
|
Rodrigo Velez
|
Rodrigo A. Velez and Alexander L. Brown
|
Empirical strategy-proofness
| null | null | null | null |
econ.TH cs.GT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the plausibility of sub-optimal Nash equilibria of the direct
revelation mechanism associated with a strategy-proof social choice function.
By using the recently introduced empirical equilibrium analysis (Velez and
Brown, 2019, arXiv:1804.07986) we determine that this behavior is plausible
only when the social choice function violates a non-bossiness condition and
information is not interior. Analysis of the accumulated experimental and
empirical evidence on these games supports our findings.
|
[{'version': 'v1', 'created': 'Mon, 29 Jul 2019 13:17:29 GMT'}
{'version': 'v2', 'created': 'Wed, 11 Sep 2019 20:46:37 GMT'}
{'version': 'v3', 'created': 'Wed, 27 Nov 2019 18:15:33 GMT'}
{'version': 'v4', 'created': 'Mon, 27 Jan 2020 16:47:18 GMT'}
{'version': 'v5', 'created': 'Mon, 6 Jul 2020 20:09:10 GMT'}]
|
2020-07-08
|
[array(['Velez', 'Rodrigo A.', ''], dtype=object)
array(['Brown', 'Alexander L.', ''], dtype=object)]
|
3,430 |
2306.17249
|
Flavio Petruzzellis
|
Flavio Petruzzellis, Alberto Testolin, Alessandro Sperduti
|
A Hybrid System for Systematic Generalization in Simple Arithmetic
Problems
|
Accepted at NeSy 2023, 17th International Workshop on Neural-Symbolic
Learning and Reasoning
| null | null | null |
cs.NE cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
Solving symbolic reasoning problems that require compositionality and
systematicity is considered one of the key ingredients of human intelligence.
However, symbolic reasoning is still a great challenge for deep learning
models, which often cannot generalize the reasoning pattern to
out-of-distribution test cases. In this work, we propose a hybrid system
capable of solving arithmetic problems that require compositional and
systematic reasoning over sequences of symbols. The model acquires such a skill
by learning appropriate substitution rules, which are applied iteratively to
the input string until the expression is completely resolved. We show that the
proposed system can accurately solve nested arithmetical expressions even when
trained only on a subset including the simplest cases, significantly
outperforming both a sequence-to-sequence model trained end-to-end and a
state-of-the-art large language model.
|
[{'version': 'v1', 'created': 'Thu, 29 Jun 2023 18:35:41 GMT'}]
|
2023-07-03
|
[array(['Petruzzellis', 'Flavio', ''], dtype=object)
array(['Testolin', 'Alberto', ''], dtype=object)
array(['Sperduti', 'Alessandro', ''], dtype=object)]
|
3,431 |
2306.04992
|
Jinniu Hu
|
Kaixuan Huang, Jinniu Hu, Ying Zhang, Hong Shen
|
The hadronic equation of state of HESS J1731-347 from the relativistic
mean-field model with tensor coupling
|
20 pages, 4 figures, 4 tables, suggestions and comments are welcome!
| null | null | null |
nucl-th astro-ph.HE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A recent report has identified a central compact object (CCO) within the
supernova remnant HESS J1731-347, with a mass and radius of
$M=0.77^{+0.20}_{-0.17}M{\odot}$ and $R=10.4^{+0.86}_{-0.78}$ km, respectively.
To investigate this light compact star, a density-dependent relativistic
mean-field (DDRMF) model, specifically the DDVT model, has been employed. The
DDVT model incorporates tensor couplings of vector mesons, which {can}
successfully describe the properties of finite nuclei, such as charge radius,
binding energy, and spin-orbit splitting. The introduction of tensor coupling
reduces the influence of scalar mesons and generates a softer equation of state
(EOS) in the outer core of the neutron star. Moreover, it has been found that
the crust segment plays a crucial role in reproducing the mass-radius relation
of HESS J1731-347, indicating a preference for a soft crust EOS. By
manipulating the coupling strength of the isovector meson in the DDVT parameter
set, a reasonable hadronic EOS has been obtained, satisfying the constraints
from the gravitational-wave signal GW170817, the simultaneous mass-radius
measurements from the NICER collaboration, and the properties of finite nuclei.
Notably, the mass-radius relations derived from this hadronic EOS also
accurately describe the observables of HESS J1731-347. Therefore, based on our
estimation, the CCO in HESS J1731-347 may represent the lightest known neutron
star.
|
[{'version': 'v1', 'created': 'Thu, 8 Jun 2023 07:26:39 GMT'}]
|
2023-06-09
|
[array(['Huang', 'Kaixuan', ''], dtype=object)
array(['Hu', 'Jinniu', ''], dtype=object)
array(['Zhang', 'Ying', ''], dtype=object)
array(['Shen', 'Hong', ''], dtype=object)]
|
3,432 |
cs/0605134
|
Boon-Chong Seet
|
Boon-Chong Seet, Bu-Sung Lee, and Chiew-Tong Lau
|
DSR with Non-Optimal Route Suppression for MANETs
|
10 pages, 17 figures
| null | null | null |
cs.NI
| null |
This paper revisits the issue of route discovery in dynamic source routing
(DSR) for mobile ad hoc networks (MANETs), and puts forward a proposal of a
lightweight non-optimal route suppression technique based on the observation of
a rarely noted but commonly occurring phenomenon in route discovery. The
technique exploits the observed phenomenon to extract query state information
that permits intermediate nodes to identify and suppress the initiation of
route replies with non-optimal routes, even if the route query is received for
the first time. A detailed evaluation of DSR with non-optimal route suppression
is found to yield significant improvements in both protocol efficiency and
performance.
|
[{'version': 'v1', 'created': 'Mon, 29 May 2006 17:33:00 GMT'}]
|
2007-05-23
|
[array(['Seet', 'Boon-Chong', ''], dtype=object)
array(['Lee', 'Bu-Sung', ''], dtype=object)
array(['Lau', 'Chiew-Tong', ''], dtype=object)]
|
3,433 |
0710.1753
|
Mauricio Garay
|
Mauricio D. Garay
|
A generalisation of the Cauchy-Kovalevskaia theorem
| null | null | null | null |
math.FA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
I prove, under mild assumptions, that solutions to linear evolution equations
admit sectorial solutions. The size of the sector depends on the regularity of
the initial data. If it is regular enough the solution is holomorphic and
unique otherwise it is sectorial. I also prove that the result is optimal for
many partial differential systems (which includes KdV and other examples).
|
[{'version': 'v1', 'created': 'Tue, 9 Oct 2007 13:25:32 GMT'}
{'version': 'v2', 'created': 'Mon, 31 Dec 2007 10:57:52 GMT'}
{'version': 'v3', 'created': 'Tue, 1 Apr 2008 16:07:42 GMT'}
{'version': 'v4', 'created': 'Wed, 9 May 2012 13:50:57 GMT'}
{'version': 'v5', 'created': 'Sun, 28 Jun 2015 18:26:26 GMT'}]
|
2015-06-30
|
[array(['Garay', 'Mauricio D.', ''], dtype=object)]
|
3,434 |
1905.00334
|
Johannes M\"uller
|
Burkhard A. Hense, Matthew McIntosh, Johannes M\"uller, Martin
Schuster
|
Homogeneous and Heterogeneous Response of Quorum-Sensing Bacteria in an
Evolutionary Context
| null | null | null | null |
q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To explain the stability of cooperation is a central task of evolutionary
theory. We investigate this question in the case of quorum sensing (QS)
bacteria, which regulate cooperative traits in response to population density.
Cooperation is modeled by the prisoner's dilemma, where individuals produce a
costly public good (PG) that equally benefits all members of a community
divided into multiple, distinct patches (multilevel selection). Cost and
benefit are non-linear functions of the PG production. The analysis of
evolutionary stability yields an optimization problem for the expression of PG
in dependency on the number of QS individuals within a colony. We find that the
optimal total PG production of the QS population mainly depends on the shape of
the benefit. A graded and a switch-like response is possible, in accordance
with earlier results. Interestingly, at the level of the individual cell, the
QS response is determined by the shape of the costs. All QS individuals respond
either homogeneously if cost are a convex function of the PG production rate,
or they respond heterogeneously with distinct ON/OFF responses if the costs are
concave. The latter finding is consistent with recent experimental findings,
and contradicts the usual interpretation of QS as a mechanism to establish a
uniform, synchronized response of a bacterial population.
|
[{'version': 'v1', 'created': 'Wed, 1 May 2019 14:47:05 GMT'}]
|
2019-05-02
|
[array(['Hense', 'Burkhard A.', ''], dtype=object)
array(['McIntosh', 'Matthew', ''], dtype=object)
array(['Müller', 'Johannes', ''], dtype=object)
array(['Schuster', 'Martin', ''], dtype=object)]
|
3,435 |
2208.01279
|
Kaustav Mukherjee Dr
|
Karan Singh, Dheeraj Ranaut, G. Sharma, and K. Mukherjee
|
Melting of spin ice state and development of fifth order susceptibility
with magnetic field in pyrochlore Tb2Sn2O7
|
Accepted in New J. Phys. (2022)
|
New J. Phys. 24, 073037 (2022)
|
10.1088/1367-2630/ac7fdf
| null |
cond-mat.str-el
|
http://creativecommons.org/licenses/by/4.0/
|
Pyrochlores offer an ideal playground to investigate the magnetic ground
state of frustrated magnetic systems. In this class of materials, competition
between various magnetic interactions remains frustrated and prevents an
ordered magnetic state at low temperatures. Tb2Sn2O7 has recently attracted
significant attention due to its ordered spin-ice state. Additionally, in such
systems, application of external magnetic field might result in exotic magnetic
states. Our current investigation on Tb2Sn2O7 reveal the presence of a new
phase associated with fifth order susceptibility at low temperatures and high
magnetic fields. In this compound, at zero fields, for a stabilized spin-ice
state, the singlet-singlet state separated by {\delta} play an imperative role.
Under magnetic fields, {\delta} increases and the Zeeman energy associated with
the magnetic anisotropy is believed to get enhanced; which can be the key
ingredient for evolution of higher-order moments, above 10 kOe, in this
compound.
|
[{'version': 'v1', 'created': 'Tue, 2 Aug 2022 06:59:13 GMT'}]
|
2022-10-06
|
[array(['Singh', 'Karan', ''], dtype=object)
array(['Ranaut', 'Dheeraj', ''], dtype=object)
array(['Sharma', 'G.', ''], dtype=object)
array(['Mukherjee', 'K.', ''], dtype=object)]
|
3,436 |
1111.6790
|
Sao Mai Nguyen
|
Sao Mai Nguyen (INRIA Bordeaux - Sud-Ouest), Adrien Baranes (INRIA
Bordeaux - Sud-Ouest), Pierre-Yves Oudeyer (INRIA Bordeaux - Sud-Ouest)
|
Constraining the Size Growth of the Task Space with Socially Guided
Intrinsic Motivation using Demonstrations
|
JCAI Workshop on Agents Learning Interactively from Human Teachers
(ALIHT), Barcelona : Spain (2011)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents an algorithm for learning a highly redundant inverse
model in continuous and non-preset environments. Our Socially Guided Intrinsic
Motivation by Demonstrations (SGIM-D) algorithm combines the advantages of both
social learning and intrinsic motivation, to specialise in a wide range of
skills, while lessening its dependence on the teacher. SGIM-D is evaluated on a
fishing skill learning experiment.
|
[{'version': 'v1', 'created': 'Tue, 29 Nov 2011 12:29:27 GMT'}]
|
2011-11-30
|
[array(['Nguyen', 'Sao Mai', '', 'INRIA Bordeaux - Sud-Ouest'],
dtype=object)
array(['Baranes', 'Adrien', '', 'INRIA\n Bordeaux - Sud-Ouest'],
dtype=object)
array(['Oudeyer', 'Pierre-Yves', '', 'INRIA Bordeaux - Sud-Ouest'],
dtype=object) ]
|
3,437 |
1111.2000
|
Karl-Olof Lindahl
|
Karl-Olof Lindahl, Michael Zieve
|
On hyperbolic fixed points in ultrametric dynamics
|
http://www.springerlink.com/content/?k=doi%3a%2810.1134%2fS2070046610030052%29
|
p-Adic Numbers, Ultrametric Analysis and Applications, Vol. 2, No
3, pp. 232-240, 2010
|
10.1134/S2070046610030052
| null |
math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let K be a complete ultrametric field. We give lower and upper bounds for the
size of linearization discs for power series over K near hyperbolic fixed
points. These estimates are maximal in the sense that there exist examples
where these estimates give the exact size of the corresponding linearization
disc. In particular, at repelling fixed points, the linearization disc is equal
to the maximal disc on which the power series is injective.
|
[{'version': 'v1', 'created': 'Tue, 8 Nov 2011 18:13:15 GMT'}]
|
2011-11-09
|
[array(['Lindahl', 'Karl-Olof', ''], dtype=object)
array(['Zieve', 'Michael', ''], dtype=object)]
|
3,438 |
1411.1566
|
Khushbu Dash
|
Khushbu Dash, Sujata Panda, Bankim Chandra Ray
|
Effect of thermal and cryogenic conditioning on flexural behavior of
thermally shocked Cu-Al2O3 micro- and nano-composites
| null |
Metallurgical and Materials Transactions A, Volume 45, Issue 3 ,
pp 1567-1578, 2014
|
10.1007/s11661-013-2070-7
| null |
cond-mat.mtrl-sci
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This investigation has used flexural test to explore the effects of thermal
treatments, i.e., high-temperature and cryogenic environments on the mechanical
property of alumina particulate-reinforced Cu metal matrix micro and
nanocomposites in ex-situ and in-situ conditions. Cu-5 vol. pct alumina micro
(10 micron)- and nanocomposites (<50 nm) fabricated by powder metallurgy route
were subjected to up-thermal shock cycle [193 K to 353 K (-80C to 80C)] and
down-thermal shock cycle [193 K to 353 K (from 80C to -80C)] for different time
periods followed by 3-point bend test. One batch of specimens (micro and
nanocomposites) was conditioned at [193 K to 353 K (from 80C to -80C)]
separately followed by 3-point flexural test. High-temperature flexural test
was performed at [373 K to 523 K (100C to 250C)] on the micro and
nanocomposites. All the fractured samples obtained after various thermal
treatments were studied under scanning electron microscope (SEM). The
development of thermal stresses quite often results in concentration of
residual stresses at the particle/matrix interface eventually weakening it.
Enhancement of flexural strength was recorded for down- as well as for
up-thermal shock in microcomposites. The high-temperature flexural strengths of
micro and nanocomposites are lower than those at ambient temperature. The
amelioration and declination in mechanical properties as a consequence of
thermal shock, thermal conditioning, and high-temperature flexural testing have
been discussed in the light of fractography.
|
[{'version': 'v1', 'created': 'Thu, 6 Nov 2014 11:12:16 GMT'}]
|
2014-11-07
|
[array(['Dash', 'Khushbu', ''], dtype=object)
array(['Panda', 'Sujata', ''], dtype=object)
array(['Ray', 'Bankim Chandra', ''], dtype=object)]
|
3,439 |
1809.10242
|
Zhujun Xiao
|
Zhujun Xiao, Yanzi Zhu, Yuxin Chen, Ben Y. Zhao, Junchen Jiang, Haitao
Zheng
|
Addressing Training Bias via Automated Image Annotation
| null | null | null | null |
cs.CV cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Build accurate DNN models requires training on large labeled, context
specific datasets, especially those matching the target scenario. We believe
advances in wireless localization, working in unison with cameras, can produce
automated annotation of targets on images and videos captured in the wild.
Using pedestrian and vehicle detection as examples, we demonstrate the
feasibility, benefits, and challenges of an automatic image annotation system.
Our work calls for new technical development on passive localization, mobile
data analytics, and error-resilient ML models, as well as design issues in user
privacy policies.
|
[{'version': 'v1', 'created': 'Sat, 22 Sep 2018 19:47:01 GMT'}
{'version': 'v2', 'created': 'Wed, 10 Oct 2018 12:09:25 GMT'}]
|
2018-10-11
|
[array(['Xiao', 'Zhujun', ''], dtype=object)
array(['Zhu', 'Yanzi', ''], dtype=object)
array(['Chen', 'Yuxin', ''], dtype=object)
array(['Zhao', 'Ben Y.', ''], dtype=object)
array(['Jiang', 'Junchen', ''], dtype=object)
array(['Zheng', 'Haitao', ''], dtype=object)]
|
3,440 |
1809.05042
|
Chris J. Maddison
|
Chris J. Maddison, Daniel Paulin, Yee Whye Teh, Brendan O'Donoghue,
Arnaud Doucet
|
Hamiltonian Descent Methods
| null | null | null | null |
math.OC cs.LG stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a family of optimization methods that achieve linear convergence
using first-order gradient information and constant step sizes on a class of
convex functions much larger than the smooth and strongly convex ones. This
larger class includes functions whose second derivatives may be singular or
unbounded at their minima. Our methods are discretizations of conformal
Hamiltonian dynamics, which generalize the classical momentum method to model
the motion of a particle with non-standard kinetic energy exposed to a
dissipative force and the gradient field of the function of interest. They are
first-order in the sense that they require only gradient computation. Yet,
crucially the kinetic gradient map can be designed to incorporate information
about the convex conjugate in a fashion that allows for linear convergence on
convex functions that may be non-smooth or non-strongly convex. We study in
detail one implicit and two explicit methods. For one explicit method, we
provide conditions under which it converges to stationary points of non-convex
functions. For all, we provide conditions on the convex function and kinetic
energy pair that guarantee linear convergence, and show that these conditions
can be satisfied by functions with power growth. In sum, these methods expand
the class of convex functions on which linear convergence is possible with
first-order computation.
|
[{'version': 'v1', 'created': 'Thu, 13 Sep 2018 16:21:11 GMT'}]
|
2018-09-14
|
[array(['Maddison', 'Chris J.', ''], dtype=object)
array(['Paulin', 'Daniel', ''], dtype=object)
array(['Teh', 'Yee Whye', ''], dtype=object)
array(["O'Donoghue", 'Brendan', ''], dtype=object)
array(['Doucet', 'Arnaud', ''], dtype=object)]
|
3,441 |
1402.6121
|
Emilio Hernandez-Garcia
|
Pavel V. Paulau (ICBM), Damia Gomila, Cristobal Lopez and Emilio
Hernandez-Garcia (IFISC, CSIC-UIB)
|
Self-localized states in species competition
|
9 pages, 8 figures, to appear in Physical Review E
|
Physical Review E 89, 032724 (2014)
|
10.1103/PhysRevE.89.032724
| null |
nlin.PS q-bio.PE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study the conditions under which species interaction, as described by
continuous versions of the competitive Lotka-Volterra model (namely the
nonlocal Kolmogorov-Fisher model, and its differential approximation), can
support the existence of localized states, i.e. patches of species with
enhanced population surrounded in niche space by species at smaller densities.
These states would arise from species interaction, and not by any preferred
niche location or better fitness. In contrast to previous works we include only
quadratic nonlinearities, so that the localized patches appear on a background
of homogeneously distributed species coexistence, instead than on top of the
no-species empty state. For the differential model we find and describe in
detail the stable localized states. For the full nonlocal model, however
competitive interactions alone do not allow the conditions for the observation
of self-localized states, and we show how the inclusion of additional
facilitative interactions lead to the appearance of them.
|
[{'version': 'v1', 'created': 'Tue, 25 Feb 2014 10:41:00 GMT'}]
|
2014-04-02
|
[array(['Paulau', 'Pavel V.', '', 'ICBM'], dtype=object)
array(['Gomila', 'Damia', '', 'IFISC, CSIC-UIB'], dtype=object)
array(['Lopez', 'Cristobal', '', 'IFISC, CSIC-UIB'], dtype=object)
array(['Hernandez-Garcia', 'Emilio', '', 'IFISC, CSIC-UIB'], dtype=object)]
|
3,442 |
1907.09740
|
Rade T. \v{Z}ivaljevi\'c
|
Du\v{s}ko Joji\'c, Gaiane Panina, and Rade \v{Z}ivaljevi\'c
|
Splitting necklaces, with constraints
|
A new section added (Section 7) with new consequences of the main
results from Section 6
| null | null | null |
math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We prove several versions of N. Alon's "necklace-splitting theorem", subject
to additional constraints, as illustrated by the following results. (1) The
"almost equicardinal necklace-splitting theorem" claims that, without
increasing the number of cuts, one guarantees the existence of a fair splitting
such that each thief is allocated (approximately) one and the same number of
pieces of the necklace (including "degenerate pieces" if they exist), provided
the number of thieves $r=p^\nu$ is a prime power. (2) The "binary splitting
theorem" claims that if $r=2^d$ and the thieves are associated with the
vertices of a $d$-cube then, without increasing the number of cuts, one can
guarantee the existence of a fair splitting such that adjacent pieces are
allocated to thieves that share an edge of the cube. This result provides a
positive answer to the "binary splitting necklace conjecture" of Asada at al.
(Conjecture 2.11 in [7]) in the case $r=2^d$. (3) An interesting variation
arises when the thieves have their own individual preferences. We prove several
"envy-free fair necklace-splitting theorems" of various level of generality. By
specialization we obtain numerous corollaries, among them envy-free versions of
(a) "almost equicardinal splitting theorem", (b) "necklace-splitting theorem
for $r$-unavoidable preferences", (c) "envy-free binary splitting theorem",
etc. As a corollary we also obtain a recent result of Avvakumov and Karasev [1]
about envy-free divisions where players may prefer an empty part of the
necklace.
|
[{'version': 'v1', 'created': 'Tue, 23 Jul 2019 08:00:59 GMT'}
{'version': 'v2', 'created': 'Fri, 13 Dec 2019 09:58:13 GMT'}
{'version': 'v3', 'created': 'Mon, 13 Apr 2020 10:24:24 GMT'}
{'version': 'v4', 'created': 'Wed, 23 Sep 2020 05:51:08 GMT'}]
|
2020-09-24
|
[array(['Jojić', 'Duško', ''], dtype=object)
array(['Panina', 'Gaiane', ''], dtype=object)
array(['Živaljević', 'Rade', ''], dtype=object)]
|
3,443 |
1408.7050
|
Pramod N. Achar
|
Pramod N. Achar, Laura Rider
|
The affine Grassmannian and the Springer resolution in positive
characteristic
|
50 pages; with an appendix joint with Simon Riche. v2: minor
corrections
|
Compositio Math. 152 (2016) 2627-2677
|
10.1112/S0010437X16007661
| null |
math.RT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
An important result of Arkhipov-Bezrukavnikov-Ginzburg relates constructible
sheaves on the affine Grassmannian to coherent sheaves on the dual Springer
resolution. In this paper, we prove a positive-characteristic analogue of this
statement, using the framework of "mixed modular sheaves" recently developed by
the first author and Riche. As an application, we deduce a relationship between
parity sheaves on the affine Grassmannian and Bezrukavnikov's "exotic
t-structure" on the Springer resolution.
|
[{'version': 'v1', 'created': 'Fri, 29 Aug 2014 15:10:01 GMT'}
{'version': 'v2', 'created': 'Fri, 5 Feb 2016 22:56:49 GMT'}]
|
2019-02-20
|
[array(['Achar', 'Pramod N.', ''], dtype=object)
array(['Rider', 'Laura', ''], dtype=object)]
|
3,444 |
2106.00359
|
Adri\`a Arbu\'es-Sang\"uesa
|
Adri\`a Arbu\'es-Sang\"uesa, Adri\'an Mart\'in, Paulino Granero,
Coloma Ballester, Gloria Haro
|
Learning Football Body-Orientation as a Matter of Classification
|
Accepted in the AI for Sports Analytics Workshop at ICJAI 2021
| null | null | null |
cs.LG cs.CV eess.IV
|
http://creativecommons.org/licenses/by/4.0/
|
Orientation is a crucial skill for football players that becomes a
differential factor in a large set of events, especially the ones involving
passes. However, existing orientation estimation methods, which are based on
computer-vision techniques, still have a lot of room for improvement. To the
best of our knowledge, this article presents the first deep learning model for
estimating orientation directly from video footage. By approaching this
challenge as a classification problem where classes correspond to orientation
bins, and by introducing a cyclic loss function, a well-known convolutional
network is refined to provide player orientation data. The model is trained by
using ground-truth orientation data obtained from wearable EPTS devices, which
are individually compensated with respect to the perceived orientation in the
current frame. The obtained results outperform previous methods; in particular,
the absolute median error is less than 12 degrees per player. An ablation study
is included in order to show the potential generalization to any kind of
football video footage.
|
[{'version': 'v1', 'created': 'Tue, 1 Jun 2021 10:12:32 GMT'}]
|
2021-06-02
|
[array(['Arbués-Sangüesa', 'Adrià', ''], dtype=object)
array(['Martín', 'Adrián', ''], dtype=object)
array(['Granero', 'Paulino', ''], dtype=object)
array(['Ballester', 'Coloma', ''], dtype=object)
array(['Haro', 'Gloria', ''], dtype=object)]
|
3,445 |
math-ph/0210002
|
Armen Nersessian
|
E.G.Kalnins, W.Miller, Jr., G.S.Pogosyan
|
The Coulomb-Oscillator Relation on n-Dimensional Spheres and
Hyperboloids
|
15 pages, LaTeX
| null |
10.1134/1.1490116
| null |
math-ph hep-th math.MP nlin.SI quant-ph
| null |
In this paper we establish a relation between Coulomb and oscillator systems
on $n$-dimensional spheres and hyperboloids for $n\geq 2$. We show that, as in
Euclidean space, the quasiradial equation for the $n+1$ dimensional Coulomb
problem coincides with the $2n$-dimensional quasiradial oscillator equation on
spheres and hyperboloids. Using the solution of the Schr\"odinger equation for
the oscillator system, we construct the energy spectrum and wave functions for
the Coulomb problem.
|
[{'version': 'v1', 'created': 'Tue, 1 Oct 2002 08:20:12 GMT'}]
|
2012-08-27
|
[array(['Kalnins', 'E. G.', ''], dtype=object)
array(['Miller,', 'W.', 'Jr.'], dtype=object)
array(['Pogosyan', 'G. S.', ''], dtype=object)]
|
3,446 |
1402.6778
|
Man Kwong
|
Man Kam Kwong
|
Nonnegative Trigonometric Polynomials, Sturms Theorem, and Symbolic
Computation
| null | null | null | null |
math.CA cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, we explain a procedure based on a classical result of Sturm
that can be used to determine rigorously whether a given trigonometric
polynomial is nonnegative in a certain interval or not. Many examples are
given. This technique has been employed by the author in several recent works.
The procedure often involves tedious computations that are time-consuming and
error-prone. Fortunately, symbolic computation software is available to
automate the procedure. In this paper, we give the details of its
implementation in MAPLE 13. Some who are strongly attached to a more
traditional theoretical research framework may find such details boring or even
consider computer-assisted proofs suspicious. However, we emphasize again that
the procedure is completely mathematically rigorous.
|
[{'version': 'v1', 'created': 'Thu, 27 Feb 2014 03:07:02 GMT'}
{'version': 'v2', 'created': 'Tue, 26 Apr 2016 00:58:45 GMT'}]
|
2016-04-27
|
[array(['Kwong', 'Man Kam', ''], dtype=object)]
|
3,447 |
2102.02080
|
Fajri Koto
|
Fajri Koto and Jey Han Lau and Timothy Baldwin
|
Top-down Discourse Parsing via Sequence Labelling
|
Accepted at EACL 2021
| null | null | null |
cs.CL
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce a top-down approach to discourse parsing that is conceptually
simpler than its predecessors (Kobayashi et al., 2020; Zhang et al., 2020). By
framing the task as a sequence labelling problem where the goal is to
iteratively segment a document into individual discourse units, we are able to
eliminate the decoder and reduce the search space for splitting points. We
explore both traditional recurrent models and modern pre-trained transformer
models for the task, and additionally introduce a novel dynamic oracle for
top-down parsing. Based on the Full metric, our proposed LSTM model sets a new
state-of-the-art for RST parsing.
|
[{'version': 'v1', 'created': 'Wed, 3 Feb 2021 14:30:21 GMT'}
{'version': 'v2', 'created': 'Mon, 5 Apr 2021 20:32:38 GMT'}]
|
2021-04-07
|
[array(['Koto', 'Fajri', ''], dtype=object)
array(['Lau', 'Jey Han', ''], dtype=object)
array(['Baldwin', 'Timothy', ''], dtype=object)]
|
3,448 |
2010.01238
|
Gustavo Olague Dr.
|
Gustavo Olague and Gerardo Ibarra-Vazquez and Mariana Chan-Ley and
Cesar Puente and Carlos Soubervielle-Montalvo and Axel Martinez
|
A Deep Genetic Programming based Methodology for Art Media
Classification Robust to Adversarial Perturbations
|
13 pages, 3 figures, International Symposium on Visual Computing 2020
| null | null | null |
cs.CV cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Art Media Classification problem is a current research area that has
attracted attention due to the complex extraction and analysis of features of
high-value art pieces. The perception of the attributes can not be subjective,
as humans sometimes follow a biased interpretation of artworks while ensuring
automated observation's trustworthiness. Machine Learning has outperformed many
areas through its learning process of artificial feature extraction from images
instead of designing handcrafted feature detectors. However, a major concern
related to its reliability has brought attention because, with small
perturbations made intentionally in the input image (adversarial attack), its
prediction can be completely changed. In this manner, we foresee two ways of
approaching the situation: (1) solve the problem of adversarial attacks in
current neural networks methodologies, or (2) propose a different approach that
can challenge deep learning without the effects of adversarial attacks. The
first one has not been solved yet, and adversarial attacks have become even
more complex to defend. Therefore, this work presents a Deep Genetic
Programming method, called Brain Programming, that competes with deep learning
and studies the transferability of adversarial attacks using two artworks
databases made by art experts. The results show that the Brain Programming
method preserves its performance in comparison with AlexNet, making it robust
to these perturbations and competing to the performance of Deep Learning.
|
[{'version': 'v1', 'created': 'Sat, 3 Oct 2020 00:36:34 GMT'}]
|
2021-03-03
|
[array(['Olague', 'Gustavo', ''], dtype=object)
array(['Ibarra-Vazquez', 'Gerardo', ''], dtype=object)
array(['Chan-Ley', 'Mariana', ''], dtype=object)
array(['Puente', 'Cesar', ''], dtype=object)
array(['Soubervielle-Montalvo', 'Carlos', ''], dtype=object)
array(['Martinez', 'Axel', ''], dtype=object)]
|
3,449 |
1901.05259
|
Bodo Kaiser
|
Bodo Kaiser and Shadi Albarqouni
|
MRI to CT Translation with GANs
|
22 pages, 12 figures
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a detailed description and reference implementation of
preprocessing steps necessary to prepare the public Retrospective Image
Registration Evaluation (RIRE) dataset for the task of magnetic resonance
imaging (MRI) to X-ray computed tomography (CT) translation. Furthermore we
describe and implement three state of the art convolutional neural network
(CNN) and generative adversarial network (GAN) models where we report
statistics and visual results of two of them.
|
[{'version': 'v1', 'created': 'Wed, 16 Jan 2019 12:31:08 GMT'}]
|
2019-01-17
|
[array(['Kaiser', 'Bodo', ''], dtype=object)
array(['Albarqouni', 'Shadi', ''], dtype=object)]
|
3,450 |
1211.2190
|
Luca Martino
|
Jesse Read, Luca Martino, David Luengo
|
Efficient Monte Carlo Methods for Multi-Dimensional Learning with
Classifier Chains
|
Submitted to Pattern Recognition
|
Pattern Recognition, Volume 47, Issue 3, Pages: 1535-1546, 2014
|
10.1016/j.patcog.2013.10.006
| null |
cs.LG stat.CO stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Multi-dimensional classification (MDC) is the supervised learning problem
where an instance is associated with multiple classes, rather than with a
single class, as in traditional classification problems. Since these classes
are often strongly correlated, modeling the dependencies between them allows
MDC methods to improve their performance - at the expense of an increased
computational cost. In this paper we focus on the classifier chains (CC)
approach for modeling dependencies, one of the most popular and highest-
performing methods for multi-label classification (MLC), a particular case of
MDC which involves only binary classes (i.e., labels). The original CC
algorithm makes a greedy approximation, and is fast but tends to propagate
errors along the chain. Here we present novel Monte Carlo schemes, both for
finding a good chain sequence and performing efficient inference. Our
algorithms remain tractable for high-dimensional data sets and obtain the best
predictive performance across several real data sets.
|
[{'version': 'v1', 'created': 'Fri, 9 Nov 2012 17:21:48 GMT'}
{'version': 'v2', 'created': 'Mon, 17 Dec 2012 18:39:35 GMT'}
{'version': 'v3', 'created': 'Mon, 15 Apr 2013 16:43:20 GMT'}
{'version': 'v4', 'created': 'Sat, 7 Sep 2013 13:10:06 GMT'}]
|
2014-05-20
|
[array(['Read', 'Jesse', ''], dtype=object)
array(['Martino', 'Luca', ''], dtype=object)
array(['Luengo', 'David', ''], dtype=object)]
|
3,451 |
1601.01358
|
Leyla Isik
|
Leyla Isik, Andrea Tacchetti, and Tomaso Poggio
|
Fast, invariant representation for human action in the visual system
| null | null | null | null |
q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Humans can effortlessly recognize others' actions in the presence of complex
transformations, such as changes in viewpoint. Several studies have located the
regions in the brain involved in invariant action recognition, however, the
underlying neural computations remain poorly understood. We use
magnetoencephalography (MEG) decoding and a dataset of well-controlled,
naturalistic videos of five actions (run, walk, jump, eat, drink) performed by
different actors at different viewpoints to study the computational steps used
to recognize actions across complex transformations. In particular, we ask when
the brain discounts changes in 3D viewpoint relative to when it initially
discriminates between actions. We measure the latency difference between
invariant and non-invariant action decoding when subjects view full videos as
well as form-depleted and motion-depleted stimuli. Our results show no
difference in decoding latency or temporal profile between invariant and
non-invariant action recognition in full videos. However, when either form or
motion information is removed from the stimulus set, we observe a decrease and
delay in invariant action decoding. Our results suggest that the brain
recognizes actions and builds invariance to complex transformations at the same
time, and that both form and motion information are crucial for fast, invariant
action recognition.
|
[{'version': 'v1', 'created': 'Thu, 7 Jan 2016 00:28:06 GMT'}
{'version': 'v2', 'created': 'Tue, 15 Aug 2017 14:46:56 GMT'}]
|
2017-08-16
|
[array(['Isik', 'Leyla', ''], dtype=object)
array(['Tacchetti', 'Andrea', ''], dtype=object)
array(['Poggio', 'Tomaso', ''], dtype=object)]
|
3,452 |
2012.10778
|
Koushik Pal
|
Koushik Pal, Yi Xia, Jiahong Shen, Jiangang He, Yubo Luo, Mercouri G.
Kanatzidis, and Chris Wolverton
|
Accelerated Discovery of a Large Family of Quaternary Chalcogenides with
very Low Lattice Thermal Conductivity
| null | null | null | null |
cond-mat.mtrl-sci
|
http://creativecommons.org/licenses/by/4.0/
|
The development of efficient thermal energy management devices such as
thermoelectrics, barrier coatings, and thermal data-storage disks often relies
on compounds that possess very low lattice thermal conductivity ($\kappa_l$).
Here, we present the computational prediction of a large family of 628
thermodynamically stable quaternary chalcogenides, AMM'Q$_3$ (A =
alkali/alkaline earth/post-transition metals; M/M' = transition metals,
lanthanides; Q = chalcogens) using high-throughput density functional theory
(DFT) calculations. We validate the presence of low-$\kappa_l$ in this family
of materials by calculating $\kappa_l$ of several predicted stable compounds
using the Peierls-Boltzmann transport equation within a first-principles DFT
framework. Our analysis reveals that the low-$\kappa_l$ in the AMM'Q$_3$
compounds originates from the presence of either a strong lattice anharmonicity
that enhances the phonon scatterings or rattlers cations that lead to multiple
scattering channels in their crystal structures. Our predictions suggest new
experimental research opportunities in the synthesis and characterization of
these stable, low-$\kappa_l$ compounds.
|
[{'version': 'v1', 'created': 'Sat, 19 Dec 2020 20:53:11 GMT'}]
|
2020-12-22
|
[array(['Pal', 'Koushik', ''], dtype=object)
array(['Xia', 'Yi', ''], dtype=object)
array(['Shen', 'Jiahong', ''], dtype=object)
array(['He', 'Jiangang', ''], dtype=object)
array(['Luo', 'Yubo', ''], dtype=object)
array(['Kanatzidis', 'Mercouri G.', ''], dtype=object)
array(['Wolverton', 'Chris', ''], dtype=object)]
|
3,453 |
2201.03979
|
Guillaume Olikier
|
Guillaume Olikier, P.-A. Absil
|
On the continuity of the tangent cone to the determinantal variety
| null | null |
10.1007/s11228-021-00618-9
| null |
math.OC cs.NA math.NA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Tangent and normal cones play an important role in constrained optimization
to describe admissible search directions and, in particular, to formulate
optimality conditions. They notably appear in various recent algorithms for
both smooth and nonsmooth low-rank optimization where the feasible set is the
set $\mathbb{R}_{\leq r}^{m \times n}$ of all $m \times n$ real matrices of
rank at most $r$. In this paper, motivated by the convergence analysis of such
algorithms, we study, by computing inner and outer limits, the continuity of
the correspondence that maps each $X \in \mathbb{R}_{\leq r}^{m \times n}$ to
the tangent cone to $\mathbb{R}_{\leq r}^{m \times n}$ at $X$. We also deduce
results about the continuity of the corresponding normal cone correspondence.
Finally, we show that our results include as a particular case the
$a$-regularity of the Whitney stratification of $\mathbb{R}_{\leq r}^{m \times
n}$ following from the fact that this set is a real algebraic variety, called
the real determinantal variety.
|
[{'version': 'v1', 'created': 'Tue, 11 Jan 2022 14:45:03 GMT'}]
|
2023-02-02
|
[array(['Olikier', 'Guillaume', ''], dtype=object)
array(['Absil', 'P. -A.', ''], dtype=object)]
|
3,454 |
nucl-ex/0702027
|
Lei Guo
|
L. Guo, D. P. Weygand, M. Battaglieri, R. De Vita, V. Kubarovsky, P.
Stoler (for the CLAS Collaboration)
|
Cascade production in the reactions gamma p --> K+ K+ (X) and gamma p
--> K^+ K^+ pi- (X)
|
10 pages, 10 figures
|
Phys.Rev.C76:025208,2007
|
10.1103/PhysRevC.76.025208
|
JLAB-PHY-07-621
|
nucl-ex
| null |
Photoproduction of the cascade resonances has been investigated in the
reactions $\gamma p \to K^+ K^+ (X)$ and $\gamma p \to K^+ K^+ \pi^- (X)$. The
mass split of the $\Xi$ doublet is measured to be $5.4\pm 1.8$ MeV/c$^2$,
consistent with existing measurements. The differential (total) cross sections
for the $\Xi^{-}$ have been determined for photon beam energies from 2.75 to
3.85 (4.75) GeV, and are consistent with a possible production mechanism of
$Y^*\to K^+\Xi^-$ through a $t$-channel process. The reaction $\gamma p \to K^+
K^+ \pi^-[\Xi^0]$ has also been investigated in search of excited cascade
resonances. No significant signal of excited cascade states other than the
$\Xi^-(1530)$ is observed. The cross section results of the $\Xi^-(1530)$ have
also been obtained for photon beam energies from 3.35 to 4.75 GeV.
|
[{'version': 'v1', 'created': 'Mon, 12 Feb 2007 22:05:40 GMT'}
{'version': 'v2', 'created': 'Sat, 17 Feb 2007 19:54:41 GMT'}
{'version': 'v3', 'created': 'Fri, 9 Mar 2007 14:47:53 GMT'}
{'version': 'v4', 'created': 'Thu, 5 Jul 2007 22:04:53 GMT'}]
|
2019-08-14
|
[array(['Guo', 'L.', '', 'for the CLAS Collaboration'], dtype=object)
array(['Weygand', 'D. P.', '', 'for the CLAS Collaboration'], dtype=object)
array(['Battaglieri', 'M.', '', 'for the CLAS Collaboration'],
dtype=object)
array(['De Vita', 'R.', '', 'for the CLAS Collaboration'], dtype=object)
array(['Kubarovsky', 'V.', '', 'for the CLAS Collaboration'], dtype=object)
array(['Stoler', 'P.', '', 'for the CLAS Collaboration'], dtype=object)]
|
3,455 |
2302.00526
|
Tommaso Comellato
|
Tommaso Comellato, Matteo Agostini, Stefan Sch\"onert
|
Topologies of $^{76}$Ge double-beta decay events and calibration
procedure biases
| null |
The European Physical Journal C 83, 236 (2023)
|
10.1140/epjc/s10052-023-11396-z
| null |
hep-ex physics.ins-det
|
http://creativecommons.org/licenses/by/4.0/
|
The analysis of the time profile of electrical signals produced by energy
depositions in germanium detectors allows discrimination of events with
different topologies. This is especially relevant for experiments searching for
the neutrinoless double beta decay of $^{76}$Ge to distinguish the sought-after
signal from other background sources. The standard calibration procedures used
to tune the selection criteria for double-beta decay events use a $^{228}$Th
source, because it provides samples of signal-like events. These samples
exhibit energy spatial distributions with subtle different topologies compared
to neutrinoless double-beta decay events. In this work, we will characterize
these topological differences and, with the support of a $^{56}$Co source,
evaluate biases and precision of calibration techniques which use such event
samples. Our results will be particularly relevant for future experiments in
which a solid estimation of the efficiency is required.
|
[{'version': 'v1', 'created': 'Wed, 1 Feb 2023 15:54:28 GMT'}
{'version': 'v2', 'created': 'Wed, 22 Mar 2023 12:17:13 GMT'}]
|
2023-03-23
|
[array(['Comellato', 'Tommaso', ''], dtype=object)
array(['Agostini', 'Matteo', ''], dtype=object)
array(['Schönert', 'Stefan', ''], dtype=object)]
|
3,456 |
1703.09999
|
Linda Angela Zotti
|
Linda A. Zotti and Rub\'en P\'erez
|
Platinum atomic contacts: from tunneling to contact
|
7 pages, 8 figures
|
Phys. Rev. B 95, 125438 (2017)
|
10.1103/PhysRevB.95.125438
| null |
cond-mat.mes-hall cond-mat.mtrl-sci physics.comp-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a theoretical study of the electronic transport through Pt
nanocontacts. We show that the analysis of the tunnelling regime requires a
very careful treatment of the technical details. For instance, an insufficient
size of the system can cause unphysical charge oscillations to arise along the
transport direction; moreover, the use of an inappropriate basis set can
deviate the distance dependence of the conductance from the expected
exponential trend. While the conductance decay can be either corrected by
employing ghost atoms or a large-cutoff-radius basis set, the same does not
apply to the corrugation, for which only the second option is recommended.
Interestingly, these details were not found to have a remarkable impact in the
contact regime. These findings are important for theoretical studies of
distance-dependent phenomena in scanning-probe and break-junction experiments.
|
[{'version': 'v1', 'created': 'Wed, 29 Mar 2017 12:25:31 GMT'}]
|
2017-03-30
|
[array(['Zotti', 'Linda A.', ''], dtype=object)
array(['Pérez', 'Rubén', ''], dtype=object)]
|
3,457 |
2302.03782
|
Nicholas Wolczynski
|
Terrence Neumann and Nicholas Wolczynski
|
Does AI-Assisted Fact-Checking Disproportionately Benefit Majority
Groups Online?
| null | null | null | null |
cs.CY cs.SI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In recent years, algorithms have been incorporated into fact-checking
pipelines. They are used not only to flag previously fact-checked
misinformation, but also to provide suggestions about which trending claims
should be prioritized for fact-checking - a paradigm called `check-worthiness.'
While several studies have examined the accuracy of these algorithms, none have
investigated how the benefits from these algorithms (via reduction in exposure
to misinformation) are distributed amongst various online communities. In this
paper, we investigate how diverse representation across multiple stages of the
AI development pipeline affects the distribution of benefits from AI-assisted
fact-checking for different online communities. We simulate information
propagation through the network using our novel Topic-Aware, Community-Impacted
Twitter (TACIT) simulator on a large Twitter followers network, tuned to
produce realistic cascades of true and false information across multiple
topics. Finally, using simulated data as a test bed, we implement numerous
algorithmic fact-checking interventions that explicitly account for notions of
diversity. We find that both representative and egalitarian methods for
sampling and labeling check-worthiness model training data can lead to
network-wide benefit concentrated in majority communities, while incorporating
diversity into how fact-checkers use algorithmic recommendations can actively
reduce inequalities in benefits between majority and minority communities.
These findings contribute to an important conversation around the responsible
implementation of AI-assisted fact-checking by social media platforms and
fact-checking organizations.
|
[{'version': 'v1', 'created': 'Tue, 7 Feb 2023 22:41:37 GMT'}
{'version': 'v2', 'created': 'Thu, 9 Feb 2023 17:18:31 GMT'}]
|
2023-02-10
|
[array(['Neumann', 'Terrence', ''], dtype=object)
array(['Wolczynski', 'Nicholas', ''], dtype=object)]
|
3,458 |
1904.09523
|
Ning Zhu
|
Ning Zhu
|
Neural Architecture Search for Deep Face Recognition
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
By the widespread popularity of electronic devices, the emergence of
biometric technology has brought significant convenience to user authentication
compared with the traditional password and mode unlocking. Among many
biological characteristics, the face is a universal and irreplaceable feature
that does not need too much cooperation and can significantly improve the
user's experience at the same time. Face recognition is one of the main
functions of electronic equipment propaganda. Hence it's virtually worth
researching in computer vision. Previous work in this field has focused on two
directions: converting loss function to improve recognition accuracy in
traditional deep convolution neural networks (Resnet); combining the latest
loss function with the lightweight system (MobileNet) to reduce network size at
the minimal expense of accuracy. But none of these has changed the network
structure. With the development of AutoML, neural architecture search (NAS) has
shown excellent performance in the benchmark of image classification. In this
paper, we integrate NAS technology into face recognition to customize a more
suitable network. We quote the framework of neural architecture search which
trains child and controller network alternately. At the same time, we mutate
NAS by incorporating evaluation latency into rewards of reinforcement learning
and utilize policy gradient algorithm to search the architecture automatically
with the most classical cross-entropy loss. The network architectures we
searched out have got state-of-the-art accuracy in the large-scale face
dataset, which achieves 98.77% top-1 in MS-Celeb-1M and 99.89% in LFW with
relatively small network size. To the best of our knowledge, this proposal is
the first attempt to use NAS to solve the problem of Deep Face Recognition and
achieve the best results in this domain.
|
[{'version': 'v1', 'created': 'Sun, 21 Apr 2019 01:05:41 GMT'}
{'version': 'v2', 'created': 'Fri, 26 Apr 2019 09:54:47 GMT'}]
|
2019-04-29
|
[array(['Zhu', 'Ning', ''], dtype=object)]
|
3,459 |
1111.3612
|
Valery N. Marachevsky
|
Valery N. Marachevsky
|
Theory of the Casimir effect for graphene at finite temperature
|
13 pages, based on a talk at QFEXT-11
| null |
10.1142/S2010194512007556
| null |
hep-th cond-mat.mes-hall quant-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Theory of the Casimir effect for a flat graphene layer interacting with a
parallel flat material is presented in detail. The high-temperature asymptotics
of a free energy in a graphene-metal system coincides with a Drude
high-temperature asymptotics of the metal-metal system. High-temperature
behavior in the graphene-metal system is expected at separations of the order
of 100 nm at temperature T=300K.
|
[{'version': 'v1', 'created': 'Tue, 15 Nov 2011 19:21:28 GMT'}]
|
2015-06-03
|
[array(['Marachevsky', 'Valery N.', ''], dtype=object)]
|
3,460 |
1902.08111
|
Anatolij K. Prykarpatski
|
Oksana Ye. Hentosh, Yarema A. Prykarpatsky, Denis Blackmore and
Anatolij K. Prykarpatski
|
Dispersionless Multi-Dimensional Integrable Systems and Related
Conformal Structure Generating Equations of Mathematical Physics
| null |
SIGMA 15 (2019), 079, 20 pages
|
10.3842/SIGMA.2019.079
| null |
math-ph math.MP nlin.SI
|
http://creativecommons.org/licenses/by-sa/4.0/
|
Using diffeomorphism group vector fields on $\mathbb{C}$-multiplied tori and
the related Lie-algebraic structures, we study multi-dimensional dispersionless
integrable systems that describe conformal structure generating equations of
mathematical physics. An interesting modification of the devised Lie-algebraic
approach subject to spatial-dimensional invariance and meromorphicity of the
related differential-geometric structures is described and applied in proving
complete integrability of some conformal structure generating equations. As
examples, we analyze the Einstein-Weyl metric equation, the modified
Einstein-Weyl metric equation, the Dunajski heavenly equation system, the first
and second conformal structure generating equations and the inverse first
Shabat reduction heavenly equation. We also analyze the modified Pleba\'nski
heavenly equations, the Husain heavenly equation and the general Monge equation
along with their multi-dimensional generalizations. In addition, we construct
superconformal analogs of the Whitham heavenly equation.
|
[{'version': 'v1', 'created': 'Thu, 21 Feb 2019 15:58:24 GMT'}
{'version': 'v2', 'created': 'Mon, 25 Feb 2019 19:49:33 GMT'}
{'version': 'v3', 'created': 'Mon, 14 Oct 2019 06:12:03 GMT'}]
|
2019-10-15
|
[array(['Hentosh', 'Oksana Ye.', ''], dtype=object)
array(['Prykarpatsky', 'Yarema A.', ''], dtype=object)
array(['Blackmore', 'Denis', ''], dtype=object)
array(['Prykarpatski', 'Anatolij K.', ''], dtype=object)]
|
3,461 |
0908.3038
|
Irinel Chiorescu
|
N. Groll, S. Bertaina, M. Pati, N.S. Dalal, I. Chiorescu
|
Entrapment of magnetic micro-crystals for on-chip electron spin
resonance studies
|
to appear in Journal of Applied Physics
|
J. Appl. Phys., 106 (4), 046106 (2009)
|
10.1063/1.3207774
| null |
cond-mat.mes-hall
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
On-chip Electron Spin Resonance (ESR) of magnetic molecules requires the
ability to precisely position nanosized samples in antinodes of the
electro-magnetic field for maximal magnetic interaction. A method is developed
to entrap micro-crystals containing spins in a well defined location on a
substrate's surface. Traditional cavity ESR measurements are then performed on
a mesoscopic crystal at 34 GHz. Polycrystalline diluted Cr$^{5+}$ spins were
entrapped as well and measured while approaching the lower limit of the ESR
sensitivity. This method suggests the feasibility of on-chip ESR measurements
at dilution refrigerator temperatures by enabling the positioning of samples
atop an on-chip superconducting cavity.
|
[{'version': 'v1', 'created': 'Fri, 21 Aug 2009 01:19:31 GMT'}]
|
2009-08-28
|
[array(['Groll', 'N.', ''], dtype=object)
array(['Bertaina', 'S.', ''], dtype=object)
array(['Pati', 'M.', ''], dtype=object)
array(['Dalal', 'N. S.', ''], dtype=object)
array(['Chiorescu', 'I.', ''], dtype=object)]
|
3,462 |
cs/0205051
|
Neal Young
|
David Karger, Phil Klein, Cliff Stein, Mikkel Thorup, Neal E. Young
|
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
|
Conference version in ACM Symposium on Theory of Computing (1999). To
appear in Mathematics of Operations Research
|
Mathematics of Operations Research 29(3):436-461(2004)
|
10.1287/moor.1030.0086
| null |
cs.DS cs.DM
| null |
The multiway-cut problem is, given a weighted graph and k >= 2 terminal
nodes, to find a minimum-weight set of edges whose removal separates all the
terminals. The problem is NP-hard, and even NP-hard to approximate within
1+delta for some small delta > 0.
Calinescu, Karloff, and Rabani (1998) gave an algorithm with performance
guarantee 3/2-1/k, based on a geometric relaxation of the problem. In this
paper, we give improved randomized rounding schemes for their relaxation,
yielding a 12/11-approximation algorithm for k=3 and a 1.3438-approximation
algorithm in general.
Our approach hinges on the observation that the problem of designing a
randomized rounding scheme for a geometric relaxation is itself a linear
programming problem. The paper explores computational solutions to this
problem, and gives a proof that for a general class of geometric relaxations,
there are always randomized rounding schemes that match the integrality gap.
|
[{'version': 'v1', 'created': 'Sun, 19 May 2002 14:40:18 GMT'}
{'version': 'v2', 'created': 'Mon, 15 Sep 2003 20:51:43 GMT'}]
|
2015-06-02
|
[array(['Karger', 'David', ''], dtype=object)
array(['Klein', 'Phil', ''], dtype=object)
array(['Stein', 'Cliff', ''], dtype=object)
array(['Thorup', 'Mikkel', ''], dtype=object)
array(['Young', 'Neal E.', ''], dtype=object)]
|
3,463 |
1811.06261
|
Suchi Kumari
|
Suchi Kumari, Abhishek Saroha and Anurag Singh
|
Efficient Edge Rewiring Strategies for Enhancement in Network Capacity
|
14 pages
| null | null | null |
cs.NI cs.SI
|
http://creativecommons.org/licenses/by/4.0/
|
The structure of the network has great impact on its traffic dynamics. Most
of the real world networks follow the heterogeneous structure and exhibit
scale-free feature. In scale-free network, a new node prefers to connect with
hub nodes and the network capacity is curtailed by smaller degree nodes.
Therefore, we propose rewiring a fraction of links in the network, to improve
the network transport efficiency. In this paper, we discuss some efficient link
rewiring strategies and perform simulations on scale-free networks, confirming
the effectiveness of these strategies. The rewiring strategies actually reduce
the centrality of the nodes having higher betweenness centrality. After the
link rewiring process, the degree distribution of the network remains the same.
This work will be beneficial for the enhancement of network performance.
|
[{'version': 'v1', 'created': 'Thu, 15 Nov 2018 09:59:59 GMT'}
{'version': 'v2', 'created': 'Wed, 16 Jan 2019 01:42:31 GMT'}]
|
2019-01-17
|
[array(['Kumari', 'Suchi', ''], dtype=object)
array(['Saroha', 'Abhishek', ''], dtype=object)
array(['Singh', 'Anurag', ''], dtype=object)]
|
3,464 |
astro-ph/0703275
|
Mohsen Shadmehri
|
Fazeleh Khajenabi, Mohsen Shadmehri
|
Gravitational instability of discs with dissipative corona around
supermassive black holes
|
accepted by MNRAS
|
Mon.Not.Roy.Astron.Soc.377:1689-1695,2007
|
10.1111/j.1365-2966.2007.11731.x
| null |
astro-ph
| null |
We study the dynamical structure of a self-gravitating disc with corona
around a super-massive black hole. Assuming that the
magneto-rotational-instability (MRI) responsible for generating the turbulent
stresses inside the disc is also the source for a magnetically dominated
corona, a fraction of the power released when the disc matter accretes is
transported to and dissipated in the corona. This has major effect on the
structure of the disc and its gravitational (in)stability according to our
analytical and self-consistent solutions. We determine the radius where the
disc crosses the inner radius of gravitational instability and forms the first
stars. Not only the location of this radius which may extend to very large
distances from the central black hole, but also the mass of the first stars
highly depends on the input parameters, notably the viscous coefficient, mass
of the central object and the accretion rate. For accretion discs around
quasi-stellar objects (QSOs) and the Galactic center, we determine the
self-gravitating radius and the mass of the first clumps. Comparing the cases
with a corona and without a corona for typical discs around QSOs or the
Galactic center, when the viscosity coefficient is around 0.3, we show that the
self-gravitating radius decreases by a factor of approximately 2, but the mass
of the fragments increases with more or less the same factor. Existence of a
corona implies a more gravitationally unstable disc according to our results.
The effect of a corona on the instability of the disc is more effective when
the viscosity coefficient increases.
|
[{'version': 'v1', 'created': 'Mon, 12 Mar 2007 16:41:18 GMT'}]
|
2008-11-26
|
[array(['Khajenabi', 'Fazeleh', ''], dtype=object)
array(['Shadmehri', 'Mohsen', ''], dtype=object)]
|
3,465 |
1203.1407
|
W-Y. P. Hwang
|
W-Y. Pauchy Hwang
|
Formation of Partially Dark-Matter Galaxies
|
18 pages
| null | null | null |
hep-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The problem of galactic formation and evolution should be solved on the basis
of the Standard Model of particle physics. We believe that we live in the
quantum 4-dimensional Minkowski space-time with the force-fields gauge-group
structure SU_c(3) \times SU_L(2) \times U(1) \times SU_f(3) built-in from the
very beginning, i.e., the "background" of our world. From this "background", we
can see the lepton world, of atomic sizes, and also the quark world, of
(fermi)^3 sizes. Basing on this belief, we study galactic formation and
evolution, concluding that our Cosmos should end up with "model" galaxies. A
model galaxy is the one in which a spiral visible ordinary-matter galaxy, such
as our Milky Way and satellites, is surrounded by a huge dark-matter neutrino
halo. As a byproduct (of studying the Standard Model), we find that neutrinos
will be the {\it only long-lived} dark-matter particles.
|
[{'version': 'v1', 'created': 'Wed, 7 Mar 2012 09:04:51 GMT'}
{'version': 'v2', 'created': 'Wed, 13 Jan 2016 05:15:21 GMT'}]
|
2016-01-14
|
[array(['Hwang', 'W-Y. Pauchy', ''], dtype=object)]
|
3,466 |
1803.02318
|
Anna Pancoast
|
A. Pancoast, A. J. Barth, K. Horne, T. Treu, B. J. Brewer, V. N.
Bennert, G. Canalizo, E. L. Gates, W. Li, M. A. Malkan, D. Sand, T. Schmidt,
S. Valenti, J. H. Woo, K. I. Clubb, M. C. Cooper, S. M. Crawford, S. F.
Honig, M. D. Joner, M. T. Kandrashoff, M. Lazarova, A. M. Nierenberg, E.
Romero-Colmenero, D. Son, E. Tollerud, J. L. Walsh, and H. Winkler
|
Stability of the Broad Line Region Geometry and Dynamics in Arp 151 Over
Seven Years
|
21 pages, 8 figures, 2 tables. Accepted for publication in ApJ
| null |
10.3847/1538-4357/aab3c6
| null |
astro-ph.GA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Seyfert 1 galaxy Arp 151 was monitored as part of three reverberation
mapping campaigns spanning $2008-2015$. We present modeling of these
velocity-resolved reverberation mapping datasets using a geometric and
dynamical model for the broad line region (BLR). By modeling each of the three
datasets independently, we infer the evolution of the BLR structure in Arp 151
over a total of seven years and constrain the systematic uncertainties in
non-varying parameters such as the black hole mass. We find that the BLR
geometry of a thick disk viewed close to face-on is stable over this time,
although the size of the BLR grows by a factor of $\sim 2$. The dynamics of the
BLR are dominated by inflow and the inferred black hole mass is consistent for
the three datasets, despite the increase in BLR size. Combining the inference
for the three datasets yields a black hole mass and statistical uncertainty of
$\log_{10}($M$_{\rm BH}/\rm{M}_{\odot})=6.82^{+0.09}_{-0.09}$ with a standard
deviation in individual measurements of 0.13 dex.
|
[{'version': 'v1', 'created': 'Tue, 6 Mar 2018 18:10:55 GMT'}]
|
2018-04-11
|
[array(['Pancoast', 'A.', ''], dtype=object)
array(['Barth', 'A. J.', ''], dtype=object)
array(['Horne', 'K.', ''], dtype=object)
array(['Treu', 'T.', ''], dtype=object)
array(['Brewer', 'B. J.', ''], dtype=object)
array(['Bennert', 'V. N.', ''], dtype=object)
array(['Canalizo', 'G.', ''], dtype=object)
array(['Gates', 'E. L.', ''], dtype=object)
array(['Li', 'W.', ''], dtype=object)
array(['Malkan', 'M. A.', ''], dtype=object)
array(['Sand', 'D.', ''], dtype=object)
array(['Schmidt', 'T.', ''], dtype=object)
array(['Valenti', 'S.', ''], dtype=object)
array(['Woo', 'J. H.', ''], dtype=object)
array(['Clubb', 'K. I.', ''], dtype=object)
array(['Cooper', 'M. C.', ''], dtype=object)
array(['Crawford', 'S. M.', ''], dtype=object)
array(['Honig', 'S. F.', ''], dtype=object)
array(['Joner', 'M. D.', ''], dtype=object)
array(['Kandrashoff', 'M. T.', ''], dtype=object)
array(['Lazarova', 'M.', ''], dtype=object)
array(['Nierenberg', 'A. M.', ''], dtype=object)
array(['Romero-Colmenero', 'E.', ''], dtype=object)
array(['Son', 'D.', ''], dtype=object)
array(['Tollerud', 'E.', ''], dtype=object)
array(['Walsh', 'J. L.', ''], dtype=object)
array(['Winkler', 'H.', ''], dtype=object)]
|
3,467 |
2304.04239
|
Jumpei Yamagishi
|
Jumpei F. Yamagishi and Kunihiko Kaneko
|
Universal Transitions between Growth and Dormancy via Intermediate
Complex Formation
|
6+6 pages, 3+6 figures
| null | null | null |
q-bio.CB physics.bio-ph
|
http://creativecommons.org/licenses/by-sa/4.0/
|
A simple cell model consisting of a catalytic reaction network with
intermediate complex formation is numerically studied. As nutrients are
depleted, the transition from the exponential growth phase to the
growth-arrested dormant phase occurs along with hysteresis and a lag time for
growth recovery. This transition is caused by the accumulation of intermediate
complexes, leading to the jamming of reactions and the diversification of
components. These properties are generic in random reaction networks, as
supported by dynamical systems analyses of corresponding mean-field models.
|
[{'version': 'v1', 'created': 'Sun, 9 Apr 2023 13:55:45 GMT'}]
|
2023-04-11
|
[array(['Yamagishi', 'Jumpei F.', ''], dtype=object)
array(['Kaneko', 'Kunihiko', ''], dtype=object)]
|
3,468 |
2108.01166
|
Zhoutong Zhang
|
Zhoutong Zhang, Forrester Cole, Richard Tucker, William T. Freeman,
Tali Dekel
|
Consistent Depth of Moving Objects in Video
|
Published at SIGGRAPH 2021
|
ACM Trans. Graph., Vol. 40, No. 4, Article 148, August 2021
|
10.1145/3450626.3459871
| null |
cs.CV cs.GR
|
http://creativecommons.org/licenses/by/4.0/
|
We present a method to estimate depth of a dynamic scene, containing
arbitrary moving objects, from an ordinary video captured with a moving camera.
We seek a geometrically and temporally consistent solution to this
underconstrained problem: the depth predictions of corresponding points across
frames should induce plausible, smooth motion in 3D. We formulate this
objective in a new test-time training framework where a depth-prediction CNN is
trained in tandem with an auxiliary scene-flow prediction MLP over the entire
input video. By recursively unrolling the scene-flow prediction MLP over
varying time steps, we compute both short-range scene flow to impose local
smooth motion priors directly in 3D, and long-range scene flow to impose
multi-view consistency constraints with wide baselines. We demonstrate accurate
and temporally coherent results on a variety of challenging videos containing
diverse moving objects (pets, people, cars), as well as camera motion. Our
depth maps give rise to a number of depth-and-motion aware video editing
effects such as object and lighting insertion.
|
[{'version': 'v1', 'created': 'Mon, 2 Aug 2021 20:53:18 GMT'}]
|
2021-08-04
|
[array(['Zhang', 'Zhoutong', ''], dtype=object)
array(['Cole', 'Forrester', ''], dtype=object)
array(['Tucker', 'Richard', ''], dtype=object)
array(['Freeman', 'William T.', ''], dtype=object)
array(['Dekel', 'Tali', ''], dtype=object)]
|
3,469 |
1106.5775
|
Yuncheng You
|
Yuncheng You
|
Longtime Dynamics of The Oregonator System
|
28 pages
| null |
10.1002/mma.1591
| null |
math.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this work the existence and properties of a global attractor for the
solution semiflow of the Oregonator system are proved. The Oregonator system is
the mathematical model of the famous Belousov-Zhabotinskii reaction. A
rescaling and grouping estimation method is developed to show the absorbing
property and the asymptotic compactness of the solution trajectories of this
three-variable reaction-diffusion system with quadratic nonlinearity from the
autocatalytic kinetics. It is proved that the fractal dimension of the global
attractor is finite. The existence of an exponential attractor for this
Oregonator semiflow is also shown.
|
[{'version': 'v1', 'created': 'Tue, 28 Jun 2011 19:35:58 GMT'}]
|
2015-05-28
|
[array(['You', 'Yuncheng', ''], dtype=object)]
|
3,470 |
1612.03928
|
Sergey Zagoruyko
|
Sergey Zagoruyko and Nikos Komodakis
|
Paying More Attention to Attention: Improving the Performance of
Convolutional Neural Networks via Attention Transfer
| null | null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Attention plays a critical role in human visual experience. Furthermore, it
has recently been demonstrated that attention can also play an important role
in the context of applying artificial neural networks to a variety of tasks
from fields such as computer vision and NLP. In this work we show that, by
properly defining attention for convolutional neural networks, we can actually
use this type of information in order to significantly improve the performance
of a student CNN network by forcing it to mimic the attention maps of a
powerful teacher network. To that end, we propose several novel methods of
transferring attention, showing consistent improvement across a variety of
datasets and convolutional neural network architectures. Code and models for
our experiments are available at
https://github.com/szagoruyko/attention-transfer
|
[{'version': 'v1', 'created': 'Mon, 12 Dec 2016 21:15:57 GMT'}
{'version': 'v2', 'created': 'Tue, 24 Jan 2017 23:26:16 GMT'}
{'version': 'v3', 'created': 'Sun, 12 Feb 2017 22:05:47 GMT'}]
|
2017-02-14
|
[array(['Zagoruyko', 'Sergey', ''], dtype=object)
array(['Komodakis', 'Nikos', ''], dtype=object)]
|
3,471 |
1912.05000
|
Nadir Bengana
|
Nadir Bengana and Janne Heikkil\"a
|
Improving land cover segmentation across satellites using domain
adaptation
|
12 pages, Transaction
| null | null | null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Land use and land cover mapping are essential to various fields of study,
including forestry, agriculture, and urban management. Using earth observation
satellites both facilitate and accelerate the task. Lately, deep learning
methods have proven to be excellent at automating the mapping via semantic
image segmentation. However, because deep neural networks require large amounts
of labeled data, it is not easy to exploit the full potential of satellite
imagery. Additionally, the land cover tends to differ in appearance from one
region to another; therefore, having labeled data from one location does not
necessarily help in mapping others. Furthermore, satellite images come in
various multispectral bands (the bands could range from RGB to over twelve
bands). In this paper, we aim at using domain adaptation to solve the
aforementioned problems. We applied a well-performing domain adaptation
approach on datasets we have built using RGB images from Sentinel-2,
WorldView-2, and Pleiades-1 satellites with Corine Land Cover as ground-truth
labels. We have also used the DeepGlobe land cover dataset. Experiments show a
significant improvement over results obtained without the use of domain
adaptation. In some cases, an improvement of over 20% MIoU. At times it even
manages to correct errors in the ground-truth labels.
|
[{'version': 'v1', 'created': 'Mon, 25 Nov 2019 15:41:14 GMT'}
{'version': 'v2', 'created': 'Wed, 1 Apr 2020 14:34:21 GMT'}]
|
2020-04-02
|
[array(['Bengana', 'Nadir', ''], dtype=object)
array(['Heikkilä', 'Janne', ''], dtype=object)]
|
3,472 |
2305.15016
|
Kostis Gourgoulias
|
Najah Ghalyan, Kostis Gourgoulias, Yash Satsangi, Sean Moran, Maxime
Labonne, Joseph Sabelja
|
An Unsupervised Method for Estimating Class Separability of Datasets
with Application to LLMs Fine-Tuning
| null | null | null | null |
cs.LG
|
http://creativecommons.org/licenses/by-sa/4.0/
|
This paper proposes an unsupervised method that leverages topological
characteristics of data manifolds to estimate class separability of the data
without requiring labels. Experiments conducted in this paper on several
datasets demonstrate a clear correlation and consistency between the class
separability estimated by the proposed method with supervised metrics like
Fisher Discriminant Ratio~(FDR) and cross-validation of a classifier, which
both require labels. This can enable implementing learning paradigms aimed at
learning from both labeled and unlabeled data, like semi-supervised and
transductive learning. This would be particularly useful when we have limited
labeled data and a relatively large unlabeled dataset that can be used to
enhance the learning process. The proposed method is implemented for language
model fine-tuning with automated stopping criterion by monitoring class
separability of the embedding-space manifold in an unsupervised setting. The
proposed methodology has been first validated on synthetic data, where the
results show a clear consistency between class separability estimated by the
proposed method and class separability computed by FDR. The method has been
also implemented on both public and internal data. The results show that the
proposed method can effectively aid -- without the need for labels -- a
decision on when to stop or continue the fine-tuning of a language model and
which fine-tuning iteration is expected to achieve a maximum classification
performance through quantification of the class separability of the embedding
manifold.
|
[{'version': 'v1', 'created': 'Wed, 24 May 2023 10:58:09 GMT'}]
|
2023-05-25
|
[array(['Ghalyan', 'Najah', ''], dtype=object)
array(['Gourgoulias', 'Kostis', ''], dtype=object)
array(['Satsangi', 'Yash', ''], dtype=object)
array(['Moran', 'Sean', ''], dtype=object)
array(['Labonne', 'Maxime', ''], dtype=object)
array(['Sabelja', 'Joseph', ''], dtype=object)]
|
3,473 |
2305.19181
|
Bin Xiao
|
Bin Xiao, Murat Simsek, Burak Kantarci, Ala Abu Alkheir
|
Table Detection for Visually Rich Document Images
| null | null | null | null |
cs.CV cs.IR
|
http://creativecommons.org/licenses/by-nc-nd/4.0/
|
Table Detection (TD) is a fundamental task towards visually rich document
understanding. Current studies usually formulate the TD problem as an object
detection problem, then leverage Intersection over Union (IoU) based metrics to
evaluate the model performance and IoU-based loss functions to optimize the
model. TD applications usually require the prediction results to cover all the
table contents and avoid information loss. However, IoU and IoU-based loss
functions cannot directly reflect the degree of information loss for the
prediction results. Therefore, we propose to decouple IoU into a ground truth
coverage term and a prediction coverage term, in which the former can be used
to measure the information loss of the prediction results.
Besides, tables in the documents are usually large, sparsely distributed, and
have no overlaps because they are designed to summarize essential information
to make it easy to read and interpret for human readers. Therefore, in this
study, we use SparseR-CNN as the base model, and further improve the model by
using Gaussian Noise Augmented Image Size region proposals and many-to-one
label assignments.
To demonstrate the effectiveness of proposed method and compare with
state-of-the-art methods fairly, we conduct experiments and use IoU-based
evaluation metrics to evaluate the model performance. The experimental results
show that the proposed method can consistently outperform state-of-the-art
methods under different IoU-based metric on a variety of datasets. We conduct
further experiments to show the superiority of the proposed decoupled IoU for
the TD applications by replacing the IoU-based loss functions and evaluation
metrics with proposed decoupled IoU counterparts. The experimental results show
that our proposed decoupled IoU loss can encourage the model to alleviate
information loss.
|
[{'version': 'v1', 'created': 'Tue, 30 May 2023 16:25:16 GMT'}]
|
2023-05-31
|
[array(['Xiao', 'Bin', ''], dtype=object)
array(['Simsek', 'Murat', ''], dtype=object)
array(['Kantarci', 'Burak', ''], dtype=object)
array(['Alkheir', 'Ala Abu', ''], dtype=object)]
|
3,474 |
2010.09978
|
Yi-Fan Song
|
Yi-Fan Song, Zhang Zhang, Caifeng Shan and Liang Wang
|
Stronger, Faster and More Explainable: A Graph Convolutional Baseline
for Skeleton-based Action Recognition
|
Accepted by ACM MultiMedia 2020, 9 pages, 4 figures, 5 tables
| null |
10.1145/3394171.3413802
| null |
cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
One essential problem in skeleton-based action recognition is how to extract
discriminative features over all skeleton joints. However, the complexity of
the State-Of-The-Art (SOTA) models of this task tends to be exceedingly
sophisticated and over-parameterized, where the low efficiency in model
training and inference has obstructed the development in the field, especially
for large-scale action datasets. In this work, we propose an efficient but
strong baseline based on Graph Convolutional Network (GCN), where three main
improvements are aggregated, i.e., early fused Multiple Input Branches (MIB),
Residual GCN (ResGCN) with bottleneck structure and Part-wise Attention
(PartAtt) block. Firstly, an MIB is designed to enrich informative skeleton
features and remain compact representations at an early fusion stage. Then,
inspired by the success of the ResNet architecture in Convolutional Neural
Network (CNN), a ResGCN module is introduced in GCN to alleviate computational
costs and reduce learning difficulties in model training while maintain the
model accuracy. Finally, a PartAtt block is proposed to discover the most
essential body parts over a whole action sequence and obtain more explainable
representations for different skeleton action sequences. Extensive experiments
on two large-scale datasets, i.e., NTU RGB+D 60 and 120, validate that the
proposed baseline slightly outperforms other SOTA models and meanwhile requires
much fewer parameters during training and inference procedures, e.g., at most
34 times less than DGNN, which is one of the best SOTA methods.
|
[{'version': 'v1', 'created': 'Tue, 20 Oct 2020 02:56:58 GMT'}]
|
2020-10-21
|
[array(['Song', 'Yi-Fan', ''], dtype=object)
array(['Zhang', 'Zhang', ''], dtype=object)
array(['Shan', 'Caifeng', ''], dtype=object)
array(['Wang', 'Liang', ''], dtype=object)]
|
3,475 |
1907.07847
|
Qisheng Wang
|
Qisheng Wang and Qichao Wang
|
Prioritized Guidance for Efficient Multi-Agent Reinforcement Learning
Exploration
|
Theequations (7)-(10) in the paper are incorrectly derived, and need
to be withdrawn and revised in many places
| null | null | null |
cs.LG cs.MA stat.ML
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Exploration efficiency is a challenging problem in multi-agent reinforcement
learning (MARL), as the policy learned by confederate MARL depends on the
collaborative approach among multiple agents. Another important problem is the
less informative reward restricts the learning speed of MARL compared with the
informative label in supervised learning. In this work, we leverage on a novel
communication method to guide MARL to accelerate exploration and propose a
predictive network to forecast the reward of current state-action pair and use
the guidance learned by the predictive network to modify the reward function.
An improved prioritized experience replay is employed to better take advantage
of the different knowledge learned by different agents which utilizes
Time-difference (TD) error more effectively. Experimental results demonstrates
that the proposed algorithm outperforms existing methods in cooperative
multi-agent environments. We remark that this algorithm can be extended to
supervised learning to speed up its training.
|
[{'version': 'v1', 'created': 'Thu, 18 Jul 2019 02:27:55 GMT'}
{'version': 'v2', 'created': 'Fri, 19 Jul 2019 07:34:39 GMT'}
{'version': 'v3', 'created': 'Wed, 25 Dec 2019 07:05:14 GMT'}]
|
2019-12-30
|
[array(['Wang', 'Qisheng', ''], dtype=object)
array(['Wang', 'Qichao', ''], dtype=object)]
|
3,476 |
1809.08354
|
Anthony Boccaletti
|
A.-M. Lagrange, A. Boccaletti, M. Langlois, G. Chauvin, R. Gratton, H.
Beust, S. Desidera, J. Milli, M. Bonnefoy, A. Cheetham, M. Feldt, M. Meyer,
A. Vigan, B. Biller, M. Bonavita, J.-L. Baudino, F. Cantalloube, M. Cudel, S.
Daemgen, P. Delorme, V. D'Orazi, J. Girard, C. Fontanive, J. Hagelberg, M.
Janson, M. Keppler, T. Koypitova, R. Galicher, J. Lannier, H. Le Coroller, R.
Ligi, A.-L. Maire, D. Mesa, S. Messina, A. Mueller, S. Peretti, C. Perrot, D.
Rouan, G. Salter, M. Samland, T. Schmidt, E. Sissa, A. Zurlo, J.-L. Beuzit,
D. Mouillet, C. Dominik, T. Henning, E. Lagadec, F. Menard, H.-M. Schmid, M.
Turatto, S. Udry, A.J. Bohn, B. Charnay, C. A. Gomez Gonzales, C. Gry, M.
Kenworthy, Q. Kral, C. Mordasini, C. Moutou, G. van der Plas, J. E.
Schlieder, L. Abe, J. Antichi, A. Baruffolo, P. Baudoz, J. Baudrand, P.
Blanchard, A. Bazzon, T. Buey, M. Carbillet, M. Carle, J. Charton, E.
Cascone, R. Claudi, A. Costille, A. Deboulbe, V. de Caprio, K. Dohlen, D.
Fantinel, P. Feautrier, T. Fusco, P. Gigan, E. Giro, D. Gisler, L. Gluck, N.
Hubin, E. Hugot, M. Jaquet, M. Kasper, F. Madec, Y. Magnard, P. Martinez, D.
Maurel, D. Le Mignant, O. Moller-Nilsson, M. Llored, T. Moulin, A. Origne, A.
Pavlov, D. Perret, C. Petit, J. Pragt, J. Szulagyi, and F. Wildi
|
Post conjunction detection of $\beta$ Pictoris b with VLT/SPHERE
|
accepted by A&A
| null |
10.1051/0004-6361/201834302
| null |
astro-ph.EP astro-ph.IM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With an orbital distance comparable to that of Saturn in the solar system,
\bpic b is the closest (semi-major axis $\simeq$\,9\,au) exoplanet that has
been imaged to orbit a star. Thus it offers unique opportunities for detailed
studies of its orbital, physical, and atmospheric properties, and of
disk-planet interactions. With the exception of the discovery observations in
2003 with NaCo at the Very Large Telescope (VLT), all following astrometric
measurements relative to \bpic have been obtained in the southwestern part of
the orbit, which severely limits the determination of the planet's orbital
parameters. We aimed at further constraining \bpic b orbital properties using
more data, and, in particular, data taken in the northeastern part of the
orbit.
We used SPHERE at the VLT to precisely monitor the orbital motion of beta
\bpic b since first light of the instrument in 2014. We were able to monitor
the planet until November 2016, when its angular separation became too small
(125 mas, i.e., 1.6\,au) and prevented further detection. We redetected \bpic b
on the northeast side of the disk at a separation of 139\,mas and a PA of
30$^{\circ}$ in September 2018. The planetary orbit is now well constrained.
With a semi-major axis (sma) of $a = 9.0 \pm 0.5$ au (1 $\sigma $), it
definitely excludes previously reported possible long orbital periods, and
excludes \bpic b as the origin of photometric variations that took place in
1981. We also refine the eccentricity and inclination of the planet. From an
instrumental point of view, these data demonstrate that it is possible to
detect, if they exist, young massive Jupiters that orbit at less than 2 au from
a star that is 20 pc away.
|
[{'version': 'v1', 'created': 'Sat, 22 Sep 2018 00:32:12 GMT'}
{'version': 'v2', 'created': 'Mon, 10 Dec 2018 16:18:54 GMT'}]
|
2019-01-23
|
[array(['Lagrange', 'A. -M.', ''], dtype=object)
array(['Boccaletti', 'A.', ''], dtype=object)
array(['Langlois', 'M.', ''], dtype=object)
array(['Chauvin', 'G.', ''], dtype=object)
array(['Gratton', 'R.', ''], dtype=object)
array(['Beust', 'H.', ''], dtype=object)
array(['Desidera', 'S.', ''], dtype=object)
array(['Milli', 'J.', ''], dtype=object)
array(['Bonnefoy', 'M.', ''], dtype=object)
array(['Cheetham', 'A.', ''], dtype=object)
array(['Feldt', 'M.', ''], dtype=object)
array(['Meyer', 'M.', ''], dtype=object)
array(['Vigan', 'A.', ''], dtype=object)
array(['Biller', 'B.', ''], dtype=object)
array(['Bonavita', 'M.', ''], dtype=object)
array(['Baudino', 'J. -L.', ''], dtype=object)
array(['Cantalloube', 'F.', ''], dtype=object)
array(['Cudel', 'M.', ''], dtype=object)
array(['Daemgen', 'S.', ''], dtype=object)
array(['Delorme', 'P.', ''], dtype=object)
array(["D'Orazi", 'V.', ''], dtype=object)
array(['Girard', 'J.', ''], dtype=object)
array(['Fontanive', 'C.', ''], dtype=object)
array(['Hagelberg', 'J.', ''], dtype=object)
array(['Janson', 'M.', ''], dtype=object)
array(['Keppler', 'M.', ''], dtype=object)
array(['Koypitova', 'T.', ''], dtype=object)
array(['Galicher', 'R.', ''], dtype=object)
array(['Lannier', 'J.', ''], dtype=object)
array(['Coroller', 'H. Le', ''], dtype=object)
array(['Ligi', 'R.', ''], dtype=object)
array(['Maire', 'A. -L.', ''], dtype=object)
array(['Mesa', 'D.', ''], dtype=object)
array(['Messina', 'S.', ''], dtype=object)
array(['Mueller', 'A.', ''], dtype=object)
array(['Peretti', 'S.', ''], dtype=object)
array(['Perrot', 'C.', ''], dtype=object)
array(['Rouan', 'D.', ''], dtype=object)
array(['Salter', 'G.', ''], dtype=object)
array(['Samland', 'M.', ''], dtype=object)
array(['Schmidt', 'T.', ''], dtype=object)
array(['Sissa', 'E.', ''], dtype=object)
array(['Zurlo', 'A.', ''], dtype=object)
array(['Beuzit', 'J. -L.', ''], dtype=object)
array(['Mouillet', 'D.', ''], dtype=object)
array(['Dominik', 'C.', ''], dtype=object)
array(['Henning', 'T.', ''], dtype=object)
array(['Lagadec', 'E.', ''], dtype=object)
array(['Menard', 'F.', ''], dtype=object)
array(['Schmid', 'H. -M.', ''], dtype=object)
array(['Turatto', 'M.', ''], dtype=object)
array(['Udry', 'S.', ''], dtype=object)
array(['Bohn', 'A. J.', ''], dtype=object)
array(['Charnay', 'B.', ''], dtype=object)
array(['Gonzales', 'C. A. Gomez', ''], dtype=object)
array(['Gry', 'C.', ''], dtype=object)
array(['Kenworthy', 'M.', ''], dtype=object)
array(['Kral', 'Q.', ''], dtype=object)
array(['Mordasini', 'C.', ''], dtype=object)
array(['Moutou', 'C.', ''], dtype=object)
array(['van der Plas', 'G.', ''], dtype=object)
array(['Schlieder', 'J. E.', ''], dtype=object)
array(['Abe', 'L.', ''], dtype=object)
array(['Antichi', 'J.', ''], dtype=object)
array(['Baruffolo', 'A.', ''], dtype=object)
array(['Baudoz', 'P.', ''], dtype=object)
array(['Baudrand', 'J.', ''], dtype=object)
array(['Blanchard', 'P.', ''], dtype=object)
array(['Bazzon', 'A.', ''], dtype=object)
array(['Buey', 'T.', ''], dtype=object)
array(['Carbillet', 'M.', ''], dtype=object)
array(['Carle', 'M.', ''], dtype=object)
array(['Charton', 'J.', ''], dtype=object)
array(['Cascone', 'E.', ''], dtype=object)
array(['Claudi', 'R.', ''], dtype=object)
array(['Costille', 'A.', ''], dtype=object)
array(['Deboulbe', 'A.', ''], dtype=object)
array(['de Caprio', 'V.', ''], dtype=object)
array(['Dohlen', 'K.', ''], dtype=object)
array(['Fantinel', 'D.', ''], dtype=object)
array(['Feautrier', 'P.', ''], dtype=object)
array(['Fusco', 'T.', ''], dtype=object)
array(['Gigan', 'P.', ''], dtype=object)
array(['Giro', 'E.', ''], dtype=object)
array(['Gisler', 'D.', ''], dtype=object)
array(['Gluck', 'L.', ''], dtype=object)
array(['Hubin', 'N.', ''], dtype=object)
array(['Hugot', 'E.', ''], dtype=object)
array(['Jaquet', 'M.', ''], dtype=object)
array(['Kasper', 'M.', ''], dtype=object)
array(['Madec', 'F.', ''], dtype=object)
array(['Magnard', 'Y.', ''], dtype=object)
array(['Martinez', 'P.', ''], dtype=object)
array(['Maurel', 'D.', ''], dtype=object)
array(['Mignant', 'D. Le', ''], dtype=object)
array(['Moller-Nilsson', 'O.', ''], dtype=object)
array(['Llored', 'M.', ''], dtype=object)
array(['Moulin', 'T.', ''], dtype=object)
array(['Origne', 'A.', ''], dtype=object)
array(['Pavlov', 'A.', ''], dtype=object)
array(['Perret', 'D.', ''], dtype=object)
array(['Petit', 'C.', ''], dtype=object)
array(['Pragt', 'J.', ''], dtype=object)
array(['Szulagyi', 'J.', ''], dtype=object)
array(['Wildi', 'F.', ''], dtype=object)]
|
3,477 |
2204.04144
|
Apostolos Apostolakis
|
A. Apostolakis, A. G. Balanov, F. V. Kusmartsev and K. N. Alekseev
|
Beyond the ordinary acoustoelectric effect: superluminal phenomena in
the acoustic realm and phonon-mediated Bloch gain
|
22 pages, 17 figures
|
Phys. Rev. B 106, 014312 (2022)
|
10.1103/PhysRevB.106.014312
| null |
cond-mat.mes-hall
|
http://creativecommons.org/licenses/by/4.0/
|
It has been shown that coherent phonons can be used as a potent tool for
controlling and enhancing optoelectronic and transport properties of
nanostructured materials. Recent studies revealed that interaction of acoustic
phonons and fast-moving carriers in semiconductor heterostructures can be
accompanied by electron-phonon instabilities that cause ordinary and induced
Cherenkov effects. However, the development of such instabilities is still
poorly understood. Our study shows that other supersonic phenomena, beyond the
Cherenkov instability, are possible for non-equilibrium charge transport in the
miniband semiconductor superlattices (SLs) driven by an acoustic plane wave.
Using semiclassical nonperturbative methods and elements of the bifurcation
theory, we find the conditions for the onset of dynamical instabilities
(bifurcations) which are caused by the emission of specific SL phonons by
supersonic electrons, and their back action on the electrons. Notably, the
underlying radiation mechanism is connected either to normal or anomalous
Doppler effects in full accordance with the Ginzburg-Frank-Tamm theory. The
appearance of induced Doppler effects is also discussed in relation to the
formation of electron bunches propagating through the spatially periodic
structure of the SL. When the amplitude of the acoustic wave exceeds certain
threshold, the dynamical instabilities developed in the system are manifested
as drift velocity reversals, resonances in sound attenuation and absolute
negative mobility. We demonstrate that the discovered superluminal Doppler
phenomena can be utilized for tunable broadband amplification and generation of
GHz-THz electromagnetic waves, which creates a ground for development of novel
phononic devices.
|
[{'version': 'v1', 'created': 'Fri, 8 Apr 2022 15:51:37 GMT'}]
|
2022-08-09
|
[array(['Apostolakis', 'A.', ''], dtype=object)
array(['Balanov', 'A. G.', ''], dtype=object)
array(['Kusmartsev', 'F. V.', ''], dtype=object)
array(['Alekseev', 'K. N.', ''], dtype=object)]
|
3,478 |
2302.01470
|
Qingfeng Lan
|
Qingfeng Lan, A. Rupam Mahmood, Shuicheng Yan, Zhongwen Xu
|
Learning to Optimize for Reinforcement Learning
|
For code release, see https://github.com/sail-sg/optim4rl
| null | null | null |
cs.LG cs.AI
|
http://creativecommons.org/licenses/by/4.0/
|
In recent years, by leveraging more data, computation, and diverse tasks,
learned optimizers have achieved remarkable success in supervised learning,
outperforming classical hand-designed optimizers. Reinforcement learning (RL)
is essentially different from supervised learning and in practice these learned
optimizers do not work well even in simple RL tasks. We investigate this
phenomenon and identity three issues. First, the gradients of an RL agent vary
across a wide range in logarithms while their absolute values are in a small
range, making neural networks hard to obtain accurate parameter updates.
Second, the agent-gradient distribution is non-independent and identically
distributed, leading to inefficient meta-training. Finally, due to highly
stochastic agent-environment interactions, the agent-gradients have high bias
and variance, which increase the difficulty of learning an optimizer for RL. We
propose gradient processing, pipeline training, and a novel optimizer structure
with good inductive bias to address these issues. By applying these techniques,
for the first time, we show that learning an optimizer for RL from scratch is
possible. Although only trained in toy tasks, our learned optimizer can
generalize to unseen complex tasks in Brax.
|
[{'version': 'v1', 'created': 'Fri, 3 Feb 2023 00:11:02 GMT'}
{'version': 'v2', 'created': 'Sun, 2 Jul 2023 09:40:07 GMT'}]
|
2023-07-04
|
[array(['Lan', 'Qingfeng', ''], dtype=object)
array(['Mahmood', 'A. Rupam', ''], dtype=object)
array(['Yan', 'Shuicheng', ''], dtype=object)
array(['Xu', 'Zhongwen', ''], dtype=object)]
|
3,479 |
2002.06042
|
Soheil Sadeghi Eshkevari
|
Soheil Sadeghi Eshkevari, Thomas J. Matarazzo, Shamim N. Pakzad
|
Simplified Vehicle-Bridge Interaction for Medium to Long-span Bridges
Subject to Random Traffic Load
|
submitted to the Journal of Civil Structural Health Monitoring
|
Journal of Civil Structural Health Monitoring. 2020 Jun 12:1-5
|
10.1007/s13349-020-00413-4
| null |
eess.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study introduces a simplified model for bridge-vehicle interaction for
medium- to long-span bridges subject to random traffic loads. Previous studies
have focused on calculating the exact response of the vehicle or the bridge
based on an interaction force derived from the compatibility between two
systems. This process requires multiple iterations per time step per vehicle
until the compatibility is reached. When a network of vehicles is considered,
the compatibility equation turns to a system of coupled equations which
dramatically increases the complexity of the convergence process. In this
study, we simplify the problem into two sub-problems that are decoupled: (a) a
bridge subject to random Gaussian excitation, and (b) individual sensing agents
that are subject to a linear superposition of the bridge response and the road
profile roughness. The study provides sufficient evidence to confirm the
simulation approach is valid with a minimal error when the bridge span is
medium to long, and the spatio-temporal load pattern can be modeled as random
Gaussian. Quantitatively, the proposed approach is over 1,000 times more
computationally efficient when compared to the conventional approach for a 500
m long bridge, with response prediction errors below $0.1\%$.
|
[{'version': 'v1', 'created': 'Fri, 14 Feb 2020 14:07:17 GMT'}]
|
2020-07-03
|
[array(['Eshkevari', 'Soheil Sadeghi', ''], dtype=object)
array(['Matarazzo', 'Thomas J.', ''], dtype=object)
array(['Pakzad', 'Shamim N.', ''], dtype=object)]
|
3,480 |
1906.03823
|
Sujit Kumar Sahoo Ph.D.
|
Dong Wang, Sujit Kumar Sahoo and Cuong Dang
|
Noninvasive super-resolution imaging through scattering media
|
Typos are corrected. Text is revised a bit to improve readability.
Supplementary information about the research article is appended
|
Nat Commun 12, 3150 (2021)
|
10.1038/s41467-021-23421-4
| null |
physics.optics eess.IV eess.SP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Super-resolution imaging with advanced optical systems has been
revolutionizing technical analysis in various fields from biological to
physical sciences. However, many objects are hidden by strongly scattering
media such as rough wall corners or biological tissues that scramble light
paths, create speckle patterns and hinder object's visualization, let alone
super-resolution imaging. Here, we realize a method to do non-invasive
super-resolution imaging through scattering media based on stochastic optical
scattering localization imaging (SOSLI) technique. Simply by capturing multiple
speckle patterns of photo-switchable emitters in our demonstration, the
stochastic approach utilizes the speckle correlation properties of scattering
media to retrieve an image with more than five-fold resolution enhancement
compared to the diffraction limit, while posing no fundamental limit in
achieving higher spatial resolution. More importantly, we demonstrate our SOSLI
to do non-invasive super-resolution imaging through not only optical diffusers,
i.e. static scattering media, but also biological tissues, i.e. dynamic
scattering media with decorrelation of up to 80%. Our approach paves the way to
non-invasively visualize various samples behind scattering media at
unprecedented levels of detail.
|
[{'version': 'v1', 'created': 'Mon, 10 Jun 2019 07:49:03 GMT'}
{'version': 'v2', 'created': 'Wed, 24 Jul 2019 07:18:11 GMT'}]
|
2021-09-06
|
[array(['Wang', 'Dong', ''], dtype=object)
array(['Sahoo', 'Sujit Kumar', ''], dtype=object)
array(['Dang', 'Cuong', ''], dtype=object)]
|
3,481 |
2210.17485
|
Jian-Hao Zhang
|
Jian-Hao Zhang, Yang Qi, Zhen Bi
|
Strange Correlation Function for Average Symmetry-Protected Topological
Phases
|
10 pages, 5 figures. Comments are welcome!
| null | null | null |
cond-mat.str-el cond-mat.stat-mech quant-ph
|
http://creativecommons.org/licenses/by-nc-nd/4.0/
|
We design a strange correlator for the recently discovered average
symmetry-protected topological (ASPT) phases in $1d$ and $2d$. The strange
correlator has long-range or power-law behavior if the density matrix $\rho$ is
in a nontrivial ASPT phase. In all the $2d$ cases considered here, we find
interesting connections between strange correlators and correlation functions
in $2d$ loop models, based on which we can extract exact scaling exponents of
the strange correlators.
|
[{'version': 'v1', 'created': 'Mon, 31 Oct 2022 17:12:02 GMT'}]
|
2022-11-01
|
[array(['Zhang', 'Jian-Hao', ''], dtype=object)
array(['Qi', 'Yang', ''], dtype=object)
array(['Bi', 'Zhen', ''], dtype=object)]
|
3,482 |
1210.5579
|
Christopher Bowman
|
Christopher Bowman, Maud De Visscher, and Rosa Orellana
|
The partition algebra and the Kronecker coefficients
|
This version contains a uniform description of the Kronecker
coefficients when one of the indexing partitions is a hook or a two-part
partition
| null | null | null |
math.RT math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We propose a new approach to study the Kronecker coefficients by using the
Schur-Weyl duality between the symmetric group and the partition algebra. We
explain the limiting behavior and associated bounds in the context of the
partition algebra. Our analysis leads to a uniform description of the Kronecker
coefficients when one of the indexing partitions is a hook or a two-part
partition.
|
[{'version': 'v1', 'created': 'Sat, 20 Oct 2012 05:44:28 GMT'}
{'version': 'v2', 'created': 'Wed, 24 Oct 2012 09:42:17 GMT'}
{'version': 'v3', 'created': 'Fri, 2 Nov 2012 09:28:06 GMT'}
{'version': 'v4', 'created': 'Wed, 14 Nov 2012 15:26:16 GMT'}
{'version': 'v5', 'created': 'Fri, 30 Nov 2012 13:22:54 GMT'}
{'version': 'v6', 'created': 'Mon, 25 Feb 2013 13:36:19 GMT'}]
|
2013-02-26
|
[array(['Bowman', 'Christopher', ''], dtype=object)
array(['De Visscher', 'Maud', ''], dtype=object)
array(['Orellana', 'Rosa', ''], dtype=object)]
|
3,483 |
2011.14562
|
Jie Xu
|
Jie Xu
|
Solving Yamabe Problem by An Iterative Method
|
This version is incomplete
| null | null | null |
math.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce an iterative scheme to prove the Yamabe problem $ - a\Delta_{g}
u + S u = \lambda u^{p-1} $, firstly on open domain $ (\Omega, g) $ with
Dirichlet boundary conditions, and then on closed manifolds $ (M, g) $ by local
argument. It is a new proof, which solves the Yamabe problem for $ n \geqslant
3 $ in a uniform argument, beyonds the traditional analysis with respect to the
minimization of functionals.
|
[{'version': 'v1', 'created': 'Mon, 30 Nov 2020 05:53:19 GMT'}
{'version': 'v2', 'created': 'Wed, 27 Oct 2021 19:37:10 GMT'}]
|
2021-10-29
|
[array(['Xu', 'Jie', ''], dtype=object)]
|
3,484 |
2108.10832
|
Noemi Frusciante
|
Lu\'is Atayde, Noemi Frusciante
|
Can $f(Q)$ gravity challenge $\Lambda$CDM?
|
5 pages, 1 figure, 2 tables, accepted for publication in PRD
|
Phys.Rev.D 104 (2021) 6, 064052
|
10.1103/PhysRevD.104.064052
| null |
astro-ph.CO gr-qc
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We study observational constraints on the non-metricity $f(Q)$-gravity which
reproduces an exact $\Lambda$CDM background expansion history while modifying
the evolution of linear perturbations. To this purpose we use Cosmic Microwave
Background (CMB) radiation, baryonic acoustic oscillations (BAO),
redshift-space distortions (RSD), supernovae type Ia (SNIa), galaxy clustering
(GC) and weak gravitational lensing (WL) measurements. We set stringent
constraints on the parameter of the model controlling the modifications to the
gravitational interaction at linear perturbation level. We find the model to be
statistically preferred by data over the $\Lambda$CDM according to the $\chi^2$
and deviance information criterion statistics for the combination with CMB,
BAO, RSD and SNIa. This is mostly associated to a better fit to the low-$\ell$
tail of CMB temperature anisotropies.
|
[{'version': 'v1', 'created': 'Tue, 24 Aug 2021 16:30:08 GMT'}
{'version': 'v2', 'created': 'Tue, 28 Sep 2021 09:32:40 GMT'}]
|
2021-09-29
|
[array(['Atayde', 'Luís', ''], dtype=object)
array(['Frusciante', 'Noemi', ''], dtype=object)]
|
3,485 |
1501.06933
|
Dmitry Khlopin
|
Dmitry Khlopin
|
On asymptotic value for dynamic games with saddle point
|
for SIAM CT15
| null | null | null |
math.OC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The paper is concerned with two-person games with saddle point. We
investigate the limits of value functions for long-time-average payoff,
discounted average payoff, and the payoff that follows a probability density.
Most of our assumptions restrict the dynamics of games. In particular, we
assume the closedness of strategies under concatenation. It is also necessary
for the value function to satisfy Bellman's optimality principle, even if in a
weakened, asymptotic sense.
We provide two results. The first one is a uniform Tauber result for games:
if the value functions for long-time-average payoff converge uniformly, then
there exists the uniform limit for probability densities from a sufficiently
broad set; moreover, these limits coincide. The second one is the uniform Abel
result: if a uniform limit for self-similar densities exists, then the uniform
limit for long-time average payoff also exists, and they coincide.
|
[{'version': 'v1', 'created': 'Tue, 27 Jan 2015 21:32:16 GMT'}]
|
2015-01-29
|
[array(['Khlopin', 'Dmitry', ''], dtype=object)]
|
3,486 |
2009.13474
|
Helmut Prodinger
|
Helmut Prodinger
|
On the enumeration of Hoppy's walks
|
A new section has been added with early adventures of Hoppy
| null | null | null |
math.CO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The enumeration of k-Dyck paths ending at level j after m up-steps, where the
last step is an up-step, is given as a sum, improving on a previous formula
given by Deng and Mansour.
|
[{'version': 'v1', 'created': 'Mon, 28 Sep 2020 16:57:43 GMT'}
{'version': 'v2', 'created': 'Mon, 5 Oct 2020 14:16:21 GMT'}
{'version': 'v3', 'created': 'Sun, 18 Oct 2020 15:17:13 GMT'}]
|
2020-10-20
|
[array(['Prodinger', 'Helmut', ''], dtype=object)]
|
3,487 |
2101.04324
|
Huiqiu Lin
|
Yuke Zhang and Huiqiu Lin
|
Perfect matching and distance spectral radius in graphs and bipartite
graphs
| null | null | null | null |
math.CO
|
http://creativecommons.org/licenses/by/4.0/
|
A perfect matching in a graph $G$ is a set of nonadjacent edges covering
every vertex of $G$. Motivated by recent progress on the relations between the
eigenvalues and the matching number of a graph, in this paper, we aim to
present a distance spectral radius condition to guarantee the existence of a
perfect matching. Let $G$ be an $n$-vertex connected graph where $n$ is even
and $\lambda_{1}(D(G))$ be the distance spectral radius of $G$. Then the
following statements are true.
\noindent$\rm{I)}$ If $4\le n\le10$ and ${\lambda }_{1} (D\left(G\right))\le
{\lambda }_{1} (D(S_{n,{\frac{n}{2}}-1}))$, then $G$ contains a perfect
matching unless $G\cong S_{n,{\frac{n}{2}-1}}$ where
$S_{n,{\frac{n}{2}-1}}\cong K_{{\frac{n}{2}-1}}\vee ({\frac{n}{2}+1})K_1$.
\noindent$\rm{II)}$ If $n\ge 12$ and ${\lambda }_{1} (D\left(G\right))\le
{\lambda }_{1} (D(G^*))$, then $G$ contains a perfect matching unless $G\cong
G^*$ where $G^*\cong K_1\vee (K_{n-3}\cup2K_1)$.
Moreover, if $G$ is a connected $2n$-vertex balanced bipartite graph with
$\lambda_{1}(D(G))\le \lambda_{1}(D(B_{n-1,n-2})) $, then $G$ contains a
perfect matching, unless $G\cong B_{n-1,n-2}$ where $B_{n-1,n-2}$ is obtained
from $K_{n,n-2}$ by attaching two pendent vertices to a vertex in the
$n$-vertex part.
|
[{'version': 'v1', 'created': 'Tue, 12 Jan 2021 07:04:43 GMT'}]
|
2021-01-13
|
[array(['Zhang', 'Yuke', ''], dtype=object)
array(['Lin', 'Huiqiu', ''], dtype=object)]
|
3,488 |
2202.04427
|
Jian Zhao
|
Jian Zhao, Yue Zhang, Xunhan Hu, Weixun Wang, Wengang Zhou, Jianye
Hao, Jiangcheng Zhu, Houqiang Li
|
Revisiting QMIX: Discriminative Credit Assignment by Gradient Entropy
Regularization
| null | null | null | null |
cs.AI
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
In cooperative multi-agent systems, agents jointly take actions and receive a
team reward instead of individual rewards. In the absence of individual reward
signals, credit assignment mechanisms are usually introduced to discriminate
the contributions of different agents so as to achieve effective cooperation.
Recently, the value decomposition paradigm has been widely adopted to realize
credit assignment, and QMIX has become the state-of-the-art solution. In this
paper, we revisit QMIX from two aspects. First, we propose a new perspective on
credit assignment measurement and empirically show that QMIX suffers limited
discriminability on the assignment of credits to agents. Second, we propose a
gradient entropy regularization with QMIX to realize a discriminative credit
assignment, thereby improving the overall performance. The experiments
demonstrate that our approach can comparatively improve learning efficiency and
achieve better performance.
|
[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 12:37:55 GMT'}
{'version': 'v2', 'created': 'Wed, 16 Feb 2022 06:24:29 GMT'}]
|
2022-02-17
|
[array(['Zhao', 'Jian', ''], dtype=object)
array(['Zhang', 'Yue', ''], dtype=object)
array(['Hu', 'Xunhan', ''], dtype=object)
array(['Wang', 'Weixun', ''], dtype=object)
array(['Zhou', 'Wengang', ''], dtype=object)
array(['Hao', 'Jianye', ''], dtype=object)
array(['Zhu', 'Jiangcheng', ''], dtype=object)
array(['Li', 'Houqiang', ''], dtype=object)]
|
3,489 |
2202.06745
|
Ian Sellers
|
Christiana Honsberg, Stuart G. Bowden, Ian R. Sellers, Richard R.
King, Stephen M. Goodnick
|
Photovoltaic Surfaces to Reverse Global Warming
| null | null | null | null |
cond-mat.mtrl-sci
|
http://creativecommons.org/licenses/by-nc-sa/4.0/
|
Climate changes and its many associated impacts are one of the most critical
global challenges. Photovoltaics has been instrumental in mitigation of CO$_2$
through the generation of electricity. However, the goal of limiting global
warming to 1.5 $^\circ$C increasingly requires additional approaches. The paper
presents how PV surfaces can be designed to reverse the Earth's radiative
imbalance from increased greenhouse gasses that lead to higher global
temperatures. The new PV surface generate electricity, reflect sub-band gap
radiation, minimize their temperature, generate thermal radiation and emit
additional IR through the atmospheric, with these processes totaling 650
Wm$^{-2}$. This is realized by: (1) PV system efficiency at operating
temperature $>$ 20 \% and sub-band gap reflection of 150 Wm$^{-2}$ for a total
of 350 Wm$^{-2}$ (2) Thermally emitted radiation (radiative cooling) of 150
Wm$^{-2}$; and (3) Active IR emission through an atmospheric window at 1.5
$\mu$ of 150 Wm$^{-2}$. With such PV surfaces, we show that 10 TW of installed
PV can reverse global warming. Using PV to balance global temperatures
introduces additional considerations for PV, focusing on high efficiency,
particularly high efficiency at operating temperatures, radiative cooling, and
new processes for 1.5 $\mu$ emission. We find that depending on their design,
PV panels can increase or decrease global temperatures.
|
[{'version': 'v1', 'created': 'Wed, 9 Feb 2022 21:55:27 GMT'}]
|
2022-02-15
|
[array(['Honsberg', 'Christiana', ''], dtype=object)
array(['Bowden', 'Stuart G.', ''], dtype=object)
array(['Sellers', 'Ian R.', ''], dtype=object)
array(['King', 'Richard R.', ''], dtype=object)
array(['Goodnick', 'Stephen M.', ''], dtype=object)]
|
3,490 |
2111.03080
|
Hesham El Faham
|
Hesham El Faham, Fabio Maltoni, Ken Mimasu, Marco Zaro
|
Single top production in association with a $WZ$ pair at the LHC in the
SMEFT
|
33 pages with tables and figures. v2: minor typos are fixed. v3:
minor typos are fixed, v4: minor typos are fixed, version accepted by JHEP
| null |
10.1007/JHEP01(2022)100
|
CP3-21-62, KCL-PH-TH/2021-86, TIF-UNIMI-2021-19
|
hep-ph
|
http://creativecommons.org/licenses/by/4.0/
|
We study single top quark production in association with a $WZ$ pair at the
LHC in the context of the Standard Model (SM) and the Standard Model Effective
Field Theory (SMEFT). A significant advantage of $tWZ$ compared to other EW top
production processes is its sensitivity to unitarity-violating behaviour
induced in its $2\to2$ sub-amplitudes through modified EW interactions. At NLO
in QCD, $tWZ$ interferes with $t\bar{t}Z$ and $t\bar{t}$ and a method to
meaningfully separate it from these overlapping processes needs to be employed.
In order to define $tWZ$ production for total rates and differential
distributions, we consider the approaches proposed in the literature for
similar cases and find that diagram-removal procedures provide reliable results
both for the SM and the SMEFT in a suitably defined phase-space region. We
provide robust results for total and differential cross sections for $tWZ$ at
13 TeV, including the six relevant dimension-6 operators
($\mathcal{O}_{tW}$,$\mathcal{O}_{tZ}$,$\mathcal{O}_{tG}$,$\mathcal{O}_{\phi
Q}^{(-)}$,$\mathcal{O}_{\phi Q}^{(3)}$,$\mathcal{O}_{\phi t}$), also matching
short-distance events to parton shower.
|
[{'version': 'v1', 'created': 'Thu, 4 Nov 2021 18:00:04 GMT'}
{'version': 'v2', 'created': 'Sat, 25 Dec 2021 19:53:10 GMT'}
{'version': 'v3', 'created': 'Tue, 28 Dec 2021 15:58:48 GMT'}
{'version': 'v4', 'created': 'Mon, 14 Feb 2022 20:07:03 GMT'}]
|
2022-02-16
|
[array(['Faham', 'Hesham El', ''], dtype=object)
array(['Maltoni', 'Fabio', ''], dtype=object)
array(['Mimasu', 'Ken', ''], dtype=object)
array(['Zaro', 'Marco', ''], dtype=object)]
|
3,491 |
math/9901051
|
Jean-Francois Burnol
|
Jean-Francois Burnol
|
Scattering on the p-adic field and a trace formula
|
17 pages, plain TeX. v2 adds the evaluation of a trace considered by
Connes
|
Internat. Math. Res. Notices, 2000 No.2, pp57-70
|
10.1155/S1073792800000040
| null |
math.NT
| null |
I apply the set-up of Lax-Phillips Scattering Theory to a non-archimedean
local field. It is possible to choose the outgoing space and the incoming space
to be Fourier transforms of each other. Key elements of the Lax-Phillips theory
are seen to make sense and to have the expected interrelations: the scattering
matrix S, the projection K to the interacting space, the contraction semi-group
Z and the time delay operator T. The scattering matrix is causal, its analytic
continuation has the expected poles and zeros, and its phase derivative is the
(non-negative) spectral function of T, which is also the restriction to the
diagonal of the kernel of K. The contraction semi-group Z is related to S (and
T) through a trace formula. Introducing an odd-even grading on the interacting
space allows to express the Weil local explicit formula in terms of a
``supertrace''. I also apply my methods to the evaluation of a trace considered
by Connes.
|
[{'version': 'v1', 'created': 'Tue, 12 Jan 1999 22:00:49 GMT'}
{'version': 'v2', 'created': 'Mon, 1 Feb 1999 16:00:04 GMT'}]
|
2007-05-23
|
[array(['Burnol', 'Jean-Francois', ''], dtype=object)]
|
3,492 |
2302.07548
|
Yuji Tachikawa
|
Yuji Tachikawa, Mayuko Yamashita, and Kazuya Yonekura
|
Remarks on mod-2 elliptic genus
|
31 pages
| null | null | null |
hep-th math.AT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For physicists: For supersymmetric quantum mechanics, there are cases when a
mod-2 Witten index can be defined, even when a more ordinary
$\mathbb{Z}$-valued Witten index vanishes. Similarly, for 2d supersymmetric
quantum field theories, there are cases when a mod-2 elliptic genus can be
defined, even when a more ordinary elliptic genus vanishes. We study such mod-2
elliptic genera in the context of $\mathcal{N}=(0,1)$ supersymmetry, and show
that they are characterized by mod-2 reductions of integral modular forms,
under some assumptions.
For mathematicians: We study the image of the standard homomorphism $\pi_n
\mathrm{TMF}\to \pi_n \mathrm{KO}((q))\simeq \mathbb{Z}/2((q))$ for $n=8k+1$ or
$8k+2$, by relating them to the mod-2 reductions of integral modular forms.
|
[{'version': 'v1', 'created': 'Wed, 15 Feb 2023 09:29:46 GMT'}]
|
2023-02-16
|
[array(['Tachikawa', 'Yuji', ''], dtype=object)
array(['Yamashita', 'Mayuko', ''], dtype=object)
array(['Yonekura', 'Kazuya', ''], dtype=object)]
|
3,493 |
2111.03951
|
Pawel Zawislak
|
Pawe{\l} Zawi\'slak
|
The Lehmer factorial norm on $S_{n}$
| null | null | null | null |
math.GR
|
http://creativecommons.org/licenses/by/4.0/
|
We introduce a new family of norms on the permutation groups $S_{n}$. We
examine their properties.
|
[{'version': 'v1', 'created': 'Sat, 6 Nov 2021 19:53:30 GMT'}]
|
2021-11-09
|
[array(['Zawiślak', 'Paweł', ''], dtype=object)]
|
3,494 |
1712.01324
|
Patrick Njionou Sadjang
|
P. Njionou Sadjang
|
On $(p,q)$-Appell Polynomials
|
12 pages
| null | null | null |
math.CA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We introduce polynomial sets of $(p,q)$-Appell type and give some of their
characterizations. The algebraic properties of the set of all polynomial
sequences of $(p,q)$-Appell type are studied. Next, we give a recurrence
relation and a $(p,q)$-difference equation for those polynomials. Finally, some
examples of polynomial sequences of $(p,q)$-Appell type are given,
particularly, a set of $(p,q)$-Hermite polynomials is given and their
three-term recurrence relation and a second order homogeneous
$(p,q)$-difference equation are provided.
|
[{'version': 'v1', 'created': 'Wed, 8 Nov 2017 09:26:54 GMT'}]
|
2017-12-06
|
[array(['Sadjang', 'P. Njionou', ''], dtype=object)]
|
3,495 |
1806.00490
|
Biswajit Karmakar
|
Subhaditya Bhattacharya, Ivo de Medeiros Varzielas, Biswajit Karmakar,
Stephen F. King, Arunansu Sil
|
Dark side of the Seesaw
|
28 pages, 16 figures, matches the version accepted in JHEP
| null |
10.1007/JHEP12(2018)007
| null |
hep-ph
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In an attempt to unfold (if any) a possible connection between two apparently
uncorrelated sectors, namely neutrino and dark matter, we consider the type-I
seesaw and a fermion singlet dark matter to start with. Our construction
suggests that there exists a scalar field mediator between these two sectors
whose vacuum expectation value not only generates the mass of the dark matter,
but also takes part in the neutrino mass generation. While the choice of $Z_4$
symmetry allows us to establish the framework, the vacuum expectation value of
the mediator field breaks $Z_4$ to a remnant $Z_2$, that is responsible to keep
dark matter stable. Therefore, the observed light neutrino masses and relic
abundance constraint on the dark matter, allows us to predict the heavy seesaw
scale as illustrated in this paper.The methodology to connect dark matter and
neutrino sector, as introduced here, is a generic one and can be applied to
other possible neutrino mass generation mechanism and different dark matter
candidate(s).
|
[{'version': 'v1', 'created': 'Fri, 1 Jun 2018 18:00:06 GMT'}
{'version': 'v2', 'created': 'Tue, 4 Dec 2018 10:24:46 GMT'}]
|
2018-12-26
|
[array(['Bhattacharya', 'Subhaditya', ''], dtype=object)
array(['Varzielas', 'Ivo de Medeiros', ''], dtype=object)
array(['Karmakar', 'Biswajit', ''], dtype=object)
array(['King', 'Stephen F.', ''], dtype=object)
array(['Sil', 'Arunansu', ''], dtype=object)]
|
3,496 |
1411.7615
|
Leonardo Tinti
|
Leonardo Tinti
|
New formulation of leading order anisotropic hydrodynamics
|
Talk presented at Hot Quarks 2014, September 21-28, 2014, Las Negras,
Andalucia, Spain
| null |
10.1088/1742-6596/612/1/012061
| null |
hep-ph nucl-th
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Anisotropic hydrodynamics is a reorganization of the relativistic
hydrodynamics expansion, with the leading order already containing substantial
momentum-space anisotropies. The latter are a cause of concern in the
traditional viscous hydrodynamics, since large momentum anisotropies generated
in ultrarelativistic heavy-ion collisions are not consistent with the
hypothesis of small deviations from an isotropic background, i.e., from the
local equilibrium distribution.
We discuss the leading order of the expansion, presenting a new formulation
for the (1+1)--dimensional case, namely, for the longitudinally boost invariant
and cylindrically symmetric flow. This new approach is consistent with the well
established framework of Israel and Stewart in the close to equilibrium limit
(where we expect viscous hydrodynamics to work well). If we consider the
(0+1)--dimensional case, that is, transversally homogeneous and longitudinally
boost invariant flow, {the new form of anisotropic hydrodynamics leads to
better agreement with known solutions} of the Boltzmann equation than the
previous formulations, especially when we consider finite mass particles.
|
[{'version': 'v1', 'created': 'Thu, 27 Nov 2014 14:55:16 GMT'}]
|
2015-06-11
|
[array(['Tinti', 'Leonardo', ''], dtype=object)]
|
3,497 |
1904.03854
|
Motoyuki Ishikado
|
Motoyuki Ishikado, Shin-ichi Shamoto, Katsuaki Kodama, Ryoichi
Kajimoto, Mitsutaka Nakamura, Tao Hong, Hannu Mutka
|
High-energy spin fluctuation in low-$T_{\rm c}$ iron-based
superconductor LaFePO$_{0.9}$
|
9 pages, 4 figures
|
Sci. Rep. 8, 16343 (2018)
|
10.1038/s41598-018-33878-x
|
Published online: 05 November 2018
|
cond-mat.supr-con
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Spin fluctuations are widely believed to play an important role in the
superconducting mechanisms of unconventional high-temperature superconductors.
Spin fluctuations have been observed in iron-based superconductors as well.
However, in some iron-based superconductors such as LaFePO$_{0.9}$, they have
not been observed by inelastic neutron scattering (INS). LaFePO$_{0.9}$ is an
iron-based superconductor with a low superconducting transition temperature
($T_{\rm c}$= 5 K), where line nodes are observed in the superconducting gap
function. The line-node symmetry typically originates from sign reversal of the
order parameter in spin-fluctuation-mediated superconductivity. This
contradiction has been a long-standing mystery of this superconductor. Herein,
spin fluctuations were found at high energies such as 30$-$50 meV with
comparable intensities to an optimally doped LaFeAs(O,F). Based on this
finding, the line-node symmetry can be explained naturally as
spin-fluctuation-mediated superconductivity.
|
[{'version': 'v1', 'created': 'Mon, 8 Apr 2019 06:02:49 GMT'}]
|
2019-04-10
|
[array(['Ishikado', 'Motoyuki', ''], dtype=object)
array(['Shamoto', 'Shin-ichi', ''], dtype=object)
array(['Kodama', 'Katsuaki', ''], dtype=object)
array(['Kajimoto', 'Ryoichi', ''], dtype=object)
array(['Nakamura', 'Mitsutaka', ''], dtype=object)
array(['Hong', 'Tao', ''], dtype=object)
array(['Mutka', 'Hannu', ''], dtype=object)]
|
3,498 |
2012.11555
|
Dario Buttazzo
|
Dario Buttazzo, Roberto Franceschini, Andrea Wulzer
|
Two Paths Towards Precision at a Very High Energy Lepton Collider
|
32 pages, 12 figures, 9 tables
| null |
10.1007/JHEP05(2021)219
|
CERN-TH-2020-216
|
hep-ph hep-ex
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We illustrate the potential of a very high energy lepton collider (from 10 to
30 TeV center of mass energy) to explore new physics indirectly in the vector
boson fusion double Higgs production process and in direct diboson production
at high energy. Double Higgs production is found to be sensitive to the
anomalous Higgs trilinear coupling at the percent level, and to the Higgs
compositeness $\xi$ parameter at the per mille or sub-per mille level thanks to
the measurement of the cross-section in the di-Higgs high invariant mass tail.
High energy diboson (and tri-boson) production is sensitive to Higgs-lepton
contact interaction operators at a scale of several tens or hundred TeV,
corresponding to a reach on the Higgs compositeness scale well above the one of
any other future collider project currently under discussion. This result
follows from the unique capability of the very high energy lepton collider to
measure Electroweak cross-sections at 10 TeV energy or more, where the effect
of new physics at even higher energy is amplified. The general lesson is that
the standard path towards precision physics, based on measurements of
high-statistics processes such as single and double Higgs production, is
accompanied at the very high energy lepton collider by a second strategy based
on measurements at the highest available energy.
|
[{'version': 'v1', 'created': 'Mon, 21 Dec 2020 18:35:40 GMT'}]
|
2023-01-11
|
[array(['Buttazzo', 'Dario', ''], dtype=object)
array(['Franceschini', 'Roberto', ''], dtype=object)
array(['Wulzer', 'Andrea', ''], dtype=object)]
|
3,499 |
2209.08656
|
Vladyslav Melnychuk
|
Vladyslav Melnychuk
|
Probabilistic Population Protocol Models
| null | null | null | null |
cs.DC
|
http://creativecommons.org/licenses/by/4.0/
|
Population protocols are a relatively novel computational model in which very
resource-limited anonymous agents interact in pairs with the goal of computing
predicates. We consider the probabilistic version of this model, which
naturally allows to consider the setup in which a small probability of an
incorrect output is tolerated. The main focus of this thesis is the question of
confident leader election, which is an extension of the regular leader election
problem with an extra requirement for the eventual leader to detect its
uniqueness. Having a confident leader allows the population protocols to
determine the convergence of its computations. This behaviour of the model is
highly beneficial and was shown to be feasible when the original model is
extended in various ways.
We show that it takes a linear in terms of the population size number of
interactions for a probabilistic population protocol to have a non-zero
fraction of agents in all reachable states, starting from a configuration with
all agents in the same state. This leads us to a conclusion that confident
leader election is out of reach even with the probabilistic version of the
model.
|
[{'version': 'v1', 'created': 'Sun, 18 Sep 2022 21:03:36 GMT'}]
|
2022-09-20
|
[array(['Melnychuk', 'Vladyslav', ''], dtype=object)]
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.