title:
On-line approach to off-line coloring problems on graphs with geometric
  representations

abstract:
  The main goal of this paper is to formalize and explore a connection between
chromatic properties of graphs with geometric representations and competitive
analysis of on-line algorithms, which became apparent after the recent
construction of triangle-free geometric intersection graphs with arbitrarily
large chromatic number due to Pawlik et al. We show that on-line graph coloring
problems give rise to classes of game graphs with a natural geometric
interpretation. We use this concept to estimate the chromatic number of graphs
with geometric representations by finding, for appropriate simpler graphs,
on-line coloring algorithms using few colors or proving that no such algorithms
exist.
  We derive upper and lower bounds on the maximum chromatic number that
rectangle overlap graphs, subtree overlap graphs, and interval filament graphs
(all of which generalize interval overlap graphs) can have when their clique
number is bounded. The bounds are absolute for interval filament graphs and
asymptotic of the form $(\log\log n)^{f(\omega)}$ for rectangle and subtree
overlap graphs, where $f(\omega)$ is a polynomial function of the clique number
and $n$ is the number of vertices. In particular, we provide the first
construction of geometric intersection graphs with bounded clique number and
with chromatic number asymptotically greater than $\log\log n$.
  We also introduce a concept of $K_k$-free colorings and show that for some
geometric representations, $K_3$-free chromatic number can be bounded in terms
of clique number although the ordinary ($K_2$-free) chromatic number cannot.
Such a result for segment intersection graphs would imply a well-known
conjecture that $k$-quasi-planar geometric graphs have linearly many edges.


title:
Absorption enhancement in photonic crystal thin films by pseudo
  disordered perturbations

abstract:
  The effects resulting from the introduction of a controlled perturbation in a
single pattern membrane on its absorption are first studied and then analyzed
on the basis of band folding considerations. The interest of this approach for
photovoltaic applications is finally demonstrated by overcoming the integrated
absorption of an optimized single pattern membrane through the introduction of
a proper pseudo disordered perturbation.


title:
Boundary Element and Finite Element Coupling for Aeroacoustics
  Simulations

abstract:
  We consider the scattering of acoustic perturbations in a presence of a flow.
We suppose that the space can be split into a zone where the flow is uniform
and a zone where the flow is potential. In the first zone, we apply a
Prandtl-Glauert transformation to recover the Helmholtz equation. The
well-known setting of boundary element method for the Helmholtz equation is
available. In the second zone, the flow quantities are space dependent, we have
to consider a local resolution, namely the finite element method. Herein, we
carry out the coupling of these two methods and present various applications
and validation test cases. The source term is given through the decomposition
of an incident acoustic field on a section of the computational domain's
boundary.


title: Validation Experiments for LBM Simulations of Electron Beam Melting

abstract:
  This paper validates 3D simulation results of electron beam melting (EBM)
processes comparing experimental and numerical data. The physical setup is
presented which is discretized by a three dimensional (3D) thermal lattice
Boltzmann method (LBM). An experimental process window is used for the
validation depending on the line energy injected into the metal powder bed and
the scan velocity of the electron beam. In the process window the EBM products
are classified into the categories, porous, good and swelling, depending on the
quality of the surface. The same parameter sets are used to generate a
numerical process window. A comparison of numerical and experimental process
windows shows a good agreement. This validates the EBM model and justifies
simulations for future improvements of EBM processes. In particular numerical
simulations can be used to explain future process window scenarios and find the
best parameter set for a good surface quality and dense products.


title:
Logarithmic Corrections to Extremal Black Hole Entropy in N = 2, 4 and 8
  Supergravity

abstract:
  We compute the logarithmic correction to black hole entropy about
exponentially suppressed saddle points of the Quantum Entropy Function
corresponding to Z(N) orbifolds of the near horizon geometry of the extremal
black hole under study. By carefully accounting for zero mode contributions we
show that the logarithmic contributions for quarter--BPS black holes in N=4
supergravity and one--eighth BPS black holes in N=8 supergravity perfectly
match with the prediction from the microstate counting. We also find that the
logarithmic contribution for half--BPS black holes in N = 2 supergravity
depends non-trivially on the Z(N) orbifold. Our analysis draws heavily on the
results we had previously obtained for heat kernel coefficients on Z(N)
orbifolds of spheres and hyperboloids in arXiv:1311.6286 and we also propose a
generalization of the Plancherel formula to Z(N) orbifolds of hyperboloids to
an expression involving the Harish-Chandra character of SL(2,R), a result which
is of possible mathematical interest.


title:
Self-Aligned Double Patterning Friendly Configuration for Standard Cell
  Library Considering Placement

abstract:
  Self-aligned double patterning (SADP) has become a promising technique to
push pattern resolution limit to sub-22nm technology node. Although SADP
provides good overlay controllability, it encounters many challenges in
physical design stages to obtain conflict-free layout decomposition. In this
paper, we study the impact on placement by different standard cell layout
decomposition strategies. We propose a SADP friendly standard cell
configuration which provides pre-coloring results for standard cells. These
configurations are brought into the placement stage to help ensure layout
decomposability and save the extra effort for solving conflicts in later
stages.


title: Time Dependent Couplings as Observables in de Sitter Space

abstract:
  We summarize and expand our investigations concerning the soft graviton
effects on microscopic matter dynamics in de Sitter space. The physical
couplings receive IR logarithmic corrections which are sensitive to the IR
cut-off at the one-loop level. The scale invariant spectrum in the
gravitational propagator at the super-horizon scale is the source of the de
Sitter symmetry breaking. The quartic scalar, Yukawa and gauge couplings become
time dependent and diminish with time. In contrast, the Newton's constant
increases with time. We clarify the physical mechanism behind these effects in
terms of the conformal mode dynamics in analogy with 2d quantum gravity. We
show that they are the inevitable consequence of the general covariance and
lead to gauge invariant predictions. We construct a simple model in which the
cosmological constant is self-tuned to vanish due to UV-IR mixing effect. We
also discuss phenomenological implications such as decaying Dark Energy and
SUSY breaking at the Inflation era. The quantum effect alters the classical
slow roll picture in general if the tensor-to-scalar ratio $r$ is as small as
$0.01$.


title:
A Complete Spectral Analysis of the Jackiw-Rebbi Model, Including its
  Zero Mode

abstract:
  In this paper we present a complete and exact spectral analysis of the
$(1+1)$-dimensional model that Jackiw and Rebbi considered to show that the
half-integral fermion numbers are possible due to the presence of an isolated
self charge conjugate zero mode. The model possesses the charge and particle
conjugation symmetries. These symmetries mandate the reflection symmetry of the
spectrum about the line $E=0$. We obtain the bound state energies and wave
functions of the fermion in this model using two different methods,
analytically and exactly, for every arbitrary choice of the parameters of the
kink, i.e. its value at spatial infinity ($\theta_0$) and its scale of
variations ($\mu$). Then, we plot the bound state energies of the fermion as a
function of $\theta_0$. This graph enables us to consider a process of building
up the kink from the trivial vacuum. We can then determine the origin and
evolution of the bound state energy levels during this process. We see that the
model has a dynamical mass generation process at the first quantized level and
the zero-energy fermionic mode responsible for the fractional fermion number,
is always present during the construction of the kink and its origin is very
peculiar, indeed. We also observe that, as expected, none of the energy levels
crosses each other. Moreover, we obtain analytically the continuum scattering
wave functions of the fermion and then calculate the phase shifts of these wave
functions. Using the information contained in the graphs of the phase shifts
and the bound states, we show that our phase shifts are consistent with the
weak and strong forms of the Levinson theorem. Finally, using the weak form of
the Levinson theorem, we confirm that the number of the zero-energy fermionic
modes is exactly one.


title: On stable equivalences with endopermutation source

abstract:
  We show that a bimodule between block algebras which has a fusion stable
endopermutation module as a source and which induces Morita equivalences
between centralisers of nontrivial subgroups of a defect group induces a stable
equivalence of Morita type; this is a converse to a theorem of Puig. The
special case where the source is trivial has long been known by many authors.
The earliest instance for a result deducing a stable equivalence of Morita type
from local Morita equivalences with possibly nontrivial endopermutation source
is due to Puig, in the context of blocks with abelian defect groups with a
Frobenius inertial quotient. The present note is motivated by an application,
due to Biland, to blocks of finite groups with structural properties known to
hold for hypothetical minimal counterexamples to the $Z_p^*$-Theorem.


title: Strong Equivalence Relations for Iterated Models

abstract:
  The Iterated Immediate Snapshot model (IIS), due to its elegant geometrical
representation, has become standard for applying topological reasoning to
distributed computing. Its modular structure makes it easier to analyze than
the more realistic (non-iterated) read-write Atomic-Snapshot memory model (AS).
It is known that AS and IIS are equivalent with respect to \emph{wait-free
task} computability: a distributed task is solvable in AS if and only if it
solvable in IIS. We observe, however, that this equivalence is not sufficient
in order to explore solvability of tasks in \emph{sub-models} of AS (i.e.
proper subsets of its runs) or computability of \emph{long-lived} objects, and
a stronger equivalence relation is needed. In this paper, we consider
\emph{adversarial} sub-models of AS and IIS specified by the sets of processes
that can be \emph{correct} in a model run. We show that AS and IIS are
equivalent in a strong way: a (possibly long-lived) object is implementable in
AS under a given adversary if and only if it is implementable in IIS under the
same adversary. %This holds whether the object is one-shot or long-lived.
Therefore, the computability of any object in shared memory under an
adversarial AS scheduler can be equivalently investigated in IIS.


title:
A comparison of linear and non-linear calibrations for speaker
  recognition

abstract:
  In recent work on both generative and discriminative score to
log-likelihood-ratio calibration, it was shown that linear transforms give good
accuracy only for a limited range of operating points. Moreover, these methods
required tailoring of the calibration training objective functions in order to
target the desired region of best accuracy. Here, we generalize the linear
recipes to non-linear ones. We experiment with a non-linear, non-parametric,
discriminative PAV solution, as well as parametric, generative,
maximum-likelihood solutions that use Gaussian, Student's T and
normal-inverse-Gaussian score distributions. Experiments on NIST SRE'12 scores
suggest that the non-linear methods provide wider ranges of optimal accuracy
and can be trained without having to resort to objective function tailoring.


title: Diagonal Couplings of Quantum Markov Chains

abstract:
  In this article we extend the coupling method from classical probability
theory to quantum Markov chains on atomic von Neumann algebras. In particular,
we establish a coupling inequality, which allow us to estimate convergence
rates by analyzing couplings. For a given tensor dilation we construct a
self-coupling of a Markov operator. It turns out that on a dense subset the
coupling is a dual version of the extended dual transition operator previously
studied by Gohm etal. We deduce that this coupling is successful if and only if
the dilation is asymptotically complete.


title:
Nucleon-Nucleon scattering from dispersion relations:
  next-to-next-to-leading order study

abstract:
  We study nucleon-nucleon ($NN$) scattering by applying the $N/D$ method in
chiral perturbation theory up to next-to-next-to-leading (NNLO) order in the
calculation of the imaginary part of the $NN$ partial-wave amplitudes along the
left-hand-cut, which is the dynamical input for this approach. A quite good
reproduction of the Nijmegen partial-wave analysis phase shifts and mixing
angles is obtained, which implies a steady improvement in the accurateness
achieved by increasing the chiral order in the calculation of the dynamical
input. A power counting for the subtraction constants is established, which is
appropriate for those subtractions attached to both the left- and right-hand
cuts. We discuss that it is not necessary to modify the $NN$ chiral potential
at NNLO to agree with data, but instead one should perform the iteration of
two-nucleon intermediate states to finally achieve analytic and unitarity $NN$
partial-wave amplitudes in a well-defined way. We also confirm at NNLO the
long-range correlations between the $NN$ $S$-wave effective ranges and
scattering lengths, when employing only once-subtracted dispersion relations,
that holds up to around 10% when compared with experimental values.


title: Stagnation, Creation, Breaking

abstract:
  This note deals with the mono-dimensional equation: $\d_t u -\d_x L(u_x) =f$
with $L(\cdot)$ merely monotone. The goal is to examine the features of facets
-- flat regions of graphs of solutions appearing as $L(\cdot)$ suffers jumps.
We concentrate on examples explaining strong stability, creation and even
breaking of facets.


title:
Observation of double pygmy resonances in $^{195,196}$Pt and enhanced
  astrophysical reaction rates

abstract:
  Our measurements of $^{195,196}$Pt $\gamma$-strength functions show a
double-humped enhancement in the $E_{\gamma}= 4-8$ MeV region. For the first
time, the detailed shape of these resonances is revealed for excitation
energies in the quasicontinuum. We demonstrate that the corresponding
neutron-capture cross sections and astrophysical reaction rates are increased
by up to a factor of 2 when these newly observed pygmy resonances are included.
These results lend credence to theoretical predictions of enhanced reaction
rates due to such pygmy resonances and hence are important for a better
understanding of r-process nucleosynthesis.


title: Semiclassical limits of quantum partition functions on infinite graphs

abstract:
  We prove that if $H$ denotes the operator corresponding to the canonical
Dirichlet form on a possibly locally infinite weighted graph $(X,b,m)$, and if
$v:X\to \mathbb{R}$ is such that $H+v/\hbar$ is well-defined as a form sum for
all $\hbar >0$, then the quantum partition function
$\mathrm{tr}(\mathrm{e}^{-\beta \hbar ( H + v/\hbar)})$ satisfies $$
\mathrm{tr}(\mathrm{e}^{-\beta \hbar ( H + v/\hbar)})\xrightarrow[]{\hbar\to
0+}\sum_{x\in X} \mathrm{e}^{-\beta v(x)} \text{ for all $\beta>0$}, $$
regardless of the fact whether $\mathrm{e}^{-\beta v}$ is apriori summable or
not. We also prove natural generalizations of this semiclassical limit to a
large class of covariant Schr\"odinger operators that act on sections in
Hermitian vector bundle over $(X,m,b)$, a result that particularly applies to
magnetic Schr\"odinger operators that are defined on $(X,m,b)$.


title:
Sliding window and compressive sensing for low-field dynamic magnetic
  resonance imaging

abstract:
  We describe an acquisition/processing procedure for image reconstruction in
dynamic Magnetic Resonance Imaging (MRI). The approach requires sliding window
to record a set of trajectories in the k-space, standard regularization to
reconstruct an estimate of the object and compressed sensing to recover image
residuals. We validated this approach in the case of specific simulated
experiments and, in the case of real measurements, we showed that the procedure
is reliable even in the case of data acquired by means of a low-field scanner.


title: A degree bound for families of rational curves on surfaces

abstract:
  We give an upper bound for the degree of rational curves in a family that
covers a given birational ruled surface in projective space. The upper bound is
stated in terms of the degree, sectional genus and arithmetic genus of the
surface. We introduce an algorithm for constructing examples where the upper
bound is tight. As an application of our methods we improve an inequality on
lattice polygons.


title:
String-Averaging Expectation-Maximization for Maximum Likelihood
  Estimation in Emission Tomography

abstract:
  We study the maximum likelihood model in emission tomography and propose a
new family of algorithms for its solution, called String-Averaging
Expectation-Maximization (SAEM). In the String-Averaging algorithmic regime,
the index set of all underlying equations is split into subsets, called
"strings," and the algorithm separately proceeds along each string, possibly in
parallel. Then, the end-points of all strings are averaged to form the next
iterate. SAEM algorithms with several strings presents better practical merits
than the classical Row-Action Maximum-Likelihood Algorithm (RAMLA). We present
numerical experiments showing the effectiveness of the algorithmic scheme in
realistic situations. Performance is evaluated from the computational cost and
reconstruction quality viewpoints. A complete convergence theory is also
provided.


title: Equal Sum Sequences and Imbalance Sets of Tournaments

abstract:
  Reid conjectured that any finite set of non-negative integers is the score
set of some tournament and Yao gave a non-constructive proof of Reid's
conjecture using arithmetic arguments. No constructive proof has been found
since. In this paper, we investigate a related problem, namely, which sets of
integers are imbalance sets of tournaments. We completely solve the tournament
imbalance set problem (TIS) and also estimate the minimal order of a tournament
realizing an imbalance set. Our proofs are constructive and provide a
pseudo-polynomial time algorithm to realize any imbalance set. Along the way,
we generalize the well-known equal sum subsets problem (ESS) to define the
equal sum sequences problem (ESSeq) and show it to be NP-complete. We then
prove that ESSeq reduces to TIS and so, due to the pseudo-polynomial time
complexity, TIS is weakly NP-complete.


title: Sparkling EUV bright dots observed with Hi-C

abstract:
  Observing the Sun at high time and spatial scales is a step towards
understanding the finest and fundamental scales of heating events in the solar
corona. The Hi-C instrument has provided the highest spatial and temporal
resolution images of the solar corona in the EUV wavelength range to date. Hi-C
observed an active region on 11 July 2012, which exhibits several interesting
features in the EUV line at 193\AA: one of them is the existence of short,
small brightenings ``sparkling" at the edge of the active region; we call these
EUV Bright Dots (EBDs). Individual EBDs have a characteristic duration of 25s
with a characteristic length of 680 km. These brightenings are not fully
resolved by the SDO/AIA instrument at the same wavelength, however, they can be
identified with respect to the Hi-C location of the EBDs. In addition, EBDs are
seen in other chromospheric/coronal channels of SDO/AIA suggesting a
temperature between 0.5 and 1.5 MK. Based on their frequency in the Hi-C time
series, we define four different categories of EBDs: single peak, double peak,
long duration, and bursty EBDs. Based on a potential field extrapolation from
an SDO/HMI magnetogram, the EBDs appear at the footpoints of large-scale
trans-equatorial coronal loops. The Hi-C observations provide the first
evidence of small-scale EUV heating events at the base of these coronal loops,
which have a free magnetic energy of the order of 10$^{26}$ erg.


title:
JIMWLK evolution for multi-particle production with rapidity
  correlations

abstract:
  We study multi-particle production with rapidity correlations in
proton-nucleus collisions at high energy in the Color Glass Condensate
framework. The high-energy evolution responsible for such correlations is
governed by a generalization of the JIMWLK equation describing the simultaneous
evolution of the strong nuclear color fields in the direct amplitude and the
complex conjugate amplitude. This functional equation can be used to derive
ordinary evolution equations for the cross-sections for particle production,
but the ensuing equations appear to be too complicated to be useful in
practice, including in the limit of a large number of colors Nc. We propose an
alternative formulation based on a Langevin process, which is valid for generic
Nc and is better suited for numerical implementations. For illustration, we
present the stochastic equations which govern two gluon production with
arbitrary rapidity separation.


title: Layout decomposition for triple patterning lithography

abstract:
  As minimum feature size and pitch spacing further decrease, triple patterning
lithography (TPL) is a possible 193nm extension along the paradigm of double
patterning lithography (DPL). However, there is very little study on TPL layout
decomposition. In this paper, we show that TPL layout decomposition is a more
difficult problem than that for DPL. We then propose a general integer linear
programming formulation for TPL layout decomposition which can simultaneously
minimize conflict and stitch numbers. Since ILP has very poor scalability, we
propose three acceleration techniques without sacrificing solution quality:
independent component computation, layout graph simplification, and bridge
computation. For very dense layouts, even with these speedup techniques, ILP
formulation may still be too slow. Therefore, we propose a novel vector
programming formulation for TPL decomposition, and solve it through effective
semidefinite programming (SDP) approximation. Experimental results show that
the ILP with acceleration techniques can reduce 82% runtime compared to the
baseline ILP. Using SDP based algorithm, the runtime can be further reduced by
42% with some tradeoff in the stitch number (reduced by 7%) and the conflict
(9% more). However, for very dense layouts, SDP based algorithm can achieve
140x speed-up even compared with accelerated ILP.


title:
Network flow-based simultaneous retiming and slack budgeting for low
  power design

abstract:
  Low power design has become one of the most significant requirements when
CMOS technology entered the nanometer era. Therefore, timing budget is often
performed to slow down as many components as possible so that timing slacks can
be applied to reduce the power consumption while maintaining the performance of
the whole design. Retiming is a procedure that involves the relocation of
flip-flops (FFs) across logic gates to achieve faster clocking speed. In this
paper we show that the retiming and slack budgeting problem can be formulated
to a convex cost dual network flow problem. Both the theoretical analysis and
experimental results show the efficiency of our approach which can not only
reduce power consumption by 8.9%, but also speedup previous work by 500 times.


title:
Distributions of Upper PAPR and Lower PAPR of OFDM Signals in Visible
  Light Communications

abstract:
  Orthogonal frequency-division multiplexing (OFDM) in visible light
communications (VLC) inherits the disadvantage of high peak-to-average power
ratio (PAPR) from OFDM in radio frequency (RF) communications. The upper peak
power and lower peak power of real-valued VLC-OFDM signals are both limited by
the dynamic constraints of light emitting diodes (LEDs). The efficiency and
transmitted electrical power are directly related with the upper PAPR (UPAPR)
and lower PAPR (LPAPR) of VLC-OFDM. In this paper, we will derive the
complementary cumulative distribution function (CCDF) of UPAPR and LPAPR, and
investigate the joint distribution of UPAPR and LPAPR.


title:
Floorplanning and Topology Generation for Application-Specific
  Network-on-Chip

abstract:
  Network-on-chip (NoC) architectures have been proposed as a promising
alternative to classical bus-based communication architectures. In this paper,
we propose a two phases framework to solve application-specific NoCs topology
generation problem. At floorplanning phase, we carry out partition driven
floorplanning. At post-floorplanning phase, a heuristic method and a min-cost
max-flow algorithm is used to insert switches and network interfaces. Finally,
we allocate paths to minimize power consumption. The experimental results show
our algorithm is effective for power saving.


title: A Continuation Multilevel Monte Carlo algorithm

abstract:
  We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for
weak approximation of stochastic models. The CMLMC algorithm solves the given
approximation problem for a sequence of decreasing tolerances, ending when the
required error tolerance is satisfied. CMLMC assumes discretization hierarchies
that are defined a priori for each level and are geometrically refined across
levels. The actual choice of computational work across levels is based on
parametric models for the average cost per sample and the corresponding weak
and strong errors. These parameters are calibrated using Bayesian estimation,
taking particular notice of the deepest levels of the discretization hierarchy,
where only few realizations are available to produce the estimates. The
resulting CMLMC estimator exhibits a non-trivial splitting between bias and
statistical contributions. We also show the asymptotic normality of the
statistical error in the MLMC estimator and justify in this way our error
estimate that allows prescribing both required accuracy and confidence in the
final result. Numerical results substantiate the above results and illustrate
the corresponding computational savings in examples that are described in terms
of differential equations either driven by random measures or with random
coefficients.


title: Second order density perturbations for dust cosmologies

abstract:
  We present simple expressions for the relativistic first and second order
fractional density perturbations for FL cosmologies with dust, in four
different gauges: the Poisson, uniform curvature, total matter and synchronous
gauges. We include a cosmological constant and arbitrary spatial curvature in
the background. A distinctive feature of our approach is our description of the
spatial dependence of the perturbations using a canonical set of quadratic
differential expressions involving an arbitrary spatial function that arises as
a conserved quantity. This enables us to unify, simplify and extend previous
seemingly disparate results. We use the primordial matter and metric
perturbations that emerge at the end of the inflationary epoch to determine the
additional arbitrary spatial function that arises when integrating the second
order perturbation equations. This introduces a non-Gaussianity parameter into
the expressions for the second order density perturbation. In the special case
of zero spatial curvature we show that the time evolution simplifies
significantly, and requires the use of only two non-elementary functions, the
so-called growth supression factor at the linear level, and one new function at
the second order level. We expect that the results will be useful in
applications, for example, studying the effects of primordial non-Gaussianity
on the large scale structure of the universe.


title: Simulations of high intensity ions beam RFQ Cooler for DESIR SPIRAL 2

abstract:
  The cooling simulation of a high intensity ions beam by a new generation of a
buffer gas radio-frequency cooler within the SHIRaC (SPIRAL-2 High Intensity
Radiofrequency Cooler) project, installed at the SPIRAL 2/DESIR facility, is
presented. Two simulation methods for the cooling process in presence of the
space charge effect and the buffer gas diffusion will be studied. The beam
properties degradation in terms of the transmission efficienty, the
longitudinal spread energy and the transversal emittance by these effects will
be discussed. Finally, a comparison in term of transmission between simulated
and experimental results for Cs+ ions beam of intensity going up to 1{\mu}A,
will be outlined.


title:
The effect of parallax and cadence on asteroid impact probabilities and
  warning times

abstract:
  We study the time evolution of the impact probability for synthetic but
realistic impacting and close approaching asteroids detected in a simulated
all-sky survey. We use the impact probability to calculate the impact warning
time as the time interval between when an object reaches a Palermo Scale value
of -2 and when it impacts Earth. A simple argument shows that warning time ~
D^x with the exponent in the range [1.0,1.5] and our derived value was
$x=1.3\pm0.1$. The low-precision astrometry from the single simulated all-sky
survey could require many days or weeks to establish an imminent impact for
asteroids >100m diameter that are discovered far from Earth. Most close
approaching asteroids are quickly identified as not being impactors but a
size-dependent percentage, even for those >50m diameter, have a persistent
impact probability of >10^{-6} on the day of closest approach. Thus, a single
all-sky survey can be of tremendous value in identifying Earth impacting and
close approaching asteroids in advance of their closest approach but it can not
solve the problem on its own: high-precision astrometry from other optical or
radar systems is necessary to rapidly establish an object as an impactor or
close approacher. We show that the parallax afforded by surveying the sky from
two sites is only of benefit for a small fraction of the smallest objects
detected within a couple days before impact: probably not enough to justify the
increased operating costs of a 2-site survey. Finally, the survey cadence
within a fixed time span is relatively unimportant to the impact probability
calculation. We tested three different reasonable cadences and found that one
provided ~10x higher (better) value for the impact probability on the discovery
night for the smallest (10m diameter) objects but the consequences on the
overall impact probability calculation is negligible.


title: A model problem for Mean Field Games on networks

abstract:
  In [14], Gueant, Lasry and Lions considered the model problem ``What time
does meeting start?'' as a prototype for a general class of optimization
problems with a continuum of players, called Mean Field Games problems. In this
paper we consider a similar model, but with the dynamics of the agents defined
on a network. We discuss appropriate transition conditions at the vertices
which give a well posed problem and we present some numerical results.


title:
Sampling Plans for Control-Inspection Schemes Under Independent and
  Dependent Sampling Designs With Applications to Photovoltaics

abstract:
  The evaluation of produced items at the time of delivery is, in practice,
usually amended by at least one inspection at later time points. We extend the
methodology of acceptance sampling for variables for arbitrary unknown
distributions when additional sampling infor- mation is available to such
settings. Based on appropriate approximations of the operating characteristic,
we derive new acceptance sampling plans that control the overall operating
characteristic. The results cover the case of independent sampling as well as
the case of dependent sampling. In particular, we study a modified panel
sampling design and the case of spatial batch sampling. The latter is advisable
in photovoltaic field monitoring studies, since it allows to detect and analyze
local clusters of degraded or damaged modules. Some finite sample properties
are examined by a simulation study, focusing on the accuracy of estimation.


title: The edge ideals of complete multipartite hypergraphs

abstract:
  We classify all complete uniform multipartite hypergraphs with respect to
some algebraic properties, such as being (almost) complete intersection,
Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying
Serre's condition $S_r$, via some combinatorial terms. Also, we prove that for
a complete $s$-uniform $t$-partite hypergraph $H$, vertex decomposability,
shellability, sequentially $S_r$ and sequentially Cohen-Macaulay properties
coincide with the condition that $H$ has $t-1$ sides consisting of a single
vertex. Moreover, we show that the latter condition occurs if and only if it is
a chordal hypergraph.


title:
Doping Influence on Sm$_{1-x}$Th$_x$OFeAs Superconducting Properties:
  Observation of Intrinsic Multiple Andreev Reflections Effect and
  Superconducting Parameters Determination

abstract:
  We studied SNS- and S-N-S-N-...-S contacts (where S - superconductor, N -
normal metal) formed by "break-junction" technique in polycrystalline
Sm$_{1-x}$Th$_x$OFeAs superconductor samples with critical temperatures $T_C =
(34 \div 45)$ K. In such contacts (intrinsic) multiple Andreev reflections
effects were observed. Using spectroscopies based on these effects, we detected
two independent bulk order parameters and determined their magnitudes.
Theoretical analysis of the large and the small gap temperature dependences
revealed superconducting properties of Sm$_{1-x}$Th$_x$OFeAs to be driven by
intraband coupling, and $\sqrt{V_{11}V_{22}}/V_{12} \approx 14$ (where $V_{ij}$
- electron-boson interaction matrix elements), whereas the ratio between
density of states for the bands with the small and the large gap, $N_2/N_1$,
correspondingly, was roughly of an order. We estimated "solo" BCS-ratio values
in a hypothetic case of zero interband coupling ($V_{i \ne j} = 0$) for each
condensate as $2\Delta_{L,S}/k_BT_C^{L,S} \le 4.5$. The values are constant
within the range of critical temperatures studied, and correspond to a case of
strong intraband electron-phonon coupling.


title: $K_{s,t}$-saturated bipartite graphs

abstract:
  An $n$-by-$n$ bipartite graph is $H$-saturated if the addition of any missing
edge between its two parts creates a new copy of $H$. In 1964, Erd\H{o}s,
Hajnal and Moon made a conjecture on the minimum number of edges in a
$K_{s,s}$-saturated bipartite graph. This conjecture was proved independently
by Wessel and Bollob\'as in a more general, but ordered, setting: they showed
that the minimum number of edges in a $K_{(s,t)}$-saturated bipartite graph is
$n^2-(n-s+1)(n-t+1)$, where $K_{(s,t)}$ is the "ordered" complete bipartite
graph with $s$ vertices in the first color class and $t$ vertices in the
second. However, the very natural question of determining the minimum number of
edges in the unordered $K_{s,t}$-saturated case remained unsolved. This problem
was considered recently by Moshkovitz and Shapira who also conjectured what its
answer should be. In this short paper we give an asymptotically tight bound on
the minimum number of edges in a $K_{s,t}$-saturated bipartite graph, which is
only smaller by an additive constant than the conjecture of Moshkovitz and
Shapira. We also prove their conjecture for $K_{2,3}$-saturation, which was the
first open case.


title:
The ODINUS Mission Concept - The Scientific Case for a Mission to the
  Ice Giant Planets with Twin Spacecraft to Unveil the History of our Solar
  System

abstract:
  The purpose of this document is to discuss the scientific case of a space
mission to the ice giants Uranus and Neptune and their satellite systems and
its relevance to advance our understanding of the ancient past of the Solar
System and, more generally, of how planetary systems form and evolve. As a
consequence, the leading theme of this proposal will be the first scientific
theme of the Cosmic Vision 2015-2025 program: What are the conditions for
planetary formation and the emergence of life? In pursuing its goals, the
present proposal will also address the second and third scientific theme of the
Cosmic Vision 2015-2025 program, i.e.: How does the Solar System work? What are
the fundamental physical laws of the Universe? The mission concept we will
illustrate in the following will be referred to through the acronym ODINUS,
this acronym being derived from its main fields of scientific investigation:
Origins, Dynamics and Interiors of Neptunian and Uranian Systems. As the name
suggests, the ODINUS mission is based on the use of two twin spacecraft to
perform the exploration of the ice giants and their regular and irregular
satellites with the same set of instruments. This will allow to perform a
comparative study of these two systems so similar and yet so different and to
unveil their histories and that of the Solar System.


title:
The simplified topological $\varepsilon$--algorithms for accelerating
  sequences in a vector space

abstract:
  When a sequence of numbers is slowly converging, it can be transformed into a
new sequence which, under some assumptions, could converge faster to the same
limit. One of the most well--known sequence transformation is Shanks
transformation which can be recursively implemented by the
$\varepsilon$--algorithm of Wynn. This transformation and this algorithm have
been extended (in two different ways) to sequence of elements of a topological
vector space $E$. In this paper, we present new algorithms of implementing
these topological Shanks transformations. They no longer require the
manipulation of elements of the algebraic dual space $E^*$ of $E$, nor using
the duality product into the rules of the algorithms, they need the storage of
less elements of $E$, and the stability is improved. They also allow us to
prove convergence and acceleration results for some types of sequences. Various
applications involving sequences of vectors or matrices show the interest of
the new algorithms.


title: Introducing Quantified Cuts in Logic with Equality

abstract:
  Cut-introduction is a technique for structuring and compressing formal
proofs. In this paper we generalize our cut-introduction method for the
introduction of quantified lemmas of the form $\forall x.A$ (for
quantifier-free $A$) to a method generating lemmas of the form $\forall
x_1\ldots\forall x_n.A$. Moreover, we extend the original method to predicate
logic with equality. The new method was implemented and applied to the TSTP
proof database. It is shown that the extension of the method to handle equality
and quantifier-blocks leads to a substantial improvement of the old algorithm.