text:
\section{Introduction}

An ontology-mediated query (OMQ) is a database-style query enriched
with an ontology that contains domain knowledge, aiming to deliver
more complete answers
\cite{DBLP:conf/rweb/CalvaneseGLLPRR09,DBLP:journals/tods/BienvenuCLW14,DBLP:conf/rweb/BienvenuO15}. In
OMQs, ontologies are often formulated in a description logic (DL) and
query languages of interest include conjunctive queries (CQs), unions
of conjunctive queries (UCQs), and instance queries (IQs).  While CQs
and UCQs are widely known query languages that play a fundamental role
also in database systems and theory, IQs are more closely linked
to~DLs.  In fact, an IQ takes the form $C(x)$ with $C$ a concept
formulated in the DL that is also used for the ontology, and thus the
expressive power of IQs depends on the ontology language. OMQs
based on (U)CQs are more powerful than OMQs based on IQs as the
latter only serve to return all objects from the data that are instances
of a given class.

It is easy to see that IQs can express tree-shaped CQs
with a single answer variable as well as unions thereof.  In fact,
this observation has been used in many technical constructions in the
area, see for example
\cite{DBLP:conf/pods/CalvaneseGL98,DBLP:journals/jair/GlimmLHS08,DBLP:conf/cade/Lutz08,DBLP:journals/jcss/EiterOS12}.
Intriguingly, though, it was observed by Zolin
\shortcite{DBLP:conf/dlog/Zolin07} that tree-shaped CQs are not the
limit of IQ-rewritability when we have an expressive DL such as \ALC
or \ALCI at our disposal. For example, the CQ $r(x,x)$, which asks to
return all objects from the data that are involved in a reflexive
$r$-loop, can be rewritten into the equivalent \ALC-IQ $P \rightarrow
\exists r. P(x)$. Here, $P$ behaves like a monadic second-order
variable due to the open-world assumption made for OMQs: we are free
to interpret $P$ in any possible way and when making $P$ true at an
object we are forced to make also $\exists r . P$ true if and only if
the object is involved in a reflexive $r$-loop. It is an interesting
question, raised in
\cite{DBLP:conf/dlog/Zolin07,DBLP:journals/japll/KikotZ13,DBLP:conf/dlog/KikotTZZ13},
to precisely characterize the class of CQs that are rewritable into
IQs. An important step into this direction has been made by Kikot and
Zolin~\shortcite{DBLP:journals/japll/KikotZ13} who identify a large
class of CQs that are rewritable into IQs: a CQ is rewritable into an
\ALCI-IQ if it is connected and every cycle passes through the (only)
answer variable; for rewritability into an \ALC-IQ, one additionally
requires that all variables are reachable from the answer variable in
a directed sense.  It remained open whether these classes are
depleting, that is, whether they capture all CQs that are IQ-rewritable.

There are two additional motivations to study the stated question. The
first one comes from concerns about the practical implementation of
OMQs. When the ontology is formulated in a more inexpressive `Horn
DL', OMQ evaluation is possible in \PTime data complexity and a host
of techniques for practically efficient OMQ evaluation is available,
see for example \cite{perezurbina10tractable,DBLP:conf/aaai/EiterOSTX12,DBLP:journals/ws/TrivelaSCS15,DBLP:conf/ijcai/LutzTW09}.
In the case of expressive DLs such as \ALC and \ALCI, OMQ evaluation
is {\sc coNP}-complete in data complexity and efficient implementation
is much more challenging. In particular, there are hardly any systems
that fully support such OMQs when the actual queries are (U)CQs. In
contrast, the evaluation of OMQs based on (expressive DLs and) IQs
is
supported by several systems such as Pellet, Hermit, and PAGOdA
\cite{pellet,hermit,DBLP:journals/jair/ZhouGNKH15}. For this reason,
rewriting (U)CQs into IQs has been advocated in
\cite{DBLP:conf/dlog/Zolin07,DBLP:journals/japll/KikotZ13,DBLP:conf/dlog/KikotTZZ13}
as an approach towards efficient OMQ evaluation with expressive DLs
and (U)CQs. The experiments and optimizations reported in
\cite{DBLP:conf/dlog/KikotTZZ13} show the potential (and challenges)
of this approach.

The second motivation stems from the connection between OMQs and
constraint satisfaction problems (CSPs)
\cite{DBLP:journals/tods/BienvenuCLW14,DBLP:journals/lmcs/LutzW17}. Let
$(\Lmc,\Qmc)$ denote the class of OMQs based on ontologies formulated
in the DL \Lmc and the query language \Qmc. It was observed in
\cite{DBLP:journals/tods/BienvenuCLW14} that $(\ALCI,\text{IQ})$ is
closely related to the complement of CSPs while $(\ALCI,\text{UCQ})$
is closely related to the complement of the logical generalization
MMSNP of CSP; we further remark that MMSNP is a notational variant of
the complement of (Boolean) monadic disjunctive Datalog. Thus,
characterizing OMQs from $(\ALCI,\text{UCQ})$ that are rewritable into
$(\ALCI,\text{IQ})$ is related to characterizing MMSNP sentences that
are equivalent to a CSP, and we also study the latter problem. In
fact, the main differences to the OMQ case are that unary queries are
replaced with Boolean ones and that predicates can have unrestricted arity.

The main aim of this paper is to study the rewritability of OMQs from
$(\Lmc,\text{(U)CQ})$ into OMQs from $(\Lmc,\text{IQ})$, considering
as \Lmc the basic expressive DL \ALC as well as extensions of \ALC
with inverse roles, role hierarchies, the universal role, and
functional roles.
We provide precise characterizations, tight complexity bounds for
deciding whether a given OMQ is rewritable, and show how to construct
the rewritten query when it exists. In fact, we prove that the classes
of CQs from \cite{DBLP:journals/japll/KikotZ13} are depleting, but we
go significantly beyond that: while
\cite{DBLP:conf/dlog/Zolin07,DBLP:journals/japll/KikotZ13,DBLP:conf/dlog/KikotTZZ13}
aim to find IQ-rewritings that work for \emph{any} ontology, we
consider the more fine-grained question of rewriting into an IQ an OMQ
$(\Tmc,\Sigma,q(x))$ where \Tmc is a DL TBox formalizing the ontology,
$\Sigma$ is an ABox signature, and $q(x)$ is the actual query. The
`any ontology' setup then corresponds to the special case where \Tmc
is empty and $\Sigma$ is full. However, gaving a non-empty TBox or a
non-full ABox signature results in additional (U)CQs to become
rewritable. While we admit modification of the TBox during rewriting,
it turns out that this is mostly unnecessary: only in some rather
special cases, a moderate \emph{extension} of the TBox pays off.
All this requires non-trivial generalizations of the query classes and
IQ-constructions from \cite{DBLP:journals/japll/KikotZ13}. Our
completeness proofs involve techniques that stem from the connection
between OMQs and CSP such as a lemma about ABoxes of high girth due to
Feder and Vardi~\shortcite{DBLP:journals/siamcomp/FederV98}. The
rewritings we construct are of polynomial size when we work with the
empty TBox, but can otherwise become exponential in size.

Regarding IQ-rewritability as a decision problem, we show {\sc
  NP}-completeness for the case of the empty TBox. This can be viewed
as an underapproximation for the case with non-empty TBox and ABox
signature. With non-empty TBoxes, complexities are higher. When the
ABox signature is full, we obtain 2\ExpTime-completeness for DLs with
inverse roles and an \ExpTime lower bound and a \coNExpTime upper
bound for DLs without inverse roles. With unrestricted ABox signature,
the problem is 2\NExpTime-complete for DLs with inverse roles and
\NExpTime-hard (and in 2\NExpTime) for DLs without inverse roles. All
lower bounds hold for CQs and all upper bounds capture UCQs. We also
prove that it is 2\NExpTime-complete to decide whether a given MMSNP
sentence is equivalent to a CSP. This problem was known to be
decidable \cite{DBLP:journals/siamcomp/MadelaineS07}, but the
complexity was open.

We also consider $\mathcal{ALCIF}$, the extension of \ALCI with
functional roles, for which IQ-rewritability turns out to be undecidable
and much harder to characterize. We give a rather subtle
characterization for the case of the empty TBox and full ABox
signature and show that the decision problem is then decidable and {\sc
  NP}-complete. Since it is not clear how to apply CSP techniques, we
use an approach based on ultrafilters, starting from what was
done for \ALC without functional roles
in \cite{DBLP:journals/japll/KikotZ13}.

Full proofs are in the appendix

\section{Preliminaries}
\label{sec:prelim}

We use standard description logic notation and refer to
\cite{DBLP:books/daglib/0041477} for full details. In contrast to the
standard DL literature, we carefully distinguish between the
\emph{concept language} and the \emph{TBox language}. We consider four
concept languages. Recall that \emph{\ALC-concepts} are formed
according to the syntax rule
$$
  C,D ::= A \mid \neg C \mid C \sqcap D \mid C \sqcup D \mid \exists r
  . C \mid \forall r . C
$$
where $A$ ranges over \emph{concept names} and $r$ over \emph{role
  names}. As usual, we use $C \rightarrow D$ as an abbreviation for
$\neg C \sqcup D$. \emph{\ALCI-concepts} additionally admit the use of
\emph{inverse roles} $r^-$ in concept constructors $\exists r^-.C$ and
$\forall r^-.C$. With a \emph{role}, we mean a role name or an inverse
role. \emph{$\ALC^u$-concepts} additionally admit the use of the
\emph{universal role} $u$ in concept constructors $\exists u . C$ and
$\forall u . C$. In \emph{$\ALCI^u$-concepts}, both inverse roles and
the universal role are admitted.

We now introduce several TBox languages.  For $\Lmc$ one of the four
concept languages introduced above, an \emph{\Lmc-TBox} is a finite
set of \emph{concept inclusions} $C \sqsubseteq D$ where $C$ and $D$
are \Lmc concepts. So each concept language also serves as a TBox
language, but there are additional TBox languages of interest. We
include the letter \Hmc in the name of a TBox language to indicate
that \emph{role inclusions} $r \sqsubseteq s$ are also admitted in the
TBox and likewise for the letter \Fmc and \emph{functionality
  assertions} $\mn{func}(r)$ where in both cases $r,s$ are role names
or inverse roles in case that the concept language used admits inverse
roles. So it should be understood, for example, what we mean with an
$\ALCHI^u$-TBox and an \ALCFI-TBox.  As usual, the semantics is
defined in terms of interpretations, which take the form
$\Imc=(\Delta^\Imc,\cdot^\Imc)$ with $\Delta^\Imc$ a non-empty
\emph{domain} and $\cdot^\Imc$ an \emph{interpretation function}. An
interpretation is a \emph{model} of a TBox \Tmc if it satisfies all
inclusions and assertions in \Tmc, defined in the usual way. We write
$\Tmc \models r \sqsubseteq s$ if every model of \Tmc also satisfies
the role inclusion $r \sqsubseteq s$.

An \emph{ABox} is a set of \emph{concept assertions} $A(a)$ and
\emph{role assertions} $r(a,b)$ where $A$ is a concept name, $r$ a
role name, and $a,b$ are \emph{individual names}. We use
$\mn{ind}(\Amc)$ to denote the set of all individual names that occur
in \Amc. An interpretation is a \emph{model} of an ABox \Amc if it
\emph{satisfies} all concept and role assertions in \Amc, that is, $a
\in A^\Imc$ when $A(a)$ is in \Amc and $(a,b) \in r^\Imc$ when
$r(a,b)$ is in \Amc. An ABox is \emph{consistent with a TBox} \Tmc if
\Amc and \Tmc have a common model.  A \emph{signature} $\Sigma$ is a
set of concept and role names. We use $\mn{sig}(\Tmc)$ to denote the
set of concept and role names that occur in the TBox \Tmc, and likewise for
other syntactic objects such as ABoxes.  A \emph{$\Sigma$-ABox} is an
ABox \Amc such that $\mn{sig}(\Amc) \subseteq \Sigma$.

A \emph{conjunctive query (CQ)} is of the form $ q(\xbf) = \exists
\ybf\,\varphi(\xbf,\ybf), $ where \xbf and \ybf are tuples of
variables and $\varphi(\xbf,\ybf)$ is a conjunction of \emph{atoms} of
the form $A(x)$ or $r(x,y)$ with $A$ a concept name, $r$ a role name,
and $x,y \in \xbf \cup \ybf$.  We call \xbf the \emph{answer
  variables} of $q(\xbf)$ and \ybf \emph{quantified variables}.  For
purposes of uniformity, we use $r^-(x,y)$ as an alternative notation
to denote an atom $r(y,x)$ in a CQ.  In fact, when speaking about
\emph{an atom $r(x,y)$ in a CQ $q(\xbf)$}, we generally also include
the case that $r=s^-$ and $s(y,x)$ is the actual atom in $q(\xbf)$,
unless explicitly noted otherwise.  Every CQ $q(\xbf)=\exists \ybf \,
\vp(\xbf,\ybf)$ gives raise to a directed graph $G_q$ whose nodes are
the elements of $\xbf \cup \ybf$ and that contains an edge from $x$ to
$y$ if $\vp(\xbf,\ybf)$ contains an atom $r(x,y)$. The corresponding
undirected graph is denoted $G^u_q$ (it might contain self loops). We
can thus use standard terminology from graph theory to CQs, saying for
example that a CQ is \emph{connected}.
A \emph{homomorphism} from $q(\xbf)$ to an interpretation \Imc is a
function $h : \xbf \cup \ybf \to \Delta^\Imc$ such that $h(x) \in
A^\Imc$ for every atom $A(x)$ of $q(\xbf)$ and $(h(x),h(y)) \in
r^\Imc$ for every atom $r(x,y)$ of $q(\xbf)$.  We write $\Imc \models
q(\abf)$ and call \abf an \emph{answer to $q(\xbf)$ on \Imc} if there
is a homomorphism from $q(\xbf)$ to $\Imc$ with $h(\xbf) = \abf$.

A \emph{union of conjunctive queries (UCQ)} $q(\xbf)$ is a disjunction
of one or more CQs that all have the same answer variables~\xbf.  We
say that a UCQ is \emph{connected} if every CQ in it is. The
\emph{arity} of a (U)CQ is the number of answer variables in it.  For
$\Lmc \in \{ \ALC,\ALCI, \ALC^u, \ALCI^u \}$, an \emph{\Lmc-instance
  query (\Lmc-IQ)} takes the form $C(x)$ where $C$ is an \Lmc concept
and $x$ a variable. We write $\Imc \models C(a)$ if $a \in C^\Imc$.
All instance queries have arity~1.

An \emph{ontology-mediated query (OMQ)} takes the form
$Q=(\Tmc,\Sigma,q(\xbf))$ with \Tmc a TBox, $\Sigma \subseteq
\mn{sig}(\Tmc) \cup \mn{sig}(q)$ an ABox signature, and $q(\xbf)$ a
query.\footnote{The requirement $\Sigma \subseteq \mn{sig}(\Tmc) \cup
  \mn{sig}(q)$ is
  harmless since symbols in the ABox that are not from $\mn{sig}(\Tmc) \cup
  \mn{sig}(q)$ do not affect answers.} The \emph{arity} of $Q$ is the arity of $q(\xbf)$ and $Q$ is
\emph{Boolean} if it has arity zero. When
$\Sigma$ is $\mn{sig}(\Tmc) \cup \mn{sig}(q)$, then for brevity we
denote it with $\Sigma_{\mn{full}}$ and speak of the \emph{full ABox
  signature}.  Let \Amc be a $\Sigma$-ABox. A tuple $\abf \in
\mn{ind}(\Amc)$ is an \emph{answer} to $Q$ on \Amc if $\Imc \models
q(\abf)$ for all models \Imc of \Amc and~\Tmc.  We say that $Q$ is
\emph{empty} if for all $\Sigma$-ABoxes~\Amc, there is no answer to
$Q$ on \Amc.  Let $Q_1,Q_2$ be OMQs, $Q_i=(\Tmc_i,\Sigma,q_i(\xbf))$
for $i \in \{1,2\}$.  Then $Q_1$ is \emph{contained} in $Q_2$, written
$Q_1 \subseteq Q_2$, if for all $\Sigma$-ABoxes \Amc, every answer to
$Q_1$ on \Amc is also an answer to $Q_2$ on \Amc. Further, $Q_1$ and
$Q_2$ are \emph{equivalent}, written $Q_1 \equiv Q_2$, if $Q_1
\subseteq Q_2$ and $Q_2 \subseteq Q_1$.

We use $(\Lmc,\Qmc)$ to refer to the \emph{OMQ language} in which the
TBox is formulated in the language \Lmc and where the actual queries
are from the language \Qmc, such as in $(\ALCF,\text{UCQ})$. For
brevity, we generally write $(\Lmc,\text{IQ})$ instead of
$(\Lmc,\text{$\Lmc'$-IQ})$ when $\Lmc'$ is the concept language
underlying the TBox language $\Lmc$, so for example
$(\ALCHI,\text{IQ})$ is short for $(\ALCHI,\text{\ALCI-IQ})$.
  %
\begin{definition}
\label{def:general}
Let $(\Lmc,\Qmc)$ be an OMQ language. An OMQ $Q=(\Tmc,\Sigma,q(\xbf))$ is \emph{$(\Lmc,\Qmc)$-rewritable} if there is an OMQ $Q'$ from $(\Lmc,\Qmc)$ such that the answers to $Q$ and to $Q'$ are identical on any $\Sigma$-ABox that is consistent with \Tmc.
In this case, we say that $Q$ \emph{is rewritable} into $Q'$ and call $Q'$ a \emph{rewriting} of $Q$.
\end{definition}
Let $(\Lmc,\Qmc)$ be an OMQ-language. \emph{IQ-rewritability in
  $(\Lmc,\Qmc)$} is the problem to decide whether a given (unary) OMQ
$Q=(\Tmc,\Sigma,q(x))$ from $(\Lmc,\Qmc)$ is
$(\Lmc,\text{IQ})$-rewritable; for brevity, we simply speak of
\emph{IQ-rewritability} of $Q$ when this is the case.  The following
examples show that IQ-rewritability of $Q$ depends on several factors.
All claims made are sanctioned by results established in this paper.

\begin{example}
\label{ex:1}
(1)~IQ-rewritability depends on the topology of the actual query. Let
$q_1(x)=r(x,x)$. The OMQ
$(\emptyset,\Sigma_{\mn{full}},q_1(x))$ is rewritable into the OMQ
$(\emptyset,\Sigma_{\mn{full}},C(x))$ from $(\ALC,\text{IQ})$ where
$C$ is  $P \rightarrow \exists r . P.
$
In contrast, let $q_2(x)=\exists y \, s(x,y) \wedge r(y,y)$. The OMQ
$(\emptyset,\Sigma_{\mn{full}},q_2(x))$ is not rewritable into an OMQ from
$(\ALCI,\text{IQ})$.

(2)~If we are not allowed to extend the TBox, IQ-rewritability depends
on whether or not inverse roles are available.  Let $\Sigma = \{r,s\}$
and $q(x)=\exists y \, r(y,x) \wedge s(y,x)$.  The OMQ
$Q=(\emptyset,\Sigma,q(x))$ is rewritable into the OMQ
$(\emptyset,\Sigma,C(x))$ from $(\ALCI,\text{IQ})$ where
$C$ is
$P \rightarrow \exists r^- . \exists s . P.
$
$Q$ is also rewritable into the OMQ $(\Tmc,\Sigma, C'(x))$
from $(\ALC,\text{IQ})$ where
$
  \Tmc = \{ \exists s . P \sqsubseteq \forall r . P' \},
$
and
$C$ is $P \rightarrow P'$,
but it is not rewritable into any OMQ $(\Tmc,\Sigma,C''(x))$ from
$(\ALC,\text{IQ})$ with $\Tmc=\emptyset$.

(3)~IQ-rewritability depends on the TBox. Let $q(x)=\exists x_1
\exists y_1 \exists y_2 \exists z \, A(x) \wedge r(x,x_1)\wedge
r(x_1,y_1) \wedge r(x_1,y_2) \wedge r(y_1,z) \wedge r(y_2,z) \wedge
B_1(y_1) \wedge B_2(y_2)$.
The OMQ
$(\emptyset,\Sigma_{\mn{full}},q(x))$ is not rewritable into an OMQ
from $(\ALCI,\text{IQ})$.  Let $\Tmc = \{ A \sqsubseteq \exists
r . \exists r . (B_1 \sqcap B_2 \sqcap \exists r . \top) \}$. The OMQ
$(\Tmc,\Sigma_{\mn{full}},q(x))$ is rewritable into the OMQ
$(\Tmc,\Sigma_{\mn{full}},A(x))$ from $(\ALC,\text{IQ})$.

(4)~IQ-rewritability depends on the ABox signature. Let $q(x)$ be the
CQ from (3) without the atom $A(x)$ and let \Tmc be as in (3). The
OMQ $(\Tmc,\Sigma_{\mn{full}},q(x))$ is not rewritable into an OMQ
from $(\ALCI,\text{IQ})$. Let $\Sigma = \{ A \}$. The OMQ
$(\Tmc,\Sigma,q(x))$ is rewritable into the OMQ
$(\Tmc,\Sigma,A(x))$ from $(\ALC,\text{IQ})$.
\end{example}
Note that we are allowed to completely rewrite the TBox when
constructing IQ-rewritings, which might seem questionable from a
practical perspective.  Fortunately, though, it turns out the TBox can
always be left untouched or, in some rare cases, only needs to be
slightly extended. Also note that an alternative
definition of IQ-rewritability obtained by dropping the restriction to
ABoxes consistent with \Tmc in Definition~\ref{def:general}. All
results obtained in this paper hold under both definitions.  We
comment on this throughout the paper
and refer to the alternative version as \emph{unrestricted
  IQ-rewritability}.

\section{Characterizations}
\label{sect:charact}

We aim to provide characterizations of OMQs that are IQ-rewritable.
On the one hand, these characterizations clarify which OMQs are
IQ-rewritable and which are not. On the other hand, they form the
basis for deciding IQ-rewritability. We first concentrate on the case
of DLs (and IQs) with inverse roles and then move on to DLs without
inverse roles. In the final part of this section, we consider the case
where the TBox is empty, both with and without inverse roles.

\subsection{The Case With Inverse Roles}

To state the characterization, we need some preliminaries.  Let $q(x)$
be a CQ.
A \emph{cycle} in $q(x)$ is a sequence of non-identical atoms
$r_0(x_0,x_1),\dots,r_{n-1}(x_{n-1},x_n)$ in $q(x)$, \mbox{$n \geq 1$},
where\footnote{We require the atoms be non-identical to
  prevent $r(x_0,x_1)$, $r^-(x_1,x_0)$ from being a cycle (both atoms are
  identical).}
 \begin{enumerate}

 \item $r_0,\dots,r_{n-1}$ are (potentially inverse) roles,

 \item $x_i \neq x_j$ for $0 \leq i < j < n$, and $x_0=x_n$.

 \end{enumerate}
 The \emph{length} of this cycle is $n$.  We say that $q(x)$
 is
 \emph{$x$-acyclic} if every cycle in it passes through $x$ and use
 $q^{\mn{con}}(x)$ to denote the result of restricting $q(x)$ to those
 atoms that only use variables reachable in $G^u_q$ from $x$.  Both
 notions are lifted to UCQs by applying them to every CQ in the UCQ.
 A \emph{contraction} of $q(x)$ is a CQ obtained from $q(x)$ by zero
 or more variable identifications, where the identification of $x$
 with any other variable yields~$x$.

 Let $\Tmc$ be an $\ALCHI^u$-TBox and $q(x)$ a UCQ. We use
 $q_{\mn{acyc}}(x)$ to denote the UCQ that consists of all $x$-acyclic
 CQs obtained by starting with a contraction of a CQ from $q(x)$ and
 then replacing zero or more atoms $r(y,z)$ with $s(y,z)$ when $\Tmc
 \models s \sqsubseteq r$.

 We write $q^{\mn{con}}_{\mn{acyc}}(x)$
 to denote $(q_{\mn{acyc}})^{\mn{con}}(x)$.
\begin{restatable}{theorem}{thmcentral}
\label{thm:central}
Let $\Lmc \in \{ \ALCI, \ALCHI \}$ and let $Q=(\tbox, \Sigma,q(x))$ be
a unary OMQ from $(\Lmc, \text{UCQ})$ that is non-empty. Then the
following are equivalent:
  \begin{enumerate}

  \item $Q$ is IQ-rewritable, that is, it is rewritable into an OMQ $Q'=(\Tmc', \Sigma,
    C(x))$ from $(\Lmc,\text{IQ})$;

  \item $Q$ is rewritable into an OMQ $Q'=(\tbox, \Sigma, C(x))$ from~$(\Lmc,\text{IQ})$;

  \item $Q \equiv (\Tmc, \Sigma, q^{\mn{con}}_{\mn{acyc}}(x))$.

\end{enumerate}
When \Lmc is replaced with $\Lmc^u$, then the same equivalences hold
except that $q^{\mn{con}}_{\mn{acyc}}$ is replaced with
$q_{\mn{acyc}}$.
\end{restatable}
Note that Theorem~\ref{thm:central} excludes empty OMQs, but these are
trivially IQ-rewritable. It implies that, in the considered cases, it
is never necessary to modify the TBox when constructing an
IQ-rewriting. Further, it emerges from the proof that it is never
necessary to introduce fresh role names in the rewriting (while fresh
concept names are crucial).  Theorem~\ref{thm:central} also applies to
unrestricted IQ-rewritability (where also ABoxes are admitted that are
inconsistent with the TBox from the OMQ): unrestricted
IQ-rewritability trivially implies IQ-rewritability and the converse
is an easy consequence of the fact that every OMQ that is
IQ-rewritable has an IQ-rewriting based on the same TBox.

We now give some ideas about the proof of Theorem~\ref{thm:central}.
The most interesting implication is ``$1 \Rightarrow 3$'
.  A central step is to show that if $Q=(\Tmc,\Sigma,q(x))$ is
IQ-rewritable into an OMQ $Q'$, then $Q \subseteq Q_{\mn{acyc}} :=
(\Tmc,\Sigma,q_{\mn{acyc}}(x))$, that is, when $\Amc \models Q(a)$ for
some $\Sigma$-ABox \Amc, then $\Amc \models Q_{\mn{acyc}}(a)$. To this
end, we first construct from $\Amc$ a $\Sigma$-ABox $\Amc^g$ of high
girth (that is, without small cycles) in a way such that (a)~$\Amc^g$
homomorphically maps to $\Amc$ and (b)~from $\Amc \models Q'(a)$ it
follows that $\Amc^g \models Q'(a)$, thus $\Amc^g \models Q(a)$. Due
to the high girth of $\Amc^g$ and exploiting (a variation of the) tree
model property for $\ALCHI$, we can then show that $\Amc^g \models
Q(a)$ implies $\Amc^g \models Q_{\mn{acyc}}(a)$.  Because of (a), it
follows that $\Amc \models Q_{\mn{acyc}}(a)$. In the direction ``$3
\Rightarrow 2$'', we construct actual rewritings, based on the
following lemma, an extension of a result of Kikot and Zolin
\cite{DBLP:journals/japll/KikotZ13} with TBoxes and ABox signatures
(and UCQs instead of CQs).

\begin{restatable}{lemma}{lemrewrALCI}
\label{lem:rewrAlgALCI}
Let $Q=(\tbox, \Sigma, q(x))$ be an OMQ from $(\ALCHI^u,
\text{UCQ})$. Then
\begin{enumerate}
\item if $q(x)$ is $x$-acyclic and connected, then $Q$ is rewritable into an OMQ $(\tbox, \Sigma, C(x))$ with $C(x)$ an \ALCI-IQ and

\item if $q(x)$ is $x$-acyclic, then $Q$ is rewritable into an OMQ  $(\tbox, \Sigma, C(x))$ with $C(x)$ an $\ALCI^u$-IQ.
\end{enumerate}
The size of the IQs $C(x)$ is polynomial in the size of $q(x)$.
\end{restatable}
We give the construction of the \ALCI-IQ $q'(x)$ in Point~1 of
Lemma~\ref{lem:rewrAlgALCI}. Let $Q=(\tbox, \Sigma, q(x))$ be an OMQ
from $(\ALCHI^u, \text{UCQ})$ with $q(x)$ $x$-acyclic and
connected. To construct $q'(x)$, we first construct for each CQ $p(x)$
in $q(x)$ an \emph{\ELI-concept} $C_p$, that is, an \ALCI-concept that
uses only the constructors $\sqcap$, $\exists r . C$, and $\exists r^-
. C$. In fact, since $p(x)$ is $x$-acyclic and connected, we can
repeatedly choose and remove atoms of the form $r(x,y)$ that occur in
a cycle in $p(x)$ and will eventually end up with a tree-shaped CQ
$p'(x)$.\footnote{Note that $x$ is the answer variable and recall
  that we might have $r=s^-$ and thus also choose atoms $s(y,x)$.} Here,
\emph{tree-shaped} means that the undirected graph $G^u_{p'}$ is a
tree and that there are no multi-edges, that is, if $r(y,z)$ is an
atom, then there is no atom $s(y,z)$ with $s \neq r$.  Next, extend
$p'(x)$ to obtain another tree-shaped CQ $p''(x)$ by taking a fresh
concept name $P \notin
\Sigma$,
and adding $r(x',y)$ and
$P(x')$ for each removed atom $r(x,y)$, $x'$
a fresh
variable. We can now view $p''(x)$ as an \ELI-concept $C_p$ in the
obvious way. The desired \ALCI-IQ $q'(x)$ is $(P \rightarrow
\bigsqcup_{p(x) \text{ a CQ in } q(x)} C_p)(x).$

\subsection{The Case Without Inverse Roles}

We consider OMQs whose TBoxes are formulated in a DL \Lmc that does
not admit inverse role
. Note that
inverse roles are then also not admitted in the IQ used in the
rewriting. We first observe that this has less impact than one might
expect: inverse roles in the IQ-rewriting can be eliminated and in
fact Points~1 and~3 from Theorem~\ref{thm:central} are still
equivalent. However, there is also a crucial difference: unless the
universal role is present, the elimination of inverse roles requires
an extension of the TBox and thus the equivalence of Points~1 and~2 of
Theorem~\ref{thm:central} fails. In fact, this is illustrated by
Point~(2) of Example~\ref{ex:1}. We thus additionally characterize
IQ-rewritability without modifying the TBox. We also show that, with
the universal role, it is not necessary to extend the TBox.

We start with some preliminaries.  An \emph{extended conjunctive query
  (eCQ)} is a CQ that also admits atoms of the form $C(x)$, $C$ a
(potentially compound) concept, and \emph{UeCQs} and \emph{extended
  ABoxes (eABoxes)} are defined analogously. The semantics
is defined in the expected way. Every eCQ $q(x)$ gives
rise to an eABox $\Amc_q$
by viewing the
variables in $q(x)$ as individual names and the atoms as assertions.

Let $q(x)$ be an eCQ. We use $\mn{dreach}(q)$ to denote the set of all
variables reachable from $x$ in the directed graph $G_q$ and say that
$q(x)$ is \emph{$x$-accessible} if $\mn{dreach}(q)$ contains all
variables. For $V$ a set of variables from $q(x)$ that includes $x$,
$q(x)|_V$ denotes the restriction of $q(x)$ to the atoms that use only
variables from $V$.

Let \Tmc be an \ALC-TBox. An eCQ $p(x)$ is a \emph{\Tmc-decoration}
of a CQ $q(x)$ if
\begin{enumerate}

\item $p(x)$ is obtained from $q(x)$ by adding, for each $y \in
  \mn{dreach}(q)$ and each subconcept $C$ of \Tmc, the atom $C(y)$ or
  the atom $\neg C(y)$;

\item the eABox $\Amc_{p}$ is consistent with \Tmc.

\end{enumerate}
For a UCQ $q(x)$, we use $q^{\mn{deco}}(x)$ to denote the UeCQ that
consists of all eCQs $p(x)|_{\mn{dreach}(p)}(x)$, where $p(x)$ is a
\Tmc-decoration of a CQ from $q(x)$. We write
$q^{\mn{deco}}_{\mn{acyc}}(x)$ to denote
$(q_{\mn{acyc}})^{\mn{deco}}(x)$. We now give the results announced above.
 %
 %
\begin{restatable}{theorem}{thmalc}
\label{thm:alc}
Let $\Lmc \in \{ \ALC,\ALCH \}$ and let $Q=(\tbox, \Sigma, q(x))$ be a unary OMQ from $(\Lmc, \text{UCQ})$ that is non-empty. Then the following are equivalent:
  \begin{enumerate}

  \item $Q$ is rewritable into an OMQ from
     $(\Lmc, \text{IQ})$;
  \item $Q$ is rewritable into an OMQ $(\Tmc \cup \Tmc',\Sigma,C(x))$
    from $(\Lmc,\text{IQ})$;

 \item $Q$ is rewritable into an OMQ from $(\Lmc\Imc, \text{IQ})$;

\end{enumerate}
If $\Sigma=\Sigma_{\mn{full}}$, then the following are
equivalent:
  \begin{enumerate}
  \setcounter{enumi}{3}
  \item $Q$ is rewritable into an OMQ $Q'=(\tbox, \Sigma_{\mn{full}}, C(x))$ from $(\Lmc,\text{IQ})$;
  \item $Q \equiv (\Tmc,\Sigma_{\mn{full}}, q^{\mn{deco}}_{\mn{acyc}}(x))$.
\end{enumerate}
If, furthermore, $\Lmc$ is replaced with $\Lmc^u$ and $\Lmc\Imc$ with
$\Lmc\Imc^u$, then Conditions~1 to~3 are further equivalent to:
\begin{enumerate}
  \setcounter{enumi}{5}
  \item $Q$ is rewritable into an OMQ $Q'=(\tbox, \Sigma, C(x))$ from $(\Lmc^u,\text{IQ})$.
\end{enumerate}
\end{restatable}
Characterizing IQ-rewritability in the case where $\Lmc \in \{
\ALC,\ALCH \}$, the TBox (is non-empty and) cannot be extended, and
$\Sigma \neq \Sigma_{\mn{full}}$ remains an open problem.

\medskip

In the directions ``$3 \Rightarrow 2$'', ``$5 \Rightarrow 4$'', and
``$3 \Rightarrow 6$'', we have to construct IQ-rewritings. This is
done by starting with the rewriting from the proof of
Lemma~\ref{lem:rewrAlgALCI} and then modifying it appropriately.  As
in the case of Theorem~\ref{thm:central}, it is straightforward to see
that all results stated in Theorem~\ref{thm:alc} also apply
to unrestricted IQ-rewritability.

\subsection{The Case of Empty TBoxes}

We consider OMQs in which the TBox is empty as an important special
case. Since it is then not interesting to have an ABox signature, this
corresponds to the rewritability of (U)CQs into \Lmc-instance queries,
for some concept language~\Lmc (and thus no OMQs are involved). The
importance of this case is due to the fact that it provides an
`underapproximation' of the IQ-rewritability of OMQs, while also being
easier to characterize and computationally simpler.

We say that an UCQ $q(x)$ is \emph{\Lmc-IQ-rewritable} if there is an \Lmc-IQ $q'(x)$ that is equivalent to $q(x)$ in the sense that the
OMQs $(\emptyset, \Sigma_{\mn{full}},q(x))$ and $(\emptyset,
\Sigma_{\mn{full}},q'(x))$ are equivalent (and in passing, we define the
equivalence between two UCQs in exactly the same way). The following
proposition makes precise what we mean by underapproximation.
\begin{restatable}{proposition}{lememptyasapprox}
\label{lem:emptyasapprox}
Let $\Lmc \in \{ \ALC, \ALCI, \ALC^u, \ALCI^u \}$.  If a UCQ $q(x)$ is
\Lmc-IQ-rewritable, then so is any OMQ $(\Tmc,\Sigma,q(x))$ from
$(\Lmc\Hmc, \text{UCQ})$.
\end{restatable}
Proposition~\ref{lem:emptyasapprox} is essentially a corollary of
Theorem~\ref{thm:centralnoTBox} below. As illustrated by Case~(3) of
Example~\ref{ex:1}, its converse fails.

We now characterize IQ-rewritability in the case of the empty TBox. A
\emph{subquery} of a CQ $q(x)$ is a CQ $q'(x)$ obtained from $q(x)$ by
dropping atoms. A \emph{subquery} of a UCQ $q(x)$ is a UCQ obtained by
including as a CQ at most one subquery of each CQ in~$q(x)$.
\begin{restatable}{theorem}{thmemptyTBox}
\label{thm:centralnoTBox}
Let $q(x)$ be a UCQ. Then
  \begin{enumerate}
\item $q(x)$ is rewritable into an \ALCI-IQ iff there is a subquery $q'(x)$ of $q(x)$ that is $x$-acyclic, connected, and equivalent to $q(x)$;
\item $q(x)$ is rewritable into an \ALC-IQ iff there is a subquery $q'(x)$ of $q(x)$ that is $x$-acyclic, $x$-accessible, and equivalent to $q(x)$.
\end{enumerate}
When \Lmc-IQs are replaced with $\Lmc^u$-IQs, then the same
equivalences hold except that connectedness/$x$-accessibility is dropped.
\end{restatable}

Note that Theorem~\ref{thm:centralnoTBox} also characterizes
rewritability of CQs; the query $q'(x)$ is then also a CQ rather than
a UCQ. This is in contrast to Theorems~\ref{thm:central}
and~\ref{thm:alc} where the queries $q^{\mn{con}}_{\mn{acyc}}(x)$ and
$q^{\mn{deco}}_{\mn{acyc}}(x)$ are UCQs even when the query $q(x)$
from the OMQ that we start with is a CQ. Another crucial difference is
that $q^{\mn{con}}_{\mn{acyc}}(x)$ and $q^{\mn{deco}}_{\mn{acyc}}(x)$
can be of size exponential in the size of the original OMQ while the
query $q'(x)$ in Theorem~\ref{thm:centralnoTBox} is of size polynomial
in the size of~$q(x)$.

\section{Complexity}
\label{sect:compl}

We determine the complexity of deciding IQ-rewritability in various
OMQ languages, based on the established characterizations and starting
with the case of empty TBoxes.
\begin{restatable}{theorem}{thmemptyTComplexity}
\label{thm:emptyTComplexity}
  For every $\Qmc \in \{ CQ, UCQ \}$ and $\Lmc \in \{ \ALC, \ALCI,
  \ALC^u, \ALCI^u \}$, it is {\sc NP}-complete to decide whether a given
  query from \Qmc is \Lmc-IQ-rewritable.
\end{restatable}
The upper bound in Theorem~\ref{thm:emptyTComplexity} is by
guessing the query $q'(x)$ from Theorem~\ref{thm:centralnoTBox}
and verifying that it satisfies the properties stated there. The lower
bound is by a reduction from 3-colorability.

We next consider the case where TBoxes can be non-empty, starting
with the assumption that the ABox signature is full since this results
in (slightly) lower complexity.
\begin{restatable}{theorem}{thmfullSigComplexity}
\label{thm:fullSigComplexity}
Let $\Qmc \in \{ \text{CQ}, \text{UCQ} \}$. For OMQs based on the
full ABox signature, IQ-rewritability is
  %
  \begin{enumerate}

  \item \ExpTime-hard in $(\ALC,\Qmc)$ and in \coNExpTime in
    $(\ALCH,\Qmc)$ and

  \item 2\ExpTime-complete in $(\ALCI,\Qmc)$ and $(\ALCHI,\Qmc)$.

  \end{enumerate}
\end{restatable}
The lower bounds are by reduction from
OMQ evaluation on ABoxes of the form $\{ A(a) \}$, $A$ a concept name,
which is \ExpTime-complete in $(\ALCH,\text{CQ})$ and
2\ExpTime-complete in $(\ALCHI,\text{CQ})$
\cite{DBLP:conf/cade/Lutz08}. The upper bounds are derived from the
OMQ containment checks suggested by Condition~3 of
Theorem~\ref{thm:central} and Condition~4 of Theorem~\ref{thm:alc}.
Since we work with the full ABox signature, the non-emptiness
condition from these theorems is void (there are no empty OMQs)
and OMQ containment is closely related to OMQ evaluation, which allows
us to derive upper bounds for the former from the latter; in fact,
these bounds are exactly the ones stated in
Theorem~\ref{thm:fullSigComplexity}. We have to exercise some care,
for two reasons: first, we admit UCQs as the actual query and thus the
trivial reduction of OMQ containment to OMQ evaluation that is
possible for CQs (which can be viewed as an
ABox) does not apply. And second, we aim for upper bounds that exactly
match the complexity of OMQ containment while the UCQs
$q^{\mn{con}}_{\mn{acyc}}(x)$ and $q^{\mn{deco}}_{\mn{acyc}}(x)$
involved in the containment checks are of exponential size. What
rescues us is that each of the CQs in these UCQs is only of polynomial
size.

We finally consider the case where the ABox signature is unrestricted.
\begin{restatable}{theorem}{thmPSigComplexity}
\label{thm:PSigComplexity}
  IQ-rewritability is
  %
  \begin{enumerate}

  \item \NExpTime-hard in $(\ALC,\text{CQ})$ and

  \item 2\NExpTime-complete in all of $(\ALCI,\text{CQ})$,
    $(\ALCI,\text{UCQ})$,
    $(\ALCHI,\text{CQ})$, $(\ALCHI,\text{UCQ})$.

  \end{enumerate}
\end{restatable}
The lower bound in Point~1 is by reduction from OMQ emptiness in
$(\ALC,\text{CQ})$, which is \NExpTime-complete
\cite{DBLP:journals/jair/BaaderBL16}. For the one in Point~2, we use a
reduction from OMQ containment, which is 2\NExpTime-complete in
$(\ALCI,\text{CQ})$ \cite{DBLP:conf/kr/BourhisL16}. The upper bounds
are obtained by appropriate containment checks as suggested by our
characterizations, and we again have to deal with UCQs with
exponentially many CQs. Note that Theorem~\ref{thm:PSigComplexity}
leaves open the complexity of IQ-rewritability in $(\ALC,\text{CQ})$,
between \NExpTime and 2\NExpTime. The same gap exists for OMQ
containment \cite{DBLP:conf/kr/BourhisL16} as well as in the related
problems of FO-rewritability and
Datalog-rewritability~\cite{DBLP:conf/icdt/FeierKL17}.

\section{Functional Roles}

We consider DLs with functional roles. A fundamental
observation is that for the basic such DL \ALCF, IQ-rewritability is
undecidable. This can be proved by a reduction from OMQ emptiness in
$(\ALCF,\text{IQ})$~\cite{DBLP:journals/jair/BaaderBL16}.
\begin{restatable}{theorem}{thmUndecALCF}\label{lthmUndecALCF}
  In $(\ALCF,\text{CQ})$, IQ-rewritability is undecidable.
\end{restatable}
In the following, we show that decidability is regained in the case
where the TBox is empty (apart from functionality assertions).  This
is challenging because functionality assertions have a strong and
subtle impact on rewritability.  As before, the only interesting ABox
signature to be combined with `empty' TBoxes is the full ABox
signature.  We use \Fmc to denote the TBox language in which TBoxes
are sets of functionality assertions and concentrate on rewriting into
IQs that may use inverse roles.
\begin{example}\label{ex:fr}
  Consider the CQ $p(x) = \exists y(s(x,y) \wedge r(y,y))$ from
  Point~1 of Example~\ref{ex:1}.  Then $Q_{s}=(\Tmc_{s},\Sigma_{\sf
    full},p(x))$ and $Q_{r}=(\Tmc_{r},\Sigma_{\sf full},p(x))$ with
  $\Tmc_{w}=\{{\sf func}(w)\}$ for $w\in \{r,s\}$ are both rewritable
  into an OMQ $(\Tmc_{w},\Sigma_{\sf full},q_{w}(x))$ with $q_w(x)$ an
  \ALCI-IQ. The rewritings are neither trivial to find nor entirely
  easy to understand. In fact, for $q_s(x)$ we can use $\forall s.P
  \rightarrow \exists s.(P \rightarrow \exists r.P) $. For $q_r(x)$,
  we introduce three fresh concept names rather than a single one and
  use them in a way inspired by graph colorings:
 $$
 q_{r}(x) = (\forall s.\bigsqcup_{1\leq i \leq 3}P_{i}) \rightarrow (\exists s.(\bigsqcap_{1\leq i \leq 3}(P_{i}\rightarrow \exists r.P_{i})).
 $$

\end{example}
Before giving a characterization of rewritable queries, we introduce
some preliminaries.  Let $q(x)$ be a CQ and $\Tmc$ an
$\mathcal{ALCIF}$-TBox.
A sequence $x_{0},\ldots,x_{n}$ of variables in $q(x)$ is a
\emph{functional path in $q(x)$ from $x_{0}$ to $x_{n}$ w.r.t.~$\Tmc$}
if for all $i<n$ there is a role $r$ such that $\mn{func}(r) \in \Tmc$
and $r(x_{i},x_{i+1})$ is in $q(x)$. We say that $q(x)$ is \emph{f-acyclic
  w.r.t.~$\Tmc$} if for every cycle
$r_{0}(x_{0},x_{1}),\ldots,r_{n-1}(x_{n-1},x_{n})$ in $q(x)$, one of
the following holds:
\begin{itemize}
\item there is a functional path in $q(x)$ from $x$ to some $x_{i}$;
\item $\mn{func}(r_{i}) \in \Tmc$ or $\mn{func}(r_{i}^{-})
  \in \Tmc$ for all $i<n$ and there is a functional path
  $y_{0},\ldots,y_{m}$ in $q(x)$ with $x_{0}=y_{0}=y_{m}$ such that
  $\{x_{0},\ldots,x_{n-1}\}\subseteq \{y_{0},\ldots,y_{m}\}$.
\end{itemize}
We are now ready to state the characterization.
\begin{theorem}
\label{thm:f}
  An OMQ $Q=(\Tmc,\Sigma_{\text{full}},q(x))$ from $(\Fmc,\text{UCQ})$
  is rewritable into an OMQ from $(\Fmc,\ALCI\text{-IQ})$ iff there is a
  subquery $q'(x)$ of $q(x)$ that is
  f-acyclic, connected, and equivalent to $q(x)$.

  When $\mathcal{ALCI}$-IQ is replaced with $\mathcal{ALCI}^{u}$-IQ,
  the same equivalence holds except that
  connectedness is dropped.
\end{theorem}
The proof of Theorem~\ref{thm:f} extends the ultrafilter construction
from~\cite{DBLP:journals/japll/KikotZ13}.
We remark that the ``if'' direction in Theorem~\ref{thm:f} even holds
for OMQs $Q=(\Tmc,\Sigma,q(x))$ from
$(\mathcal{ALCIF},\text{UCQ})$. Thus, the case of the `empty' TBox can
again be seen as an underapproximation of the general case. We further
remark that \Tmc remains unchanged in the construction of the
IQ-rewritings
and that the constructed rewritings are of polynomial size.
\begin{theorem}
  For OMQs from $(\Fmc,\text{UCQ})$, rewritability into
  $(\Fmc,\ALCI\text{-IQ})$ is {\sc NP}-complete.
\end{theorem}

\section{MMSNP and CSP}
\label{sect:mmsnp}

Recall from the introduction that the OMQ languages studied in this
paper are closely related to CSPs and their logical generalization
MMSNP. In fact, the techniques used to establish the results in
Sections~\ref{sect:charact} and~\ref{sect:compl} can be adapted to
determine the complexity of deciding whether a given MMSNP sentence is
equivalent to a CSP. In a nutshell, we prove that an MMSNP-sentence is
equivalent to a CSP iff it is preserved under disjoint union and
equivalent to a generalized CSP (a CSP with multiple templates), and
that both properties can be reduced to containment between MMSNP
sentences which is 2\NExpTime-complete
\cite{DBLP:conf/kr/BourhisL16}. The latter reduction involves
constructing an MMSNP sentence $\vp_{\mn{acyc}}$ that is reminiscent
of the query $q_{\mn{acyc}}$ in Theorem~\ref{thm:central}. Full
details are given in the appendix.

\begin{restatable}{theorem}{thmMMSNPrewr}
\label{thm:MMSNPRewr}
  It is 2\NExpTime-complete to decide whether a given MMSNP-sentence
  is equivalent to a CSP.
\end{restatable}

\section{Conclusion}

We  made a step forward in understanding the relation between
(U)CQs and IQs in ontology-mediated querying. Interesting open
problems include a characterization of IQ-rewritability for DLs with
functional roles when the TBox is non-empty and characterizations for
DLs with transitive roles. The remarks after Theorem~\ref{sect:compl}
and~\ref{thm:PSigComplexity} mention further problems left open.
It would also be worthwhile to follow \cite{DBLP:conf/dlog/KikotTZZ13} and understand the
value of IQ-rewritings for the purposes of efficient practical
implementation.

\smallskip
\noindent
{\bf Acknowledgements.}
Cristina Feier and Carsten Lutz were supported by ERC Consolidator
Grant 647289 CODA. Frank Wolter was supported by EPSRC UK grant
EP/M012646/1.

\cleardoublepage


text:
Umran Ali
umran30@gmail.com and mobile 07736-330-542
£30 + court fee
Milton Gayle
miltontenniscoaching@gmail.com and mobile 07843-307-632
Rates by agreement
Alex Kaminski
alexander.kaminski@yahoo.com and 07783-530-409
Alex has his own website with details on sessions and fees, please visit http://se1tennis.co.uk/
Guillermo Zoilo
gzoiloc@yahoo.com and 07484754027
By agreement
Denis McMillan
denisthecoach@yahoo.co.uk and 07813-867-684
Alex Kaminski is Head Coach at GMH Park and is a licensed LTA Level 4 Senior Coach. He has build up the programme from a handful of children to a point where there are over 70 children training up to four times a week. This is all the more impressive given that there are only 2 courts! Alex complements this by scheduling three adult group sessions, all heavily oversubscribed, each week.
Alex represents Wilton's mens first team in the Aegon Leagues competing at a high level and won our mens Club Championship in 2014 and has a current rating of 4.1. He was also non-playing team captain of our Southwark City Tennis Club's men's first team which gained promotion in 2018 and consolidated this in 2019, with a specific aim to bring through a number of the younger players.
Alex studied Economics and Criminology at Kingston University and helped his community by serving as a special constable for several years. Further information can be found at https://se1tennis.co.uk/
Umran Ali Director and cofounder of Be Active started playing tennis as a junior in the late 1970s. During his extensive coaching career he has worked at venues including The Harbour Club in Chelsea, Ferndale and from 2001 to 2007 at Telford Park where he finished as Head Coach. He joined Southwark City Tennis Club as Head Coach in 2007. He is a licensed Senior Coach with the LTA. Umran was selected for a prestigious Winston Churchill Memorial Trust Award visiting the US and Spain to study community and performance tennis programmes. He leads the work with our stronger players thanks to the support of the charity BOOST.
Milton on court
Milton Gayle has worked in community tennis since the 1970's and trained thousands of people, including many who are now coaching themselves. His work was key in getting Burgess Park Tennis Centre built in 2004 attracting over £800,000 of investment. He plays and teaches to a high standard, has an LTA Level 5 coaching badge, the highest level, and was London Champion in the 1980's winning the title on the Wimbledon courts. In recognition of his work Milton was Barclays Unsung Hero for 2012 and part of the presentation party for the ATP Tour Finals won by Novak Djokovic. He also works on the Barclays Ball Kids programme. Now in his 60's and still teaching and playing every day Milton embodies the spirit that tennis is a game for life. In 2016 Milton received a lifetime achievement award from LTA Tennis Surrey.
Guillermo Zoilo is a Level 4 LTA licensed Senior Coach having learnt as a junior in Madrid. He has a major role coaching on the junior sessions and squads at Burgess Park working six days a week. He coaches a range of adults including the popular Tennis Tuesday sessions.
He has competed at martial arts with a world ranking as well as coaching in his native Spain.
Denis receiving an award
Denis McMillan is a Level 3 coach with the LTA. He grew up in the area and is well known and respected in the local community. He has done a significant amount of work coaching at local schools and venues in the north of the borough. Denis is enthusiastic, determined, and most importantly, dedicated. There is clear evidence for his hard work in recent years with a number of players coming through to win tournaments.
In recognition of his work he won a Leader's Award from the Jack Petchey Foundation.

redpajama_set_name: RedPajamaCommonCrawl


text:
Clinton's Email Server Isn't Her Scandal
October 2, 2015 cryptosmith
Early last month, Edward Snowden criticized former Secretary of State Hillary Clinton for obviously and intentionally mishandling classified information by using a private email server. A recent Huffington post argues that, if true, Snowden's comments could cost Clinton the Democratic Presidential nomination.
This rests on technical questions of security and classified information. Based on the information I have seen, Clinton committed no crime. Her security mistakes are typical of politicians of her (my) generation. She was exercising the authority and discretion (or lack thereof) belonging to her role as Secretary of State. I will explain why.
DISCLAIMER: I personally neither support nor oppose Hillary Clinton's bid for a Presidential nomination.
UPDATE (March 22, 16): Richard Lempert, a professor of law and sociology, has posted a more detailed parsing of the laws and regulations to come to the same conclusion.
Breaking Laws
Observers say that former Secretary Clinton may have broken the law by disclosing "classified information" in her emails. This misinterprets the law.
There is little or no legislation that addresses classified information itself. No law explicitly says: "It is illegal to disclose information marked Confidential, Secret, or Top Secret to unauthorized people." This curious oversight is blamed on our freedom of speech and press, codified in the First Amendment.
Contrast this with the United Kingdom and their Official Secrets Act. Absent the First Amendment, they successfully passed and enforced a law under which the government could make just about anything a secret, and throw people in jail for disclosure. You make something a secret through an administrative act, not through legislation. Bureaucrats invent felonies by making something secret.
US legislation talks about sensitive information and identifies particular types that must not be disclosed. The first and most important is the Espionage Act, which dates back to the First World War. The Act forbids disclosure of military information to adversaries. This is usually how people are prosecuted for disclosing classified information. The Atomic Energy Act of 1946 also made it illegal to disclose nuclear weapon secrets.
Other secret-keeping legislation relates to the "sources and methods" the CIA, NSA, and other intelligence agencies use to collect information. The legislation can't and doesn't say "it's illegal to disclose information that carries classification markings." This may also be a vestige of the Separation of Powers: legislation is the realm of the Legislative Branch, but the classification system is an invention of the Executive Branch.
Getting "Classified"
Security classification is defined by Executive Orders issued by the President. Each President fine-tunes the system based on what has happened in previous administrations. Some speed up the declassification of old, still-classified information, Others slow such declassification down, or re-classify previously public information.
All administrations try to limit the proliferation of classified information. It's cumbersome, painful, and expensive to handle classified information. Over the past couple decades administrations have severely limited the authority to declare things classified in order to limit the amount of classified information. The only people with such authority are heads of major agencies and Cabinet members.
Secretary of State Clinton was the authority for classifying information inside the State Department. If the information involved her work at the State Department and she disclosed it, then she was acting within her authority.
This wouldn't protect the Secretary if she had disclosed military secrets or certain intelligence "sources and methods." Such secrets are covered by legislation.
Rank Hath Its Privileges
The National Archives has been trying to release Secretary Clinton's emails. While reviewing them, the reviewers recommended that some emails be classified. This reflects a difference of opinion, not proof of wrongdoing. Clinton's authority as Secretary of State allowed her to make her choice, just as later authorities may make different choices.
Last summer, Reuters quoted J. William Leonard, former director of the U.S. government's Information Security Oversight Office (ISOO) under President G.W. Bush. Leonard described this now-classified information as "born classified." The information was received from foreign officials or heads of state and included in unprotected emails. According to Leonard, the Secretary should have treated the information as classified all along, according to her department's rules.
It's easy to over-interpret such rules. As written, they could make anything a foreign official shares with a State Department official into classified information. It's insanity to say that everything in that category must always be classified. The State Department routinely includes such information in press releases.
In practice, there are two types of "born classified" information. First, there are things covered by federal legislation. These include information about nuclear weapons and about certain intelligence sources and methods. Second, there are pieces of information covered by "classification guides." These guides are documents meant to help workers identify classified information before it is accidentally released.
The Federation of American Scientists published a 2005 guide from the Department of State. Section III B uses three pages to explain classification of information shared by foreign governments. The discussion makes it clear that these are guidelines and not black-and-white rules. These guides are directed at the rank-and-file State Department employees. Interpretation is left to the Secretary of State.
Snowden's Comment on Secretary Clinton's Behavior
In his September interview with Al Jazzera, NSA whistleblower Edward Snowden criticized Secretary Clinton's actions. According to the article, Snowden said that:
lower-level government employees would 'not only lose their jobs," but "would very likely face prosecution" for doing the same thing
This is probably true. It is also irrelevant. As Secretary of State, Hillary Clinton was the classification authority for the Department of State. She essentially made the rules and could break them as needed in her position.
This is hard on journalists. If the Secretary discloses ("leaks") something sensitive about foreign affairs in a press interview, then the information is legitimately released. If a senior official with classification authority leaks it, then again, no foul. If a lower-level executive leaks the same information ahead of the official release, then the executive is violating security rules. The journalist might also be in trouble if the information was known to be classified or otherwise restricted.
Legal, Predictable, and Sensible?
I've made technical arguments for why Secretary Clinton's actions were legal within her position as Secretary of State. Now let's look at it from two other angles:
As the act of a modern politician using technology to make her job easier
As a cybersecurity trade-off
Email in the Government
Government cybersecurity tries to build "enclaves" to hold sensitive activities, like emails within the Office of the Secretary of State. This typically yields a highly restricted email system. Secretary Clinton can't use the system for everything; she requires an outside email server for personal and non government (i.e. political) messages.
She undoubtedly used her personal email a lot of official business. Given her age and activities, she may have spent little or no time thinking about the cybersecurity risks tied to this outside email system. Any cybersecurity expert would tell the Secretary to assume her adversaries were reading every email she sent through that server.
So far, no email review has found that Secretary Clinton herself sent any bona fide classified information. Perhaps she made very calculated use of her unofficial server. She has never commented about her cybersecurity knowledge and intentions in detail. Maybe she failed to spill secrets because she was careful, or maybe she was lucky.
Unfortunately, another email review has allegedly uncovered Top Secret information on the Clinton server. The offending emails were sent to the Secretary by a subordinate.
This underscores a fundamental risk in a free society: leaks can happen when your work straddles both the classified and unclassified realms. The subordinate probably saw the information in a classified area and repeated it while typing email on an unclassified network.
This mistake could have happened just as easily with an unclassified State Department email server. The risks might have been smaller if both the Secretary and the subordinate were using equipment under US Government control, but emails still might have leaked.
Email and Politicians
I'll simply point out that countless politicians make use of "unofficial" email services. Some have used them extensively for government business. This may generate bad publicity, but it's not clear how much people take this seriously.
The Cybersecurity Tradeoff
Here is the real Presidential question here: did Secretary Clinton show significantly bad judgement in her use of the external email server?
I've already noted that lots of politicians rely on unofficial email servers when their IT departments and governmental archives tell them to use the official government email system.
If you have ever used "secure" government technology, you know why people prefer unofficial servers. The secure alternative is usually too restricted and cumbersome for general-purpose use. They probably don't work with your smart phone or tablet. There is also the problem of "legal use of government resources." Many government entities forbid the use of government services for personal, private, or political purposes.
President Obama insisted on keeping a smart phone when he took office. This required a lot of scrambling by the NSA and other security organizations. But they succeeded in outfitting him with somewhat modern tech.
A 2013 review of Presidential gadgets showed him using an iPad and a Macbook Pro for following social media. Other photos showed him using Dell laptops for classified work. One image showed then-Secretary Clinton in front of a Dell laptop inside the highly classified Situation Room. She uses classified systems when working on classified material.
I understand why Secretary Clinton wanted a more practical email server. I also understand why the National Archives wanted her to use the official email system. The alternative official system would still have been "unclassified." Careless messages shared there could still land in unauthorized hands. Clinton probably saw no point in having two separate systems for unclassified email.
classifiedClintonelectionsemailPresidentTop Secret
Previous PostAdieu, Online SchoolNext PostEncrypt All Hard Drives!


The Bag: This month's bag has chessboard print with black squares running all over. Mine is a bronzy orange shade with holographic stripes in between. The surface the bag is smooth and made out of plastic. The insides are covered with a black lining. It definitely is sturdy but when I compared it to the November Fab Bag, the breadth somehow seemed shorter this time (minor difference). The official Fab Bag Insta handle showcased 7 colors in this month's bag and I really liked the way silver and copper bronze one appears.
This is a full size product which is meant for nourishment of the feet. The fragrance is that of the jasmine and it does linger on for a while. I tried it onto my extremely dry hands and I've decided to use it not merely for the feet but my hands too!😁 It is not at all greasy and gets absorbed within no time. The main ingredients being- Olive Oil, Cocoa Butter and Shea Butter.
Last month was a body mist from the same brand. This time it's a hair mist, the function of which is to dispense fragrance onto your hair strands. The fragrance is kinda sweet and I do like it. Some days, I use Tony & Guy Sea Salt spray which itself has a nice faint fragrance, so for the second hair day I might use this one. I was wondering if I can spritz the same onto my clothes and get away with it! 🙈😉 It's a deluxe sample comprising of 50 ml.
Final Verdict: Overall I am quite contented with the products that I received this month. Though again, the bag did not really appeal to me that but then I can use it for storage purposes. In case you wanna try out any of the products or buy your own Fab Bag, click here.


text:
Home / All / Garment & fashion / Thobe Fabric Exports to Middle East Favorable Contracting
Thobe Fabric Exports to Middle East Favorable Contracting
August 9, 2016	Garment & fashion, Middle East and Africa
Thobe Fabric :: The Ramadan (fasting month) sales season will determine the success or failure of fiscal 2016 exports of fabrics for thobe (an ankle-length Arab garment) to the Middle East, and sales are expected to reach a peak in early July. In fiscal 2015, thobe fabric exports remained buoyant for Japanese companies thanks to the weaker Japanese currency, and this was a factor driving up their business performance. Shipments for this year's Ramadan sales are already completed, and Japanese companies are waiting for the results of sales at shops and stores. The contracting of fabrics for deliveries after Ramadan is said to be favorable, but there is concern about the outlook of the real economy due to low oil prices and political unrest.
Katsuhiro Iwai, General Manager of the Textile Dept. at Toyobo STC Co., Ltd., which supplies products of the highest quality even among Japanese products, says, "The local economic conditions in the Middle East are recently not good with the impact from low oil prices," Meanwhile, the General Manager commented that this year's business continued to be as satisfactory as last year with contracting remaining "too favorable". Contrary to last year when contracting got off to a good start but got held up in the second half, Iwai says, "This year sales were off to a slow start late but caught up in the second half."
The company's sales policy also seems to have a positive effect on business. Last year, Toyobo STC could not completely sell during the sales season. But by selling to limited customers this year, the company succeeded in increasing its say to buyers, and advantageously held sale negotiations despite the unfavourable business condition.
Shikibo Ltd. reigns as the other leader of the top zone. According to Osamu Hirata, Deputy General Manager of Textile Div., Sales Dept. II at Shikibo, the business was strong in the previous fiscal year ending in March 2016 with the sales volume increasing by 30% from the first half through the second half. Sales in the current fiscal year continue to be strong maintaining this pace.
In accordance with the start of the second half of fiscal 2015 (from September 2015), Shikibo Konan Ltd., Shikibo's main processing plant, increased its personnel and capacity for processing fabrics for the Middle East market, and the effects of this reinforcement are already appearing. As of the middle of May, the processing space at Shikibo Konan was fully booked "up to the end of this year", and the space for outside-ordered factory goods was also filled until summer next year. The company's pricing policy to maintain the local price without being affected by the fluctuation of exchange rates, has resulted in extending contracts for deliveries well into the future.
Ichimura Sangyo Co., Ltd. exports the largest amount of thobe fabrics from Japan. Manabu Kitazumi, Manager of the Spun Polyester Textile Sect., Textile Dept. 1 at Ichimura Sangyo, says, "Inquiries themselves are enough to fill up to the distant future, but the uncertain economic outlook including oil price trends is making buyers assume a cautious attitude toward contracting goods for deliveries later in the fiscal year."
Ichimura Sangyo severely predicts that the company's thobe fabric exports to Saudi Arabia and Dubai, its major export markets, during the current fiscal year might decrease by as much as 30% compared to fiscal 2015. Particularly, exports to Dubai, from which re-exports are large, are likely to encounter the greatest difficulties, due to the stagnant movements of goods caused by political unrest in surrounding areas.
Whether contract orders are made smoothly is to be determined by the situation and movements of store sales. This year's Ramadan sales are an extremely important point, and will reach their peak in early July when the fasting month comes to an end. The situation of sales was opaque as of the middle of May, as the movement of summer articles was still slow. However, a trade source commented that overall consumer confidence is weak, and wholesalers and retailers had created a momentum to liven up sales before the Ramadan sales season arrive, but the realities are that the ultimate consumers were not following.
The business climate also differed by region. In Dubai and Saudi Arabia where low crude oil prices gave a heavy blow to public finances, the situation is observed to be pessimistic. Meanwhile, natural-gas-producing Qatar is booming despite the low crude oil prices. Beside strengthening sales in neighboring countries, even for Saudi Arabia and Dubai which are said to be relatively strong during an economic downturn, Japanese companies will make utmost efforts to maintain sales of high-class thobe fabrics to regular customers, for which the fluctuation of prices is less. The outcome of such sales will probably be the key determining the success of this year's sales.
+ Middle East Textile Journal
Send us article and press release to : info@kohanjournal.com
Tags middle east Saudi Arabia UAE
Rwanda's 2020 fashion highlights
A silk relics exhibition debuts in Shanghai, showing cultural exchange between China and Europe


text:
Book Series or Stand-Alone?
I feel like books series are reaching epidemic proportions. It's hard to find a book that's NOT part of a series.
From a marketing standpoint, I can clearly see the advantages. Hook the reader and sell three books instead of one. More book sales equals more money. The author creates a name and a brand for themselves, and everyone's happy.
Or are they?
From a reader's standpoint, I'm not sure I'm sold on the series approach. Don't get me wrong, some series are amazing.
But in writing a series there are some inherent problems, and unless the writer is unusually skilled, these problems can lead to very disappointing books.
Here are the two issues that concern me the most:
Problem 1- Once the first book is complete, if the author has done their job well, so is the character arc. The character arc is one of the main story elements that keeps a reader hooked and reading to the end. Consequently, the next few books in the series often fall flat. How many times have you LOVED the first book in a series and the rest were only okay?
Problem 2- The first book leaves you hanging because the character arc is incomplete and the conclusion unsatisfying. This is a very popular writing trick to get readers to buy the next book. But whenever I read a story like this, I have to ask myself if the author considers me a reader or a number. Are they writing to perfect the craft or to make a sale.
This is where the tricky part comes in, because perfecting the craft and selling books are both important. It's a fine and difficult line to walk. As an author, I can relate. We all want to write the best story we can, but unless that story sells, we're just people sitting in our sweatpants at a computer all day.
Do authors who write series sell more books? It's very possible that they do.
Do authors who write stand-alone books win more awards? It seems to me they do--although I haven't done official research.
What are your thoughts? Do you prefer a series or stand-alone?
Yamile May 20, 2013 at 8:17 AM
I prefer stand-alone books. I do like it when there's a companion novel set in the same world/setting as the first book, or a novel about a second character. An example: The Wednesday Wars and Okay for now by Gary Schmidt. The main character in OfN was just a minor character in TWW and I absolutely loved both books! When you fall in love with the first book, and the story is complete, it's still a nice surprise to see the characters you love peek into the new story to say hi.
I don't like it when the in a series the first story isn't complete (The Raven Boys). I feel duped and taken advantage of. But it might be just me.
Julie Daines May 21, 2013 at 10:51 AM
Companion novels can be a great "best of both worlds" option. The readers get to spend more time in a world they've come to love, but through the eyes of a fresh, new character. Thanks Yamile!
M.J. Fifield May 20, 2013 at 10:03 AM
I don't have a preference. I find I have to take each book/series on a case by case basis.
Yamile mentioned The Raven Boys, and I loved that first story—particularly the characters—so I'm very excited for the next one. Maggie Stiefvater also wrote the stand-alone novel The Scorpio Games, and I adored that one.
Good point. Each book or series should be judged by its own merits.
Steven W May 20, 2013 at 10:33 AM
As a reader, I have to say I do prefer the books I read to be stand alone. I don't like having to remember to seek out book 2 in a series when it comes out. Often, if I know a book is part of a series, I'll wait for the full series to be released and then pick them up. I just read so many books that to keep it all straight or to remember to get such-and-such a book next year to continue the story would require a spreadsheet.
That said, if the stories are tied up nicely with each book, I'm not put off by series and seek those out. But if it's Cut off mid-story with a cliff hanger that requires the purchase of book 2 and a year wait to have a resolution, well, they've lost at least one reader if they do that... but I know some readers like that so to each their own.
But as a writer, I like writing series books. I do write stand alone books too, but series are fun since you get to play in the world a bit longer.
Some series are good enough to fill your plate with each book. But I'm with you, if it ends on a cliff-hanger, they've often lost me as a reader. By the time the next book comes out, I've usually lost interest--partly because I can't remember why I cared about the main character in the first place.
Yamile May 30, 2013 at 12:18 PM
I had to come back to add the one of the only exceptions to my "dislike" for series is the Percy Jackson books. Rick Riordan always ends in horrible cliffhangers, but I love Percy, so I'll be reading the next one as soon as it comes out. I guess if I'm too invested in a character, the author can pretty much do whatever. I'll read it.
gaylene May 20, 2013 at 12:51 PM
Stand alone. I hate when I get to the last 1/3 of a new book and think, "I hope this isn't a series. I'll be mad..." and lately it almost always is a series that leaves you hanging. By the time the next book comes out, I usually don't remember what I loved about the book in the first place.
Good comment. It's hard to remember why we want to read the next book.
Michael Offutt, Phantom Reader May 20, 2013 at 2:20 PM
Writing more books is totally milking the cow for all it's worth. So yeah...
Once you've created amazing worlds and characters, it seems a lot easier to build on that foundation than start all over again. Thanks for the comment.
Scribs May 25, 2013 at 9:04 AM
I like Yamile's comments. Stand alone or companion novels. The "Fair Assassin" novels are another fantastic example of that.
It's not that I don't like series, I just think they are so overdone now, and done poorly at that. I loved the Hunger Games trilogy, Clockwork Angel and the Divergent trilogy so far for example. But most trilogies, as you said, delay the character arc to a point that's painful or complete it in the first book. Cassandra Clare's Clockwork Angel series is one where the character arc is written masterfully, where all three main characters grow and change and then finally reach a satisfying conclusion in book three. Even then, with her fantastic characterization, the last book is a bit slow.
Bottom line: Series can be done well, but why can't we have more stand alone or companion novels. Does EVERYTHING have to be a series? If you like an author, you'll continue reading! Don't rip us off with half a story!!
Excellent examples. Thanks Tiff! And I agree with your comment that if we like the author we will keep reading, we don't need a string-along series.
I think it can depend a lot on the genre. I'm a big fan of coming of age stories and those tend to work best in a series in my opinion. The best example of this for me is Max Zimmer's Journey (If Where You're Going Isn't Home). This book was amazing and I'm delighted to say it's the first in a trilogy. When an author creates a character that you connect with so deeply, you just want to keep up the relationship as long as possible. I can't wait to read book 2. One of the best books I have read in many years. http://maxzimmer.com/the-trilogy/
Some genres lend themselves better to series.
Brooke @ Silver Lining May 27, 2013 at 9:49 PM
9 times out of 10, the stand-alone books are the ones I love the most. I also rarely love a last book in a sequel more than I love the first. And you can tell when a reader doesn't resolve something just so they can write another book to resolve it, and I personally HATE that and lose a lot of respect for the author when they do that.
All of that being said, there are some fabulous series out there, and I think that especially if the author has a grand beginning and end in mind (HP, LOTR), series can be so powerful and fulfilling.
I wouldn't mind a second Blind Eye book :)
Good comment! I hate being left hanging at the end of a book! We'll see about A Blind Eye. :)
T.J. Reed May 28, 2013 at 10:49 AM
Rarely do I pick up a book that is part of a series. I am with you, by the time I have finished the first book and the next one comes out, I have forgotten what I have loved about the story because I have started a new book in the process. I like to know that when I close the book I have reached the end of the story. Now there are some author's out there that end their story in a cliffhanger and there isn't another book to carry on a series. Stephen King does that quite often in his books and it drives me crazy!
Stephen King can get away with a lot! I guess that's what happens when you're famous.
Jaime Theler June 12, 2013 at 8:58 PM
I don't mind either stand-alones or series, honestly--IF they are done well. I think some of the series/trilogy craze is because publishers are wanting to capitalize on a brand. They don't have to go out and find new readers, because Book 1 has already established a fan base. I had a discussion with an agent recently and he said that publishers want authors to write similar things (including the same worlds), so make sure it's what you really want to do because you'll be there for a while.
Tamanna Farhana November 23, 2016 at 7:48 AM
The Secret to Getting Published


text:
Q: Table only shows 2 total results but instead shows 4 results = 2 duplicates? $get_comment = $dbh->query("SELECT sc.sc_content, sc.sc_sid, sc.sc_date, m.username FROM schedule_comments AS sc LEFT JOIN members AS m ON sc.sc_uid = m.uid WHERE sc.sc_sid = '$view'");

Right there is my query to get a members username so that it can display... BUT INSTEAD.
It duplicates my results, here's a screenshot below.
http://i.gyazo.com/4d0ab0a354bb36294afe17c8c5efd2c3.png
As you can tell, the date these rows were inserted are the exact same. Only 2 rows are different.
I don't think there's anything wrong with this query, I think it's correct. What am  I doing wrong here?

A: Try adding the DISTINCT keyword to your query:
$get_comment = $dbh->query("SELECT DISTINCT sc.sc_content, sc.sc_sid, sc.sc_date, m.username FROM schedule_comments AS sc LEFT JOIN members AS m ON sc.sc_uid = m.uid WHERE sc.sc_sid = '$view'");

It should return only, well, distinct results :-)

redpajama_set_name: RedPajamaStackExchange


Stylish updates, ideal location and a sprawling backyard come together for a beautiful place to call home.
This home in San Jose's tree-lined Rose Garden neighborhood features a main-level guest suite with full bathroom.
Popular and coveted by homeowners in the South Bay, the Rose Garden neighborhood offers a tranquil oasis from the bustle of Silicon Valley and downtown. This is where generations of the same family have lived, taking great pride in their homes, carrying on neighborhood holiday traditions and gathering to celebrate with potlucks.
The tree-lined neighborhood is also conveniently centralized for easy commutes and access to everything you need from shopping, dining, within a mile to K-12 schools, and wonderful parks.
This two-story home at 1935 University Way is picture perfect from its freshly landscaped front yard, covered flagstone porch and new front door with leaded glass panel to the backyard gardens and patio. A mature shade tree and rose-covered arbor add to the home's inviting curb appeal.
The home features about 2,290 square feet with four bedrooms, three-and-a-half bathrooms, updated well-appointed kitchen, spacious formal rooms, expansive family room, updated bathrooms, dual-pane Andersen windows and French doors, hardwood flooring and crown molding. A long gated driveway along the side leads to the detached two-car garage.
Located just about a half-mile walk to the neighborhood's namesake is San Jose's Historic Municipal Rose Garden, an 11-acre park where about half of the land is dedicated to more than 4,000 rose plants representing 189 varieties. Located at Naglee and Dana avenues, the park also features towering redwood trees around a natural grass stage.
The Rose Garden was a project of the Santa Clara Rose Society and was dedicated in 1937 after the City of San Jose voted to set aside half of the acreage to the rose garden. Today the picturesque park includes a reflection pool, water fountain, and arbor. It is also a popular and romantic wedding venue.
A wood-burning fireplace with marble surround connects the formal living and dining rooms.
The capacious formal living room and adjacent dining room feature hardwood flooring, a wood-burning fireplace with marble surround and recessed bookcases. The front-facing picture windows allow lots of natural light into the room as well and view of the front gardens.
The spacious family room features crown molding, ceiling fan and French doors that open to the backyard patio. A remodeled eat-in kitchen features a casual dining nook and French doors to the backyard. The kitchen is well appointed with shaker-style cabinetry including some with glass door panels, pull-out shelving in the pantry, quartz counters and island/breakfast bar with pendant lighting.
The remodeled eat-in kitchen features an island with pendant lighting and pull-out shelving in the pantry.
Stainless Thermador appliances include oven, dishwasher, six-burner cooktop with stainless hood and quartz backsplash, and KitchenAid refrigerator. A bar counter features a built-in microwave, wine refrigerator and additional cabinetry.
There is also a stainless sink with a pull-down faucet.
French doors separate the spacious laundry room that also features built-in shelving.
There are four bedrooms including a main level guest suite with full bathroom that features porcelain tile floor and shower surround and marble counter. A powder room, also downstairs, features a pedestal sink.
Upstairs are three additional bedrooms including the master bedroom that features crown molding and a ceiling fan. The master bathroom is beautifully appointed with radiant heated, marble tile floors, and marble counter and surround on the bathtub and shower. The walk-in closet has cedar-lined flooring.
Two additional bedrooms also have crown molding, ceiling fans and walk-in closets. They share a full updated bathroom with heated porcelain tile floors and shower surround, and pedestal sink.
The level backyard offers lots of room for entertaining, play and relaxation.
The level backyard is ample and offers lots of room for entertaining, play and relaxation. New landscaping incorporates the mature shade trees and includes raised garden beds, pergola, and patio.
The two-car detached garage includes pull-stair access to attic storage. Access to additional attic storage space is upstairs.
Additional updates include a tankless water heater, new dual-zone HVAC, copper piping, fresh interior paint,and wiring for security alarm system. The new front and back landscaping by McTighe Landscaping of Saratoga also includes new sprinklers.


With excitement already in the air in San Antonio as Fiesta weekend kicks off, Baptist Emergency Hospital announced today that it will once again become an official sponsor of the Valero Texas Open. The tournament will be held April 18-24 at the AT&T Oaks Course at TPC San Antonio.
With World Golf Hall of Fame member Phil Mickelson officially committed to play in the tournament late last week, the event is sure to attract spectators and golf enthusiasts as the top golfers from around the world gather for a week of tournament play.
Baptist Emergency Hospitals have convenient locations spread throughout the San Antonio area including Hausman, Overlook, Thousand Oaks, Westover Hills, Schertz and coming soon, Zarzamora.
The Valero Texas Open is the 6th oldest professional tournament in golf world-wide, the 3rd oldest on the PGA TOUR and the longest held in the same city. In 2012, the tournament celebrated its 90th anniversary. It's list of champions includes some of the greatest names in golf history: Walter Hagen, Byron Nelson, Ben Hogan, Sam Snead, Arnold Palmer, Ben Crenshaw, Hale Irwin, Lee Trevino, Nick Price, Justin Leonard, Zach Johnson, Adam Scott, and 2015 Champion Jimmy Walker, to name a few.
The Valero Texas Open is always driven by its charitable mission – to give back to the community. In the tournament's previous 93-year history through 2015, over $105 Million had been raised for charity. The 2015 tournament raised $10.4 million for charity, making us proud yet humbled to become only the fourth PGA TOUR event to eclipse the $100 Million milestone in funds raised for charity.


text:
2020-21 Three Rivers All-Conference Teams
Grit. Determination. Discipline.
Home / Kingfisher Tabs Cooper to Take Girls Basketball Reins
Kingfisher Tabs Cooper to Take Girls Basketball Reins
Michael Swisher
New Kingfisher girls basketball coach Taylor Cooper in action while playing for Texas A&M. [Photo provided]
Taylor Cooper
Kingfisher's search for a new high school girls basketball coach ended Thursday night.
The Kingfisher Board of Education voted unanimously to hire Taylor Cooper near the end of a special meeting.
Cooper, an assistant at Edmond Santa Fe, said she is "excited" for the opportunity.
"Becoming a head coach has always been a dream of mine," she said.
"We have a lot of work to do, so I'm ready to get started."
The position opened when Gerrett Spears resigned last month after two years.
Spears took over after Jay Wood stepped down after four seasons to become the school's full-time athletic director.
Wood was instrumental in selecting Cooper.
"She knows what it takes to win and be successful," Wood said.
Cooper has been a part of successful programs in the past.
She played on a state title team at Bethel as a junior in 2011, winning state tournament MVP along the way.
Cooper was on an undefeated Shawnee team in 2012 that won the 5A title.
One of the state's top recruits, Cooper initially signed at Oral Roberts University.
After a year, she transferred to Texas A&M where she completed her playing career and also earned a bachelor's in agricultural leadership and development.
She spent four years as an assistant at Bishop McGuinness before moving over to Santa Fe last season.
Cooper has since earned a master's degree in sports management and administration from Southern Nazarene University.
For a more detailed story on Cooper, see Wednesday's (April 21) edition of the Times & Free Press.
KingfisherPress.net
Kingfisher Oklahoma


text:
Home/Bollywood/When Anu Aggarwal threw a journalist out for asking about her sexuality
ActressBollywoodCelebritiesCelebrity GossipsNews
When Anu Aggarwal threw a journalist out for asking about her sexuality
Anu Aggarwal as of late opened up on how news stories demolished her relationship. She likewise opened up on how one writer inquired as to whether she is a lesbian for she was companions with gay people.
Anu Aggarwal as of late opened up on how the business never truly approached craftsmen with deference and were simply desirous and elevate on-screen characters who had a place with families having a place with the business. The on-screen character said that she identified with the battle that Sushant Singh Rajput looked as she needed to experience a similar when she had made her introduction in the business. As of late, the Aashiqui entertainer opened up on how media turned her own life hellfire by printing bogus tales about her.
"I was known as the sweetheart of the media when I rose to notoriety. It was a sweet term to utilize however a great deal of poop was composed as well. They were contacting my own life also. They would compose everything without exception, 'gracious my god, she sniffled, she was out alone, she lit a cigarette there and she is engaging in extramarital relations'. In this way, such stories beginning coming in and it influenced my own life. My beau left me asking what's going on. They began connecting me with different folks and I resembled, what do I do? Back then, we didn't have online life. We didn't have a word called a star, in those days we were reliant on press and whatever they composed turned into our existence," Anu conceded. She stated, "However I chose to treat everything with humor," the entertainer told Pinkvilla.
Anu reviewed the occurrence when once a columnist believed that she was a Lesbian. "One columnist went to my home and suggested on the off chance that I was a lesbian since I had gay companions. She was humiliated to try and inquire as to whether I was a lesbian. I stated, my life, my sexuality is mine, it is my right to discuss it yet in the event that they are going to pass judgment on me, I requested that her get out. I simply don't care for individuals distorting me."
The on-screen character said that the entirety of this influenced her perspective on adoration and she got critical about it. "Truly, I did in light of the fact that I felt that Rick knows me, please, he should realize that media is composing junk. In the event that he will begin trusting it, at that point does he truly adore me? What is love? I was truly harmed and would shout out a ton. In this way, indeed, the trust issues and all made me skeptical."
Vikas Guppta decides to share his lessons with fans after coming out as a bisexual
Salman Khan tweets about Sushmita Sen's web-series Aarya, gets trolled


text:
UN report: Nature is going downhill. Fast.
By Dawn Stover | May 15, 2019
Hawksbill turtle floats above an Indian Ocean coral reef in the Maldives. Nearly half of the live coral cover on reefs has been lost in the past 150 years, and coral reefs are particularly vulnerable to climate change. Credit: Andrey Armyagov/Shutterstock
"Nature is declining globally at rates unprecedented in human history—and the rate of species extinctions is accelerating, with grave impacts on people around the world now likely." That's the 10-alarm message from a global assessment report released today by the International Science-Policy Platform on Biodiversity and Ecosystem Services (IPBES), an independent body established by United Nations member states.
While scientists have long been warning that a mass extinction is under way, this is the most comprehensive report on global biodiversity to date, and the first issued since 2005. Among its findings:
An estimated 1 million of the planet's 8 million animal and plant species are now threatened with extinction, many within decades.
The average abundance of native species in most major land-based habitats has fallen by at least 20 percent, mostly since 1900.
Three-quarters of the planet's land-based environment and about two-thirds of the marine environment have been significantly altered by human actions.
Nearly a third of the world's forest area has been lost since pre-industrial times, and wetlands loss is happening three times faster than forest loss.
More than a third of the world's land surface and nearly three-fourths of freshwater resources are now devoted to crop or livestock production.
Food crop production has tripled since 1970, and 23 percent of land areas have seen a reduction in agricultural productivity due to land degradation.
One-third of marine fish stocks are being harvested at unsustainable levels.
In the 21 countries with detailed records, the numbers of invasive alien species per country have risen by about 70 percent since 1970.
Plastic pollution worldwide has increased tenfold since 1980.
Showdown in Dixie Valley: Battle over geothermal project pits tiny toad against renewable energy
The report's 145 expert authors from 50 countries ranked the five main reasons for this precipitous decline in nature, in descending order: changes to land and sea use; direct exploitation of organisms; climate change; pollution; and invasive alien species. They warn that global goals for conservation and sustainability can only be achieved by "transformative changes across economic, social, political and technological factors."
Publication Name: IPBES Global Assessment Report on Biodiversity and Ecosystem Services
To read what we're reading, click here
Together, we make the world safer.
The Bulletin elevates expert voices above the noise. But as an independent, nonprofit media organization, our operations depend on the support of readers like you. Help us continue to deliver quality journalism that holds leaders accountable. Your support of our work at any level is important. In return, we promise our coverage will be understandable, influential, vigilant, solution-oriented, and fair-minded. Together we can make a difference.
Make your gift now
Keywords: IPBES, biodiversity
Topics: Climate Change, What We're Reading
Get alerts about this thread
And the leader of the most powerful nation in the world calls climate change a Chinese hoax. How can humanity move forward under these egregious conditions?
Dawn Stover
Dawn Stover is a contributing editor at the Bulletin. A science writer based in the Pacific Northwest, her work has appeared in Scientific American, Conservation, Popular Science, New Scientist, The New York Times,... Read More
By Sara Goudarzi
By Matt Field
Reuters: Kremlin expresses alarm over 'Doomsday Clock'
By Gayle Spinazze
Mail & Guardian: Only bold, collective action can turn back the hands of the Doomsday Clock
Boom: Every Year We Set the Clock
The Guardian: Doomsday Clock at record 90 seconds to midnight amid Ukraine crisis
By Maanvi Singh
By Dan Drollette Jr
By Damian Carrington
By Kala Hunter
By Thomas Gaulkin
By Erik English
By Alexander Kmentt
By George Poste, David Gillum
By Lauren Sukin
By Steven Pifer


text:
City of London, United Kingdom
Based in one of the world's most exciting capital cities, London Met is home to a diverse community of inspiring and determined learners, teachers and innovative thinkers. We offer a wide range of courses, from undergraduate and postgraduate degrees to short courses and professional qualifications, many of which are available to study full-time or part-time to best suit your needs and lifestyle.
All of the LMU undergraduate courses include some form of work-related learning, such as a placement, client project or on-campus work experience.
LMU degrees are valued by employers around the world.
All of the LMU undergraduate courses include some form of work-related learning.
Ph.D. Doctor of Philosophy
M.A. Early Childhood Studies
M.A. English Language Teaching (Distance Learning)
Engineering & Technology (2)
M.Sc. Biomedical Studies (Distance Learning)
M.Sc. Information Technology (Distance Learning)
Medicine & Health (2)
M.Sc. Blood Science (Distance Learning)
Computer Science & IT (1)
M.A. Climate Security - Humanitarian - Development - Peacebuilding
LL.M. Maritime Law (Top-Up) (Distance Learning)
The University as it is today was created in 2002 with the merging of London Guildhall University and the University of North London, the first merger between two universities in the UK. Its roots, however, lie firmly in the nineteenth century with the establishment of the Metropolitan Evening Classes for Young Men in 1848.
Students studying in any of our schools have access to all our communal facilities (such as libraries, social spaces, cafés and eateries), and each school also has areas of expertise which might mean you use specialist resources as part of your course. Our schools have links to relevant businesses in sectors related to their specialist subject areas, and the schools are also hotbeds of research undertaken by University academics and PhD students.
£2,000 Scholarship - all full-time international fee-paying students receive a £2,000 scholarship if they are successful with their application to London Met.
EU Transition Scholarships - Our EU Transition Scholarship will automatically be applied to eligible EU students with overseas fee status starting a degree with us in January 2023. This scholarship includes a tuition fee reduction for the duration of your studies and is applicable to both undergraduate and postgraduate courses.
The high-quality research forms a core part of the life of London Met and underpins all that we do.
Research covers everything from teaching thousands of undergraduates, supervising several hundred students on PhD and Professional Doctorate programmes, conducting funded research or working with our many partners.
London Met is home to a number of research centres, groups and units that provide a focal point for staff and research students. They give definition and direction to the work that we do.
At London Met, you will have a dedicated School Office that will be your first port of call for any queries you may have.
Your School Office is where you can access a variety of services, advice and guidance during your time as a student with us.
It's important to find somewhere safe, affordable and comfortable to live in a new city, so we're here to give you a comprehensive guide to student housing in London.
We aim to give you a comprehensive guide to student housing in London, including:
finding accommodation in external student halls of residence
searching for private rented accommodation (flat shares, whole flat and house rentals)
finding single-semester and short-stay accommodation, including homestay and hotels and bed and breakfasts (B&Bs)
living in private rented accommodation
advice about summer accommodation
landlord services including opportunities for landlords and agents to advertise accommodation to our students
The libraries have over 274,337 books, 59,922 e-books and 42,135 e-journals for you to use. As well as reading for study we have a popular reading-for-pleasure collection. Research shows that reading for pleasure can help student achievement. As a London Met student you'll be able to use our online catalogue to search or browse our collections.
London Met invests in you. The University boasts state-of-the-art learning, library and IT facilities where you can hone your skills – from a mock courtroom, purpose-built art, design and recording studios to a £100,000 journalism newsroom and our £30 million Science Centre, which is one of the largest science teaching labs in Europe.
The gym is based at Holloway campus with an exercise room at Aldgate. Affordable membership is available to students, staff and the public.
City of London, England, United Kingdom
95 (Pre-)Masters
4 PhDs
Visit London Metropolitan University Website
M.Sc. Blood Science


Hi my name is Nina, I am an architect engaged in practice-based research in the terrain of urban acoustic space at the KTH School of Architecture in collaboration with Konstfack University College of Arts, Crafts and Design in Stockholm.
The point of departure in my doctoral work is the overall question: how can architects and urban planners work practically and creative with urban sonic environments and make use of the notion of "sound quality" in decision-making processes as an important tool for communication of transparent but constantly present qualities?
Sound as a mediator of social, spatial and temporal qualities has the ability to deepen our understanding for existing urban spaces/trajectories/areas, and illuminate their divers and maybe contrasting meanings and values in the urban mesh. By looking and listening closely at our surrounding everyday environment, it is possible to reveal other kinds of relations and connections between urban spaces which would otherwise be neglected or ignored.
By exploring a fairly outstretched study-site in Stockholm (Hornsgatan) through the making and use of various mapping techniques in different media, new perspectives and discussions can be raised which may be relevant and useful in the context of urban sound environment and design.


A leading Manx athlete is set for a come back with the help of some local businesses.
World Youth Championship bronze medallist, Catherine Reid, underwent surgery earlier this year after a suffering a severe knee injury.
Now, with the assistance of SMP Partners, Newfield and Isle of Man Sport Aid, Catherine is undergoing intensive rehab and set to make her athletics comeback in 2019.
With her eyes set on the future, the sprinter hopes to qualify for the 2022 Commonwealth Games in Birmingham.


Published 04/24/2019 08:37:05 pm at 04/24/2019 08:37:05 pm in Makeup Air Fan.
makeup air fan make up air unit for kitchen conditioning commercial make up air make up air fan function.
make up air fan wiki mlp,make up air fantech radon,make up air fan wiki invincible,make up air fan function,make up air fan function on central air,make up air fan function in ac,make up air fan function on thermostat,kitchen makeup air fan,restaurant makeup air fans,make up air fan wiki how to train,make up air fan residential.


This is where the BATTLECRUISE H50 promises to lead you. "Long Life", "Smooth Handling" and "Comfort Riding" are the key features that H50 offers.
The rear tire can claim a long life as much as 2.7 times of the EXEDRA MAX.
By optimizing rigidity distribution (vertical spring rate), the front tire absorbs energy inputs from the road surface while maintaining rigidity, reducing vibration through the handlebars.
Imperfections on the road surface are well damped. You will realize a real comfort touring with reduced fatigue even at long distance cruising.
General public roads in the U.S.
The tread pattern design of the BATTLECURISE H50 has been employed from EXEDRA MAX, adding diamond cut deco-grooves for the design enhancement.
Our pattern designer was inspired by leather craft stitches to come up with these deco-grooves.
The 3 day launch event for media was held in the vicinity of Orlando Florida near the Apoka lake during Oct.17th through 20th, 2016.
Find the video including some interviews from the link below.
※ Do not use with MTM rims, CM contour rims or WM rims manufactured before 1977.
※ Please contact the tire manufacturer for the combination of tire and rim.


text:
Becky and Kaia's New Addition
For ages 5-13. It's a very special day at Penn State Children's Hospital for Kaia and Becky, the hospital's two child support dogs. This golden dynamic duo has a lot to bark about, including their mission to provide kids and families with emotional support as they navigate their way through their hospital journey.
From Lindsay C. Barry, author of Journey to Constellation Station, and Susan Szecsi, award-winning illustrator of Yes, I Can Listen!, comes this exciting new picture book about a day in the life of Penn State Hospital's emotional-support Golden Retrievers. A portion of all royalties are being donated to the Children's Hospital in hopes of helping other children and families in the future.
Lindsay C. Barry developed her love of reading and writing at a young age, and even more so when she stumbled upon a magical world called Narnia. She is a graduate of Pennsylvania State University and has worked in advertising and executive search. Her first love has always been writing and education. Her mother, an English, drama, and creative writing teacher, made sure that Barry's love for the literary world was deeply ingrained from a young age.
Barry lives in the Washington, D.C. area with her husband, two sons, two cats, one bearded dragon named Spyro, one red Beta fish named Goldie, a blue budgie named Ice Dragon, and a yellow budgie named Goldie (sense a theme?). Her sons inspire her life and writing every single day. Find her at lbarrybooks.com, and on Instagram and Twitter @lbarrybooks
About the Illustrator:
Susan Szecsi is an award-winning illustrator with traditional fine art training. As a little girl she wanted to be an astronaut a princess or a magician. She has fulfilled one of her dreams because she discovered that illustrating books is like doing magic every day. Susan has two sons and lives in the San Francisco Bay Area with her husband. See Susan's works at brainmonsters.com
Shop Indie via Bookshop.org
Pre-Order from Amazon
Pre-Order direct from SFWP