title:
Bell-CHSH Violation Under Global Unitary Operations: Necessary and
  Sufficient conditions

abstract:
  The relation between Bell-CHSH violation and factorization of Hilbert space
is considered here. That is, a state which is local in the sense of the
Bell-CHSH inequality under a certain factorization of the underlying Hilbert
space can be Bell-CHSH non-local under a different factorization. While this
question has been addressed with respect to separability , the relation of the
factorization with Bell-CHSH violation has remained hitherto unexplored. We
find here, that there is a set containing density matrices which do not exhibit
Bell-CHSH violation under any factorization of the Hilbert space brought about
by global unitary operations. Using the Cartan decomposition of $ SU(4) $,we
characterize the set in terms of a necessary and sufficient criterion based on
the spectrum of density matrices. Sufficient conditions are obtained to
characterize such density matrices based on their bloch representations. For
some classes of density matrices, necessary and sufficient conditions are
derived in terms of bloch parameters. Furthermore, an estimation of the volume
of such density matrices is achieved in terms of purity. The criterion is
applied to some well-known class of states in two qubits.Since, both local
filtering and global unitary operations influence Bell-CHSH violation of a
state, a comparative study is made between the two operations. The
inequivalence of the two operations(in terms of increasing Bell-CHSH violation)
is exemplified through their action on some classes of states.


title:
A New Model of Thermal Propagation in Human Tissue by Using HIFU
  Application

abstract:
  In outside the body HIFU treatment that focused ultrasound beams hit severely
with cancer tissue layer especially the soft one, at the time of passage of the
body different layers as long as they want to reach tumor, put their own way
components under mechanical and even thermal influence and they can cause skin
lesions. To reduce this effect a specific mechanical model can be used that
means body tissue is considered as a mechanical model, it is affected when
passing sound mechanical waves through it and each layer has an average heat.
Gradually sound intensity decreases through every layer passage, finally in one
direction a decreased intensity sound reach tumor tissue. If sound propagated
directions increase, countless waves with decreased intensity are gathered upon
the tumor tissue that causes a lot of heat focus on tumor tissue. Depending on
the kind and mechanical properties of the tissue, intensity of each sound wave
when it passes through tissue can be controlled to reduce damages outside the
tumor tissue.


title:
Instance-aware Image and Sentence Matching with Selective Multimodal
  LSTM

abstract:
  Effective image and sentence matching depends on how to well measure their
global visual-semantic similarity. Based on the observation that such a global
similarity arises from a complex aggregation of multiple local similarities
between pairwise instances of image (objects) and sentence (words), we propose
a selective multimodal Long Short-Term Memory network (sm-LSTM) for
instance-aware image and sentence matching. The sm-LSTM includes a multimodal
context-modulated attention scheme at each timestep that can selectively attend
to a pair of instances of image and sentence, by predicting pairwise
instance-aware saliency maps for image and sentence. For selected pairwise
instances, their representations are obtained based on the predicted saliency
maps, and then compared to measure their local similarity. By similarly
measuring multiple local similarities within a few timesteps, the sm-LSTM
sequentially aggregates them with hidden states to obtain a final matching
score as the desired global similarity. Extensive experiments show that our
model can well match image and sentence with complex content, and achieve the
state-of-the-art results on two public benchmark datasets.


title: Legendre-Fenchel duality and a generalized constitutive relation error

abstract:
  A generalized constitutive relation error is proposed in an analogous form to
Fenchel-Young inequality on the basis of the key idea of Legendre-Fenchel
duality theory. The generalized constitutive relation error is linked with the
global errors of some admissible solutions for the problem in question, and is
of wide applicability, especially in a posteriori error estimations of
numerical methods. A class of elliptic variational inequalities is examined
using the proposed approach and a strict upper bound of global energy errors of
admissible solutions is obtained.


title:
Convex Optimization of Distributed Cooperative Detection in
  Multi-Receiver Molecular Communication

abstract:
  In this paper, the error performance achieved by cooperative detection among
K distributed receivers in a diffusion-based molecular communication (MC)
system is analyzed and optimized. In this system, the receivers first make
local hard decisions on the transmitted symbol and then report these decisions
to a fusion center (FC). The FC combines the local hard decisions to make a
global decision using an N-out-of-K fusion rule. Two reporting scenarios,
namely, perfect reporting and noisy reporting, are considered. Closed-form
expressions are derived for the expected global error probability of the system
for both reporting scenarios. New approximated expressions are also derived for
the expected error probability. Convex constraints are then found to make the
approximated expressions jointly convex with respect to the decision thresholds
at the receivers and the FC. Based on such constraints, suboptimal convex
optimization problems are formulated and solved to determine the optimal
decision thresholds which minimize the expected error probability of the
system. Numerical and simulation results reveal that the system error
performance is greatly improved by combining the detection information of
distributed receivers. They also reveal that the solutions to the formulated
suboptimal convex optimization problems achieve near-optimal global error
performance.


title:
Strong Spreading in a Droplet Flow for Low-Dimensional Nanostructures
  Growth

abstract:
  We report an in situ transmission electron microscopy observation of an
indium droplet flowing on a silicon nitride membrane with a coating layer of
hydrogenated amorphous silicon (a-Si:H), with the production of in-plane c-Si
nanowire in its trail. We observe that the droplet strongly spreads on the
a-Si:H coated surface while it dewets from the c-Si NW. This in situ
observation, combined with the geometric analysis of such liquid-solid systems,
presents nice consistency with de Gennes theoretic prediction of the droplet
hydrodynamics steered by reactive spreading, where the wettability gradient for
the droplet flowing is maintained by a progressively autophobic process due to
the droplet mediated crystallization of a-Si:H. Interestingly, we record
temperature dependent evolution of the droplet-nanowire interface, which leads
the droplet break-up, self-turning and the nanoflake-to-nanowire transition. We
elucidate these rich nanofluidic phenomena by a model based on the
heterogeneous nucleation governed reactive spreading.


title: Multimodal Memory Modelling for Video Captioning

abstract:
  Video captioning which automatically translates video clips into natural
language sentences is a very important task in computer vision. By virtue of
recent deep learning technologies, e.g., convolutional neural networks (CNNs)
and recurrent neural networks (RNNs), video captioning has made great progress.
However, learning an effective mapping from visual sequence space to language
space is still a challenging problem. In this paper, we propose a Multimodal
Memory Model (M3) to describe videos, which builds a visual and textual shared
memory to model the long-term visual-textual dependency and further guide
global visual attention on described targets. Specifically, the proposed M3
attaches an external memory to store and retrieve both visual and textual
contents by interacting with video and sentence with multiple read and write
operations. First, text representation in the Long Short-Term Memory (LSTM)
based text decoder is written into the memory, and the memory contents will be
read out to guide an attention to select related visual targets. Then, the
selected visual information is written into the memory, which will be further
read out to the text decoder. To evaluate the proposed model, we perform
experiments on two publicly benchmark datasets: MSVD and MSR-VTT. The
experimental results demonstrate that our method outperforms the
state-of-theart methods in terms of BLEU and METEOR.


title: Disintegration of the Aged Open Cluster Berkeley 17

abstract:
  We present the analysis of the morphological shape of Berkeley 17, the oldest
known open cluster (~10 Gyr), using a probabilistic star counting of Pan-STARRS
point sources, and confirm its core-tail shape, plus an antitail, previously
detected with the 2MASS data. The stellar population, as diagnosed by the
color-magnitude diagram and theoretical isochrones, shows many massive members
in the cluster core, whereas there is a paucity of such members in both tails.
This manifests mass segregation in this aged star cluster with the low-mass
members being stripped away from the system. It has been claimed that Berkeley
17 is associated with an excessive number of blue straggler candidates.
Comparison of nearby reference fields indicates that about half of these may be
field contamination.


title:
SCA-CNN: Spatial and Channel-wise Attention in Convolutional Networks
  for Image Captioning

abstract:
  Visual attention has been successfully applied in structural prediction tasks
such as visual captioning and question answering. Existing visual attention
models are generally spatial, i.e., the attention is modeled as spatial
probabilities that re-weight the last conv-layer feature map of a CNN encoding
an input image. However, we argue that such spatial attention does not
necessarily conform to the attention mechanism --- a dynamic feature extractor
that combines contextual fixations over time, as CNN features are naturally
spatial, channel-wise and multi-layer. In this paper, we introduce a novel
convolutional neural network dubbed SCA-CNN that incorporates Spatial and
Channel-wise Attentions in a CNN. In the task of image captioning, SCA-CNN
dynamically modulates the sentence generation context in multi-layer feature
maps, encoding where (i.e., attentive spatial locations at multiple layers) and
what (i.e., attentive channels) the visual attention is. We evaluate the
proposed SCA-CNN architecture on three benchmark image captioning datasets:
Flickr8K, Flickr30K, and MSCOCO. It is consistently observed that SCA-CNN
significantly outperforms state-of-the-art visual attention-based image
captioning methods.


title: The distribution of $H_{8}$-extensions of quadratic fields

abstract:
  We compute all the moments of a normalization of the function which counts
unramified $H_{8}$-extensions of quadratic fields, where $H_{8}$ is the
quaternion group of order 8, and show that the values of this function
determine a constant distribution. Furthermore we propose a similar
modification to the non-abelian Cohen-Lenstra heuristics for unramified
G-extensions of quadratic fields for G in a large class of 2-groups, which we
conjecture will give finite moments which determine a distribution. Our method
additionally can be used to determine the asymptotics of the unnormalized
counting function, which we also do for unramified $H_{8}$-extensions.


title:
Gromov's Problem: Bound the Expansion Coefficient from below in terms of
  the Observable Diameter of a Metric Measure Space, and its Diameter Bounds

abstract:
  In the celebrated book entitled Metric Structures for Riemannian and
Non-Riemannian Spaces, so-called Green Book, Gromov presented a problem
regarding a metric measure space. Gromov posed the question Bound the expansion
coefficient from below in terms of the observable diameter. The overall aim of
the current study is to demonstrate the answer to this problem. To begin
solving this problem, the concentration of measure phenomenon on the metric
measure space must be considered. The concentration function to evaluate the
measure phenomenon is connected by the observable diameter and the expansion
coefficient. Furthermore, the procedure for our answer gives us the upper bound
for the expansion coefficient in terms of the observable diameter. Combining
the desired lower bound for the expansion coefficient with its upper bound, we
eventually obtain the upper bound for the observable diameter. Simultaneously,
this reasoning has enabled us to obtain the upper bound for the diameter of a
bounded metric measure space in terms of the expansion coefficient. We will
apply the above-mentioned results to a compact connected Riemannian manifold
with non-negative Ricci curvature, which makes the bounds more explicit. More
precisely, they are in terms of the doubling constant of the Riemannian measure
and the first non-trivial eigenvalue of the Laplacian on the Riemannian
manifold.


title:
Decoupled Signal Detection for the Uplink of Large-Scale MIMO Systems in
  Heterogeneous Networks

abstract:
  Massive multiple-input multiple-output (MIMO) systems are strong candidates
for future fifth generation (5G) heterogeneous cellular networks. For 5G, a
network densification with a high number of different classes of users and data
service requirements is expected. Such a large number of connected devices
needs to be separated in order to allow the detection of the transmitted
signals according to different data requirements. In this paper, a decoupled
signal detection (DSD) technique which allows the separation of the uplink
signals, for each user class, at the base station (BS) is proposed for massive
MIMO systems. A mathematical signal model for massive MIMO systems with
centralized and distributed antennas in heterogeneous networks is also
developed. The performance of the proposed DSD algorithm is evaluated and
compared with existing detection schemes in a realistic scenario with
distributed antennas. A sum-rate analysis and a computational cost study for
DSD are also presented. Simulation results show an excellent performance of the
proposed DSD algorithm when combined with linear and successive interference
cancellation detection techniques.


title:
Interfacial thermal conductance in graphene/black phosphorus
  heterogeneous structures

abstract:
  Graphene, as a passivation layer, can be used to protect the black phosphorus
from the chemical reaction with surrounding oxygen and water. However, black
phosphorus and graphene heterostructures have low efficiency of heat
dissipation due to its intrinsic high thermal resistance at the interfaces. The
accumulated energy from Joule heat has to be removed efficiently to avoid the
malfunction of the devices. Therefore, it is of significance to investigate the
interfacial thermal dissipation properties and manipulate the properties by
interfacial engineering on demand. In this work, the interfacial thermal
conductance between few-layer black phosphorus and graphene is studied
extensively using molecular dynamics simulations. Two critical parameters, the
critical power Pcr to maintain thermal stability and the maximum heat power
density Pmax with which the system can be loaded, are identified. Our results
show that interfacial thermal conductance can be effectively tuned in a wide
range with external strains and interracial defects. The compressive strain can
enhance the interfacial thermal conductance by one order of magnitude, while
interface defects give a two-fold increase. These findings could provide
guidelines in heat dissipation and interfacial engineering for thermal
conductance manipulation of black phosphorus-graphene heterostructure-based
devices.


title:
Proposal for quantum many-body simulation and torsional matter-wave
  interferometry with a levitated nanodiamond

abstract:
  Hybrid spin-mechanical systems have great potentials in sensing, macroscopic
quantum mechanics, and quantum information science. In order to induce strong
coupling between an electron spin and the center-of-mass motion of a mechanical
oscillator, a large magnetic gradient is usually required, which is difficult
to achieve. Here we show that strong coupling between the electron spin of a
nitrogen-vacancy (NV) center and the torsional vibration of an optically
levitated nanodiamond can be achieved in a uniform magnetic field. Thanks to
the uniform magnetic field, multiple spins can strongly couple to the torsional
vibration at the same time. We propose to utilize this new coupling mechanism
to realize the Lipkin-Meshkov-Glick (LMG) model by an ensemble of NV centers in
a levitated nanodiamond. The quantum phase transition in the LMG model and
finite number effects can be observed with this system. We also propose to
generate torsional superposition states and realize torsional matter-wave
interferometry with spin-torsional coupling.


title:
Very weak solutions of wave equation for Landau Hamiltonian with
  irregular electromagnetic field

abstract:
  In this paper we study the Cauchy problem for the Landau Hamiltonian wave
equation, with time dependent irregular (distributional) electromagnetic field
and similarly irregular velocity. For such equations, we describe the notion of
a `very weak solution' adapted to the type of solutions that exist for regular
coefficients. The construction is based on considering Friedrichs-type
mollifier of the coefficients and corresponding classical solutions, and their
quantitative behaviour in the regularising parameter. We show that even for
distributional coefficients, the Cauchy problem does have a very weak solution,
and that this notion leads to classical or distributional type solutions under
conditions when such solutions also exist.


title: New Results for Ultraperipheral Heavy Ion Collisions

abstract:
  We discuss diphoton semi(exclusive) production in ultraperipheral $PbPb$
collisions at energy of $\sqrt{s_{NN}}=$ 5.5 TeV (LHC). The nuclear
calculations are based on equivalent photon approximation in the impact
parameter space. The cross sections for elementary $\gamma \gamma \to \gamma
\gamma$ subprocess are calculated including three different mechanisms: box
diagrams with leptons and quarks in the loops, a VDM-Regge contribution with
virtual intermediate hadronic excitations of the photons and the two-gluon
exchange contribution (formally three-loops). We got relatively high cross
sections in $PbPb$ collisions. This opens a possibility to study the $\gamma
\gamma \to \gamma \gamma$ (quasi)elastic scattering at the LHC. We find that
the cross section for elastic $\gamma\gamma$ scattering could be measured in
the lead-lead collisions for the diphoton invariant mass up to
$W_{\gamma\gamma} \approx 15-20$ GeV. We identify region(s) of phase space
where the two-gluon exchange contribution becomes important ingredient compared
to box and nonperturbative VDM-Regge mechanisms. We discuss also first results
concerning production of two $e^+ e^-$ pairs in UPCs of heavy ions. We
considered only double scattering mechanism.


title: Bayesian inference for multivariate extreme value distributions

abstract:
  Statistical modeling of multivariate and spatial extreme events has attracted
broad attention in various areas of science. Max-stable distributions and
processes are the natural class of models for this purpose, and many parametric
families have been developed and successfully applied. Due to complicated
likelihoods, the efficient statistical inference is still an active area of
research, and usually composite likelihood methods based on bivariate densities
only are used. Thibaud et al. (2016, Ann. Appl. Stat., to appear) use a
Bayesian approach to fit a Brown--Resnick process to extreme temperatures. In
this paper, we extend this idea to a methodology that is applicable to general
max-stable distributions and that uses full likelihoods. We further provide
simple conditions for the asymptotic normality of the median of the posterior
distribution and verify them for the commonly used models in multivariate and
spatial extreme value statistics. A simulation study shows that this point
estimator is considerably more efficient than the composite likelihood
estimator in a frequentist framework. From a Bayesian perspective, our approach
opens the way for new techniques such as Bayesian model comparison in
multivariate and spatial extremes.


title:
Weakly-supervised Learning of Mid-level Features for Pedestrian
  Attribute Recognition and Localization

abstract:
  State-of-the-art methods treat pedestrian attribute recognition as a
multi-label image classification problem. The location information of person
attributes is usually eliminated or simply encoded in the rigid splitting of
whole body in previous work. In this paper, we formulate the task in a
weakly-supervised attribute localization framework. Based on GoogLeNet,
firstly, a set of mid-level attribute features are discovered by novelly
designed detection layers, where a max-pooling based weakly-supervised object
detection technique is used to train these layers with only image-level labels
without the need of bounding box annotations of pedestrian attributes.
Secondly, attribute labels are predicted by regression of the detection
response magnitudes. Finally, the locations and rough shapes of pedestrian
attributes can be inferred by performing clustering on a fusion of activation
maps of the detection layers, where the fusion weights are estimated as the
correlation strengths between each attribute and its relevant mid-level
features. Extensive experiments are performed on the two currently largest
pedestrian attribute datasets, i.e. the PETA dataset and the RAP dataset.
Results show that the proposed method has achieved competitive performance on
attribute recognition, compared to other state-of-the-art methods. Moreover,
the results of attribute localization are visualized to understand the
characteristics of the proposed method.


title: Consecutive partitions of social networks between rivaling leaders

abstract:
  A model algorithm is proposed to study subsequent partitions of complex
networks describing social structures. The partitions are supposed to appear as
actions of rivaling leaders corresponding to nodes with large degrees. The
condition of a partition is that the distance between two leaders is at least
three links. This ensures that the layer of nearest neighbours of each leader
remains attached to him. As a rule, numerically calculated size distribution of
fragments of scale-free Albert-Barabasi networks reveals one large fragment
which contains the original leader (hub of the network), and a number of small
fragments with opponents that are described by two Weibull distributions.
Numerical simulations and mean-field theory reveal that size of the larger
fragment scales as the square root of the initial network size. The algorithm
is applied to the data on political blogs in U.S. (L. Adamic and N. Glance,
Proc. WWW-2005). The obtained fragments are clearly polarized; either they
belong to Democrats, or to the GOP.


title:
Approximate Negative-Binomial Confidence Intervals: Asbestos Fiber
  Counts

abstract:
  The negative-binomial distribution is adopted for analyzing asbestos-fiber
counts so as to account for both the sampling errors in capturing only a finite
number of fibers as well as the inevitable human variation in identifying and
counting sampled fibers. A simple approximation to this distribution is
developed for the derivation of quantiles and approximate confidence limits.
The success of the approximation depends critically on the use of the Stirling
expansion to sufficient order, on exact normalization of the approximating
distribution, on reasonable perturbation of quantities from the normal
distribution, and on accurately approximating sums by inverse-trapezoidal
integration. Accuracy of the approximation developed is checked through
simulation and also by comparison to traditional approximate confidence
intervals in the specific case that the negative-binomial distribution
approaches the Poisson distribution.
  The resulting statistics are shown to relate directly to early research into
the accuracy of asbestos sampling and analysis. Uncertainty in estimating mean
asbestos-fiber concentrations given only a single count is derived. Decision
limits (limits of detection (LOD)) and detection limits are considered for
controlling false positive and negative detection assertions and are compared
to traditional limits computed assuming normal distributions.


title:
Hydrogen plasma exposure of In/ITO bilayers as an effective way for
  dispersing In nanoparticles

abstract:
  We address the production of indium nanoparticles (In NPs) from In thin films
thermally evaporated on both c-Si substrates and sputtered indium tin oxide
(ITO) as well as from sputtered ITO thin films, exposed to a hydrogen (H2)
plasma. On the one hand, we show that evaporated In thin films grow in
Volmer-Weber (VW) mode; H2 plasma reduces their surface oxide and substrate
annealing reshapes them from flat islands into spheres, without any remarkable
surface migration or coalescence. On the other hand, we studied the In NPs
formation on the ITO thin films and on In/ITO bilayer structures, by varying
the H2 plasma exposure time and the substrate temperature. This led us to
postulate that the main role of H2 plasma is to release In atoms from ITO
surface. At low substrate temperature (100{\deg}C), In NPs grow on ITO surface
via a solid phase VW mode, similar to evaporated In thin films, while at
300{\deg}C, small In droplets preferentially nucleate along the ITO grain
boundaries where ITO reduction rate and atomic diffusion coefficient are higher
compared with the ITO grain surface. As the droplets grow larger and connect
with each other, larger ones (1-2 um microns) are suddenly formed based on a
liquid phase growth-connection-coalescence process. This phenomenon is even
stronger in the case of In/ITO bilayer where the large In drops resulting from
the evaporated In connect with the smaller NPs resulting from ITO reduction and
rapidly merge into very large NPs (15 um)


title: Optical Flow Requires Multiple Strategies (but only one network)

abstract:
  We show that the matching problem that underlies optical flow requires
multiple strategies, depending on the amount of image motion and other factors.
We then study the implications of this observation on training a deep neural
network for representing image patches in the context of descriptor based
optical flow. We propose a metric learning method, which selects suitable
negative samples based on the nature of the true match. This type of training
produces a network that displays multiple strategies depending on the input and
leads to state of the art results on the KITTI 2012 and KITTI 2015 optical flow
benchmarks.


title: Affine translation hypersurfaces in Euclidean and isotropic spaces

abstract:
  In this paper, we extend the notion of affine translation surfaces introduced
by Liu and Yu (Proc. Japan Acad. Ser. A Math. Sci. 89, 111--113, 2013) in a
Euclidean space R^{3} to higher dimensional ambient spaces. We provide that an
affine translation hypersurface of constant Gauss-Kronocker curvature K_{0} in
R^{n+1} is a cylinder, i.e. K_{0}=0. As further applications we describe such
hypersurfaces in the isotropic spaces satisfying certain conditions on the
isotropic curvatures and the Laplacian.


title:
Peculiar objects towards 3FGL J0133.3+5930: an eclipsing Be star and an
  active galactic nucleus

abstract:
  Aims. We aim to contribute to the identification of unassociated gamma-ray
sources in the galactic plane in order to enlarge the currently known
population of gamma-ray binaries and related systems, such as radio emitting
X-ray binaries and microquasars. These objects are currently regarded as
excellent test beds for the understanding of high energy phenomena in stellar
systems. Methods. Potential targets of study are selected based on
cross-identification of the 3rd Fermi Large Area Telescope catalogue with
historical catalogues of luminous stars often found as optical counterparts in
known cases. Follow-up observations and analysis of multi-wavelength archival
data are later used to seek further proofs of association beyond the simple
positional agreement. Results. Current results enable us to present here the
case of the Fermi source 3FGL J0133.3+5930 where two peculiar objects have been
discovered inside its region of uncertainty. One of them is the star TYC
3683-985-1 (LS I +59 79) whose eclipsing binary nature is reported in this
work. The other one is the X-ray source SWIFT J0132.9+5932, that we found to be
a likely low-power Active Galactic Nucleus at z = 0:1143 \pm 0:0002. If this
second object is of blazar type, it could easily account for the observed
gamma-ray photon flux. However, this is not confirmed at present, thus
rendering still open the star system TYC 3683-985-1 as an alternative
counterpart candidate to the Fermi source.


title:
On real anti-bicanonical curves with one double point on the $4$-th real
  Hirzebruch surface. II

abstract:
  A real 2-elementary K3 surfaces of type ((3,1,1),- id) yields a real
anti-bicanonical curve s \cup A^\prime_1 (disjoint union) on the 4-th real
Hirzebruch surface F_4 where s is the exceptional section of F_4 and the real
curve A^\prime_1 has one real double point. We give a criterion (see
Proposition 2.4) which determines whether the real double point is degenerate
or not. One direction of the assertion of this proposition has already been
proved in Lemma 4.6 of the preceding paper [9] (2015) by the author. In this
paper we prove the inverse direction.


title: Physics objects for top quark physics in ATLAS

abstract:
  Top quark physics measurements performed using data from the ATLAS detector
at the LHC rely on efficient reconstruction and precise calibration of leptons,
jets and missing transverse energy. A review of the techniques used to
reconstruct such objects is given, with an emphasis on the uncertainties
achieved for energy calibration and efficiency measurements, illustrated with
their impact on key top quark physics results.


title:
Measurement of $\sigma_{\mathrm{ABS}}$ and $\sigma_{\mathrm{CX}}$ of
  $\pi^+$ on carbon by DUET

abstract:
  The DUET Collaboration reports on the measurements of the absorption
($\sigma_{\mathrm{ABS}}$) and charge exchange ($\sigma_{\mathrm{CX}}$) cross
sections of positively charged pions on carbon nuclei for the momentum range
201.6 MeV$/c$ to 295.1 MeV$/c$. The uncertainties on the absorption and charge
exchange cross sections are $\sim$9.5\% and $\sim$18\%, respectively. The
results are in good agreement with previous experiments. A covariance matrix
correlating the 5 $\sigma_{\mathrm{ABS}}$ and 5 $\sigma_{\mathrm{CX}}$ measured
data points is also reported


title: NIL geodesic triangles and their interior angle sums

abstract:
  In this paper we study the interior angle sums of geodesic triangles in
$\NIL$ geometry and prove that it can be larger, equal or less than $\pi$.
  We use for the computations the projective model of $\NIL$ introduced by E.
{Moln\'ar} in \cite{M97}.


title:
On the Linear Regime of the Characteristic formulation of General
  relativity in the Minkowski and Schwarzschild's Backgrounds

abstract:
  We present here the linear regime of the Einstein's field equations in the
characteristic formulation. Through a simple decomposition of the metric
variables in spin-weighted spherical harmonics, the field equations are
expressed as a system of coupled ordinary differential equations. The process
for decoupling them leads to a simple equation for $J$ - one of the Bondi-Sachs
metric variables - known in the literature as the master equation. Then, this
last equation is solved in terms of Bessel's functions of the first kind for
the Minkowski's background, and in terms of the Heun's function in the
Schwarzschild's case. In addition, when a matter source is considered, the
boundary conditions across the time-like world tubes bounding the source are
taken into account. These boundary conditions are computed for all multipole
modes. Some examples as the point particle binaries in circular and eccentric
orbits, in the Minkowski's background are shown as particular cases of this
formalism.


title: Spin breather and rogue formations in a Heisenberg ferromagnetic system

abstract:
  We construct explicit spin configurations for the breather solution of a
one-dimensional Heisenberg ferromagnetic spin system. This corresponds to the
breather soliton solution of the gauge equivalent nonlinear Schr\"{o}dinger
equation. There are three broad cases, wherein the solution shows distinct
behavior. Of particular interest to our study is the rogue behavior in spin
field terms.


title: Self-Stabilizing Maximal Matching and Anonymous Networks

abstract:
  We propose a self-stabilizing algorithm for computing a maximal matching in
an anonymous network. The complexity is $O(n^3)$ moves with high probability,
under the adversarial distributed daemon. In this algorithm, each node can
determine whether one of its neighbors points to it or to another node, leading
to a contradiction with the anonymous assumption. To solve this problem, we
provide under the classical link-register model, a self-stabilizing algorithm
that gives a unique name to a link such that this name is shared by both
extremities of the link.


title:
Relational Symplectic Groupoid Quantization for Constant Poisson
  Structures

abstract:
  As a detailed application of the BV-BFV formalism for the quantization of
field theories on manifolds with boundary, this note describes a quantization
of the relational symplectic groupoid for a constant Poisson structure. The
presence of mixed boundary conditions and the globalization of results is also
addressed. In particular, the paper includes an extension to space-times with
boundary of some formal geometry considerations in the BV-BFV formalism, and
specifically introduces into the BV-BFV framework a "differential" version of
the classical and quantum master equations. The quantization constructed in
this paper induces Kontsevich's deformation quantization on the underlying
Poisson manifold, i.e., the Moyal product, which is known in full details. This
allows focussing on the BV-BFV technology and testing it. For the unexperienced
reader, this is also a practical and reasonably simple way to learn it.


title: Linear combinations of factorials in binary recurrence sequences

abstract:
  Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence
with positive discriminant. In this paper, we consider the Diophantine equation
$u_m + u_n = a_1 n_1! + \cdots + a_k n_k!$ and prove that there are only
finitely many effectively computable terms which can be expressed as a sum of
factorials. Furthermore, we find the terms of the balancing sequences that can
be written as a sum of two factorials.


title:
Backpressure on the Backbone: A Lightweight, Non-intrusive Traffic
  Engineering Approach

abstract:
  The present study proposes a novel collaborative traffic engineering scheme
for networks of autonomous systems. Backpressure routing principles are used
for deriving priority routing rules that optimally stabilize a network, while
maximizing its throughput under latency considerations. The routing rules are
deployed to the network following simple SDN principles. The proposed scheme
requires minimal, infrequent interaction with a central controller, limiting
its imposed workload. Furthermore, it respects the internal structure of the
autonomous systems and their existing peering relations. In addition, it
co-exists smoothly with underlying distance vector-based routing schemes. The
proposed scheme combines simplicity with substantial gains in served transit
traffic volume, as shown by simulations in realistic setups and proven via
mathematical analysis.


title: Togliatti systems and Galois coverings

abstract:
  We study the homogeneous artinian ideals of the polynomial ring $K[x,y,z]$,
generated by the homogenous polynomials of degree $d$ which are invariant under
an action of the cyclic group $\mathbb Z/d\mathbb Z$, for any $d\geq 3$. We
prove that they are all monomial Togliatti systems, and that they are minimal
if the action is defined by a diagonal matrix having on the diagonal $(1, e,
e^a)$, where $e$ is a primitive $d$-th root of the unity. We get a complete
description when $d$ is prime or a power of a prime. We also establish the
relation of these systems with linear Ceva configurations.


title:
Relativistic Effects and Three-Nucleon Forces in Nuclear Matter and
  Nuclei

abstract:
  We review a large body of predictions obtained within the framework of
relativistic meson theory together with the Dirac-Brueckner-Hartree-Fock
approach to nuclear matter and finite nuclei. The success of this method has
been largely related to its ability to take into account important three-body
effects. Therefore, the overarching theme of this article is the interpretation
of the so-called "Dirac effects" as an effective three-nucleon force. We
address the equation of state of isospin symmetric and asymmetric nucleonic
matter and related issues, ranging from proton and neutron density
distributions to momentum distributions and short-range correlations. A central
part of the discussion is devoted to the optical model potential for
nucleon-nucleus scattering. We also take the opportunity to explore
similarities and differences with predictions based on the increasingly popular
chiral effective field theory.


title:
Critical Casimir force scaling functions of the two-dimensional Ising
  model at finite aspect ratios

abstract:
  We present a systematic method to calculate the universal scaling functions
for the critical Casimir force and the according potential of the
two-dimensional Ising model with various boundary conditions. Therefore we
start with the dimer representation of the corresponding partition function $Z$
on an $L\times M$ square lattice, wrapped around a torus with aspect ratio
$\rho=L/M$. By assuming periodic boundary conditions and translational
invariance in at least one direction, we systematically reduce the problem to a
$2\times2$ transfer matrix representation. For the torus we first reproduce the
results by Kaufman and then give a detailed calculation of the scaling
functions. Afterwards we present the calculation for the cylinder with open
boundary conditions. All scaling functions are given in form of combinations of
infinite products and integrals. Our results reproduce the known scaling
functions in the limit of thin films $\rho\to 0$. Additionally, for the
cylinder at criticality our results confirm the predictions from conformal
field theory.

categories: cond-mat.stat-mech hep-th math-ph math.MP


title:
Supersingular zeros of divisor polynomials of elliptic curves of prime
  conductor

abstract:
  For a prime number $p$ we study the zeros modulo $p$ of divisor polynomials
of rational elliptic curves $E$ of conductor $p$. Ono made the observation that
these zeros of are often $j$-invariants of supersingular elliptic curves over
$\overline{\mathbb{F}_p}$. We show that these supersingular zeros are in
bijection with zeros modulo $p$ of an associated quaternionic modular form
$v_E$.
  This allows us to prove that if the root number of $E$ is $-1$ then all
supersingular $j$-invariants of elliptic curves defined over $\mathbb{F}_{p}$
are zeros of the corresponding divisor polynomial.
  If the root number is $1$ we study the discrepancy between rank $0$ and
higher rank elliptic curves, as in the latter case the amount of supersingular
zeros in $\mathbb{F}_p$ seems to be larger. In order to partially explain this
phenomenon, we conjecture that when $E$ has positive rank the values of the
coefficients of $v_E$ corresponding to supersingular elliptic curves defined
over $\mathbb{F}_p$ are even. We prove this conjecture in the case when the
discriminant of $E$ is positive, and obtain several other results that are of
independent interest.


title:
Measurement of the inclusive electron spectrum from B meson decays and
  determination of |Vub|

abstract:
  Based on the full BaBar data sample of 466.5 million BBbar pairs, we present
measurements of the electron spectrum from semileptonic B meson decays. We fit
the inclusive electron spectrum to distinguish Cabibbo-Kobayashi-Maskawa (CKM)
suppressed B -> Xu e nu decays from the CKM-favored B -> Xc e nu decays, and
from various other backgrounds, and determine the total semileptonic branching
fraction BR(B -> X e nu) = (10.34 +- 0.04_stat +- 0.26_syst)%, averaged over
B+- and B0 mesons. We determine the spectrum and branching fraction for
charmless B -> Xu e nu decays and extract the CKM element |Vub|, by relying on
four different QCD calculations based on the heavy quark expansion. While
experimentally, the electron momentum region above 2.1GeV/c is favored, because
the background is relatively low, the uncertainties for the theoretical
predictions are largest in the region near the kinematic endpoint. Detailed
studies to assess the impact of these four predictions on the measurements of
the electron spectrum, the branching fraction, and the extraction of the CKM
matrix element |Vub| are presented, with the lower limit on the electron
momentum varied from 0.8GeV/c to the kinematic endpoint. We determine |Vub|
using each of these different calculations and find, |Vub| = (3.794 +-
0.107_exp +0.292-0.219_SF +0.078-0.068_theory)*10^{-3} (De Fazio and Neubert),
(4.563 +- 0.126_exp +0.230-0.208_SF +0.162-0.163_theory)*10^{-3} (Bosh, Lange,
Neubert, and Paz), (3.959 +- 0.104_exp +0.164-0.154_SF
+0.042-0.079_theory)*10^{-3} (Gambino, Giordano, Ossola, and Uraltsev), (3.848
+- 0.108_exp +0.084-0.070_theory)*10^{-3} (dressed gluon exponentiation), where
the stated uncertainties refer to the experimental uncertainties of the partial
branching fraction measurement, the shape function parameters, and the
theoretical calculations.


title:
Hayabusa-2 Mission Target Asteroid 162173 Ryugu (1999 JU3): Searching
  for the Object's Spin-Axis Orientation

abstract:
  The JAXA Hayabusa-2 mission was approved in 2010 and launched on December 3,
2014. The spacecraft will arrive at the near-Earth asteroid 162173 Ryugu in
2018 where it will perform a survey, land and obtain surface material, then
depart in Dec 2019 and return to Earth in Dec 2020. We observed Ryugu with the
Herschel Space Observatory in Apr 2012 at far-IR thermal wavelengths, supported
by several ground-based observations to obtain optical lightcurves. We
reanalysed previously published Subaru-COMICS and AKARI-IRC observations and
merged them with a Spitzer-IRS data set. In addition, we used a large set of
Spitzer-IRAC observations obtained in the period Jan to May, 2013. The data set
includes two complete rotational lightcurves and a series of ten
"point-and-shoot" observations. The almost spherical shape of the target
together with the insufficient lightcurve quality forced us to combine
radiometric and lightcurve inversion techniques in different ways to find the
object's key physical and thermal parameters. We find that the solution which
best matches our data sets leads to this C class asteroid having a retrograde
rotation with a spin-axis orientation of (lambda = 310-340 deg; beta = -40+/-15
deg) in ecliptic coordinates, an effective diameter (of an equal-volume sphere)
of 850 to 880 m, a geometric albedo of 0.044 to 0.050 and a thermal inertia in
the range 150 to 300 Jm-2s-0.5K-1. Based on estimated thermal conductivities of
the top-layer surface in the range 0.1 to 0.6 WK-1m-1, we calculated that the
grain sizes are approximately equal to between 1 and 10 mm. The finely
constrained values for this asteroid serve as a `design reference model', which
is currently used for various planning, operational and modelling purposes by
the Hayabusa2 team.


title: Towards Adaptive Compliance

abstract:
  Mission critical software is often required to comply with multiple
regulations, standards or policies. Recent paradigms, such as cloud computing,
also require software to operate in heterogeneous, highly distributed, and
changing environments. In these environments, compliance requirements can vary
at runtime and traditional compliance management techniques, which are normally
applied at design time, may no longer be sufficient. In this paper, we motivate
the need for adaptive compliance by illustrating possible compliance concerns
determined by runtime variability. We further motivate our work by means of a
cloud computing scenario, and present two main contributions. First, we propose
and justify a process to support adaptive compliance that ex- tends the
traditional compliance management lifecycle with the activities of the
Monitor-Analyse-Plan-Execute (MAPE) loop, and enacts adaptation through
re-configuration. Second, we explore the literature on software compliance and
classify existing work in terms of the activities and concerns of adaptive
compliance. In this way, we determine how the literature can support our
proposal and what are the open research challenges that need to be addressed in
order to fully support adaptive compliance.


title:
Asymptotic expansions of some Toeplitz determinants via the topological
  recursion

abstract:
  In this article, we study the large $n$ asymptotic expansions of $n\times n$
Toeplitz determinants whose symbols are indicator functions of unions of
arc-intervals of the unit circle. In particular, we use an Hermitian matrix
model reformulation of the problem to provide a rigorous derivation of the
general form of the large $n$ expansion when the symbol is an indicator
function of either a single arc-interval or several arc-intervals with a
discrete rotational symmetry. Moreover, we prove that the coefficients in the
expansions can be reconstructed, up to some constants, from the Eynard-Orantin
topological recursion applied to some explicit spectral curves. In addition,
when the symbol is an indicator function of a single arc-interval, we provide
the corresponding normalizing constants using a Selberg integral and illustrate
the theoretical results with numeric simulations up to order
$o\left(\frac{1}{n^4}\right)$. We also briefly discuss the situation when the
number of arc-intervals increases with $n$, as well as more general Toeplitz
determinants to which we may apply the present strategy.


title:
Local Well-Posedness for the Derivative Nonlinear Schr\"odinger Equation
  in Besov spaces

abstract:
  It is shown that the cubic derivative nonlinear Schr\"odinger equation is
locally well-posed in Besov spaces $B^{s}_{2,\infty}(\mathbb X)$,
$s\ge\tfrac12$, where we treat the non-periodic setting $\mathbb X=\mathbb R$
and the periodic setting $\mathbb X=\mathbb T$ simultaneously. The proof is
based on the strategy of Herr for initial data in $H^{s}(\mathbb T)$,
$s\ge\tfrac12$.


title: Stein fillings and SU(2) representations

abstract:
  We recently defined invariants of contact 3-manifolds using a version of
instanton Floer homology for sutured manifolds. In this paper, we prove that if
several contact structures on a 3-manifold are induced by Stein structures on a
single 4-manifold with distinct Chern classes modulo torsion then their contact
invariants in sutured instanton homology are linearly independent. As a
corollary, we show that if a 3-manifold bounds a Stein domain that is not an
integer homology ball then its fundamental group admits a nontrivial
homomorphism to SU(2). We give several new applications of these results,
proving the existence of nontrivial and irreducible SU(2) representations for a
variety of 3-manifold groups.


title: Lie systems and Schr\"odinger equations

abstract:
  We prove that $t$-dependent Schr\"odinger equations on finite-dimensional
Hilbert spaces determined by $t$-dependent Hermitian Hamiltonian operators can
be described through Lie systems admitting a Vessiot--Guldberg Lie algebra of
K\"ahler vector fields. This result is extended to other related Schr\"odinger
equations, e.g. projective ones, and their properties are studied through
Poisson, presymplectic and K\"ahler structures. This leads to derive nonlinear
superposition rules for them depending in a lower (or equal) number of
solutions than standard linear ones. Special attention is paid to applications
in $n$-qubit systems.


title:
A speciality Theorem for curves in $\mathbb{P}^5$ contained in
  Noether-Lefschetz general fourfolds

abstract:
  Let $C\subset \mathbb P^r$ be an integral projective curve. We define the
speciality index $e(C)$ of $C$ as the maximal integer $t$ such that
$h^0(C,\omega_C(-t))>0$, where $\omega_C$ denotes the dualizing sheaf of $C$.
In the present paper we consider $C\subset \mathbb P^5$ an integral degree $d$
curve and we denote by $s$ the minimal degree for which there exists a
hypersurface of degree $s$ containing $C$. We assume that $C$ is contained in
two smooth hypersurfaces $F$ and $G$, with $deg(F)=n>k=deg (G)$. We assume
additionally that $F$ is Noether-Lefschetz general, i.e. that the $2$-th
N\'eron-Severi group of $F$ is generated by the linear section class. Our main
result is that in this case the speciality index is bounded as $e(C)\leq
{\frac{d}{snk}}+s+n+k-6.$ Moreover equality holds if and only if $C$ is a
complete intersection of $T:=F\cap G$ with hypersurfaces of degrees $s$ and
${\frac{d}{snk}}$.


title: Solving xz=yy in certain subsets of finite groups

abstract:
  We show that if G is a finite group and A is a subset of G with no
non-trivial solutions to xz=yy then |A| < |G|/(log log |G|)^c.


title: Minor complexities of finite operations

abstract:
  In this paper we present a new class of complexity measures, induced by a new
data structure for representing $k$-valued functions (operations), called minor
decision diagram. The results are presented in terms of Multi-Valued Logic
circuits (MVL-circuits), ordered decision diagrams, formulas and minor
decomposition trees.
  When assigning values to some variables in a function $f$ the resulting
function is a subfunction of $f$, and when identifying some variables the
resulting function is a minor of $f$. A set $M$ of essential variables in $f$
is separable if there is a subfunction of $f$, whose set of essential variables
is $M$. The essential arity gap $gap(f)$ of the function $f$ is the minimum
number of essential variables in $f$ which become fictive when identifying
distinct essential variables in $f$. We prove that, if a function $f$ has
non-trivial arity gap ($gap(f)\ge 2$), then all sets of essential variables in
$f$ are separable. We define equivalence relations which classify the functions
of $k$-valued logic into classes with the same minor complexities. These
relations induce transformation groups which are compared with the subgroups of
the restricted affine group (RAG) and the groups determined by the equivalence
relations with respect to the subfunctions, implementations and separable sets
in functions. These methods provide a detailed classification of $n$-ary
$k$-valued functions for small values of $n$ and $k$.


title: Topological defects with power-law tails

abstract:
  We study interactions of kinks and antikinks of the $(1+1)$-dimensional
$\varphi^8$ model. In this model, there are kinks with mixed tail asymptotics:
power-law behavior at one infinity versus exponential decay towards the other.
We show that if a kink and an antikink face each other in way such that their
power-law tails determine the kink--antikink interaction, then the force of
their interaction decays slowly, as some negative power of distance between
them. We estimate the force numerically using the collective coordinate
approximation, and analytically via Manton's method (making use of formulas
derived for the kink and antikink tail asymptotics).

categories: nlin.PS cond-mat.mtrl-sci hep-th math-ph math.MP


title: Phenomenology of Standard Model in spontaneously broken mirror symmetry

abstract:
  Violated mirror symmetry (MS) is capable of reproducing observed qualitative
properties of weak mixing for quarks and leptons. In violated MS, lepton
phenomenology, that is, small neutrino masses and mixing properties different
from those of quarks, requires the Dirac nature of neutrinos and existence of
processes that change the total lepton number. Such processes involve heavy
mirror neutrinos, and therefore occur at very high energies. CP
non-conservation would mean here that the parity conserving MS Lagrangian must
be non-invariant to both time reversal T and (according to the CPT theorem) the
charge conjugation C. All these properties create appropriate conditions for
leptogenesis, a mechanism for generating baryon-lepton asymmetry of the
Universe in violated MS models.


title:
Water on BN doped benzene: A hard test for exchange-correlation
  functionals and the impact of exact exchange on weak binding

abstract:
  Density functional theory (DFT) studies of weakly interacting complexes have
recently focused on the importance of van der Waals dispersion forces whereas,
the role of exchange has received far less attention. Here, by exploiting the
subtle binding between water and a boron and nitrogen doped benzene derivative
(1,2-azaborine) we show how exact exchange can alter the binding conformation
within a complex. Benchmark values have been calculated for three orientations
of the water monomer on 1,2-azaborine from explicitly correlated quantum
chemical methods, and we have also used diffusion quantum Monte Carlo. For a
host of popular DFT exchange-correlation functionals we show that the lack of
exact exchange leads to the wrong lowest energy orientation of water on
1,2-azaborine. As such, we suggest that a high proportion of exact exchange and
the associated improvement in the electronic structure could be needed for the
accurate prediction of physisorption sites on doped surfaces and in complex
organic molecules. Meanwhile to predict correct absolute interaction energies
an accurate description of exchange needs to be augmented by dispersion
inclusive functionals, and certain non-local van der Waals functionals (optB88-
and optB86b-vdW) perform very well for absolute interaction energies. Through a
comparison with water on benzene and borazine (B$_3$N$_3$H$_6$) we show that
these results could have implications for the interaction of water with doped
graphene surfaces, and suggest a possible way of tuning the interaction energy.


title: Some properties of Grauert type surfaces

abstract:
  In a previous work, we classified weakly complete surfaces which admit a real
analytic plurisubharmonic exhaustion function; we showed that, if they are not
proper over a Stein space, then they admit a pluriharmonic function, with
compact Levi-flat level sets foliated with dense complex leaves. We called
these Grauert type surfaces. In this note we investigate some properties of
these surfaces. Namely, we prove that the only compact curves that can be
contained in them are negative in the sense of Grauert and that the level sets
of the pluriharmonic function are connected, thus completing the analogy with
the Remmert-Stein reduction of a holomorphically convex space. Moreover, in our
classification Theorem, we had to pass to a double cover to produce the
pluriharmonic function; the last part of the present paper is devoted to the
construction of an example where it is necessary to do so.


title: Fictitious play for cooperative action selection in robot teams

abstract:
  A game theoretic distributed decision making approach is presented for the
problem of control effort allocation in a robotic team based on a novel variant
of fictitious play. The proposed learning process allows the robots to
accomplish their objectives by coordinating their actions in order to
efficiently complete their tasks. In particular, each robot of the team
predicts the other robots' planned actions while making decisions to maximise
their own expected reward that depends on the reward for joint successful
completion of the task. Action selection is interpreted as an $n$-player
cooperative game. The approach presented can be seen as part of the
\emph{Belief Desire Intention} (BDI) framework, also can address the problem of
cooperative, legal, safe, considerate and emphatic decisions by robots if their
individual and group rewards are suitably defined. After theoretical analysis
the performance of the proposed algorithm is tested on four simulation
scenarios. The first one is a coordination game between two material handling
robots, the second one is a warehouse patrolling task by a team of robots, the
third one presents a coordination mechanism between two robots that carry a
heavy object on a corridor and the fourth one is an example of coordination on
a sensors network.


title:
Engineering electronic states of periodic and quasiperiodic chains by
  buckling

abstract:
  The spectrum of spinless, non-interacting electrons on a linear chain that is
buckled in a non- uniform manner giving it a flavor of a topologically
disordered lattice, is investigated within a tight binding formalism. We have
addressed two specific cases, viz., a perfectly periodic chain wrinkled in a
quasiperiodic Fibonacci pattern, and a quasiperiodic Fibonacci chain, where the
buckling also takes place in a Fibonacci pattern. The buckling brings distant
neighbors in the parent chain to close proximity, which is simulated by a
tunnel hopping amplitude. It is seen that, in the perfectly ordered case,
increasing the strength of the tunnel hopping (that is, bending the segments
more) absolutely continuous density of states is retained towards the edges of
the band, while the central portion becomes fragmented and host subbands of
narrowing widths containing extended, current carrying states, and multiple
isolated bound states formed as a result of the bending. A switching on and off
of the electronic transmission can thus be engineered by buckling. On the other
hand, in the second example of a quasiperiodic Fibonacci chain, imparting a
quasiperiodic buckling is found to generate continuous subband(s) destroying
the usual multifractality of the energy spectrum. We present exact results
based on a real space renormalization group analysis, that is corroborated by
explicit calculation of the two terminal electronic transport.


title: Stream Packing for Asynchronous Multi-Context Systems using ASP

abstract:
  When a processing unit relies on data from external streams, we may face the
problem that the stream data needs to be rearranged in a way that allows the
unit to perform its task(s). On arrival of new data, we must decide whether
there is sufficient information available to start processing or whether to
wait for more data. Furthermore, we need to ensure that the data meets the
input specification of the processing step. In the case of multiple input
streams it is also necessary to coordinate which data from which incoming
stream should form the input of the next process instantiation. In this work,
we propose a declarative approach as an interface between multiple streams and
a processing unit. The idea is to specify via answer-set programming how to
arrange incoming data in packages that are suitable as input for subsequent
processing. Our approach is intended for use in asynchronous multi-context
systems (aMCSs), a recently proposed framework for loose coupling of knowledge
representation formalisms that allows for online reasoning in a dynamic
environment. Contexts in aMCSs process data streams from external sources and
other contexts.


title: Computational tameness of classical non-causal models

abstract:
  We show that the computational power of the non-causal circuit model, i.e.,
the circuit model where the assumption of a global causal order is replaced by
the assumption of logical consistency, is completely characterized by the
complexity class~$\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$.
An example of a problem in that class is factorization. Our result implies that
classical deterministic closed timelike curves (CTCs) cannot efficiently solve
problems that lie outside of that class. Thus, in stark contrast to other CTC
models, these CTCs cannot efficiently
solve~$\operatorname{\mathsf{NP-complete}}$ problems,
unless~$\operatorname{\mathsf{NP}}=\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}=\operatorname{\mathsf{coNP}}$,
which lets their existence in nature appear less implausible. This result gives
a new characterization
of~$\operatorname{\mathsf{UP}}\cap\operatorname{\mathsf{coUP}}$ in terms of
fixed points.


title: Data Minimisation: a Language-Based Approach (Long Version)

abstract:
  Data minimisation is a privacy-enhancing principle considered as one of the
pillars of personal data regulations. This principle dictates that personal
data collected should be no more than necessary for the specific purpose
consented by the user. In this paper we study data minimisation from a
programming language perspective. We assume that a given program embodies the
purpose of data collection, and define a data minimiser as a pre-processor for
the input which reduces the amount of information available to the program
without compromising its functionality. In this context we study formal
definitions of data minimisation, present different mechanisms and
architectures to ensure data minimisation, and provide a procedure to
synthesise a correct data minimiser for a given program.


title: Scalar QCD at nonzero density

abstract:
  We study scalar QCD at nonzero density in the strong coupling limit. It has a
sign problem which looks structurally similar to the one in QCD. We show first
data for the reweighting factor. After introducing dual variables by
integrating out the SU(3) gauge links, we find that at least 3 flavors are
needed for a nontrivial dependence on the chemical potential. In this dual
representation there is no sign problem remaining. The dual variables are
partially constrained, thus we propose to use a hybrid approach for the
updates: For unconstrained variables local updates can be used, while for
constrained variables using updates based on the worm algorithm is more
promising.


title: Inverting The Generator Of A Generative Adversarial Network

abstract:
  Generative adversarial networks (GANs) learn to synthesise new samples from a
high-dimensional distribution by passing samples drawn from a latent space
through a generative network. When the high-dimensional distribution describes
images of a particular data set, the network should learn to generate visually
similar image samples for latent variables that are close to each other in the
latent space. For tasks such as image retrieval and image classification, it
may be useful to exploit the arrangement of the latent space by projecting
images into it, and using this as a representation for discriminative tasks.
GANs often consist of multiple layers of non-linear computations, making them
very difficult to invert. This paper introduces techniques for projecting image
samples into the latent space using any pre-trained GAN, provided that the
computational graph is available. We evaluate these techniques on both MNIST
digits and Omniglot handwritten characters. In the case of MNIST digits, we
show that projections into the latent space maintain information about the
style and the identity of the digit. In the case of Omniglot characters, we
show that even characters from alphabets that have not been seen during
training may be projected well into the latent space; this suggests that this
approach may have applications in one-shot learning.


title:
Metal-insulator transition in a strongly-correlated two-dimensional
  electron system

abstract:
  Experimental results on the metal-insulator transition and related phenomena
in strongly interacting two-dimensional electron systems are discussed. Special
attention is given to recent results for the strongly enhanced spin
susceptibility, effective mass, and thermopower in low-disordered silicon
MOSFETs.


title: Online and Dynamic Algorithms for Set Cover

abstract:
  In this paper, we study the set cover problem in the fully dynamic model. In
this model, the set of active elements, i.e., those that must be covered at any
given time, can change due to element arrivals and departures. The goal is to
maintain an algorithmic solution that is competitive with respect to the
current optimal solution. This model is popular in both the dynamic algorithms
and online algorithms communities. The difference is in the restriction placed
on the algorithm: in dynamic algorithms, the running time of the algorithm
making updates (called update time) is bounded, while in online algorithms, the
number of updates made to the solution (called recourse) is limited.
  In this paper we show the following results: In the update time setting, we
obtain O(log n)-competitiveness with O(f log n) amortized update time, and
O(f^3)-competitiveness with O(f^2) update time. The O(log n)-competitive
algorithm is the first one to achieve a competitive ratio independent of f in
this setting. In the recourse setting, we show a competitive ratio of O(min{log
n,f}) with constant amortized recourse. Note that this matches the best offline
bounds with just constant recourse, something that is impossible in the
classical online model.
  Our results are based on two algorithmic frameworks in the fully-dynamic
model that are inspired by the classic greedy and primal-dual algorithms for
offline set cover. We show that both frameworks can be used for obtaining both
recourse and update time bounds, thereby demonstrating algorithmic techniques
common to these strands of research.


title: Rigid cohomology via the tilting equivalence

abstract:
  We define a de Rham cohomology theory for analytic varieties over a valued
field $K^\flat$ of equal characteristic $p$ with coefficients in a chosen
untilt of the perfection of $K^\flat$ by means of the motivic version of
Scholze's tilting equivalence. We show that this definition generalizes the
usual rigid cohomology in case the variety has good reduction. We also prove a
conjecture of Ayoub yielding an equivalence between rigid analytic motives with
good reduction and unipotent algebraic motives over the residue field, also in
mixed characteristic.


title: Charm quark mass determined from a pair of sum rules

abstract:
  In this paper, we present preliminary results of the determination of the
charm quark mass $\hat{m}_c$ from QCD sum rules of moments of the vector
current correlator calculated in perturbative QCD at ${\cal O} (\hat
\alpha_s^3)$. Self-consistency between two different sum rules allow to
determine the continuum contribution to the moments without requiring
experimental input, except for the charm resonances below the continuum
threshold. The existing experimental data from the continuum region is used,
then, to confront the theoretical determination and reassess the theoretic
uncertainty.


title: Performance of the PADME calorimeter prototype at the DA$\Phi$NE BTF

abstract:
  The PADME experiment at the DA$\Phi$NE Beam-Test Facility (BTF) aims at
searching for invisible decays of the dark photon by measuring the final state
missing mass in the process $e^+e^- \to \gamma+ A'$, with $A'$ undetected. The
measurement requires the determination of the 4-momentum of the recoil photon,
performed using a homogeneous, highly segmented BGO crystals calorimeter. We
report the results of the test of a 5$\times$5 crystals prototype performed
with an electron beam at the BTF in July 2016.


title: Symmetry, Geometry, and Quantization with Hypercomplex Numbers

abstract:
  These notes describe some links between the group
$\mathrm{SL}_2(\mathbb{R})$, the Heisenberg group and hypercomplex
numbers---complex, dual and double numbers. Relations between quantum and
classical mechanics are clarified in this framework. In particular, classical
mechanics can be obtained as a theory with noncommutative observables and a
non-zero Planck constant if we replace complex numbers in quantum mechanics by
dual numbers. Our consideration is based on induced representations which are
build from complex-/dual-/double-valued characters. Dynamic equations, rules of
additions of probabilities, ladder operators and uncertainty relations are
discussed. Finally, we prove a Calder\'on--Vaillancourt-type norm estimation
for relative convolutions.

categories: math-ph math.CV math.MP math.RT quant-ph


title: A Theory of Available-by-Design Communicating Systems

abstract:
  Choreographic programming is a programming-language design approach that
drives error-safe protocol development in distributed systems. Starting from a
global specification (choreography) one can generate distributed
implementations. The advantages of this top-down approach lie in the
correctness-by-design principle, where implementations (endpoints) generated
from a choreography behave according to the strict control flow described in
the choreography, and do not deadlock. Motivated by challenging scenarios in
Cyber-Physical Systems (CPS), we study how choreographic programming can cater
for dynamic infrastructures where not all endpoints are always available. We
introduce the Global Quality Calculus ($GC_q$), a variant of choreographic
programming for the description of communication systems where some of the
components involved in a communication might fail. GCq features novel operators
for multiparty, partial and collective communications. This paper studies the
nature of failure-aware communication: First, we introduce $GC_q$ syntax,
semantics and examples of its use. The interplay between failures and
collective communications in a choreography can lead to choreographies that
cannot progress due to absence of resources. In our second contribution, we
provide a type system that ensures that choreographies can be realized despite
changing availability conditions. A specification in $GC_q$ guides the
implementation of distributed endpoints when paired with global (session)
types. Our third contribution provides an endpoint-projection based methodology
for the generation of failure-aware distributed processes. We show the
correctness of the projection, and that well-typed choreographies with
availability considerations enjoy progress.


title:
Existence and Non-Existence Results for Strong External Difference
  Families

abstract:
  We consider strong external difference families (SEDFs); these are external
difference families satisfying additional conditions on the patterns of
external diferences that occur, and were first defined in the context of
classifying optimal strong algebraic manipulation detection codes. We establish
new necessary conditions for the existence of (n; m; k; lambda)-SEDFs; in
particular giving a near-complete treatment of the lambda = 2 case. For the
case m = 2, we obtain a structural characterization for partition type SEDFs
(of maximum possible k and lambda), showing that these correspond to Paley
partial difference sets. We also prove a version of our main result for
generalized SEDFs, establishing non-trivial necessary conditions for their
existence.


title:
Iterative Channel Estimation Using LSE and Sparse Message Passing for
  MmWave MIMO Systems

abstract:
  We propose an iterative channel estimation algorithm based on the Least
Square Estimation (LSE) and Sparse Message Passing (SMP) algorithm for the
Millimeter Wave (mmWave) MIMO systems. The channel coefficients of the mmWave
MIMO are approximately modeled as a Bernoulli-Gaussian distribution and the
channel matrix is sparse with only a few non-zero entries. By leveraging the
advantage of sparseness, we propose an algorithm that iteratively detects the
exact locations and values of non-zero entries of the sparse channel matrix. At
each iteration, the locations are detected by the SMP, and values are estimated
with the LSE. We also analyze the Cram\'er-Rao Lower Bound (CLRB), and show
that the proposed algorithm is a minimum variance unbiased estimator under the
assumption that we have the partial priori knowledge of the channel.
Furthermore, we employ the Gaussian approximation for message densities under
density evolution to simplify the analysis of the algorithm, which provides a
simple method to predict the performance of the proposed algorithm. Numerical
experiments show that the proposed algorithm has much better performance than
the existing sparse estimators, especially when the channel is sparse. In
addition, our proposed algorithm converges to the CRLB of the genie-aided
estimation of sparse channels with only five turbo iterations.


title: Calibrating photon counts from a single image

abstract:
  Current methods for detector gain calibration require acquisition of tens of
special calibration images. Here we propose a method that obtains the gain from
the actual image for which the photon count is desired by quantifying
out-of-band information. We show on simulation and experimental data that our
much simpler procedure, which can be retroactively applied to any image, is
comparable in precision to traditional gain calibration procedures.


title: A characterization of $\mathbb{Z}_2\mathbb{Z}_2[u]$-linear codes

abstract:
  We prove that the class of $\Z_2\Z_2[u]$-linear codes is exactly the class of
$\Z_2$-linear codes with automorphism group of even order. Using this
characterization, we give examples of known codes, e.g. perfect codes, which
has a nontrivial $\Z_2\Z_2[u]$ structure. We also exhibit an example of a
$\Z_2$-linear code which is not $\Z_2\Z_2[u]$-linear. Also, we state that
duality of $\Z_2\Z_2[u]$-linear codes is the same that duality of $\Z_2$-linear
codes.
  Finally, we prove that the class of $\Z_2\Z_4$-linear codes which are also
$\Z_2$-linear is strictly contained in the class of $\Z_2\Z_2[u]$-linear codes.


title: Swap Equilibria under Link and Vertex Destruction

abstract:
  We initiate the study of the \emph{destruction model} (\aka \emph{adversary
model}) introduced by Kliemann (2010), using the stability concept of
\emph{swap equilibrium} introduced by Alon et. al (2010). The destruction model
is a network formation game incorporating the robustness of a network under a
more or less targeted attack. In addition to bringing in the swap equilibrium
(SE) concept, we extend the model from an attack on the edges of the network to
an attack on its vertices. Vertex destruction can generally cause more harm and
tends to be more difficult to analyze.
  We prove structural results and linear upper bounds or super-linear lower
bounds on the social cost of SE under different attack scenarios. The most
complex case is when the vertex to be destroyed is chosen uniformly at random
from the set of those vertices where each causes a maximum number of player
pairs to be separated (called a max-sep vertex). We prove a lower bound on the
social cost of $\Omega(n^{3/2})$ for this case and initiate an understanding of
the structural properties of SE in this scenario. Namely, we prove that there
is no SE that is a tree and has only one max-sep vertex. We conjecture that
this result can be generalized, in particular we conjecture that there is no SE
that is a tree. On the other hand, we prove that if the vertex to be destroyed
is chosen uniformly at random from the set of \emph{all} vertices, then each SE
is a tree (unless it is two-connected). Our conjecture would imply that moving
from the uniform probability measure to a measure concentrated on the max-sep
vertices, means moving from no SE having a cycle (unless two-connected) to each
SE having a cycle. This would ask for a more detailed study of this transition
in future work.


title:
Decoupling absorption and emission processes in super-resolution
  localization of emitters in a plasmonic hotspot

abstract:
  The absorption process of an emitter close to a plasmonic antenna is enhanced
due to strong local electromagnetic (EM) fields. The emission process, if
resonant with the plasmonic system, re-radiates to the far-field by coupling
with the antenna due to the availability of plasmonic states. This increases
the local density of states (LDOS), effectively providing more, or alternate,
pathways for emission. Through the mapping of localized emission events from
single molecules close to plasmonic antennas, performed using far-field data,
one gains combined information on both the local EM field strength and the LDOS
available. The localization from these emission-coupled events generally do
not, therefore, report the real position of the molecules, nor the EM
enhancement distribution at the illuminating wavelength. Here we propose the
use of a large Stokes shift fluorescent molecule in order to spectrally
decouple the emission process of the dye from the plasmonic system, leaving
only the absorption strongly in resonance with the enhanced EM field in the
antennas vicinity. We show that the real position of the emitters in this
complex, but interesting, scenario can be found directly. Moreover, we
demonstrate that this technique provides an effective way of exploring either
the EM field or the LDOS with nanometre spatial resolution.


title: A Spectrahedral Representation for Polar Orbitopes

abstract:
  Let $G$ be a Lie group with real semisimple Lie algebra $\mathfrak{g}$.
Further let $\mathfrak{g} = \mathfrak{k} \oplus \mathfrak{p}$ be a Cartan
decomposition. The maximal compact subgroup $K \subseteq G$ acts on
$\mathfrak{p}$ via the adjoint representation and the convex hulls of the
resulting orbits are the polar orbitopes. We prove that every polar orbitope is
a spectrahedron by giving an explicit representation. In addition we give a new
proof for the fact that the faces of a polar orbitope are, up to conjugation,
given by the faces of the momentum polytope.


title: Cluster Monte Carlo and dynamical scaling for long-range interactions

abstract:
  Many spin systems affected by critical slowing down can be efficiently
simulated using cluster algorithms. Where such systems have long-range
interactions, suitable formulations can additionally bring down the
computational effort for each update from O($N^2$) to O($N\ln N$) or even
O($N$), thus promising an even more dramatic computational speed-up. Here, we
review the available algorithms and propose a new and particularly efficient
single-cluster variant. The efficiency and dynamical scaling of the available
algorithms are investigated for the Ising model with power-law decaying
interactions.


title: The Matrix Chain Algorithm to Compile Linear Algebra Expressions

abstract:
  The matrix chain problem consists in finding the parenthesization of a matrix
product $M := A_1 A_2 \cdots A_n$ that minimizes the number of scalar
operations. In practical applications, however, one frequently encounters more
complicated scenarios, where expressions involve transposition, inversion,
matrices with given properties, and sequences. The computation of such
expressions makes use of a set of computational kernels that offer
functionality well beyond the simple matrix product. The challenge then shifts
from finding an optimal parenthesization to finding an optimal mapping of the
input expression to the available kernels. Furthermore, it is often the case
that a solution based on the minimization of scalar operations does not result
in the optimal solution in terms of execution time, and/or might be numerically
unstable. In this paper, we introduce a number of generalizations of the matrix
chain problem--including kernels, properties, sequences, and cost
functions--and present corresponding algorithmic solutions.
  The motivation for this work comes from the fact that--despite great advances
in the development of compilers--the task of mapping linear algebra problems to
optimized kernels is still to be done manually. In order to relieve the user
from this complex task, new techniques for the compilation of linear algebra
expressions have to be developed.


title: Colossal enhancement of electrical conductivity in Y2Ir2O7 nanoparticles

abstract:
  We present a comparative study of the magnetic and electrical properties of
polycrystalline and nanocrystalline Y2Ir2O7, the latter prepared using a new
chemical route. We find that reduction in particle size leads to enhanced
ferromagnetism and orders of magnitude enhancement of electrical conductivity
in the nanocrystalline sample. Based on x ray photoelectron spectroscopy and x
ray absorption near edge structure spectroscopy results, the phenomenon is
attributed to the increased fraction of pentavalent oxidation state of Iridium
and the resulting increase in double exchange interaction along with the
weakening of spin orbit coupling strength in the nanocrystalline sample
compared to the bulk.


title: The multiple holomorph of a finitely generated abelian group

abstract:
  W.H.~Mills has determined, for a finitely generated abelian group $G$, the
regular subgroups $N \cong G$ of $S(G)$, the group of permutations on the set
$G$, which have the same holomorph of $G$, that is, such that $N_{S(G)}(N) =
N_{S(G)}(\rho(G))$, where $\rho$ is the (right) regular representation.
  We give an alternative approach to Mills' result, which relies on a
characterization of the regular subgroups of $N_{S(G)}(\rho(G))$ in terms of
commutative ring structures on $G$.
  We are led to solve, for the case of a finitely generated abelian group $G$,
the following problem: given an abelian group $(G, +)$, what are the
commutative ring structures $(G, +, \cdot)$ such that all automorphism of $G$
as a group are also automorphisms of $G$ as a ring?


title:
$\mathcal{R}$-sectoriality of higher-order elliptic systems on general
  bounded domains

abstract:
  On bounded domains $\Omega \subset \mathbb{R}^d , d \geq 2$, reaching far
beyond the scope of Lipschitz domains, we consider an elliptic system of order
$2 m$ in divergence form with complex $\mathrm{L}^{\infty}$-coefficients
complemented with homogeneous mixed Dirichlet/Neumann boundary conditions. We
prove that the $\mathrm{L}^p$-realization of the corresponding operator $A$ is
$\mathcal{R}$-sectorial of angle $\omega \in [0 , \frac{\pi}{2})$, where in the
case $2m < d$, $p \in (\frac{2d}{d + 2 m} - \varepsilon , \frac{2d}{d - 2 m} +
\varepsilon)$ for some $\varepsilon > 0$, and where $p \in (1 , \infty)$ in the
case $2m \geq d$. To perform this proof, we generalize the
$\mathrm{L}^p$-extrapolation theorem of Shen to the Banach space valued setting
and to arbitrary Lebesgue-measurable underlying sets.


title: Learning to detect and localize many objects from few examples

abstract:
  The current trend in object detection and localization is to learn
predictions with high capacity deep neural networks trained on a very large
amount of annotated data and using a high amount of processing power. In this
work, we propose a new neural model which directly predicts bounding box
coordinates. The particularity of our contribution lies in the local
computations of predictions with a new form of local parameter sharing which
keeps the overall amount of trainable parameters low. Key components of the
model are spatial 2D-LSTM recurrent layers which convey contextual information
between the regions of the image. We show that this model is more powerful than
the state of the art in applications where training data is not as abundant as
in the classical configuration of natural images and Imagenet/Pascal VOC tasks.
We particularly target the detection of text in document images, but our method
is not limited to this setting. The proposed model also facilitates the
detection of many objects in a single image and can deal with inputs of
variable sizes without resizing.


title: Two new high energy gamma-ray blazar candidates

abstract:
  We report the detection of two new gamma-ray sources in the Fermi-LAT sky
(Pass 8) at energies higher than 20 GeV, and confirmed at lower energies, using
a source detection tool based on the Minimum Spanning Tree algorithm. One of
these sources, at a Galactic latitude of about -4{\deg}, is a new discovery,
while the other was previously reported above 50 GeV in the 2FHL catalogue. We
searched for archival multi-wavelength data of possible counterparts and found
interesting candidates. Both objects are radio sources and their WISE infrared
colours are typical of blazars. While for the former source no optical spectra
are available, for the latter a puzzling optical spectrum corresponding to a
white dwarf star is found in the 6dF database. We discuss the spectral energy
distributions of both sources and possible interpretations.


title: A Discriminatively Learned CNN Embedding for Person Re-identification

abstract:
  We revisit two popular convolutional neural networks (CNN) in person
re-identification (re-ID), i.e, verification and classification models. The two
models have their respective advantages and limitations due to different loss
functions. In this paper, we shed light on how to combine the two models to
learn more discriminative pedestrian descriptors. Specifically, we propose a
new siamese network that simultaneously computes identification loss and
verification loss. Given a pair of training images, the network predicts the
identities of the two images and whether they belong to the same identity. Our
network learns a discriminative embedding and a similarity measurement at the
same time, thus making full usage of the annotations. Albeit simple, the
learned embedding improves the state-of-the-art performance on two public
person re-ID benchmarks. Further, we show our architecture can also be applied
in image retrieval.


title: Criteria for bounded valence of harmonic mappings

abstract:
  In 1984, Gehring and Pommerenke proved that if the Schwarzian derivative
$S(f)$ of a locally univalent analytic function $f$ in the unit disk satisfies
that $\limsup_{|z|\to 1} |S(f)(z)| (1-|z|^2)^2 < 2$, then there exists a
positive integer $N$ such that $f$ takes every value at most $N$ times.
Recently, Becker and Pommerenke have shown that the same result holds in those
cases when the function $f$ satisfies that $\limsup_{|z|\to 1} |f"(z)/f'(z)|\,
(1-|z|^2)< 1$.
  In this paper, we generalize these two criteria for bounded valence of
analytic functions to the cases when $f$ is merely harmonic.


title:
On Affine Invariant $L_p$ Depth Classifiers based on an Adaptive Choice
  of $p$

abstract:
  In this article, we use L$_p$ depth for classification of multivariate data,
where the value of $p$ is chosen adaptively using observations from the
training sample. While many depth based classifiers are constructed assuming
elliptic symmetry of the underlying distributions, our proposed L$_p$ depth
classifiers cater to a larger class of distributions. We establish Bayes risk
consistency of these proposed classifiers under appropriate regularity
conditions. Several simulated and benchmark data sets are analyzed to compare
their finite sample performance with some existing parametric and nonparametric
classifiers including those based on other notions of data depth.


title:
RADAR: A Novel Fast-Screening Method for Reading Difficulties with
  Special Focus on Dyslexia

abstract:
  Dyslexia is a developmental learning disorder of single word reading accuracy
and/or fluency, with compelling research directed towards understanding the
contributions of the visual system. While dyslexia is not an oculomotor
disease, readers with dyslexia have shown different eye movements than
typically developing students during text reading. Readers with dyslexia
exhibit longer and more frequent fixations, shorter saccade lengths, more
backward refixations than typical readers. Furthermore, readers with dyslexia
are known to have difficulty in reading long words, lower skipping rate of
short words, and high gaze duration on many words. It is an open question
whether it is possible to harness these distinctive oculomotor scanning
patterns observed during reading in order to develop a screening tool that can
reliably identify struggling readers, who may be candidates for dyslexia. Here,
we introduce a novel, fast, objective, non-invasive method, named Rapid
Assessment of Difficulties and Abnormalities in Reading (RADAR) that screens
for features associated with the aberrant visual scanning of reading text seen
in dyslexia. Eye tracking parameter measurements that are stable under retest
and have high discriminative power, as indicated by their ROC curves, were
obtained during silent text reading. These parameters were combined to derive a
total reading score (TRS) that can reliably separate readers with dyslexia from
typical readers. We tested TRS in a group of school-age children ranging from
8.5 to 12.5 years of age. TRS achieved 94.2% correct classification of children
tested. Specifically, 35 out of 37 control (specificity 94.6%) and 30 out of 32
readers with dyslexia (sensitivity 93.8%) were classified correctly using
RADAR, under a circular validation condition where the individual evaluated was
not included in the test construction group.


title: Oblique drop impact onto a deep liquid pool

abstract:
  Oblique impact of drops onto a solid or liquid surface is frequently observed
in nature. Most studies on drop impact and splashing, however, focus on
perpendicular impact. Here, we study oblique impact of 100-micrometer drops
onto a deep liquid pool, where we quantify the splashing threshold, maximum
cavity dimensions and cavity collapse by high-speed imaging above and below the
water surface. Gravity can be neglected in these experiments. Three different
impact regimes are identified: smooth deposition onto the pool, splashing in
the direction of impact only, and splashing in all directions. We provide
scaling arguments that delineate these regimes by accounting for the drop
impact angle and Weber number. The angle of the axis of the cavity created
below the water surface follows the impact angle of the drop irrespectively of
the Weber number, while the cavity depth and its displacement with respect to
the impact position do depend on the Weber number. Weber number dependency of
both the cavity depth and displacement is modeled using an energy argument.


title: On a special case of Watkins' conjecture

abstract:
  Watkins' conjecture asserts that for a rational elliptic curve $E$ the degree
of the modular parametrization is divisible by $2^r$, where $r$ is the rank of
$E$. In this paper we prove that if the modular degree is odd then $E$ has rank
$0$. Moreover, we prove that the conjecture holds for all rank two rational
elliptic curves of prime conductor and positive discriminant.


title: The Algebraic Intersection Type Unification Problem

abstract:
  The algebraic intersection type unification problem is an important component
in proof search related to several natural decision problems in intersection
type systems. It is unknown and remains open whether the algebraic intersection
type unification problem is decidable. We give the first nontrivial lower bound
for the problem by showing (our main result) that it is exponential time hard.
Furthermore, we show that this holds even under rank 1 solutions (substitutions
whose codomains are restricted to contain rank 1 types). In addition, we
provide a fixed-parameter intractability result for intersection type matching
(one-sided unification), which is known to be NP-complete.
  We place the algebraic intersection type unification problem in the context
of unification theory. The equational theory of intersection types can be
presented as an algebraic theory with an ACI (associative, commutative, and
idempotent) operator (intersection type) combined with distributivity
properties with respect to a second operator (function type). Although the
problem is algebraically natural and interesting, it appears to occupy a
hitherto unstudied place in the theory of unification, and our investigation of
the problem suggests that new methods are required to understand the problem.
Thus, for the lower bound proof, we were not able to reduce from known results
in ACI-unification theory and use game-theoretic methods for two-player tiling
games.


title: Shape Optimization Using the Cut Finite Element Method

abstract:
  We present a cut finite element method for shape optimization in the case of
linear elasticity. The elastic domain is defined by a level-set function, and
the evolution of the domain is obtained by moving the level-set along a
velocity field using a transport equation. The velocity field is the largest
decreasing direction of the shape derivative that satisfies a certain
regularity requirement and the computation of the shape derivative is based on
a volume formulation. Using the cut finite element method no re--meshing is
required when updating the domain and we may also use higher order finite
element approximations. To obtain a stable method, stabilization terms are
added in the vicinity of the cut elements at the boundary, which provides
control of the variation of the solution in the vicinity of the boundary. We
implement and illustrate the performance of the method in the two--dimensional
case, considering both triangular and quadrilateral meshes as well as finite
element spaces of different order.


title:
Hopf Algebras which Factorize through the Taft Algebra $T_{m^{2}}(q)$
  and the Group Hopf Algebra $K[C_{n}]$

abstract:
  We completely describe by generators and relations and classify all Hopf
algebras which factorize through the Taft algebra $T_{m^{2}}(q)$ and the group
Hopf algebra $K[C_{n}]$: they are $nm^{2}$-dimensional quantum groups
$T_{nm^{2}}^ {\omega}(q)$ associated to an $n$-th root of unity $\omega$.
Furthermore, using Dirichlet's prime number theorem we are able to count the
number of isomorphism types of such Hopf algebras. More precisely, if $d = {\rm
gcd}(m,\nu(n))$ and $\frac{\nu(n)}{d} = p_1^{\alpha_1} \cdots p_r^{\alpha_r}$
is the prime decomposition of $\frac{\nu(n)}{d}$ then the number of types of
Hopf algebras that factorize through $T_{m^{2}}(q)$ and $K[C_n]$ is equal to
$(\alpha_1 + 1)(\alpha_2 + 1) \cdots (\alpha_r + 1)$, where $\nu (n)$ is the
order of the group of $n$-th roots of unity in $K$. As a consequence of our
approach, the automorphism groups of these Hopf algebras are described as well.


title:
Study on Feature Subspace of Archetypal Emotions for Speech Emotion
  Recognition

abstract:
  Feature subspace selection is an important part in speech emotion
recognition. Most of the studies are devoted to finding a feature subspace for
representing all emotions. However, some studies have indicated that the
features associated with different emotions are not exactly the same. Hence,
traditional methods may fail to distinguish some of the emotions with just one
global feature subspace. In this work, we propose a new divide and conquer idea
to solve the problem. First, the feature subspaces are constructed for all the
combinations of every two different emotions (emotion-pair). Bi-classifiers are
then trained on these feature subspaces respectively. The final emotion
recognition result is derived by the voting and competition method.
Experimental results demonstrate that the proposed method can get better
results than the traditional multi-classification method.


title: Quantum walks: the first detected passage time problem

abstract:
  Even after decades of research the problem of first passage time statistics
for quantum dynamics remains a challenging topic of fundamental and practical
importance. Using a projective measurement approach, with a sampling time
$\tau$, we obtain the statistics of first detection events for quantum dynamics
on a lattice, with the detector located at the origin. A quantum renewal
equation for a first detection wave function, in terms of which the first
detection probability can be calculated, is derived. This formula gives the
relation between first detection statistics and the solution of the
corresponding Schr\"odinger equation in the absence of measurement. We
demonstrate our results with tight binding quantum walk models. We examine a
closed system, i.e. a ring, and reveal the intricate influence of the sampling
time $\tau$ on the statistics of detection, discussing the quantum Zeno effect,
half dark states, revivals and optimal detection. The initial condition
modifies the statistics of a quantum walk on a finite ring in surprising ways.
In some cases the average detection time is independent of the sampling time
while in others the average exhibits multiple divergences as the sampling time
is modified. For an unbounded one dimensional quantum walk the probability of
first detection decays like $(\mbox{time})^{(-3)}$ with superimposed
oscillations, with exceptional behavior when the sampling period $\tau$ times
the tunnelling rate $\gamma$ is a multiple of $\pi/2$. The amplitude of the
power law decay is suppressed as $\tau\to 0$ due to the Zeno effect. Our work
presented here, is an extended version of Friedman et al. arXiv:1603.02046
[cond-mat.stat-mech], and it predicts rich physical behaviors compared with
classical Brownian motion, for which the first passage probability density
decays monotonically like $(\mbox{time})^{-3/2}$, as elucidated by
Schr\"odinger in $1915$.


title: A Full Multigrid Method For Semilinear Elliptic Equation

abstract:
  A full multigrid finite element method is proposed for semilinear elliptic
equations. The main idea is to transform the solution of the semilinear problem
into a series of solutions of the corresponding linear boundary value problems
on the sequence of finite element spaces and semilinear problems on a very low
dimensional space. The linearized boundary value problems are solved by some
multigrid iterations. Besides the multigrid iteration, all other efficient
numerical methods can also serve as the linear solver for solving boundary
value problems. The optimality of the computational work is also proved.
Compared with the existing multigrid methods which need the bounded second
order derivatives of the nonlinear term, the proposed method only needs the
Lipschitz continuation in some sense of the nonlinear term.