text:
\section{Introduction}
\label{sec:Introduction}

DNS is an integral part of the Internet infrastructure. Unfortunately, it does not offer privacy, i.\,e., the so-called resolvers (recursive nameservers) can see all queries sent to them in the clear. Resolvers can learn about users' habits and interests, which may infringe their privacy if the resolver is not run by a trusted party, but by a third party such as Google, whose resolver 8.8.8.8 serves more than 130 billion queries per day on average \cite{googledns}. The discussions about limiting tracking via cookies spurred by the ``Do not track'' initiative may result in DNS queries becoming the next target for tracking and profiling purposes \cite{Conrad12-dnssecurity}. According to \cite{HBF:2013} behavior-based tracking based on DNS queries may be feasible.

Integrating mechanisms for confidentiality into DNS is difficult because of the need for compatibility with existing infrastructure. Fundamental changes to the protocol are implemented very slowly, as previous attempts have shown: Although the initial DNSSEC security extensions have been proposed in 1999 \cite{rfc2535}, the majority of users still can not profit from their benefits today. Unfortunately, DNSSEC does not address privacy issues due to an explicit design decision \cite{rfc4033}.

Currently, there is no indication that facilities for privacy-preserving resolution will be integrated into the DNS architecture in the short term. Previous research efforts have focused on interim solutions, i.\,e., add-ons and tools that enable users who care for privacy to protect themselves against profiling and tracking efforts. The objective consists in designing and evaluating suitable privacy enhancing techniques in such a way that users do not have to rely on or trust the existing DNS infrastructure. The ``range query'' scheme by Zhao et al. \cite{Zhao:2007a} is one of those efforts.
The basic idea consists in \emph{query obfuscation}, i.\,e., sending a set of dummy queries (hence the term ``range'') with random hostnames along with the actual DNS query to the resolver.

So far the security of range query schemes has only been analyzed within a simplistic theoretical model that considers the obtainable security for \emph{singular queries}. In this paper we study the security offered by range queries for a more complex real-world application, namely \emph{web surfing}, which is one of the use cases Zhao et al. envision in \cite{Zhao:2007a}. In contrast to singular queries, downloading websites typically entails a number of inter-related DNS queries.
Our results indicate that the range query scheme offers less protection than expected in this scenario, because dependencies between consecutive queries are neglected.

The main contribution of this paper is to \textbf{demonstrate that random set range queries offer considerably less protection than expected in the web surfing use case}. We demonstrate that a curious resolver (the adversary) can launch a semantic intersection attack to disclose the actually retrieved website with high probability. We also show how the effectiveness of the attack can be reduced, and we identify a number of challenges that have to be addressed before range query schemes are suitable for practice.

The paper is structured as follows. In Sects.~2 and 3 we review existing work and fundamentals. Having described our dataset in Sect.~4, we continue with theoretical and empirical analyses in Sects.~5 and 6. We study countermeasures in Sect.~7 and discuss our results in Sect.~8. We conclude in Sect.~9.

\section{Related Work}
\label{sec:relatedWork}

The basic DNS range query scheme was introduced by Zhao et al. in \cite{Zhao:2007a}; there is also an improved version \cite{Zhao:2007b} inspired by private information retrieval \cite{Chor:1995}.
Although the authors suggest their schemes especially for web surfing applications, they fail to demonstrate their practicability using empirical results.

Castillo-Perez and Garcia-Alfaro propose a variation of the original range query scheme \cite{Zhao:2007a} using multiple DNS resolvers in parallel \cite{Castillo-Perez:2008,Castillo-Perez:2009}. They evaluate its performance for ENUM and ONS, two protocols that store data within the DNS infrastructure. Finally, Lu and Tsudik propose PPDNS \cite{Lu:2010}, a privacy-preserving resolution service that relies on CoDoNs \cite{RamasubramanianS04-codons}, a next-generation DNS system based on distributed hashtables and a peer-to-peer infrastructure, which has not been widely adopted so far.

The aforementioned publications study the security of range queries for singular queries issued independently from each other. In contrast, \cite{FederrathFHP11-dnsmixes} observes that consecutively issued queries that are dependent on each other have implications for security. They describe a timing attack that allows an adversary to determine the actually desired website and show that consecutive queries have to be serialized in order to prevent the attack.

\section{Fundamentals}
\label{sec:fundamentals}

\subsection{Random Set DNS Range Query Scheme}
\label{sec:dnsrq}

In this paper we focus on the basic ``random set'' DNS range query scheme as introduced in \cite{Zhao:2007a}.
Zhao et al. stipulate that each client is equipped with a large database of valid domain names \textbf{(dummy database)}. Each time the client wants to issue a DNS query to a resolver, it randomly draws (without replacement) $N-1$ \emph{dummy names} from the database, and sends $N$ queries to the resolver in total. When all replies have been received from the resolver, the replies for the dummy queries are discarded and the desired reply is presented to the application that issued the query.

Zhao et al. claim that this strategy leaves the adversary with a chance of $\frac{1}{N}$ to guess the desired domain name. The value of $N$ is a security parameter, which is supposed to be chosen according to the user's privacy expectations and performance needs.

\subsection{Query Patterns}
\label{sec:patterns}

The semantic intersection attack exploits the fact that typical websites embed content from multiple servers, causing clients to issue a burst of queries for various domain names in a deterministic fashion, whenever they visit the site. For example, visiting \emph{google.com} will also trigger a DNS request for \emph{ssl.gstatic.com}, as the site includes some resources from that domain. We call the set of domain names that can be observed upon visiting a site its \emph{query pattern} $p$, i.\,e., $p(\mathrm{google.com}) = \{\mathrm{google.com},\mathrm{ssl.gstatic.com}\}$. In Sect.~\ref{sec:dataset}, we will show that many popular websites do have query patterns that can be used for this attack.

Using range queries, each individual query from a pattern $p$ is hidden in a set of $N-1$ randomly chosen queries, leading to $|p|$ sets, each containing $N$ queries, being sent to the resolver in order to retrieve all the domain names required to visit the corresponding website. We refer to $N$ as the \emph{block size} of the range query scheme and to each individual range query as a \emph{block}.

Note that the client uses standard DNS queries to deliver the range query, because it uses a conventional DNS resolver, i.\,e., a single range query with a block size of $N$ causes $N$ individual DNS queries.

\subsection{The Semantic Intersection Attack}
\label{sec:attack}

An adversary, who is in possession of a database that contains the query patterns for a set of websites he is interested in \textbf{(pattern database)}, can check whether one of these patterns can be matched to consecutive query blocks received by the client. As all the dummy names are drawn independently from each other from the dummy database, it is quite unlikely that the client will draw the pattern of a different website by chance. Therefore, the adversary can be optimistic that he will only find a single pattern in the set of consecutive range queries he receives from the client, i.\,e., the pattern of the actually desired website.

\begin{figure}[t]
\centering
\includegraphics[width=1.0\textwidth]{pictures/modes}
\caption{Distinguishability of blocks for the resolver}
\label{fig:attack:1}
\end{figure}

From the viewpoint of the adversary there are two different scenarios, depending on how well the adversary can distinguish consecutive blocks (cf. Fig.~\ref{fig:attack:1}). The adversary may either be able to identify all the queries that belong to the first block, but be unable to determine which of the remaining queries belongs to which of the remaining blocks (\textbf{1BD}, 1st block distinguishable), or be able to distinguish all individual blocks, i.\,e., be able to determine for all queries to which block they belong (\textbf{ABD}, all blocks distinguishable).
The difference between the 1BD and the ABD scenario becomes evident by considering the following example. When a user visits the site \emph{\url{http://www.rapecrisis.org.uk}}, her browser will issue a query for \emph{www.rapecrisis.org.uk}. Moreover, it will issue two additional queries, for \emph{twitter.com} and \emph{www.rapecrisislondon.org}, once the HTML page has been parsed. For illustrative purposes we assume that range queries with $N=3$ are used. In the \textbf{ABD scenario} the adversary might, for instance, observe a first block of queries for (\emph{cnn.com},  \emph{www.rapecrisis.org.uk}, \emph{img.feedpress.it}), then a second  block for (\emph{github.com}, \emph{twitter.com},  \emph{s.ebay.de}), and finally a third block for  (\emph{www.rapecrisislondon.org},  \emph{ytimg.com},  \emph{conn.skype.com}). In contrast, in the \textbf{1BD scenario} the adversary might observe a first block with (\emph{cnn.com}, \emph{www.rapecrisis.org.uk}, \emph{img.feedpress.it}) and a second block with (\emph{github.com}, \emph{twitter.com}, \emph{www.rapecrisislondon.org}, \emph{s.ebay.de}, \emph{ytimg.com}, \emph{conn.skype.com}).

The first block is distinguishable in both scenarios, because the web browser has to resolve the \emph{primary domain name} in order to learn the IP address of the main web server. This IP address is received within the replies that belong to the first block of queries. After the browser has downloaded the HTML file from the main web server, it will issue queries for the \emph{secondary domain names} in order to retrieve all embedded content hosted on other web servers.

Given a \emph{pattern database DB} that contains primary and secondary domain names of websites, the adversary proceeds as follows in order to carry out the intersection attack in the \textbf{ABD scenario}:

\begin{enumerate}
\item  From \emph{DB} the adversary selects all patterns, whose  primary domain name is contained in the first block, obtaining the set of candidates $C$.
\item The adversary selects all patterns with length $|p|$, which is the number of observed blocks, from $C$ to obtain $C_{|p|}$.
\item For each pattern $q$ in $C_{|p|}$ the adversary performs a \emph{block-wise set intersection}: $q$ is a \emph{matching pattern}, if all of its domain names are dispersed among the blocks in a plausible fashion, i.\,e., iff
  \begin{enumerate}
    \item each block contains at least 1 element from $q$, and
    \item each element of $q$ is contained in at least 1 block, and
    \item $q$ can be completely assembled by drawing one element from each block.
  \end{enumerate}
\end{enumerate}

In the \textbf{1BD scenario} the adversary has to use a different approach, because there are only two blocks observable:

\begin{enumerate}
\item  From the pattern database the adversary selects all patterns, whose  primary domain name is contained in the first block, thus obtaining the set of candidate patterns $C$.
\item For each pattern $q$ in $C$ the adversary performs a \emph{block-wise set intersection}: $q$ is a \emph{matching pattern}, if all of its secondary domain names are contained within the second block.
\end{enumerate}

Note that due to caching, the adversary cannot reliably determine $|p|$ in the 1BD scenario. Due to variations in the lookup time of different domain names, the stub resolver on the client may already receive replies (and cache the results) for some domain names before all range queries have been submitted to the resolver. However, if the range query client happens to draw one of the cached domain names as a dummy, the stub resolver will not send another query, but answer it immediately from its cache. As a result, some queries will not reach the adversary and the effective size of consecutive blocks will vary. Therefore, the adversary cannot easily determine $|p|$ in the 1BD scenario in order to filter the set $C$. For now, we neglect the fact that caching may also affect the desired queries (cf. Sect.~\ref{sec:discussion} for a discussion of this issue).

In the remainder of the paper we focus on the \textbf{1BD scenario}, which  we deem to be more realistic than the ABD scenario. Contemporary web  browsers issue the queries for the secondary queries in parallel. Thus, when the range query client constructs range queries for each of the desired domain names, the individual queries of all the blocks will be interleaved, causing uncertainty about the composition of the individual blocks.
On the other hand, the ABD scenario is relevant for range query schemes that submit all queries contained in a block in a single message. We will consider the effect of this approach in Sect.~\ref{sec:evaluation:ex3}.

\section{Dataset}
\label{sec:dataset}

In order to evaluate the feasibility of the semantic intersection attack, we performed probabilistic analyses and implemented a simulator that applies the attack to the patterns of actual websites.
For this purpose we obtained the query patterns of the top $100{,}000$ websites of the ``Alexa Toplist'' (\url{http://www.alexa.com}) with the headless Webkit-based browser PhantomJS (\url{http://phantomjs.org}).\footnote{\label{fnote:github}The source code of our crawler and simulator as well as all experimental data is available at \url{https://github.com/Semantic-IA}} As PhantomJS was not able to reach and retrieve all of the websites contained in the Toplist at the time of the data collection (May 2013) the cleaned dataset contains with $|P|=92{,}880$ patterns and $|Q|=216{,}925$ unique queries. The average pattern length (\textit{mean value}) is $13.02$ with a standard deviation of $14.28$.
The distribution of pattern lengths as displayed in Fig.~\ref{fig:patternlengths} shows that, while patterns of the length 1 are frequent, patterns of higher lengths make up the majority of the dataset. The longest pattern consists of $315$ queries.

\begin{figure}[t]
\centering

\includegraphics[width=0.48\textwidth]{data-lengths/histogram}
\hfill
\includegraphics[width=0.48\textwidth]{data-lengths/cdf}
\caption{Histogram and cumulative distribution of pattern lengths}
\label{fig:patternlengths}
\end{figure}

\section{Probabilistic Analysis}
\label{sec:analysis}

Before we carry out any practical evaluation using our simulator, we want to get an expectation of the likelihood of \textbf{ambiguous results}, which occur if the client happens to draw all the domain names of another website from the dummy database while the range queries needed for the desired website are assembled. If the client draws all domain names of a different pattern by chance and distributes the individual names among the blocks in a plausible fashion, the adversary will observe two patterns: the pattern of the actually desired website as well as the \textbf{random pattern}.

\subsection{Modeling the Probability of Ambiguous Results}
\label{sec:themodel}

In the 1BD scenario an ambiguous result occurs if the primary domain name of a random pattern (the domain name of the corresponding website) is selected as a dummy in the first block, and all remaining elements of the pattern are contained in the union of the remaining blocks.\footnote{In the 1BD scenario the query distribution between the remaining blocks is irrelevant, as long as all needed queries occur at least once in the union of the blocks.}
The probability for an ambiguous result can be modeled as a series of hypergeometric distributions. A hypergeometric distribution $h(k|N;M;n)$ describes the probability of drawing $k$ elements with a specific property when drawing $n$ elements out of a group of $N$ elements, of which $M$ have the desired property:

\begin{equation}
\label{eq:analysis:1}
h(k|N;M;n) := \frac{{M \choose k}{N-M \choose n-k}}{{N \choose n}}
\end{equation}

First, we need to obtain the probability to draw the first element of a pattern of the correct length $n$ into the first block of queries. As the variables of the hypergeometric distribution overlap with those we use to describe the properties of a range query, we substitute them for their equivalents in our range query notation. $N$ is equal to $|Q|$, the number of names in the dummy database. $M$ equals to the number of patterns of the correct length, which we will write as $|P_n|$. In our case, the parameter $n$ of the hypergeometric distribution corresponds to $N-1$, as we will draw $N-1$ dummy names into the first block. By substituting these values into Eq.~\ref{eq:analysis:1}, we obtain the probability $p(n, k)$ of drawing exactly $k$ beginnings of patterns of the length $n$:

\begin{equation}
\label{eq:analysis:2}
p(n, k) := \frac{{|P_n| \choose k}{|Q|-|P_n| \choose (N-1)-k}}{{|Q| \choose N-1}}
\end{equation}

In addition to that, we need to determine the probability of drawing the remaining $k*(n-1)$ queries into the second block, which contains the remaining $(n-1)*(N-1)$ randomly drawn dummy names in the 1BD scenario. To complete our $k$ patterns, we need to draw $k*(n-1)$ specific dummy names. The probability of success is described by the function $q(n,k)$, which is given in Eq.~\ref{eq:analysis:3}.

\begin{equation}
\label{eq:analysis:3}
q(n, k) := \frac{{n-1 \choose n-1}^k {|Q|-(n-1)*k \choose (n-1)*(N-1)-(n-1)}}{{|Q| \choose (n-1)*(N-1)}} = \frac{{|Q|-(n-1)*k \choose (n-1)*(N-1)-(n-1)*k}}{{|Q| \choose (n-1)*(N-1)}}
\end{equation}

The two probabilities $p(n,k)$ and $q(n,k)$ can now be combined to receive the probability of drawing $k$ complete patterns of the correct length $n$:

\begin{equation}
\label{eq:analysis:4}
P(n, k) := p(n,k)*q(n,k)
\end{equation}

In this context, the expected value of $P(n,k)$ for different values of $n$ is of interest, as it describes the average number of patterns we expect to see. The expected value, in general, is defined as:

\begin{equation}
\label{eq:analysis:5}
E(X) := \sum\limits_{i \in I}(x_i p_i)
\end{equation}

In our case, $x_1$ is $k$, as it describes the number of patterns, and $p_i$ equals $P(n,k)$ as the probability of drawing $k$ patterns, i.\,e., the expected value is

\begin{equation}
\label{eq:analysis:6}
E(n) := 1 + \sum\limits_{k=1}^{N-1} (P(n,k)*k)
\end{equation}

We are adding 1 to the result, as the original pattern will always be present.
Equation~\ref{eq:analysis:6} will only calculate the expected value for patterns of a specific length. However, as the adversary does not know the length of the pattern with certainty in the 1BD scenario, we have to consider patterns of any length. For that, we have to use a modified variant of Eq.~\ref{eq:analysis:3}:

\begin{equation}
\label{eq:analysis:7}
q(n, k, M) := \frac{{|Q|-(n-1)*k \choose (M-1)*(N-1)-(n-1)*k}}{{|Q| \choose (M-1)*(N-1)}}
\end{equation}

In Eq.~\ref{eq:analysis:7}, $n$ is the length of the random pattern, while $M$ is the length of the original pattern. Accordingly, we  modify Eq.~\ref{eq:analysis:4} and Eq.~\ref{eq:analysis:6}:

\begin{equation}
\label{eq:analysis:8}
P(n, k, M) := p(n,k)*q(n,k,M)
\end{equation}

\begin{equation}
\label{eq:analysis:9}
E(M) := 1 + \sum\limits_{n=1}^M\sum\limits_{k=1}^{N-1} (P(n,k,M)*k)
\end{equation}

Finally, to determine the expected mean value of the number of detected patterns given a specific block size $N$, we calculate

\begin{equation}
\label{eq:analysis:10}
F(N) = \frac{1}{|P|}*\sum\limits_{M=1}^{L}(E(M)*|P_M|)
\end{equation}

where $L$ is the length of the longest pattern, and $|P_M|$ the number of patterns having length $M$.

\subsection{Analytical Result}
\label{sec:analyticalresult}

\begin{table}[t]
\centering
\caption{Expected avg. number of detected patterns $F(N)$ for varying block sizes $N$}
\
\begin{tabular*}{0.4\textwidth}{@{\extracolsep{\fill}}rrrr}
\toprule
$N$ & $10$ & $50$ & $100$ \\
\midrule
$F(N)$ & $1.35$ & $2.93$ & $4.83$\\
\bottomrule
\end{tabular*}
\label{tab:analysis:1}
\end{table}

The results (cf. Table~\ref{tab:analysis:1}) indicate that an adversary will, on average, detect only very few random patterns. As expected, the privacy expectation for singular queries ($\frac{1}{N}$) does not apply to the web surfing scenario.

Note that for reasons of conciseness we have provided a slightly simplified model, which disregards overlaps between patterns. Actually, the adversary must expect to find a slightly \emph{higher} number of patterns, because a domain name that is contained within multiple patterns only has to be drawn once to be detected as part of all patterns.
Nevertheless, the analysis is instructive and provides us with a baseline for the empirical evaluations that we will describe in the following.

\section{Evaluation}
\label{sec:evaluation}

In order to evaluate the effectiveness of the semantic intersection attack in a realistic scenario, we developed a simulator that enables us to efficiently test different attack strategies and various assumptions about the knowledge of the adversary. In the following we present results for the 1BD scenario.

\paragraph{Methodology}

Given a dataset the simulator will generate range queries for all the patterns from the dataset and perform the semantic intersection attack.
We are interested in the influence of two factors on the effectiveness of the attack, namely the \emph{block size} $N$, and the \emph{size of the dummy database} $|Q|$ that contains the dummy names. If the range query scheme was to be used in practice, these two factors could be easily influenced by the user. Thus, it is worthwhile to analyze their effect on the attainable privacy.

In the following, we will use the metric of \textbf{$k$-identifiability}, which is derived from the well-known metric $k$-anonymity \cite{Sweene02-kanonymity}: A set of consecutively observed range queries is said to be $k$-identifiable, if the adversary finds \emph{exactly} $k$ matching patterns of websites in his pattern database. For conciseness we will show the cumulative distribution of the fraction of $k$-identifiable patterns, i.\,e., the fraction of patterns that are $k$-identifiable or less than $k$-identifiable.

\subsection{Results of Experiment 1: Variation of Block Size}
\label{sec:evaluation:ex1}

For the purpose of this analysis, we consider three different  block sizes: $N=10$, $N=50$, and $N=100$. \cite{FederrathFHP11-dnsmixes} has shown that the median latency exceeds 1200\,ms for a block size of $N=100$, rendering higher values impractical for practical use.

Based on the result of Sect. \ref{sec:analysis}, we expect to receive some, but not many ambiguous results, i.\,e., instances where the whole pattern of a different website appears in a set of consecutively observed range queries by chance. Intuitively, the larger the block size, the more random patterns will occur. Accordingly, we expect the effectiveness of the attack to degrade with increasing block sizes.

\afterpage{%
\clearpage\clearpage

\begin{table}[t]
\centering
\caption{Results for varying block sizes $N$ given the whole dummy database}
\begin{tabular*}{0.9\textwidth}{@{\extracolsep{\fill}}rrrrrr}
\toprule
$N$ & $S$ & 1-identifiable & $\leq 5$-identifiable & median(k) & max(k) \\
\midrule
$10$ & $216{,}925$ & $62\,\%$ & $99\,\%$ & $1$ & $6$ \\
$50$ & $216{,}925$ & $8\,\%$ & $88\,\%$ & $3$ & $14$ \\
$100$ & $216{,}925$ & $1\,\%$ & $43\,\%$ & $6$ & $18$ \\
\bottomrule
\end{tabular*}
\label{tab:evaluation:ex1:1}
\end{table}

\begin{figure}[h]
\centering

\includegraphics{pictures/M2-VarN}
\caption{Distribution of $k$-identifiability for varying block sizes $N$ (whole database)}
\label{fig:evaluation:ex1:1}
\end{figure}
}

As can be seen in Table~\ref{tab:evaluation:ex1:1} and Fig.~\ref{fig:evaluation:ex1:1}, the smallest block size provides little privacy, with $62\,\%$ of patterns being 1-identifiable. Consequently, the median of the observed $k$-identifiability values is $1$. $99\,\%$ of patterns are 5-identifiable or better. No pattern is more than 6-identifiable.
For a larger block size of $N=50$, only $8\,\%$ of patterns are 1-identifiable, but the cumulative distribution quickly approaches $100\,\%$. All patterns are 14-identifiable or less, and the median of all observed $k$-identifiability values is $3$, i.\,e., for $50\,\%$ of the websites the adversary can narrow down the actually desired site to a set of 3 or less sites, which is far smaller than the baseline probability of $\frac{1}{50}$ for finding the desired domain name in the first block.
As expected, $N=100$ is most effective: $0.8\,\%$ of patterns are 1-identifiable, but still $43\,\%$ of patterns are at most 5-identifiable.

Generally, we can observe diminishing returns when the block size is increased. While the increase from $N=10$ to 50 leads to $54\,\%$ less 1-identifiable patterns, adding another 50 queries per block only decreases the fraction by $7.2$ percentage points. The same is true for the maximum $k$-identifiability, which increases by eight and four, respectively.
On overall, the results indicate that range queries provide far less privacy than suggested by Zhao et al. in the web surfing scenario.

\paragraph{1BD-improved}

We also considered an improved attack algorithm that guesses the length of the desired patterns based on the total number of observed queries in the second block, resulting in a range of possible pattern lengths. This allows the adversary to reject all patterns that do not fall into this range. As a result $80\,\%$ ($N=100$) and $94\,\%$ ($N=10$) of all patterns are 1-identifiable. Due to space constraints, we are unable to adequately cover the calculations to estimate the length in this paper, but we have released an implementation including the relevant documentation in the source code repository (see \Cref{fnote:github}).

\subsection{Results of Experiment 2: Variation of Dummy Database}

\afterpage{%
\clearpage\clearpage

\begin{table}[t]
\centering
\caption{Results for varying dummy database sizes $S$ given the block size $N=50$}
\begin{tabular*}{0.9\textwidth}{@{\extracolsep{\fill}}rrrrrr}
\toprule
$N$ & $S$ & 1-identifiable & $\leq 5$-identifiable & median(k) & max(k) \\
\midrule
$50$ & $2{,}000$ & $19\,\%$ & $92\,\%$ & $3$ & $14$ \\
$50$ & $20{,}000$ & $16\,\%$ & $95\,\%$ & $3$ & $11$ \\
$50$ & $200{,}000$ & $9\,\%$ & $88\,\%$ & $3$ & $13$ \\
\bottomrule
\end{tabular*}
\label{tab:evaluation:ex2:1}
\end{table}

\begin{figure}[h]
\centering

\includegraphics{pictures/M2-VarS}
\caption{Distribution of $k$-identifiability for varying dummy database sizes $S$; $N=50$}
\label{fig:evaluation:ex2:1}
\end{figure}
}

Generating and maintaining a dummy database is a non-trivial task for the client, which gets harder the larger the database is supposed to be. Accordingly, the importance of the size of the dummy database is of interest.
We assume that the client's dummy database is always a subset of the pattern database of the adversary, because, in general, the adversary will have access to more resources than the client, and collecting patterns scales very well.

We compare the effectiveness of three different database sizes ($S=2000$, $20{,}000$ and $200{,}000$). The domain names are chosen by drawing patterns from the full pattern database (without replacement) and adding all domain names of each pattern to the dummy database. This process continues until exactly $S$ unique domain names have been found. We select full patterns to increase the chance that the client randomly chooses a full pattern when drawing dummies. We used a fixed block size of $N=50$ for this experiment.

Fig.~\ref{fig:evaluation:ex2:1} shows that the differences are quite small on overall. Thus, the biggest effect of varying the database is the change in the percentage of 1-identifiable patterns: The percentage of 1-identifiable patterns drops by three percentage points when the dummy database size is increased from $S=2000$ to $S=20{,}000$, and by another 7 points on the second increase to $S=200{,}000$.
The observed changes have a much smaller effect than the variation of the block size; however, regardless of these results, a larger database is always desirable to prevent other attacks, such as the enumeration of the client's database.

\subsection{Effect of Pattern Length on Site Identifiability}
Now that we know the effect of varying the block size, the composition of the different $k$-identifiabilities is of interest. With this information, we can determine \textbf{whether websites with longer or shorter patterns are more at risk} to be identified. Intuitively, shorter patterns should generally have lower $k$-identifiabilities, as comparatively few dummies are drawn to obfuscate them, decreasing the chance of drawing a whole pattern. Conversely, longer patterns should generally achieve higher $k$-identifiabilities, as they use a higher number of dummy domain names.
We will now test this hypothesis by analyzing the composition of the different $k$-identifiabilities, using the results of our simulation with a block size of $N=50$ and the full dummy database ($S=216{,}925$).

\begin{table}[t]
\centering
\caption{Number of patterns $n_k$, mean length $\overline{|p|}$ and standard deviation $\mathrm{SD}$ aggregated by resulting $k$-identifiability ($N=50$, $S=216{,}925$)}
\label{tab:evaluation:reasons:1}
\begin{tabular*}{1\textwidth}{@{\extracolsep{\fill}}rrrrrrrrrrr}
\toprule
$k$ & $1$ & $2$ & $3$ & $4$ & $5$ & $6$ & $7$ & $8$ & $9$ & $\geq10$ \\
\midrule
$n_k$ & $7{,}693$ & $18{,}790$ & $23{,}184$ & $19{,}784$ & $12{,}497$ & $6{,}532$ & $2{,}875$ & $1{,}077$ & $336$ & $121$  \\
$\overline{|p|}$ & $10.59$ & $11.43$ & $12.52$ & $13.54$ & $14.43$ & $15.45$ & $16.22$ & $17.65$ & $17.09$ & $19.47$ \\
$\mathrm{SD}$ & $12.16$ & $13.24$ & $13.65$ & $14.55$ & $15.02$ & $16.14$ & $16.65$ & $17.71$ & $15.35$ & $19.68$ \\
\bottomrule
\end{tabular*}

\end{table}

As can be seen in Table~\ref{tab:evaluation:reasons:1}, the mean pattern length rises almost linearly with increasing $k$-identifiability, which supports our hypothesis.
The standard deviation exhibits a similar behavior, albeit with a slightly lower and less uniform growth rate. We could reproduce this result for other block and database sizes. The correlation is more distinct for larger block sizes. Smaller block sizes do not show this behavior as clearly, as the range of $k$-identifiabilities is too small to show any distinct trend.

\subsection{Results of Experiment 3: ABD Scenario}
\label{sec:evaluation:ex3}
So far, we concentrated on the 1BD scenario (cf. Sect.~\ref{sec:attack}). We will now consider the ABD scenario by repeating the experiment from Sect.~\ref{sec:evaluation:ex1}, simulating an adversary that can distinguish individual blocks:
In the ABD scenario the adversary is able to 1-identify between $87\,\%$ ($N=100$) and $97\,\%$ ($N=10$) of all domain names, vastly improving on the results of 1BD ($1\,\%$ and $62\,\%$, respectively).

The increased accuracy is due to two effects: Firstly, in the ABD scenario the adversary can derive $|p|$, the length of the obfuscated pattern, and filter the set of candidate patterns accordingly (cf. Sect.~\ref{sec:attack}). Secondly, the probability that another matching pattern is drawn from the dummy database by chance is much smaller when it has to meet the three ABD conditions

The contribution of these two effects to the overall effectiveness obtained for ABD can be analyzed by reviewing the results obtained for the baseline (1BD) in comparison to 1BD-improved (cf. Sect.\ref{sec:evaluation:ex1}) and ABD: The results for 1BD-improved, which filters candidate patterns using a vague estimation of $|p|$,  already show a significant increase: For $N=50$ the fraction of 1-identifiable sites is $83\,\%$ for 1BD-improved, while it is only $8\,\%$ for 1BD. On the other hand, the fraction of 1-identifiable websites obtained for ABD, where matching patterns have to meet the additional conditions and the exact value of $|p|$ is known, rises only by another 6 percentage points (reaching $89\,\%$) compared to 1BD-improved.

While this sort of analysis can not conclusively prove that the effect of filtering by length is larger than the effect of filtering via the ABD conditions, we note that the additional benefit of these conditions is comparatively small when the adversary can estimate the length of the obfuscated pattern.

This result indicates that range query schemes that are supposed to provide privacy in a web surfing scenario have to be devised and implemented in a way that the adversary cannot infer the length of the obfuscated query pattern.

\section{Countermeasures}
\label{sec:countermeasures}

Having shown the weaknesses of the range query scheme against a pattern-based attack strategy, we will now discuss possible countermeasures. First, we will discuss and evaluate a pattern-based dummy selection strategy. Afterwards, we will consider other strategies that could be used to hinder the adversary.

\subsection{Pattern-Based Dummy Selection Strategy}
\label{sec:countermeasures:improved-dummy}

In the original dummy selection strategy, the client sampled the dummies independently and randomly from his dummy database. In contrast, the client will now draw \emph{whole patterns} from his database. When querying the resolver for a desired pattern, the client will draw $N-1$ random patterns of the same length and use them as dummies. If not enough patterns of the correct length are available, the client will combine two shorter patterns to obtain a concatenated pattern with the correct length. Intuitively, this approach ensures that the adversary will always detect $N$ patterns. The results of our evaluation, shown in Table~\ref{tab:countermeasures:improved-dummy:1}, confirm this conjecture. All patterns are exactly $N$-identifiable.

\begin{table}[t]
\centering
\caption{Statistics for varying block sizes $N$ using the pattern-based dummy construction strategy}
\begin{tabular*}{0.9\textwidth}{@{\extracolsep{\fill}}rrrrrr}
\toprule
$N$ & $S$ & 1-identifiable & $\leq 5$-identifiable & median(k) & max(k) \\
\midrule
$10$ & $216{,}925$ & $0\,\%$ & $0\,\%$ & $10$ & $10$ \\
$50$ & $216{,}925$ & $0\,\%$ & $0\,\%$ & $50$ & $50$ \\
$100$ & $216{,}925$ & $0\,\%$ & $0\,\%$ & $100$ & $100$ \\
\bottomrule
\end{tabular*}
\label{tab:countermeasures:improved-dummy:1}
\end{table}

However, in real-world usage scenarios, the length of the pattern the client is about to query cannot be known in advance. As the dummies for the first element of the pattern have to be chosen before the query can be sent, the client has no way to be sure of the pattern length of the desired website, as these values may change over time when a website changes. This leads to uncertainty about the correct length of the dummy patterns. A wrong choice of pattern length may be used by the adversary to identify the original pattern.
Future research could study more sophisticated dummy selection strategies, drawing from experience gained in the field of obfuscated web search \cite{BalsaTD12}.

\subsection{Other Countermeasures}

As described in the previous section the pattern-based dummy selection strategy is subject to practical limitations. We will briefly cover other countermeasures that may be used to improve the privacy of clients. This list is not exhaustive.

The first option is to use a variable value for $N$ that changes on each block. This will raise the difficulty of determining the length of the original pattern, as long as the adversary cannot distinguish individual blocks. This change would render 1BD-improved useless, as it depends on a fixed number of chosen dummies per block (although similar optimizations could be found that would still improve on the performance of the trivial algorithm). However, this would not impact the performance of the ABD algorithm, as it does not rely on uniform block sizes

Another improvement that may make the pattern-based strategy more feasible would be to round up the length of the target pattern to the next multiple of a number $x > 1$. The additional queries (``padding'') could be chosen randomly, or by choosing patterns of the correct length.

Finally, other privacy-enhancing techniques, such as mixes and onion routing \cite{chaum81-mix,dingledine04tor}, can be employed to counter monitoring and tracking efforts. However, these general-purpose solutions are not specifically designed for privacy-preserving DNS resolution and may introduce significant delays into the resolution process.

\section{Discussion}
\label{sec:discussion}

We designed our experimental setup to stick as closely as possible to reality. However, for reasons of conciseness and clarity we have neglected some effects. In the following we will discuss whether they affect the validity of our conclusions.

Firstly, the results are implicitly biased due to a closed-world assumption, i.\,e., our results have been obtained on a dataset of limited size. However, as the Toplist of Alexa contains a large variety of websites we are confident that the results are valid for a large fraction of sites in general. Moreover, we have only evaluated the effectiveness of the attack for the \emph{home pages}; the evaluation of the attack on individual sub-pages is left for future work.

Secondly, while we considered the effects of caching of dummy queries in the 1BD scenario, we disregarded caching of the desired queries: The client may still have (parts of) a pattern in his local cache, resulting in incomplete patterns being sent to the resolver. However, the adversary may adapt to caching by remembering the TTL of all responses he sent to a client and matching the patterns against the union of the received domain names and the cached entries.

Moreover, an adversary who wants to determine all websites a user visits needs the patterns of all websites on the Internet. Such a database would be non-trivial to generate and maintain. However, a \emph{reactive} adversary may visit any domain name he receives a query for and store the pattern for that domain name in its pattern database, making a slightly delayed identification possible

Finally, we disregarded changing patterns as well as DNS prefetching techniques, which cause longer and more volatile patterns. However, a determined adversary will have no problems in addressing these issues.

\section{Conclusion}
\label{sec:conclusion}

We demonstrated that random set range queries offer considerably less protection than expected in the use case of web surfing. Our attack exploits characteristic query patterns, which lead to greatly reduced query privacy compared to the estimations made by Zhao et al. in their original work. Moreover, we proposed and evaluated an improved range query scheme using query patterns to disguise the original pattern.
We encourage researchers to consider the effects of semantic interdependencies between queries when designing new schemes for query privacy, as the rising pervasiveness of social networking buttons, advertising and analytics makes singular queries less and less common for web surfing.

\medskip

redpajama_set_name: RedPajamaArXiv


Home / TOEFL Learning Videos / TOEFL Articles / Giavanni improves his TOEFL score after a few months of online study.
Having difficulty in areas such as speaking and writing, Giovanni completed both integrated and independent skill-building tasks. Due to this, Giovanni was immensely helped with his speaking fluidity, pronunciation, and writing comprehension. On account of this, after countless exercises and feedback provided by iBT speaking and writing specialists through the Voxopop Discussion Group and Michaels Online TOEFL course, Giovanni developed good speaking and writing skills. This allowed for Giovanni to score 21 out of 30 on both of the speaking and writing sections of the actual TOEFL exam.
Having trouble with his reading comprehension in English as well, Giovanni over twenty lessons and seventy speed reading tests to strengthen his reading intelligence in academic English. These lessons and tests were designed to help students like Giovanni improve his reading speed from 100 to 350 words per minute and his overall reading proficiencies. As a result, after regularly completing lessons and words per minute assignments, Giovanni eventually learned to be more of a proficient reader with ability to concentrate well and maintain a steady reading speed. This allowed for Giovanni to score 23 out of 30 on the reading section of the actual TOEFL exam.
Giovanni originally had trouble with his English comprehension skills, though subsequently Giovanni learned to buildeffective speaking, writing, and reading habits. With this in mind, it can be understood why Giovanni attained the score he did during his examination. Through Michael's course and guidance, Giovanni's skills were challenged too improved. Respectively, Giovanni ended up scoring 85 with reading-23, listening-20, speaking-21, and writing-21.Thanks to Michael's TOEFL course, Giovanni attained his score in as little over three months. With numerous reviews like Giovanni's, have you been looking for a comprehensive course to meet your goal? Then consider joining renowned Michael's 7 Step System to achieve your TOEFL expectations!


text:
Joshua vs Povetkin Fight Live Stream FREE
in Boxing September 22, 2018
Welcome To Watch Anthony Joshua vs Alexander Povetkin Fight Live WBA Super, IBF, WBO and IBO heavyweight champion Anthony Joshua's next fight won't be against WBC champion Deontay Wilder after negotiations reached an impasse. Instead, Joshua will defend his titles next against Alexander Povetkin on Sept. 22 in front of what is expected to be a full house at Wembley Stadium in London. So keep watching and enjoy your time…
Joshua vs Povetkin Live Fight
Anthony Joshua vs Alexander Povetkin Live
Titels:IBF IBO WBA WBO Heavyweight Title{Scheduled 12RDS}
Date:on Saturday, September 22, 2018,
Vanu:Wembley Stadium (London).
Time:9pm ET,
Anthony Joshua vs Alexander Povetkin, Live Stream Game:(Pro Boxing)
Search Results Live Stream Game: ( Boxing Streaming)
Anthony Joshua vs Alexander Povetkin in another huge world-heavyweight clash, and it's nearly upon us. The Russian is the mandatory challenger to Joshua's WBA title and the Briton will also be defending his WBA Super, IBF, WBO and IBO belts when the two fighters meet in London..oshua (21-0, 20 KOs) and WBC champion Deontay Wilder had been in serious negotiations for a late-fall bout. Unfortunately, the two sides were unable to come to an agreement after going back-and-forth for a number of months. In the midst of negotiations, the WBA ordered Joshua to face Povetkin or be stripped of his belt. Talks with Wilder came to an end and a Povetkin bout materialized shortly thereafter.MORE: Join DAZN and watch the Joshua-Povetkin fight for free
The Povetkin fight will be the second time Joshua's competed in 2018. He gained the WBO title in a unanimous decision victory over Joseph Parker in April. The fight marked the first time in Joshua's professional career that he went the distance.
Povetkin (34-1, 24 KOs) won the WBA title from Cedric Boswell in Dec. 2011. The 2004 Olympic gold medalist went on to make four title defenses before losing to Wladimir Klitschko by unanimous decision in Oct. 2013.
Things haven't gone smoothly for Povetkin to get to this point. He failed two drug tests in 2016 and 2017, which took him out of scheduled title fights against Deontay Wilder and Bermane Stiverne, respectively. Since then, he has gotten his career back on track and won four consecutive bouts.
Do people want to see Joshua vs. Wilder? Absolutely. But a showdown between Joshua and Povetkin is the next best thing. You have two of the best heavyweights in the world — who happen to both be Olympic gold medalists — battling for the heavyweight championship of the world. It doesn't get any better than that Anthony Joshua and Alexander Povetkin will meet on Saturday, Sept. 22 at Wembley Stadium in London.Subscribe Now
Joshua vs Povetkin Fight Live Stream FREE	2018-09-22
Previous: @NFL^LIVE GAME!New York Giants vs Dallas Cowboys Stream NFL Football 2018@@Live 4K Now >ESPN LIVE> #Live #Stream
Next: Cowboys vs Seahawks NFL Football Live Streaming FREE TV Channel

redpajama_set_name: RedPajamaCommonCrawl


Billy Longley grew up hard in Melbourne during the depression years, was a streetfighter and knockabout kind of bloke who drifted into work on the waterfront, as a member firstly of the WWF and after a stint in Pentridge, the Federated Ship Painters & Dockers Union. Here he was caught up in the leadership wars of the 1970's, when many blokes were murdered, and so it was that Billy Longley ended up serving 13 years in Pentridge for a murder he may not have committed. Rochelle Jackson shows Longley the respect of letting him tell much of the story , and it's a great read.
But reading it also reminded me of a very similar story, published in WA in 1979 - the incredible story of George Stewart , published in the book - The Leveller: The Story of a Violent Australian. Just like Billy Longley, George Stewart grew up in tough times. As a kid with undiagnosed dyslexia in a Christian Brothers school, he suffered constant ridicule as a result, and so George ended up letting his fists do the talking. He was a talented boxer who fought both in the ring and bare-knuckles in the street, for a stake. He was barely out of his teens when he was working security and standover for card games in the various gold diggings around in the bush. He too, ended up drifting down to the waterfront, where he worked on merchant ships around Australia, and where his capacities as a fighter were recognised and put to use (in this case by the Maritime Union - mainly protecting union leaders from attacks by the police and rivals).
Now, he wrote this at a time when all of the 'players' involved in Shirley's murder were still very much in play. And word somehow got around that he had written it. One day, George was drinking in the Great Western pub in Northbridge (now known as the Brass Monkey) when he was invited for a drink by a certain person who was also quite close to Shirley Finn. Apparently, George refused the offer of a drink from this person, believing that this person was not a true friend of Shirley's, to put it mildly, and a confrontation ensued. As the story was told to me, by someone very close to George, the subject of his manuscript came up during this confrontation.
Now, it is important to remember that George Stewart was one of the toughest men around, even at that age. If even half of the stories in The Leveller are true - this is borne out by his exploits. He was no shrinking violet, and was not one to take a backward step. He also had a penchant for firearms. But having been threatened by this 'friend' of Shirley Finn, a man who was not a member of the WA Police service, a man not known in any way for his physical toughness, whatever was said to him resulted in George Stewart retreating to his home in the South-Eastern foothills. Here he apparently set up an 'early warning' system of cans attached to fishing line around the perimeter of his fenceline, and sat up all night in his kitchen with a loaded .303 rifle in his lap, bayonet attached.
It is a telling image, and explains a lot about the fear that certain persons involved in the Shirley Finn murder engender in others. Alas, George Stewart passed away a few years ago, and his manuscript it would seem has gone missing.
The Leveller: The Story of a Violent Australian, Perth, Australia: Creative Research, 1979. 243pages. "This is the story of a lonely hurt child, teenage standover man, hard rock miner, gambler, professional boxer, street fighter, seaman, showman, socialist, diver and salvage operator. Above all it is a story about violence told by a sensitive intelligent human being who was rejected by the system, and fought back." From the dustjacket.


I first attended a drop-in session in my home town of Hailsham in 2013 (I think). My support worker suggested that I tried it to help me through the depression that I was experiencing at the time. I had been diagnosed with Rheumatoid Arthritis in 2010 and had to give up work in 2012. I always wanted to pursue a creative path when I left school, many moons ago, so it was perfect for me.
I am a digital artist, I produce images that are referred to as Photo Art, Fine Art Grunge or Photo artistry, depending who you talk to. The type of image that I produce depends on what it is I'm producing. When I produce commercial artwork, often having to work to a brief, my workflow is very linear. I will start with a blank canvas in Photoshop, usually the size required by the client. I will then add the elements of the image in layers, sometimes I will use a digital product mock up to apply the artwork to. At various stages I then send the draft image to the client for approval or changes and then complete the project, which gets printed or used online. However, when I'm creating digital art for myself, I often start with a stock image or one of my own photographs and then add elements in layers to the base image. I can add texture, overlays, lighting effects, objects and produce an entirely different image. The artwork evolves over a period of time and I will sometimes leave it for a few days and then work on it again, taking it in a new direction. My work has many influences and I tend to produce several images on a theme. I will research the theme quite extensively and produce image boards to draw on the influences. When I first started out my image were often dark and depressing or extremely detailed, some of my drawings are photorealistic. I have always been good at copy drawing and I am able to do it on my PC with the aid of a graphics tablet and stylus. I also use other software within the Adobe Creative Cloud, their mobile apps are great when I'm out and about. I'm able to capture colour schemes, patterns and shapes that inspire me or that I would like to use in a project. Recently I have been experimenting with 3D elements in my work, such as poseable figures or complex objects.
It's the first time that I've really produced artwork to sell as limited editions. I'm also looking forward to seeing how the extra dynamic of other artists work next to mine will work and how it will reflect in traffic to the site and how it is received. It's a big deal to be picked to be part of this pilot project. I am so glad that Creative Future has so much confidence in my work, something that most artists struggle with from time to time.
Creative Future have been instrumental in my road to recovery and broadening my practise. They have enabled me to gain employment from my art and I want to be able to give something back, which the shop will do.
It brings affirmation of my practise.
I have often said that I don't know where I would be had it not been for my support worker encouraging me to contact Creative Future. They have not only allowed me to practise my art but restored my sense of worth, given me new skills and direction and improved my well being.


text:
Archigram Weekend
14 Oct 2006 – 15 Oct 2006
Plug-In City, Instant City, Suitaloon, Living Pod... these were just some of Archigram's projects, known as Britain's most radical architecture group, whose continued influence on architects and artists was rewarded by the Royal Gold Medal for Architecture in 2002.
To celebrate the launch of the Archigram Archival Research Programme at the University of Westminster, a series of Archigram events are taking place at the ICA, which hosted Living City, their first major exhibition, in 1963.
There are spaces for 40 students on the Archigram and Urban Philosophy day.
The London Centre for Arts & Cultural Enterprise are pleased to sponsor Archigram Weekend
Archigram and Urban Philosophy
Planning a "distributed university" in St James's Park, an event for 40 students.
Archigram Sunday
Immerse yourself in the world of Archigram at the ICA - drop in for a couple of hours or stay all day!
Archigram Films and Archive
A rolling programme of a wide selection of Archigram films and images from the new archive will be on view all afternoon.


We are pleased to announce that the Philadelphia ARCHIBUS Users' Group is planning a meeting on Wednesday, February 20th, 2019.
All ARCHIBUS users are invited to join the Philadelphia ARCHIBUS Users' Group Meeting! You can now meet in person (with virtual/remote participation option) to compare best practices and successful implementation experiences, as well as to learn about ARCHIBUS' latest capabilities!
Scan to BIM – Leveraging high definition laser scanning point cloud data for asset inventory to create dynamic and intelligent BIM model. This topic will also include an overview of Revit/ARCHIBUS integration.


Chris has been building businesses, creating new markets, and leading organizations for more than twenty years. Prior to joining DRN, Chris was a Senior Vice President at LexisNexis, leading a $100 million business in the data and analytics market. While there, he created and executed the strategy for new lines of business in the identity, fraud, and revenue recovery market. Before that, Chris served as President and CEO of MetaPartners LLC, where he built an $80 million B2B mobility ecosystem for Westcon Group by leveraging software applications to drive wireless and mobile infrastructures. Chris also was one of the founders of Con Edison Communications, a Metro Optical Communications company where he was responsible for all sales and marketing efforts, real estate acquisition and their investment strategy.
At Con Edison communications, Chris drove first-year revenues to $48 million, acquired real estate access rights to 350 prime New York properties and engaged investment bankers to invest in three telecommunications companies. Chris serves on the boards of Jungle Torch, a search engine optimization company and Mail Security, a mail automation and security company. A lifelong resident of New York, he graduated from New York University Leonard N. Stern School of Business.
What's your #1 business priority for 2015-2016?
To help lenders utilize DRNs Data Insights to reduce risk by collecting more, and connecting with customers and recovering assets.
Shift your management approach from an expense and budget orientation to a return and results orientation. Use data and technology to drive these outcomes.
In the computer/ technology industry; in sales.
Your favorite book or movie?
Make sure you invest in those things that enrich you as a person.


text:
Friday 23 Sep 2011 @ 10:36
WiredGov Newswire (news from other organisations)
URGENT ACTION NEEDED TO MEET CREATIVE INDUSTRIES' SKILLS DEMAND – CBI
The UK creative industries sector has huge growth potential and will be a key driver of economic recovery, but risks being held back by a lack of relevant skills, the CBI said yesterday (Thursday).
A new report from the UK's leading business group says that the creative industries sector is expected to employ 1.3 million people by 2013, potentially making it larger than financial services. But, the CBI warns that in order for the sector to meet its potential, urgent action is needed to train people to the required skills levels.
Susan Anderson, CBI Director for Education & Skills, said:
"Our creative industries have huge growth potential, but the lack of trained people with relevant skills to meet the sector's specialist demands is holding it back.
"First and foremost we must ensure that all young people leave school with a strong grasp of the basics. Solid maths and science ability is particularly vital.
"These companies also expect a more detailed knowledge of IT and benefit from people with broader creative skills, so the Government must adapt the curriculum to meet these needs."
The CBI's recommendations for improving skills at school and college include the Department for Education (DfE):
Ensuring that all young people continue studying maths post-16 at a level appropriate to them
Introducing an automatic opt-in to triple science GCSE for the most able pupils
Supporting the introduction of higher level computer programming and software development courses
Including a creative or technical subject within the specification of the English Baccalaureate such as design and technology, computer studies, music, art and design or drama
Along with employers jointly promoting best practice on business-school collaboration – for example with increased support for the work of Education and Employers Taskforce.
Ms Anderson added:
"As well as getting the basics right at a school level, we want to see greater collaboration between universities and companies so that courses keep up-to-date with the realities and needs of today's creative industries market.
"It's also crucial that we continue to develop the skills of the current workforce. Apprenticeships are an important way of achieving this and the Government needs to press ahead with its plans to reduce bureaucracy and break down barriers to entry for smaller firms."
Additional CBI proposals to develop the talents of the UK workforce include:
The National Apprenticeship Service and Sector Skills Councils to provide clear support and guidance to smaller and medium sized companies (SMEs) on how to access the apprenticeship system
The Department for Business, Innovation and Skills to promote Apprenticeship Training Agencies (ATAs) and other collaborative apprenticeship models – including large firms willing to over train apprentices for firms in the sector
Skillset to continue promoting their internship guidance to spread best practice within the industry.
The CBI has published its recommendations ahead of the next meeting of Skillset's working group on skills, which is supporting the work of the Creative Industries Council. This was established through the Government's Growth Review to develop proposals for promoting the expansion of the sector.
A full copy of the CBI report on Skills for the creative industries is attached.
The CBI is the UK's leading business organisation, speaking for some 240,000 businesses that together employ around a third of the private sector workforce. With offices across the UK as well as representation in Brussels, Washington, Beijing and Delhi the CBI communicates the British business voice around the world.
CBI Press Office on 020 7395 8239 or out of hours pager on 07623 977 854. Follow the CBI on Twitter at: www.cbi.org.uk/twitter


The deadline set by al Qaeda in the Islamic Maghreb (AQIM) for the release of radical cleric Sheikh Abu Qatada from the British Long Lartin Prison is approaching.
On April 26th, the group issued a statement threatening to kill British hostage Edwyn Dyer if the British government did not free Sheikh Abu Qatada within twenty days.
"On expiration of the deadline, the mujahideen will execute the British hostage if their demand was not met." Several reminders of the time left till the expiration of the deadline were subsequently posted online.
Abu Qatada was first arrested in the U.K. in 2005 under immigration rules, as the government sought to deport him to Jordan. He was released on bail but was returned to prison following reports that he was attempting to flee Britain.
In March he issued a statement from the top security prison of Long Lartin in which he made a discrete appeal for the militants to save him.
"It has become imperative for Muslims to know of the orders of Prophet Mohammed, peace and prayers upon him, on the necessity to free the prisoners with all means, expedients and schemes in your power to achieve this great religious duty," wrote Abu Qatada.


text:
Het Beleg van Kiev vond plaats tussen 28 november en 6 december 1240. Het was de laatste slag van de Mongoolse invasie van Roes onder Batu Khan, daarna zetten de Mongolen hun opmars verder in Oost-Europa.

Achtergrond
Batu Khan kreeg de opdracht in 1235 van grootkan Ögedei om het westen te veroveren, daarvoor kreeg hij een leger van 130.000 man toegewezen. In 1237 veroverde hij Rjazan en in 1238, Vladimir en Kozelsk. In de winter van 1239 gebeurde hetzelfde met Tsjernihiv en Perejaslav, het volgende doel was Kiev. Toen Möngke, de neef van Batu, arriveerde aan de stad, was hij verbluft door de praal van Kiev. Hij stuurde twee afgezanten en stelde voor de stad te sparen. De gezanten werden vermoord en teruggestuurd, het vonnis was geveld.

Beleg
De stad werd verdedigd door een zekere voivode Dmytro, terwijl zijn vorst Daniel van Galicië hulp was gaan halen in Hongarije.

Op 28 november begonnen de Mongolen met het bombarderen van de stad. Op 6 december werden de muren van Kiev doorbroken en er volgde man-tot-mangevechten op straat. De inwoners van Kiev leden zware verliezen en Dmytro raakte gewond door een pijl. Toen de nacht viel, trokken de inwoners zich terug naar het centrum van de stad en velen verscholen zich in de kerk. De volgende dag, toen de Mongolen de laatste aanval begonnen, stortte het balkon van de kerk in onder het gewicht van de mensen die erop stonden, waardoor velen werden verpletterd. Nadat de Mongolen de strijd hadden gewonnen, plunderden ze Kiev. Het grootste deel van de bevolking werd afgeslacht. Van de 50 000 inwoners voor de invasie overleefden er ongeveer 2.000. Het grootste deel van de stad werd afgebrand en slechts zes van de veertig grote gebouwen bleven overeind. Dmytro kreeg genade voor zijn moed.

Bronnen
Alexander V. Maiorov, The Mongolian Capture of Kiev: The Two Dates,
Derek Davison, Today in European history: the Mongols sack Kyiv (1240),

Kiev 1240
Geschiedenis van Rusland
Geschiedenis van Kiev
Veldslag in Oekraïne
Mongoolse Rijk
1240-1249

redpajama_set_name: RedPajamaWikipedia


Dora The Explorer Is Becoming A Live Action Movie!
Dora The Explorer is heading to the big screen with a live action movie!
The film will be written by "Neighbors" director Nick Stoller and Michael Bay is set to produce.
Details are still being kept under wraps and no release date has been set.
The live-action take will center around a now teenage Dora, but were wondering how much action will Dora see with Michael Bay on board?


Harrisburg, PA — Governor Tom Wolf has followed through on his promise to cut red tape, improve infrastructure, and strengthen Pennsylvania's business climate. Today, he pledged to continue strengthening Pennsylvania's economy through smart investments that will positively impact future generations of Pennsylvanians.
"As a Pennsylvania businessman, I understand what companies need to thrive and have worked to tackle a variety of challenges faced by businesses in the commonwealth," said Gov. Wolf.
Gov. Wolf's key initiatives included enlisting multiple state agencies to collaborate on projects that brought together infrastructure projects and business development programs. The projects have resulted in stronger communities, a more adept workforce, and an improved business climate: "One of the governor's fundamental goals when he first entered office was to help create an environment in which our economy, our businesses, and our residents could thrive," DCED Secretary Dennis Davin said.
• Eliminated burdensome taxes on businesses like the Capital Stock and Franchise Tax.
• Will create an additional 15,000 jobs with the creation of a Shell Cracker Plant in Western Pennsylvania and investment in the Port of Philadelphia.
• Cut through red tape by establishing the new PA Business One-Stop Shop, which has assisted more than 86,000 entrepreneurs and business owners who have visited the website to learn how to start and grow a new business.
• Created the Dairy Investment Program, which made $5 million in grant funding available to help Pennsylvania dairy farmers overcome challenges and capitalize on new opportunities.
• Recapitalized the Business in Our Sites program to make $75 million available to create an inventory of shovel-ready sites to attract new business and jobs to Pennsylvania.
• Retooled the state's Solar Energy Program to include grant funding to help make Pennsylvania a leader in clean energy.
• Directed the Governor's Action Team to assist 270 business expansion or relocation projects across the commonwealth that are expected to create more than 30,000 jobs and generate nearly $11 billion in investment.
• Fostered the creation of more than 3,200 jobs from businesses located within a Keystone Innovation Zone, which provides funding to help early-stage technology companies and encourage entrepreneurship in and around Pennsylvania's colleges and universities.
• Created a new program to facilitate the construction of infrastructure necessary to bring low-cost energy to residents and manufacturers through a $24 million Pipeline Investment Program.
• Created the new Manufacturing PA initiative to support Pennsylvania manufacturing through career training and retraining programs, student engagement, and market adaptation assistance.
• Assisted nearly 3,000 companies in training more than 145,000 incumbent workers across the commonwealth to help employees develop new skills to thrive in their jobs.
• Created a new apprenticeship program funded in part through funds clawed back from businesses that have received state support in exchange for job creation but failed to meet the state requirements of the contract.
"At every turn since Governor Wolf took office in 2015, he has worked with me to direct PennDOT to break new ground in how we do our business," said PennDOT Secretary Leslie S. Richards.
• Created the Broadband Investment Incentive Program and the Office of Broadband Initiatives, which will provide more than 9,000 unserved rural Pennsylvanians with access to broadband by June 2022.
• Put out 1,162 bridge projects and 2,583 projects for roadway and other improvement projects worth approximately $9.92 billion since January 2015.
• Announced the multi-year Road Maintenance and Preservation (Road MaP)initiative to increase maintenance investments and invest in capital projects and interstate projects.
• Launched an innovative multimodal transportation plan to enhance travel and safety along the Interstate 76.
• Improved the condition of state-owned bridges. The number in poor condition has decreased from more than 6,000 in 2008 to 2,855 today.
• Replaced 558 poor condition bridges in four years through the Private Public Partnership Rapid Bridge Replacement program.
• Prioritized $181 million to accelerate repaving work on interstates and attack potholes across Pennsylvania through Resurface PA.
• Created new websites where people can see active and planned projects,conditions of state and local bridges, and updates on how PennDOT is improving Pennsylvanians' quality of life.
• Improved traveler information by making plow-location tracking and information on state roads were last plowed available at www.511PA.com, and developed 511PAConnect, a tool to provide updates to motorists in the event of long-term road closures.


text:
#ifndef _ARM_DL_TLSDESC_H
# define _ARM_DL_TLSDESC_H 1

/* Use this to access DT_TLSDESC_PLT and DT_TLSDESC_GOT.  */
#ifndef ADDRIDX
# define ADDRIDX(tag) (DT_NUM + DT_THISPROCNUM + DT_VERSIONTAGNUM \
		       + DT_EXTRANUM + DT_VALNUM + DT_ADDRTAGIDX (tag))
#endif

/* Type used to represent a TLS descriptor in the GOT.  */
struct tlsdesc
{
  union
    {
      void *pointer;
      long value;
    } argument;
  ptrdiff_t (*entry)(struct tlsdesc *);
};

typedef struct dl_tls_index
{
  unsigned long int ti_module;
  unsigned long int ti_offset;
} tls_index;

/* Type used as the argument in a TLS descriptor for a symbol that
   needs dynamic TLS offsets.  */
struct tlsdesc_dynamic_arg
{
  tls_index tlsinfo;
  size_t gen_count;
};

extern ptrdiff_t attribute_hidden
  _dl_tlsdesc_return(struct tlsdesc *),
  _dl_tlsdesc_undefweak(struct tlsdesc *),
  _dl_tlsdesc_resolve_hold(struct tlsdesc *),
  _dl_tlsdesc_lazy_resolver(struct tlsdesc *);

# ifdef SHARED
extern void *_dl_make_tlsdesc_dynamic (struct link_map *map, size_t ti_offset);

extern ptrdiff_t attribute_hidden
  _dl_tlsdesc_dynamic(struct tlsdesc *);
# endif

#endif

redpajama_set_name: RedPajamaGithub


text:
McCarthyizm - Pair O' Docs
2001, McCarthyizm
I recently had the opportunity to check out a local Buffalo band at a small private concert that a lot of my readers might enjoy. McCarthyizm has been together since the early 90's and has released four albums; the most recent, Pair O' Docs, in 2001. The band continues to play together in spite of not recording in almost a decade and plays regularly around Western New York. Lead vocalist and guitar player Joe McCarthy has strong rock voice that can transcend the boundaries of folk and even the occasional Irish drinking tune, and the band plays like one that has been together for the better part of two decades. When McCarthyizm started out major labels were still pretty much the only way to get your sound heard; if these guys were starting out today they'd be getting a lot of attention in the Indie Rock world.
Pair O' Docs opens with All Night, something of a party anthem featuring huge and tireless hooks. It's a fun listen and the perfect opening to the CD. The Great Escape and Into Forever are deeply philosophical, playing around the edges of religion, epistemology and finding personal meaning in life. The Great Escape is done in an Americana style with strong and pleasing harmonies, whereas Into Forever is catchy acoustic/electric rock in the same vein as Canadian cult favorites Dig Circus. Pair O' Docs is a raucous rocker that is great on the CD and even better in a live setting. Reveal My Sin has a lilting Pop quality wrapped into its acoustic Rock arrangement, and is all about finding ways to let go of your inner demons. Walk In The Woods is a straight forward classic rock tune with some righteous guitar work and AOR-friendly hooks. The album closes out with Mt. St. Michel; a special song. It's the story of a dream vacation to France for two lovers where ultimately the vacation and then the relationship fall apart on the basis of different expectations (he's looking to get away, she thinks he's going to propose). The story-telling in song here is amazing; it's the sort of song that other artists are going to want to cover.
McCarthyizm is a hidden gem hiding out here in Western New York. There are bands like this all over the world; playing below the radar in a local market to appreciative crowds but having the talent and charisma to play for much larger crowds. It can be a matter of breaks or timing, but at the time McCarthyizm was starting out independent bands just didn't make it much of anywhere. By the time the Indie world really opened up, perhaps McCarthyizm had just accepted the "fact" of being a regional band. Whatever the case, this is a band that deserves your attention. Pair O' Docs is a great 7-song introduction to McCarthyizm. Make sure you check out this diamond in the rough.
You can learn more about McCarthyizm at http://www.mccarthyizm.com/ or www.myspace.com/mccarthyizm. You can purchase a copy of Pair O' Docs from McCarthyizm's Web store.
Labels: Dig Circus, McCarthyizm


text:
Is This Save The Children Ad Too Sexy For The Cause?
By Marc Silver
Published May 8, 2014 at 4:03 PM EDT
The sexy male model makes bedroom eyes and says, "Malaria."
The sexy female model twirls her glossy hair in a flirtatious manner and says, "Diarrhea."
It's part of a 2 minute, 17 second public service spot called "The Most Important 'Sexy' Model Video Ever." And no, it's not a spoof.
Save the Children, the aid organization founded in 1919, wanted to come up with a public service spot to promote its cause. A staffer lamented, "Moms and kids dying is just not a sexy issue."
And from those words a sexy ad was born.
Josh Ruben and Vincent Peone, who have made videos for the website , came up with an idea. They hired models to be part of "a sexy new campaign," says Peone. "We kept it very vague."
The models were told to read cue cards:
What is sexy?
What are your deepest desires?
Lust is my mistress.
Then the director says, "Keep it sexy and really pour it on this time":
Almost 800 mothers and 18,000 young children die each day, mostly from preventable causes.
The models struggle to make statistics about maternal and child death and the names of diseases sound sexy. "This is not a sexy statement," one says. Another has to take a walk to collect himself.
After filming, the models were told they were part of a Save the Children video.
Watching the models squirm is a bit uncomfortable. "Feeling that discomfort at least for me was part of what made [the video] really work," says Save the Children CEO Carolyn Miles. "The purpose was to get people to look at things like the State of the World's Mothers report we released this week. If I just put that message out there, we know a lot of people will tune out."
Both Miles and Peone are happy with the ad, which was produced mainly with donated services (although the unsuspecting models were paid).
There are two big questions to ask.
Is this weird, or what?
And will it be effective?
Yes, it is weird. "Weird, almost obscene," says Mead Over, a senior fellow at the Center for Global Development. "But I think it likely to work with people who might otherwise immediately switch news feeds or type TLDR." (Confession, I had to look that up. It means "Too long; didn't read.")
As for the ad's effectiveness, it is too soon to tell. Brad Bushman, professor of communications and psychology at Ohio State University, doesn't think it will accomplish much. He ran a study that looked at how well 108 subjects remembered an ad shown during a television program with sexual content compared with 108 subjects who viewed the same ad during a "neutral" program.
Those who watched sexy programs showed poorer memory of the ad compared with the ones who watched nonsexy shows, Bushman reports — because they were distracted by the sex. "Sex doesn't sell," he says. "The more intense the [sexual content], the more it draws attention away from the products."
Indeed, some of the comments for the YouTube posting of the Save the Children ad talk about how hot the models are. But others talk about the issues of child and maternal health. The hope is that some of those folks will click on the "learn more" slug at the end and perhaps make a donation.
As for the possible controversy over the "sexy" angle, controversy is nothing new to Save the Children. The organization's founder, Eglantyne Jebb, was arrested in 1919 for posting pictures of starving children in London's Trafalgar Square. Putting up pictures was illegal at the time. In court, the judge said he'd pay her fine because he believed in what she was doing.
Dare I say it: Now that's pretty sexy!
Marc Silver
Marc Silver, who edits NPR's global health blog, has been a reporter and editor for the Baltimore Jewish Times, U.S. News & World Report and National Geographic. He is the author of Breast Cancer Husband: How to Help Your Wife (and Yourself) During Diagnosis, Treatment and Beyond and co-author, with his daughter, Maya Silver, of My Parent Has Cancer and It Really Sucks: Real-Life Advice From Real-Life Teens. The NPR story he co-wrote with Rebecca Davis and Viola Kosome -- 'No Sex For Fish' — won a Sigma Delta Chi award for online reporting from the Society of Professional Journalists.


text:
Brad Artley is an American-based rock drummer.

The Brian Jonestown Massacre

Brad Artley was a member and drummer for the neo-psychedelic rock band, The Brian Jonestown Massacre (abbreviated to 'The BJM'), in 1996-1997. Artley didn't play on any of the band's albums, but did perform on tours with them.

He appears in the acclaimed rock documentary DiG! by Ondi Timoner, chronicling The BJM and friends/rivals, alternative rock band, The Dandy Warhols' early careers over the course of seven years.

Artley could be recognised for his Brian Jones-style, blonde hair.

The Richmond Sluts

Artley was the drummer for the rock & roll band, The Richmond Sluts, signed to indie label, Disaster Records.

He played drums on the band's self-titled first album, The Richmond Sluts, but then left the band soon after.

Discography

with The Richmond Sluts

 The Richmond Sluts (2001) Disaster Records

References

American drummers
Living people
Year of birth missing (living people)
Place of birth missing (living people)


text:
HRW asks U.N. to put Israel on child rights violators list
The 50-day conflict in Gaza last year killed 539 children, injured 2,956, and most Palestinians are now struggling with trauma and life-long disabilities, according to the UN children's agency, UNICEF. (File photo: AP)
AFP, United Nations/United States Friday 05 June 2015
Human Rights Watch on Thursday urged U.N. Secretary-General Ban Ki-moon to add Israel to an annual "List of Shame" of children's rights violators, after more than 500 children were killed in the war in Gaza last year.
The U.S.-based rights group called on Ban to resist pressure from Israel and the United States to keep the Israeli Defense Forces off the list due to be released next week.
"Secretary-General Ban can strengthen child protection in war by compiling his list based on facts, not political pressure," said Philippe Bolopion, crisis advocacy director at Human Rights Watch.
Human Rights Watch is also calling for the Palestinian Islamist movement Hamas to be included as well as armed groups in Pakistan, Thailand and India for serious violations including attacks on schools and the recruitment of child soldiers.
The current list has 51 groups including Boko Haram and Islamic State as well as the armed forces from eight countries such as Syria, Yemen, the Democratic Republic of Congo and South Sudan.
The 50-day conflict in Gaza last year killed 539 children, injured 2,956, and most Palestinians are now struggling with trauma and life-long disabilities, according to the U.N. children's agency, UNICEF.
HRW demands 'credible' probe on Tunisia detainee death
HRW denounces Israel expulsion of bedouins, Palestinians
West Bank authorities silence student dissent: HRW
HRW: Yemen rebels committed 'possible war crimes'
U.S. defends cluster bomb transfers in Yemen


Visit Diego Valle-Jones' Interactive Drug War Map to see the numbers for yourself.
AS AN AMERICAN EXPAT, I'm no stranger to the horrors the global war on drugs is wreaking in Latin America. As a Californian in particular, my views on drug prohibition are inevitably framed by the violence plaguing my neighbours to the south. Although the Mexican cartel crisis gets occasional coverage here in the British media, the connection between drug prohibition and the spectacular violence practised by those who profit from it is typically ignored. A combination of geographic distance and an incurious media help cushion British citizens from the truth about what's happening in the Americas.
Although the Mexican government has done its best to fudge the numbers, it now appears that some 50,000 people (perhaps as high as 70,000) have died since Felipe Calderon launched a military assault against the powerful drug cartels. At least 10,000 more have simply gone missing, never to be seen or heard from again. Each day brings more grisly displays of tortured bodies dumped across highways, the steps of city halls, and family neighbourhoods. Corruption infests the highest reaches of the government, the military, and the courts. Despite the Calderon administration's furious military crackdown, whole regions of Mexico are now effectively under cartel control. The suffering of the Mexican people is nearly incomprehensible to outsiders. Far from the chaos and despair, Britain has largely escaped the soul searching and rethinking of drug policy that the US is slowly but surely undergoing.
WHY THE POLICY RETHINK? Because prohibition itself is responsible for sustaining the black market for drugs. "Consumer" countries like the US import billions of dollars worth of cannabis every year from "producer" countries in Central and South America, accounting for more than half of all cartel revenues. Common sense and even a cursory glance at history tell us that when a substance is prohibited, violent criminals will step in to fill the supply chain. While President Calderon and other Latin American leaders have called on consumer countries around the world—including the UK—to address their voracious appetite for drugs, many of them recognise that after forty years of increasingly heavy-handed global prohibition, demand simply isn't going anywhere. That's why countries like Uruguay, Colombia, and Guatemala—who bear the devastating brunt of the global drug war–are experimenting with decriminalisation and other alternatives to militarised prohibition. They're also putting pressure on the US, as the world's foremost consumer of drugs, to join them in a new approach.
This is an historic moment, as the countries most victimised by decades of failed drug policy stand up and say, "No more." Support for decriminalisation and the shifting of drug abuse from a law enforcement issue to one of public health is gaining since Portugal's progressive approach has proved an astounding success. With tens of thousands of people dying and disappearing each year in Latin America, we have a moral obligation to ensure our drugs policy does not contribute to mass human suffering.
Will alternative drug policies stamp out the Latin American cartels? No, not on their own. Cartels have exploded over the years we've wasted growing the black market. Like any good business, they have globalised and diversified. But the fact remains that their profits are still overwhelmingly derived from the global drugs trade. And Brits can no longer bury their heads in the sand beyond the Atlantic, because the cartels have now set up shop in Europe.
PROHIBITION has done nothing to curb demand for cannabis or other drugs, but it has made criminal gangs (who, as you might guess, don't pay much heed to legal prohibitions) obscenely wealthy. These gangs flourish in communities that lack the infrastructure to keep them in check, allowing them to victimise whole populations through violent repression. We see this on a much smaller scale in our disadvantaged neighbourhoods where criminals control the drugs trade. But while the scale differs, the core problem remains the same. Prohibiting the sale and cultivation of cannabis forces us to either purchase our medicine on the black market or risk everything to produce it ourselves. No one benefits from this state of affairs—except criminals.
When prohibitionists insist that we must reduce demand for drugs at all costs, they are simply tilting at ideological windmills. We must reduce the harm from drugs at all levels, and that requires us to remove criminals from the drugs trade. Whether or not people should use various drugs is a complex and subjective question without a straightforward and objective answer. The West has had four decades to prove that prohibition would reduce demand and therefore supply, and yet we have found it does exactly the opposite. Now it's time to look at the mounting evidence and adopt rational policies that work. Thousands upon thousands of lives hang in the balance.
I'm NORML because I want to help end the drug war that's ravaging our communities. Are you NORML? Join us and get involved!
Should cannabis growers be treated as criminals?
Posted in Learning Zone, News.
consuming and transit countries for the past year and a half.
I do believe that European countries in general—but particularly those countries that have in place comprehensive harm reduction programmes, those that have decriminalised or depenalised the demand for drugs, not to mention those that allow the domestic supply of drugs—have an obligation, moral and otherwise, to use their considerable economic and political clout to put an end to the criminalisation of the supply and distribution of drugs, too.
Needless to say, comments and feedback are very welcome.


This Mulberry Zucchini Bread recipe is a great way to use up your zucchini and mulberry harvest. This is my first year having zucchini in my garden, and it's shocking how many zucchini the two plants I have growing in my backyard garden have produced. I can't eat it fast enough! My front yard has a mulberry tree, and I have the same problem. Mulberries too are growing faster than I can consume them.
If you don't have mulberries on hand, you could swap them out for another berry of your choice. Blueberries would be delicious too!
This recipe will yield two loaves of mulberry zucchini bread. One loaf is just not enough!
Lightly grease two 4″ x 8″ loaf pans.
Beat together the eggs, oil, vanilla, and sugar in a large bowl.
Beat in the flour, salt, baking powder, baking soda, and cinnamon.
Gently fold in the mulberries.
Once combined, transfer the mixture to the two loaf pans, distributing evenly.
Bake for 1 hour 10 minutes in the preheated oven, or until a knife inserted in the center of a loaf comes out clean. To be safe, check at around 50 minutes as your oven may be more efficient than mine.
Allow the bread to fully cool before cutting into it, then enjoy!
Love zucchini bread, but I've never tried a mulberry in my life. I'd like to try one some day and hopefully get to try your recipe.


BOTHELL, Wash., July 13, 2015 /PRNewswire-USNewswire/ -- STOP Consumer Trafficking's founder, Jason Gaylord, enters week two of his 31 day vigil to raise public awareness and lead the conversation about the constant and pervasive invasion of our online privacy and the selling of our personal identities as a standard business practice and revenue model of big Internet companies.
Jason Gaylord, founder of the Stop Consumer Trafficking movement, begins the second week of his rooftop vigil.
Gaylord is not alone in his vigil to STOP Consumer Trafficking. Shawn Tacey, CEO of Localloop, firmly believes that this insidious practice is harmful to consumers, business owners and local economies. Mr. Tacey was asked to discuss how consumer trafficking is detrimental to local commerce at a meeting for local business leaders at the Bothell Chamber of Commerce.
"The message we delivered to these business leaders is simple," said Tacey. "Commoditizing human beings and their behavior with constant pervasive ads and gimmicks that target their identities causes consumers to tune out and distrust, reducing all purchasing decisions to lowest price. Small businesses cannot compete at that level. Eventually, Big Internet companies that are highly capitalized with a long term strategy of losing money to outlast competitors will win, eliminating millions of small businesses and the jobs they create. Long term, this is bad for consumers and bad for our local economies."
Tacey added, "I was recently in New York City and saw a billboard on a bus for a new science fiction show on AMC called Mr. Robot that read, "Banks own your money, social media owns your relationships, corporations own your minds... Privacy is a myth." When art mimics culture we are only seeing the foreshadow of how pervasive and vile consumer trafficking will become." Tacey concluded by stating, "Jason Gaylord is sacrificing a month of his life to bring awareness to this awful problem, and to advocate for a better Internet where people have the freedom of choice to protect their behaviors, searches, thoughts, relationships and privacy. If people become aware and open their eyes as to how they are being used and traded everyday, change will happen and the Internet will become a safe and ethical place to search and be social because people will demand it."
Join the movement by visiting www.stopconsumertrafficking.com/TakeAction.aspx.


text:
Disclaimer: the posting of stories, commentaries, reports, documents and links (embedded or otherwise) on this site does not in any way, shape or form, implied or otherwise, necessarily express or suggest endorsement or support of any of such posted material or parts therein.
TURKEY TO BE SPLIT UP?
Turkish model Aysun Kayacı. Author Haluk Özözlü (http://www.sihirlitur.com/)
There is a battle going on for control of Turkey.
There may be a plot to balkanise Turkey, and George Soros may be involved?
Prof. Dr. Umit Ozdag (Nationalist Prof. Ozdag: The US is Behind the Ergenekon Operation) has stated that "The US aims to establish a federal Turkey instead of unitary Turkish state".
For many years, the generals in Turkey seemed to be friends with Israel and the Pentagon.
Reportedly, the Turkish generals of the 'fascist' group known as Ergenekon were happy to carry out acts of 'false flag' terrorism.
And reportedly the Turkish generals were happy to topple Turkish governments that Israel and the Pentagon did not like.
But then some of the Ergenekon generals apparently discovered that Israel and the Pentagon were secretly trying to keep Turkey weak, divided and easy to control.
In January 2009, a report in Turkish Weekly suggested that some Ergenekon generals had turned against Israel and the USA. (Ergenekon's Foreign Policy Guide)
According to a writer in Turkish Weekly:
"Most of the Ergenekon members are anti-Semitic.
"They claim that the MOSSAD has played a very dirty role in Turkish politics and aimed to divide the country into poles."
Is this true, or disinformation?
On 14 February 2010, Turkey's Hürriyet Daily News reported on the Open Society Institute, or OSI, founded by Jewish-American businessman George Soros. (Threats against Open Society Foundation disappear).
It seems that negative press reports on the Open Society Foundation have disappeared at the same time as the Ergenekon network has been exposed.
The Pentagon, Israel, NATO and Soros want to make sure that Turkey is under their control.
In 1997, banks and currencies got into difficulty in Asia. Malaysian Prime Minister Mahathir thought he knew who was behind it all: George Soros, Jewish currency trader. (MAHATHIR VS. SOROS)
Soros reportedly played a part in undermining banks and currencies during the Asian financial crisis of 1997. (George Soros' role in the Asia Crisis of 1997)
Soros allegedly "spent the war in Hungary under false papers working for the Nazi government, identifying and expropriating the property of wealthy fellow Jews." (The Secret Financial Network Behind "Wizard" George Soros)
The Ergenekon probe is heating up, with the interrogation of a general and an admiral
Ergenekon is accused of working to overthrow the Justice and Development Party (AK Party) government.
The latest Ergenekon plot was exposed by a Turkish daily in 2009.
"According to the plot, religious communities would be presented to the public as 'terrorist organizations' through subversive plans.
"Members of the military were supposed to plant weapons and munitions at the homes of followers of religious communities.
"Police raids on these addresses would result in the arrest of those individuals.
"The public would then start regarding religious communities as having 'terrorist intentions,' according to the plot." (Ergenekon probe is heating up, with the interrogation of a general and an admiral)
It is difficult to tell how much of the information about Ergenekon is disinformation.
A Turkish TV station broadcast a video recording of a police operation at the house of naval lieutenants who are accused of plotting to assassinate two admirals.
Admiral Yiğit defended the naval officers accused of plotting to assassinate him, saying: 'My officers are accused of plotting to assassinate me. They would throw themselves in front of bullets if someone shot at me.' (Ergenekon probe is heating up, with the interrogation of a general and an admiral)
Les Costumes Populaires De La Turquie, taken by French photographer Pascal Sebah at the universal exposition in Vienna, 1873.
The pro-Israel Economist (Coups away) reports that 'the generals insist that Ergenekon is part of a smear campaign led by Fethullah Gulen, a moderate Islamic cleric who heads Turkey's richest and most influential Islamic brotherhood.
'This movement, which abhors violence and embraces capitalism, is acknowledged to have kept Turkish Islam tame...
'One of the army's alleged coup plots involved the planting of weapons in the homes of Gulenists in an attempt to discredit them.'
The military, and presumably Ergenekon, are said to be split into two factions.
There are those who see the value of having links with neighbours Russia and Iran and those who oppose this.
The latter faction want to keep close to Israel, the USA and Europe.
Israel fears a nuclear armed Turkey. (Israel warns Greece: Turkey will soon become nuke power /Russia says ready to help Turkey build nuclear power plant)
On 22 January 2009, Prof. Dr. Umit Ozdag stated that the United States is the real power behind the Ergenekon Operation in Turkey. (Nationalist Prof. Ozdag: The US is Behind the Ergenekon Operation)
Mr. Ozdag said "The US aims to establish a federal Turkey instead of unitary Turkish state".
Prof. Ozdag claimed that the European Union (EU) too makes efforts to shift Turkey's unitary state into an ethnic based federal Turkey state.
Turkey, terror bombs, the CIA and Mossad
aangirfan: MOSSAD and THE CIA TURN UP THE HEAT.
aangirfan: Jewish control of Turkey?
Posted by Anon at 5:18 AM
Labels: Ergenekon, Fethullah, Gulen, Israel, Soros, Turkey
Hereafter the new borders of Turkey and the Middle East.
http://arthurzbygniew.blogspot.com/2007/04/us-academy-colonel-redraws-middle-east.html
What a dillema; Mr. Ozdag himself is a member of Ergenekon.
RIGI SAYS USA OFFERED AID FOR ATTACKS ON IRAN.
LOOK OUT FOR WOMEN!
OSAMA BIN LADEN IN THE AMERICAN HOSPITAL IN DUBAI ...
MADELEINE MCCANN & THE CIA'S FINDERS
AUSTRALIANS AND CIA IN DUBAI
IRAN CATCHES AMERICAN BACKED TERRORIST?
FASCIST CAPITALISM COMING TO AMERICA?
9 11 Truth
DUBAI, DAVERON AND ALBERT REYNOLDS
DUBAI ASSASSINATION - REAL PASSPORTS - MI6
CHERIE BLAIR BRAINWASHED BY THE CIA?
WORLD WAR III?
THE MYSTERIOUS ARTHUR KOESTLER
THE ONLY CONSPIRACY THAT MATTERS
MI6 AND THE DUBAI ASSASSINATION
ISRAELIS IN HAITI FOR ORGAN HARVESTING AND CHILD S...
MOSSAD DISINFORMATION ON DUBAI ASSASSINATION?
CHILD ABUSE IN SCOTLAND AND THE LOCKERBIE AFFAIR
THE MILITARY IS THE ENEMY?
WHO MIGHT HAVE RECRUITED TONY BLAIR INTO THE SECUR...
CIA AND MOSSAD IN PUNE?
THE CHILD SEX TRADE - FROM HAITI TO THAILAND TO OH...
SEX AND VIA GRADOLI
OBAMA TO BOMB IRAN TO SAVE HIS PRESIDENCY?
SEX, MURDER AND THE FBI, IN INDIA
COLONEL RUSSELL WILLIAMS AND MURDERS
TONY BLAIR AND CHILD ABUSERS
MI5 AND SHAKER AAMER; DEATHS IN GUANTANAMO
TOYOTA SABOTAGED BY THE USA?
US BONDS ARE AS SAFE AS PEARL HARBOUR IN 1941
FRENCH FASHION?
MELTDOWN IN THE UK?
SAIFUL, BINYAM AND A NUMPTY
AMERICAN MILITARY RESPONSIBLE FOR TERRORISM IN PAK...
PASSENGERS ON 9 11 FLIGHTS LINKED TO PENTAGON
LED ZEPPELIN and Clockwork Orange; VIETNAM WAR and...
A KING AND VARIOUS MURDERS
THE CLASSIC SEX SCANDAL
MANIPULATION OF STOCK MARKETS AND CURRENCIES
CHILD ABUSE - IRELAND
BANKS AND OBAMA
THE CIA AND 'LIMITED HANGOUT'
MUMBAI 2008 INSIDE JOB; HEADLEYGATE
CANADA, FRANCE & USA PLAN TO GRAB HAITI'S OIL, IRI...
KILLING KIDS ON A FIELD TRIP; ERGENEKON AND 9 11
THE CLASSIC LIBERAL JEW
DIANA, JEWS, ARMS DEALERS, 9 11
Islam4UK 'Exposed As British Intelligence Front'
TERROR CONVICTION TO BE QUASHED? FAKED EVIDENCE?
FROM LUXURY HOTELS TO DRUGS AND WEAPONS
SLEDGEHAMMER; 9 11


The Perfume Pagoda is a complex of Pagodas and Buddhist shrines built into the limestone cliffs of Huong Tich Mountain, where you can take a cruise on rowing boat; having an easy walk up the mountain; exploring the Huong Tich cave which is named as "the most beautiful cave in the North"; and visiting the Pagodas.
At 07.00, you will have a 2 hours car ride to Duc Wharf. From here you will have a cruise on the Yen stream to Perfume mountain, with a break to visit the "registration" pagoda.
The rowing boat journey takes more than 1 hour through the amazing landscape of mountains, water and rice fields. Upon arrival, you will take a more a 1.5 hour walk up the steps to the top of the Perfume mountain to visit the Huong Tich pagoda.
After exploring the cave, acknowledged as one of the most beautiful limbstone caves in Northern Vietnam, you will descent back to the whalf and have lunch at a local restaurant.
After lunch, you have opportunity to visit Thien Tru, the biggest and the most worth seeing Pagoda in the area, before coming to the wharf for the boat trip to the Duc Wharf, where your vehicle is waiting. You will arrive back in Hanoi in the late afternoon.
The Perfume Pagoda's festival begins from the middle of the second lunar month and lasts until the end of the third lunar month (March and April), attaching a great numbers of Buddhist pilgrims. In case you prefer to visit the Pagoda in quiet atmosphere, you would avoid coming there during its festival.