text:
\section{Randomized SVD and contraction of tensors}

The cost of decomposing (or contracting) tensors is reduced
by a randomized SVD (RSVD) \cite{rand_trunc, 2016arXiv160802148E}.
 In this appendix, we present technical details of RSVD
and how it is used for making projectors $U$ in eq.(\ref{diag_K})
and for three decompositions eqs.(\ref{step1})-(\ref{step3}) in the Triad RG method.

Let $A$ be an $m \times n$ matrix with complex entries.
The SVD provides a decomposition of $A$:
\begin{eqnarray}
A=U\Sigma V^\dag,
\end{eqnarray}
where $U$ and $V$ are $m \times m$  and $n \times n$ unitary matrices, respectively, and
$\Sigma $ is a non-negative diagonal matrix containing singular values in the descending
order, $\Sigma_{ij} =\sigma_i \delta_{ij}$ ($\sigma_1 \ge \sigma_2 \ge \ldots$).
The cost of full SVD is $O(m n l)$ for $l={\rm min}\{m,n\}$.
However, we often need part of SVD such as $k$ largest singular values for $k \ll m,n$.
Then the cost is reduced from $O(m n l)$ to $O(mnk)$ with the RSVD.

For a  given $m\times n$ matrix $A$, $k$ largest singular values and singular vectors
are approximately given by the following procedure (RSVD): \vspace{2mm}

1. Generate an $n\times p$ Gaussian random matrix $\Omega$. \vspace{2mm}

2. Construct an $m \times p$ matrix $Y_A = A \Omega$. \vspace{2mm}

3. Compute QR factorization of $Y_A$ as $Y_A=Q_A R_A$.\vspace{2mm}

4. Construct a small  $p \times n$
matrix $B_A \equiv Q^\dag_A A$.  \vspace{2mm}

5. Compute an SVD of $B_A$  as $B_A=\tilde U \tilde \Sigma \tilde V^\dag$. \vspace{3mm}

\noindent
$p \, (\ge k)$ is a tunable parameter.
Note that $R_A$ is an  $m \times p$ upper triangular matrix and
$Q_A$ is an $m \times m$ unitary matrix (the first $m \times p$ part of $Q_A$
is needed in the fourth step).
We thus obtain a low rank approximation of $A$:
\begin{eqnarray}
A \approx U^\prime \tilde \Sigma \tilde V^\dag
\label{approx_A}
\end{eqnarray}
 where $U^\prime \equiv Q_A \tilde U$.
$k$ largest singular values with singular vectors of $A$ are
approximately given by taking $k$ part of eq.(\ref{approx_A}).
In this sense, $p$ provides an oversampling of the index
$k$ to improve the accuracy of results.

The costs of the second and fourth steps of RSVD are $O(mnp)$,
which are higher than the cost of QR decomposition at the third step $O(p^2m)$
and  the cost of the fifth step $O(p^2n)$. As long as we take
\begin{eqnarray}
k \le p \ll m,n
\label{first_cond}
\end{eqnarray}
the main cost of RSVD, which is $O(pmn)$, is lower than the cost of full SVD.
See \cite{rand_trunc,2016arXiv160802148E}
for a formal discussion of error of RSVD.

The RSVD is also useful to evaluate a matrix product
and to give its low-rank approximation. Let $E$ and $F$ be
$m \times \ell$ and $\ell \times n$ matrices, respectively.
Although the cost of evaluating a matrix product $A=EF$ directly from $E$ and $F$ is $O(mn\ell)$,
a low-rank approximation of $A$ can be given at a lower cost
using the same procedure of RSVD.
At the second step,  we can construct $Y_A$ multiplying $\Omega$ by $E$ and $F$ in turn
instead of $A$. These multiplications take $O((m+n) p\ell)$,
which is smaller than $O(mn\ell)$ under eq.(\ref{first_cond}).
Similarly, the fourth step takes the same cost.
Once $Q_A$ and $B_A$ are obtained,
without the fifth step,
one can give a low rank approximation of $A=EF$ as
\begin{eqnarray}
A_{ij} \approx \sum_{a=1}^p (Q_A)_{ia} (B_A)_{aj}.
\label{mprod_approx}
\end{eqnarray}
Note that  the contraction of rhs takes an $O(mnp)$ cost.
Although the matrix product $EF$ takes $O(mn\ell)$,
we thus find that
it is approximated by rhs of eq.(\ref{mprod_approx}) at a lower cost $O((mn+\ell n + \ell m)p)$ for
\begin{eqnarray}
k \le p \ll \ell,m,n.
\label{second_cond}
\end{eqnarray}
Moreover, the fifth step provides the SVD of $EF$ at an $O((mn+\ell n + \ell m)p)$  cost.

These tricks are used for tensors in the triad RG method.
For the truncated bond dimension $D$,
we basically take $m,n,\ell \ge D^{2}$
and $k=D$ and $p=Ck (= CD)$ where a fixed integer $C$
is referred to as an oversampling parameter in this paper.
Since these parameters satisfy eqs.(\ref{first_cond}) and (\ref{second_cond}) for $D \gg 1$,
the RSVD effectively works.
To estimate the error, we compute a physical value $N$ times
with different random numbers. The result with an error is evaluated
from the central value and  the standard deviation from $N$ trials.

Let us consider a contraction between $4$th order tensor ${\cal M}$
and $5$th order tensor ${\cal U}$:
\begin{eqnarray}
{\cal A}_{zx,aby} \equiv \sum_{c,d=1}^D {\cal M}_{abcd} \, {\cal U}_{cdyxz}.
\label{tensor_contraction}
\end{eqnarray}
Note that $n=D^3,m,\ell=D^2, k=D$ and $p=CD$ in this case and eq.(\ref{second_cond}) is satisfied.
 Although the cost of evaluating ${\cal A}$
from ${\cal M}$ and ${\cal U}$ is $O(D^{7})$,
a low rank approximation of ${\cal A}$  such as eq.(\ref{mprod_approx}) can be given
at a cost of $O(D^6)$. Once ${\cal A}$  is approximately given, applying the RSVD to it
like  eq.(\ref{approx_A}), we obtain
 \begin{eqnarray}

{\cal A}_{zx,aby}
\approx \sum_{g=1}^D G_{abyg} D_{g zx}
\label{tensor_approx}
\end{eqnarray}
with
\begin{eqnarray}
&& G_{abyg} =  \tilde V^\dag_{g,aby} \tilde \sigma_g,\\
&& D_{g xz} = (Q_{\cal A} \tilde U)_{zx,g},
\end{eqnarray}
where $B_{\cal A}=\tilde U \tilde \Sigma  \tilde V^\dag$,
at an $O(D^6)$ cost.
The singular values are included in $G$.
This proves eq.(\ref{step1}).
Eqs.(\ref{step2}) and (\ref{step3}) are derived in a similar manner.

We apply the RSVD to
the $D^2 \times D^2$ matrix $K$ given in eq.(\ref{K}) in order to obtain
$D$ singular vectors $U_{x_1x_2x}$ for $x_1,x_2,x=1,2\cdots,D$.
Note that $m=n=\ell=D^2$, $k=D$ and $p=CD$ in this case and eq.(\ref{first_cond}) is satisfied.
We do not construct $K$ directly since it takes $O(D^6)$.
Instead, we can evaluate $Y_K$ at an $O(D^5)$ cost
multiplying $\Omega$ by $S_i$ and $R_i$ alternately where $\Omega$ is a
$D^2 \times p$ Gaussian random matrix.  The fourth step takes the same cost.
Once $Q_K$ and $B_K$ are given,  $K$ is approximately given at an $O(D^5)$ cost like eq.(\ref{mprod_approx}).
Applying the RSVD to the constructed matrix $K_{x_1x_2,x_3x_4}$ again,
we obtain a low rank approximation of $K$ at an $O(D^5)$ cost like eq.(\ref{approx_A}):
\begin{eqnarray}
K_{x_1x_2x_3x_4} \approx \sum_{x=1}^{D} U^L_{x_1x_2 i} \, \tilde \lambda^L_i \, \tilde U^{L\, \dag}_{i x_3 x_4},
\end{eqnarray}
where $U^L \approx \tilde U^L$.
This procedure can be easily extended to higher dimensions.
We can obtain isometries at an $O(D^5)$ cost with the RSVD in any dimension.

\section{HOTRG}
\label{app:hotrg}
The HOTRG method \cite{HOTRG} with the HOSVD  is reviewed in this appendix.
We will find out that the cost of $d$ dimensional HOTRG
is proportional to  $D^{4d-1}$,
which comes from final contractions with isometries
although the cost of making isometries scales as $D^{2d+2}$.

To introduce the HOSVD, let us first define the inner product for tensors:
\begin{eqnarray}
\langle {\cal T}, {\cal T}^\prime \rangle \equiv  \sum_{i_1,i_2,\cdots,i_n}
{\cal T}^*_{i_1i_2\cdots i_n} {\cal T}^\prime_{i_1i_2\cdots i_n}
\end{eqnarray}
where ${\cal T}$ and ${\cal T}^\prime$ are $n$th order tensors.
The norm of ${\cal T}$ is defined as
$\vert\vert {\cal T} \vert\vert = \sqrt{\langle {\cal T}, {\cal T} \rangle}$.
The HOSVD tells us that an $n$th order tensor  ${\cal T}_{i_1 i_2,\cdots i_n}$
($i_k=1,2,\cdots,N_k$)
may be expressed as
\begin{eqnarray}
{\cal T}_{i_1i_2\cdots i_n} =   \sum_{j_1,j_2,\cdots,j_n}
{\cal S}_{j_1j_2\cdots j_n} U^{(1)}_{i_1 j_1} U^{(2)}_{i_2 j_2}  \cdots U^{(n)}_{i_n j_n}
\end{eqnarray}
Here $U^{(m)}$ is an $N_m \times N_m$ unitary matrix and
${\cal S}_{i_1i_2\cdots i_n}$
is  a core tensor of $T$, which satisfies
 all-orthogonality:
\begin{eqnarray}
\langle {\cal S}_{i_m=\alpha}, {\cal S}_{i_m=\beta} \rangle = 0,   \ \  {\rm for} \ \ \alpha \neq \beta,
\end{eqnarray}
and an ordering property:
\begin{eqnarray}
\vert\vert {\cal S}_{i_m=1}\vert\vert \ge \vert\vert {\cal S}_{i_m=2}\vert\vert
\ge \cdots \ge \vert\vert {\cal S}_{i_m=N_m} \vert\vert \ge 0,
\end{eqnarray}
where $ {\cal S}_{i_m=\alpha}$ is a sub tensor of order $n-1$ with the $m$-th index
$i_m$ of $ {\cal S}$ is fixed to $\alpha$.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=7cm]{./Figure/Fig9.pdf}
 \caption{
A method of evaluating $K$ for a three dimensional square lattice network.
}
\label{fig:proj}
\end{center}
\end{figure}
The renormalization of the HOTRG is carried out for all axes alternately.
$M$ in eq.(\ref{M}) is expressed as eq.(\ref{HOSVD_M})
in terms of the HOSVD.
We evaluate
$K$ defined by eq.(\ref{K})  to give isometries.
Fig.\ref{fig:proj} shows how to create $K$ in three dimensions.
We can make a 4th order tensor $P$ by paying an $O(D^{2d+2})$ cost.
The final step to make $K$ from two $P$s and the diagonalization of $K$
do not need a high cost.
We find that the cost of making $U^L$ (or $U^R$) scales as $O(D^{2d+2})$.

A renormalized tensor is evaluated in a similar way to eq.(\ref{TR}).
In $d$ dimension, the number of isometries $U$ is $d-1$.

\begin{figure}[]
\begin{center}
 \includegraphics[width=7cm, angle=0]{./Figure/Fig10.pdf}
 \caption{
Final contractions in the HOTRG.
}
\label{fig:cont}
\end{center}
\end{figure}
Figure \ref{fig:cont} shows a procedure of making $T^R$ in three dimensions.
$T_U$ is a tensor
made of upper $T$ and $U, V$,
while $T_D$ is one made of lower $T$ and $U^\dag, V^\dag$.
The cost of making $T_U$  (or $T_D$) is $O(D^{4d-2})$ because
their order is $3d-1$ and inner $d-1$ links are contracted.
The contraction between $T_U$ and $T_D$ takes $O(D^{4d-1})$
which is the dominant cost of the HOTRG method.

The costs for isometries and final contractions can be reduced with the RSVD
although systematic errors could be larger.

\section{Extension to higher dimensions}
\label{app:d_Triad_RG}

It is straightforward to extend our method to any $d$ dimension for $d \ge 2$.
We may give a $d$-dimensional triad unit as
\begin{eqnarray}
&& T_{x_1x_1^\prime x_2 x_2^\prime \cdots x_d x_d^\prime } = A^{(1)}_{x_1x_2 a_1} A^{(2)}_{a_1 x_3 a_2}\cdots
A^{(d-1)}_{a_{d-2} x_d a_{d-1}} \nonumber \\
&& \hspace{1cm}  \times A^{(d)}_{a_{d-1} x_d^\prime a_d} \cdots  A^{(2d-3)}_{a_{2d-4} x^\prime_{3} a_{2d-3}}
A^{(2d-2)}_{a_{2d-3} x^\prime_2 x^\prime_1}.
\end{eqnarray}
Then the similar calculation as done in three dimensions tells us that
$K^{(\mu)}$ in the $\mu$ direction ($\mu=1,2\cdots,d-1$),
which is defined as eq.(\ref{Kmat}),
 is given by
\begin{eqnarray}
&& K^{(\mu)} = \tilde S_{\mu-1} S_\mu \cdots S_{d-1} R_{d-1} \nonumber \\
&&\hspace{1cm} \times (\tilde S_{\mu-1} S_\mu \cdots S_{d-2} R_{d} )^T,
\label{K_for_d}
\end{eqnarray}
where
\begin{eqnarray}
(S_n)_{ij,kl} = \sum_{m} A^{(n)}_{imk} (A^{(n)}_{jml})^*,
\end{eqnarray}
and
\begin{eqnarray}
&& \hspace{-5mm}  (\tilde S_n)_{ab,cd}= \sum_{i,j,k} A^{(n)}_{iac} (A^{(n)}_{jbd})^* (\tilde S_{n-1})_{kk,ij}, \\
&& \hspace{-5mm} (R_n)_{ab,cd}= \sum_{i,j,k} A^{(2d-n-1)}_{aci} (A^{(2d-n-1)}_{bdj})^* (R_{n-1})_{ij,kk},
\end{eqnarray}
with $(\tilde S_0)_{ab,cd}=(R_0)_{ab,cd}=\delta_{ac}\delta_{bd}$.
We should note that $\tilde S_n$ and $R_n$ are determined recursively
at an $O(D^5)$ cost.
The cost of evaluating $K^{(\mu)}$ from the matrix products in
eq.(\ref{K_for_d}) is $O(D^6)$ and the cost of diagonalizing $K^{(\mu)}$ is also $O(D^6)$.
We thus find that the power of cost for making isometries does not depend on the dimensionality
but on $O(D^6)$ in any dimension.
This cost is reduced to $O(D^5)$ with the RSVD
as well as the three-dimensional case.

The renormalized tensor $T^R$ for $d$ dimension is given in the
same manner as eq.(\ref{TR}) with isometries $U^{(\mu)}$.
We can show that
\begin{eqnarray}
&& T^R_{x_d x_d^\prime x_1x_1^\prime \ldots x_{d-1} x_{d-1} ^\prime} = \sum_{a,b,c,d}
{\cal D}_{x_d x_1 \cdots x_{d-1} a b } \nonumber \\
&&\hspace{2cm} \times {\cal M}_{abcd} \, {\cal U}_{cd x_2^\prime \cdots x_{d}^\prime x_1^\prime},
\label{TR_triad_for_d}
\end{eqnarray}
where ${\cal M}_{abcd}=\sum_w A^{(d-1)}_{awc}  A^{(d)}_{bwd} $, and $d+2$th order tensor ${\cal U}$
is made of $A^{(d)}$, $A^{(d+1)}$,$\cdots$, $A^{(2d-2)}$ and $U^{(\mu)}$
such as eq.(\ref{U_def}) while ${\cal D}$ is made of the other tensors.
Since  ${\cal U}$ and ${\cal D}$ are tensors of order $d+2$,
the naive memory usage is proportional to $O(D^{d+2})$ if they
are stored directly on the memory.
It is easy to show that these tensors are created at $O(D^{d+3})$ costs
by taking contractions in the appropriate order.
Repeating procedures as shown
in eqs.(\ref{step1})-(\ref{step3}),
one can obtain a triad representation of  $d$-dimensional $T^R$
at an $O(D^{d+3})$ cost.

\section{Introduction}
The tensor network is a promising approach to investigate statistical
systems to which the Monte Carlo method is not easily accessible.
Since this approach is free from the sign problem, it is expected to be an
essential tool to study finite density QCD, the theta vacuum, chiral gauge theories
and supersymmetric models, and the real-time dynamics of field theories.
Since the tensor renormalization group (TRG) was proposed
by Levin and Nave \cite{Levin:2006jai},
it has been improved
\cite{2009PhRvB..80o5131G, Evenbly2015, RandTRG,Nakamura:2018enp, Adachi:2019paf, Lan:2019stu},
and the TRG and some related methods achieve success in studying two-dimensional lattice field theories
\cite
Verstraete:2004zza,
Verstraete:2004cf,
Shimizu:2014uva, Shimizu:2014fsa, Takeda:2014vwa,
Pichler:2015yqa,
Kawauchi:2016xng, Banuls:2016gid, Sakai:2017jwp, Banuls:2017ena, Shimizu:2017onf,  Kadoh:2018hqq,
Kuramashi:2018mmi, Kadoh:2018tis, Bruckmann:2018usp,
Kuramashi:2019cgs, Banuls:2019hzc, Meurice:2019ddf,
Bazavov:2019qih,Banuls:2019bmf}.
However, since it is designed for two-dimensional networks, a new scheme with much less computational cost is
needed in order to study theories on three and four dimensions.

The higher order TRG (HOTRG) \cite{HOTRG} is a typical example of renormalization schemes in higher dimensions.
An isometry is given by
the higher order singular value decomposition (HOSVD),
and  a square lattice network is coarse-grained by taking the contraction between two tensors
with the isometries.
This method is applicable to any $d$ dimension for $d \ge 2$, and
the cost scales as $O(D^{4d - 1})$ where $D$ is the truncated bond dimension of tensors
at renormalization steps.
Recently, another scheme named as an anisotropic TRG (ATRG) was proposed in \cite{Adachi:2019paf}.
Although the cost is reduced to $O(D^{2d + 1})$ with a randomized singular
value decomposition (RSVD) (See \cite{rand_trunc,2016arXiv160802148E}) or other truncation method,
it has larger errors than the HOTRG for fixed $D$.
So further studies for making an algorithm with small costs and higher accuracy are needed.

In this paper, we propose a new tensor renormalization scheme
by defining it on a tensor network made
only of third order tensors.
That network and renormalization groups on it, which are referred to as a triad network
and Triad RGs in this paper,
respectively, are not uniquely determined.
We give an example of Triad RGs improving a HOTRG-type renormalization on a triad network.
The computational cost is drastically reduced since building blocks of our method are third order tensors.
We find that the order of cost for making an isometry does not depend on the dimensionality, but on $O(D^6)$
in any $d$ dimension ($d\ge 2$).
This is reduced to $O(D^5)$ with the RSVD.
The main cost comes from the contraction of making a renormalized tensor with isometries,
which scales as  $O(D^{d+3})$ with the RSVD.
Then a naive memory usage is proportional to  $O(D^{d+2})$ if intermediate tensors
of order $d+2$ are stored on a computer.
We test our method in three-dimensional Ising model and find that numerical results
are obtained for larger $D$s with reasonable errors.

This paper is organized as follows. We firstly present our algorithm in three dimensions.
Then we test it in three-dimensional Ising model and compare results to those obtained
from the HOTRG and the ATRG.
The RSVD used in our method, a review of HOTRG with HOSVD and
an extension to $d$ dimension are presented
in appendices.

\section{Algorithm}
We begin with presenting our algorithm in three dimensions
starting from a square lattice network made of
a sixth order tensor $T_{ijklmn} \in \mathbb{C}$,
where all indices $i,j,\cdots$ run from $1$ to $N$.
An extension to any dimension is given in the appendix.
Without loss of generality, $T$ may be expressed as
a canonical polyadic decomposition (CPD):
\begin{eqnarray}
T_{ijklmn} = \sum_{a = 1} ^r
W^{(1)}_{a i}
W^{(2)}_{a j}
W^{(3)}_{a k}
W^{(4)}_{a l}
W^{(5)}_{a m}
W^{(6)}_{a n}
\label{cpd}
\end{eqnarray}
where $r$ takes a minimum value in the canonical form,  which is called a tensor rank of $T$.
A tensor is derived in this form for lattice models with nearest neighbor interactions in general.

The tensor network of $T$ is defined
on a three dimensional squared lattice  $\Gamma=\{(n_1,n_2,n_3)| n_i \in \mathbb{Z}\}$:
\begin{eqnarray}
Z= {\rm Tr}  \prod_{n \in \Gamma} T_{x_n x^\prime_n y_n y^\prime_n z_n z^\prime_n}
\label{eq:z}
\end{eqnarray}
where $x_n$, $x_n^\prime$, $y_n$, $y_n^\prime$, $z_n$, $z_n^\prime$
are indices defined on links stemmed from the site $n$.
These indices satisfy
$x^\prime_n=x_{n+\hat 1}$, $y^\prime_n=y_{n+\hat 2}$, $z^\prime_n=z_{n+\hat 3}$
where $\hat \mu$ stands for the unit vector of $\mu$ direction.
${\rm Tr} $ denotes the summation of all indices.
All tensors live on sites and  any link shared by two tensors is contracted.

The computational cost of tensor renormalization
for $d$ dimensional square lattice network is high
when $d$ increases in general because the contraction between two $2d$th order tensors
takes a high cost. In order to reduce the cost,
we formulate a renormalization group on a network made only
of third order tensors.

\begin{figure}[htbp]
\begin{center}
  \includegraphics[width=8cm, angle=0]{./Figure/Fig1.pdf}
 \caption{
Triad representation of $T$.
}
\label{fig:3rank}
\end{center}
\end{figure}

It is possible to express $T$ as a product of four $3$rd order tensors $A,B,C,D$:
\begin{eqnarray}
&& T_{x x^\prime y y^\prime z z^\prime} =
\sum_{a,b,c=1}^r
A_{x y a}
B_{a z b}
C_{b z^\prime c}
D_{c y^\prime  x^\prime},
\label{triad_unit}
\end{eqnarray}
where
\begin{eqnarray}
&& A_{xya}  \equiv W^{(1)}_{ax} W^{(2)}_{ay}, \\
&& B_{azb}  \equiv  \delta_{ab} W^{(3)}_{az}, \\
&& C_{bz c}  \equiv  \delta_{bc} W^{(4)}_{bz}, \\
&& D_{cyx}  \equiv W^{(5)}_{cy} W^{(6)}_{cx}.
\end{eqnarray}
Eq.(\ref{triad_unit}) is referred to as
a {\it triad} representation in this paper.
Note that it is not unique.
Fig.\ref{fig:3rank} shows a triad representation of $T$ shown in eq.(\ref{triad_unit}).
Solid lines denote the external indices $x,y,z,\ldots$ and dotted lines denote the internal
indices $a,b,c$.
The tensor network $Z$ may be regarded as a network made only of third order tensors $A,B,C,D$
by replacing $T$ with a triad unit (\ref{triad_unit}) as shown in  Fig.\ref{fig:triad_network}.
We also refer it to as a triad network.
\begin{figure}[htbp]
\begin{center}
  \includegraphics[width=7cm, angle=0]{./Figure/Fig2.pdf}
 \caption{
Square lattice network $(a)$ and triad network $(b)$.
}
\label{fig:triad_network}
\end{center}
\end{figure}

From now on, we assume that all internal and external indices, $a,b,c,...$ and $x,x^\prime,...$,
run from $1$ to $D$ for $D \ge r,N$.
In renormalization steps,
$D$ is a truncated bond dimension of triads $A,B,C,D$.
Although a different size may be taken for internal indices
to improve the accuracy of results,
a common $D$ is employed and
$\sum_{i=1}^D$ is denoted  as $\sum_i$ in the following for simplicity.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=7cm, angle=0]{./Figure/Fig3.pdf}
 \caption{
$M$ in two triads. $(b)$ is another representation of $(a)$.
}
\label{fig:M}
\end{center}
\end{figure}
We now consider a coarse-graining procedure of a Triad RG.
A renormalization along the $z$ direction
is carried out by combining two tensors as well as HOTRG:
\begin{eqnarray}
M_{X X^\prime Y Y^\prime  z z^\prime }
=\sum_{w} T_{x_1 x_1^\prime y_1 y_1^\prime w z   } T_{x_2 x_2^\prime y_2 y_2^{\prime} z^\prime w},
\label{M}
\end{eqnarray}
where $X=x_1 \otimes x_2$ and $Y=y_1 \otimes y_2$.
Fig.\ref{fig:M} shows $M$ in the triad representation.
The HOSVD gives
\begin{eqnarray}
&& M_{XX^\prime YY^\prime zz^\prime} = \sum_{I,J,K,L=1}^{D^2} \sum_{m,n=1}^D
S_{I JKLmn}  \nonumber \\
&& \qquad \times U^{L}_{XI} \, U^{R}_{ X^\prime J } \, V^{L}_{ YK} \, V^{R}_{Y^\prime L }
\, W^{U}_{mz} \, W^{D}_{nz^\prime}
\label{HOSVD_M}
\end{eqnarray}
where $S$ is the core tensor of $M$ and $U, V,W$ are unitary matrices.
See appendix for the detailed definition of HOSVD.
$U$ and $V$ are used for coarse-graining the network but $W$ are not needed.

To evaluate $U^L$ associated with the $x$-axis, we interpret
$M$ as a matrix $M^\prime_{X,\, X^\prime Y Y^\prime z z^\prime} (\equiv M_{X X^\prime Y Y^\prime z z^\prime}) $
with the row index $X$ and the column index $(X^\prime, Y,Y^\prime, z, z^\prime)$.
Then $U^{L} $ is a unitary matrix that diagonalizes
a hermitian matrix
\begin{eqnarray}
K \equiv M^\prime {M^\prime}^\dag
\label{Kmat}
\end{eqnarray}
as
\begin{eqnarray}
K_{x_1x_2x_3x_4} = \sum_{I=1}^{D^2} U^L_{x_1x_2 I} \, \lambda^L_I \, U^{L\, \dag}_{I x_3x_4},
\label{diag_K}
\end{eqnarray}
where $\lambda_I$ are eigenvalues sorted in the descending order,
$\lambda^L_1 \ge \lambda^L_2 \ge \cdots \ge \lambda^L_{D^2} \ge 0$.
The cost of making $K$, which is ${\cal O}(D^{2d+2})$ in the HOTRG
as reviewed in the appendix,
is drastically reduced on the triad network.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=7cm, angle=0]{./Figure/Fig4.pdf}
 \caption{
How to make $K$ in the triad representation.
}
\label{fig:3rank_proj}
\end{center}
\end{figure}
Fig.\ref{fig:3rank_proj} shows a methodology of making $K$ using the triad representation.
In Fig.\ref{fig:3rank_proj} (a), $K$ is represented as a product of $M$ (Fig.\ref{fig:M} (b))
and $M^\dag$ which is a mirror image of $M$.
Fig.\ref{fig:3rank_proj} (b) is obtained by contracting inner lines connecting $M$ and $M^\dag$
from Fig.\ref{fig:3rank_proj} (a).
When $K$ is expressed as a matrix $K^\prime_{x_2 x_4, x_1 x_3}(\equiv K_{x_1x_2x_3x_4})$
with row index $x_2,x_4$ and column index $x_1, x_3$,
we have
\begin{eqnarray}
 K^\prime = S_1  \cdot S_2  \cdot R_2  \cdot R_3^T  \cdot {S_1}^T,
 \label{K}
\end{eqnarray}
with hermitian matrices,
\begin{eqnarray}
&& {(S_1)}_{x x^\prime, d d^\prime} = \sum_{y} A_{x y d} A^*_{x^\prime y d^\prime}, \nonumber \\
&& {(S_2)}_{dd^\prime, ee^\prime}  = \sum_{z} B_{d z e} B^*_{d^\prime z e^\prime}, \\
&& {(R_2)}_{ee^\prime, ww^\prime}  = \sum_{f,f^\prime}  C_{ewf}
C^*_{e^\prime w^\prime f^\prime}
\cdot
 \sum_{x,y}  D_{f yx} D^*_{f^\prime yx},
\nonumber  \\
&& {(R_3)}_{aa^\prime, ww^\prime}  = \sum_{b,b^\prime} B_{awb}
B^*_{a^\prime w^\prime b^\prime}
\cdot \sum_{z} (R_2)_{bb^\prime,zz}.
\nonumber
\end{eqnarray}
Fig.\ref{fig:3rank_proj} (b) can be obtained at an ${\cal O}(D^5)$ cost without any approximation since
$S_i$ and $R_i$ are computed at this cost.
In Fig.\ref{fig:3rank_proj} (c), $K$ is obtained
computing matrix products of
eq.(\ref{K}), which takes an ${\cal O}(D^6)$ cost.

We thus obtain $U^L$ at an $O(D^6)$ cost by diagonalizing
the obtained $K$.
The cost of making $K$ and $U^L$ can be reduced to $O(D^5)$ applying
the RSVD to eq.(\ref{K}) (Fig.\ref{fig:3rank_proj} (b)), as shown in the appendix.
The order of cost of making $U$  does not depend on the dimensionality
in the triad representation.

The other unitary matrix $U^R$ can also be prepared in the similar manner.
We choose each one of $U^L$ and $U^R$ to improve the accuracy of results
by comparing the remaining eigenvalues \cite{HOTRG},
\begin{eqnarray}
\epsilon_Q = \sum_{i>D} \lambda^Q_i,  \quad {\rm for} \ \ Q=L, R
\end{eqnarray}
where $\lambda^R$ are eigenvalues of $K^\prime$
with a different matrix representation
$M_{X^\prime, X Y Y^\prime z z^\prime} (\equiv M_{X X^\prime Y Y^\prime z z^\prime}) $.
$U=U^L$ for $\epsilon_L < \epsilon_R$ and $U=U^R$ for the others.

A renormalized tensor is defined by
\begin{eqnarray}
\hspace{-2mm}
 T^R_{zz^\prime xx^\prime yy^\prime} \equiv \hspace{-3mm}
\sum_{X,Y,X^\prime,Y^\prime} \hspace{-2mm}
U^\dag_{xX}  V^\dag_{yY}
M_{XX^\prime YY^\prime zz^\prime}  U_{X^\prime x^\prime}  V_{ Y^\prime y^\prime} \ \
\label{TR}
\end{eqnarray}
where $U$ is $U^L$ (or $U^R$) and   $V$ is $V^L$ (or $V^R$) which are chosen from a comparison
of $\epsilon_L$ and $\epsilon_R$.
The combined indices $x,x^\prime,y,y^\prime$ run from $1$ to $D$
by truncating $D^2$ eigenvalues (functions) to $D$ largest ones.

In the triad representation, we have
\begin{eqnarray}
&& T^R_{zz^\prime xx^\prime yy^\prime} = \sum_{a,b,e,f}
{\cal D}_{zxya e } {\cal M}_{aebf} \,
{\cal U}_{bf y^\prime z^\prime x^\prime},
\label{TR_triad}
\end{eqnarray}
where
\begin{eqnarray}
&& {\cal U}_{ab yzx}= \sum_{c,p,q,p^\prime, q^\prime}
C_{az c}
D_{c qp} U_{pp^\prime x}
D_{b q^\prime p^\prime} V_{q q^\prime y},
\label{U_def}
\\
&& {\cal M}_{abcd} = \sum_{w}  B_{awc} C_{bwd},\\
&& {\cal D}_{zxyab}= \sum_{d,p,q,p^\prime, q^\prime} B_{dzb}
U^*_{pp^\prime x} A_{p q a}
V^*_{q q^\prime y} A_{p^\prime q^\prime d}.
\end{eqnarray}
Note that the cost for making ${\cal M}$ is $O(D^5)$ while
that for ${\cal U}$ and ${\cal D}$ is $O(D^6)$, which can be found
by taking five contractions in the order of $(p,q^\prime)$ $\rightarrow$ $(p^\prime,q)$ $\rightarrow$ $c$ (or $d$)
keeping intermediate fourth order tensors.

Fig.\ref{fig:3rank_cont} shows how to create $T^R$.
Fig.\ref{fig:3rank_cont} (a) and (b)  show eq.(\ref{TR})  and eq.(\ref{TR_triad}), respectively.
\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=8cm]{./Figure/Fig5.pdf}
 \caption{
Contraction of two triad units.
}
\label{fig:3rank_cont}
\end{center}
\end{figure}
Although a naive contraction between ${\cal M}$ and ${\cal U}$ in eq.(\ref{TR_triad}) takes $O(D^7)$,
as presented in appendix, the RSVD provides an approximated decomposition
at an $O(D^6)$ cost:
\begin{eqnarray}
\sum_{c,d} {\cal M}_{abcd} \, {\cal U}_{cdyxz} \approx \sum_{g} G_{abyg} D^\prime_{gxz}
\label{step1}
\end{eqnarray}
where $D^\prime_{ijk}$ is a unitary matrix with the row $i$ and the column $j,k$
in terms of the full SVD and $G$ is a 4th order tensor in which the singular values are included.
In Fig.\ref{fig:3rank_cont} (c), the black circle implies that $G$ contains
the singular values.

Then applying the RSVD to  remaining contractions in eq.(\ref{TR_triad})
in the similar manner,
we obtain another approximated decomposition at a cost of $O(D^6)$:
\begin{eqnarray}
\sum_{a,b} {\cal D}_{zxya b} G_{ab y^\prime g}  \approx
\sum_{e} A^\prime_{zxe} {\cal M}^\prime_{eyy^\prime g}
\label{step2}
\end{eqnarray}
where $A^\prime_{ijk}$ is a unitary matrix with the row $i,j$ and the column $k$
in terms of the full SVD and ${\cal M}^\prime$ is a
fourth order tensor in which the singular values are absorbed.
Fig.\ref{fig:3rank_cont} (d) represents this decomposition.
The SVD finally provides
\begin{eqnarray}
{\cal M}^\prime_{eyy^\prime g} \approx \sum_{f} B^\prime_{eyf} C^\prime_{fy^\prime g}
\label{step3}
\end{eqnarray}
at an $O(D^6)$ cost, as shown in Fig.\ref{fig:3rank_cont} (e).
The RSVD reduces this cost to $O(D^5)$.

Plugging eqs.(\ref{step1})-(\ref{step3}) into  eq.(\ref{TR_triad}),
we thus find that $T^{R}$ is approximately given
by a renormalized triad unit:
\begin{eqnarray}
&& T^R_{zz^\prime x x^\prime y y ^\prime} \approx \sum_{a,b,c}
A^\prime_{z x a}
B^\prime_{a y b}
C^\prime_{b y^\prime c}
D^\prime_{c x^\prime  z^\prime}.
\label{renormalized_triad_unit}
\end{eqnarray}
An extra axis rotation is not needed since  $x,y,z$ of eq.(\ref{triad_unit}) is replaced by $z,x,y$ in
(\ref{renormalized_triad_unit}).
In three dimensions, the computational cost of the Triad RG method is $O(D^6)$,
and a memory usage is naively $O(D^5)$, which comes from the fifth order tensors ${\cal U,D}$.
Repeating this procedure again and again, triad networks can be coarse-grained
at this cost keeping the triad representation.

An extension to any $d$ dimension is presented in the appendix.
Decompositions such as
eq.(\ref{step1}) take   $O(D^{d+3})$ as ${\cal U}$ and ${\cal D}$ are tensors of order $d+2$,
which is the main cost of our Triad RG method.
The memory usage is naively $O(D^{d+2})$
if ${\cal U}$ and ${\cal D}$ are stored in the memory.

We make a remark on improvements of the Triad RG method
in the rest of this section.
As shown in Fig.\ref{fig:3rank_cont} (c)-(e),
the singular values denoted as the black circles are inherited
to the next decomposition, as done in the ATRG.
The best accuracy is achieved with this treatment
as long as we tried.
Although we have presented a $O(D^{d+3})$ procedure for the contraction part,
we can easily create another procedure with an $O(D^5)$ cost
neglecting the accuracy of results.
For instance, decomposing ${\cal M}$ in eq.(\ref{TR_triad}) directly
or swapping indices of tensors with the RSVD can reduce
a naive cost.
We found that these additional SVDs do not work well
for the three dimensional Ising model. This could be because
such SVDs are optimized only for local tensors and the accuracy
for the whole two triad units
is lost.
However, since there are many variants in the contraction part of our method,
further studies are needed to improve the Triad RG method.

\section{A Numerical test}
We test the Triad RG method in three dimensional Ising model on a periodic lattice
with the volume $V = (32768)^3=(2^{15})^3$
at the critical temperature $T_c = 4.5115$ \cite{critem_1,HOTRG,Adachi:2019paf}.
The Hamiltonian is given by
\begin{eqnarray}
H=-\sum_{ \langle i,j \rangle} \sigma_i \sigma_j,
\end{eqnarray}
where $\langle i,j \rangle$ denotes all possible nearest neighbor pairs of lattice sites.
The partition function $Z={\rm Tr}(e^{-\beta H})$ with the inverse temperature $\beta=1/T$
can be expressed as a triad network eq.(\ref{triad_unit})
with $N=r=2$ and $W^{(\mu)} \equiv W$ given by
\begin{eqnarray}
W=
\begin{pmatrix}
  \sqrt{\mathrm{cosh}(\beta )} & \sqrt{\mathrm{sinh}(\beta)} \\
  \sqrt{\mathrm{cosh}(\beta)} & -\sqrt{\mathrm{sinh}(\beta)}
\end{pmatrix}.
\end{eqnarray}
Note that initial 3rd order tensors $A,B,C,D$ are real and satisfy
$A_{xya} = D_{ayx} $ and $ B_{azb} = C_{azb} $.

The free energy is evaluated by $F=-\frac{1}{\beta} {\rm log} Z$.
We take $C=4$ for the oversampling parameter of RSVD
(See the appendix for details of RSVD).
The numerical computation is carried out with 2.7 GHz Intel Core i7
and a library {\it Eigen} for matrix decompositions,
and each computation ends in a few hours.

Numerical results are compared to those obtained from the HOTRG and the ATRG.
The first version of ATRG is implemented by
the RSVD with twice a larger bond dimension $2D$
only for the swapping step.
In the Triad RG, an $O(D^5)$ isometry is prepared with the RSVD.
The computational cost of HOTRG, ATRG, and Triad RG methods
are theoretically $O(D^{11})$, $O(D^7)$, and $O(D^6)$ in three dimensions, respectively.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=5cm, angle=0]{./Figure/Fig6.pdf}
 \caption{
$D$-dependence of free energy
in 3d Ising model at $T_c$.
}
\label{fig:Free_D}
\end{center}
\end{figure}
Fig.\ref{fig:Free_D} shows the $D$-dependence of free energy.
The accessible $D$ is different among the three methods.
Three results decrease toward values around  $F = -3.51$
as $D$ increases.
The Triad RG has well-controlled errors for larger $D$s and shows good convergence.

We extrapolate our result of the Triad RG to the large $D$ limit using a fit function $a + bD^{-c}$
with fitting variables $a,b,c$.
To obtain a precise fit result, we compute the free energy $n$ times with different random numbers of the RSVD
($n=100$ for $D\leq 24$ and $n=4$ for  $D > 24$),
and use an average value of $n$ trials with error estimated from the standard deviation for the fit.
The result for $10 \leq D \leq 56$ is $a = -3.5093(2)$, which is shown
as a dotted line in Fig.\ref{fig:Free_D}.
We confirm that this result is stable by changing fit range to $20 \leq D \leq 56$.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=5cm, angle=0]{./Figure/Fig7.pdf}
 \caption{
Free energy as a function of computational time.
}
\label{fig:Free_err}
\end{center}
\end{figure}
Fig.\ref{fig:Free_err} shows the free energy against the computational time needed to compute the free energy once.
This figure implies that the Triad RG converges faster than the other methods
for the same computational time.

\begin{figure}[htbp]
\begin{center}
 \includegraphics[width=5cm, angle=0]{./Figure/Fig8.pdf}
 \caption{
Computational time against $D$.
}
\label{fig:time}
\end{center}
\end{figure}
In Fig.\ref{fig:time}, the computational time is shown as a function of $D$.
Since the theoretical $D$-dependence is properly reproduced at a practical level,
one can consider that the Triad RGs will open a door to studying
a wide class of higher dimensional field theory with tensor networks.

\section*{Acknowledgments}
We would like to thank
Shinichiro Akiyama, Pochung Chen, Karl Jansen, Ying-Jer Kao, Yoshinobu Kuramashi, C.-J. David Lin, Tomotoshi Nishino, Hideaki Oba,
Ryo Sakai, Manuel Schneider,
Amit Singh, Shinji Takeda, Hiroshi Ueda and Yusuke Yoshimura
for their valuable comments.
D.K. is supported by JSPS KAKENHI Grant JP19K03853 and
the National Center for Theoretical Sciences at National Tsing-Hua University.
K.N. is supported partly by the Grant-in-Aid for Japan Society for the Promotion of Science Research Fellow (No. 18J11457).

redpajama_set_name: RedPajamaArXiv


in the Staten Island set "The Family Web."
THE SCOOP: "Web" is a Generation X tale about a dysfunctional family that centers on two siblings. Blake (a beer-loving, angry guitarist played by Bello) and Jenna (Blake's younger, sexually confused sister). New York playwright veteran Rob Locke directs from a screenplay written by Tim Burrows.
LOCATIONS: Hard-rocking residents of Staten Island have reason to get excited when the film shoots scenes of the band Big Fat Cadillac (featuring Jewel on the keyboards) playing "Dark Blue" at the Cave (700 Van Duzer), a steamy, Gothic"
LOUNGING GROUNDS: Besides Staten Island's the Cave (which boasts Van Halen tribute bands and college night every Wednesday), look for cast and crew nearby grabbing slices of vodka pizza at Goodfella's Brick Oven Pizza (1718 Hyland Blvd.) or sipping beer at casual Bavarian beer hall Kilmeyer's (4254 Arthur Hill Rd.).


I figured out why my XML parsing code works fine using the pure-Python ElementTree XML parsing module but fails when using the speedy and memory-optimized cElementTree XML parsing module.
The XPath 1.0 specification says '.' is short-hand for 'self::node()', selecting a node itself.
See how the result of node1.find('.') is the node itself? As it should be.
Balls. The result of node2.find('.') is None.
Kludgey because './' is not a valid XPath expression.
So we are back on track. Also works for Python 2.6 which has the same version of ElementTree.
So I can't code something that works for all three versions. This is annoying. I was hoping to just replace ElementTree with the C version, makes my code run in one third the time (the XML parts of it run in one tenth the time). And cannot install any compiled modules – the code can only rely on Python 2.5's standard library.
This entry was posted in Blog and tagged python, xml on 8 September, 2011 by david.


Registered nurse job description example.
Typical nursing duties vary according to the area of specialization. This job description clearly lists the general tasks and responsibilities involved in the overall nursing care of patients.
Select the relevant duties and job requirements to develop a job description for your specific nursing job.
Assess, plan, implement and evaluate nursing care plans to facilitate optimal patient care.
Use this RN job description as a basis for formulating your own specific nursing job description.
Include a professional nursing cover letter with your job application.
Adapt this job description to clarify the registered nurse requirements for the specific job.
Indeed.com reports that the average salary for Nurse RN jobs on the website as of March 2019 is $32.00 per hour.


text:
Константа Ганша () — міра здатності розчинника до гідрофобних (ліпофільних) взаємодій, заснована на коефіцієнті розподілу розчиненого (Р) між 1-октанолом та водою. Застосовується в кореляційному аналізі, при цьому поведінка заміщених бензенів можна описати π-константами замісників, що визначаються подібно до констант Гаммета:

π= log P– log P0,

де Р0 — коефіцієнт розподілу між органічною та водною фазами для незаміщеної сполуки, Р — те саме для заміщеної за однакових умов. Є різні шкали π-констант замісників залежно від взятої за стандарт серії речовин.

Література

Хімічна термінологія

redpajama_set_name: RedPajamaWikipedia


text:
Q: Django forms Decimal field not parsing 0 I am using Django forms in my openstack horizon.
Have created the new form for processing the values for updating a certain details in DB.
Form is for updating the certain values in DB.
So I will enter the values for paid_cost, balance_cost, paid_status and payment_status.
Based on the form values entered that will be updated.
Form field is as follows:
invoice_id = forms.CharField(label=_("Invoice ID"),  widget=forms.TextInput(attrs={'readonly':'readonly'}), required=False)
paid_cost = forms.DecimalField(label=_("Paid  Cost"), min_value=0, max_digits=32, decimal_places=2)
balance_cost = forms.DecimalField(label=_("Balance  Cost"), min_value=0, max_digits=32, decimal_places=2)
paid_status = (('0', 'New'), ('1', 'Paid'), ('2', 'Declined'), ('3', 'Refunded'))
payment_status = forms.ChoiceField(choices=paid_status, required=True )

Following is the action for updating the DB.
invoice = cloudkitty_conn.reports.update_invoice(invoice_id=data['invoice_id'], payment_status=data['payment_status'], paid_cost=data['paid_cost'], balance_cost=data['balance_cost'])

So I am facing the issue here with updating of field such as paid_cost and balance_cost.
Scenario 1 works fine which is as follows:
paid_cost = 2.50
balance_cost = 2.25

For this sample data it is working fine.
DB value updated as needed.
mysql> select * from invoice_details \G;
*************************** 1. row ***************************
                 id: 3
          tenant_id: 12fabdf1e7744e91b0a1c3ee511f876d
        tenant_name: demo
         invoice_id: demo-3-2016
         total_cost: 4.75
          paid_cost: 2.50
       balance_cost: 2.25
     payment_status: 0

Scenario 2 is not working fine, details were as follows:
paid_cost = 4.75
balance_cost = 0.00

See after adding this values, DB value for balance_cost not changed:
mysql> select * from invoice_details \G;
*************************** 1. row ***************************
                 id: 3
          tenant_id: 12fabdf1e7744e91b0a1c3ee511f876d
        tenant_name: demo
         invoice_id: demo-3-2016
         total_cost: 4.75
          paid_cost: 4.75
       balance_cost: 2.25
     payment_status: 0

To be more clear issue is occurs when we are entering value as 0 or 0.00.
Someone let me know if there is any issue which is already there regarding this Django forms Else I will check in my code itself for any issues

redpajama_set_name: RedPajamaStackExchange


The following post was co-authored by EdTechTeacher's Beth Holland & Tracy Sockalosky and first appeared on Edudemic.
At its most basic level, Google Docs provides students with a foolproof means to access their work from any device. For those who may struggle with organization or keeping track of class materials, Google Docs virtually eliminates the problem. The I lost my assignment can be removed from the equation since Docs automatically save and are searchable from within a Drive account.
Docs do not have to be used only for assessments. Consider the value of collective note taking during class to create a larger body of knowledge. In a traditional setting, when each student takes notes independently, ideas and connections could be lost in a physical or digital binder – or not included at all. With shared notes, the potential exists to find those connections and then carry the class exploration in a new or different direction, as well as to support those students who may not capture all of the information the first time.
Imagine having the ability to know your students' comprehension level before they walk into class or immediately after you introduce a new concept. Google Forms gives you an easy way to do just that. Whether you create a standard survey to use as an Exit Ticket or even a "mood check-in" as used by Ms. Magiera on her math blog, Google Forms provides formative assessment data. A recent update included the ability to add images to Forms, so questions could relate to illustrations, graphs, diagrams, maps, and more. Additionally, by using forms rather than a paper-based assessment, students who may need reading support can leverage text-to-speech features on their device to hear the questions independently.
"The fact of the matter is that good writing is conversational, and the best way to help a student rethink and revise their writing is through personal conversation." writes Joe Taylor, Instructional Technology Coordinator for High School District 214 in Buffalo Grove, IL.
What if your students could hear your thoughts as you read their work and provided input? With Voice Comments, a Chrome app that works with Google Docs, that is now possible.
While some students may prefer to read your annotations, others may benefit from more of a dialog. Consider the value of having students leave Voice Comments during peer review. Google docs makes it easy to leave text comments throughout the process; however, those remarks do not include tone of voice or inflection. With Voice Comments, students can receive feedback with another dimension as well as with the modality that best fits their learning needs.
Especially with elementary students, working between multiple browser tabs or windows can become a difficult and distracting process. With Research Tools – available in Google Docs, Spreadsheets, and Presentations – students can search from within their project to find images, video, quotes, or references. Not only can links and media quickly be inserted from the research pane, but citation information can also be added as footnotes.
To access the research tool, look in the Tools menu from inside any Docs, Spreadsheets, or Presentations. There are even options to search by Creative Commons License for images. If using either Chrome or Firefox, you can even drag images directly into place.
Debates about the effectiveness of multitasking notwithstanding, the need to limit distraction is something that most students experience at some point. WriteSpace, a customizable text editor, enables students to write on a distractionless screen: no formatting ribbons or chat boxes to draw the attention away from the writing!
Written work is stored locally, as well as online, making it available any time the application is open, regardless of Internet connectivity. The actual writing space is customizable in terms of fonts and colors. With word count embedded at the bottom of each page, the need to toggle to between pages or applications is further reduced. Sometimes this simple change can enable a student to engage in the writing process and the words that he or she types onto the page.
The days of students picking up a dictionary are long gone, and the likelihood of students switching over to a new browser tab to search a word's definition is also diminishing rapidly. Students will often rely on the synonyms or whatever is available with the magical right-click. Thanks to Google Dictionary and Image Dictionary, this right-click will yield far more useful information than a synonym. As seen in the image to the right, the dictionary pops up in the yellow box. Students can even choose to have an image appear as well, all within the same screen. For many, this imagery provides the necessary support to comprehend what is being read. Additionally, this is also great support for science and social studies readings, saving ample time from having to tab over to another site or online encyclopedia to search for a picture of a person, animal, organism, map, etc.
As classroom teachers, we are eager to provide access to the curriculum for ALL students – not just those on IEPs. Assistive technology, while essential for some students, is often extremely expensive and therefore only made available to students with documented learning disabilities. Read&Write is the exception! An extension that can be added through the Chrome Store, Read&Write works from a toolbar within Google Docs (see image below), and provides tools that are useful for all learners, including a robust dictionary, image dictionary, fact finder, translator, and text-to-speech tool for use within a Google Doc.
All of these tools are extremely helpful, but the utility that makes the extension the most powerful is its ability to gather, sort and extract highlighted text. Using the "text background color" button in the Google Drive formatting ribbon, students can highlight as many things as they like, with whichever colors they choose, before pressing the extract button in the Read&Write strip. Highlighted material then appears in a popup window, sorted either by highlight color or order (student choice in the popup window), so that it can be copied to the clipboard and pasted wherever the student chooses.
As an independent learning tool, Read&Write provides students with an efficient and productive means to take notes from documents (study guides, preparation for presentations, questions to ask the teacher, etc.). It also creates numerous possibilities as a teaching tool to scaffold learning: use the colors for reciprocal reading roles, create grammar and parts of speech lessons, teach the concept of more important and less important information, etc. The possibilities for this tool are extensive.
There are a few critical elements that make flipped learning a successful opportunity for students: they set the pace, chose the time & place to watch, and have opportunities to reflect on what they are intended to learn. Not always so simple! Students often struggle to keep pace with a video, and simply rewatching does not always facilitate the learning.
Students may or may not take notes. If organized, they will be able to located their notes at a later date; however, when they review, students may completely forget the video reference, and therefore the notes are not as useful.
VideoNot.es provides the tools to scaffold the flipped learning process. While the video appears on the left side of the screen, a notes box sites on the right – no toggling required! The notes automatically store in Drive, eliminating lost notes syndrome. Additionally, when the student takes a note, it attaches itself to a timestamp of the movie, making reviewing notes, and the correlating video segments, a snap. Students can also change the speed of the video, which can be particularly helpful when watching demos and tutorials.
With Google Moderator, the potential exists to give all students a voice. Oftentimes, we miss the opportunity for thoughtful discourse within the construct of the classroom. Google Moderator empowers all students to ask questions, submit topics or ideas for discussion, and engage in thoughtful conversation. As Shawn states, through the use of technology, those who may be more introverted now have the opportunity to rise as leaders. The tutorial below offers more ideas about the mechanics of using Moderator in the classroom.
Seamless collaboration, efficient classroom management, flexible formative assessment, and creative lesson plans are all made even easier with the wealth of templates in the Google Drive Template Gallery. Rather than starting from scratch by creating a blank document, spreadsheet, form, or presentation, search through the Google Drive Template Gallery to leverage the shared creativity of another. A few favorites are the Cornell Notes, Storyboard, and Plan Book templates. Since templates can easily be shared with others, especially within organizations, the gallery continues to grow. Not only does this tool provide a great resource for teachers as well as students, it is also a great opportunity to collaborate, create and donate!
To learn more about using All Things Google, come join us July 25-26 in Boston. Tracy will also be addressing Google tools in her July 15-16 workshop, Leveraging Technology to Differentiate Instruction: Creating Rich Curricula for ALL Students.


<Edit: The Big K> : Why repeat the same sentence? Please avoid this. Welcome to the CE Community.
Looking forward to your contribution to CE.
Before you start, please kindly go through our CE common sense guide.


The KT Corporation, a South Korean telecommunications giant, has reportedly been selected to develop a cryptocurrency that's set to be used in the city of Gimpo in the country, in a test that could see it expand to other local governments.
According to ZDNet Korea, the cryptocurrency will be introduced in April of this year, after a pilot project is run next month. The cryptocurrency, called "K token," is set to see 11 billion won ($9.7 million) worth of it get issued, and will be usable with local merchants.
The news outlet points out that to pay using the K token, uses will have to scan QR codes, and that merchants who accept payments in the cryptocurrency will be able to request a conversion to fiat that'll be transferred to their bank accounts, without extra fees.
Based on the differentiated technology and business competitiveness of the KT blockchain local currency platform, we will successfully carry out [a] local currency business in Gimpo City. The introduction of local currency will contribute to the revitalization of the regional economy.
The company is reportedly planning to expand its cryptocurrency project to other local governments that agree to it, based on its performance in Gimpo. Notably, the KT Corporation has last year ventured into the blockchain sector, as it launched a distributed ledger network that was to be applied to various areas, including ID verification, energy trading, and data roaming.
The move could be seen as a step forward for South Korea, a country that has banned initial coin offerings (ICOs), and that has revealed it's planning on taxing the fundraising practice if it becomes legal again, as well as cryptocurrencies.
In the country, cryptocurrency exchanges are believed to be vulnerable to hacks, according to a report. This, as only some of the nation's cryptoasset trading platforms cleared the government's security checks.


text:
Rediff.com » Business » Zomato, the new Infy for the new India
Zomato, the new Infy for the new India
By Akash Prakash
August 05, 2021 08:28 IST
Zomato has the potential to be an equally important milestone for Indian equity markets, notes Akash Prakash.
Photograph: Rupak De Chowdhuri/Reuters
For any India investor, the listing and eventual wealth creation by Infosys was a seminal moment for the Indian capital markets.
I had the opportunity to witness the event first hand as the Infosys IPO first failed, devolved on the underwriters and then went on to create unprecedented wealth for all stakeholders.
At Morgan Stanley Asset Management, where I worked post-listing, we eventually ended up owning more than 10 per cent of the company, and it drove our returns for many years.
Infosys demonstrated that honest, law-abiding professionals with no corporate backing could create a company modelled on global best practices.
No longer was entrepreneurship the sole purview of the big business houses.
Delhi connections, licences, old wealth, none of it was relevant -- a refreshing change from the India of old.
It became a role model for a whole new generation of Indian entrepreneurs and also demonstrated that an Indian company could aspire to compete on the global stage.
Infosys listed very early in its lifecycle, at a market cap of just a few hundred crores of rupees.
It was a time when the Indian IPO market was our venture capital provider of today.
Greenfield projects were able to go public.
Ironically, unlike today, when we have a well-developed venture capital and private equity ecosystem, largely foreign capital, at the time of Infosys going to the market, the Indian public was the biggest provider of growth capital, and also the biggest beneficiary of new listings.
Infosys also firmly established India as a stock-picker's market, and was probably the first example of a successful global business model disruption coming out of India.
Zomato has the potential to be an equally important milestone for Indian equity markets.
First of all, it has created billions of dollars of wealth for all stakeholders, be it employees, founders or investors.
It has on listing, crossed $12 billion in value, to become a part of the top-50 by market capitalisation.
This is wealth creation on a par with any in the emerging market universe.
It also lays to rest, for once and for all, the question of investor monetisation.
Flipkart had already partly slain this bogey, with its $17 billion acquisition by WalMart -- however, that was a strategic sale.
This is the first instance of investors making money on this scale through a start-up completing an IPO.
Bharti Airtel may have been the last such case, but that was over 18 years ago and initially on a smaller scale.
The success of the issue dramatically improves the case for venture capital/private equity in India.
Global allocators always understood the top-down case for backing start-ups in India, but always bemoaned the lack of exits. This has now been proven.
There is already a gold rush of sorts among investors, eyeing the pipeline of 20-25 potential listings in the next 12 months.
Expect even more capital to be allocated here. This is also an opportune time, given the regulatory challenges being faced by similar companies in China.
Photograph: Francis Mascarenhas/Reuters
Today, this space is largely dominated by global capital, and hopefully this will change as domestic investors take heart from the Zomato success.
Zomato's listing also shows the strength, maturity and scale of the domestic equity markets.
Investors were willing to back a currently loss-making business model, give it full value and participation from across the board -- retail, high-net-worth individuals and institutions.
The investor base was flexible enough to try to understand and price a new disruptive business model not easily valued using conventional valuation metrics.
Credit must be given to Sebi, Niti Aayog, and the venture ecosystem for creating the regulatory environment to permit such a listing and to the bankers and the company for having the confidence to list in India.
There must have been pressure from the global bankers and temptation to list overseas, but the success of this issue makes it clear that India can support such listings.
Why should our companies list abroad? I would question the motives and/or business model of any company trying to take the SPAC route or list overseas.
As more such companies list in India, it will broaden and deepen its equity markets, raise weighting in global indices as well as give the opportunity for domestic investors to participate in the wealth creation.
One only wishes that we would see more local participation in the earlier rounds of funding also, not just at IPO.
The Zomato success will further catalyse entrepreneurship and risk-taking in India.
It will be a role model for others, proving that professionals, funded entirely by institutional capital, can raise billions and create wealth on a global scale.
Capital is available in size for good ideas. Companies can stay private for longer and fully develop their business model.
Money is available to fund disruption and just like in the West, investors are willing to tolerate losses if unit economics are positive.
The Indian start-up scene is buzzing. Every day a new unicorn is born.
There is a rush among global investors to get involved.
We will see a flood of listings from these new age companies.
Not all issues will be successful, there will be the inevitable excesses, as investors and companies may get carried away.
However, the flood of money being sucked into the start-up ecosystem is an unalloyed positive for the country.
Even if all this new capital is burned, the cash burn will fund jobs, infrastructure and innovation.
It will be money spent in India. This will be a huge growth multiplier.
It is an exciting time for start-ups. There is a huge scope to disrupt the incumbents.
Across sectors, India will leapfrog, benefiting from, in most cases, having no legacy investments in older technology platforms.
Adoption should be faster, given the lack of legacy, as has been the case in China.
We lack purchasing power compared to China, thus our companies are smaller in size on listing.
It also means that most will have years of growth still ahead of them, as India becomes more prosperous.
Our companies, in this sense, are listing earlier in their growth cycle, and thus can deliver strong post-listing returns if priced appropriately in the IPO.
The quality of innovation and entrepreneurship coming out of India will surprise positively.
There will be global leaders coming out of the country.
One must congratulate team Zomato for the success of their listing.
Hopefully, it will pave the way for many others to follow.
Akash Prakash is with Amansa Capital.
Akash Prakash
Related News: IPO, Zomato, India, Akash Prakash, SPAC
Indian Unicorns Boom
Mega debut for Zomato; m-cap races past Rs 1 lakh cr
'IPO won't change how Zomato operates'
Bloodbath on D-Street; Hindenburg report sinks markets
Can Zomato match the exuberance over its IPO?
Zomato blockbuster listing boosts start-up ecosystem

redpajama_set_name: RedPajamaCommonCrawl


I thought that your IQ test was representative of me, provided that I am not too tired to complete it on time. The test was challeging and fun. I enjoyed the test and thought that the time limit was reasonable. I will be looking forward to taking your new test! Thank you so much!
The test was well laid out and moved along at a reasonable pace. The color used was a very nice touch as many of the tests I took before are in black and white. The report is long and detailed. I really liked the part which contains the answers I provided along with the correct answers. This is helpful and interesting. Thank you.
I enjoyed taking your IQ test. I have taken other IQ tests in the past and I achieved a similar score to those so I know it is highly accurate. The personalized report speaks well in the sense that it gives you categories that show one's strengths and weaknesses. Thank you.
I had a lot of fun doing your IQ test. I really enjoyed the challenge. It gave me a better idea of what I'm good at and what I could improve on. The personalized report was quite interesting, and I think it desribed me pretty well. I liked that it gave suggestions on how to bring up the scores in the lower areas. I also liked that it explained the differences in men and women's thinking and natural ability to answer certain questions in different areas.
The test is very user friendly in terms of the format and concise questioning. The time offered to complete was ample. The report highlighted what I would call my characteristics on a 'good' day. I could relate to a lot of the analysis and at the same time it seemed highly favourable to my good points. It was pleasurable to read, and was so optimistic it appeared at first to offer little room for improvement. I re-read and noticed the weaknesses had been identified, they were just well hidden in the use of positive words. So thank you for the excellent service and I will use the site again and recommend it to friends.
I was so happy and a bit surprised that my IQ was very high as compared to other people. The personalized report said that my verbal skills were very good. It also said that I need to work harder on my Math skills. Thank you very much!
The tests were both very helpful and interesting. I enjoyed taking it. The emotional intelligence test said some good things about myself. I have printed a copy of the 30-page personalized report and I have showed it to my friends. Thanks for coming up with such great products!
The IQ test was very good. The results show where you need to focus attention. It makes you think about all the possibilities before jumping into any conclusions, which is what you should do in life.
My daughter and I both took your IQ test. It was especially helpful because I needed to get her professionally tested for a gifted and talented program at school, but I only wanted to do so if she did close enough on your test to the 130 that the school requires on a different test to make it worthwhile. She later took the Wechsler, and scored very close to what she scored on your test. She did get into the GT program, as well. Taking your test gave her the confidence to take the one at the psychologist's office.
i enjoyed the test and thought it was set up in a very user friendly manner. i would encourage friends to take the test for fun, although it is nice to know that one's score does reflect one's iq to a reasonable degree.
The test was very clear and to the point. I did enjoy taking the test as I have taken other online iq tests just to see how I would do. I read the personalized report and I did learn some things, but I realize that I should not take it too seriously. I would tell my friends to take the test just to see how they compare to my score. I was satisfied with the test results and they compare closely to other online tests that I have taken in the past.
I truly enjoyed your test and was rather surprised by the results. It's nice to know that I am smart even though I felt I was in a weird way. I can only get better I suppose. Thanks!


text:
Q: Json Array to Map using JsonSlurper I want to create a map of data with the pid value as the key and the name as the array for a json array.  Here is the json structure:
{
"measurements": [
    {
        "pid": 6691,
        "name": "lung",
        "measurement": "qualityFactor",
    },
    {
        "pid": 1106,
        "name": "kidney",
        "measurement": "qualityFactor",
    },
    {
        "id": 119,
        "name": "pancreas",
        "measurement": "qualityFactor",
    },

]

}
Here is my attempt with Groovy but I'm stuck:
    def jsonSlurper= new JsonSlurper()
    Object objs=jsonSlurper.parseText(jsonData)
    List pp =objs.data
    Map<String,String> m=new HashMap()
    pp.each{ it ->
        it.collect{Map mm ->
            println "Map m is ${mm}"

        }
    }

I want the map to look like
["6691" : "lung" , "1106" :"kidney" ....] etc.
Hiw can I accomplish this?

A: As a full answer with corrected JSON:
def json = '''{
    "measurements": [
        {
            "pid": 6691,
            "name": "lung",
            "measurement": "qualityFactor",
        },
        {
            "pid": 1106,
            "name": "kidney",
            "measurement": "qualityFactor",
        },
        {
            "pid": 119,
            "name": "pancreas",
            "measurement": "qualityFactor",
        }
    ]
}
'''

import groovy.json.*

def parsed = new JsonSlurper().parseText(json)
def map = map.measurements.collectEntries { [it.pid.toString(), it.name] }


Get creative with these fabulous spritz-style leaf lights. Simply fill a plant sprayer with water and cover the leaves with a fine mist. Plumped up with new life, the leaves can then be gently reshaped to achieve your chosen look.
If you like you can even add a few drops of your favourite essential oil to the spray to further enhance the ambience in the room.


text:
Cattle crossing a bridge
Gainsborough Trinity 0 Grimsby Town 1
A warm, sticky evening in the no man's land between Bawtry and Market Rasen, the outermost point of Lincolnshire with no discernible point. It used to be a traffic jam on the way to Sheffield. Now? Now it's a stiff workout for the failing, fading giants of Lincolnshire football.
Town lined up in the now obligatory 3-4-3 formation as follows: Fraser, Jones, Ramsden, Wheeler, McDermott, Hildred, Coldicott, Young, Sestanovich, Holland, Soames. The substitutes were Croudson, Marcelle, Mumford, Heggarty, L Parker and Chamberlain. I think you can probably work out who played where from that; you read from right to left, you see. I can see that eyebrow: Young at left wing-back? But you don't care about that. You want to know about Danny Boy - the Town, the Town, will it be calling? He's not especially big, not especially daft in the hair department; he runs and moves a bit like Bradley Allen.
Gainsborough played in yellow and the seats in the main stand have the smallest legroom in football. [Worse than Highbury? - Ed.] At six foot threen and eyes of green I was forced to eschew the delights of sitting behind Russell Slade and a big iron post in favour of standing. Standing: the old-fashioned way of watching football, the way it should be. Russell says hello, by the way, and you said hello back, but you didn't smile.
One of the teams kicked off in front of a crowd of 245, most of which were Town supporters. It wasn't very interesting really. Gainsborough were not bad at all, a cut above Brigg, with more pace, and more or less the same inability to shoot. They put themselves about, clogging and clanking about in midfield, causing Coldicott and Hildred to spin around like battling tops.
But you still don't care about that flummery; you want to know about this Holland chappie. Have patience. He had loads of shots, dragging wide, scuffing wide, swaying high, and later on having a couple on target. After a couple of minutes he sprinted behind the defence on the left and beat the goalkeeper to a lobbed lob, drifting past the sprawling stopper to the bye-line. He looked up, saw three defenders in the six-yard box and clobbered a low shot/pass through the ancient Trinity forest, the ball diverting off a shin and away.
Later Hildred curled a lovely low pass through the inside right and Holland raced away, taking the ball in his stride and swishing past his marker. He hit the bye-line and crossed low, crossed hard, crossed accurately towards Soames. Ah, Soames. Oh, Soames. Aargh, Soames! At the near post, goalkeeper already falling, the goal gaping, Soames steered the ball wide from inside the six-yard box.
We're afflicted by the thought that wherever Soames is, nothing ever runs quite straight. He was a hindrance: blocking, stopping and setting up Gainsborough for counterattacks. Time and time again he had the ball 25 yards out, ran into defenders and left Young, the persevering parrot down the left, hopelessly exposed and way too far upfield. Don't ever mistake conspicuous movement for competence. He tries, but fails. Like Mansaram, whatever the standard of the opposition he can't quite reach it. Clawing, clinging to his career like a man on an inflatable in a force 9 gale.
Now Sestanovich is the polar opposite for, whenever he could be bothered, he glided majestically, but powerfully, through the Trinity defence. Coo, what a pass to send Holland, then Soames, free. Sigh. Holland shot wide and Soames dithered when one-on-one with the keeper. Swoon at the shot. A shake of the hips, disturbing acceleration, twist, turn and clipped chip, forcing the keeper to save rather excellently, tipping the ball over the bar for a corner. Finally faint as Sestan the Man's eminence was almost completed with a dribble and shot which curled towards the left corner. The goalkeeper made another good save as Sestanovich sank to the turf, holding his groinal area. The greyhound is such a delicate creature.
What were Gainsborough doing? Causing flutters around the Town area, with bursts and breaks, but no penetration. Jones kept heading the ball very high and a very long way. Young kept Levering about in semi-comic fashion, while Ramsden was cool man, reeeeeaaaaal coooool. Town's biggest problem was when Young ran up to join the attack and Soames kept giving the ball away. But I told you that already. I can't emphasise it enough though. The Trinity number 11 almost broke through, being sent free behind the defence, but Fraser came off his line and intimidated the striker into forgetting the ball. Near the end of the half Gainsborough had a free kick in a dangerous position, 25 yards out on their centre left, but they passed the ball into the centre, with a couple of diverse legs flipping the ball away for a goal kick.
Right on half time, Town performed a passing movement down the centre. The ball was played to Soames who, for once, didn't fall over or run into the invisible yellow army. He passed to Sestanoivich, who toyed with the ball and caressed a perfect pass between centre-back and full-back for the rampaging McDermott to run on to, who duly completed his rampage with a shot driven across and over the keeper into the right of the goal.
And then it was half time.
Gainsborough walked out first and waited, waited, waited, waited. Were Town watching telly? Were they so gripped by DIY SOS that they just had to find out if that two-storey extension was completed?
Substitutions were made, Marcelle replaced the semi-limping Sestanovich and Mumford the hobbling Wheeler. Yes, Wheeler had taken a knock near the end of the half. There is not much to say about Wheeler's contribution except that he kept giving free kicks away by bumping and barging into the back of strikers. For this he kept getting told off by the remarkably confident Fraser, who even gave advice to McDermott. "Plenty of time, Macca." Not really - it's the twilight of this god, for Macca gave a sketch of Maccaness. He wasn't as unbeatable as one would expect, but largely coped by defending without tackling.
Within the first few minutes Town should have scored a couple more. A break down the right, some twists and turns, and Soames ran into the area, laying off a pass towards Hildred. It was misplaced but rolled behind Holland near the penalty spot, who leant, swivelled and shot towards the top left corner. The goalkeeper sprang away and fingertipped the ball away magnificently for a corner. The corner was half cleared and Young dribbled towards the bye-line on the right and smacked a cross-shot towards the top corner. Again the goalkeeper reacted superbly to parry away for another corner. Jones slapped a header well wide from this final attack.
It all got very, very boring for Town supporters after this. The Gainsboroughians would have been mighty pleased by the way they pressed and almost scored a couple of times. A header hit the bar; defenders were forced into last-ditch swipes, and some hefty thwacks too.
The substitutions started to kick in, and the substitutes started to kick. Jones was taken off with an injury, replaced by Chamberlain, who runs like Mike Edwards, and defends like a junior version. Let's hope he grows into the real thing. Liam Parker replaced Ramsden with 20 minutes left and Town had two juniors and a tubby trialist in defence. Mumford waddled like a giant Darren Barnard. He had the air of someone who had played professional football and was now a really useful addition to that Sunday league team.
Somewhere in all this Trentside twiddling, McDermott had another surge forward and a cross-shot was saved low to the keeper's right. Holland followed up and slid in, but the ball was blocked and bounced off him for a goal kick.
Soames and Marcelle dived in quick succession, both failing to get free kicks, which annoyed them, but amused us. The Gainsborough number 2 moaned when the ref gave a corner after he rugby-tackled Greg Young. I think the ball brushed his highlights on its way out. See: dull, not much happening. Whoops, Gainsborough break, men free, men spare. A cross from the right over to the far post. A striker unmarked, a dozen yards out, just Fraser to beat..We weren't dooooomed, for the big-bottomed boy stood tall and parried the shot away.
In the last few minutes Heggarty replaced Soames, but not until Soames had made one more mess-up. Holland moved well across and behind the defence, anticipating a lob forward into the penalty area on the right. He awaited the dropping ball and controlled in an instant, turning past his marker and crossing from just a few yards out. The ball rolled to the unmarked Soames, eight or nine yards out. The goalkeeper had been out of his goal on his left, but managed to run past the dawdling Soames and pick the ball up as it bombled along and past the far post.
That's it, finished.
Holland was probably worthy of another chance, for he found it hard in the second half, visibly tiring, if not tiring of his ineffectual strike partners: Arrrgh Soames and Flibbertigibbet Clint, the promenading paperweight. Holland had a lot of shots, made some excellent runs and a few fancy lay-offs. He had something. Marcelle appeared to be of an equivalent standard to the Gainsborough players. Soames aspired to that standard. Jones wasn't required to tackle, but just to head the ball, which he did very well. Coldicott and Hildred were not overrun, but didn't run the show. Coldicott looked a bit timid. Young was way, way out of position, looking like a centre-back playing as a winger; it just doesn't work, that sort of thing. Macca looked like an old pro, not quite what he was, but frequent reminders that his brain, if not his body, can still find the extra few inches needed.
Sestanovich and Ramsden were by several astronomical units the best players on the pitch.
So what did we learn from a night out in Gainsborough with the home-made chip butties? The catering was good and reasonably priced.
Boston United-A (D4)Boston United-H (D4)Brigg Town-A (FDY)Bristol Rovers-A (D4)Bristol Rovers-H (D4)Bury-A (D4)Bury-H (D4)Cambridge United-A (D4)Cambridge United-H (D4)Charlton Athletic-H (FLC)Cheltenham Town-H (D4)Chester-A (D4)Chester-H (D4)Darlington-A (D4)Darlington-H (D4)Gainsborough Trinity-A (FDY)Halifax Town-A (FDY)Kidderminster Harriers-A (D4)Kidderminster Harriers-H (D4)Leyton Orient-A (D4)Leyton Orient-H (D4)Lincoln City-A (D4)Lincoln City-H (D4)Macclesfield Town-A (D4)Macclesfield Town-H (D4)Mansfield Town-A (D4)Mansfield Town-H (D4)Northampton Town-A (D4)Northampton Town-H (D4)Notts County-A (D4)Notts County-H (D4)Oxford United-A (D4)Oxford United-H (D4)Rochdale-A (D4)Rochdale-H (D4)Rushden & Diamonds-A (D4)Rushden & Diamonds-H (D4)Scarborough-A (FDY)Scunthorpe United-A (D4)Scunthorpe United-H (D4)Shrewsbury Town-A (D4)Shrewsbury Town-H (D4)Southend United-A (D4)Southend United-H (D4)Swansea City-A (D4)Swansea City-H (D4)Wigan Athletic-H (FLC)Willem II-H (FDY)Wycombe Wanderers-A (D4)Wycombe Wanderers-H (D4)Yeovil Town-H (D4)


text:
Statements by Speaker Christine C. Quinn and Council Member Annabel Palma Re: Defeat of Senate Bill 4098
Speaker Quinn said:
"I am deeply disappointed that New York Senate Republicans voted against a bill to ensure that low-income people living with HIV/AIDS who qualify for rental assistance pay no more than 30 percent of their income on rent. Championed by Senator Tom Duane, this legislation could prevent people with HIV/AIDS and their families from living on the streets. It is unfathomable to me that these elected officials would turn their backs on people who are not only ill, but who are also at high risk for becoming homeless. It also makes no sense that with this vote, Senate Republicans are essentially asking for increased shelter and medical costs, most of which will eventually become the responsibility of taxpayers. This same bill passed in 2009 and 2010 with Republicans' support. Today, they failed us all.
"I, along with my colleagues at all levels of government, remain committed to combatting homelessness and HIV/AIDS, and I am certainly 100% committed to helping New Yorkers facing both of these issues. These are life and death issues and we take them very seriously, even if other elected officials do not."
Council Member Palma said:
"I am extremely disappointed that today, the New York State Senate voted against S.4098, a bill that would have prevented those living with HIV or AIDS from having to pay more than 30% of household income towards shelter costs, including rent and utilities. Numerous studies have shown that stable housing is the most important factor in helping these individuals cope with their disease and live long and productive lives. Further, the housing assistance mandated in this bill is a much more cost-effective form of assistance than emergency shelters and other short-term assistance. We as a society should be making investments that keep these individuals in their own homes, but instead, Senate Republicans would rather make these vulnerable individuals suffer as part of an overtly ideological and political fight."


Saint Benedict treats today of the great Psalm 118 with its 176 verses divided into 22 sections of 8 verses each. The privileged place of Psalm 118 in Saint Benedict's distribution of the psalms merits consideration. You will recall that in the ancient Roman Office, in vigour until the reform of Pope Pius X in 1911, Psalm 118 was recited in full every day. In medieval Rome, Psalm 118 accompanied the solemn Good Friday procession with the wood of the Cross that made its way from the Lateran to the Basilica of the Holy–Cross–in–Jerusalem. This liturgical practice suggests that the very psalm that begins with the words Beati immaculati in via (Blessed are the undefiled in the way) accompanies us along the via crucis (the way of the cross) by which, as Saint Benedict says in the Prologue, we follow the Lord Christ, our true king, ad gloriam (to glory).
With his characteristic discretion, Saint Benedict reserves Psalm 118 (Beati immaculati) to Sunday, the Day of the Lord, the day par excellence of lectio divina, assigning the overflow of verses to Monday. Psalm 118 is a long, rapturous litany in praise of the Law. It was by means of the Law that God made known His Heart—the splendour of His truth, the glory of His beauty, the immensity of His goodness—to Israel. It is as if the psalmist finds himself at a loss for words to describe the munificent self-revelation of God to Israel. With the mystical accents of a lover, the psalmist sings of the word of the Lord, of His precepts, His commandments, His ordinances, His statutes, His laws, His will, His righteousness, His justice, His mercy, and His utterances. Having exhausted all that he can say, he fails even to begin to approach the splendour of what God has revealed to Israel!
The rabbis of old referred to the Torah, the Law, as "the way, the truth, and the life". When the Our Lord applied these three words to Himself, saying, "I am the way, and the truth, and the life. No man cometh to the Father, but by me" (John 14:6), He was, in effect, revealing Himself as the true Torah, the fulfillment of the Law and of the Prophets. For us, Psalm 118 becomes a litany of love addressed to the Word, a long contemplation of the Face of Christ, a confession of His holiness, His beauty, His goodness, and His mercy. Blessed Paul Giustiniani writes somewhere of the Body of Jesus as the New Torah Scroll written in blood; rolled open and fixed with nails to the wood of the Cross, the five wounds of Jesus are the new pentateuch in which the love of the Father is revealed. "For the law was given by Moses; grace and truth came by Jesus Christ." (John 1:17). There is a fresh spiritual joy in the weekly return of Psalm 118. It is an integral part of the Day of the Lord, spilling over into the feria secunda, the second day of the week. Of all the psalms, it is the one that I can pray most directly to Christ, offering Him verse after verse in adoration and in love.
Saint Benedict begins the weekly psalter with Psalm 1 on Monday at Prime; he assigns the Gradual Psalms or Psalms of Ascent to the Little Hours of Tuesday through Saturday. Thus do we pass from the psalm that begins, "Blessed are the undefiled in the way, who walk in the law of the Lord" (Psalm 118:1) to walking all the way to the heavenly Jerusalem. "I rejoiced at the things that were said to me: We shall go into the house of the Lord" (Psalm 121:1).


Greenwood Last Updated: 2 hours ago | 23 April 19 | Same day service in Greenwood with heart and soul. Trust, quality and experience you can rely on.
Feel free to get expert concrete assistance in Greenwood with heart and soul, exclusive help and free quotes in 1 hour or less by selecting your service on the left because you are in good hands in Greenwood which means you can relax and feel safe.
You need someone who can get the job done not only right and on schedule, but who is willing to go the extra mile so you are left in awe when you see the outcome. Licensed concrete professionals in Greenwood provide high-quality services promptly at an affordable price, working closely with you to make sure you are fully satisfied with the results.
Last chance in April. Due to a high demand for concrete services in Greenwood please get in touch with experts by using the 10 second free quotes form below which means you get highly trusted licensed and insured expert assistance because you are in good hands.
Expert services in Greenwood: Concrete overlays, coloring, flatwork, finishing, leveling, mudjacking, sawing, interlocking, concrete floors and walls, concrete foundations, landscape curbing, stamped or stained concrete.
Professional service in Greenwood. Easy and fast repairs.
Serving homeowners in Greenwood and surrounding areas for 20 years.
Last chance in April. Due to a high demand for expert services in Greenwood please get in touch with experts by using the 10 second free quotes form below which means you get highly trusted licensed and insured expert assistance because you are in good hands.
and can be contacted via phone at (479)452-0088. Stor-A-Way has an annual sales volume of of 0 - 500K. For more detailed information please contact the owner .
23 April 19 Everything you need to know about South Central Concrete Products in Greenwood. Imagine years of enjoyment from quality that stands the test of time and get the job done by South Central Concrete Products with great expertise and attention to detail in Greenwood. South Central Concrete Products is here to answer your questions in Greenwood.


The New Classic Short Shearling Boots from UGG are the most iconic style in the brand's roster. A suede fabric and a luxurious twinface sheepskin lining gives this boot added comfort.
Want it by Tuesday 23rd April? Order within 19 hours, 48 minutes and choose DPD Next Working Day Delivery at checkout.


The end of last year saw things get a little tasty in the digital audio player market. Creative, emboldened by the positive reception its little Zen Micro received in the press, declared war on Apple. The stated aim – to outsell the ubiquitous little white player using the ingenious strategy of throwing a whole lot of marketing money at the problem. It didn't work of course, and Apple comfortably outsold Creative by at least two to one over the Christmas period.
iRiver clearly has the same aspirations as Creative, and hopes to do a Chelsea FC and leap to the top of the table, while the other big players slug it out. However, judging from the H10, it's not going to happen that way, as while the new player has plenty of tricks up its sleeve, it fails to do a lot of the basic things needed to win over a crowd.
On paper at least, the H10 has a lot going for it. It's a very compact little audio player and though its measurements are slightly larger than that of the Pod mini, it's slightly lighter at 96.2g, and thinner than the Zen Micro. It's certainly more pocketable than my third generation 20GB iPod.
In the box is a transparent carry case that enables you to use all the controls, even with it on. It does detract from the look of the player though, with a slightly bizarre fetishist feel to the rubber. A cradle and a remote control are available as accessories, but they're not included in the box.
The 5GB capacity is 1GB greater than that of the iPod mini and equal to that of the Creative Zen Micro. Like the Zen, it bests the mini with extra features such as an in-built FM Tuner from which it can record. It also has the ability to record from a line-in and has a built-in microphone. You can adjust the level of compression to maximise recording space or raise the quality.
Where it outdoes both the iPod mini and the Zen Micro though, is with its colour display. This makes it easier to navigate and adds the ability to view photos in JPEG format. As for audio, the H10 can handle MP3 and DRM (Digital Rights Management) encoded WMA files. So while there's inevitably no AAC support for iTunes Store files, it can play tracks downloaded from places such as Napster. It also supports Napster-to-Go. Ogg Vorbis fans will be disappointed though, as there's no support for the high quality encoding format.
In terms of appearance the H10 proves that iRiver has come a long way with regards to design. While early iRiver players were hard to love for their looks, the recently reviewed N10 and now the H10 are undeniably decent looking devices. Taking a lead from the competition the H10 is available in multiple colours – platinum, blue, red and grey. The screen is 1.5in diagonal, which is somewhat small though it's the same size as the competition.
Of course, it wins out by being in colour and indeed the wallpapers for each of the categories look great. Moving between each of these is quick and easy using the touch slider that runs down the centre. This is responsive and easy to control. However, my first instinct was to tap it to select songs and I was disappointed to find that this didn't work. Of course, some may not like this control method but it would have been good if iRiver had included it with the option to turn it off if not desired.
Instead, selecting tracks is done with the right button on the front, with the left one used for going back out of menus. There are also three buttons down the side used for play/pause, and skipping between and within songs or photos.


text:
Q: Xcode certificates in anothe mac I'm out of home and I forgot to export my certificate and code signing stuff from my imac. Now I'm having trouble with trying out projects on the device. I downloaded de certificates and everything from the provisioning portal but doesn't work. It seems that the keys are missing.
I suppose I sould go through the whole process again in order to get everything working. My question is: if I through the whole process again, will it be a problem when I get back home? I was thinking in creating a new developer profile caled "macBook dev profile" or similar to have everything clear.
Any feedback on that?
Thanks in advance

A: Create the dev certificate, and add that certificate to the existing provisioning profile. You don't need to create separate profiles as such. And these would not interfere with your existing settings on other machines.
It won't be problem even if you create separate profiles, but it would be better to have only one, imho.


text:
Kuwait might launch third telecom IPO
Published Sunday, April 27, 2008
Kuwait could launch a much-delayed initial public offering for the country's third mobile operator by June and the new firm may be in business as early as October, an official at the ministry of commerce said on Sunday.
The government is offering 50 percent of the operator to the public. It sold 26 per cent of the firm to state-owned Saudi Telecom for $934.9 million last November.
Kuwait had initially targeted February for the IPO.
"If all went as planned there is a possibility that the IPO will be before the end of June," Daoud Al Sabej, head of the department for shareholding companies at the Ministry of Commerce and Industry told Reuters.
Kuwait is already home to Mobile Telecommunications Co, the third-largest Arab telecoms company, as well as National Mobile Telecommunications Cp (Wataniya). (Reuters)


text:
Grandson Makes WWII Game Based on 92-Year-Old Grandmother's Tragic Memories
'Brukel' takes inspiration from games like 'Gone Home' to capture what it was like to grow up on the frontlines of war.
by Patrick Klepek
August 8, 2019, 12:56pm
Bie Verlinden like to tell stories, and she has some powerful stories to draw from. The 92-year-old was born on a quiet farmhouse in Belgium that quickly became a volatile point of control between German and English forces during World War II. On any given day, her childhood home could—and often did—become a contested frontline between these forces. It was a stressful upbringing, one she would often use to quietly humble those around her.
"These stories were pretty traumatic experiences for her," said Bob De Schutter, Verlindenikes' grandson and a game designer who now researches and teaches at Ohio's Miami University, with an emphasis on games aimed at older individuals. "By the time I was 12 years old, I started to feel that I wanted to make a game about these stories."
These stories formed the basis for Brukel, a first-person exploration game (think Gone Home) centered on his grandmother's experiences, about the trauma she went through. Players return to the family's now-abandoned farmhouse decades after the war, and suddenly find themselves trapped. (There are light supernatural elements, but it's not a horror game.) Equipped with a digital camera, players snap photos of various objects in the house, which trigger stories told by De Schutter's grandmother in her own voice and words.
As we watch Nazis become en vogue and facism gain mainstream clout, the lessons of World War II are more vital than ever, but for a lot of people, it's something drawn from a dusty history book or a commercialized, politically neutered setting for video games or movies. It doesn't feel real anymore. De Schutter wants to meet people where they are.
"Honestly," he said, "if you'd told me for class, instead of reading a boring book or a documentary, you get to play a horror game? I'd be like 'Yes!' As a professor of education for me, that's also important—engaging students."
Ghosts or not, Brukel's attempt to bridge a historical gap will ultimately hinge on his grandmother's stories. When I asked De Schutter if one story stuck out in his mind, he told me how, one evening, during a big family dinner, De Schutter's father was going on about some World War II story, a way for him to brag about how much he's read about the conflict.
Midway through, De Schutter's grandmother interrupted the spectacle and began to speak.
At different times, his grandmother's farmhouse might be occupied by the Germans or the English. This time, though, it was the English, and with combat expected to break out at any moment, the men taking shelter in their home were drowning their nerves in lots and lots of alcohol. They also invited all the other men—De Schutter's grandfather, the farm hands, the sons—to join in on the festivities, and by the end of the night, everyone "got shitfaced."
As often happens during excessive drinking, people's emotions got the best of them, and things quickly escalated. One of the English officers drew a gun and held it to his grandfather's head, drawing everything to a standstill. He eventually withdrew the weapon.
"My grandma just drops that story on the entire table with everyone sitting there," said De Schutter. "You could hear a pin drop. My dad—she shut him up pretty well. [laughs]"
De Schutter started on Brukel more than three years ago, during a semester-long sabbatical. Research for Brukel actually started a few years earlier. Though he hadn't committed to making the game quite yet, De Schutter started interviewing his grandmother about her childhood, recording as many of her stories as possible. Just having them was important.
Part of Brukel's arc is tracking his grandmother's tough early years, which started before the war broke out and all hell broke loose. After her mother died at an extremely young age, his grandmother and her older sister were forced to take care of the six (!!) younger children themselves, while their older brother and father tended to the farm. There was no playing.
"My grandmother, her older sister—jesus christ, what they did for the family is insane," he said. "This is a story about strong women. I'm not necessarily making this game as a feminist statement, but this game is a very strong feminist statement without even trying, you know? What they did with that family, how they managed to get everyone through the war."
Setting the game inside his grandmother's farmhouse was a neat idea in theory, but presented a huge practical challenge; there were no photos of the interior of the house, nor any blueprints to work off of. Instead, De Schutter sat down with a sheet of paper and asked his grandmother to describe the house. What did she see? What was around the corner?
"I just started sketching," he said. "'Do you like what I sketched?' 'No, it has to be like this, it has to be like this.' The entire reconstruction of the house, she was heavily involved with. We turned those into 3D models and then I go back to her and go 'Is this what it's supposed to look like?' She would still make changes and we'd adjust the 3D model."
She has been just as involved in the storytelling part, too. Again, Brukel doesn't feature a professional voice actress—it's De Schutter's grandmother speaking into a microphone. There is no script. De Schutter asks her to start talking. Sometimes, he would ask her to tell a story a few different ways, emphasizing one part or another, but at the end of the day, it's all her.
"I did, in total, about three takes of the best parts of the stories," he said. "The first time she could talk about whatever the wanted, the second and the third time I was like 'OK, how about this story? Do you remember when you told me about it?' And then she did it again."
What appears in the game is an edited mixture of those various recordings, an attempt to strike a balance between authenticity and the most powerful way to tell a specific story.
"My grandmother shared with me all these stories of what it is like living in your country, in your house, and all of a sudden, the frontline is literally in your backyard,' he said. "The English and the German [soldiers] are fighting over your backyard, killing each other, while you're a 14-year-old girl. You can't make sense of this whatsoever. […] I always felt like the stories she told me, they are literally incredible if you've not lived through them."
Whether or not the experiment works is an open question, but it won't take long to find out. De Schutter is currently polishing some final bugs—he was in the middle of writing Steam achievements when we spoke on Skype—and expects Brukel to be released later this year.
Follow Patrick on Twitter. If you've seen anything happen in games, drop an email: patrick.klepek@vice.com. He's also available privately on Signal.
Tagged:Politicswarviolenceworld war 2Brukel


Why is Sicily the "black swan" of bespoke tailoring?
Black swans are the rare exceptions to the norm and defy conventional wisdom.
So why do I consider Sicily the "black swan" of bespoke tailoring, the last secret left for sartorialists?
Learn why Sicily is the last secret in bespoke tailoring and why it deserves to be recognized along with the more well-known sartorial destinations of Naples and Savile Row. Also discover the two best ways to experience Sicilian tailoring by traveling to Sicily armed with Sleevehead's Guide to Sicilian Tailors or working with Sicilian Reserve, a bespoke platform for Sicilian tailors to meet US and European clients.
In our digital age, we are fed a constant diet of Facebook, Instagram, Snapchat and WeChat updates by friends, colleagues and digital influencers with millions of followers.
People share anything and everything online. These days very little in terms of fashion and style is truly new or a secret. Women decide on the next handbag or #ootd by swiping on Instagram. Likewise, men get inspired by what other guys are wearing by browsing #wiwt. Most of this is "free" and easy. Everything is see, click or buy.
Against that backdrop, writing a full-length book could be construed as either retro or out of step with the times.
I chose to write a book on Sicilian tailoring. Why? Because only a long-form narrative can do justice to the topic. My view is this: the deeper the secret, the more that needs to be told.
Sleevehead's Guide to Sicilian Tailors is the first and only guide to unlocking the last secret left in men's bespoke tailoring. That's quite a statement but I truly believe it.
This is a sartorial story that cannot be told in a single tweet or Instagram, or even a hundred of them. Sicilian tailors have a tremendous story but no one has been willing to tell it. I remember thinking how shocked I was that tailors so skilled could be so unknown. So I decided to tell their story.
Sicilian tailors offer tremendous value (thanks to their relative obscurity) and possess their own unique approach which I instinctively saw and have elucidated more crisply in the new edition of #SGST.
After more than six years of traveling, researching and personally commissioning bespoke clothes in Sicily, I sum up what I know and love most about Sicilian tailors and their Mediterranean stance to cutting and making superbly tailored clothes.
If you are truly serious about bespoke tailoring and masculine style, this is a secret you cannot miss out on.