Abstract:
  Over-the-air computation (AirComp) has recently been recognized as a
promising scheme for a fusion center to achieve fast distributed data
aggregation in wireless networks via exploiting the superposition property of
multiple-access channels. Since it is challenging to provide reliable data
aggregation for a large number of devices using AirComp, in this paper, we
propose to enable AirComp via the cloud radio access network (Cloud-RAN)
architecture, where a large number of antennas are deployed at separate sites
called remote radio heads (RRHs). However, the potential densification gain
provided by Cloud-RAN is generally bottlenecked by the limited capacity of the
fronthaul links connecting the RRHs and the fusion center. To this end, we
formulate a joint design problem for AirComp transceivers and quantization bits
allocation and propose an efficient algorithm to tackle this problem. Our
numerical results shows the advantages of the proposed architecture compared
with the state-of-the-art solutions.


Abstract:
  This early work aims to allow organizations to diagnose their capacity to
properly adopt microservices through initial milestones of a Microservice
Maturity Model (MiMMo). The objective is to prepare the way towards a general
framework to help companies and industries to determine their microservices
maturity. Organizations lean more and more on distributed web applications and
Line of Business software. This is particularly relevant during the current
Covid-19 crisis, where companies are even more challenged to offer their
services online, targeting a very high level of responsiveness in the face of
rapidly increasing and diverse demands. For this, microservices remain the most
suitable delivery application architectural style. They allow agility not only
on the technical application, as often considered, but on the enterprise
architecture as a whole, influencing the actual financial business of the
company. However, microservices adoption is highly risk-prone and complex.
Before they establish an appropriate migration plan, first and foremost,
companies must assess their degree of readiness to adopt microservices. For
this, MiMMo, a Microservices Maturity Model framework assessment, is proposed
to help companies assess their readiness for the microservice architectural
style, based on their actual situation. MiMMo results from observations of and
experience with about thirty organizations writing software. It conceptualizes
and generalizes the progression paths they have followed to adopt microservices
appropriately. Using the model, an organization can evaluate itself in two
dimensions and five maturity levels and thus: (i) benchmark itself on its
current use of microservices; (ii) project the next steps it needs to achieve a
higher maturity level and (iii) analyze how it has evolved and maintain a
global coherence between technical and business stakes.


Abstract:
  In this paper we study a neighborhood of generic singularities formed by mean
curvature flow (MCF). We limit our consideration to the singularities modelled
on $\mathbb{S}^3\times\mathbb{R}$ because, compared to the cases
$\mathbb{S}^k\times \mathbb{R}^{l}$ with $l\geq 2$, the present case has the
fewest possibilities to be considered. For various possibilities, we provide a
detailed description for a small, but fixed, neighborhood of singularity, and
prove that a small neighborhood of the singularity is mean convex, and the
singularity is isolated. For the remaining possibilities, we conjecture that an
entire neighborhood of the singularity becomes singular at the time of blowup,
and present evidences to support this conjecture. A key technique is that, when
looking for a dominating direction for the rescaled MCF, we need a normal form
transformation, as a result, the rescaled MCF is parametrized over some chosen
curved cylinder, instead over a standard straight one.
  This is a long paper. The introduction is carefully written to present the
key steps and ideas.


Abstract:
  The evidence for benzonitrile (C$_6$H$_5$CN}) in the starless cloud core
TMC-1 makes high-resolution studies of other aromatic nitriles and their
ring-chain derivatives especially timely. One such species is
phenylpropiolonitrile (3-phenyl-2-propynenitrile, C$_6$H$_5$C$_3$N), whose
spectroscopic characterization is reported here for the first time. The low
resolution (0.5 cm$^{-1}$) vibrational spectrum of C$_6$H$_5$C$_3$N} has been
recorded at far- and mid-infrared wavelengths (50 - 3500 cm$^{-1}$) using a
Fourier Transform interferometer, allowing for the assignment of band centers
of 14 fundamental vibrational bands. The pure rotational spectrum of the
species has been investigated using a chirped-pulse Fourier transform microwave
(FTMW) spectrometer (6 - 18 GHz), a cavity enhanced FTMW instrument (6 - 20
GHz), and a millimeter-wave one (75 - 100 GHz, 140 - 214 GHz). Through the
assignment of more than 6200 lines, accurate ground state spectroscopic
constants (rotational, centrifugal distortion up to octics, and nuclear
quadrupole hyperfine constants) have been derived from our measurements, with a
plausible prediction of the weaker bands through calculations. Interstellar
searches for this highly polar species can now be undertaken with confidence
since the astronomically most interesting radio lines have either been measured
or can be calculated to very high accuracy below 300 GHz.


Abstract:
  In this work, the order parameter or average magnetization expressions are
obtained for the square and the honeycomb lattices based on recently obtained
magnetization relation, $<\sigma_{0,i}>=
  <\!\!\tanh[ \kappa(\sigma_{1,i}+\sigma_{2,i}+\dots +\sigma_{z,i})+H]\!\!> $.
Where, $\kappa$ is the coupling strength and $z$ is the number of nearest
neighbors. $\sigma_{0,i}$ denotes the central spin at the $i^{th}$ site while
$\sigma_{l,i}$, $l=1,2,\dots,z$, are the nearest neighbor spins around the
central spin. In our investigation, inevitably we have to make a conjecture
about the three site correlation function appearing in the obtained relation of
this paper. The conjectured form of the the three spin correlation function is
given by the relation,
$<\!\!\sigma_{1}\sigma_{2}\sigma_{3}\!\!>=a<\sigma>+(1-a)<\sigma>^{(1+\beta^{-1})}$,
here $\beta$ denotes the critical exponent for the average magnetization and
$a$ is positive real number less than one. The relevance of this conjecture is
based on fundamental physical reasoning. In addition, it is tested and
investigated by comparing the obtained relations of this paper with the
previously obtained exact results for the square and honeycomb lattices. It is
seen that the agreements of the obtained average magnetization relations with
those of the previously obtained exact results are unprecedentedly perfect.


Abstract:
  We consider a node where packets of fixed size are generated at arbitrary
intervals. The node is required to maintain the peak age of information (AoI)
at the monitor below a threshold by transmitting potentially a subset of the
generated packets. At any time, depending on packet availability and current
AoI, the node can choose the packet to transmit, and its transmission speed. We
consider a power function (rate of energy consumption) that is increasing and
convex in transmission speed, and the objective is to minimize the energy
consumption under the peak AoI constraint at all times. For this problem, we
propose a (customized) greedy policy, and analyze its competitive ratio (CR) by
comparing it against an optimal offline policy by deriving some structural
results. We show that for polynomial power functions, the CR upper bound for
the greedy policy is independent of the system parameters, such as the peak
AoI, packet size, time horizon, or the number of packets generated. Also, we
derive a lower bound on the competitive ratio of any causal policy, and show
that for exponential power functions (e.g., Shannon rate function), the
competitive ratio of any causal policy grows exponentially with increase in the
ratio of packet size to peak AoI.


Abstract:
  By a quasi-connected reductive group (a term of Labesse) over an arbitrary
field we mean an almost direct product of a connected semisimple group and a
quasi-torus (a smooth group of multiplicative type). We show that a linear
algebraic group is quasi-connected reductive if and only if it is isomorphic to
a smooth normal subgroup of a connected reductive group. We compute the first
Galois cohomology set H^1(R,G) of a quasi-connected reductive group G over the
field R of real numbers in terms of a certain action of a subgroup of the Weyl
group on the Galois cohomology of a fundamental quasi-torus of G.


Abstract:
  We evaluate three leading dependency parser systems from different paradigms
on a small yet diverse subset of languages in terms of their
accuracy-efficiency Pareto front. As we are interested in efficiency, we
evaluate core parsers without pretrained language models (as these are
typically huge networks and would constitute most of the compute time) or other
augmentations that can be transversally applied to any of them. Biaffine
parsing emerges as a well-balanced default choice, with sequence-labelling
parsing being preferable if inference speed (but not training energy cost) is
the priority.


Abstract:
  We identify an effective proxy for the analytically-unknown second integral
of motion (I_2) for rotating barred or tri-axial potentials. Planar orbits of a
given energy follow a tight sequence in the space of the time-averaged angular
momentum and its amplitude of fluctuation. The sequence monotonically traces
the main orbital families in the Poincare map, even in the presence of resonant
and chaotic orbits. This behavior allows us to define the "Calibrated Angular
Momentum," the average angular momentum normalized by the amplitude of its
fluctuation, as a numerical proxy for I_2. It also implies that the amplitude
of fluctuation in L_z, previously under-appreciated, contains valuable
information. This new proxy allows one to classify orbital families easily and
accurately, even for real orbits in N-body simulations of barred galaxies. It
is a good diagnostic tool of dynamical systems, and may facilitate the
construction of equilibrium models.


Abstract:
  Vertex connectivity is a well-studied concept in graph theory with numerous
applications. A graph is $k$-connected if it remains connected after removing
any $k-1$ vertices. The vertex connectivity of a graph is the maximum $k$ such
that the graph is $k$-connected. There is a long history of algorithmic
development for efficiently computing vertex connectivity. Recently, two near
linear-time algorithms for small k were introduced by [Forster et al. SODA
2020]. Prior to that, the best known algorithm was one by [Henzinger et al.
FOCS'96] with quadratic running time when k is small.
  In this paper, we study the practical performance of the algorithms by
Forster et al. In addition, we introduce a new heuristic on a key subroutine
called local cut detection, which we call degree counting. We prove that the
new heuristic improves space-efficiency (which can be good for caching
purposes) and allows the subroutine to terminate earlier. According to
experimental results on random graphs with planted vertex cuts, random
hyperbolic graphs, and real world graphs with vertex connectivity between 4 and
15, the degree counting heuristic offers a factor of 2-4 speedup over the
original non-degree counting version for most of our data. It also outperforms
the previous state-of-the-art algorithm by Henzinger et al. even on relatively
small graphs.


Abstract:
  Smart Cities are developing in parallel with the global trend towards
urbanization. The ultimate goal of Smart City projects is to deliver a positive
impact for the citizens and the socio-economic and ecological environment. This
involves the challenge to derive concrete requirements for (technical) projects
from overarching concepts like Quality of Life (QoL) and Subjective Well-Being
(SWB). Linking long-term, impact oriented goals with project outputs and
outcomes is a complex problem. Decision making on requirements and resulting
features of single Smart City projects (or systems) is even more complex since
cities are not like monolithic, hierarchical and well structured systems.
Nevertheless, systems engineering provides concepts which support decision
making in such situations. Complex socio-technical systems such as smart cities
can be characterized as systems of systems (SoS). A SoS is composed of
independently developed systems that nevertheless provide a higher-level
integrated functionality. To add new functionality to a SoS, either existing
systems must be extended or new systems must be developed and integrated. In
both cases, the extension of functionality is usually done in small increments
and structured via software releases. However, the decision which features to
include in the next release is complex and difficult to manage when done
manually. To address this, we make use of the multi-objective next release
problem (MONRP) to search for an optimal set of features for a software release
in a SoS context. In order to refine the search in an early planning phase, we
propose a technique to model and validate the features using the scenario
modeling language for Kotlin (SMLK). This is demonstrated with a
proof-of-concept implementation.


Abstract:
  As a 3D topological insulator, bismuth selenide (Bi2Se3) has potential
applications for electrically and optically controllable magnetic and
optoelectronic devices. How the carriers interact with lattice is important to
understand the coupling with its topological phase. It is essential to measure
with a time scale smaller than picoseconds for initial interaction. Here we use
an X-ray free-electron laser to perform time-resolved diffraction to study
ultrafast carrier-induced lattice contractions and interlayer modulations in
Bi2Se3 thin films. The lattice contraction depends on the carrier concentration
and is followed by an interlayer expansion accompanied by oscillations. Using
density functional theory (DFT) and the Lifshitz model, the initial contraction
can be explained by van der Waals force modulation of the confined free carrier
layers. Band inversion, related to a topological phase transition, is modulated
by the expansion of the interlayer distance. These results provide insight into
instantaneous topological phases on ultrafast timescales.


Abstract:
  We investigate artificial compressibility (AC) techniques for the time
discretization of the incompressible Navier-Stokes equations. The space
discretization is based on a lowest-order face-based scheme supporting
polytopal meshes, namely discrete velocities are attached to the mesh faces and
cells, whereas discrete pressures are attached to the mesh cells. This
face-based scheme can be embedded into the framework of hybrid mixed mimetic
schemes and gradient schemes, and has close links to the lowest-order version
of hybrid high-order methods devised for the steady incompressible
Navier-Stokes equations. The AC timestepping uncouples at each time step the
velocity update from the pressure update. The performances of this approach are
compared against those of the more traditional monolithic approach which
maintains the velocity-pressure coupling at each time step. We consider both
first-order and second-order time schemes and either an implicit or an explicit
treatment of the nonlinear convection term. We investigate numerically the CFL
stability restriction resulting from an explicit treatment, both on Cartesian
and polytopal meshes. Finally, numerical tests on large 3D polytopal meshes
highlight the efficiency of the AC approach and the benefits of using
second-order schemes whenever accurate discrete solutions are to be attained.


Abstract:
  A deluge of recent work has explored equivalences between wide neural
networks and kernel methods. A central theme is that one can analytically find
the kernel corresponding to a given wide network architecture, but despite
major implications for architecture design, no work to date has asked the
converse question: given a kernel, can one find a network that realizes it? We
affirmatively answer this question for fully-connected architectures,
completely characterizing the space of achievable kernels. Furthermore, we give
a surprising constructive proof that any kernel of any wide, deep,
fully-connected net can also be achieved with a network with just one hidden
layer and a specially-designed pointwise activation function. We experimentally
verify our construction and demonstrate that, by just choosing the activation
function, we can design a wide shallow network that mimics the generalization
performance of any wide, deep, fully-connected network.


Abstract:
  Nowadays, developers often reuse existing APIs to implement their programming
tasks. A lot of API usage patterns are mined to help developers learn API usage
rules. However, there are still many missing variables to be synthesized when
developers integrate the patterns into their programming context. To deal with
this issue, we propose a comprehensive approach to integrate API usage patterns
in this paper. We first perform an empirical study by analyzing how API usage
patterns are integrated in real-world projects. We find the expressions for
variable synthesis is often non-trivial and can be divided into 5 syntax types.
Based on the observation, we promote an approach to help developers
interactively complete API usage patterns. Compared to the existing code
completion techniques, our approach can recommend infrequent expressions
accompanied with their real-world usage examples according to the user intent.
The evaluation shows that our approach could assist users to integrate APIs
more efficiently and complete the programming tasks faster than existing works.


Abstract:
  We are interested in martingale rearrangement couplings. As introduced by
Wiesel [37] in order to prove the stability of Martingale Optimal Transport
problems, these are projections in adapted Wasserstein distance of couplings
between two probability measures on the real line in the convex order onto the
set of martingale couplings between these two marginals. In reason of the lack
of relative compactness of the set of couplings with given marginals for the
adapted Wasserstein topology, the existence of such a projection is not clear
at all. Under a barycentre dispersion assumption on the original coupling which
is in particular satisfied by the Hoeffding-Fr\'echet or comonotone coupling,
Wiesel gives a clear algorithmic construction of a martingale rearrangement
when the marginals are finitely supported and then gets rid of the finite
support assumption by relying on a rather messy limiting procedure to overcome
the lack of relative compactness. Here, we give a direct general construction
of a martingale rearrangement coupling under the barycentre dispersion
assumption. This martingale rearrangement is obtained from the original
coupling by an approach similar to the construction we gave in [24] of the
inverse transform martingale coupling, a member of a family of martingale
couplings close to the Hoeffding-Fr\'echet coupling, but for a slightly
different injection in the set of extended couplings introduced by Beiglb\"ock
and Juillet [9] and which involve the uniform distribution on [0, 1] in
addition to the two marginals. We last discuss the stability in adapted
Wassertein distance of the inverse transform martingale coupling with respect
to the marginal distributions.


Abstract:
  Gravitationally lensed extragalactic sources are often subject to statistical
microlensing by stars in the galaxy or cluster lens. Accurate models of the
flux statistics are required for inferring source and lens properties from flux
observations. We derive an accurate semi-analytic approximation for calculating
the mean and variance of the magnification factor, which are applicable to
Gaussian source profiles and arbitrary non-uniform macro lens models, and hence
can save the need to perform expensive numerical simulations. The results are
given as single and double lens-plane integrals with simple, non-oscillatory
integrands, and hence are fast computable using common Monte Carlo integrators.
Employing numerical ray-shooting experiments, we examine the case of a highly
magnified source near a macro fold caustic, and demonstrate the excellent
accuracy of this semi-analytic approximation in the regime of multiple micro
images. Additionally, we point out how the maximum persistent magnification
achievable near a macro caustic is fundamentally limited by the masses and
number density of the foreground microlenses, in addition to the source's
physical size.


Abstract:
  Electrically interfacing atomically thin transition metal dichalcogenide
semiconductors (TMDSCs) with metal leads is challenging because of undesired
interface barriers, which have drastically constrained the electrical
performance of TMDSC devices for exploring their unconventional physical
properties and realizing potential electronic applications. Here we demonstrate
a strategy to achieve nearly barrier-free electrical contacts with few-layer
TMDSCs by engineering interfacial bonding distortion. The carrier-injection
efficiency of such electrical junction is substantially increased with robust
ohmic behaviors from room to cryogenic temperatures. The performance
enhancements of TMDSC field-effect transistors are well reflected by the
ultralow contact resistance (down to 90 Ohm um in MoS2, towards the quantum
limit), the ultrahigh field-effect mobility (up to 358,000 cm2V-1s-1 in WSe2)
and the prominent transport characteristics at cryogenic temperatures. This
method also offers new possibilities of the local manipulation of structures
and electronic properties for TMDSC device design.


Abstract:
  Let $G$ be a non-compact connected semisimple real Lie group with finite
center. Suppose $L$ is a non-compact connected closed subgroup of $G$ acting
transitively on a symmetric space $G/H$ such that $L\cap H$ is compact. We
study the action on $L/L\cap H$ of a Dirac operator $D_{G/H}(E)$ acting on
sections of an $E$-twist of the spin bundle over $G/H$. As a byproduct, in the
case of $(G,H,L)=(SL(2,{\mathbb R})\times SL(2,{\mathbb
R}),\Delta(SL(2,{\mathbb R})\times SL(2,{\mathbb R})),SL(2,{\mathbb R})\times
SO(2))$, we identify certain representations of $L$ which lie in the kernel of
$D_{G/H}(E)$.


Abstract:
  Many real-world systems can be expressed in temporal networks with nodes
playing far different roles in structure and function and edges representing
the relationships between nodes. Identifying critical nodes can help us control
the spread of public opinions or epidemics, predict leading figures in
academia, conduct advertisements for various commodities, and so on. However,
it is rather difficult to identify critical nodes because the network structure
changes over time in temporal networks. In this paper, considering the sequence
topological information of temporal networks, a novel and effective learning
framework based on the combination of special GCNs and RNNs is proposed to
identify nodes with the best spreading ability. The effectiveness of the
approach is evaluated by weighted Susceptible-Infected-Recovered model.
Experimental results on four real-world temporal networks demonstrate that the
proposed method outperforms both traditional and deep learning benchmark
methods in terms of the Kendall $\tau$ coefficient and top $k$ hit rate.


Abstract:
  It has recently been shown that two-loop kite-type diagrams can be computed
analytically in terms of iterated integrals with algebraic kernels. This result
was obtained using a new integral representation for two-loop sunset subgraphs.
In this paper, we have developed a similar representation for a three-loop
banana integral in $d = 2-2\varepsilon$ dimensions. This answer can be
generalized up to any given order in the $\varepsilon$-expansion and can be
calculated numerically both below and above the threshold. We also demonstrate
how this result can be used to compute more complex three-loop integrals
containing the three-loop banana as a subgraph.


Abstract:
  We develop a trust-region method for minimizing the sum of a smooth term $f$
and a nonsmooth term $h$), both of which can be nonconvex. Each iteration of
our method minimizes a possibly nonconvex model of $f + h$ in a trust region.
The model coincides with $f + h$ in value and subdifferential at the center. We
establish global convergence to a first-order stationary point when $f$
satisfies a smoothness condition that holds, in particular, when it has
Lipschitz-continuous gradient, and $h$ is proper and lower semi-continuous. The
model of $h$ is required to be proper, lower-semi-continuous and prox-bounded.
Under these weak assumptions, we establish a worst-case $O(1/\epsilon^2)$
iteration complexity bound that matches the best known complexity bound of
standard trust-region methods for smooth optimization. We detail a special
instance, named TR-PG, in which we use a limited-memory quasi-Newton model of
$f$ and compute a step with the proximal gradient method, resulting in a
practical proximal quasi-Newton method. We establish similar convergence
properties and complexity bound for a quadratic regularization variant, named
R2, and provide an interpretation as a proximal gradient method with adaptive
step size for nonconvex problems. R2 may also be used to compute steps inside
the trust-region method, resulting in an implementation named TR-R2. We
describe our Julia implementations and report numerical results on inverse
problems from sparse optimization and signal processing. Both TR-PG and TR-R2
exhibit promising performance and compare favorably with two linesearch
proximal quasi-Newton methods based on convex models.


Abstract:
  Coronavirus disease 2019 (COVID-19) is a Public Health Emergency of
International Concern infecting more than 40 million people across 188
countries and territories. Chest computed tomography (CT) imaging technique
benefits from its high diagnostic accuracy and robustness, it has become an
indispensable way for COVID-19 mass testing. Recently, deep learning approaches
have become an effective tool for automatic screening of medical images, and it
is also being considered for COVID-19 diagnosis. However, the high infection
risk involved with COVID-19 leads to relative sparseness of collected labeled
data limiting the performance of such methodologies. Moreover, accurately
labeling CT images require expertise of radiologists making the process
expensive and time-consuming. In order to tackle the above issues, we propose a
supervised domain adaption based COVID-19 CT diagnostic method which can
perform effectively when only a small samples of labeled CT scans are
available. To compensate for the sparseness of labeled data, the proposed
method utilizes a large amount of synthetic COVID-19 CT images and adjusts the
networks from the source domain (synthetic data) to the target domain (real
data) with a cross-domain training mechanism. Experimental results show that
the proposed method achieves state-of-the-art performance on few-shot COVID-19
CT imaging based diagnostic tasks.


Abstract:
  We provide moment bounds for expressions of the type $(X^{(1)} \otimes \dots
\otimes X^{(d)})^T A (X^{(1)} \otimes \dots \otimes X^{(d)})$ where $\otimes$
denotes the Kronecker product and $X^{(1)}, \dots, X^{(d)}$ are random vectors
with independent, mean 0, variance 1, subgaussian entries. The bounds are tight
up to constants depending on $d$ for the case of Gaussian random vectors. Our
proof also provides a decoupling inequality for expressions of this type. Using
these bounds, we obtain new, improved concentration inequalities for
expressions of the form $\|B (X^{(1)} \otimes \dots \otimes X^{(d)})\|_2$.


Abstract:
  This paper argues that continual learning methods can benefit by splitting
the capacity of the learner across multiple models. We use statistical learning
theory and experimental analysis to show how multiple tasks can interact with
each other in a non-trivial fashion when a single model is trained on them. The
generalization error on a particular task can improve when it is trained with
synergistic tasks, but can also deteriorate when trained with competing tasks.
This theory motivates our method named Model Zoo which, inspired from the
boosting literature, grows an ensemble of small models, each of which is
trained during one episode of continual learning. We demonstrate that Model Zoo
obtains large gains in accuracy on a variety of continual learning benchmark
problems.


Abstract:
  Pretrained language models are now of widespread use in Natural Language
Processing. Despite their success, applying them to Low Resource languages is
still a huge challenge. Although Multilingual models hold great promise,
applying them to specific low-resource languages e.g. Roman Urdu can be
excessive. In this paper, we show how the code-switching property of languages
may be used to perform cross-lingual transfer learning from a corresponding
high resource language. We also show how this transfer learning technique
termed Bilingual Language Modeling can be used to produce better performing
models for Roman Urdu. To enable training and experimentation, we also present
a collection of novel corpora for Roman Urdu extracted from various sources and
social networking sites, e.g. Twitter. We train Monolingual, Multilingual, and
Bilingual models of Roman Urdu - the proposed bilingual model achieves 23%
accuracy compared to the 2% and 11% of the monolingual and multilingual models
respectively in the Masked Language Modeling (MLM) task.


Abstract:
  With the consolidation of deep learning in drug discovery, several novel
algorithms for learning molecular representations have been proposed. Despite
the interest of the community in developing new methods for learning molecular
embeddings and their theoretical benefits, comparing molecular embeddings with
each other and with traditional representations is not straightforward, which
in turn hinders the process of choosing a suitable representation for QSAR
modeling. A reason behind this issue is the difficulty of conducting a fair and
thorough comparison of the different existing embedding approaches, which
requires numerous experiments on various datasets and training scenarios. To
close this gap, we reviewed the literature on methods for molecular embeddings
and reproduced three unsupervised and two supervised molecular embedding
techniques recently proposed in the literature. We compared these five methods
concerning their performance in QSAR scenarios using different classification
and regression datasets. We also compared these representations to traditional
molecular representations, namely molecular descriptors and fingerprints. As
opposed to the expected outcome, our experimental setup consisting of over
25,000 trained models and statistical tests revealed that the predictive
performance using molecular embeddings did not significantly surpass that of
traditional representations. While supervised embeddings yielded competitive
results compared to those using traditional molecular representations,
unsupervised embeddings tended to perform worse than traditional
representations. Our results highlight the need for conducting a careful
comparison and analysis of the different embedding techniques prior to using
them in drug design tasks, and motivate a discussion about the potential of
molecular embeddings in computer-aided drug design.


Abstract:
  We employ neural networks for classification of data of the TUS fluorescence
telescope, the world's first orbital detector of ultra-high energy cosmic rays.
We focus on two particular types of signals in the TUS data: track-like flashes
produced by cosmic ray hits of the photodetector and flashes that originated
from distant lightnings. We demonstrate that even simple neural networks
combined with certain conventional methods of data analysis can be highly
effective in tasks of classification of data of fluorescence telescopes.


Abstract:
  The performance of natural language generation systems has improved
substantially with modern neural networks. At test time they typically employ
beam search to avoid locally optimal but globally suboptimal predictions.
However, due to model errors, a larger beam size can lead to deteriorating
performance according to the evaluation metric. For this reason, it is common
to rerank the output of beam search, but this relies on beam search to produce
a good set of hypotheses, which limits the potential gains. Other alternatives
to beam search require changes to the training of the model, which restricts
their applicability compared to beam search. This paper proposes incremental
beam manipulation, i.e. reranking the hypotheses in the beam during decoding
instead of only at the end. This way, hypotheses that are unlikely to lead to a
good final output are discarded, and in their place hypotheses that would have
been ignored will be considered instead. Applying incremental beam manipulation
leads to an improvement of 1.93 and 5.82 BLEU points over vanilla beam search
for the test sets of the E2E and WebNLG challenges respectively. The proposed
method also outperformed a strong reranker by 1.04 BLEU points on the E2E
challenge, while being on par with it on the WebNLG dataset.


Abstract:
  We consider the problem of soft scattering for the analogue of pion states in
gauge-fermion theories which approach a conformal fixed point in the infrared
limit. Introducing a fermion mass into such a theory will explicitly break both
scale invariance and chiral symmetry, leading to confinement and a spectrum of
bound states. We argue that in such a theory, the pion scattering length
diverges in the limit of zero fermion mass, in sharp contrast to QCD-like
theories where the chiral Lagrangian predicts a vanishing scattering length. We
demonstrate this effect both with a simple dimensional argument, and in a
generalized linear sigma model which we argue can be used to describe the
interactions of light scalar and pseudoscalar bound states in the soft limit of
a mass-deformed infrared-conformal theory. As a result, lattice calculations of
pion scattering lengths could be a sensitive probe for infrared scale
invariance in gauge-fermion theories.


Abstract:
  Context: Interest in software engineering (SE) methodologies and tools has
been complemented in recent years by research efforts oriented towards
understanding the human processes involved in software development. This shift
has been imperative given reports of inadequately performing teams and the
consequent growing emphasis on individuals and team relations in contemporary
SE methods. Objective: While software repositories have frequently been studied
with a view to explaining such human processes, research has tended to use
primarily quantitative analysis approaches. There is concern, however, that
such approaches can provide only a partial picture of the software process.
Given the way human behavior is nuanced within psychological and social
contexts, it has been asserted that a full understanding may only be achieved
through deeper contextual enquiries. Method: We have followed such an approach
and have applied data mining, SNA, psycholinguistic analysis and directed
content analysis (CA) to study the way core developers at IBM Rational Jazz
contribute their social and intellectual capital, and have compared the
attitudes, interactions and activities of these members to those of their less
active counterparts. Results: Among our results, we uncovered that Jazz's core
developers worked across multiple roles, and were crucial to their teams'
organizational, intra-personal and inter-personal processes. Additionally,
although these individuals were highly task- and achievement-focused, they were
also largely responsible for maintaining positive team atmosphere, and for
providing context awareness in support of their colleagues. Conclusion: Our
results suggest that high-performing distributed agile teams rely on both
individual and collective efforts, as well as organizational environments that
promote informal and organic work structures.(Abridged)


Abstract:
  Thanks to missions like Kepler and TESS, we now have access to tens of
thousands of high precision, fast cadence, and long baseline stellar
photometric observations. In principle, these light curves encode a vast amount
of information about stellar variability and, in particular, about the
distribution of starspots and other features on their surfaces. Unfortunately,
the problem of inferring stellar surface properties from a rotational light
curve is famously ill-posed, as it often does not admit a unique solution.
Inference about the number, size, contrast, and location of spots can therefore
depend very strongly on the assumptions of the model, the regularization
scheme, or the prior. The goal of this paper is twofold: (1) to explore the
various degeneracies affecting the stellar light curve "inversion" problem and
their effect on what can and cannot be learned from a stellar surface given
unresolved photometric measurements; and (2) to motivate ensemble analyses of
the light curves of many stars at once as a powerful data-driven alternative to
common priors adopted in the literature. We further derive novel results on the
dependence of the null space on stellar inclination and limb darkening and show
that single-band photometric measurements cannot uniquely constrain quantities
like the total spot coverage without the use of strong priors. This is the
first in a series of papers devoted to the development of novel algorithms and
tools for the analysis of stellar light curves and spectral time series, with
the explicit goal of enabling statistically robust inference about their
surface properties.


Abstract:
  Graph representation of structured data can facilitate the extraction of
stereoscopic features, and it has demonstrated excellent ability when working
with deep learning systems, the so-called Graph Neural Networks (GNNs).
Choosing a promising architecture for constructing GNNs can be transferred to a
hyperparameter optimisation problem, a very challenging task due to the size of
the underlying search space and high computational cost for evaluating
candidate GNNs. To address this issue, this research presents a novel genetic
algorithm with a hierarchical evaluation strategy (HESGA), which combines the
full evaluation of GNNs with a fast evaluation approach. By using full
evaluation, a GNN is represented by a set of hyperparameter values and trained
on a specified dataset, and root mean square error (RMSE) will be used to
measure the quality of the GNN represented by the set of hyperparameter values
(for regression problems). While in the proposed fast evaluation process, the
training will be interrupted at an early stage, the difference of RMSE values
between the starting and interrupted epochs will be used as a fast score, which
implies the potential of the GNN being considered. To coordinate both types of
evaluations, the proposed hierarchical strategy uses the fast evaluation in a
lower level for recommending candidates to a higher level, where the full
evaluation will act as a final assessor to maintain a group of elite
individuals. To validate the effectiveness of HESGA, we apply it to optimise
two types of deep graph neural networks. The experimental results on three
benchmark datasets demonstrate its advantages compared to Bayesian
hyperparameter optimization.


Abstract:
  Building on the success of the ADReSS Challenge at Interspeech 2020, which
attracted the participation of 34 teams from across the world, the ADReSSo
Challenge targets three difficult automatic prediction problems of societal and
medical relevance, namely: detection of Alzheimer's Dementia, inference of
cognitive testing scores, and prediction of cognitive decline. This paper
presents these prediction tasks in detail, describes the datasets used, and
reports the results of the baseline classification and regression models we
developed for each task. A combination of acoustic and linguistic features
extracted directly from audio recordings, without human intervention, yielded a
baseline accuracy of 78.87% for the AD classification task, an MMSE prediction
root mean squared (RMSE) error of 5.28, and 68.75% accuracy for the cognitive
decline prediction task.


Abstract:
  A solution is proposed to a longstanding open problem in kinetic theory,
namely, given any set of realizable velocity moments up to order 2n, a closure
for the moment of order 2n+1 is constructed for which the moment system found
from the free-transport term in the one-dimensional (1-D) kinetic equation is
globally hyperbolic and in conservative form. In prior work, the hyperbolic
quadrature method of moments (HyQMOM) was introduced to close this moment
system up to fourth order (n $\le$ 2). Here, HyQMOM is reformulated and
extended to arbitrary even-order moments. The HyQMOM closure is defined based
on the properties of the monic orthogonal polynomials Qn that are uniquely
defined by the velocity moments up to order 2n -- 1. Thus, HyQMOM is strictly a
moment closure and does not rely on the reconstruction of a velocity
distribution function with the same moments. On the boundary of moment space, n
double roots of the characteristic polynomial P2n+1 are the roots of Qn, while
in the interior, P 2n+1 and Qn share n roots. The remaining n + 1 roots of
P2n+1 bound and separate the roots of Qn. An efficient algorithm, based on the
Chebyshev algorithm, for computing the moment of order 2n + 1 from the moments
up to order 2n is developed. The analytical solution to a 1-D Riemann problem
is used to demonstrate convergence of the HyQMOM closure with increasing n.


Abstract:
  Renormalisation group (RG) methods provide one of the most important
techniques for analysing the physics of many-body systems, both analytically
and numerically. By iterating an RG map, which "course-grains" the description
of a many-body system and generates a flow in the parameter space, physical
properties of interest can be extracted even for complex models. RG analysis
also provides an explanation of physical phenomena such as universality. Many
systems exhibit simple RG flows, but more complicated -- even chaotic --
behaviour is also known. Nonetheless, the structure of such RG flows can still
be analysed, elucidating the physics of the system, even if specific
trajectories may be highly sensitive to the initial point. In contrast, recent
work has shown that important physical properties of quantum many-body systems,
such as its spectral gap and phase diagram, can be uncomputable.
  In this work, we show that such undecidable systems exhibit a novel type of
RG flow, revealing a qualitatively different and more extreme form of
unpredictability than chaotic RG flows. In contrast to chaotic RG flows in
which initially close points can diverge exponentially, trajectories under
these novel uncomputable RG flows can remain arbitrarily close together for an
uncomputable number of iterations, before abruptly diverging to different fixed
points that are in separate phases. The structure of such uncomputable RG flows
is so complex that it cannot be computed or approximated, even in principle. We
give a mathematically rigorous construction of the block-renormalisation-group
map for the original undecidable many-body system that appeared in the
literature (Cubitt, P\'erez-Garcia, Wolf, Nature 528, 207-211 (2015)). We prove
that each step of this RG map is computable, and that it converges to the
correct fixed points, yet the resulting RG flow is uncomputable.


Abstract:
  This article studies estimation of a stationary autocovariance structure in
the presence of an unknown number of mean shifts. Here, a Yule-Walker moment
estimator for the autoregressive parameters in a dependent time series
contaminated by mean shift changepoints is proposed and studied. The estimator
is based on first order differences of the series and is proven consistent and
asymptotically normal when the number of changepoints $m$ and the series length
$N$ satisfies $m/N \rightarrow 0$ as $N \rightarrow \infty$


Abstract:
  The quality of controlling a system of optical cavities in the
Tavis-Cummings-Hubbard (TCH) model is estimated with the examples of quantum
gates, quantum walks on graphs, and of the detection of singlet states. This
type of control of complex systems is important for quantum computing, for the
optical interpretation of mechanical movements, and for quantum cryptography,
where singlet states of photons and charges play an essential role. It has been
found that the main reason for the decrease of the control quality in the THC
model is due to the finite width of the atomic spectral lines, which is itself
related to the time energy uncertainty relation. This paper evaluates the
quality of a CSign-type quantum gate based on asynchronous atomic excitations
and on the optical interpretation of the motion of a free particle.


Abstract:
  It is important to calculate and analyze temperature and humidity prediction
accuracies among quantitative meteorological forecasting. This study
manipulates the extant neural network methods to foster the predictive
accuracy. To achieve such tasks, we analyze and explore the predictive accuracy
and performance in the neural networks using two combined meteorological
factors (temperature and humidity). Simulated studies are performed by applying
the artificial neural network (ANN), deep neural network (DNN), extreme
learning machine (ELM), long short-term memory (LSTM), and long short-term
memory with peephole connections (LSTM-PC) machine learning methods, and the
accurate prediction value are compared to that obtained from each other
methods. Data are extracted from low frequency time-series of ten metropolitan
cities of South Korea from March 2014 to February 2020 to validate our
observations. To test the robustness of methods, the error of LSTM is found to
outperform that of the other four methods in predictive accuracy. Particularly,
as testing results, the temperature prediction of LSTM in summer in Tongyeong
has a root mean squared error (RMSE) value of 0.866 lower than that of other
neural network methods, while the mean absolute percentage error (MAPE) value
of LSTM for humidity prediction is 5.525 in summer in Mokpo, significantly
better than other metropolitan cities.


Abstract:
  The nonequilibrium dynamics of vortices in 2D quantum fluids can be predicted
by accounting for the way in which vortex ellipticity is coupled to the
gradient in background fluid density. In the absence of nonlinear interactions,
a harmonically trapped fluid can be analyzed analytically to show that single
vortices will move in an elliptic trajectory that has the same orientation and
aspect ratio as the vortex projection itself. This allows the vortex
ellipticity to be estimated through observation of its trajectory. A
combination of analysis and numerical simulation is then used to show that
nonlinear interactions cause the vortex orientation to precess, and that the
rate of vortex precession is once again mimicked by a precession of the
elliptical trajectory. Both vortex ellipticity and rate of precession can
therefore be inferred by observing its motion in a trap. An ability to
anticipate and control local vortex structure and vortex trajectory is expected
to prove useful in designing few-vortex systems in which ellipticity is a
ubiquitous, as-yet-unharnessed feature.


Abstract:
  Identifying the mutations that drive cancer growth is key in clinical
decision making and precision oncology. As driver mutations confer selective
advantage and thus have an increased likelihood of occurrence, frequency-based
statistical models are currently favoured. These methods are not suited to
rare, low frequency, driver mutations. The alternative approach to address this
is through functional-impact scores, however methods using this approach are
highly prone to false positives. In this paper, we propose a novel combination
method for driver mutation identification, which uses the power of both
statistical modelling and functional-impact based methods. Initial results show
this approach outperforms the state-of-the-art methods in terms of precision,
and provides comparable performance in terms of area under receiver operating
characteristic curves (AU-ROC). We believe that data-driven systems based on
machine learning, such as these, will become an integral part of precision
oncology in the near future.


Abstract:
  Considering a non-centrosymmetric, non-magnetic double Weyl semimetal (WSM)
SrSi$_2$, we investigate the electron and hole pockets in bulk Fermi surface
behavior that enables us to characterize the material as a type-I WSM. We study
the structural handedness of the material and correlate it with the distinct
surface Fermi surface at two opposite surfaces following an energy evolution.
The Fermi arc singlet becomes doublet with the onset of spin orbit coupling
that is in accordance with the topological charge of the Weyl Nodes (WNs). A
finite energy separation between WNs of opposite chirality in SrSi$_2$ allows
us to compute circular photogalvanic effect (CPGE). Followed by the three band
formula, we show that CPGE is only quantized for Fermi level chosen in the
vicinity of WN residing at higher value of energy. Surprisingly, for the other
WN of opposite chirality in the lower value of energy, CPGE is not found to be
quantized. Such a behavior of CPGE is in complete contrast to the time reversal
breaking WSM where CPGE is quantized to two opposite plateau depending on the
topological charge of the activated WN. We further analyze our finding by
examining the momentum resolved CPGE. Finally we show that two band formula for
CPGE is not able to capture the quantization that is apprehended by the three
band formula.


Abstract:
  In this article a surprising result is demonstrated using the neural tangent
kernel. This kernel is defined as the inner product of the vector of the
gradient of an underlying model evaluated at training points. This kernel is
used to perform kernel regression. The surprising thing is that the accuracy of
that regression is independent of the accuracy of the underlying network.


Abstract:
  Theoretical models show that the power of relativistic jets of active
galactic nuclei depends on the spin and mass of the central supermassive black
holes, as well as the accretion. Here we report an analysis of archival
observations of a sample of blazars. We find a significant correlation between
jet kinetic power and the spin of supermassive black holes. At the same time,
we use multiple linear regression to analyze the relationship between jet
kinetic power and accretion, spin and black hole mass. We find that the spin of
supermassive black holes and accretion are the most important contribution to
the jet kinetic power. The contribution rates of both the spin of supermassive
black holes and accretion are more than 95\%. These results suggest that the
spin energy of supermassive black holes powers the relativistic jets. The jet
production efficiency of almost all Fermi blazars can be explained by
moderately thin magnetically arrested accretion disks around rapidly spinning
black holes.


Abstract:
  By viewing $\tilde{A}$ and $\tilde{D}$ type cluster algebras as triangulated
surfaces, we find all cluster variables in terms of either (i) the frieze
pattern (or bipartite belt) or (ii) the periodic quantities previously found
for the cluster map associated with these frieze patterns. We show that these
cluster variables form friezes which are precisely the ones found in [1] by
applying the cluster character to the associated cluster category.


Abstract:
  The representation of ground states of fermionic quantum impurity problems as
superpositions of Gaussian states has recently been given a rigorous
mathematical foundation. [S. Bravyi and D. Gosset, Comm. Math. Phys. 356, 451
(2017)]. It is natural to ask how many parameters are required for an efficient
variational scheme based on this representation. An upper bound is $\mathcal
O(N^2)$, where $N$ is the system size, which corresponds to the number
parameters needed to specify an arbitrary Gaussian state. We provide an
alternative representation, with more favorable scaling, only requiring
$\mathcal O(N)$ parameters, that we illustrate for the interacting resonant
level model. We achieve the reduction by associating mean-field-like parent
Hamiltonians with the individual terms in the superposition, using physical
insight to retain only the most relevant channels in each parent Hamiltonian.
We benchmark our variational ansatz against the Numerical Renormalization
Group, and compare our results to existing variational schemes of a similar
nature to ours. Apart from the ground state energy, we also study the spectrum
of the correlation matrix -- a very stringent measure of accuracy. Our approach
outperforms some existing schemes and remains quantitatively accurate in the
numerically challenging near-critical regime.


Abstract:
  In this manuscript we show that the metric mean dimension of a free semigroup
action satisfies three variational principles: (a) the first one is based on a
definition of Shapira's entropy, introduced in \cite{SH} for a singles dynamics
and extended for a semigroup action in this note; (b) the second one treats
about a definition of Katok's entropy for a free semigroup action introduced in
\cite{CRV-IV}; (c) lastly we consider the local entropy function for a free
semigroup action and show that the metric mean dimension satisfies a
variational principle in terms of such function. Our results are inspired in
the ones obtained by \cite{LT2019}, \cite{VV}, \cite{GS1} and \cite{RX}.


Abstract:
  Machine learning is a modern approach to problem-solving and task automation.
In particular, machine learning is concerned with the development and
applications of algorithms that can recognize patterns in data and use them for
predictive modeling. Artificial neural networks are a particular class of
machine learning algorithms and models that evolved into what is now described
as deep learning. Given the computational advances made in the last decade,
deep learning can now be applied to massive data sets and in innumerable
contexts. Therefore, deep learning has become its own subfield of machine
learning. In the context of biological research, it has been increasingly used
to derive novel insights from high-dimensional biological data. To make the
biological applications of deep learning more accessible to scientists who have
some experience with machine learning, we solicited input from a community of
researchers with varied biological and deep learning interests. These
individuals collaboratively contributed to this manuscript's writing using the
GitHub version control platform and the Manubot manuscript generation toolset.
The goal was to articulate a practical, accessible, and concise set of
guidelines and suggestions to follow when using deep learning. In the course of
our discussions, several themes became clear: the importance of understanding
and applying machine learning fundamentals as a baseline for utilizing deep
learning, the necessity for extensive model comparisons with careful
evaluation, and the need for critical thought in interpreting results generated
by deep learning, among others.


Abstract:
  We study the barotropic compressible Navier-Stokes equations with Navier-type
boundary condition in a two-dimensional simply connected bounded domain with
$C^{\infty}$ boundary $\partial\Omega.$ By some new estimates on the boundary
related to the Navier-type slip boundary condition, the classical solution to
the initial-boundary-value problem of this system exists globally in time
provided the initial energy is suitably small even if the density has large
oscillations and contains vacuum states. Futhermore, we also prove that the
oscillation of the density will grow unboundedly in the long run with an
exponential rate provided vacuum (even a point) appears initially. As we known,
this is the first result concerning the global existence of classical solutions
to the compressible Navier-Stokes equations with Navier-type slip boundary
condition and the density containing vacuum initially for general 2D bounded
smooth domains.


Abstract:
  Community detection is a key task to further understand the function and the
structure of complex networks. Therefore, a strategy used to assess this task
must be able to avoid biased and incorrect results that might invalidate
further analyses or applications that rely on such communities. Two widely used
strategies to assess this task are generally known as structural and
functional. The structural strategy basically consists in detecting and
assessing such communities by using multiple methods and structural metrics. On
the other hand, the functional strategy might be used when ground truth data
are available to assess the detected communities. However, the evaluation of
communities based on such strategies is usually done in experimental
configurations that are largely susceptible to biases, a situation that is
inherent to algorithms, metrics and network data used in this task.
Furthermore, such strategies are not systematically combined in a way that
allows for the identification and mitigation of bias in the algorithms, metrics
or network data to converge into more consistent results. In this context, the
main contribution of this article is an approach that supports a robust quality
evaluation when detecting communities in real-world networks. In our approach,
we measure the quality of a community by applying the structural and functional
strategies, and the combination of both, to obtain different pieces of
evidence. Then, we consider the divergences and the consensus among the pieces
of evidence to identify and overcome possible sources of bias in community
detection algorithms, evaluation metrics, and network data. Experiments
conducted with several real and synthetic networks provided results that show
the effectiveness of our approach to obtain more consistent conclusions about
the quality of the detected communities.


Abstract:
  In this note, we consider the complexity of maintaining the longest
increasing subsequence (LIS) of an array under (i) inserting an element, and
(ii) deleting an element of an array. We show that no algorithm can support
queries and updates in time $\mathcal{O}(n^{1/2-\epsilon})$ and
$\mathcal{O}(n^{1/3-\epsilon})$ for the dynamic LIS problem, for any constant
$\epsilon>0$, when the elements are weighted or the algorithm supports
1D-queries (on subarrays), respectively, assuming the All-Pairs Shortest Paths
(APSP) conjecture or the Online Boolean Matrix-Vector Multiplication (OMv)
conjecture. The main idea in our construction comes from the work of Abboud and
Dahlgaard [FOCS 2016], who proved conditional lower bounds for dynamic planar
graph algorithm. However, this needs to be appropriately adjusted and
translated to obtain an instance of the dynamic LIS problem.


Abstract:
  We present a high-resolution (R=140,000) spectrum of the bright quasar
HE0001-2340 (z=2.26), obtained with ESPRESSO at the Very Large Telescope. We
analyse three systems at z=0.45, z=1.65, and z=2.19 using multiple-component
Voigt-profile fitting. We also compare our spectrum with those obtained with
VLT/UVES, covering a total period of 17 years. We disentangle turbulent and
thermal broadening in many components spread over about 400 km/s in the z~2.19
sub-DLA system. We derive an average temperature of 16000+/-1300 K, i.e., about
twice the canonical value of the warm neutral medium in the Galactic
interstellar medium. A comparison with other high-z, low-metallicity absorbers
reveals an anti-correlation between gas temperature and total HI column
density. Although requiring confirmation, this could be the first observational
evidence of a thermal decrease with galacto-centric distance, i.e., we may be
witnessing a thermal transition between the circum-galactic medium and the
cooler ISM. We revisit the Mg isotopic ratios at z=0.45 and z=1.65 and
constrain them to be xi = (26Mg+25Mg)/24Mg <0.6 and <1.4 in these two systems,
respectively. These values are consistent with the standard Solar ratio, i.e.,
we do not confirm strong enhancement of heavy isotopes previously inferred from
UVES data. Finally, we confirm the partial coverage of the quasar emission-line
region by a FeI-bearing cloud in the z=0.45 system and present evidence for
velocity sub-structure of the gas that has Doppler parameters of the order of
only ~0.3 km/s. This work demonstrates the uniqueness of high-fidelity,
high-resolution optical spectrographs on large telescopes as tools to
investigate the thermal state of the gas in and around galaxies as well as its
spatial and velocity structure on small scales, and to constrain the associated
stellar nucleosynthetic history. [abridged]


Abstract:
  The anomalous dimensions for the interpolating currents of baryons are
indispensable inputs in a serious analysis of baryon QCD sum rules. However,
the results in the literature are vague. In view of this, in this work, we
investigate the one-loop anomalous dimensions for some interpolating currents
such as those of $\Lambda_{Q}$ and proton. This work has more significance in
pedagogy.


Abstract:
  Four adaptations of the smoothed aggregation algebraic multigrid (SA-AMG)
method are proposed with an eye towards improving the convergence and
robustness of the solver in situations when the discretization matrix contains
many weak connections. These weak connections can cause higher than expected
levels of fill-in within the coarse discretization matrices and can also give
rise to sub-optimal smoothing within the prolongator smoothing phase. These
smoothing drawbacks are due to the relatively small size of some diagonal
entries within the filtered matrix that one obtains after dropping the weak
connections. The new algorithms consider modifications to the Jacobi-like step
that defines the prolongator smoother, modifications to the filtered matrix,
and also direct modifications to the resulting grid transfer operators.
Numerical results are given illustrating the potential benefits of the proposed
adaptations.


Abstract:
  Materials with strong magnetoresistive responses are the backbone of
spintronic technology, magnetic sensors, and hard drives. Among them, manganese
oxides with a mixed valence and a cubic perovskite structure stand out due to
their colossal magnetoresistance (CMR). A double exchange interaction underlies
the CMR in manganates, whereby charge transport is enhanced when the spins on
neighboring Mn3+ and Mn4+ ions are parallel. Prior efforts to find different
materials or mechanisms for CMR resulted in a much smaller effect. Here we show
an enormous CMR at low temperatures in EuCd2P2 without manganese, oxygen, mixed
valence, or cubic perovskite structure. EuCd2P2 has a layered trigonal lattice
and exhibits antiferromagnetic ordering at 11 K. The magnitude of CMR (104
percent) in as-grown crystals of EuCd2P2 rivals the magnitude in optimized thin
films of manganates. Our magnetization, transport, and synchrotron X-ray data
suggest that strong magnetic fluctuations are responsible for this phenomenon.
The realization of CMR at low temperatures without heterovalency leads to a new
regime for materials and technologies related to antiferromagnetic spintronics.


Abstract:
  Group sequential design (GSD) is widely used in clinical trials in which
correlated tests of multiple hypotheses are used. Multiple primary objectives
resulting in tests with known correlations include evaluating 1) multiple
experimental treatment arms, 2) multiple populations, 3) the combination of
multiple arms and multiple populations, or 4) any asymptotically multivariate
normal tests. In this paper, we focus on the first 3 of these and extend the
framework of the weighted parametric multiple test procedure from fixed designs
with a single analysis per objective to a GSD setting where different
objectives may be assessed at the same or different times, each in a group
sequential fashion. Pragmatic methods for design and analysis of weighted
parametric group sequential design(WPGSD) under closed testing procedures are
proposed to maintain the strong control of familywise Type I error rate (FWER)
when correlations between tests are incorporated. This results in the ability
to relax testing bounds compared to designs not fully adjusting for known
correlations, increasing power or allowing decreased sample size. We illustrate
the proposed methods using clinical trial examples and conduct a simulation
study to evaluate the operating characteristics.


Abstract:
  The equilibrium of magneto-elastic rods, formed of an elastic matrix
containing a uniform distribution of paramagnetic particles, that are subject
to terminal loads and are immersed in a uniform magnetic field, is studied. The
deduced nonlinear equilibrium equations are fully consistent with Kirchhoff's
theory in the sense that they hold at the same order of magnitude. Exact
solutions of those equations in terms of Weierstrass elliptic functions are
presented with reference to magneto-elastic cantilevers that undergo planar
deformations under the action of a terminal force and a magnetic field whose
directions are either parallel or orthogonal. The exact solutions are applied
to the study of a problem of remotely controlled deformation of a rod and to a
bifurcation problem in which the end force and the magnetic field act as an
imperfection parameter and a bifurcation parameter, respectively.


Abstract:
  The likelihood-informed subspace (LIS) method offers a viable route to
reducing the dimensionality of high-dimensional probability distributions
arising in Bayesian inference. LIS identifies an intrinsic low-dimensional
linear subspace where the target distribution differs the most from some
tractable reference distribution. Such a subspace can be identified using the
leading eigenvectors of a Gram matrix of the gradient of the log-likelihood
function. Then, the original high-dimensional target distribution is
approximated through various forms of marginalization of the likelihood
function, in which the approximated likelihood only has support on the
intrinsic low-dimensional subspace. This approximation enables the design of
inference algorithms that can scale sub-linearly with the apparent
dimensionality of the problem. Intuitively, the accuracy of the approximation,
and hence the performance of the inference algorithms, are influenced by three
factors -- the dimension truncation error in identifying the subspace, Monte
Carlo error in estimating the Gram matrices, and Monte Carlo error in
constructing marginalizations. %This work establishes a unified framework to
analyze each of these three factors and their interplay. Under mild technical
assumptions, we establish error bounds for a range of existing dimension
reduction techniques based on the principle of LIS. Our error bounds also
provide useful insights into the accuracy of these methods. In addition, we
analyze the integration of LIS with sampling methods such as Markov Chain Monte
Carlo (MCMC) and sequential Monte Carlo (SMC). We also demonstrate the
applicability of our analysis on a linear inverse problem with Gaussian prior,
which shows that all the estimates can be dimension-independent if the prior
covariance is a trace-class operator.


Abstract:
  The asteroid (16) Psyche is the largest of the M-type asteroids, which have
been hypothesized to be the cores of disrupted planetesimals and the parent
bodies of the iron meteorites. While recent evidence has collected against a
pure metal composition for Psyche, its spectrum and radar properties remain
anomalous. We observed (16) Psyche in thermal emission with the Atacama Large
(sub-)Millimeter Array (ALMA) at a resolution of 30 km over 2/3 of its
rotation. The diurnal temperature variations are at the $\sim$10 K level over
most of the surface and are best fit by a smooth surface with a thermal inertia
of 280$\pm$100 J m$^{-2}$ K$^{-1}$ s$^{-1/2}$. We measure a millimeter
emissivity of 0.61$\pm$0.02, which we interpret via a model that treats the
surface as a porous mixture of silicates and metals, where the latter may take
the form of iron sulfides/oxides or alternatively as conducting metallic
inclusions. The emissivity indicates a metal content of no less than 20\% and
potentially much higher, but the polarized emission that should be present for
a surface with $\geq$20\% metal content is almost completely absent. This
requires a highly scattering surface, which may be due to the presence of
reflective metallic inclusions. If such is the case, a consequence is that
metal-rich asteroids may produce less polarized emission than metal-poor
asteroids, exactly the opposite prediction from standard theory, arising from
the dominance of scattering over the bulk material properties.


Abstract:
  For a Lie group $G$, let $B_{com} G$ be the classifying space for
commutativity. Let $E_{com} G$ be the total space of the principal $G$-bundle
associated to $B_{com} G$. In this article, we present a computation of the
cohomology of $E_{com} U(3)$ using the spectral sequence associated to a
homotopy colimit. As a part of our computation we will also compute the
integral cohomology of $U(3)/N(T)$ and $(U(3)/T) \times_{\Sigma_3} (U(3)/T)$
where $T$ is a maximal torus of $U(3)$ with normalizer $N(T)$.


Abstract:
  In this paper, the well-known Faulkner construction is revisited and adapted
to include the super case, which gives a natural correspondence between
generalized Jordan (super)pairs and faithful Lie (super)algebra (super)modules,
under certain constraints (bilinear forms with properties analogous to the ones
of a Killing form are required, and only finite-dimensional objects are
considered). We always assume that the base field has characteristic different
from $2$.
  It is also proven that associated objects in this Faulkner correspondence
have isomorphic automorphism group schemes. Finally, this correspondence will
be used to transfer the construction of the tensor product to the class of
generalized Jordan (super)pairs with "good" bilinear forms.


Abstract:
  The important, and often dominant, role of tunneling in low temperature
kinetics has resulted in numerous theoretical explorations into the methodology
for predicting it. Nevertheless, there are still key aspects of the derivations
that are lacking, particularly for non-separable systems in the low temperature
regime, and further explorations of the physical factors affecting the
tunneling rate are warranted. In this work we obtain a closed-form rate
expression for the tunneling rate constant that is a direct analog of the
rigid-rotor-harmonic-oscillator expression. This expression introduces a novel
"entanglement factor" that modulates the reaction rate. Furthermore, we are
able to extend this expression, which is valid for non-separable systems at low
temperatures, to properly account for the conservation of angular momentum. In
contrast, previous calculations have considered only vibrational transverse
modes and so effectively employ a decoupled rotational partition function for
the orientational modes. We also suggest a simple theoretical model to describe
the tunneling effects in the vicinity of the crossover temperature (the
temperature where tunneling becomes the dominating mechanism). This model
allows one to naturally classify, interpret, and predict experimental data.
Among other things, it quantitatively explains in simple terms the so-called
"quantum bobsled" effect, also known as the negative centrifugal effect, which
is related to curvature of the reaction path. Taken together, the expressions
obtained here allow one to predict the thermal and $E$-resolved rate constants
over broad ranges of temperatures and energies.


Abstract:
  Convolutional Neural Networks (CNNs) are the state-of-the-art algorithms for
the processing of images. However the configuration and training of these
networks is a complex task requiring deep domain knowledge, experience and much
trial and error. Using genetic algorithms, competitive CNN topologies for image
recognition can be produced for any specific purpose, however in previous work
this has come at high computational cost. In this work two novel approaches are
presented to the utilisation of these algorithms, effective in reducing
complexity and training time by nearly 20%. This is accomplished via
regularisation directly on training time, and the use of partial training to
enable early ranking of individual architectures. Both approaches are validated
on the benchmark CIFAR10 data set, and maintain accuracy.


Abstract:
  In this paper, the structure of the second relative homology and the relative
stem cover of the direct sum of two pairs of Leibniz algebras are determined by
means of the non-abelian tensor product of Leibniz algebras. We also
characterize all pairs of finite dimensional nilpotent Leibniz algebras such
that...


Abstract:
  We study two actions of the (degree 0) Picard group on the set of the
spanning trees of a finite ribbon graph. It is known that these two actions,
denoted $\beta_q$ and $\rho_q$ respectively, are independent of the base vertex
$q$ if and only if the ribbon graph is planar. Baker and Wang conjectured that
in a nonplanar ribbon graph without multiple edges there always exists a vertex
$q$ for which $\rho_q\neq\beta_q$. We prove the conjecture and extend it to a
class of ribbon graphs with multiple edges. We also give explicit examples
exploring the relationship between the two torsor structures in the nonplanar
case.


Abstract:
  In this paper, we consider Legendre trajectories of trans-$S$-manifolds. We
obtain curvature characterizations of these curves and give a classification
theorem. We also investigate Legendre curves whose Frenet frame fields are
linearly dependent with certain combination of characteristic vector fields of
the trans-$S$-manifold.


Abstract:
  Recent research has shown that it is possible to find interpretable
directions in the latent spaces of pre-trained Generative Adversarial Networks
(GANs). These directions enable controllable image generation and support a
wide range of semantic editing operations, such as zoom or rotation. The
discovery of such directions is often done in a supervised or semi-supervised
manner and requires manual annotations which limits their use in practice. In
comparison, unsupervised discovery allows finding subtle directions that are
difficult to detect a priori. In this work, we propose a contrastive
learning-based approach to discover semantic directions in the latent space of
pre-trained GANs in a self-supervised manner. Our approach finds semantically
meaningful dimensions comparable with state-of-the-art methods.


Abstract:
  The confirmation of the discrepancy with the Standard Model predictions in
the anomalous magnetic moment by the Muon g-2 experiment at Fermilab points to
a low scale of new physics. Flavour symmetries broken at low energies can
account for this discrepancy but these models are much more restricted, as they
would also generate off-diagonal entries in the dipole moment matrix.
Therefore, if we assume that the observed discrepancy in the muon $g-2$ is
explained by the contributions of a low-energy flavor symmetry, lepton flavour
violating processes can constrain the structure of the lepton mass matrices and
therefore the flavour symmetries themselves predicting these structures. We
apply these ideas to several discrete flavour symmetries popular in the
leptonic sector, such as $\Delta (27)$, $A_4$, and $A_5 \ltimes {\rm CP}$.


Abstract:
  In this paper, we propose a novel discriminative model for online behavioral
analysis with application to emotion state identification. The proposed model
is able to extract more discriminative characteristics from behavioral data
effectively and find the direction of optimal projection efficiently to satisfy
requirements of online data analysis, leading to better utilization of the
behavioral information to produce more accurate recognition results.


Abstract:
  Explainable artificial intelligence is the attempt to elucidate the workings
of systems too complex to be directly accessible to human cognition through
suitable side-information referred to as "explanations". We present a trainable
explanation module for convolutional image classifiers we call bounded logit
attention (BLA). The BLA module learns to select a subset of the convolutional
feature map for each input instance, which then serves as an explanation for
the classifier's prediction. BLA overcomes several limitations of the
instancewise feature selection method "learning to explain" (L2X) introduced by
Chen et al. (2018): 1) BLA scales to real-world sized image classification
problems, and 2) BLA offers a canonical way to learn explanations of variable
size. Due to its modularity BLA lends itself to transfer learning setups and
can also be employed as a post-hoc add-on to trained classifiers. Beyond
explainability, BLA may serve as a general purpose method for differentiable
approximation of subset selection. In a user study we find that BLA
explanations are preferred over explanations generated by the popular
(Grad-)CAM method.


Abstract:
  Deep Neural Networks are known to be vulnerable to small, adversarially
crafted, perturbations. The current most effective defense methods against
these adversarial attacks are variants of adversarial training. In this paper,
we introduce a radically different defense trained only on clean images: a
sparse coding based frontend which significantly attenuates adversarial attacks
before they reach the classifier. We evaluate our defense on CIFAR-10 dataset
under a wide range of attack types (including Linf , L2, and L1 bounded
attacks), demonstrating its promise as a general-purpose approach for defense.


Abstract:
  A classical theorem on character degrees states that if a finite group has
fewer than four character degrees, then the group is solvable. We prove a
corresponding result on character values by showing that if a finite group has
fewer than eight character values in its character table, then the group is
solvable. This confirms a conjecture of T. Sakurai. We also classify
non-solvable groups with exactly eight character values.


Abstract:
  We show that weak equivalences in a (cofibrantly generated) left Bousfield
localization of the projective model category of simplicial presheaves can be
characterized by a local lifting property if and only if the localization is
exact.


Abstract:
  Accurate liver and lesion segmentation from computed tomography (CT) images
are highly demanded in clinical practice for assisting the diagnosis and
assessment of hepatic tumor disease. However, automatic liver and lesion
segmentation from contrast-enhanced CT volumes is extremely challenging due to
the diversity in contrast, resolution, and quality of images. Previous methods
based on UNet for 2D slice-by-slice or 3D volume-by-volume segmentation either
lack sufficient spatial contexts or suffer from high GPU computational cost,
which limits the performance. To tackle these issues, we propose a novel
context-aware PolyUNet for accurate liver and lesion segmentation. It jointly
explores structural diversity and consecutive t-adjacent slices to enrich
feature expressive power and spatial contextual information while avoiding the
overload of GPU memory consumption. In addition, we utilize zoom out/in and
two-stage refinement strategy to exclude the irrelevant contexts and focus on
the specific region for the fine-grained segmentation. Our method achieved very
competitive performance at the MICCAI 2017 Liver Tumor Segmentation (LiTS)
Challenge among all tasks with a single model and ranked the $3^{rd}$,
$12^{th}$, $2^{nd}$, and $5^{th}$ places in the liver segmentation, lesion
segmentation, lesion detection, and tumor burden estimation, respectively.


Abstract:
  Fusing live fluoroscopy images with a 3D rotational reconstruction of the
vasculature allows to navigate endovascular devices in minimally invasive
neuro-vascular treatment, while reducing the usage of harmful iodine contrast
medium. The alignment of the fluoroscopy images and the 3D reconstruction is
initialized using the sensor information of the X-ray C-arm geometry. Patient
motion is then corrected by an image-based registration algorithm, based on a
gradient difference similarity measure using digital reconstructed radiographs
of the 3D reconstruction. This algorithm does not require the vessels in the
fluoroscopy image to be filled with iodine contrast agent, but rather relies on
gradients in the image (bone structures, sinuses) as landmark features. This
paper investigates the accuracy, robustness and computation time aspects of the
image-based registration algorithm. Using phantom experiments 97% of the
registration attempts passed the success criterion of a residual registration
error of less than 1 mm translation and 3{\deg} rotation. The paper establishes
a new method for validation of 2D-3D registration without requiring changes to
the clinical workflow, such as attaching fiducial markers. As a consequence,
this method can be retrospectively applied to pre-existing clinical data. For
clinical data experiments, 87% of the registration attempts passed the
criterion of a residual translational error of < 1 mm, and 84% possessed a
rotational error of < 3{\deg}.


Abstract:
  We determine the Waring ranks of all sextic binary forms using a Geometric
Invariant Theory approach. In particular, we shed new light on a claim by E. B.
Elliott at the end of the 19th century concerning the binary sextics with
Waring rank 3.


Abstract:
  We demonstrate that single crystals of methylammonium lead bromide (MAPbBr3)
could be grown directly on vertically aligned carbon nanotube (VACNT) forests.
The fast-growing MAPbBr3 single crystals engulfed the protogenetic inclusions
in the form of individual CNTs, thus resulting in a three-dimensionally
enlarged photosensitive interface. Photodetector devices were obtained,
detecting low light intensities (~20 nW) from UV range to 550 nm. Moreover, a
photocurrent was recorded at zero external bias voltage which points to the
plausible formation of a p-n junction resulting from interpenetration of
MAPbBr3 single crystals into the VACNT forest. This reveals that vertically
aligned CNTs can be used as electrodes in operationally stable perovskite-based
optoelectronic devices and can serve as a versatile platform for future
selective electrode development.


Abstract:
  We present the Galactic Radio Explorer (GReX), an all-sky monitor to probe
the brightest bursts in the radio sky. Building on the success of STARE2, we
will search for fast radio bursts (FRBs) emitted from Galactic magnetars as
well as bursts from nearby galaxies. GReX will search down to ten microseconds
time resolution, allowing us to find new super giant radio pulses from Milky
Way pulsars and study their broadband emission. The proposed instrument will
employ ultra-wide band (0.7-2 GHz) feeds coupled to a high performance
(receiver temperature 10 K) low noise amplifier (LNA) originally developed for
the DSA-110 and DSA-2000 projects. In GReX Phase I (GReX-I), unit systems will
be deployed at Owens Valley Radio Observatory (OVRO) and Big Smoky Valley,
Nevada. Phase II will expand the array, placing feeds in India, Australia, and
elsewhere in order to build up to continuous coverage of nearly 4$\pi$
steradians and to increase our exposure to the Galactic plane. We model the
local magnetar population to forecast for GReX, finding the improved
sensitivity and increased exposure to the Galactic plane could lead to dozens
of FRB-like bursts per year.


Abstract:
  Although travelling faster than the speed of light in vacuum is not
physically allowed, the analogous bound in medium can be exceeded by a moving
particle. For an electron in dielectric material this leads to emission of
photons which is usually referred to as Cherenkov radiation. In this article a
related mathematical system for waves in inhomogeneous anisotropic medium with
a maximum of three polarisation directions is studied. The waves are assumed to
satisfy $P^k_j u_k (x,t) = S_j(x,t)$, where $P$ is a vector-valued wave
operator that depends on a Riemannian metric and $S $ is a point source that
moves at speed $\beta < c$ in given direction $\theta \in \mathbb{S}^2$. The
phase velocity $v_{\text{phase}}$ is described by the metric and depends on
both location and direction of motion. In regions where
$v_{\text{phase}}(x,\theta) < \beta <c $ holds the source generates a
cone-shaped front of singularities that propagate according to the underlying
geometry. We introduce a model for a measurement setup that applies the
mechanism and show that the Riemannian metric inside a bounded region can be
reconstructed from partial boundary measurements. The result suggests that
Cherenkov type radiation can be applied to detect internal geometric properties
of an inhomogeneous anisotropic target from a distance.


Abstract:
  Camera pose estimation in known scenes is a 3D geometry task recently tackled
by multiple learning algorithms. Many regress precise geometric quantities,
like poses or 3D points, from an input image. This either fails to generalize
to new viewpoints or ties the model parameters to a specific scene. In this
paper, we go Back to the Feature: we argue that deep networks should focus on
learning robust and invariant visual features, while the geometric estimation
should be left to principled algorithms. We introduce PixLoc, a scene-agnostic
neural network that estimates an accurate 6-DoF pose from an image and a 3D
model. Our approach is based on the direct alignment of multiscale deep
features, casting camera localization as metric learning. PixLoc learns strong
data priors by end-to-end training from pixels to pose and exhibits exceptional
generalization to new scenes by separating model parameters and scene geometry.
The system can localize in large environments given coarse pose priors but also
improve the accuracy of sparse feature matching by jointly refining keypoints
and poses with little overhead. The code will be publicly available at
https://github.com/cvg/pixloc.


Abstract:
  High precision CCD observations of six totally eclipsing contact binaries
were presented and analyzed. It is found that only one target is an A-type
contact binary (V429 Cam), while the others are W-type contact ones. By
analyzing the times of light minima, we discovered that two of them exhibit
secular period increase while three manifest long-term period decrease. For
V1033 Her, a cyclic variation superimposed on the long-term increase was
discovered. By comparing the Gaia distances with those calculated by the
absolute parameters of 173 contact binaries, we found that Gaia distance can be
applied to estimate absolute parameters for most contact binaries. The absolute
parameters of our six targets were estimated by using their Gaia distances. The
evolutionary status of contact binaries was studied, we found that the A- and
W- subtype contact binaries may have different formation channels. The
relationship between the spectroscopic and photometric mass ratios for 101
contact binaries was presented. It is discovered that the photometric mass
ratios are in good agreement with the spectroscopic ones for almost all the
totally eclipsing systems, which is corresponding to the results derived by
Pribulla et al. and Terrell & Wilson.


Abstract:
  User activities generate a significant number of poor-quality or irrelevant
images and data vectors that cannot be processed in the main data processing
pipeline or included in the training dataset. Such samples can be found with
manual analysis by an expert or with anomalous detection algorithms. There are
several formal definitions for the anomaly samples. For neural networks, the
anomalous is usually defined as out-of-distribution samples. This work proposes
methods for supervised and semi-supervised detection of out-of-distribution
samples in image datasets. Our approach extends a typical neural network that
solves the image classification problem. Thus, one neural network after
extension can solve image classification and anomalous detection problems
simultaneously. Proposed methods are based on the center loss and its effect on
a deep feature distribution in a last hidden layer of the neural network. This
paper provides an analysis of the proposed methods for the LeNet and
EfficientNet-B0 on the MNIST and ImageNet-30 datasets.


Abstract:
  Deep learning (DL) has emerged as a powerful tool for accelerated MRI
reconstruction, but these methods often necessitate a database of fully-sampled
measurements for training. Recent self-supervised and unsupervised learning
approaches enable training without fully-sampled data. However, a database of
undersampled measurements may not be available in many scenarios, especially
for scans involving contrast or recently developed translational acquisitions.
Moreover, database-trained models may not generalize well when the unseen
measurements differ in terms of sampling pattern, acceleration rate, SNR, image
contrast, and anatomy. Such challenges necessitate a new methodology that can
enable scan-specific DL MRI reconstruction without any external training
datasets. In this work, we propose a zero-shot self-supervised learning
approach to perform scan-specific accelerated MRI reconstruction to tackle
these issues. The proposed approach splits available measurements for each scan
into three disjoint sets. Two of these sets are used to enforce data
consistency and define loss during training, while the last set is used to
establish an early stopping criterion. In the presence of models pre-trained on
a database with different image characteristics, we show that the proposed
approach can be combined with transfer learning to further improve
reconstruction quality.


Abstract:
  We study the collision frequencies of particles in the weakly and highly
ionized plasmas with the power-law q-distributions in nonextensive statistics.
We derive the average collision frequencies of neutral-neutral particle,
electron-neutral particle, ion-neutral particle, electron-electron, ion-ion and
electron-ion, respectively, in the q-distributed plasmas. We show that the
average collision frequencies depend strongly on the q-parameter in a complex
form and thus their properties are significantly different from that in
Maxwell-distributed plasmas. These new average collision frequencies are
important for us to study accurately the transport property in the complex
plasmas with non-Maxwell/power-law velocity distributions.


Abstract:
  Generalized zero-shot learning (GZSL) aims to classify samples under the
assumption that some classes are not observable during training. To bridge the
gap between the seen and unseen classes, most GZSL methods attempt to associate
the visual features of seen classes with attributes or to generate unseen
samples directly. Nevertheless, the visual features used in the prior
approaches do not necessarily encode semantically related information that the
shared attributes refer to, which degrades the model generalization to unseen
classes. To address this issue, in this paper, we propose a novel semantics
disentangling framework for the generalized zero-shot learning task (SDGZSL),
where the visual features of unseen classes are firstly estimated by a
conditional VAE and then factorized into semantic-consistent and
semantic-unrelated latent vectors. In particular, a total correlation penalty
is applied to guarantee the independence between the two factorized
representations, and the semantic consistency of which is measured by the
derived relation network. Extensive experiments conducted on four GZSL
benchmark datasets have evidenced that the semantic-consistent features
disentangled by the proposed SDGZSL are more generalizable in tasks of
canonical and generalized zero-shot learning. Our source code is available at
https://github.com/uqzhichen/SDGZSL.


Abstract:
  While symmetry has been exploited to analyze synchronization patterns in
complex networks, the identification of symmetries in large-size network
remains as a challenge. We present in the present work a new method, namely the
method of eigenvector-based analysis, to identify symmetries in general complex
networks and, incorporating the method of eigenvalue analysis, investigate the
formation and transition of synchronization patterns. The efficiency of the
proposed method is validated by both artificial and empirical network models
consisting of coupled chaotic oscillators. Furthermore, we generalize the
method to networks of weighted couplings in which no strict symmetry exists but
synchronization clusters are still well organized, with the predications
agreeing with the results of direct simulations. Our study provides a new
approach for identifying network symmetries, and paves a way to the
investigation of synchronization patterns in large-size complex network.


Abstract:
  We revisit the notions of the quantum-mechanical sojourn time in the context
of the quantum clocks to enquire whether the sojourn time be clocked without
the clock affecting the dynamics of the wave motion. Upon recognizing that the
positivity of conditional sojourn time is not ensured even in the case of
physically co-evolving clock mechanisms, we trace its origins to the
non-trivial inadvertent scattering arising from the disparity, however weak,
engendered by the very clock potential. Specifically, our investigations focus
on the Larmor spin rotation-based unitary clock where the alleviation of these
unphysical contributions has been achieved by correcting the mathematical
apparatus of extracting the sojourn times. The corrections have been obtained
for both the spin precession-based and spin alignment-based scenarios. The
sojourn times so obtained are found to have proper high- and low-energy limits
and turn out to be positive definite for an arbitrary potential. The regimen
provided here is general and appeals equivalently for unitary as well as
non-unitary clocks where the clock-induced perturbations couple to the system
Hamiltonian.


Abstract:
  The damage mechanisms and load redistribution of high strength TC17 titanium
alloy/unidirectional SiC fibre composite (fibre diameter = 100 $\mu$m) under
high temperature (350 {\deg}C) fatigue cycling have been investigated in situ
using synchrotron X-ray computed tomography (CT) and X-ray diffraction (XRD)
for high cycle fatigue (HCF) under different stress amplitudes. The
three-dimensional morphology of the crack and fibre fractures has been mapped
by CT. During stable growth, matrix cracking dominates with the crack
deflecting (by 50-100 $\mu$m in height) when bypassing bridging fibres. A small
number of bridging fibres have fractured close to the matrix crack plane
especially under relatively high stress amplitude cycling. Loading to the peak
stress led to rapid crack growth accompanied by a burst of fibre fractures.
Many of the fibre fractures occurred 50-300 $\mu$m from the matrix crack plane
during rapid growth, in contrast to that in the stable growth stage, leading to
extensive fibre pull-out on the fracture surface. The changes in fibre loading,
interfacial stress, and the extent of fibre-matrix debonding in the vicinity of
the crack have been mapped for the fatigue cycle and after the rapid growth by
high spatial resolution XRD. The fibre/matrix interfacial sliding extends up to
600 $\mu$m (in the stable growth zone) or 700 $\mu$m (in the rapid growth zone)
either side of the crack plane. The direction of interfacial shear stress
reverses with the loading cycle, with the maximum frictional sliding stress
reaching ~55 MPa in both the stable growth and rapid growth regimes.


Abstract:
  HardWare-aware Neural Architecture Search (HW-NAS) has recently gained
tremendous attention by automating the design of DNNs deployed in more
resource-constrained daily life devices. Despite its promising performance,
developing optimal HW-NAS solutions can be prohibitively challenging as it
requires cross-disciplinary knowledge in the algorithm, micro-architecture, and
device-specific compilation. First, to determine the hardware-cost to be
incorporated into the NAS process, existing works mostly adopt either
pre-collected hardware-cost look-up tables or device-specific hardware-cost
models. Both of them limit the development of HW-NAS innovations and impose a
barrier-to-entry to non-hardware experts. Second, similar to generic NAS, it
can be notoriously difficult to benchmark HW-NAS algorithms due to their
significant required computational resources and the differences in adopted
search spaces, hyperparameters, and hardware devices. To this end, we develop
HW-NAS-Bench, the first public dataset for HW-NAS research which aims to
democratize HW-NAS research to non-hardware experts and make HW-NAS research
more reproducible and accessible. To design HW-NAS-Bench, we carefully
collected the measured/estimated hardware performance of all the networks in
the search spaces of both NAS-Bench-201 and FBNet, on six hardware devices that
fall into three categories (i.e., commercial edge devices, FPGA, and ASIC).
Furthermore, we provide a comprehensive analysis of the collected measurements
in HW-NAS-Bench to provide insights for HW-NAS research. Finally, we
demonstrate exemplary user cases to (1) show that HW-NAS-Bench allows
non-hardware experts to perform HW-NAS by simply querying it and (2) verify
that dedicated device-specific HW-NAS can indeed lead to optimal accuracy-cost
trade-offs. The codes and all collected data are available at
https://github.com/RICE-EIC/HW-NAS-Bench.