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

	Polar codes are a breakthrough in the field of channel coding as they were proved to achieve channel capacity with efficient encoding and decoding algorithms \cite{arikan}. Successive cancellation (SC) and belief propagation (BP) decoding algorithms are introduced in \cite{arikan} to decode polar codes. Although SC decoding can provide a low-complexity implementation, its serial nature prevents the decoder to reach a high decoding throughput. In addition, the error-correction performance of SC decoding for short to moderate polar codes does not satisfy the requirements of the fifth generation of cellular mobile communications (5G). To improve the performance of SC decoding, SC list (SCL) decoding was introduced in \cite{tal_list} and it was shown that SCL can provide a vast error-correction performance improvement if it is aided by a cyclic redundancy check (CRC). Based on this observation, polar codes have been selected to be used in the enhanced mobile broadband (eMBB) control channel of 5G together with a CRC \cite{3gpp_report}.

	Unlike SC-based decoders, the iterative message passing process of BP decoding can be executed in parallel, hence enabling the decoder to reach high decoding throughput. However, with limited number of iterations BP decoding suffers from poor error-correction performance. Furthermore, 5G standard requires polar codes to be concatenated with an outer CRC code. Thus, several attempts have been carried out to improve the performance of BP decoding for polar codes using a CRC. In \cite{RenBPTerminate}, CRC is used as an early termination criterion to prevent the BP decoder from processing unnecessary iterations when the correct codeword is found. In \cite{Sun}, a post-processing algorithm is presented which uses a CRC to detect false-converged errors. In addition, it is observed in \cite{elkelesh2018belief,Doan_GLOBECOM} that BP decoding on a list of factor graph permutations of polar codes can benefit from CRC to achieve lower error probabilities than when no CRC is used. However, BP decoding in all of the aforementioned works is only applied on the factor graph of polar codes and the CRC is only used to verify the result of BP at each iteration, without exploiting the inherent factor graph of CRC. Note that BP decoding is used in \cite{Guo, Abbas, Elkelesh} on the concatenated factor graphs of a low-density parity-check (LDPC) code and a polar code. However, this scheme is not selected for use in the eMBB control channel of 5G.

	In this paper, we first show that by running BP decoding on the CRC-polar concatenated factor graph, significant error-correction performance improvement can be achieved in comparison with the conventional CRC-aided BP decoder. We call the proposed decoding method CRC-polar BP (CPBP). We then propose a neural CPBP (NCPBP) decoder to further improve the error-correction performance of CPBP with limited number of BP iterations. We devise an efficient weight-assignment scheme for NCPBP and show that the proposed scheme has fewer weights than the state-of-the-art neural BP decoder of \cite{Nachmani_STSP} while providing a better error-correction performance. The proposed decoders are evaluated on a 5G polar code of length $128$. At the frame error rate (FER) of $10^{-5}$ and with a maximum number of $30$ iterations, we show that the error-correction performance of the CPBP and NCPBP decoders are approximately $0.25$~dB and $0.5$~dB better than that of the conventional CRC-aided BP decoder, respectively, with negligible latency overhead.

	The rest of this paper is organized as follows. Section~\ref{sec:polar} briefly introduces polar codes and its BP-based decoders. Section~\ref{sec:CPBP} and \ref{sec:NCPBP} describe the proposed CPBP and NCPBP decoders, respectively. Finally, concluding remarks are drawn in Section~\ref{sec:conclude}.

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

	\subsection{Polar Codes}
	\label{sec:polar:polar}

	A polar code $\mathcal{P}(N,K)$ of length $N$ with $K$ information bits is constructed by applying a linear transformation to the message word $\bm{u} = \{u_0,u_1,\ldots,u_{N-1}\}$ as $\bm{x} = \bm{u}\bm{G}^{\otimes n}$ where $\bm{x} = \{x_0,x_1,\ldots,x_{N-1}\}$ is the codeword, $\bm{G}^{\otimes n}$ is the $n$-th Kronecker power of the polarizing matrix $\bm{G}=\bigl[\begin{smallmatrix} 1&0\\ 1&1 \end{smallmatrix} \bigr]$, and $n = \log_2 N$. The vector $\bm{u}$ contains a set $\mathcal{A}$ of $K$ information bits and a set $\mathcal{A}^c$ of $N-K$ frozen bits. The positions of the frozen bits are known to the encoder and the decoder and their values are known to be $0$. The codeword $\bm{x}$ is then modulated and sent through the channel. In this paper, binary phase-shift keying (BPSK) modulation and additive white Gaussian noise (AWGN) channel model are considered, therefore, the soft vector of the transmitted codeword received by the decoder is written as
	\begin{equation}
	\bm{y}=(\mathbf{1}-2\bm{x})+\bm{z}\text{,}
	\end{equation}
	where $\mathbf{1}$ is an all-one vector of size $N$, and $\bm{z} \in \mathbbm{R}^N$ is the AWGN noise vector with variance $\sigma^2$ and zero mean. In the log-likelihood ratio (LLR) domain, the LLR vector of the transmitted codeword is
	\begin{equation}
\mathbf{LLR}_{\bm{x}} = \ln{\frac{\text{Pr}(\bm{x}=0|\bm{y})}{\text{Pr}(\bm{x}=1|\bm{y})}}=\frac{2\bm{y}}{\sigma^2}\text{.}
	\end{equation}

	\subsection{Belief Propagation Decoding of Polar Codes}
	\label{sec:polar:BPD}

	\begin{figure}[t]
		\vspace*{0.3\baselineskip}
		\centering
		\begin{subfigure}[b]{0.5\textwidth}
			\centering
			\includegraphics[width=0.6\linewidth]{Figures/BPDecoding.png}
			\caption{}
			\label{figBPDec:a}
		\end{subfigure} \\
		\begin{subfigure}[b]{0.3\linewidth}
			\centering
			\includegraphics[width=0.8\linewidth]{Figures/BPPE.png}
			\caption{}
			\label{figBPDec:b}
		\end{subfigure}
		\begin{subfigure}[b]{0.3\linewidth}
			\centering
			\includegraphics[width=0.8\linewidth]{Figures/BPPE_left.png}
			\caption{}
			\label{figBPDec:c}
		\end{subfigure}
		\begin{subfigure}[b]{0.3\linewidth}
			\centering
			\includegraphics[width=0.9\linewidth]{Figures/BPPE_right.png}
			\caption{}
			\label{figBPDec:d}
		\end{subfigure}
		\caption{(a) BP decoding on the factor graph of $\mathcal{P}(8,5)$ with $\{u_0,u_1,u_2\}\in \mathcal{A}^c$, (b) a PE, (c) a right-to-left message update of a PE on an unrolled factor graph, and (d) a left-to-right message update of a PE on an unrolled factor graph.}
		\vspace*{-1\baselineskip}
	\end{figure}

	Fig.~\ref{figBPDec:a} illustrates BP decoding on a factor graph representation of $\mathcal{P}(8,5)$. The messages are iteratively propagated through the processing elements (PEs) \cite{arikan2010polar} located in each stage. An update iteration starts with a right-to-left message pass that propagates the LLR values from the channel (rightmost) stage, to the information bit (leftmost) stage, and ends with the left-to-right message pass which occurs in the reverse order. Fig.~\ref{figBPDec:b} shows a PE with its corresponding messages, where $r_{t,s}$ denotes a left-to-right message, and $l_{t,s}$ denotes a right-to-left message of the $t$-th bit index at stage $s$. Equivalently, BP decoding of polar codes can be represented on an unrolled factor graph, in which BP iterations are performed sequentially. Fig.~\ref{figBPDec:c} and Fig.~\ref{figBPDec:d} illustrate the input and output messages of a PE for the right-to-left and left-to-right message updates on an unrolled factor graph, where the superscript $i$ denotes the iteration number. The update rule \cite{arikan2010polar} for the right-to-left messages of a PE is
	\begin{align}
	\label{PolarPE_left}
	\begin{split}
	\begin{cases}
	l^{i}_{t,s} &= f(l^{i}_{t,k},r^{i-1}_{j,s} + l^{i}_{j,k})\text{,}\\
	l^{i}_{j,s} &= f(l^{i}_{t,k},r^{i-1}_{t,s}) + l^{i}_{j,k}\text{,}\\
	\end{cases}
	\end{split}
	\end{align}
and for the left-to-right messages is
	\begin{align}
	\label{PolarPE_right}
	\begin{split}
	\begin{cases}
	r^{i}_{t,k} &= f(r^{i}_{t,s},l^{i}_{j,k} + r^{i}_{j,s})\text{,}\\
	r^{i}_{j,k} &= f(r^{i}_{t,s},l^{i}_{t,k}) + r^{i}_{j,s}\text{,}
	\end{cases}
	\end{split}
	\end{align}
where $j=t+2^s$, $k=s+1$, and
	\begin{equation}
	\label{SPA}
	f(x,y)=2\arctanh \left( \tanh{\left(\frac{x}{2}\right)}\tanh{\left(\frac{y}{2}\right)} \right) \text{,}
	\end{equation}
for any $x,y \in \mathbbm{R}$. Note that implementing (\ref{SPA}) is costly in practice, instead the following approximation of (\ref{SPA}) is used in this paper:
	\begin{equation}
	\label{minsum}
	f(x,y) \approx \tilde{f}(x,y) = \sgn(x)\sgn(y)\min(|x|,|y|)\text{.}
	\end{equation}

	The BP decoding performs a predetermined $I_{\max}$ update iterations where the messages are propagated through all PEs in accordance with (\ref{PolarPE_left}) and (\ref{PolarPE_right}). Initially, for $0 \leq t < N$ and $\forall i \le I_{\max}$, $l^{i}_{t,n}$ are set to the received channel LLR values $\mathbf{LLR}_{\bm{x}}$, $r^{i}_{t,0}$ are set to the LLR values of the information and frozen bits as
	\begin{equation}
	\mathbf{LLR}_{\mathcal{A} \cup \mathcal{A}^c} =
	\begin{cases}
	0 \text{,} & \text{if } t \in \mathcal{A} \text{,}\\
	+\infty \text{,} & \text{if } t \in \mathcal{A}^c \text{.}
	\end{cases}
	\end{equation}
	All the other left-to-right and right-to-left messages of the PEs at the first iteration are set to $0$. After running $I_{\max}$ iterations, the decoder makes a hard decision on the LLR values of the $t$-th bit at the information bit stage to obtain the estimated message word as
	\begin{equation}
	\label{hardDec}
	\hat{u}_t=
	\begin{cases}
	0 \text{,} & \text{if } r^{I_{\max}}_{t,0} + l^{I_{\max}}_{t,0} \geq 0 \text{,}\\
	1 \text{,} & \text{otherwise.}
	\end{cases}
	\end{equation}
In the following sections the vector forms of the left-to-right and right-to-left messages at the $s$-th stage and the $i$-th iteration are denoted as $\bm{l}^i_s$ and $\bm{r}^i_s$, respectively, while that of the estimated message word is denoted as $\bm{\hat{u}}$.

A CRC is used for BP decoding to either early terminate the BP process \cite{RenBPTerminate}, or to help select the correct codeword among a list of candidates \cite{elkelesh2018belief,Doan_GLOBECOM}. However, these CRC utilizations do not take into account the factor graph realization of CRC, on which the BP decoder can be applied.

	\subsection{Neural BP Decoding}

	Neural BP decoding was introduced in \cite{Nachmani_STSP,Loren_ISIT_2017} to improve the error-correction performance of BP decoding on Bose-Chaudhuri-Hocquenghem (BCH) codes by assigning trainable weights to the conventional BP decoding. Neural normalized min-sum recurrent neural network (NNMS-RNN) is a powerful variant of neural BP \cite{Nachmani_STSP} with the following weight assignment scheme for the message update rule of a PE in (\ref{PolarPE_left}) and (\ref{PolarPE_right}):
	\begin{align}
	\label{PE_NNMSRNN_left}
	\begin{split}
	\begin{cases}
	l^{i}_{t,s} &= w_0 \tilde{f}(l^{i}_{t,k},w_1 r^{i-1}_{j,s} + w_2 l^{i}_{j,k})\text{,}\\
	l^{i}_{j,s} &= w_4(w_3\tilde{f}(l^{i}_{t,k},r^{i-1}_{t,s})) + w_5 l^{i}_{j,k}\text{,}\\
	\end{cases}
	\end{split}
	\end{align}
	\begin{align}
	\label{PE_NNMSRNN_right}
	\begin{split}
	\begin{cases}
	r^{i}_{t,k} &= w_6 \tilde{f}(r^{i}_{t,s},w_7 l^{i}_{j,k} + w_8 r^{i}_{j,s})\text{,}\\
	r^{i}_{j,k} &= w_{10} (w_9 \tilde{f}(r^{i}_{t,s},l^{i}_{t,k})) + w_{11} r^{i}_{j,s}\text{,}
	\end{cases}
	\end{split}
	\end{align}
	where $w_m \in \mathbbm{R}$ $(0 \leq m \leq 11)$ are the trainable weights.

	The NNMS-RNN BP decoder suffers from a large number of weights which adversely affects its implementation cost. A neural normalized min-sum (NNMS) decoder was used to decode polar codes by only enabling the training for $w_0, w_3, w_6$ and $w_9$, while setting the other weights in (\ref{PE_NNMSRNN_left}) and (\ref{PE_NNMSRNN_right}) to $1$ \cite{Xu}. However, the error-correction performance improvement of \cite{Xu} with respect to the conventional BP is incremental.

	\section{CRC-Polar BP Decoding}
	\label{sec:CPBP}

	In this section, we present the CPBP decoding algorithm which exploits the concatenated factor graph of a polar code and a CRC. Fig.~\ref{figBPCRC} shows the concatenated factor graph of $\mathcal{P}(8,3)$ and a CRC of length $2$. We run BP decoding algorithm on the concatenated factor graph to exploit the extrinsic information of the two constituent factor graphs. A similar approach was performed in \cite{Guo} for a LDPC-polar concatenated code by passing the BP messages between the factor graphs of LDPC and polar code at each iteration. A direct application of the BP decoder in \cite{Guo} to the CRC-polar concatenated code is not beneficial. This is due to the fact that the LDPC code is only connected to a few pre-selected information bits of polar codes which ensures the extrinsic information received by polar code is reliable enough, even in the initial iterations of BP decoding where the LLR values are not evolved yet. This is not the case for CRC-polar concatenated code since CRC is connected to all the information bits of polar code, some of which are highly unreliable during the early iterations of BP decoding.

	\begin{figure}[t]
		\centering
		\includegraphics[width=0.7\linewidth]{Figures/CRCPolarGraph.png}
		\caption{Factor graph representation of a CRC-polar concatenated code. The polar code is $\mathcal{P}(8,3)$ and a $2$-bit CRC is used.}
		\label{figBPCRC}
		\vspace*{-1\baselineskip}
	\end{figure}

	In order to address the above issue, we first run BP decoding on the polar code factor graph for a maximum of $I_{\text{thr}}$ iterations and if the BP decoding is not successful after $I_{\text{thr}}$ iterations, we then continue the BP decoder on the CRC-polar concatenated factor graph. In order to determine if the decoder has succeeded, we use the CRC at each iteration as an early stopping criterion. The proposed decoding algorithm is summarized in Algorithm~\ref{algCPBP}. The LLR vectors $\bm{l}^i_s$ and $\bm{r}^i_s$ at all stages and iterations are initialized as explained in Section \ref{sec:polar:BPD}. The \texttt{BP\_PolarLeft} and \texttt{BP\_PolarRight} functions compute (\ref{PolarPE_left}) and (\ref{PolarPE_right}) at all the bit indices to perform the polar right-to-left and left-to-right LLR updates, respectively. The estimated message word $\bm{\hat{u}}$ is obtained at every iteration by making a hard decision based on $\bm{l}^i_0$ and $\bm{r}^i_0$, which is done by executing (\ref{hardDec}) in the \texttt{HardDecision} function. A CRC is then applied on $\bm{\hat{u}}$ and the decoding can be early terminated if the CRC is satisfied. After $I_{\text{thr}}$ iterations, if the decoding is not terminated, BP decoding on the CRC-polar factor graph is carried out in the \texttt{BP\_CRC} function. It is worth mentioning that BP decoding after $I_{\text{thr}}$ iterations runs on the concatenated CRC-polar factor graph at every iteration.

	\begin{algorithm}
		\caption{CPBP Decoding Algorithm}
		\label{algCPBP}
		\DontPrintSemicolon
		\SetKwInOut{Input}{Input}
		\SetKwInOut{Output}{Output}
		\SetKwFunction{BPPolarLeft}{BP\_PolarLeft}
		\SetKwFunction{BPPolarRight}{BP\_PolarRight}
		\SetKwFunction{BPPolarCRC}{BP\_CRC}
		\SetKwFunction{CRCCheck}{CRC\_IsTerminated}
		\SetKwFunction{HardDecision}{HardDecision}
		\SetKwFunction{Terminate}{Terminate}
		\SetKwFunction{Init}{Init}

		\Input{$I_{\max}, I_{\text{thr}},n$}
		\Output{$\bm{\hat{u}}$}
		Initialize $\bm{l}^i_s,\bm{r}^i_s$ ($1 \leq i \leq I_{max}$, $0 \leq s \leq n$)\\
		\For{$i \leftarrow 1$ \KwTo $I_{\max}$}{

			\For{$s \leftarrow n-1$ \KwTo $0$}{
				$\bm{l}^i_s \leftarrow$ \BPPolarLeft{$\bm{l}^i_{s+1},\bm{r}^{i-1}_s$} \\
			}

			\If{$i > I_{\textup{thr}}$}{
				$\bm{r}^i_0 \leftarrow$ \BPPolarCRC{$\bm{l}^i_0$} \\
			}

			$\bm{\hat{u}} \leftarrow $ \HardDecision{$\bm{r}^i_0 + \bm{l}^i_0$} \\
			\If{$\bm{\hat{u}}$ satisfies CRC}{
				Terminate
			}

			\If{$i \le I_{\max} - 1$}{
				\For{$s \leftarrow 1$ \KwTo $n-1$}{
					$\bm{r}^i_s \leftarrow$ \BPPolarRight{$\bm{l}^i_s,\bm{r}^i_{s-1}$} \\
				}
			}
		}
		\Return{$\bm{\hat{u}}$}
	\end{algorithm}

	Fig.~\ref{fig:CPBP_per} shows the FER performance of the proposed CPBP algorithm in comparison with the CRC-aided BP decoder of \cite{RenBPTerminate}, for the $\mathcal{P}(128,80)$ concatenated with the $16$-bit CRC, which is selected for 5G \cite{3gpp_report}. In this figure, we set $I_{\max} \in \{30,200\}$ and we set $I_{\text{thr}} \in \{15,30\}$ when $I_{\max} = 30$ and $I_{\text{thr}} \in \{0,50,100,150,200\}$ when $I_{\max} = 200$. We denote CPBP decoding with parameters $I_{\max}$ and $I_{\text{thr}}$ as CPBP-($I_{\max}$,$I_{\text{thr}}$). Note that CPBP-($I_{\max}$,$I_{\max}$) is equivalent to the decoder in \cite{RenBPTerminate} and CPBP-($I_{\max}$,$0$) is the direct application of the approach in \cite{Guo}. It can be seen that, CPBP-($30$,$15$) provides a gain of almost $0.25$~dB in comparison with the CRC-aided BP decoder of \cite{RenBPTerminate} at the target FER of $10^{-5}$. In addition, among the selected $I_{\text{thr}}$ for $I_{\max} = 200$, CPBP-($200$,$50$) provides the best error-correction performance at the target FER of $10^{-5}$. Furthermore, CPBP-($200,50$) has an error-correction performance gain of about $0.75$~dB at FER~$=10^{-5}$ in comparison with the CRC-aided BP decoder of \cite{RenBPTerminate}. It is worth mentioning that increasing $I_{\max}$ does not improve the error probabilities of the conventional BP decoder in \cite{RenBPTerminate} at high $E_b/N_0$ regime. On the contrary, the FER of the proposed CPBP decoder is greatly benefited from a high value of $I_{\max}$ as observed from Fig.~\ref{fig:CPBP_per}.

	\begin{figure}[t]
		\vspace*{1\baselineskip}
		\centering
		\input{Figures/fer_CPBP_N128_K80_CRC16.tikz}
		\hspace{30pt} \ref{perf-legend-CPBP}
		\caption{FER performance of CPBP decoding for $\mathcal{P}(128,80)$ and a $16$-bit CRC used in 5G.}
		\label{fig:CPBP_per}
		\vspace*{-0.6\baselineskip}
	\end{figure}

	We now evaluate the latency of the proposed CPBP decoding scheme and compare it with state-of-the-art. The latency of a BP-based decoder can be measured using the number of time steps required to finish the decoding process \cite{arikan2010polar}. Let us consider the decoding process terminates at iteration $I_\text{ET}$ ($1 \le I_{\text{ET}} \le I_{\max}$). Then the decoding latency of a conventional BP decoder with early stopping criterion can be represented as
	\begin{equation}
	\mathcal{T}_{\text{BP}} = (2n-1)(I_{\text{ET}}-1)+n \text{.}
	\label{eq:BPLatency}
	\end{equation}
The latency of the proposed CPBP decoder depends on when the decoding process terminates and can be represented as
	\begin{equation}
	\mathcal{T}_{\text{CPBP}} \!=\!
	\begin{cases}
	(2n\!-\!1)(I_{\text{ET}}\!-\!1)\!+\!n, & \!\!\!\text{ if } I_{\text{ET}} \!\le\! I_{\text{thr}},\\
	(2n\!-\!1)(I_{\text{ET}}\!-\!1)\!+\!n\!+\!2(I_{\text{ET}}\!-\!I_{\text{thr}}),  & \!\!\!\text{ otherwise.}
	\end{cases}
	\label{eq:CPBPLatency}
	\end{equation}
	In fact, if $I_{\text{ET}} \le I_{\text{thr}}$, (\ref{eq:CPBPLatency}) reverts to (\ref{eq:BPLatency}) since the CPBP decoder terminates without traversing the CRC factor graph. It should be noted that the worst case latency of the BP decoder and the proposed CPBP decoder can be calculated using (\ref{eq:BPLatency}) and (\ref{eq:CPBPLatency}) respectively, by setting $I_{\text{ET}} = I_{\max}$.

	Fig.~\ref{fig:CPBP_latency} illustrates the average latency of the proposed CPBP decoding algorithm in comparison with a conventional CRC-aided BP decoder of \cite{RenBPTerminate} for the same code as in Fig.~\ref{fig:CPBP_per}. For the proposed decoders, we set $I_{\text{thr}} \in \{15,30\}$ for $I_{\max}=30$, and $I_{\text{thr}} \in \{50,100,150,200\}$ for $I_{\max}=200$. It can be seen that the proposed CPBP algorithm incurs negligible latency overhead in comparison with \cite{RenBPTerminate}, while providing significant performance gain. Moreover, the average latency of the CPBP decoder when $I_{\max} = 30$ is always smaller than that of the CPBP decoder when $I_{\max} = 200$. This average latency saving is more significant for lower $E_b/N_0$ values. Furthermore, the worst case latency of CPBP($200$,$50$) is $2887$ time steps, and that of CPBP($30$,$15$) is $407$ time steps which is only $14\%$ of the worst case latency of CPBP($200$,$50$). For applications with stringent latency requirements, a small $I_{\max}$ is needed. However, the latency saving as a result of a small $I_{\max}$ comes at the cost of error-correction performance loss as shown in Fig.~\ref{fig:CPBP_per}. In the next section, we propose a method to improve the error-correction performance of CPBP decoding for small values of $I_{\max}$, by using trainable weights.

	\begin{figure}[t]
		\vspace*{1\baselineskip}
		\centering
		\input{Figures/timesteps_CPBP_N128_K80_CRC16.tikz}
		\hspace{30pt} \ref{latency-legend-CPBP}
		\caption{Average decoding latency of CPBP decoding for $\mathcal{P}(128,80)$ and a $16$-bit CRC used in 5G.}
		\label{fig:CPBP_latency}
		\vspace*{-0.6\baselineskip}
	\end{figure}

\section{Neural CRC-Polar BP Decoding}
\label{sec:NCPBP}

	\begin{figure*}[th]
		\centering
		\includegraphics[width=0.77\linewidth]{Figures/NNBP.png}
		\caption{NCPBP architecture with $I_{\max}=2$ and $I_{\text{thr}}=0$ for $\mathcal{P}(8,3)$ concatenated with a $2$-bit CRC.}
		\label{fig:NCPBPArch}
		\vspace*{-0.8\baselineskip}
	\end{figure*}

	In this section, we propose the NCPBP decoder to improve the error-correction performance of CPBP decoding. The NCPBP decoder assigns trainable weights to the edges of the CRC-polar concatenated factor graph. Therefore, the NCPBP decoder resembles a neural network architecture by mapping the message updates of CPBP decoding to different computational layers in the neural network. In other words, each computational layer of the neural network is represented either as a set of PEs for BP decoding on the factor graph of polar codes, or as a set of operations required to perform BP decoding on the CRC factor graph. This network architecture greatly simplifies the training process since it can be adapted to recent deep learning frameworks, e.g. Tensorflow \cite{TensorFlow}.

	Fig.~\ref{fig:NCPBPArch} depicts the architecture of the proposed NCPBP decoder for $\mathcal{P}(8,3)$, with $I_{\max}=2$ and $I_{\text{thr}}=0$. The architecture contains the unrolled CRC-polar concatenated factor graph. Therefore, the message updates of BP decoding on polar codes at a computational layer is represented as the ones in Fig.~\ref{figBPDec:c} and Fig.~\ref{figBPDec:d}. In order to assign the weights to the $\frac{N}{2}$ parallel PEs at polar code computational layers, we represent the product of the weights $w_3$ and $w_4$ in (\ref{PE_NNMSRNN_left}), and the product of the weights $w_9$ and $w_{10}$ in (\ref{PE_NNMSRNN_right}), as single trainable weights $w_{3,4}$ and $w_{9,10}$, respectively. This is due to the fact that the product of two trainable weights can be merged into one as the new weight can also be optimized during training. In addition, we merge the weights $w_1$ and $w_2$ in (\ref{PE_NNMSRNN_left}) into $w_{1,2}$, and the weights $w_7$ and $w_8$ in (\ref{PE_NNMSRNN_right}) into $w_{7,8}$, to further reduce the number of trainable weights. As a result, we define the weight assignment scheme of a PE in NCPBP decoding as
	\begin{align}
	\label{PE_NNBP_left}
	\begin{split}
	\begin{cases}
	l^{i}_{t,s} &= w_0 \tilde{f}(l^{i}_{t,k},w_{1,2} (r^{i}_{j,s} + l^{i}_{j,k}))\text{,}\\
	l^{i}_{j,s} &= w_{3,4}\tilde{f}(l^{i}_{t,k},r^{i}_{t,s}) + w_5 l^{i}_{j,k}\text{,}\\
	\end{cases}
	\end{split}
	\end{align}
	\begin{align}
	\label{PE_NNBP_right}
	\begin{split}
	\begin{cases}
	r^{i}_{t,k} &= w_6 \tilde{f}(r^{i}_{t,s},w_{7,8} (l^{i-1}_{j,k} + r^{i}_{j,s}))\text{,}\\
	r^{i}_{j,k} &= w_{9,10} \tilde{f}(r^{i}_{t,s},l^{i-1}_{t,k}) + w_{11} r^{i}_{j,s}\text{.}
	\end{cases}
	\end{split}
	\end{align}
	For the BP decoding on the CRC factor graph of the proposed NCPBP decoder, we adopt the weight assignment scheme of the NNMS-RNN decoder in \cite{Nachmani_STSP}. It should be noted that the polar code computational layers share the same set of weights in each iteration of the proposed NCPBP decoding, while this set of weights is different for different iterations. This is illustrated in Fig.~\ref{fig:NCPBPArch}, in which the layers depicted in the same color indicate that they use the same set of weights. On the contrary, the weights used in all the CRC layers are shared among all the decoding iterations of NCPBP. This is particularly useful in order to limit the number of required weights for NCPBP.

	The NCPBP decoding algorithm starts by a right-to-left message update at iteration $1$. At the $i$-th iteration and the $s$-th stage of the NCPBP decoder, $\bm{l}^i_s$ and $\bm{r}^i_s$ denote the LLR vectors of the right-to-left and left-to-right message updates computed by a polar code PE layer, respectively. Furthermore, the output LLR vector of the CRC layer is denoted as $\bm{r}^{i+1}_0$. The hard estimated values of all the stages in the polar code factor graph are obtained at the right-to-left message updates, denoted as $\bm{\hat{h}}^i_s$, while the hard estimated values derived from the CRC layer is denoted as $\bm{\hat{u}}^i_{\text{CRC}}$.

	The weights of all the polar code and CRC computational layers are trained using a multiloss function defined as
	\begin{equation}
		L = \sum_{i=1}^{I_{\max}}\sum_{s=0}^{n-1}H_{\text{CE}}(\bm{\hat{h}}^i_s,\bm{h_{s}})+\sum_{i'=I_{\text{thr}}+1}^{I_{\max}} H_{\text{CE}}(\bm{\hat{u}}^{i'}_{\text{CRC}},\bm{u}) \text{,}
	\end{equation}
	where $H_{\text{CE}}$ is the cross-entropy function, and $\bm{h_{s}}$ is the correct hard value vector at stage $s$ of the polar code factor graph which is obtained from the training samples. Note that in the testing phase, only the hard estimated values at stage $0$ of the polar code factor graph, i.e. $\bm{\hat{h}}^i_0$ $(1 \leq i \leq I_{\max})$, and the hard estimated values at the CRC layer, i.e. $\bm{\hat{u}}^i_{\text{CRC}}$, $(I_{\text{thr}} < i \leq I_{\max})$, are required to obtain the decoded message bits.

	We evaluate the proposed NCPBP decoder for $\mathcal{P}(128,80)$ concatenated with a $16$-bit CRC which is also used in Section~\ref{sec:CPBP}, and we compare the error-correction performance and latency of NCPBP with those of \cite{RenBPTerminate,Xu,Nachmani_STSP}. All the neural BP-based decoders in this section are trained using stochastic gradient descent with RMSPROP optimizer \cite{hinton2012neural} and the learning rate is set to $0.001$. We use Tensorflow \cite{TensorFlow} as our deep learning framework. Since all the considered neural BP-based decoders satisfy the symmetry conditions \cite{Richardson_ITIT_2001}, we collect $100,000$ zero codewords at each $E_b/N_0$ value for training, where $E_b/N_0 \in \{4,4.5,5,5.5\}$~dB. All the weights of all the neural BP-based decoders are initialized to one and all the LLR values are clipped to be in the interval of $[-20,20]$. The mini-batch size is set to $64$ and each neural decoder is trained for $40$ epochs. To evaluate the error-correction performance, randomly generated codewords are used during the testing phase and each decoder simulates at least $10,000$ codewords until it obtains at least $50$ frames in error.

	Fig.~\ref{fig:NCPBP} compares the error-correction performance of the proposed NCPBP decoder with state-of-the-art BP-based decoders in \cite{RenBPTerminate,Xu,Nachmani_STSP}. We use the NNMS-$I_{\max}$ decoder of \cite{Xu} and the NNMS-RNN-$I_{\max}$ decoder of \cite{Nachmani_STSP} for our comparisons. In all the decoders, we set $I_{\max} = 30$. At a target FER of $10^{-5}$, the proposed NCPBP decoder provides about $0.5$~dB gain with respect to \cite{RenBPTerminate}, $0.4$~dB gain with respect to \cite{Xu}, and $0.2$~dB gain with respect to \cite{Nachmani_STSP}. Compared to the CPBP decoder of Section~\ref{sec:CPBP}, the proposed NCPBP provides $0.25$~dB FER performance improvement.

	\begin{figure}[t]
		\centering
		\input{Figures/fer_NCPBP_N128_K80_CRC16.tikz}
		\hspace{30pt}	\ref{perf-legend-NCPBP}
		\caption{FER performance of NCPBP decoding for $\mathcal{P}(128,80)$ and a $16$-bit CRC used in 5G.}
		\label{fig:NCPBP}
	\end{figure}

	Fig.~\ref{fig:NCPBP_latency} illustrates the average latency requirements of the NCPBP decoder compared to the state-of-the-art decoders in \cite{RenBPTerminate,Xu,Nachmani_STSP}. It can be seen that while the average latency of the NCPBP decoder is similar to that of the decoders in \cite{RenBPTerminate,Xu}, it is always better than that of \cite{Nachmani_STSP}. In addition, NCPBP incurs almost no latency overhead with respect to the proposed CPBP decoder while having a notably smaller error probability.

	\begin{figure}[t]
		\centering
		\input{Figures/timesteps_NCPBP_N128_K80_CRC16.tikz}
		\hspace{30pt}	\ref{latency-legend-NCPBP}
		\caption{Average decoding latency of NCPBP decoding for $\mathcal{P}(128,80)$ and a $16$-bit CRC used in 5G.}
		\label{fig:NCPBP_latency}
		\vspace*{-0.5\baselineskip}
	\end{figure}

	Table~\ref{tab:param} shows the number of weights required for the proposed NCPBP decoder in comparison with the neural BP decoders of \cite{Xu,Nachmani_STSP}. The proposed NCPBP decoder requires $28\%$ fewer weights with respect to the decoder in \cite{Nachmani_STSP}. The decoder in \cite{Xu} requires $46\%$ of the weights that is required by the proposed NCPBP decoder. However, the smaller number of weights in \cite{Xu} results in significant error-correction performance loss as shown in Fig.~\ref{fig:NCPBP}.

	\begin{table}[t]
		\vspace*{1\baselineskip}
		\centering
		\caption{Number of weights required by different neural BP decoders.}
		\setlength{\extrarowheight}{2.5pt}
		\begin{tabular}{lc}
			\toprule
			Decoder & Number of weights \\
			\midrule
			NNMS-$30$ \cite{Xu} & $3840$\\
			NNMS-RNN-$30$ \cite{Nachmani_STSP} & $11520$ \\
			NCPBP-($30$,$15$) & $8288$ \\
			\bottomrule
		\end{tabular}
		\label{tab:param}
		\vspace*{-0.5\baselineskip}
	\end{table}

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

	In this paper, we first proposed a cyclic redundancy check (CRC)-polar belief propagation (BP) (CPBP) decoding algorithm which exploits concatenated factor graphs of polar codes and CRC, by passing the extrinsic information between the two factor graphs. We showed that the proposed CPBP decoding brings significant error-correction performance improvements in comparison with a conventional BP decoder when a large maximum number of BP iterations is used. We further proposed a neural CPBP (NCPBP) decoding algorithm which further improves the error probabilities of CPBP by assigning trainable weights to the edges of the CRC-polar concatenated factor graph. We showed that the NCPBP decoding algorithm can be used in applications which require stringent latency requirements and that it can benefit from the CRC which is present in 5G. Our results for a polar code of length $128$ with $80$ information bits concatenated with a CRC of length $16$ show that the proposed NCPBP decoding algorithm obtains up to $0.4$~dB error-correction performance improvement with respect to the state of the art, at a target frame error rate of $10^{-5}$, while incurring negligible latency overhead.

redpajama_set_name: RedPajamaArXiv


Mac OS X includes a powerful built-in spelling and grammar tool that runs automatically when you type in many apps, but a separate panel can be summoned from just about any text entry point or app that provides additional support for the feature.
To bring up the "Spelling and Grammar" panel in a compatible Mac app, just use the keyboard shortcut Command+Shift+: (yes, colon/semi-colon).
Once the Spelling and Grammar window is open, you can change words, skip to the next where an error has been found, ignore certain words, learn new words, define words, and even guess the appropriate word based on the current entry. To check grammar as well, be sure to check the box in the panel.
The words that will be initially highlighted are the same that are underlined in red for typos, or underlined in green for improper grammar. For auto-corrected words, you'll find them underlined in blue.
This is a great tool to use when writing or editing and it can be used in conjunction with the automatic checkers as well. Or, if you use an app that doesn't yet support the feature like Chrome or Firefox, you can always copy and paste the text to check from Chrome into an app like TextEdit, open the spelling/grammar checker, and then take it back to Chrome or Firefox.
Though the panel also features a dictionary, individual definitions are easier to find by hovering over a word with the cursor and performing a three-fingered tap to define it.
The shortcut is usually shown as ⌘: and not ⇧⌘:. ⌘: can be produced by different key combinations like ⇧⌘; or ⇧⌘. on different keyboard layouts.
I wish someone would post a way to turn this autocorrection off globally. I have turned off spell check in mail and text and everywhere else and yet I find I will be typing and boom! there are either unwanted corrections already made or suggestions. The feature won't default to "false". The vast majority of the time this slows me way down and frankly I hate it. Hate it. Don't need a machine writing "pistol" for "pistil" and such all day long. Did I mention I hate this feature?
Merging iOS with ML can be very bad.
There's an option to disable autocorrect in the Language & Text preferences.
You can also disable spell checking by default. See http://superuser.com/questions/367533/can-spell-checking-be-disabled-by-default-on-os-x.
I don't understand what is happening on your machine, I just typed a sentence including pistil and pistol into iText Express (Mountain Lion 10.8.2) and the spell check accepted them both. what app were you typing into?
Bigasoft YouTube Downloader Pro for Mac updated to support the new Mac OS X Mountain Lion. It can fast download and convert YouTube on OS X Mountain Lion 10.8 for play YouTube video/audio on QuickTime/iTunes/iPad/iPhone/iPod Touch/iMovie/FCP and etc.
Wish there was a way to use the keyboard to control the "add" "learn" and choose correcting words in that spell checker.
I'm not confident using mac's spelling and grammar checker. I prefer to use online grammar tools because they are more effective and fast. Given that I'm always connected to the internet.


ODTUG : Blogs : Kscope14 Abstract Submission Tips!
Every year, the Kscope committee gets hundreds of abstracts—way more than can be accepted for the conference. These come from hard-working individuals, who wish to volunteer their valuable time to share their knowledge with our large user group community. Our content review teams pore through each and every one of these abstracts, looking for the best educational materials to debut at the conference. It's a tough job.
I'm sure many of you wonder about the process behind the scenes for selecting the final conference abstracts. In a nutshell, teams of industry experts are selected for each technology track. Their job is to go through the abstracts within their section and work together to make a final list. Hundreds of hours go into this process during a fast and furious four- to six-week period. Every aspect of each submission is analyzed—the technology and/or solution being presented, the speaker, past speaker ratings, who the speaker represents, etc. These abstracts also compete against vendor presentations, cross-track presentations, and each other—all vying to get a spot. It's a really tough job.
Each year, hundreds of people are disappointed to discover that their abstract has not been chosen. Committee members have had to face these experiences as well, so we understand how this feels. Therefore, this year we've put our heads together to provide some additional tips and tricks to help you make your abstract the best that it can be! Good luck and we hope to see you in Seattle next year!
Click here for some tips from the ODTUG team.
What exactly do I intend to teach them?
How can my audience use this information directly in their day-to-day job?
What will they learn in this session that they won't learn in other sessions?
Take Advantage of the Abstract vs. Summary Boxes on the Submission Form. Due to a great recommendation, this year we included additional instructions on the submission page to make the differences between the boxes more clear. As the guidance states: "The summary should be a concise version describing your presentation that will be published for attendees." This is what will be shown on the Kscope website to audience members as they search for sessions to attend. "The abstract should be a more in-depth version of your presentation, offering additional details to abstract reviewers." Take advantage of the abstract box; include more details and use this area to speak directly to the content review team about your submission.
Don't Choose a Topic that is too Narrow or too Vague. Audience members want to see solutions that they can use. Therefore, don't pick a topic that applies to only a handful of audience members, or is so technical that people will have a hard time following along. On the flip side, you don't want to be too vague either. What's the right balance? This is hard to put into words. Ask a peer that works in another industry or at another company if they would they be interested in attending your session and if they can use what you're teaching.
Be Relevant. The technology showcased in your solution should be current. One of the attractions of the Kscope conference is the ability to see what the latest software versions have to offer.
Sell! Sell! Sell! Your abstract should sell anyone who reads it on the merits of attending that session. If it doesn't, chances are good that it won't sell the abstract review team either. Writing an abstract is pitching an idea. Your session should seem like the most interesting, valuable, exceptional, and entertaining Kscope presentation there has ever been. The good news is that this isn't as difficult as you think—consider value, originality, intellectual rigor, energy, and novelty. Make the summary crackle with wit. When you have an abstract committee member say things like, "That is the coolest idea I have ever seen!" and "Why didn't I think of that?" and "I can't wait to attend this session," you have just gotten approved for Kscope14 (and yes, there have been comments just like that during review meetings). It also means that you're going to have a full room in Seattle.
Look at Last Year's Abstracts! Need some inspiration? If you would like to see some great examples, take a look at the abstract submissions for Kscope13. The website is still up and available for you to peruse.
Abstract submissions are due October 15! Don't miss a chance to spend next year's conference in beautiful Seattle, WA! Click here to submit your abstract.


Hi Alexander here back with a new post on Laser Disco Defenders. Since last time I wrote about Laser Disco defenders it has launched on Steam last week. I thought it would be interesting to cover some of the technical and design solutions that went into the game. I will start with the custom lighting system that allows for a lot 2D light sources even on low spec hardware.
Procedural Meshes to the rescue!
The lasers in the game were rendered with a procedural mesh so I already had a texture lying around I could use to store the light falloff in. I call this the dum dum duum... laser sheet!
The mesh is then rendered into a separate color buffer. In Unity I did this with a camera that has the same position and size as the main camera. It then renders into a RenderTexture using layers to exclude everything but the light mesh.
Alexander runs Bristol based studio Out Of Bounds Games. You can follow him on Twitter or the facebook page for the company which has the most corporate URL ever. He also organizes the Bristol Unity Meetup.


text:
Home > Competition Ts&Cs
Outsmart Cancer - Competition Terms and Conditions
Competition Prize
One lucky winner will receive complementary attendance at a follow-up retreat program in 2021, at the Yarra Valley Living Centre, Victoria.
The winner will be able to choose from two options:
Option 1) A free weekend retreat program from our 'wellbeing' category (valued at $685), or
Option 2) A free 4-night Outsmart Cancer – The Next Step retreat program (valued at $1,775)
The prize value covers all elements of the program, including educational sessions and materials, shared/dorm accommodation, delicious plant-based wholefood meals, snacks, and healthy beverages.
The prize value/s listed for Option 1 & 2 are based on 'shared/dorm' accommodation for one person, however, subject to room availability, the prize value but may be credited against the cost of twin/double room instead.
Optional extras such as transport to and from the retreat centre, massage therapies, counselling and purchases from our resource centre are not included in the prize. Costs related to these optional extras are the responsibility of the nominated winner.
This competition is open to 2020 Outsmart Cancer Fundamentals Retreat participants (from January through to December 2020).
Employees and their immediate families, suppliers, associated companies and agencies of the Yarra Valley Living Centre are ineligible to enter the competition, even in situations where they have attended a 2020 Outsmart Cancer Fundamentals Retreat.
All eligible attendees of our 2020 Outsmart Cancer Fundamentals Retreat programs (running monthly throughout the year), will be automatically entered into the competition to win a follow up retreat program in 2021.
Selection of Winner
All eligible 2020 Outsmart Cancer Fundamentals Retreat participants will be added into a pool, and a winner will be selected at random, at 12 noon on Friday 18th December 2020.
The draw will take place at the Yarra Valley Living Centre, 55 Rayner Court, Yarra Junction VIC 3797, and (only) the lucky winner will be notified by email and phone by close of business (5pm) on Friday 18th December. The outcome of the draw is final.
The winner will also be congratulated on our social media page/s, eNewsletter and in our Living Well Magazine – only the winners firstname and state will be listed.
Claiming Your Prize
The prize winner may choose to keep this prize or gift/nominate this prize to another person, however, in either situation, the prize choice (Option 1 or 2) and the retreat booking must be made by Friday 29th January 2021. After this date, no changes/transfers are permitted.
The prize is not eligible for refunds and cannot be redeemed for cash.
In the very rare case of the booked retreat being cancelled by the Yarra Valley Living Centre, a complementary transfer will be granted for an equivalent retreat in 2021 or 2022. Equivalent retreat options will be at the discretion of the Yarra Valley Living Centre.
This competition adheres to our standard Privacy Policy, click here to read the policy.

redpajama_set_name: RedPajamaCommonCrawl


text:
Home > Income Tax > CRESCENT HOLDINGS: An Issue of First Impression for Partners with Capital Interests
CRESCENT HOLDINGS: An Issue of First Impression for Partners with Capital Interests
By Ashley Thompson and Theodore Gelt on January 16, 2014 Posted in Income Tax, Tax
On December 2, 2013, the United States Tax Court issued an opinion in Crescent Holdings, LLC v. Commissioner, 141 T.C. No. 15. This opinion affects individuals who receive a non-vested capital interest in a partnership. In what it states was an issue of first impression, the Tax Court held that income of the partnership that was allocated to a non-vested partner was not properly allocated. The wrongfully allocated income was re-allocated to the other partners.
CEO held an interest in Crescent Holdings which was to vest at a future date. For the tax years at issue, 2006 and 2007, Crescent Holdings issued to CEO Schedule K-1s allocating to him ordinary business income in the amounts of $423,611 and $3,608,218, respectively. CEO reported this income on his tax return; however, he received no distributions from Crescent Holdings in either year. CEO resigned three months before his interest vested and Crescent Holdings filed for bankruptcy shortly thereafter. The IRS issued a notice of final partnership adjustment and treated CEO as a partner. The partners and CEO both filed petitions. CEO asserted that he should not have been allocated income nor treated as a partner. Conversely, because it reduced their income, the partners emphasized that CEO should be allocated income and treated as a partner.
The Tax Court analyzed whether the CEO held a profits interest or capital interest. A capital interest is an interest that gives its holder a share of the proceeds if the partnership's assets were sold at fair market value and the proceeds distributed in complete liquidation of the partnership. A profits interest is defined as an interest that is not a capital interest. The court noted that a recipient of a non-vested profits interest could be recognized as a partner and allocated items of income. After examining CEO's agreement the Tax Court concluded that CEO's interest was a capital interest because CEO was entitled to receive a distribution upon liquidation.
Under the income tax rules of Code section 83, a person who receives property in connection with the performance of services must recognize income. The amount included in income is the fair market value of the property received less the amount paid, if any. A taxpayer has two options, however, if the property received is both non-transferable and subject to a substantial risk of forfeiture. First, if the taxpayer does nothing, the fair market value of the property would be included in income only as and when it becomes vested. Second, a taxpayer can make an "83(b) election" to include the property in income at the current value.
The Tax Court ruled that a partnership capital interest is property for purposes of Code section 83. Thus, CEO could have made an 83(b) election for the capital interest received. CEO, however, did not make an 83(b) election, and the property remained not vested. Regulations accompanying section 83 provide that the transferor, in this case Crescent Holdings, shall be regarded as the owner of the property until the property becomes substantially vested. Because CEO's capital interest was not vested, the Tax Court held that the IRS could not include CEO as a partner in its notice of final partnership adjustment nor allocate any income to CEO.
Although not directly discussed in Crescent Holdings, it can be extrapolated from the Tax Court's decision that if a partner's capital or profits interest vests incrementally, partnership income should be allocated to the interest only to the extent then vested. The vested portion would be transferable and not subject to a substantial risk of forfeiture. Therefore, the partnership income allocated to CEO in 2006 and 2007 should have been allocated to Crescent Holding's vested partners. That said, partnership income should be allocated to a partner's interest if the partner has made an 83(b) election whether or not the interest has vested.
Tags: partnership


text:
Open Level Lab: Computer Basics
Sat, Jan 18 10:00 am to 12:00 pm Central Library, Second Floor Computer Lab
Adults computer basics email microsoft office techknowledge
New to computers? Want to get more familiar with using the mouse, typing, navigating the screen and going online? Drop in to an Open Level Lab for one-on-one assistance with basic computer use.
Presented by New York Cares.
Sat, Jan 18 10:30 am to 11:00 am Park Slope Library
Kids saturday storytime storytime
Join us for Saturday Storytime! Listen to new favorites and classic stories read aloud. All ages welcome!
This event will be held in our downstairs auditorium. Tickets are required and will be given out 30 minutes before storytime...
English as a Second Language (ESOL) for Beginners
Sat, Jan 18 11:00 am to 3:00 pm Kings Highway Library
Adults adult learning esol
Free Beginners' English as a Second Language class for adults (21 and over). For more info call 718-240-2770 or go to www.tinyurl.com/School6=GetInfo
Sat, Jan 18 11:00 am to 11:45 am Kings Highway Library
Kids saturday storytime
Sat, Jan 18 2:00 pm to 4:00 pm Kings Highway Library
Adults creative writing poetry
Discuss poetry in a comfortable setting.
Sat, Jan 18 3:00 pm to 3:45 pm Canarsie Library
Kids first five years saturday storytime storytime
Join us each Saturday to hear new stories and favorite tales read aloud. All ages welcome!
Sun, Jan 19 2:00 pm to 4:00 pm Central Library, Trustees Room
Adults health and wellness humanities and art
Please note: The room will open at 1:45pm. Please arrive early to get settled for the workshop which will start promptly at 2pm. No one will be admitted into the session after 2:10pm.
In "Meditation for Creative Expression" sound healing...
Tue, Jan 21 1:00 pm to 1:45 pm Kings Highway Library
Birth to Five Years babies & books storytime
It's never too early to introduce your baby to books! Come to this program to hear great stories, learn fun songs and rhymes, and meet other families and caregivers in your neighborhood.
For babies birth to 18 months and their parents or...
Tue, Jan 21 1:30 pm to 2:15 pm Park Slope Library
Birth to Five Years babies & books first five years storytime
Lap songs, fingerplays, board books, and playtime for our littlest pre-readers! This program is designed for lap-sitting babies 0-12 months old and their caregivers.
Online registration is required and will be open 24 hours...
Tue, Jan 21 2:00 pm to 4:00 pm Central Library, Balcony Conference Room
Adults creative writing
The 4 session workshop will be conducted by Aimee Herman poet and writing instructor.
Presented by Adult Services/Languages & Literature.
Participants will read and evaluate stories and poems, answer prompts and create and...
Tue, Jan 21 2:00 pm to 3:00 pm Central Library, Second Floor Computer Lab
Adults techknowledge
Email Basics will teach new users the basics of email, as well as understanding its uses, services and properties. This lesson will cover:
What is email and why use it?
The various types of email providers available...
Kids after school table-top & board games
Enjoy a game of chess! Instruction available for total beginners, as well as those more advanced. Recommended for ages 8 and up.
Library Lab: Construction
Tue, Jan 21 3:00 pm to 4:00 pm Bushwick Library
Kids build with lego library lab
Join us on Tuesday afternoons for construction challenges with LEGO and more. Learn about architecture and engineering and most importantly have fun!
Kids after school homework help
Free homework help for grades 1-8!
This lesson introduces new PC users to the hardware,...
Start Your Business with Gale Learning Resources
Adults business small business
Business planning can be a complex and unfamiliar process. Often, entrepreneurs don't know what kind of information they need, where to find it, or how to get started.
Gale Business: Plan Builder offers an engaging, step-...
Free Beginners' English as a Second Language class for adults (21 and over). Open enrollment. For more info call 718-240-2770 or go to www.tinyurl.com/School6=GetInfo
Ken Siegelman's Poetry Outreach Presents Baruch November
We are excited to announce Baruch November as our featured poet for January 2020.
Baruch November has taught courses in Shakespeare, poetry and writing at Touro College in Manhattan for more than a decade. His poetry and short fiction...
The Brain Fitness Club
Wed, Jan 22 11:30 am to 12:30 pm Canarsie Library
Adults adult learning
Please join us for a special program for people with developmental disabilities.
Read, play, and have fun at the library! Hear stories read by our librarians, play with words and numbers, and create your own pictures...
Afternoon Movie of the Month
Wed, Jan 22 1:30 pm to 3:15 pm Kings Highway Library
Adults movies movies at the library
"Bad Day at Black Rock" (1955)
Wed, Jan 22 1:30 pm to 2:15 pm Park Slope Library
Adults computer basics techknowledge
Take advantage of our personal computer courses and ask any technology-related questions you may have. You can sign up at our reference desk at the branch.
These classes are for individuals who want personal help with anything computer-...
Wed, Jan 22 3:00 pm to 5:00 pm Bushwick Library
Game On! Tabletop Gaming for Kids & Tweens
Kids game on table-top & board games
Play with classic and new board games, tabletop games, and puzzles.
Introduction to iPads
iPad training is designed specifically for those who are completely new to iPads or who feel they need to have more instruction before confidently using an iPad.
This lesson introduces new iPad users to apps and techniques used to...
Wed, Jan 22 3:30 pm to 5:30 pm Canarsie Library
Kids homework help open-house
Free Homework help for those in grades K to 8.
Library Lab: Electricity
Kids after school library lab
After School STEM Activities for Children
Library Lab is Brooklyn Public Library's dynamic learning enrichment program for children (ages 6 to 12) and their families. Explore Science, Technology, Engineering and Math concepts with fun,...
Kids arts and crafts kids create
Come into the Park Slope Library and create a take-home craft with us! The craft will change each week, so continue to stop by to see what we're making!
For kids 6 and up. Younger children (4 and up) are welcome when accompanied by...
Kids Chess Workshop
Learn to play or improve your game, with instructor Jose Villar from 5:00 pm - 6:00 pm. For beginners or advanced players.
Shape Up NYC: Dance Fitness Fusion
Adults fitness health and wellness
Do you like to dance? Do you want to get fit while having fun? Join us for our Shape Up Dance Fitness class.
Thu, Jan 23 10:00 am to 12:00 pm Central Library, Trustees Room
Adults autism developmental disabilities inclusive services social services
Learn how to qualify for and get Developmental Disability services through NYS Office of People with Developmental Disabilities. You can learn about Medicaid waiver programs, find out about the "Front Door" process, discover respite...
Thu, Jan 23 2:00 pm to 4:00 pm Central Library, Second Floor Computer Lab
Adults research
Conducting research is a fundamental skill for everyone. Whether you're browsing websites or using scholarly materials such as journal articles, you need to know how to formulate good searches, evaluate your sources and organize information. This...
Project Art Workshop
Thu, Jan 23 3:00 pm to 4:00 pm Bushwick Library
Kids after school arts and crafts
Explore, create and express yourself through art with ProjectArt! Classes will be taught by Bushwick Library's artist-in-residence.
The ProjectArt community is dedicated to bringing the arts to as many children as it can in a...
Introduction to Google Drive
Thu, Jan 23 3:00 pm to 4:00 pm Kings Highway Library
Google Drive is a personal cloud storage service from Google that lets users store and synchronize digital content across computers, laptops and mobile devices.
What are the benefits of Google Drive?
Backup Your Precious Files...
Thu, Jan 23 3:30 pm to 5:30 pm Canarsie Library
Start Smart: Financial Projections Session 1
Thu, Jan 23 6:00 pm to 7:30 pm Central Library, Trustees Room
Adults business
In this session, we discuss how to prepare financial projections by emphasizing feasibility analysis and how to set goals for your business to plan for success. The first session will cover establishing a benchmark, COGS vs. Operating Costs, and...
Fiber Arts for Adults
Fri, Jan 24 11:30 am to 12:30 pm Canarsie Library
Adults creative aging fiber arts
All ages are welcome to join us for this special time dedicated to fiber arts: knitting, crocheting and sewing.
Freestyle Fridays for Kids and Tweens
Fri, Jan 24 3:00 pm to 4:00 pm Bushwick Library
Kids after school kids tech time
An open-ended, afterschool program for kids and tweens on Friday afternoons.
Central Library Friday Film Club: Fahrenheit 451
Fri, Jan 24 3:00 pm to 5:30 pm Central Library, Balcony Conference Room
Adults friday film club movies movies at the library
Books, libraries and librarians are the subject of January screenings at our Central Library Friday Film Club. From reportage to comedy to war drama, we try to show how films portray one of the greatest goods of humanity - books and libraries....
Brooklyn Robotics League Registration
Kids bklyn robotics league kids tech time techknowledge teen tech time
Do you love LEGOS, robotic and teamwork? Then join and Brooklyn Robotics League at Brooklyn Public Library, where teams learn to use LEGO EV3 robotics while exploring STEM concepts.
This year's theme is City...
Fri, Jan 24 3:30 pm to 5:15 pm Park Slope Library
Kids techknowledge video games
Join us as we turn our basement auditorium into a drop-in game room! Featuring a variety of new and classic board games, LEGO®, Little Bits, IPADs and video games. Also including cards wtih kittens that explode, sushi on the go...
Freestyle Fridays for Teens
Teens after school teen tech time teen time
An open-ended, afterschool program for teens on Friday afternoons.
Sat, Jan 25 10:00 am to 12:00 pm Central Library, Trustees Room
"You must not tell anyone,' my mother said, 'what I am about to tell you." So begins The Woman Warrior, Maxine Hong Kingston's dazzling memoir of growing up in a Chinese immigrant family in California.
Migration stories...


Slender sophistication that keeps you looking smart while also keeping you smartly on schedule! Inspired by Laura Ashley's Heritage brand, this watch is a welcome addition to any look. Its round stainless steel-backed case houses a to-the-point dial where hands reach out toward Roman numeral markers. The bracelet is equally eye-catching with tortoise shell-style resin flowing into links near the jeweler's clasp.


text:
To Host a Bigger Crowd of Our People, We May Need a Better Party
To Host a Bigger Crowd of Our People, We May Need a Better Party Play Now | Play in Popup | Download
New Orleans There were moments in the 2016 presidential race when observers thought that the candidates for President from the Libertarian and Green Parties could experience significant gains, perhaps even be spoilers. As both major parties presented candidates disappointing to many voters and when Bernie Sanders, a Democrat-Socialist, had inspired such fervor, many felt, there was a larger opening for alternative parties than we had seen in recent cycles. The results at the top of the ticket for the Libertarians and Greens did not prove that, though nationally they did garner a fair swatch of votes, and a favorite son candidate in Utah polled double-digits, almost throwing that state in a new and different direction.
But, wait a minute. David Brooks, conservative Republican die-hard op-ed columnist and part of the Never-Trump caucus, has now argued twice in the matter of days that he and his ilk need to organize a third party where establishment, traditional Republicans can land and feel comfortable since the Democrats are center-left, and the Republicans are now white working class and middle class.
Furthermore, even in a ruby-red state like Louisiana, it never ceases to amaze, given the barriers to success for alternative parties, the surprisingly lengthy list we are offered when we close the curtains on the voting booth on Election Day. Not just Green and Libertarian, but also the Constitution Party, Courage Character Service Party, It's Our Children, Life Family Constitution, Socialism and Liberation, Socialism Equality Anti-War, Socialist Workers, and Veterans Party. The Greens and Libertarians accumulated 50,000 votes in Louisiana. Of course Trump-Clinton did 1.9 million, but still, 50,000 is 50,000. The other small also-rans added another 20,000. Hey, David Duke, running as a Republican got 58,000 and came in 7th of more than 20 candidates for the US Senate from Louisiana. There are a lot of divergent views in a big, wild ungainly electoral rodeo like we run in the United States.
My bi-coastal colleague, Steve Early, with a home and heart in California and his mind often still in New England, noted that alternative parties going local, rather than national, works if you look at the success they have had in a Green-Workers-Community alliance in Richmond, California and the continued success of eclectic green and worker friendly operations like the Vermont Progressive Party, both of which we have covered extensively in Social Policy. Concentrating on the top of the ticket may not be a winner. The Green Party reported only 20 to 21 local winners on Tuesday out of 279 state and local races, he noted.
The "nothing out there for me, it doesn't really matter" nonvoter population is growing though, as turnout goes down and population goes up, and its huge. Yet, Trump, Sanders, and others around the world, and, they are not all conservative no matter what you are reading please remember Spain, Italy, and Greece for example, are proving that where there's a real movement and a messenger that embraces its issues, people will respond.
How can it be that a David Brooks is calling for another party, and we're not hearing the call from and for progressives? It means going local for a long while and constructing the building blocks, but as Vermont has taught that can also develop independent candidates that can contend nationally as well. It's all hard work. When does consensus congeal that it is time for more shoulders on that wheel?
This entry was posted in DC Politics, National Politics and tagged political parties, politics, third Party by Wade. Bookmark the permalink.


text:
In Paradise
A solo show by Margarita Gluzberg
12 September - 9 November 2019
curated by Dominik Czechowski
2019 marks 40 years since Andrey Tarkovsky's seminal film Stalker was made, and also 40 years since Gluzberg left Russia as a young girl. Stalker remains a radically current film touching on major cultural and existential themes. It follows a journey through the restricted Zone to the infamous room that can grant any wish. When Gluzberg left Moscow in 1979, the West itself represented a forbidden Zone that held infinite promise.
In Paradise features a new series of large-scale drawings, occupying the central space of Pushkin House, which Gluzberg calls 'cinema experiments'. Made during the night, these are constructed by projecting Stalker onto sheets of paper and 'recording' the moving image in real time as pencil marks. Different parts of the film are focused on, and what emerges are complex abstract works, that meditate on the film's structure.
They are accompanied by other drawings that reconfigure trajectories of the film through biographical subjects of immigration, childhood, cultural memory and desire. Frequently portraits or characters from Soviet cartoons, these are entities that 're-populate' the Zone, a multi-dimensional territory that has the potential to be anything we want - and in this case, the framework for making art.
Born in Moscow, Margarita Gluzberg has lived and worked in London since 1979. Her practice ranges from drawing, usually on a gigantic scale, to performance, sound installation and most recently, photography and projection. From the subject of boxing, to the history of consumer culture and how it affects human relations, Gluzberg creates a visual territory from historical, autobiographical, and literary references. Her Captive Bird Society project, centered round early recordings of birdsong, generating a wider investigation into the story of phonography, and the apparatus of capture. Gluzberg's most recent photographic body of work, the Consumystic series, is a meditation on the mystical, ritual nature of material desire, weaving a mesh of consumer signs and spaces. The camera acts as the interface between the consumer-voyeur, and the constantly changing, spectacular display of commodities. With reference to techniques used by the Surrealists, the images invoke an age when consumer fictions were being invented for the first time, but are returned to the present, a present where such fictions are becoming increasingly unsustainable. Margarita is a Senior Lecturer at the Royal Academy of Arts.
Gluzberg's past solo exhibitions include Funk of Terror Into Psychic Bricks (2007), The Money Plot (2008), both at Paradise Row, London; Captive Bird Society: Dublin Edition (2009), Kevin Kavanagh Gallery, Dublin; and Phonographicon (2010) at Zonca&Zonca, Milan. With her most recent solo exhibition, Avenue des Gobelins, Paradise Row, 2012, she presented a new body of analogue photographic work, the Consumystic series. The work was also presented as a solo project at Unseen, Amsterdam, 2012. Her ongoing sound project: Captive Bird Society was commissioned for the official programme of the Paris Nuit Blanche in 2009. It was also performed at the MAC/VAL Museum Paris, 2009; Calvert 22 Foundation, London, 2010; and at the Wysing Arts Centre in 2013. Gluzberg's work has been included in group shows in major European venues such as CAC, Vilnius; Rooseum, Malmo; KAde Kunsthal, The Netherlands; Lunds Konsthall, Lund; and Baibakov Art Projects, Moscow.
www.margaritagluzberg.com
Related events to include a conversation with Margarita Gluzberg on 17th October 2019. More details soon.


Melbourne Heart FC players Andrew Redmayne and Jason Hoffman have been central figures in promoting the Don't Stand By, Stand Up! campaign.
Melbourne Heart FC players Andrew Redmayne and Jason Hoffman have been central figures in promoting the Don't Stand By, Stand Up! campaign, which aims to eradicate racism in grassroots football.
Don-t Stand By. Stand Up! focuses on racism in all its forms, from subtle exclusion, to overt verbal abuse on and off the field.
The official launch kicked off on Sunday at Knights Stadium, Sunshine, followed by the National Premier League match between Melbourne Knights and Port Melbourne Sharks.
Andrew Redmayne and GM Community Sue Crow represented Melbourne Heart in an official capacity.
Melbourne Heart encourages all clubs to sign up and take the Pledge to become champions of the Don-t Stand By, Stand Up! bystander program. To find out how, visit the Football Federation Victoria website.
The first 50 clubs that pledge will receive merchandise for 100 players, official recognition from FFV and an opportunity to win a visit from an ambassador. There will also be $250 vouchers from Sportsmart to giveaway.


Bulletin Board (BB) regarding Mad Cow Disease.
www.mad-cow.org, a rather comprehensive website on the subject.
Mad Cow disease is completely caused by a failure of the public to understand Mother Nature's plan for avioding stuff like that. Never, in the history of the planet, have cows eaten other cows! The haste to make a profit, by the feed manufacturers, has let them feed ground up cows to cows (animal protein is cheaper than vegetable [protein). This unnatural monkey wrench in the natural "way" MUST cease before this problem will go away.


Uploaded by Vine at Tuesday, September 10, 2013, the amazing Cobra And American Flag Tattoo Design For Men On Sleeve. I'm sure image above is one of my amazing images from my gallery Best Flag Tattoos Design.
Here We would like to recommend the Amazing image of Cobra And American Flag Tattoo Design For Men On Sleeve as one of our good tattoo style gallerys. You can read my full information in detail by checking it out at Best Flag Tattoos Design. The Amazing image of the tattoo style that We gave will be really fit for your body. It does not only increase your self-esteem but also you will look more impressive than the people around you.
On this site, 34 amazing images that we have selected especially for you from my gallery. Hopefully those images of tattoo style can simply give you more inspirations. Just do right click on the image below to the detail clearly. Tribal Skull And American Flag Tattoo Design For Men On Arm picture, Filipino Flag Tattoo picture, Meaning American Soldier Tattoo Design picture, Star American Flag Tattoo On Arm picture, Cross Mexican Flag Tattoos Design picture, Tiger American Flag Tattoo Design picture, and other. Click right thumbnail below to see my image detail.


text:
Articles by Dwayne Fernandes
About Dwayne Fernandes
Indian. 23. Management Graduate. Huge cricket fan. Twitter and Instagram - @dwayneeeboy
Dhawan & Pujara Tons Put India Firmly Ahead on Day 1
July 26, 2017 Dwayne Fernandes 0
On Day 1 of the first test match against Sri Lanka, Team India put themselves in a very strong position, thanks to centuries from Shikhar Dhawan & Cheteshwar Pujara. Read to know the entire story of Day 1.
Sri Lanka Prepare For Tough Encounter Against Kohli's Men
India have flown to Sri Lanka for 3 tests, 5 ODIs and 1 T20I. The 1st test at Galle International Stadium kicks off tomorrow and we at Read Scoops have previewed this match for all you cricket fans. Read for more.
Microsoft to Kill MS Paint in Next Windows Update?
It's been over 30 years since MS Paint made it's debut in Windows 1.0. However, latest reports say that Microsoft is planning to scrap the legendary editing software in the next Windows 10 update. Read for more.
New Dhinchak Pooja Upload – 'Baapu Dede Thoda Cash'
Guess who's back? Back again? Pooja's back. Tell a friend.. Yes, you've read it right. Dhinchak Pooja is back with a brand new track again, […]
WATCH: Ross Whiteley Smashes Six Sixes in an Over
In a very recent NatWest T20 Blast game, Worcestershire middle order batsman Ross Whiteley did something absolutely exception, smashing 6 sixes in a single over. Read to get complete details of his achievement.
ICC Women's World Cup 2017 Final – India Women vs England Women LIVE Commentary & Updates
India play England in the 2017 ICC Women's World Cup final today – 23rd July 2017. We at Read Scoops decided to have live commentary and regular updates throughout this game, so follow this page.
The Tragic Story of Batsman Runako Morton; He Would Turn 39 Today!
West Indian batsman Runako Morton was a very talented bat, who could've achieved greatness but he had a lot of controversies over his 8-year career. We remember him today, what would've been his 39th birthday.
Linkin Park's Chester Bennington Reported Dead on Chris Cornell's Birthday
American singer and songwriter Chester Bennington has reportedly committed suicide, aged just 41. He is succeeded by his wife and kids. Read here to know the full story of the Linkin Park singer.
Harmanpreet Kaur's Record 171* Takes India to The Women's World Cup Final
India played Australia in the semi final of the 2017 ICC Women's World Cup in a 42-over game, due to a rain delay. Even though it was a stiff task, India ended victorious. Here are the best tweets from that historic semi final.
Ram Nath Kovind Set to Become 14th President of India
India became a republic way back in 1950 and since then, the country has had 13 Presidents and 14 Prime Ministers. The President of India […]
QUIZ: How Well Do You Know Your Country Capitals?
It's the first time we at Read Scoops set up a quiz for our loyal viewers and we chose a simple topic – countries and their capitals. Take part and see how well you do in comparison to others who've done the same quiz.
Munna Michael All Set to Hit Cinemas – 21st July 2017
Munna Michael The much awaited action and dance Bollywood film Munna Michael is finally ready to make its first appearance at the box office. Munna Michael […]
« 1 … 81 82 83 … 86 »


text:
BoomWriter Announces Winner of The 2018 Writing Bee
By PR with Panache! 2018-08-02T13:30:26Z
(BOSTON, MA) August 2, 2018 — BoomWriter Media, Inc., a leading provider of online collaborative writing solutions for education, today announced that the winner of is fourth grade student Reagan Vaughan from the Milton Public Schools in Milton, MA.
The free competition encouraged thousands of 4 and 5 grade-aged students in classrooms throughout the United States and England to read, write, share, and vote on each others' writing submissions while creating original stories and determining The 2018 Writing Bee Champion.
"Learning to write well, across all domains, is in great demand," said Mary Gormley, the Superintendent of Milton Public Schools. "This year's Writing Bee enhanced our curriculum, allowed for students to read and write critically on a daily basis, and ultimately engaged over 700 of our children in the publishing process. Not to mention, we could not be more proud of Reagan and her incredible accomplishment."
The Writing Bee employs BoomWriter's unique collaborative yet competitive content generation platform that engages and inspires students to write by providing them all a single first chapter, called a 'story start', that serves as the starting point for each writing event. This year's Writing Bee celebrity guest author was international, best-selling author Jeff Kinney, the creator of the Diary of a Wimpy Kid series who provided both "The New Kid" and "The Unfathomable Mystery of River Street" as original story starts, respectively, for The Writing Bee's qualifying and finals competitions.
After completing their own unique version of chapter two, students then logged back on to BoomWriter to review the anonymous submissions of fellow participants and cast votes for their favorites. The winning submission became the next chapter in the story, and the process continued until the story was completed. Each story was then converted into a published book containing the names of all participating students.
The Writing Bee was a six-month long process that started in schools throughout the United States and England with local qualifying events that took place primarily in the classroom during the school day. Qualifying event chapter winners and top vote getters were then invited to participate in The Writing Bee Finals that consisted of "knockout rounds" in which only the chapter winner and top vote getters were able to advance to the subsequent rounds. Reagan advanced throughout the event and was the winner of the last chapter, thus earning the title of The 2018 Writing Bee Champion.
Chris Twyman, the CEO and co-founder of BoomWriter Media, Inc., concluded, "Every student deserves to have fun while learning, and The Writing Bee definitely brought an element of friendly competitions to the writing process. Students worked hard to create stories that were meaningful to them, were deeply engaged in voting for their peers, and took pride in seeing their own names in print."
The next Writing Bee starts in October, and will involve middle school students participating in the creation of spoken word oriented content while being inspired by poet, professor, Panther and Oscar nominee, Jamal Joseph. For more information and to get involved in next year's competition, visit or email info@boomwriter.media.
About BoomWriter
BoomWriter is an educational technology product of BoomWriter Media, Inc., a leading provider of online collaborative writing solutions and a Google for Education Partner. The collaborative writing site allows students to develop and enhance their writing, reading, vocabulary, and peer-assessment skills on any device. With a presence in more than 45,000 classrooms, BoomWriter's award-winning tools and writing platform are an ideal fit for a variety of learners in grades 2–12, and can be easily integrated into any curricula. BoomWriter also offers premium features that include standards-aligned rubrics, easy grading, and progress monitoring writing analytics. To learn more, please visit BoomWriter.com.
Jacob Hanson
Jacob@prwithpanache.com
50 Sites & Apps for K-12 Education Games
Storillo: Great Platform for Group Writing Projects
Printmakers A to Z
LEGO® Education Announces LEGO® Education SPIKE™ Prime
Free Martin Luther King Day Resource for Teachers, Parents


Manages three car parks in Serrano street, Madrid, on a concession basis.
There are 3,297 parking spaces in all in the three car parks: 947 for the general public and 2,350 for residents.
Excellent pillar-free design that makes it much easier to park vehicles.
The facilities include the latest safety and comfort features for all users.


Like many other Florentine Museums, the Archaeological Museum's sources lie in the Grand Ducal Collections, both of the Medici and the House of Lorraine. Originally shown with other art treasures in the Uffizi, the museum's collections have been shown in their present setting since 1888, slowly building on the richest section, that of Etruscan civilization. As early as the fifteenth century, Cosimo the Elder de' Medici had begun the collection of works in marble and bronze together with humble terracotta crockery, urns and other curiosities.
Again it was Cosimo I who first seriously began to collect such things in the sixteenth century. His successor added such notable works as the Chimera of Arezzo, the Minerva of Arezzo and the Orator. Cardinal Leopoldo de' Medici in the seventeenth century was a particularly assiduous collector who persistently enriched the collections. The House of Lorraine continued, and to them we owe the formation of the very important Egyptian section made up in the main of objects recovered on a Franco-Tuscan expedition early in the nineteenth century.
The Austrian Grand Dukes devoted them selves to the Etruscan section, which was already at that time ordered in series and studied by their court antiquarian. Collecting continued throughout the nineteenth century with important additions like the Sarcophagus of the Amazons or that of Larthia Seianti. To this period belong the initial arrangement of the section of Etruscan topography, of Etruscan sculpture and of the bronzes large and small. Also in the Museum are found glass, precious gems, numerous Greek ceramics and a mixed collection of coins.


text:
Pages 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 9194 result(s) returned
The Delicious History of Chocolate
Do you ever wonder how the Chocolate Chip Cookies in your Ben and Jerry's ice cream were made? When you give your girlfriend little Hershey Kisses on Valentines Day, are you wondering about the other side of the story? When you look up the recipe for that big dark chocolate cake, do you wanna know the secret behind this delicious invention? (06:04)
Pronounce the Muscles (Part 2)
Video has a list of major muscle names, beginning with letters G through M. The narrator pronounces the muscle names, and then allows the student to practice pronunciation. Words are a little blurry. Grades 9-12. 3:29 min.
Best Practices Weekly--A New Key to Reading Comprehension
This teacher made video discusses research regarding reading comprehension. What is really behind reading comprehension especially for struggling readers and older readers? This research followed 3rd graders through 5th graders. Biggest difference between groups was in morphological awareness. This term means how words are put together and how they drive their meaning. This is a great professional development opportunity to improve reading instruction in the classroom. (6:42)
Top 10 'Need-To-Know' Zika Virus Facts
Zika Virus: It's an emerging disease that has spread significantly into Central and South America, and it's causing major alarm at the World Health Organization. (07:31)
2.8.1 Learning about verbs
You and Christine go to a shop to buy a film for your visit to the museum.
Talking about time
Asking for goods and services
Learning about verbs
Using verb forms:
Author(s): María Teresa Cubo Sánchez
Thomas Cole: Painting the American Landscape
Background of the Hudson River School's founder, Thomas Cole. This is a quality 16 minute video that shows his painting, the places he visited, and how he painted. A great video to show students studying Cole, what he painted, his nature painting, and the Hudson River School.
Algemiene Fryske underrjocht kommisje (AFUK)
The Algemiene Fryske Underrjocht Kommisje (AFUK) (General Frisian Education Committee) website is full of useful information and contacts for those who want to learn Frisian or want to know how to use the Frisian language in different social contexts. The site can be accessed in Frisian, Dutch, and English in slightly different versions. The AFUK's main aim is to stimulate the use of Frisian by means of different projects, such as organising Frisian courses (mainly in Friesland) and publishing b
Assaph : studies in art history
Assaph: Studies in Art History is the partial archive of a scholarly full-text ejournal in art history published from 1980 to 2003. At June 2009 there are six full issues online (1996-2001), and tables of contents for three more. The journal was published by the Department of Art History at Tel Aviv University, in English. Example article titles include: 'C.R. Ashbee's Jerusalem Years: Arts and Crafts, Orientalism and British Regionalism'; 'The Non-Presence of People in David Hockney's Pa
1.1.6 Late-onset multifactorial disorders
It is becoming clear that many, if not most, of the common diseases that affect the Western world are multifactorial disorders with some inherited genetic component. Some of the genes that render individuals susceptible to diabetes, coronary heart disease, hypertension and many cancers, including breast cancer, have been identified and can be tested now for the presence of mutations. Multifactorial disorders present a real challenge for genetic medicine. For example, while it may be true that
1.1.5 Late-onset single-gene disorders
An individual might know that a late-onset disease such as Huntington's disease (HD) is present in their immediate family and that they might have inherited the disease gene(s). The problems of genetic testing for HD revolve around the fact that it is pre-symptomatic.
One dilemma is the long delay between testing positive and developing the clinical symptoms of the disorder in middle age. Is it better not to know and live in hope, or as one victim cried 'get it over, I'm so tir
Bringing Together Embedded Analytics and BI Solutions
By: sarastanford Embedded Analytics is the amalgamation of analytical capabilities inside business process applications, in the form of different outputs like dashboards, reports and self service analysis. It is the key technology today, which focuses on infusing reporting and analytic capabilities in transactional business applications.
Build a Scare App for Android
'How many arms will your monster have? How many Legs? Let's spin the wheel and find out!!!Welcome to Build a Scare by Deanavryn Studios.Create a unique 'Scare' (Monster) every time. Choose a background for your Monster. Choose a body. A spinning wheel numbered 1 to 6 is used in turn to choose the number of arms, legs, eyes, noses, mouths and ears to place on your Scare's body.Build a Scare contains beautiful artwork which is matched perfectly with some unique background music and friendly
Amazing Ferrofluid
Ferrofluid is a magnetic liquid. It is composed of tiny nanoparticles of
magnetic material. It flows like a liquid and attracts to a magnet. A
personal favorite.
Exploring Wisconsin Our Home - What We Grow and Where It Goes
What We Grow and Where It Goes - Wisconsin's climate and soils provide prime conditions for agriculture. These natural factors, combined with land use decisions, make agriculture one of the state's most important businesses. The diverse crops produced in Wisconsin connect the state to the global agricultural economy and continually affect the way people in Wisconsin live, work, and use the landscape. This program discusses agriculture's prominent place in Wisconsin's economy, spotlights se
The University of Memphis - Mario
See how your donations to the University of Memphis directly affect the lives of students such as Mario. To see how you can contribute to the education of our students, please visit https://www.memphis.edu/development/
2.12 Faites le bilan: Sessions 6 – 10
Now that you have finished the last five sessions of this course, you should be able to:
Ask and pay for goods and services
Understand and give directions in a building
Understand what is and is not allowed
Identify and use dates
Use expressions of time
3.10 Thinking about the exam
It is worth noting the difference between exam answers and assignments. Inevitably, a much lengthier and more polished answer can be produced in an untimed assignment. In the short time available in the exam, you need to move quickly through your main points, without paying too much attention to your style. Examiners are fully aware of the constraints exams place on the writer. Focus on the question you have chosen, and underline or highlight the process words or instructions in the question.
Defrag Tools: #87 - Windows 8.1 Update | Defrag Tools
In this episode of Defrag Tools, Andrew Richards walks you through the download of the Windows 8.1 Update SDK, the Windows 8.1 Store App Samples, the latest Sysinternals tools, and the Wintellect Package Explorer. We harvest the Debugging Tools for Windows, Windows Performance Toolkit, and Application Verifier files from the SDK.
Windows RT 8.1, Windows 8.1, and Windows Server 201
Author(s): Larry Larsen, Andrew Richards, Chad Beeder
Incredible Photos of Stormy Weather
This one-minute video (photo montage) features an amazing selection of storm photos submitted to My Shot by National Geographic readers and is suitable for all ages. (01:12)
Pages 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460


Male Willow Ptarmigan taking a dust bath at Burntpoint Research Camp in Polar Bear Provincial Park on Hudson Bay, Ontario on 13 July 2012. Dustbaths are an important daily activity for feather maintenance. The background sound is the prevailing northwest wind blowing in from Hudson Bay.


Fully adjustable. Made of human-like, high-quality, synthetic materials. Washable: use warm water an..
Manage and hide hair and ensure a comfortable fit every time! - Easy to apply - Enables your hair t..
This folding wig stand is perfect for storing the wig in it's original form and also allows the hair..


text:
The more you know...
Xbox Play Anywhere FAQ: Everything you need to know on Xbox One and Windows 10
Curious about just what Xbox Play Anywhere is all about? Let's explain.
Richard Devine and Matt Brown
Formally announced as a part of Microsoft's E3 2016 press conference, Xbox Play Anywhere (XPA) launched on September 12 with its first XPA-branded title, ReCore, following similar cross-purchasable games like Killer Instinct. Since its debut, the program has continued to expand on Xbox One and Windows 10, with a range of both first-party and third-party games already onboard. And while the idea behind XPA is relatively straightforward, there are some discrepancies to be considered. Here's everything you need to know about Play Anywhere and its benefits to you as a gamer.
What is Xbox Play Anywhere?
Put simply, Xbox Play Anywhere allows gamers to buy a single digital license for supported titles, for use on Xbox One and Windows 10. Save data and achievements all also automatically synchronize between devices if Xbox Play Anywhere is supported, allowing you to take your games on the go effortlessly.
Do all Xbox games support Xbox Play Anywhere?
No. XPA is an additional feature for games implemented by choice and isn't forced on any Xbox One or Windows 10 titles. That being said, a majority, if not all of Microsoft's upcoming in-house titles support the program. Third-party adoption is increasing, although at a slower rate.
Which games will support Xbox Play Anywhere?
As of publication, nearly 30 games currently support Xbox Play Anywhere, with several more expected to be on the way in the months ahead. All of Microsoft's biggest releases since mid-2016 have supported Play Anywhere, including Gears of War 4, Forza Motorsport 7 and Halo Wars 2. Several ID@Xbox games have also offered support, such as Cuphead, Ruiner, Fable Fortune, and Astroneer. For a full list of supported titles, check our ongoing list linked below.
Complete list of Play Anywhere games for Xbox One and Windows 10
How does Xbox Play Anywhere work?
When purchasing titles that support XPA, their licenses will be automatically bound to your Microsoft account. After purchasing on Xbox One or Windows 10, logging into the same account on any device will allow you download your game for free. Your progress and achievements will also automatically transfer via the cloud.
How to download your Play Anywhere titles on Xbox One and Windows 10
Does Xbox Play Anywhere work with physical copies?
No, it does not. Due to issues which authenticating licenses across platforms, you'll need a digital copy attached to a Microsoft account for the feature to be available. This was explained in more depth by marketing chief for Xbox, Aaron Greenberg.
It is specific to digital because we have to be able to associate your account with the product. When you purchase ReCore digitally in the Windows 10 Store on Xbox One, that game will be tied to your account. When you go between multiple devices, we'll be able to say 'this is your game, this is your game library.' We're only able to do that digitally today.
If you want to take advantage of Xbox Play Anywhere you need to have a digital copy of the game, either by purchasing it directly from the Xbox Store on your console or by using a pre-paid code from a third-party retailer.
What sort of PC do I need for Xbox Play Anywhere?
Playing games on PC has traditionally been a taxing affair, and Play Anywhere titles will be no different. Unlike Xbox One Streaming, all processing is handled onboard your PC, meaning you'll need the appropriate hardware to do so.
Since you're not paying extra for the Windows 10 copy, you'll be no worse off but make sure to check PC hardware requirements through the Windows Store prior to downloading.
Is there cross-play multiplayer with my friends on Xbox or PC?
Not necessarily. Games like Gears of War and Forza already have cross-play between platforms, while titles such as Halo Wars 2 have limited cross-platform implementation. This decision is entirely on a developer's behalf and can vary between genres and studios.
Do I have to use a controller with Xbox Play Anywhere games?
No. On the Xbox One (right now) the controller is your only option, but on PC you can use keyboard and mouse or a controller as long as support is built in.
Do I get double achievements by playing on PC and Xbox?
Just as your game save data is shared between the two, so are your achievements.
Have any questions about Play Anywhere not on this list? Make sure to drop your queries in the comments, and we'll be sure to keep you updated.
Updated September 29, 2017: Added the latest details and tips for Play Anywhere one year after launch.