  We demonstrate that a homogeneous spin polarization in one-dimensional
structures of finite length in the presence of Bychkov-Rashba spin-orbit
coupling decays spontaneously toward a persistent spin helix. The analysis of
formation of spin helical state is presented within a novel approach based on a
mapping of spin drift-diffusion equations into a heat equation for a complex
field. Such a strikingly different and simple method allows generating robust
spin structures whose properties can be tuned by the strength of the spin orbit
interaction and/or structure's length. We generalize our results for
two-dimensional case predicting formation of persistent spin helix in
two-dimensional channels from homogeneous spin polarization.


  Violence rates however have been brought down about 57% during the span of
the past 4 decades yet it doesn't change the way that the demonstration of
violence actually happens, unseen by the law. Violence can be mass controlled
sometimes by higher authorities, however, to hold everything in line one must
"Microgovern" over each movement occurring in every road of each square. To
address the butterfly effects impact in our setting, I made a unique model and
a theorized system to handle the issue utilizing deep learning. The model takes
the input of the CCTV video feeds and after drawing inference, recognizes if a
violent movement is going on. And hypothesized architecture aims towards
probability-driven computation of video feeds and reduces overhead from naively
computing for every CCTV video feeds.


  We investigate the field emission properties of nitrogenated and boronated
carbon nanotubes using time-dependent density functional theory, were the wave
function propagation is performed using the Crank-Nicholson algorithm. We
extract the current-voltage characteristics of the emitted electrons from
nanotubes with different doping configurations. We found that boron doping
either impedes, or slightly enhances, field emission. Nitrogen strongly
influences the emission current, and the current is sensitive to the location
of the nitrogen dopant in the nanotube. The emitted charge cloud from nitrogen
doped carbon nanotubes is, however, more diffuse than that from pristine ones,
our simulations show the emergence of a branching from the charge cloud, making
nitrogenated carbon nanotubes less convenient for use in narrow beam
applications.


  In this note we generalize an extension theorem in [5] and [9] of the mean
curvature flow to the H^{k} mean curvature flow under some extra conditions.
The main difficult problem in proving the extension theorem is to find a
suitable version of Michael-Simon inequality for the H^{k} mean curvature flow,
and to do a suitable Moser iteration process. These two problems are overcame
by imposing some extra conditions which may be weakened or removed in our
forthcoming paper [7]. On the other hand, we derive some estimates for the
generalized mean curvature flow, which have their own interesting.


  In this study, we give the dual characterizations of Mannheim offsets of the
ruled surface in terms of their integral invariants and the new
characterization of the Mannheim offsets of developable surface. Furthermore,
we obtain the relationships between the area of projections of spherical images
for Mannheim offsets of ruled surfaces and their integral invariants.


  Let $q$ be an odd prime power, $a \in \mathbb{F}_q[T]$ and $u \in
\mathbb{F}_q^*$. Provided $q \geq 17$, we compute the average number of primes
$p$ for which the characteristic polynomial of the Frobenius at $p$ is $X^2 -
aX + up$ over a family of rank 2 Drinfeld $ \mathbb{F}_q[T]$-modules. Our
results give asymptotic formulas in the $x$-limit.


  Numerous fairness metrics have been proposed and employed by artificial
intelligence (AI) experts to quantitatively measure bias and define fairness in
AI models. Recognizing the need to accommodate stakeholders' diverse fairness
understandings, efforts are underway to solicit their input. However, conveying
AI fairness metrics to stakeholders without AI expertise, capturing their
personal preferences, and seeking a collective consensus remain challenging and
underexplored. To bridge this gap, we propose a new framework, EARN Fairness,
which facilitates collective metric decisions among stakeholders without
requiring AI expertise. The framework features an adaptable interactive system
and a stakeholder-centered EARN Fairness process to Explain fairness metrics,
Ask stakeholders' personal metric preferences, Review metrics collectively, and
Negotiate a consensus on metric selection. To gather empirical results, we
applied the framework to a credit rating scenario and conducted a user study
involving 18 decision subjects without AI knowledge. We identify their personal
metric preferences and their acceptable level of unfairness in individual
sessions. Subsequently, we uncovered how they reached metric consensus in team
sessions. Our work shows that the EARN Fairness framework enables stakeholders
to express personal preferences and reach consensus, providing practical
guidance for implementing human-centered AI fairness in high-risk contexts.
Through this approach, we aim to harmonize fairness expectations of diverse
stakeholders, fostering more equitable and inclusive AI fairness.


  In 1956, 48 years after Hausdorff provided a comprehensive account on ordered
sets and defined the notion of a scattered order, Erd\H{o}s and Rado founded
the partition calculus in a seminal paper. The present paper gives an account
of investigations into generalisations of scattered linear orders and their
partition relations for both singletons and pairs. It provides analogues of the
Milner-Rado paradox for these orders instead of ordinals. For infinite, regular
$\kappa$, we investigate the extent to which the classes of $\kappa$-scattered,
weakly $\kappa$-scattered, and $\kappa$-saturated linear orders of size
$\kappa$ are closed under the partition relation $\tau \rightarrow (\varphi,
n)^2$ for all $n < \omega$. We prove that for a regular cardinal $\kappa$ such
that the stick principle holds at $\kappa$ and $\mathfrak{b}_\kappa =
\kappa^+$, the partition relation $\kappa^+\kappa \rightarrow (\kappa^+\kappa,
3)^2$ fails.
  Finally we generalise a result of Komj\'{a}th and Shelah about partitions of
scattered linear orders to a similar result about partitions of
$\kappa$-scattered linear orders for uncountable $\kappa$. Together this
continues older research by Erd\H{o}s, Galvin, Hajnal, Larson and Takahashi and
more recent investigations by Abraham, Bonnet, Cummings, D\v{z}amonja,
Komj\'{a}th, Shelah and Thompson.


  This paper presents the logic QRC$_1$, which is a strictly positive fragment
of quantified modal logic. The intended reading of the diamond modality is that
of consistency of a formal theory. Predicate symbols are interpreted as
parametrized axiomatizations. We prove arithmetical soundness of the logic
QRC$_1$ with respect to this arithmetical interpretation.
  Quantified provability logic is known to be undecidable. However, the
undecidability proof cannot be performed in our signature and arithmetical
reading. We conjecture the logic QRC$_1$ to be arithmetically complete. This
paper takes the first steps towards arithmetical completeness by providing
relational semantics for QRC$_1$ with a corresponding completeness proof. We
also show the finite model property, which implies decidability.


  Nowadays, data-intensive applications are gaining popularity and, together
with this trend, processing-in-memory (PIM)-based systems are being given more
attention and have become more relevant. This paper describes an analytical
modeling tool called Bitlet that can be used, in a parameterized fashion, to
estimate the performance and the power/energy of a PIM-based system and thereby
assess the affinity of workloads for PIM as opposed to traditional computing.
The tool uncovers interesting tradeoffs between, mainly, the PIM computation
complexity (cycles required to perform a computation through PIM), the amount
of memory used for PIM, the system memory bandwidth, and the data transfer
size. Despite its simplicity, the model reveals new insights when applied to
real-life examples. The model is demonstrated for several synthetic examples
and then applied to explore the influence of different parameters on two
systems - IMAGING and FloatPIM. Based on the demonstrations, insights about PIM
and its combination with CPU are concluded.


  In this paper, we investigate conformal Killing's vectors (CKVs) admitted by
some plane symmetric spacetimes. Ten conformal Killing's equations and their
general forms of CKVs are derived along with their conformal factor. The
existence of conformal Killing's symmetry imposes restrictions on the metric
functions. The conditions imposing restrictions on these metric functions are
obtained as a set of integrability conditions. Considering the cases of
time-like and inheriting CKVs, we obtain spacetimes admitting plane conformal
symmetry. Integrability conditions are solved completely for some known
non-conformally flat and conformally flat classes of plane symmetric
spacetimes. A special vacuum plane symmetric spacetime is obtained, and it is
shown that for such a metric CKVs are just the homothetic vectors (HVs). Among
all the examples considered, there exists only one case with a six dimensional
algebra of special CKVs admitting one proper CKV. In all other examples of
non-conformally flat metrics, no proper CKV is found and CKVs are either HVs or
Killing's vectors (KVs). In each of the three cases of conformally flat
metrics, a fifteen dimensional algebra of CKVs is obtained of which eight are
proper CKVs.


  We present new astrometry of Pluto's three satellites from images taken of
the Pluto system during 2002-3 with the High Resolution Camera (HRC) mode of
the Advanced Camera for Surveys (ACS) instrument on the Hubble Space Telescope.
The observations were designed to produce an albedo map of Pluto but they also
contain images of Charon and the two recently discovered satellites, S/2005 P1
and S/2005 P2. Orbits fitted to all three satellites are nearly co-planar and,
for Charon and P2, have eccentricities consistent with zero. The orbit of the
outermost satellite, P1, has a significant eccentricity of 0.0052 +/- 0.0011.
Orbital periods of P1, P2, and Charon are 38.2065 +/- 0.0014, 24.8562 +/-
00013, and 6.3872304 +/- 0.0000011 days, respectively. The total system mass
based on Charon's orbit is 1.4570 +/- 0.0009 x 10^22 kg. We confirm previous
results that orbital periods are close to the ratio of 6:4:1 (P1:P2:Charon)
indicative of mean-motion resonances, but our results formally preclude precise
integer period ratios. The orbits of P1 and P2, being about the barycenter
rather than Pluto, enable us to measure the Charon/Pluto mass ratio as 0.1165
+/- 0.0055. This new mass ratio implies a density of 1.65 +/- 0.06 g cm^-3 for
Charon (603.6 km radius) and 2.03 +/- 0.06 g cm^-3 for Pluto (1153 km radius)
thus adding confirmation that Charon is significantly less dense than Pluto.
Finally, by stacking all images, we can extract globally averaged photometry.
P1 has a mean opposition magnitude of V=24.39 +/- 0.09 and color of (B-V) =
0.64 +/- 0.12. P2 has a mean opposition magnitude of V=24.55 +/- 0.10 and color
of (B-V) = 0.91 +/- 0.15.


  A comprehensive study of high-accuracy photoionization cross sections is
carried out using the relativistic Breit-Pauli R-matrix (BPRM) method for (hnu
+ Fe XVII --> Fe XVIII + e). Owing to its importance in high-temperature
plasmas the calculations cover a large energy range, particularly the myriad
photoexciation-of-core (PEC) resonances including the n = 3 levels not
heretofore considered. The calculations employ a close coupling wave function
expansion of 60 levels of the core ion Fe XVIII ranging over a wide energy
range of nearly 900 eV between the n = 2 and n = 3 levels. Strong coupling
effects due to dipole transition arrays 2p^5 --> 2p^4 (3s,3d) manifest
themselves as large PEC resonances throughout this range, and enhance the
effective photoionization cross sections orders of magnitude above the
background. Comparisons with the erstwhile Opacity Project (OP) and other
previous calculations shows that the currently available cross sections
considerably underestimate the bound-free cross sections. A
level-identification scheme is used for spectroscopic designation of the 454
bound fine structure levels of Fe XVII. Level-specific photoionization cross
sections are computed for all levels. In addition, partial cross sections for
leaving the core ion Fe XVII in the ground state are also obtained. These
results should be relevant to modeling of astrophysical and laboratory plasma
sources requiring (i) photoionization rates, (ii) extensive
non-local-thermodynamic-equilibrium models, (iii) total unified electron-ion
recombination rates including radiative and dielectronic recombination, and
(iv) plasma opacities. We particularly examine PEC and non-PEC resonance
strengths and emphasize their expanded role to incorporate inner-shell
excitations for improved opacities, as shown by the computed monochromatic
opacity of Fe XVII.


  By viewing entanglement as a state function, a new kind of phase transition
takes place: the geometric phase transition. This phenomenon occurs due to
singularities in the shape of the entangled states set. It is shown how this
result can be carried to provide a better understanding of the geometry of
entanglement. Surprisingly, this study can be done experimentally, what allows
to determine the shape of different entangled states sets, a purely
mathematical definition, in real experiments.


  Nitrogen-vacancy (NV) centers in diamonds are interesting due to their
remarkable characteristics that are well suited to applications in
quantum-information processing and magnetic field sensing, as well as
representing stable fluorescent sources. Multiple NV centers in nanodiamonds
(NDs) are especially useful as biological fluorophores due to their chemical
neutrality, brightness and room-temperature photostability. Furthermore, NDs
containing multiple NV centers also have potential in high-precision magnetic
field and temperature sensing. Coupling NV centers to propagating surface
plasmon polariton (SPP) modes gives a base for lab-on-a-chip sensing devices,
allows enhanced fluorescence emission and collection which can further enhance
the precision of NV-based sensors. Here, we investigate coupling of multiple NV
centers in individual NDs to the SPP modes supported by silver surfaces
protected by thin dielectric layers and by gold V-grooves (VGs) produced via
the self-terminated silicon etching. In the first case, we concentrate on
monitoring differences in fluorescence spectra obtained from a source ND, which
is illuminated by a pump laser, and from a scattering ND illuminated only by
the fluorescence-excited SPP radiation. In the second case, we observe changes
in the average NV lifetime when the same ND is characterized outside and inside
a VG. Fluorescence emission from the VG terminations is also observed, which
confirms the NV coupling to the VG-supported SPP modes.


  We present the first method capable of photorealistically reconstructing
deformable scenes using photos/videos captured casually from mobile phones. Our
approach augments neural radiance fields (NeRF) by optimizing an additional
continuous volumetric deformation field that warps each observed point into a
canonical 5D NeRF. We observe that these NeRF-like deformation fields are prone
to local minima, and propose a coarse-to-fine optimization method for
coordinate-based models that allows for more robust optimization. By adapting
principles from geometry processing and physical simulation to NeRF-like
models, we propose an elastic regularization of the deformation field that
further improves robustness. We show that our method can turn casually captured
selfie photos/videos into deformable NeRF models that allow for photorealistic
renderings of the subject from arbitrary viewpoints, which we dub "nerfies." We
evaluate our method by collecting time-synchronized data using a rig with two
mobile phones, yielding train/validation images of the same pose at different
viewpoints. We show that our method faithfully reconstructs non-rigidly
deforming scenes and reproduces unseen views with high fidelity.


  We prove the -- to the best knowledge of the authors -- first result on the
fine asymptotic behavior of the regular part of the free boundary of the
obstacle problem close to singularities. The result is motivated by our recent
partial answer to a long standing conjecture and the first partial
classification of global solutions of the obstacle problem with unbounded
coincidence sets in higher dimensions.


  William W. Boone and Graham Higman proved that a finitely generated group has
soluble word problem if and only if it can be embedded in a simple group that
can be embedded in a finitely presented group. We prove the exact analogue for
lattice-ordered groups: Theorem: A finitely generated lattice-ordered group has
soluble word problem if and only if it can be embedded in an simple
lattice-ordered group that can be embedded in a finitely presented
lattice-ordered group. The proof uses permutation groups and the ideas used to
prove the lattice-ordered group analogue of Higman's Embedding Theorem.


  Community Question Answering (CQA) forums such as Stack Overflow and Yahoo!
Answers contain a rich resource of answers to a wide range of questions. Each
question thread can receive a large number of answers with different
perspectives. The goal of multi-perspective answer summarization is to produce
a summary that includes all perspectives of the answer. A major obstacle for
multi-perspective, abstractive answer summarization is the absence of a dataset
to provide supervision for producing such summaries. This work introduces a
novel dataset creation method to automatically create multi-perspective,
bullet-point abstractive summaries from an existing CQA forum. Supervision
provided by this dataset trains models to inherently produce multi-perspective
summaries. Additionally, to train models to output more diverse, faithful
answer summaries while retaining multiple perspectives, we propose a
multi-reward optimization technique coupled with a sentence-relevance
prediction multi-task loss. Our methods demonstrate improved coverage of
perspectives and faithfulness as measured by automatic and human evaluations
compared to a strong baseline.


  Metagenomics research has accelerated the studies of microbial organisms,
providing insights into the composition and potential functionality of various
microbial communities. Metatranscriptomics (studies of the transcripts from a
mixture of microbial species) and other meta-omics approaches hold even greater
promise for providing additional insights into functional and regulatory
characteristics of the microbial communities. Current metatranscriptomics
projects are often carried out without matched metagenomic datasets (of the
same microbial communities). For the projects that produce both
metatranscriptomic and metagenomic datasets, their analyses are often not
integrated. Metagenome assemblies are far from perfect, partially explaining
why metagenome assemblies are not used for the analysis of metatranscriptomic
datasets. Here we report a reads mapping algorithm for mapping of short reads
onto a de Bruijn graph of assemblies. A hash table of junction k-mers (k-mers
spanning branching structures in the de Bruijn graph) is used to facilitate
fast mapping of reads to the graph. We developed an application of this mapping
algorithm: a reference based approach to metatranscriptome assembly using
graphs of metagenome assembly as the reference. Our results show that this new
approach (called TAG) helps to assemble substantially more transcripts that
otherwise would have been missed or truncated because of the fragmented nature
of the reference metagenome. TAG was implemented in C++ and has been tested
extensively on the linux platform. It is available for download as open source
at http://omics.informatics.indiana.edu/TAG.


  Failures in safety-critical Cyber-Physical Systems (CPS), both software and
hardware-related, can lead to severe incidents impacting physical
infrastructure or even harming humans. As a result, extensive simulations and
field tests need to be conducted, as part of the verification and validation of
system requirements, to ensure system safety. However, current simulation and
field testing practices, particularly in the domain of small Unmanned Aerial
Systems (sUAS), are ad-hoc and lack a thorough, structured testing process.
Furthermore, there is a dearth of standard processes and methodologies to
inform the design of comprehensive simulation and field tests. This gap in the
testing process leads to the deployment of sUAS applications that are: (a)
tested in simulation environments which do not adequately capture the
real-world complexity, such as environmental factors, due to a lack of tool
support; (b) not subjected to a comprehensive range of scenarios during
simulation testing to validate the system requirements, due to the absence of a
process defining the relationship between requirements and simulation tests;
and (c) not analyzed through standard safety analysis processes, because of
missing traceability between simulation testing artifacts and safety analysis
artifacts. To address these issues, we have developed an initial framework for
validating CPS, specifically focusing on sUAS and robotic applications. We
demonstrate the suitability of our framework by applying it to an example from
the sUAS domain. Our preliminary results confirm the applicability of our
framework. We conclude with a research roadmap to outline our next research
goals along with our current proposal.


  Low-complexity precoding {algorithms} are proposed in this work to reduce the
computational complexity and improve the performance of regularized block
diagonalization (RBD) {based} precoding {schemes} for large multi-user {MIMO}
(MU-MIMO) systems. The proposed algorithms are based on a channel inversion
technique, QR decompositions{,} and lattice reductions to decouple the MU-MIMO
channel into equivalent SU-MIMO channels. Simulation results show that the
proposed precoding algorithms can achieve almost the same sum-rate performance
as RBD precoding, substantial bit error rate (BER) performance gains{,} and a
simplified receiver structure, while requiring a lower complexity.


  We say a representation V of a group G has stability if its multiplicities
m^{G}_{V}(\lambda) is dependent only on some equivalence class of \lambda for a
sufficiently large parameter \lambda. In this paper, we prove that the
restriction of a holomorphic discrete series representation with respect to any
holomorphic symmetric pairs has stability. As a corollary, we give a necessary
and sufficient condition on multiplicity-freeness of the branching laws in this
setting. This condition is same as the sufficient condition given by the theory
of visible actions. We prove a general theorem before we show the stability of
holomorphic discrete series representations. Using the general theorem, we also
show the stability on quasi-affine spherical homogeneous spaces and the
stability of K-type of unitary highest weight modules. We also show that two
branching laws of a holomorphic discrete series representation coincide if two
subgroups are in same \epsilon-family.


  We perform canonical quantization of open strings in the $D$-brane background
with a $B$-field. Treating the mixed boundary condition as a primary
constraint, we get a set of secondary constraints. Then these constraints are
shown to be equivalent to orbifold conditions to be imposed on normal string
modes. These orbifold conditions are a generalization of the familiar orbifold
conditions which arise when we describe open strings in terms of closed
strings. Solving the constraints explicitly, we obtain a simple Hamiltonian for
the open string, which reveals the nature of noncommutativity transparently.


  Using weaker versions of the cardinal function $\psi_c(X)$, we derive a
series of new bounds for the cardinality of Hausdorff spaces and regular spaces
that do not involve $\psi_c(X)$ nor its variants at all. For example, we show
if $X$ is regular then $|X|\leq 2^{c(X)^{\pi\chi(X)}}$ and $|X|\leq
2^{c(X)\pi\chi(X)^{ot(X)}}$, where the cardinal function $ot(X)$, introduced by
Tkachenko, has the property $ot(X)\leq\min\{t(X),c(X)\}$. It follows from the
latter that a regular space with cellularity at most $\mathfrak{c}$ and
countable $\pi$-character has cardinality at most $2^\mathfrak{c}$. For a
Hausdorff space $X$ we show $|X|\leq 2^{d(X)^{\pi\chi(X)}}$, $|X|\leq
d(X)^{\pi\chi(X)^{ot(X)}}$, and $|X|\leq 2^{\pi w(X)^{dot(X)}}$, where
$dot(X)\leq\min\{ot(X),\pi\chi(X)\}$. None of these bounds involve $\psi_c(X)$
or $\psi(X)$. By introducing the cardinal functions $w\psi_c(X)$ and
$d\psi_c(X)$ with the property $w\psi_c(X)d\psi_c(X)\leq\psi_c(X)$ for a
Hausdorff space $X$, we show $|X|\leq\pi\chi(X)^{c(X)w\psi_c(X)}$ if $X$ is
regular and $|X|\leq\pi\chi(X)^{c(X)d\psi_c(X)w\psi_c(X)}$ if $X$ is Hausdorff.
This improves results of Sapirovskii and Sun. It is also shown that if $X$ is
Hausdorff then $|X|\leq 2^{d(X)w\psi_c(X)}$, which appears to be new even in
the case where $w\psi_c(X)$ is replaced with $\psi_c(X)$. Compact examples show
that $\psi(X)$ cannot be replaced with $d\psi_c(X)w\psi_c(X)$ in the bound
$2^{\psi(X)}$ for the cardinality of a compact Hausdorff space $X$. Likewise,
$\psi(X)$ cannot be replaced with $d\psi_c(X)w\psi_c(X)$ in the
Arhangel'skii-Sapirovskii bound $2^{L(X)t(X)\psi(X)}$ for the cardinality of a
Hausdorff space $X$. Finally, we make several observations concerning
homogeneous spaces in this connection.


  A method is proposed for combining multi-frequency maps in order to produce a
catalogue of extragalactic point sources using data from future high-precision
satellite experiments. We have found the optimal way for combining maps at
different frequencies in order to maximize the signal (point sources) to noise
(rest of the signal) ratio. Our approach is a natural multi-frequency
generalization of the band-pass filter introduced by Tegmark and de
Oliveira-Costa (1998). We show that combination of different frequency maps
gives us the possibility of creating a more complete catalogue of point
sources.


  We introduce a new variant of Nodal Virtual Element spaces that mimics the
"Serendipity Finite Element Methods" (whose most popular example is the 8-node
quadrilateral) and allows to reduce (often in a significant way) the number of
internal degrees of freedom. When applied to the faces of a three-dimensional
decomposition, this allows a reduction in the number of face degrees of
freedom: an improvement that cannot be achieved by a simple static
condensation. On triangular and tetrahedral decompositions the new elements
(contrary to the original VEMs) reduce exactly to the classical Lagrange FEM.
On quadrilaterals and hexahedra the new elements are quite similar (and have
the same amount of degrees of freedom) to the Serendipity Finite Elements, but
are much more robust with respect to element distortions. On more general
polytopes the Serendipity VEMs are the natural (and simple) generalization of
the simplicial case.


  In this thesis a new model for calculating the total energy of atomic and
solid systems is presented. The model is used to study the properties of the
Si(100) surface and dislocation dynamics in the diamond structure. For the
Si(100) surface the main result is the finding of an incomplete melted state at
$1550^0 K$. The studied dislocation is the $90^0$ partial and it is found that
the barriers for kink formation and migration are in good accordance with
experimental observations. The general idea for calculating the total energy
for a given system is to relate a reference system to each atom, an effective
medium for which the total energy is known and then only calculate the energy
difference between the two systems. Using transferable potentials and densities
a pair potential is constructed which describe the electro-static and
exchange-correlation part of the energy difference. The remaining part, the
one-electron difference, is calculated with an LMTO tight-binding model with
the potential parameters determined from the effective potential of the
reference system.


  We examine a parameterized complexity class for randomized computation where
only the error bound and not the full runtime is allowed to depend more than
polynomially on the parameter, based on a proposal by Kwisthout in [15,16]. We
prove that this class, for which we propose the shorthand name PPPT, has a
robust definition and is in fact equal to the intersection of the classes
paraBPP and PP. This result is accompanied by a Cook-style proof of
completeness for the corresponding promise class (under a suitable notion of
reduction) for parameterized approximation versions of the inference problem in
Bayesian networks, which is known to be PP-complete. With these definitions and
results in place, we proceed by showing how it follows from this that
derandomization is equivalent to efficient deterministic approximation methods
for the inference problem. Furthermore, we observe as a straightforward
application of a result due to Drucker in [8] that these problems cannot have
polynomial size randomized kernels unless the polynomial hierarchy collapses to
the third level. We conclude by indicating potential avenues for further
exploration and application of this framework.


  We propose a setup comprising an arbitrarily large array of static qubits
(SQs), which interact with a flying qubit (FQ). The SQs work as a quantum
register, which can be written or read-out by means of the FQ through quantum
state transfer (QST). The entire system, including the FQ's motional degrees of
freedom, behaves quantum mechanically. We demonstrate a strategy allowing for
selective QST between the FQ and a single SQ chosen from the register. This is
achieved through a perfect mirror located beyond the SQs and suitable
modulation of the inter-SQ distances.


  Structures in Warm Dark Matter (WDM) models are exponentially suppressed
below a certain scale, characterized by the dark matter particle mass, $m_{\rm
x}$. Since structures form hierarchically, the presence of collapsed objects at
high-redshifts can set strong lower limits on $m_{\rm x}$. We place robust
constraints on $m_{\rm x}$ using recent results from the {\it Swift} database
of high-redshift gamma-ray bursts (GRBs). We parameterize the redshift
evolution of the ratio between the cosmic GRB rate and star formation rate
(SFR) as $\propto (1+z)^\alpha$, thereby allowing astrophysical uncertainties
to partially mimic the cosmological suppression of structures in WDM models.
Using a maximum likelihood estimator on two different $z>4$ GRB subsamples
(including two bursts at $z>8$), we constrain $m_{\rm x} \gtrsim 1.6$-1.8 keV
at 95% C.L., when marginalized over a flat prior in $\alpha$. We further
estimate that 5 years of a SVOM-like mission would tighten these constraints to
$m_{\rm x} \gtrsim 2.3 $ keV. Our results show that GRBs are a powerful probe
of high-redshift structures, providing robust and competitive constraints on
$m_{\rm x}$.


  The conformal mapping of the Borel plane can be utilized for the analytic
continuation of the Borel transform to the entire positive real semi-axis and
is thus helpful in the resummation of divergent perturbation series in quantum
field theory. We observe that the rate of convergence can be improved by the
application of Pad\'{e} approximants to the Borel transform expressed as a
function of the conformal variable, i.e. by a combination of the analytic
continuation via conformal mapping and a subsequent numerical approximation by
rational approximants. The method is primarily useful in those cases where the
leading (but not sub-leading) large-order asymptotics of the perturbative
coefficients are known.


  We consider giant gravitons as probes of a class of ten-dimensional solutions
of type IIB supergravity which arise as lifts of solutions of U(1)^3 gauged N=2
supergravity in five-dimensions. Surprisingly it is possible to solve exactly
for minimum energy configurations of these spherical D3-brane probes in the
compact directions, even in backgrounds which preserve no supersymmetry. The
branes behave as massive charged particles in the five non-compact dimensions.
As an example we probe geometries which are believed to represent the
supergravity background of coherent states of giant gravitons. We comment on
the apparently repulsive nature of the naked singularities in these geometries.


  We prove that in the biased 1:b Hamiltonicity Maker-Breaker game, played on
the edges of the complete graph K_n, Maker has a winning strategy for
b(n)<=(1-o(1))n/ln n, for all large enough n.


  We prove that the free Fock space ${\F}(\R^+;\C)$, which is very commonly
used in Free Probability Theory, is the continuous free product of copies of
the space $\C^2$. We describe an explicit embedding and approximation of this
continuous free product structure by means of a discrete-time approximation:
the free toy Fock space, a countable free product of copies of $\C^2$. We show
that the basic creation, annihilation and gauge operators of the free Fock
space are also limits of elementary operators on the free toy Fock space. When
applying these constructions and results to the probabilistic interpretations
of these spaces, we recover some discrete approximations of the semi-circular
Brownian motion and of the free Poisson process. All these results are also
extended to the higher multiplicity case, that is, ${\F}(\R^+;\C^N)$ is the
continuous free product of copies of the space $\C^{N+1}$.


  The scattering theory of the integrable statistical models can be generalized
to the case of systems with extended lines of defect. This is done by adding
the reflection and transmission amplitudes for the interactions with the line
of inhomegeneity to the scattering amplitudes in the bulk. The factorization
condition for the new amplitudes gives rise to a set of Reflection-Transmission
equations. The solutions of these equations in the case of diagonal $S$-matrix
in the bulk are only those with $S =\pm 1$. The choice $S=-1$ corresponds to
the Ising model. We compute the exact expressions of the transmission and
reflection amplitudes relative to the interaction of the Majorana fermion of
the Ising model with the defect. These amplitudes present a weak-strong duality
in the coupling constant, the self-dual points being the special values where
the defect line acts as a reflecting surface. We also discuss the bosonic case
$S=1$ which presents instability properties and resonance states. Multi-defect
systems which may give rise to a band structure are also considered. The exact
expressions of correlation functions is obtained in terms of Form Factors of
the bulk theory and matrix elements of the defect operator.


  In Information Retrieval (IR), whether implicitly or explicitly, queries and
documents are often represented as vectors. However, it may be more beneficial
to consider documents and/or queries as multidimensional objects. Our belief is
this would allow building "truly" interactive IR systems, i.e., where
interaction is fully incorporated in the IR framework.
  The probabilistic formalism of quantum physics represents events and
densities as multidimensional objects. This paper presents our first step
towards building an interactive IR framework upon this formalism, by stating
how the first interaction of the retrieval process, when the user types a
query, can be formalised. Our framework depends on a number of parameters
affecting the final document ranking. In this paper we experimentally
investigate the effect of these parameters, showing that the proposed
representation of documents and queries as multidimensional objects can compete
with standard approaches, with the additional prospect to be applied to
interactive retrieval.


  Ground-based gravitational-wave detectors like Cosmic Explorer can be tuned
to improve their sensitivity at high or low frequencies by tuning the response
of the signal extraction cavity. Enhanced sensitivity above 2 kHz enables
measurements of the post-merger gravitational-wave spectrum from binary neutron
star mergers, which depends critically on the unknown equation of state of hot,
ultra-dense matter. Improved sensitivity below 500 Hz favors precision tests of
extreme gravity with black hole ringdown signals and improves the detection
prospects while facilitating an improved measurement of source properties for
compact binary inspirals at cosmological distances. At intermediate
frequencies, a more sensitive detector can better measure the tidal properties
of neutron stars. We present and characterize the performance of tuned Cosmic
Explorer configurations that are designed to optimize detections across
different astrophysical source populations. These tuning options give Cosmic
Explorer the flexibility to target a diverse set of science goals with the same
detector infrastructure. We find that a 40 km Cosmic Explorer detector
outperforms a 20 km in all key science goals other than access to post-merger
physics. This suggests that Cosmic Explorer should include at least one 40 km
facility.


  We investigate the prescribed Q-curvature flow for GJMS operators with
non-trivial kernel on compact manifolds of even dimension. When the total
Q-curvature is negative, we identify a conformally invariant condition on the
nodal domains of functions in the kernel of the GJMS operator, allowing us to
prove the global existence and the convergence of the flow to a metric which is
conformal to the initial one, and having a prescribed Q-curvature. If the total
Q-curvature is positive, we show that the flow blows up in finite time.


  Coloring line art images based on the colors of reference images is an
important stage in animation production, which is time-consuming and tedious.
In this paper, we propose a deep architecture to automatically color line art
videos with the same color style as the given reference images. Our framework
consists of a color transform network and a temporal constraint network. The
color transform network takes the target line art images as well as the line
art and color images of one or more reference images as input, and generates
corresponding target color images. To cope with larger differences between the
target line art image and reference color images, our architecture utilizes
non-local similarity matching to determine the region correspondences between
the target image and the reference images, which are used to transform the
local color information from the references to the target. To ensure global
color style consistency, we further incorporate Adaptive Instance Normalization
(AdaIN) with the transformation parameters obtained from a style embedding
vector that describes the global color style of the references, extracted by an
embedder. The temporal constraint network takes the reference images and the
target image together in chronological order, and learns the spatiotemporal
features through 3D convolution to ensure the temporal consistency of the
target image and the reference image. Our model can achieve even better
coloring results by fine-tuning the parameters with only a small amount of
samples when dealing with an animation of a new style. To evaluate our method,
we build a line art coloring dataset. Experiments show that our method achieves
the best performance on line art video coloring compared to the
state-of-the-art methods and other baselines.


  Using a one-parameter case as an example, we demonstrate that multicanonical
simulations allow for accurate estimates of the residual combinatorial entropy
of partially ordered ice. For the considered case corrections to an
(approximate) analytical formula are found to be small, never exceeding 0.5%.
The method allows one as well to calculate combinatorial entropies for many
other systems.


  In this paper we investigate a problem of state estimation for the dynamical
system described by the linear operator equation with unknown parameters in
Hilbert space. We present explicit expressions for linear minimax estimation
and error provided that any pair of uncertain parameters belongs to the
quadratic bounding set. As an application of the main result we present the
solution of minimax estimation problem for the linear descriptor differential
equation with constant matrices.


  Let M be a manifold with Grassmann structure, i.e. with an isomorphism of the
cotangent bundle T^*M\cong E\otimes H with the tensor product of two vector
bundles E and H. We define the notion of a half-flat connection \nabla^W in a
vector bundle W\to M as a connection whose curvature F\in S^2E\otimes\wedge^2
H\otimes W \subset\wedge^2 T^*M\otimes W. Under appropriate assumptions, for
example, when the Grassmann structure is associated with a quaternionic Kaehler
structure on M, half-flatness implies the Yang-Mills equations. Inspired by the
harmonic space approach, we develop a local construction of (holomorphic)
half-flat connections \nabla^W over a complex manifold with (holomorphic)
Grassmann structure equipped with a suitable linear connection. Any such
connection \nabla^W can be obtained from a prepotential by solving a system of
linear first order ODEs. The construction can be applied, for instance, to the
complexification of hyper-Kaehler manifolds or more generally to hyper-Kaehler
manifolds with admissible torsion and to their higher-spin analogues. It yields
solutions of the Yang-Mills equations.


  Achieving ultimate bounds in estimation processes is the main objective of
quantum metrology. In this context, several problems require measurement of
multiple parameters by employing only a limited amount of resources. To this
end, adaptive protocols, exploiting additional control parameters, provide a
tool to optimize the performance of a quantum sensor to work in such limited
data regime. Finding the optimal strategies to tune the control parameters
during the estimation process is a non-trivial problem, and machine learning
techniques are a natural solution to address such task. Here, we investigate
and implement experimentally for the first time an adaptive Bayesian
multiparameter estimation technique tailored to reach optimal performances with
very limited data. We employ a compact and flexible integrated photonic
circuit, fabricated by femtosecond laser writing, which allows to implement
different strategies with high degree of control. The obtained results show
that adaptive strategies can become a viable approach for realistic sensors
working with a limited amount of resources.


  Recently, Blecher and Knopfmacher applied the notion of fixed points to
integer partitions. This has already been generalized and refined in various
ways such as $h$-fixed points for an integer parameter $h$ by Hopkins and
Sellers. Here, we consider the sequence of first column hook lengths in the
Young diagram of a partition and corresponding fixed hooks. We enumerate these,
using both generating function and combinatorial proofs, and find that they
match occurrences of part sizes equal to their multiplicity. We establish
connections to work of Andrews and Merca on truncations of the pentagonal
number theorem and classes of partitions partially characterized by certain
minimal excluded parts (mex).


  In this paper, we derive a local unique continuation property for stochastic
hyperbolic equations without boundary conditions. This result is proved by a
global Carleman estimate.


  We investigate finite-size corrections to anomalous dimensions of large-spin
twist-two operators in the planar maximally supersymmetric Yang-Mills theory.
We develop a framework for analysis of these corrections, that is complementary
to the conventional spin-chain approach, by making use of the hole rather than
the magnon picture. From the dual string theory perspective where the
large-spin operator is identified with the Gubser-Klebanov-Polyakov (GKP)
string, our approach is equivalent to constructing the first Luescher
correction to the energy of the GKP string by incorporating the contribution of
virtual excitations propagating on it. It allows us to propose a formula that
controls a particular class of large-spin corrections to the twist-two
anomalous dimension and holds at any value of the coupling constant. Compared
to wrapping corrections computed with magnons propagating on the spin chain,
the finite-size corrections that are encoded in our formalism start at a lower
loop level. Our formalism thus calls for modification of the asymptotic
contributions which are conventionally incorporated within the Asymptotic Bethe
Ansatz. An educated guess allows us to remedy this pitfall and successfully
confront our predictions with known results up to five loop accuracy at weak
coupling. Finally, our formula sheds light on the weak-to-strong coupling
transition for the subleading large-spin corrections under study and confirms
stringy expectations at strong coupling where they are found to be identical to
the first Luescher correction to the vacuum energy of the O(6) sigma model.


  This note investigates the relation between squeezing function and its
generalizations. Using the relation obtained, we present an alternate method to
find expression of generalized squeezing function of unit ball corresponding to
the generalized complex ellipsoids.


  We computed Doppler beaming factors for DA, DB, and DBA white dwarf models,
as well as for main sequence and giant stars covering the transmission curves
of the Sloan, UBVRI, HiPERCAM, Kepler, TESS, and Gaia photometric systems. The
calculations of the limb-darkening coefficients for 3D models were carried out
using the least-squares method for these photometric systems.
  The beaming factor calculations, which use realistic models of stellar
atmospheres, show that the black body approximation is not accurate,
particularly for the filters $u$, $u'$, $U$, $g$, $g'$, and $B$. The black body
approach is only valid for high effective temperatures and/or long effective
wavelengths. Therefore, for more accurate analyses of light curves, we
recommend the use of the beaming factors presented in this paper. Concerning
limb-darkening, the distribution of specific intensities for 3D models
indicates that, in general, these models are less bright toward the limb than
their 1D counterparts, which implies steeper profiles. To describe these
intensities better, we recommend the use of the four-term law (also for 1D
models) given the level of precision that is being achieved with Earth-based
instruments and space missions such as Kepler and TESS (and PLATO in the
future).


  Entity alignment is the task of finding entities representing the same
real-world object in two knowledge graphs(KGs). Cross-lingual knowledge graph
entity alignment aims to discover the cross-lingual links in the multi-language
KGs, which is of great significance to the NLP applications and multi-language
KGs fusion. In the task of aligning cross-language knowledge graphs, the
structures of the two graphs are very similar, and the equivalent entities
often have the same subgraph structure characteristics. The traditional GCN
method neglects to obtain structural features through representative parts of
the original graph and the use of adjacency matrix is not enough to effectively
represent the structural features of the graph. In this paper, we introduce the
subgraph network (SGN) method into the GCN-based cross-lingual KG entity
alignment method. In the method, we extracted the first-order subgraphs of the
KGs to expand the structural features of the original graph to enhance the
representation ability of the entity embedding and improve the alignment
accuracy. Experiments show that the proposed method outperforms the
state-of-the-art GCN-based method.


  In the last ten years the use of proton beams in radiation therapy has become
a clinical tool for treatment of deep-seated tumours. LIBO is a RF compact and
low cost proton linear accelerator (SCL type) for hadrontherapy. It is
conceived by TERA Foundation as a 3 GHz Linac Booster, to be mounted downstream
of an existing cyclotron in order to boost the energy of the proton beam up to
200 MeV, needed for deep treatment (~25 cm) in the human body. With this
solution it is possible to transform a low energy commercial cyclotron,
normally used for eye melanoma therapy, isotope production and nuclear physics
research, into an accelerator for deep-seated tumours. A prototype module of
LIBO has been built and successfully tested with full RF power at CERN and with
proton beam at INFN Laboratori Nazionali del Sud (LNS) in Catania, within an
international collaboration between TERA Foundation, CERN, the Universities and
INFN groups of Milan and Naples. The mid-term aim of the project is the
technology transfer of the accumulated know-how to a consortium of companies
and to bring this novel medical tool to hospitals. The design, construction and
tests of the LIBO prototype are described in detail.


We give a sufficient condition for quantising integrable systems.


  In this paper, we present a heuristic for designing facility layouts that are
convenient for designing a unidirectional loop for material handling. We use
genetic algorithm where the objective function and crossover and mutation
operators have all been designed specifically for this purpose. Our design is
made under flexible bay structure and comparisons are made with other layouts
from the literature that were designed under flexible bay structure.


  With copper-substituted lead apatite below room temperature, we observe
diamagnetic dc magnetization under magnetic field of 25 Oe with remarkable
bifurcation between zero-field-cooling and field-cooling measurements, and
under 200 Oe it changes to be paramagnetism. A glassy memory effect is found
during cooling. Typical hysteresis loops for superconductors are detected below
250 K, along with an asymmetry between forward and backward sweep of magnetic
field. Our experiment suggests at room temperature the Meissner effect is
possibly present in this material.


  Hele-Shaw flow at vanishing surface tension is ill-defined. In finite time,
the flow develops cusp-like singularities. We show that the ill-defined problem
admits a weak {\it dispersive} solution when singularities give rise to a graph
of shock waves propagating in the viscous fluid. The graph of shocks grows and
branches. Velocity and pressure jump across the shock. We formulate a few
simple physical principles which single out the dispersive solution and
interpret shocks as lines of decompressed fluid. We also formulate the
dispersive weak solution in algebro-geometrical terms as an evolution of the
Krichever-Boutroux complex curve. We study in detail the most generic (2,3)
cusp singularity, which gives rise to an elementary branching event. This
solution is self-similar and expressed in terms of elliptic functions.


  In this paper we construct explicit examples of both closed and non-compact
finite volume hyperbolic manifolds which provide counterexamples to the
conjecture that the co-rank of a 3-manifold group (also known as the cut
number) is bounded below by one-third the first Betti number.


  Let A_n be the class of functions f(z) which are analytic in the open unit
disk U} with f(0)=0, f'(0)=1, f"(0)=f"'(0)=...=f^{(n)}=0 and f^{(n+1)}\neq0.
Applying the results due to S. S. Miller (J. Math. Anal. Appl. 65(1978),
289-305), some interesting starlikeness problems concerned with subordinations
are discussed. The results in the paper are extensions of results by M.
Obradovi\'c (Hokkaido Math. J. 27(1998), 329-335).


  Watrous had presented the first proof of zero-knowledge property of a proof
system against a quantum verifier. The key of the proof is the construction of
a quantum simulator. In the construction, the 'failure state' is rotated to the
'success' state by a tricky operation which is initially developped for the
amplification of QMA proof systems.
  This manuscript presents a new and simpler construction of a simulator. In
the construction, we simply amplify the success probability of a classical
simulator using Grover's amplification.


  We consider the Anderson model with Bernoulli potential on the 3D lattice,
and prove localization of eigenfunctions corresponding to eigenvalues near
zero, the lower boundary of the spectrum. We follow the framework by
Bourgain-Kenig and Ding-Smart, and our main contribution is a 3D discrete
unique continuation, which says that any eigenfunction of the harmonic operator
with bounded potential cannot be too small on a significant fractional portion
of all the points. Its proof relies on geometric arguments about the 3D
lattice.


  We present a numerical lattice quantum chromodynamics calculation of
isovector form factors and the first few moments of the isovector structure
functions of the nucleon. The calculation employs two degenerate dynamical
flavors of domain-wall fermions, resulting in good control of chiral symmetry
breaking. Non-perturbative renormalization of the relevant quark currents is
performed where necessary. The inverse lattice spacing, $a^{-1}$, is about 1.7
GeV. We use degenerate up and down dynamical quark masses around 1, 3/4 and 1/2
the strange quark mass. The physical volume of the lattice is about
$(1.9{fm})^3$. The ratio of the isovector vector to axial charges, $g_A/g_V$,
trends a bit lower than the experimental value as the quark mass is reduced
toward the physical point. We calculate the momentum-transfer dependences of
the isovector vector, axial, induced tensor and induced pseudoscalar form
factors. The Goldberger-Treiman relation holds at low momentum transfer and
yields a pion-nucleon coupling, $g_{\pi NN} = 15.5(1.4)$, where the quoted
error is only statistical. We find that the flavor non-singlet quark momentum
fraction $<x>_{u-d}$ and quark helicity fraction $<x>_{\Delta u-\Delta d}$
overshoot their experimental values after linear chiral extrapolation. We
obtain the transversity, $<1 >_{\delta u-\delta d} = 0.93(6)$ in $\bar{\rm MS}$
at 2 GeV and a twist-3 polarized moment, $d_1$, appears small, suggesting that
the Wandzura-Wilczek relation holds approximately. We discuss the systematic
errors in the calculation, with particular attention paid to finite-volume
effects, excited-state contamination, and chiral extrapolations.


  Game-theoretic motion planners are a potent solution for controlling systems
of multiple highly interactive robots. Most existing game-theoretic planners
unrealistically assume a priori objective function knowledge is available to
all agents. To address this, we propose a fault-tolerant receding horizon
game-theoretic motion planner that leverages inter-agent communication with
intention hypothesis likelihood. Specifically, robots communicate their
objective function incorporating their intentions. A discrete Bayesian filter
is designed to infer the objectives in real-time based on the discrepancy
between observed trajectories and the ones from communicated intentions. In
simulation, we consider three safety-critical autonomous driving scenarios of
overtaking, lane-merging and intersection crossing, to demonstrate our
planner's ability to capitalize on alternative intention hypotheses to generate
safe trajectories in the presence of faulty transmissions in the communication
network.


  For $f: [0,1]\to \mathbb R$, we consider $L^f_t$, the local time of
space-time Brownian motion on the curve $f$. Let ${\cal S}_\alpha$ be the class
of all functions whose H\"older norm of order $\alpha$ is less than or equal to
1. We show that the supremum of $L^f_1$ over $f$ in ${\cal S}_\alpha$ is finite
if $\alpha>\frac12$.


  High-fidelity deception jamming can seriously mislead Synthetic Aperture
Radar (SAR) image interpretation and target detection, which is difficult to
identify or eliminate through traditional anti-jamming methods. Based on the
Range-Doppler Algorithm (RDA), an anti-jamming method for SAR by using joint
waveform modulation and azimuth mismatched filtering is proposed in this paper.
The signal model of SAR echo after pulse compression with deception jamming is
derived from the radar detection and jamming characteristics. A multi-objective
cost function is introduced to suppress the jamming level and keep the real
target information, parameterized with the waveform initial phase and the
azimuth mismatched filter coefficients, which is optimized using the
second-order Taylor expansion approximation and the alternating direction
multiplier method (ADMM). The performance of this proposed method is evaluated
through the convergence analysis and anti-jamming experiments on the point
target and the distributed target scenarios.


  An analytical theory of the nonlinear electromagnetic response of a
two-dimensional (2D) electron system in the second order in the electric field
amplitude is developed. The second-order polarizability and the intensity of
the second harmonic signal are calculated within the self-consistent-field
approach both for semiconductor 2D electron systems and for graphene. The
second harmonic generation in graphene is shown to be about two orders of
magnitude stronger than in GaAs quantum wells at typical experimental
parameters. Under the conditions of the 2D plasmon resonance the second
harmonic radiation intensity is further increased by several orders of
magnitude.


  We propose a new method for evaluating NISQ devices. This paper has three
distinct parts. First, we present a new quantum algorithm that solves a two
hundred year old problem of finding quadratic nonresidues (QNR) in polynomial
time. We show that QNR is in Exact Quantum Polynomial time, while it is still
unknown whether QNR is in P. Second, we present a challenge to create a
probability distribution over the quadratic nonresidues. Due to the theoretical
complexity gap, a quantum computer can achieve a higher success rate than any
known method on a classical computer. A device beating the classical bound
indicates quantum advantage or a mathematical breakthrough. Third, we derive a
simple circuit for the smallest instance of the quadratic nonresidue test and
run it on a variety of currently available NISQ devices. We then present a
comparative statistical evaluation of the NISQ devices tested.


  Symmetries in quantum mechanics are realized by the projective
representations of the Lie group as physical states are defined only up to a
phase. A cornerstone theorem shows that these representations are equivalent to
the unitary representations of the central extension of the group. The
formulation of the inertial states of special relativistic quantum mechanics as
the projective representations of the inhomogeneous Lorentz group, and its
nonrelativistic limit in terms of the Galilei group, are fundamental examples.
Interestingly, neither of these symmetries includes the Weyl-Heisenberg group;
the hermitian representations of its algebra are the Heisenberg commutation
relations that are a foundation of quantum mechanics. The Weyl-Heisenberg group
is a one dimensional central extension of the abelian group and its unitary
representations are therefore a particular projective representation of the
abelian group of translations on phase space. A theorem involving the
automorphism group shows that the maximal symmetry that leaves invariant the
Heisenberg commutation relations are essentially projective representations of
the inhomogeneous symplectic group. In the nonrelativistic domain, we must also
have invariance of Newtonian time. This reduces the symmetry group to the
inhomogeneous Hamilton group that is a local noninertial symmetry of Hamilton's
equations. The projective representations of these groups are calculated using
the Mackey theorems for the general case of a nonabelian normal subgroup.


  Visible light communication (VLC) is an emerging technology that enables
broadband data rates using the visible spectrum. In this paper, considering
slow beam steering where VLC beam directions are assumed to be fixed during a
transmission frame, we find the steering angles that simultaneously serve
multiple users within the frame duration and maximize the data rates. This is
achieved by solving a non-convex optimization problem using a grid-based search
and majorization-minimization (MM) procedure. Subsequently, we consider
multiple steerable beams with a larger number of users in the network and
propose an algorithm to cluster users and serve each cluster with a separate
beam. We optimize the transmit power of each beam to maximize the data rates.
Finally, we propose a non-orthogonal multiple access (NOMA) scheme for the beam
steering and user clustering scenario, to further increase the data rates of
the users. The simulation results show that the proposed beam steering method
can efficiently serve a high number of users, and with power optimization, a
data rate gain up to ten times is possible. The simulation results for NOMA
suggests an additional 10 Mbps sum rate gain for each NOMA user pair.


  In this paper, we introduce WeLayout, a novel system for segmenting the
layout of corporate documents, which stands for WeChat Layout Analysis System.
Our approach utilizes a sophisticated ensemble of DINO and YOLO models,
specifically developed for the ICDAR 2023 Competition on Robust Layout
Segmentation. Our method significantly surpasses the baseline, securing a top
position on the leaderboard with a mAP of 70.0. To achieve this performance, we
concentrated on enhancing various aspects of the task, such as dataset
augmentation, model architecture, bounding box refinement, and model ensemble
techniques. Additionally, we trained the data separately for each document
category to ensure a higher mean submission score. We also developed an
algorithm for cell matching to further improve our performance. To identify the
optimal weights and IoU thresholds for our model ensemble, we employed a
Bayesian optimization algorithm called the Tree-Structured Parzen Estimator.
Our approach effectively demonstrates the benefits of combining query-based and
anchor-free models for achieving robust layout segmentation in corporate
documents.


  We present preliminary measurements of the thermal conductivity of the heavy
fermion superconductor UPd$_2$Al$_3$ for the normal and superconducting states
at low temperatures. As T$\to$0, the superconducting state is characterized by
a finite linear term, about 10% of the normal state value, which suggests a
residual density of low energy quasiparticle states. This agrees qualitatively
with resonant impurity scattering theories applied to exotic superconductors
with nodes in the gap structure. Comparisons are made with theory and with
other U-based superconductors, such as URu$_2$Si$_2$ and UPt$_3$.


  One of the major challenges for collective intelligence is inconsistency,
which is unavoidable whenever subjective assessments are involved. Pairwise
comparisons allow one to represent such subjective assessments and to process
them by analyzing, quantifying and identifying the inconsistencies.
  We propose using smaller scales for pairwise comparisons and provide
mathematical and practical justifications for this change. Our postulate's aim
is to initiate a paradigm shift in the search for a better scale construction
for pairwise comparisons. Beyond pairwise comparisons, the results presented
may be relevant to other methods using subjective scales.
  Keywords: pairwise comparisons, collective intelligence, scale, subjective
assessment, inaccuracy, inconsistency.


  The dynamics near a hyperbolic point in phase space is modelled by an
inverted harmonic oscillator. We investigate the effect of the classical
instability on the open quantum dynamics of the oscillator, introduced through
the interaction with a thermal bath, using both the survival probability
function and the rate of von Neumann entropy increase, for large times. In this
parameter range we prove, using influence functional techniques, that the
survival probability function decreases exponentially at a rate, K', depending
not only on the measure of instability in the model but also on the strength of
interaction with the environment. We also show that K' determines the rate of
von Neumann entropy increase and that this result is independent of the
temperature of the environment. This generalises earlier results which are
valid in the limit of vanishing dissipation. The validity of inferring similar
rates of survival probability decrease and entropy increase for quantum chaotic
systems is also discussed.


  We include new data in an updated analysis of helium in low metallicity
extragalactic HII regions with the goal of deriving the primordial abundance of
He4 (Y_P). We show that the new observations of Izotov et al (ITL) are
consistent with previous data. However they should not be taken in isolation to
determine (Y_P) due to the lack of sufficiently low metallicity points. We use
the extant data in a semi-empirical approach to bounding the size of possible
systematic uncertainties in the determination of (Y_P). Our best estimate for
the primordial abundance of He4 assuming a linear relation between He4 and O/H
is Y_P = 0.230 \pm 0.003 (stat) based on the subset of HII regions with the
lowest metallicity; for our full data set we find Y_P = 0.234 \pm 0.002 (stat).
Both values are entirely consistent with our previous results. We discuss the
implications of these values for standard big bang nucleosynthesis (SBBN),
particularly in the context of recent measurements of deuterium in high
redshift, low metallicity QSO absorption-line systems.


  Using the large hadroproduced charm sample collected in experiment E791 at
Fermilab, we have measured ratios of branching fractions for the two-body
singly-Cabibbo-suppressed charged decays of the D0:
  (D0 -> KK)/(D0 -> Kpi) = 0.109 +- 0.003 +- 0.003,
  (D0 -> pipi)/(D0 -> Kpi) = 0.040 +- 0.002 +- 0.003, and
  (D0 -> KK)/(D0 -> pipi) = 2.75 +- 0.15 +- 0.16. We have looked for
differences in the decay rates of D0 and D0bar to the CP eigenstates K+K- and
pi+pi-, and have measured the CP asymmetry parameters
  A_CP(K+K-) = -0.010 +- 0.049 +- 0.012 and
  A_CP(pi+pi-) = -0.049 +- 0.078 +- 0.030, both consistent with zero.


  Single-propagator traces are the most elementary fermion Wick contractions
which occur in numerical lattice QCD, and are usually computed by introducing
random-noise estimators to profit from volume averaging. The additional
contribution to the variance induced by the random noise is typically orders of
magnitude larger than the one due to the gauge field. We propose a new family
of stochastic estimators of single-propagator traces built upon a frequency
splitting combined with a hopping expansion of the quark propagator, and test
their efficiency in two-flavour QCD with pions as light as 190 MeV. Depending
on the fermion bilinear considered, the cost of computing these diagrams is
reduced by one to two orders of magnitude or more with respect to standard
random-noise estimators. As two concrete examples of physics applications, we
compute the disconnected contributions to correlation functions of two vector
currents in the isosinglet omega channel and to the hadronic vacuum
polarization relevant for the muon anomalous magnetic moment. In both cases,
estimators with variances dominated by the gauge noise are computed with a
modest numerical effort. Theory suggests large gains for disconnected three and
higher point correlation functions as well. The frequency-splitting estimators
and their split-even components are directly applicable to the newly proposed
multi-level integration in the presence of fermions.


  This study investigates in detail the finite-size scaling of the
two-dimensional irrationally frustrated XY model. By means of Monte Carlo
simulations with entropic sampling, we examine the size dependence of the
specific heat, and find remarkable deviation from the conventional finite-size
scaling theory, which reveals novel intrinsic finite-size effects. Relaxation
dynamics of the system is also considered, and correspondingly, finite-size
scaling of the relaxation time is examined, again giving evidence for the
intrinsic finite-size effects and suggesting a zero-temperature glass
transition.


  The propagation of light in moving media is dragged by atomic motion. The
light-drag effect can be dramatically enhanced by reducing the group velocity
with electro-magnetically induced transparency (EIT). We develop a systematic
procedure to accurately reconstruct the complex wavefront of the slow light
with single-shot measurements, enabling precise, photon shot-noise limited
spectroscopic measurements of atomic response across EIT even in presence of
generic atomic number fluctuations. Applying the technique to an expanding
cloud of cold atoms, we demonstrate simultaneous inference of the atomic
density distribution and the velocity field from the complex imaging data. This
inline imaging technique may assist a wide range of cold atom experiments to
access spectroscopic and phase space information with in situ and minimally
destructive measurements.


  The emergence of machine learning methods in quantum chemistry provides new
methods to revisit an old problem: Can the predictive accuracy of electronic
structure calculations be decoupled from their numerical bottlenecks? Previous
attempts to answer this question have, among other methods, given rise to
semi-empirical quantum chemistry in minimal basis representation. We present an
adaptation of the recently proposed SchNet for Orbitals (SchNOrb) deep
convolutional neural network model [Nature Commun. 10, 5024 (2019)] for
electronic wave functions in an optimised quasi-atomic minimal basis
representation. For five organic molecules ranging from 5 to 13 heavy atoms,
the model accurately predicts molecular orbital energies and wavefunctions and
provides access to derived properties for chemical bonding analysis.
Particularly for larger molecules, the model outperforms the original
atomic-orbital-based SchNOrb method in terms of accuracy and scaling. We
conclude by discussing the future potential of this approach in quantum
chemical workflows.


  The clustering algorithm plays a crucial role in speaker diarization systems.
However, traditional clustering algorithms suffer from the complex distribution
of speaker embeddings and lack of digging potential relationships between
speakers in a session. We propose a novel graph-based clustering approach
called Community Detection Graph Convolutional Network (CDGCN) to improve the
performance of the speaker diarization system. The CDGCN-based clustering
method consists of graph generation, sub-graph detection, and Graph-based
Overlapped Speech Detection (Graph-OSD). Firstly, the graph generation refines
the local linkages among speech segments. Secondly the sub-graph detection
finds the optimal global partition of the speaker graph. Finally, we view
speaker clustering for overlap-aware speaker diarization as an overlapped
community detection task and design a Graph-OSD component to output
overlap-aware labels. By capturing local and global information, the speaker
diarization system with CDGCN clustering outperforms the traditional
Clustering-based Speaker Diarization (CSD) systems on the DIHARD III corpus.


  We have measured the temperature dependence of the in-plane London
penetration depth lambda(T) and the maximum Josephson current Ic(T) using
bicrystal grain boundary Josephson junctions of the electron-doped cuprate
superconductor Nd(1.85)Ce(0.15)CuO(4-y). Both quantities reveal an anomalous
temperature dependence below about 4 K. In contrast to the usual monotonous
decrease (increase) of lambda(T) (Ic(T)) with decreasing temperature, lambda(T)
and Ic(T) are found to increase and decrease, respectively, with decreasing
temperature below 4 K resulting in a non-monotonous overall temperature
dependence. This anomalous behavior was found to be absent in analogous
measurements performed on Pr(1.85)Ce(0.15)CuO(4-y). From this we conclude that
the anomalous behavior of Nd(1.85)Ce(0.15)CuO(4-y) is caused by the presence of
the Nd3+ paramagnetic moments. Correcting the measured lambda(T) dependence of
Nd(1.85)Ce(0.15)CuO(4-y) for the temperature dependent susceptibility due to
the Nd moments, an exponential dependence is obtained indicating isotropic
s-wave pairing. This result is fully consistent with the lambda(T) dependence
measured for Pr(1.85)Ce(0.15)CuO(4-y).


  We study dynamics of isolated quantum many-body systems under periodic
driving. We consider a driving protocol in which the Hamiltonian is switched
between two different operators periodically in time. The eigenvalue problem of
the associated Floquet operator maps onto an effective hopping problem in
energy space. Using the effective model, we establish conditions on the
spectral properties of the two Hamiltonians for the system to localize in
energy space. We find that ergodic systems always delocalize in energy space
and heat up to infinite temperature, for both local and global driving. In
contrast, many-body localized systems with quenched disorder remain localized
at finite energy. We argue that our results hold for general driving protocols,
and discuss their experimental implications.


  This paper proposes an accelerated proximal stochastic variance reduced
gradient (ASVRG) method, in which we design a simple and effective momentum
acceleration trick. Unlike most existing accelerated stochastic variance
reduction methods such as Katyusha, ASVRG has only one additional variable and
one momentum parameter. Thus, ASVRG is much simpler than those methods, and has
much lower per-iteration complexity. We prove that ASVRG achieves the best
known oracle complexities for both strongly convex and non-strongly convex
objectives. In addition, we extend ASVRG to mini-batch and non-smooth settings.
We also empirically verify our theoretical results and show that the
performance of ASVRG is comparable with, and sometimes even better than that of
the state-of-the-art stochastic methods.


  On compact Riemannian manifolds with a large isometry group we investigate
the invariant spectrum of the ordinary Laplacian. For either a toric Kaehler
metric, or a rotationally-symmetric metric on the sphere, we produce upper
bounds for all eigenvalues of the invariant spectrum assuming non-negative
scalar curvature.


  In this article we study minimal homeomorphisms(all orbits are dense) of the
tori $T^{n},$ $n<5.$ The linear part of a homeomorphism $\phi $ of $T^{n}$ is
the linear mapping $L$ induced by $\phi $ on the first homology group of
$T^{n}$. It follows from the Lefschetz fixed point theorem that 1 is an
eigenvalue of $L$ if $\phi $ minimal. We show that if $\phi $ is minimal and
$n<5$ then $L$ is quasi-unipontent, i.e., all the eigenvalues of $L$ are roots
of unity and conversely if $L\in GL(n,\Z)$ is quasi-unipotent and 1 is an
eigenvalue of $L$ then there exists a $ C^{\infty}$ minimal skew-product
diffeomorphism $\phi $ of $T^{n}$ whose linear part is precisely $L.$ We do not
know if these results are true for $n>4$. We give a sufficient condition for a
smooth skew-product diffeomorphism of a torus of arbitrary dimension to be
smoothly conjugate to an affine transformation.


  Neural Networks trained with gradient descent are known to be susceptible to
catastrophic forgetting caused by parameter shift during the training process.
In the context of Neural Machine Translation (NMT) this results in poor
performance on heterogeneous datasets and on sub-tasks like rare phrase
translation. On the other hand, non-parametric approaches are immune to
forgetting, perfectly complementing the generalization ability of NMT. However,
attempts to combine non-parametric or retrieval based approaches with NMT have
only been successful on narrow domains, possibly due to over-reliance on
sentence level retrieval. We propose a novel n-gram level retrieval approach
that relies on local phrase level similarities, allowing us to retrieve
neighbors that are useful for translation even when overall sentence similarity
is low. We complement this with an expressive neural network, allowing our
model to extract information from the noisy retrieved context. We evaluate our
semi-parametric NMT approach on a heterogeneous dataset composed of WMT, IWSLT,
JRC-Acquis and OpenSubtitles, and demonstrate gains on all 4 evaluation sets.
The semi-parametric nature of our approach opens the door for non-parametric
domain adaptation, demonstrating strong inference-time adaptation performance
on new domains without the need for any parameter updates.


  The impressive development of global numerical simulations of turbulent
stellar interiors unveiled a variety of possible differential rotation (solar
or anti-solar), meridional circulation (single or multi-cellular), and dynamo
states (stable large scale toroidal field or periodically reversing magnetic
fields). Various numerical schemes, based on the so-called anelastic set of
equations, were used to obtain these results. It appears today mandatory to
assess their robustness with respect to the details of the numerics, and in
particular to the treatment of turbulent sub-grid scales. We report on an
ongoing comparison between two global models, the ASH and EULAG codes. In EULAG
the sub-grid scales are treated implicitly by the numerical scheme, while in
ASH their effect is generally modelled by using enhanced dissipation
coefficients. We characterize the sub-grid scales effect in a turbulent
convection simulation with EULAG. We assess their effect at each resolved scale
with a detailed energy budget. We derive equivalent eddy-diffusion coefficients
and use the derived diffusivities in twin ASH numerical simulations. We find a
good agreement between the large-scale flows developing in the two codes in the
hydrodynamic regime, which encourages further investigation in the
magnetohydrodynamic regime for various dynamo solutions.


  We propose a mechanism for the observed stacking charge order in the
quarter-filled ladder compound NaV2O5. Via a standard mapping of the charge
degrees of freedom onto Ising spins we explain the stacking order as a result
of competition between couplings of the nearest and next-nearest planes with
the 4-fold degenerate super-antiferroelectric in-plane order.


  Big Bang Nucleosynthesis imposes stringent bounds on light sterile neutrinos
mixing with the active flavors. Here we discuss how altered dispersion
relations can weaken such bounds and allow compatibility of new sterile
neutrino degrees of freedom with a successful generation of the light elements
in the early Universe.


  In order to study such effects like parton saturation in final states at the
LHC one of the approaches is to combine physics of the BK and the CCFM
evolution equations. We report on recently obtained resummed form of the BK
equation and nonlinear extension of the CCFM equation.


  As an indispensable ingredient of intelligence, commonsense reasoning is
crucial for large language models (LLMs) in real-world scenarios. In this
paper, we propose CORECODE, a dataset that contains abundant commonsense
knowledge manually annotated on dyadic dialogues, to evaluate the commonsense
reasoning and commonsense conflict detection capabilities of Chinese LLMs. We
categorize commonsense knowledge in everyday conversations into three
dimensions: entity, event, and social interaction. For easy and consistent
annotation, we standardize the form of commonsense knowledge annotation in
open-domain dialogues as "domain: slot = value". A total of 9 domains and 37
slots are defined to capture diverse commonsense knowledge. With these
pre-defined domains and slots, we collect 76,787 commonsense knowledge
annotations from 19,700 dialogues through crowdsourcing. To evaluate and
enhance the commonsense reasoning capability for LLMs on the curated dataset,
we establish a series of dialogue-level reasoning and detection tasks,
including commonsense knowledge filling, commonsense knowledge generation,
commonsense conflict phrase detection, domain identification, slot
identification, and event causal inference. A wide variety of existing
open-source Chinese LLMs are evaluated with these tasks on our dataset.
Experimental results demonstrate that these models are not competent to predict
CORECODE's plentiful reasoning content, and even ChatGPT could only achieve
0.275 and 0.084 accuracy on the domain identification and slot identification
tasks under the zero-shot setting. We release the data and codes of CORECODE at
https://github.com/danshi777/CORECODE to promote commonsense reasoning
evaluation and study of LLMs in the context of daily conversations.


  Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in
$\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert
x-y \rVert :x,y\in E\}$, where $\lVert \alpha
\rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich, Koh and Parshall (2018) proved
that if $d\geq 2$ is even and $|E|\geq 9q^{d/2}$, then $$\mathbb{F}_q=
\frac{\Delta(E)}{\Delta(E)}=\left\{\frac{a}{b}: a\in \Delta(E),\ b\in
\Delta(E)\setminus\{0\} \right\}.$$ In other words, for each $r\in
\mathbb{F}_q^*$ there exist $(x,y)\in E^2$ and $(x',y')\in E^2$ such that
$\lVert x-y\rVert\neq0$ and $\lVert x'-y' \rVert=r\lVert x-y\rVert$.
  Geometrically, this means that if the size of $E$ is large, then for any
given $r \in \mathbb{F}_q^*$ we can find a pair of edges in the complete graph
$K_{|E|}$ with vertex set $E$ such that one of them is dilated by $r\in
\mathbb{F}_q^*$ with respect to the other. A natural question arises whether it
is possible to generalize this result to arbitrary subgraphs of $K_{|E|}$ with
vertex set $E$ and this is the goal of this paper.
  In this paper, we solve this problem for $k$-paths $(k\geq 2)$, simplexes and
4-cycles. We are using a mix of tools from different areas such as enumerative
combinatorics, group actions and Tur\'an type theorems.


  Exceptional dicretizations of the phi4 model are reviewed, corresponding
conservation laws are reported, and the properties of static and moving
discrete kinks are discussed. Different approaches to producing such
discretizations are given and unifying perspectives thereof are brought forth.
It is also demonstrated that the high kink mobility in the exceptional
dicretizations makes it possible to analyze kink-antikink collisions in the
regime of high discreteness.


  We provide an extension of concurrent Kleene algebras to account for
probabilistic properties. The algebra yields a unified framework containing
nondeterminism, concurrency and probability and is sound with respect to the
set of probabilistic automata modulo probabilistic simulation. We use the
resulting algebra to generalise the algebraic formulation of a variant of
Jones' rely/guarantee calculus.


  In cyclic universe models based on a single scalar field (e.g., the radion
determining the distance between branes in M-theory), virtually the entire
universe makes it through the ekpyrotic smoothing and flattening phase,
bounces, and enters a new epoch of expansion and cooling. This stable evolution
cannot occur, however, if scale-invariant curvature perturbations are produced
by the entropic mechanism because it requires two scalar fields (e.g., the
radion and the Calabi-Yau dilaton) evolving along an unstable classical
trajectory. In fact, we show here that an overwhelming fraction of the universe
fails to make it through the ekpyrotic phase; nevertheless, a sufficient volume
survives and cycling continues forever provided the dark energy phase of the
cycle lasts long enough, of order a trillion years. Two consequences are a new
role for dark energy and a global structure of the universe radically different
from that of eternal inflation.


  We present a novel numerical method for solving ODEs while preserving
polynomial first integrals. The method is based on introducing multiple
quadratic auxiliary variables to reformulate the ODE as an equivalent but
higher-dimensional ODE with only quadratic integrals to which the midpoint rule
is applied. The quadratic auxiliary variables can subsequently be eliminated
yielding a midpoint-like method on the original phase space. The resulting
method is shown to be a novel discrete gradient method. Furthermore, the
averaged vector field method can be obtained as a special case of the proposed
method. The method can be extended to higher-order through composition and is
illustrated through a number of numerical examples.


  In this paper we consider three different kinds of domain-dependent control
knowledge (temporal, procedural and HTN-based) that are useful in planning. Our
approach is declarative and relies on the language of logic programming with
answer set semantics (AnsProlog*). AnsProlog* is designed to plan without
control knowledge. We show how temporal, procedural and HTN-based control
knowledge can be incorporated into AnsProlog* by the modular addition of a
small number of domain-dependent rules, without the need to modify the planner.
We formally prove the correctness of our planner, both in the absence and
presence of the control knowledge. Finally, we perform some initial
experimentation that demonstrates the potential reduction in planning time that
can be achieved when procedural domain knowledge is used to solve planning
problems with large plan length.


  Generalized Class Discovery (GCD) aims to dynamically assign labels to
unlabelled data partially based on knowledge learned from labelled data, where
the unlabelled data may come from known or novel classes. The prevailing
approach generally involves clustering across all data and learning conceptions
by prototypical contrastive learning. However, existing methods largely hinge
on the performance of clustering algorithms and are thus subject to their
inherent limitations. Firstly, the estimated cluster number is often smaller
than the ground truth, making the existing methods suffer from the lack of
prototypes for comprehensive conception learning. To address this issue, we
propose an adaptive probing mechanism that introduces learnable potential
prototypes to expand cluster prototypes (centers). As there is no ground truth
for the potential prototype, we develop a self-supervised prototype learning
framework to optimize the potential prototype in an end-to-end fashion.
Secondly, clustering is computationally intensive, and the conventional
strategy of clustering both labelled and unlabelled instances exacerbates this
issue. To counteract this inefficiency, we opt to cluster only the unlabelled
instances and subsequently expand the cluster prototypes with our introduced
potential prototypes to fast explore novel classes. Despite the simplicity of
our proposed method, extensive empirical analysis on a wide range of datasets
confirms that our method consistently delivers state-of-the-art results.
Specifically, our method surpasses the nearest competitor by a significant
margin of 9.7% within the Stanford Cars dataset and 12x clustering efficiency
within the Herbarium 19 dataset. We will make the code and checkpoints publicly
available at https://github.com/xjtuYW/PNP.git.


  The motions of domain walls driven by magnetic field in soft magnetic
nanostripes were calculated. The domain walls reveal steady motions in the low
fields and oscillations of their internal structure above a critical field. A
developed soliton model of the walls explains its dynamics by the motions of a
limited number of magnetic topological solitons such as vortex and antivortex.
We predict the reduced wall velocity and critical field in the low-field
regime, and increased wall-oscillation frequency in nanostripes, compared to 1D
Walker solution for bulk magnets. The critical field and velocity are
determined by the nanostripe sizes, whereas the oscillation frequency depends
only on the field strength.


  We experimentally demonstrate amplitude and phase modulation of a time-energy
entangled two-photon wave function. The entangled photons are produced by
spontaneous parametric down-conversion, spectrally dispersed in an prism
compressor, modulated in amplitude and/or phase, and detected in coincidence by
sum-frequency generation. First, we present a Fourier optical analysis of the
optical setup yielding an analytic expression for the resulting field
distribution at the exit plane of the shaping apparatus. We then introduce
amplitude and/or phase shaping and present results which can only be obtained
through a combination of the two. Specifically, we use a shaper-based
interferometer to measure the two-photon interference of an almost
bandwidth-limited two-photon wave function.


  In the literature it is assumed that the parton to hadron fragmentation
function cannot be studied by using the lattice QCD method because of the sum
over the (unobserved) outgoing hadronic states. However, in this paper we find
that since the hadron formation from the partons can be studied by using the
lattice QCD method, the parton to hadron fragmentation function can be studied
by using the lattice QCD method by using the LSZ reduction formula for the
partonic processes.


  Fermi velocity, $v_F$, is one of the primary characteristics of any
conductor, including superconductors. For conductors at ambient pressure
several experimental techniques have been developed to measure $v_F$ and, for
instance, Zhou et al (Nature 423 398 (2003)) reported that high-Tc cuprates
exhibit universal nodal Fermi velocity of $v_F$ = $2.7*10^5$ m/s. However,
there were no experimental techniques applied to measure $v_F$ in
highly-compressed near-room-temperature superconductors (NRTS), due to
experimental challenges. Here to answer a question about the existence of the
universal Fermi velocity in NRTS materials, we analyzed full inventory of the
ground-state upper critical field data, Bc2(0), for these materials and found
that this class of superconductors exhibits universal Fermi velocity of $v_F$ =
(1/1.3)*(2${\Delta}$(0)/(kBTc))*10^5 m/s (where ${\Delta}(0)$ is ground state
amplitude of the energy gap). Due to the ratio of 2${\Delta}$(0)/$({k_B}{T_c})$
is varying within a narrow arrange of 3.2 < 2${\Delta}$(0)/$({k_B}{T_c})$ < 5,
then $v_F$ in NRTS materials is within the same ballpark with its high-Tc
cuprates counterpart.


  IOP4 is a pipeline to perform photometry and polarimetry analysis of optical
data from Calar Alto (CAHA) and Sierra Nevada (OSN) observatories. IOP4
implements Object Relational Mapping (ORM) to seamlessly integrate all
information about the reduction and results in a database which can be used to
query and plot results, flag data and inspect the reduction process in an
integrated fashion with the whole pipeline. It also ships with an already
built-in web interface which can be used out of the box to browse the database
and supervise all pipeline processes. It is built to ease debugging and
inspection of data. Reduction from five different instruments are already
implemented: RoperT90, AndorT90 and DIPOL (at OSN 0.9m telescope), AndorT150
(OSN 1.5m telescope) and CAFOS (CAHA 2.2m telescope). IOP4's modular design
allows for easy integration of new observatories and instruments, and its
results have already featured in several high-impact refereed publications. In
this paper we describe the implementation and characteristics of IOP4.


  In order to reliably compute the longitudinal structure functions in decaying
and forced turbulence, local isotropy is examined with the aid of the isotropic
expression of the incompressible conditions for the second and third order
structure functions. Furthermore, the Karman-Howarth-Kolmogorov relation is
investigated to examine the effects of external forcing and temporally
decreasing of the second order structure function. On the basis of these
investigations, the scaling range and exponents $\zeta_n$ of the longitudinal
structure functions are determined for decaying and forced turbulence with the
aid of the extended-self-similarity (ESS) method. We find that $\zeta_n$'s are
smaller, for $n \geq 4$, in decaying turbulence than in forced turbulence. The
reasons for this discrepancy are discussed. Analysis of the local slopes of the
structure functions is used to justify the ESS method.


  Using data of nearby galaxies from the Sloan Digital Sky Survey we
investigate whether stellar mass, central velocity dispersion, surface mass
density, or the Sersic n parameter is best correlated with a galaxy's
rest-frame color. Specifically, we determine how the mean color of galaxies
varies with one parameter when another is fixed. When the stellar mass is fixed
we see that strong trends remain with all other parameters, whereas residual
trends are weaker when surface mass density, n, or velocity dispersion are
fixed. Overall velocity dispersion is the best indicator of a galaxy's typical
color, showing the largest residual color dependence when any of the other
three parameters are fixed, and stellar mass is the poorest. Other studies have
indicated that both the halo and black hole properties are better correlated
with velocity dispersion than with stellar mass, surface mass density or Sersic
n. Therefore, our results are consistent with a picture where a galaxy's star
formation history and present star formation rate are determined to some
significant degree by the current properties and assembly history of its dark
matter halo and/or the feedback from its central super massive black hole.


  Evidence for two different physical mechanisms for acceleration of solar
energetic particles (SEPs) arose 50 years ago with radio observations of type
III bursts, produced by outward streaming electrons, and type II bursts from
coronal and interplanetary shock waves. Since that time we have found that the
former are related to "impulsive" SEP events from impulsive flares or jets.
Here, resonant stochastic acceleration, related to magnetic reconnection
involving open field lines, produces not only electrons but 1000-fold
enhancements of 3He/4He and of (Z>50)/O. Alternatively, in "gradual" SEP
events, shock waves, driven out from the Sun by coronal mass ejections (CMEs),
more democratically sample ion abundances that are even used to measure the
coronal abundances of the elements. Sometimes residual impulsive suprathermal
ions contribute to the seed population for shock acceleration, complicating the
abundance picture, but this process has now been modeled theoretically.
Initially, impulsive events define a point source on the Sun, selectively
filling few magnetic flux tubes, while gradual events show broad acceleration
that can fill half of the inner heliosphere, beginning when the shock reaches
~2 solar radii. Shock acceleration occurs as ions are scattered back and forth
across the shock by resonant Alfven waves amplified by the accelerated protons
themselves. These waves also can produce a streaming-limited maximum SEP
intensity and plateau region upstream of the shock. Behind the shock lies the
large expanse of the "reservoir", a spatially extensive trapped volume of
uniform SEP intensities with invariant energy-spectral shapes where overall
intensities decrease with time as the enclosing "magnetic bottle" expands
adiabatically. These reservoirs now explain the slow intensity decrease that
defines gradual events, once erroneously attributed solely to slow outward
diffusion.


  Social technology research today largely focuses on mitigating the negative
impacts of technology and, therefore, often misses the potential of technology
to enhance human connections and well-being. However, we see a potential to
shift towards a holistic view of social technology's impact on human
flourishing. We introduce Positive Social Technology (Positech), a framework
that shifts emphasis toward leveraging social technologies to support and
augment human flourishing. This workshop is organized around three themes
relevant to Positech: 1) "Exploring Relevant and Adjacent Research" to define
and widen the Positech scope with insights from related fields, 2) "Projecting
the Landscape of Positech" for participants to outline the domain's key aspects
and 3) "Envisioning the Future of Positech," anchored around strategic planning
towards a sustainable research community. Ultimately, this workshop will serve
as a platform to shift the narrative of social technology research towards a
more positive, human-centric approach. It will foster research that goes beyond
fixing technologies to protect humans from harm, to also pursue enriching human
experiences and connections through technology.


  Image denoising is one of the most critical problems in mobile photo
processing. While many solutions have been proposed for this task, they are
usually working with synthetic data and are too computationally expensive to
run on mobile devices. To address this problem, we introduce the first Mobile
AI challenge, where the target is to develop an end-to-end deep learning-based
image denoising solution that can demonstrate high efficiency on smartphone
GPUs. For this, the participants were provided with a novel large-scale dataset
consisting of noisy-clean image pairs captured in the wild. The runtime of all
models was evaluated on the Samsung Exynos 2100 chipset with a powerful Mali
GPU capable of accelerating floating-point and quantized neural networks. The
proposed solutions are fully compatible with any mobile GPU and are capable of
processing 480p resolution images under 40-80 ms while achieving high fidelity
results. A detailed description of all models developed in the challenge is
provided in this paper.


  In this note, we correct an error in arXiv:1702.04949 by adding an additional
assumption of join completeness. We demonstrate with examples why this
assumption is necessary, and discuss how join completeness relates to other
properties of a skew lattice.


  We develop the effective field theory of diffusive Nambu-Goldstone (NG) modes
associated with spontaneous internal symmetry breaking taking place in
nonequilibrium open systems. The effective Lagrangian describing semi-classical
dynamics of the NG modes is derived and matching conditions for low-energy
coefficients are also investigated. Due to new terms peculiar to open systems,
the associated NG modes show diffusive gapless behaviors in contrast to the
propagating NG mode in closed systems. We demonstrate two typical situations
relevant to the condensed matter physics and high-energy physics, where
diffusive type-A or type-B NG modes appear.