text:
\section{Introduction}

The pairing heap \cite{fsst} is a self-adjusting heap that is implemented as a single heap-ordered multi-way tree. The basic operation on a pairing heap is the linking
operation in which two trees are combined by linking the root with
the larger key value to the other as its leftmost child.
The following operations are defined for the standard implementation of the pairing heaps:

\begin{itemize}
\item{\it find-min.} Return the value at the root of the heap.
\item {\it insert.} Create a single-node tree and link it with the tree of the heap.
\item {\it decrease-key.} Decrease the value of the corresponding node. If this node is not the root, cut its subtree and link the two resulting trees.
\item{\it meld.} Link the two trees representing the two heaps.
\item {\it delete-min.} Remove the root of the heap and return its value. The resulting trees are then combined to form a single tree. For the standard two-pass variant, the linkings are performed in two passes. In the first pass, called the pairing pass, the trees are linked in pairs from left to right (pairing these trees from right to left achieves the same amortized bounds). In the second pass, called the right-to-left incremental-linking pass, the resulting trees are linked in order from right to left, where each tree is linked with the tree resulting from the linkings of the trees to its right.
Other variants with different {\it delete-min} implementation were given in \cite{e, f1, fsst}.
\end{itemize}

The original analysis of the pairing heaps \cite{fsst} showed an $O(\log{n})$ amortized cost for all operations.
Another self-adjusting heap that requires $O(\log{n})$ amortized cost per operation \cite{st2} is the skew heap.
Theoretical results concerning the pairing heaps were later obtained through the years.
Stasko and Vitter \cite{sv} suggested a variant that achieves $O(1)$ amortized cost per {\it insert}.
The bounds for the standard implementation were later improved by Iacono \cite{ia} to: $O(1)$ per {\it inset}, and zero cost per {\it meld}.
Fredman \cite{f} showed that $\Omega(\log \log{n})$ amortized comparisons, in the decision-tree model, would be necessary per {\it decrease-key} operation for a family of heaps that generalizes the pairing heaps. Pettie \cite{p} proved amortized costs of: $O(\log{n})$ per {\it delete-min}, and $O(2^{2 \sqrt{\log \log n}})$ for other operations. Recently, Elmasry \cite{elm0} introduced a variant that achieves the following amortized bounds: $O(1)$ per {\it insert}, $O(\log{n})$ per {\it delete-min}, and $O(\log \log{n})$ per {\it decrease-key} and {\it meld}. See Table \ref{t1}.

\begin{table}[tb!]
\label{t1}
\caption{Previous results for upper bounds on pairing-heap's operations}
\begin{small}
\begin{center}
\begin{tabular}{|c|c|c|c|c|}
\hline
 & {\it insert} & {\it delete-min} & {\it decrease-key} & {\it meld} \\
\hline
Fredman et al. \cite{fsst} & $O(\log{n})$ & $O(\log{n})$ & $O(\log{n})$ & $O(\log{n})$ \\
\hline
Stasko and Vitter \cite{sv} & $O(1)$ & $O(\log{n})$ & $O(\log{n})$ & $O(\log{n})$ \\
\hline
Iacono \cite{ia} &  $O(1)$ & $O(\log{n})$ & $O(\log{n})$ & zero \\
\hline
Pettie \cite{p} & $O(2^{2 \sqrt{\log \log n}})$ & $O(\log{n})$ & $O(2^{2 \sqrt{\log \log n}})$ & $O(2^{2 \sqrt{\log \log n}})$ \\
\hline
Elmasry \cite{elm0} & $O(1)$ & $O(\log{n})$ & $O(\log \log {n})$ & $O(\log \log{n})$ \\
\hline
This paper & $O(1)$ & $O(\log{n})$ & $O(\log \log {n})$ & zero \\
\hline
\end{tabular}
\end{center}
\end{small}
\end{table}

Several experiments were conducted on the pairing heaps, either comparing its performance with other priority queues \cite{j,ms} or with some of its variants \cite{e,f1,sv}. Such experiments illustrate that the pairing heaps are practically efficient and superior to other heaps, including the Fibonacci heaps \cite{ft}.

In this paper, we give a variation of the pairing heaps that achieves the best known bounds for any self-adjusting heap for all operations. Namely, our amortized bounds are: zero cost per {\it meld}, $O(1)$ per {\it find-min} and {\it insert}, $O(\log{n})$ per {\it delete-min}, and $O(\log\log{n})$ per {\it decrease-key}.
We describe the data structure in Section $2$, prove the time bounds in Section $3$, give possible variations in Section $4$, and conclude the paper with some remarks.

\section{The data structure}

Similar to the standard implementation of the pairing heaps, we implement our variation as a single heap-ordered multi-way tree.
Since we perform the {\it decrease-key} operations lazily, a pointer to the minimum element is maintained.\\

The detailed implementations for various heap operations are as follows:

\begin{itemize}

\item{\it find-min.}
Return the value of the node pointed to by the minimum pointer.

\item {\it insert.}
Create a single-node tree and link it with the main tree. Update the minimum pointer to point to this node if it is the new minimum.

\item{\it decrease-key.}
Decrease the value of the corresponding node $x$. Update the minimum pointer to point to $x$ if it is the new minimum. Add $x$ to the list of decreased nodes if it is not a root.

\end{itemize}

We use the following procedure in implementing the upcoming operations:

\begin{description}

\item {$\; \; \; \;$ -\it clean-up:}

\begin{enumerate}

\item[i.] Perform the following for every node $x$ in the list of decreased nodes: Cut $x$'s subtree and the subtree of the leftmost child of $x$. Glue the subtree of the leftmost child of $x$ in place of $x$'s subtree, and add the rest of  $x$'s subtree (excluding the subtree of $x$'s leftmost child that has just been cut) to the pool of trees to be combined. See Figure \ref{fig1}.

\begin{figure}
  \centerline{
\parbox{4in}{\psfig{figure=cut.eps,width=3.4in,height=1.5in}}}
\caption{A cut performed by the clean-up procedure.}
\label{fig1}
\end{figure}

\item[ii.] Arbitrary divide the trees of the pool into groups of $\Theta(\log{n})$ trees each (except possibly for one smaller group). For every group, sort the values of the roots of the trees and link the resulting trees in this order such that their roots form a path of nodes in the combined tree (make every root the leftmost child of the root with the next smaller value). Link the combined trees with the main tree in any order.

\end{enumerate}

\end{description}

\begin{itemize}

\item{\it meld.}
Call clean-up for the smaller heap. Link the trees of the two heaps. Destroy the smaller heap. Update the minimum pointer to point to the root if it has the minimum of the melded heap.

\item{\it delete-min.}
Call clean-up. Apply the standard two-pass implementation of the pairing heaps \cite{fsst}.
Make the minimum pointer point to the root of the resulting tree.

\end{itemize}

\section{Analysis}

We prove the following theorem that implies the claimed time bounds:

\begin{theorem}
Starting with an empty heap, consider a sequence of operations $S=\sequence{o_1, o_2,\ldots}$. Let $A = \{i ~|~ o_i$ is a meld operation$\}$, $B = \{i ~|~ o_i$ is a find-min or an insert operation$\}$, $C = \{i ~|~ o_i$ is a decrease-key operation$\}$, and $D = \{i ~|~ o_i$ is a delete-min operation$\}$. The sequence $S$ can be executed on our pairing heaps in $O(|B| + \sum_{i \in C} \log\log{n_i} + \sum_{i \in D} \log{n_i})$, where $n_i$ is the number of elements that are in the heap at operation $i$ and will leave the heap while performing $S$.
\end{theorem}

For the sake of the analysis, we categorize the nodes as follows. A node is {\it black} if it will remain in the heap after performing the sequence of operations under consideration, otherwise it is {\it white}. A black node whose descendants are all black is called an {\it inactive} node.
Let $w(x)$ be the number of white descendants of a node $x$, including $x$ if it is white.

\begin{enumerate}
\item {\it Inactive} nodes: Every node $x$ with $w(x) = 0$.
\item {\it Active} nodes: Other nodes.
\end{enumerate}

To bound the cost of the heap operations, we use a combination of the potential function and the accounting methods \cite{t}.

\subsection{The potential function}

Consider the link between a node $x$ and its parent $p(x)$.
Let $w'(x)$ be the number of white descendants of $p(x)$ restricted to the subtrees of the right siblings of $x$, including $p(x)$ if it is white.
We use the potential function

\[\Phi = \sum_{w(x) > 0} \log{\frac{w(x)+w'(x)}{w(x)}}.\]

Despite the fact that the potential on a link may reach $\log{n}$, the sum of potentials on a path from a node $z$ to any of its descendants telescopes to at most $\log{w(z)}$. If the path is the left spine of the subtree of $z$, the sum of potentials telescopes to exactly  $\log{w(z)}$.

\subsection{Debits}

Consider the following two cases:
\begin{itemize}
\item a white node is inserted in a heap with an {\it active} root.
\item two heaps with {\it active} roots are melded.
\end{itemize}

To fulfill the potential requirements, $O(\sum_{i \in D} \log{n_i})$ units are borrowed from the allowable cost for the {\it delete-min} operations that will be performed on the white nodes. The following lemma illustrates that these debits are enough to cover the above two cases.

\begin{lemma}
\label{l1}
Consider the heap at any time during the execution of the sequence of operations $S$. Let $D' = \{i ~|~ o_i$ is a delete-min operation that will be performed on a node currently in the heap$\}$.
The sum of the potentials on the links formed by insert or meld operations is at most $\sum_{i \in D'} \log{n_i}$, where $n_i$ is the number of elements that are in the heap at operation $i$ and will leave the heap while performing $S$.
\end{lemma}

{\it Proof.}
Let $\tau$ be a tree representing a heap that has $k>0$ white nodes at this point of time. Let $D'_{\tau}$ be the set $D'$ restricted to the operations performed on the nodes of $\tau$, and $P_{\tau}$ be the sum of the potentials on the links of $\tau$ formed by {\it insert} or {\it meld} operations. We prove by induction the stronger fact that $P_{\tau} \leq \sum_{i=1}^k \log{i}$. Since all the white nodes will eventually be deleted, then $\sum_{i=1}^k \log{i} \leq \sum_{i \in D'_{\tau}} \log{n_i}$.
Consider an {\it insert} operation, where a white node is linked to $\tau$ resulting in the tree $\tau'$. The required potential on this link is $\log{(k+1)}$. By induction, $P_{\tau'} \leq \log{(k+1)} + \sum_{i=1}^k \log{i} =  \sum_{i=1}^{k+1} \log{i}$.
Consider a {\it meld} operation, where two trees $\tau_1$ and $\tau_2$ with {\it active} roots are linked resulting in tree $\tau'$. Assume that $\tau_1$ and $\tau_2$ have $k_1, k_2 > 0$ white nodes, respectively. The required potential on this link is at most $\log{(k_1+k_2)}$. By induction, $P_{\tau'} \leq \log{(k_1+k_2)} + \sum_{i=1}^{k_1} \log{i} + \sum_{i=1}^{k_2} \log{i} \leq \sum_{i=1}^{k_1+k_2} \log{i}$. This follows from the fact that $k_1! + k_2! < (k_1 + k_2 - 1)!$, for any integers $k_1, k_2 > 1$.
\hfill $\Box$

\subsection{Credits}

We maintain the following credits in addition to the potential function:

\begin{enumerate}
\item [-] {\it Decrease} credits: $O(\log \log n)$ credits for every decreased node since the previous {\it clean-up} is performed.
\item [-] {\it Heap} credits: $O(\log{n'})$ credits per heap, where $n'$ is the size of this heap.
\item [-] {\it Active-parent} credits: $O(1)$ credits for every child of an {\it active} node.
\item [-] {\it Active-run} credits: $O(1)$ credits for every {\it active} node with an {\it inactive} right sibling.
\end{enumerate}

\subsection{The time bounds}

Next, we analyze the time bounds for our operations. Each operation must maintain the potential function, the credits, and pay for the work it performs.

\subsubsection{find-min}
No potential or credit changes are required. The actual work of {\it find-min} is $O(1)$. It follows that the worst-case cost of {\it find-min} is $O(1)$.

\subsubsection{insert}

If the inserted node is white, extra potential units may be needed. But, as Lemma \ref{l1} illustrates, these units are borrowed from the logarithmic cost per {\it delete-min}, and the {\it insert} operation need not pay for that.

Assume that as a result of the {\it insert} operation node $x$ is linked to node $y$. If $y$ is {\it active}, the {\it active-parent} credits need to be increased by $O(1)$. If $x$ is {\it active}, and the previous leftmost child of $y$ was {\it inactive}, the {\it active-run} credits need to be increased by $O(1)$. Since the size of the heap increased by one, the {\it heap} credits need to be increased by $O(1)$. The {\it decrease} credits need to be increased by $O(\log \log (n+1) - \log \log{n})$ per decreased node, which still sums up to $O(1)$ as indicated by the following proposition.

\begin{prop}
$n \cdot (\log\log{(n+1)} - \log\log n) = O(1)$.
\end{prop}

{\it Proof.}
For $n>2$,
\begin{eqnarray*}
n \cdot (\log\log{(n+1)} - \log\log n) & < & n \cdot \log{\frac{n + 1}{n}} \\
& = & \log{(1+\frac{1}{n})^n}
\end{eqnarray*}

But $(1+\frac{1}{n})^{n} < e$, where $e$ is the base of the natural logarithm.
\hfill $\Box$ \\

The actual work to link an inserted node with the main tree is $O(1)$. It follows that the amortized cost of {\it insert} is $O(1)$.

\subsubsection{decrease-key}
No potential changes are required. The {\it decrease-key} pays $O(\log \log{n})$ credits for the decreased node. The actual work it performs is $O(1)$. It follows that the amortized cost of the {\it decrease-key} operation is $O(\log\log{n})$.

\subsubsection{clean-up}

First, consider the effect of a cut performed on a decreased node $x$:

Consider the path of nodes from the root including all the ancestors of $x$ followed by the nodes on the left spine of $x$'s subtree. Since we cut the subtree of $x$ and replace it with the subtree of its leftmost child, the nodes of the above path remain the same except for $x$.
If all the descendants of $x$ are black, possibly excluding the subtree of its leftmost child, then the potentials on all the links do not change as a result of the cut. Otherwise, all the ancestors of $x$ before the cut are {\it active}.
In such case, the proof given in \cite{elm0}can be applied, indicating that the sum of the potential on all the links does not increase.

If $x$ and both its left and right siblings are {\it active} while its leftmost child is {\it inactive}, then the number of {\it active-runs} increases by one, and $O(1)$ credits would be needed and paid for from the released {\it decrease} credits.

Second, consider the effect of combining the trees and linking them with the main tree:

The trees of a group are combined by sorting the values in their roots and linking them accordingly in order.  Since the size of a group is $O(\log{n})$, the actual work done in sorting is paid for from the released {\it decrease} credits ($O(\log\log{n})$ credits per node). This will result in a new path of links. Since the sum of the potential values on a path telescopes, the increase in potential as a result of combining the trees of a group and then linking this group to the main tree is $O(\log{n})$. This $O(\log{n})$ potential increase is also paid for from the {\it decrease} credits, except for possibly the last group. (The last group may be a smaller group, and its {\it decrease} credits may not be enough to pay for the increase in potential.)

As a result of a link the number of {\it active-runs} and {\it active-parents} may increase by one, and $O(1)$ credits would be needed and again paid for from the {\it decrease} credits.

It follows that the overall amortized cost of the {\it clean-up} procedure is $O(\log{n})$.

\subsubsection{meld}

As for {\it insert}, extra potential units may be needed. But, as Lemma \ref{l1} illustrates, these units are borrowed from the logarithmic cost per {\it delete-min}.

The cost of the {\it clean-up} performed on the smaller heap is $O(\log{n'})$, where $n'$ is its size. Since the size of the combined heap is at most twice the size of the larger heap, the {\it heap} credits for the combined heap need to be incremented by $O(1)$. Similar to {\it insert}, the {\it active-parent} credits and the {\it active-run} credits may need to be increased by $O(1)$.
The actual work for meld, other than the {\it clean-up} of the smaller heap, is $O(1)$. All these costs are paid for from the {\it heap} credits of the smaller heap, before it is destroyed.

It follows that the {\it meld} operation pays nothing; everything is taken care of by others.

\subsubsection{delete-min}

\begin{figure}
  \centerline{
\parbox{4in}{\psfig{figure=step.eps,width=4in,height=1.2in}}}
\caption{A delete-min $((c_i \nearrow b_i) \nearrow a_i)$ step.}
\label{fig2}
\end{figure}

We think about the two-pass pairing as being performed in steps. At the $i$-th step, the pair of trees that is the $i$-th pair from the right among the subtrees of the deleted root are linked, then the resulting tree is linked with the combined tree from the linkings of all the previous steps. Each step will then involve three trees and two links. Let $a_i$ be the tree resulting from the linkings of the previous steps, and let $A_i$ be the number of white nodes in $a_i$. Let $b_i$ and $c_i$ be the $i$-th pair from the right among the subtrees of the deleted root to be linked at the $i$-th step, and let $B_i$ and $C_i$ respectively be the number of white nodes in their subtrees. It follows that $A_{i+1}=A_i+B_i+C_i$. Let $(\tau_1 \nearrow \tau_2)$ denote the tree resulting from the linking of tree $\tau_1$ to tree $\tau_2$ as its leftmost subtree. See Figure \ref{fig2}.

We distinguish between four cases, according to the types of the roots of $b_i$ and $c_i$ and who wins the comparison.

\begin{enumerate}

\item Both roots are {\it inactive}:

There was no potential on the two links that were cut, and no potential is either required on the new links. The actual cost of this step is paid for from the released {\it active-parent} credits, as these two roots were children of an {\it active} parent and at least one of them is not any more. \\

\item An {\it active} root is linked to an {\it inactive} root, and $((\cdots \nearrow \cdots) \nearrow a_i)$:

The potential that was related to the active root before the operation is enough to cover the potential of the new link with $a_i$.
If the leftmost child of the {\it inactive} root was {\it inactive} before the link, the {\it active-run} credits need to be increased by $O(1)$.
As for the previous case, these possibly-needed extra credits and the actual cost of the step are paid for from the released {\it active-parent} credits. \\

\item

\begin{enumerate}

\item Both roots are {\it active}:

The {\it active-run} credits may need to be increased by $O(1)$.

The potential on the two links that are cut at the $i$-th step was

\[\log{\frac{A_i+B_i}{B_i}} + \log{\frac{A_i+B_i+C_i}{C_i}}.\]

We consider the four possibilities: \\

\begin{enumerate}

\item $((c_i \nearrow b_i) \nearrow a_i)$:

The potential on the new links is
\[\log{\frac{B_i+C_i}{C_i}} + \log{\frac{A_i+B_i+C_i}{B_i+C_i}} = \log{\frac{A_i+B_i+C_i}{C_i}}.\]
The difference in potential is
\[\log{\frac{B_i}{A_i+B_i}} < \log{\frac{B_i+C_i}{A_i}}.\]

\item $((b_i \nearrow c_i) \nearrow a_i)$:

The potential on the new links is
\[\log{\frac{B_i+C_i}{B_i}} + \log{\frac{A_i+B_i+C_i}{B_i+C_i}} = \log{\frac{A_i+B_i+C_i}{B_i}}.\]
The difference in potential is
\[\log{\frac{C_i}{A_i+B_i}} < \log{\frac{B_i+C_i}{A_i}}.\]

\item $(a_i \nearrow (c_i \nearrow b_i))$:

The potential on the new links is
\[\log{\frac{B_i+C_i}{C_i}} + \log{\frac{A_i+B_i+C_i}{A_i}}.\]
The difference in potential is
\[\log{\frac{(B_i+C_i) \cdot B_i}{A_i \cdot (A_i+B_i)}} < 2 \log{\frac{B_i+C_i}{A_i}}.\]

\item $(a_i \nearrow (b_i \nearrow c_i))$:

The potential on the new links is
\[\log{\frac{B_i+C_i}{B_i}} + \log{\frac{A_i+B_i+C_i}{A_i}}.\]
The difference in potential is
\[\log{\frac{(B_i+C_i) \cdot C_i}{A_i \cdot (A_i+B_i)}} < 2 \log{\frac{B_i+C_i}{A_i}}. \]

\end{enumerate}

\item One root is {\it active} and the other is {\it inactive}, and $(a_i \nearrow (\cdots \nearrow \cdots))$:

The {\it active-run} credits may need to be increased by $O(1)$.

Since either $B_i$ or $C_i$ equals zero, we use $M_i = \max{\{B_i, C_i\}}$ for the other value.

The potential on the cut links is
\[\log{\frac{A_i+ M_i}{M_i}}.\]

The potential on the new links is
\[\log{\frac{A_i+M_i}{A_i}}.\]

The difference in potential is
\[\log{\frac{M_i}{A_i}} = \log{\frac{B_i+C_i}{A_i}}.\]

\end{enumerate}

\vspace{.1in}

\begin{description}

\item[-] If $B_i+C_i \leq A_i/2$, then $\log{(\frac{B_i+C_i}{A_i})} \leq -1$. Then, for all the above sub-cases, the change in potential is less than $-1$. This released potential is used to pay for the possibly-required increase in the {\it active-run} credits, in addition to the actual work done at this step.

\item[-] If $B_i+C_i > A_i/2$, we call this step a bad step. For all the above sub-cases, the change in potential resulting from all bad steps is at most $2\sum_i \log{\frac{B_i+C_i}{A_i}}$ (taking the summation for positive terms only, i.e. $B_i+C_i > A_i$). Since $A_{i'} > B_i+C_i$ when $i'>i$, the sum of the changes in potential for all steps telescopes to $O(\log{n})$. It remains to account for the actual work done at the bad steps. Since $A_{i+1}=A_i+B_i+C_i$, a bad step results in $A_{i+1} > \frac{3}{2} A_{i}$.  Then, the number of bad steps is $O(\log{n})$. It follows that the increase in the {\it active-run} credits and the actual work done at bad steps is $O(\log n)$ for each {\it delete-min} operation.\\

\end{description}

\item An {\it inactive} root is linked to an {\it active} root, and $((\cdots \nearrow \cdots) \nearrow a_i)$:

The potential that was related to the active root before the operation is enough to cover the potential of the new link with $a_i$.
To cover the actual work done in such step, consider the two steps that follow it. If those two steps are of the same type as this step, the number of {\it active-runs} decreases (at least one {\it inactive} node is taken out of the way of two {\it active-runs}) and such released credits are used to pay for all three steps (this is similar to Iacono's {\it triple-white} notion in his potential function \cite{ia}). Otherwise, one of those two steps will pay for the current step as well.

\end{enumerate}

From the above case analysis, it follows that the amortized cost of the {\it delete-min} operation is $O(\log{n})$.

\section{Variations}

The main difference between our implementation and the standard implementation of the pairing heaps is the {\it clean-up} procedure. We chose to perform the {\it clean-up} before the {\it delete-min} operation, and to apply it to the smaller heap before the {\it meld} operation.
The following variations are as well possible:

\begin{itemize}

\item It is possible to periodically perform the {\it clean-up}, once the number of decreased nodes reaches $\Theta(\log{n})$ following a {\it decrease-key} operation. This assures that when the {\it clean-up} is performed prior to {\it delete-min} operations, there will be only $O(\log{n})$ decreased nodes (one group).

\item It is possible not to call {\it clean-up} prior to {\it meld} operations, and to do all the work prior to {\it delete-min} operations instead.

\item  In \cite{f}, Fredman stated that the cost of $m$ pairing-heap operations, including $n$ {\it delete-min} operations, is $O(m \log_{2m/n}{n})$. This bound implies a constant cost for the {\it decrease-key} operation when $m=\Omega(n^{1+\epsilon})$, for any constant $\epsilon>0$. This suggests that, when the number of the decreased nodes is large enough, we perform the {\it clean-up} by cutting each of the affected subtrees and directly linking it with the main tree (similar to the standard pairing-heaps implementation).

\end{itemize}

\section{Conclusion}
We have given a variation of the pairing heaps that achieves the same amortized bounds as Fibonacci heaps, except for {\it decrease-key} (which still matches Fredman's lower bound for, what he calls \cite{f}, a generalized pairing heap). Three important open questions are:

\begin{itemize}
\item Is there a self-adjusting heap that achieves amortized $o(\log \log{n})$ {\it decrease-key} cost?
\item Is it possible that the original implementation of the pairing heaps has the same bounds as those we achieve in this paper?
\item Which heap performs better in practice?
\end{itemize}

redpajama_set_name: RedPajamaArXiv


text:
Q: Application.OnTime & BeforeClose Just want to ask if why do I keep receiving this error?

Run-time error '1004': Method 'OnTime' of object'_Application' failed

So, I'm trying to close my workbook but whenever I'm doing it, the error shows. The highlighted line after clicking the Debug button is Application.OnTime timeCheck, "SaveThis", , False in the Workbook_BeforeClose sub. What seems to be the problem here?
Private Sub Workbook_Open() 'place in ThisWorkbook
 timeCheck = Now + TimeValue("00:15:00")
 Application.OnTime timeCheck, "SaveThis"
End Sub

Sub SaveThis() 'place in Module
 timeCheck = Now + TimeValue("00:15:00")
 Application.DisplayAlerts = False
 ThisWorkbook.Save
 Application.DisplayAlerts = True
 Application.OnTime timeCheck, "SaveThis"
End Sub

Private Sub Workbook_BeforeClose(Cancel As Boolean) 'place in ThisWorkbook
 Application.OnTime timeCheck, "SaveThis", , False
End Sub

A: It seems to me that you are trying to schedule a call to SaveThis() in the future, right when the application is about to close. Why would you want to do that?, if the error never happened, then how will you guarantee that the call happens when the workbook is already closed?
If what you meant to do is save the workbook before closing the workbook, then you will need to change your code as follows:
Private Sub Workbook_Open() 'place in ThisWorkbook
 timeCheck = Now + TimeValue("00:15:00")
 Application.OnTime timeCheck, "SaveThis"
End Sub

Sub SaveThis()
 timeCheck = Now + TimeValue("00:15:00")
 SaveRightNow     ' This is a new sub that you will need to add
 Application.OnTime timeCheck, "SaveThis"
End Sub

Sub SaveRightNow()
 Application.DisplayAlerts = False
 ThisWorkbook.Save
 Application.DisplayAlerts = True
End Sub

Private Sub Workbook_BeforeClose(Cancel As Boolean) 'place in ThisWorkbook
  SaveRightNow  ' Saves the workbook without having to schedule a call in the future
End Sub

redpajama_set_name: RedPajamaStackExchange


text:
Home»Africa»Lesotho Visa»Top 10 Things and Places to see when you Visit Lesotho
Top 10 Things and Places to see when you Visit Lesotho
Lesotho Visa
Since you have considered visiting Lesotho, it is a great decision, and there are plenty of things to see and do. The mountainous country is home to various wildlife, including lions, elephants, leopards, and wild horses. Also, you can explore the ancient ruins of Maseru or take a hike in the Okavango when you visit Lesotho.
In addition, Lesotho is a small country in southern Africa that is rich in natural resources. These include mountains, forests, and game reserves.
If you are looking for a truly unique travel experience, look no further than Lesotho. You will find beautiful mountain ranges, crystal-clear waterfalls, and much more there. So, suppose you are ever in the area, check out the destinations and places listed in this article.
About Lesotho
#1. Visit Sehlabathebe National Park in Lesotho
#2. See Morija Museum
#3. Walk around Teyateyaneng
#4. Experience Mafeteng Rock
#5. Visit Ha Kome
#6. Visit Mohale Garden in Lesotho
#7. See Thaba Bosiu Mountain
#8. Visit the Maletsunyane Falls and
#9. Walk around Thabana Ntlenyana
#10. Visit Katse Dam
Major Cities in Lesotho
What is the best time to Visit Lesotho?
Types of Accommodations in Lesotho
Major Airports in Lesotho
Lesotho is a landlocked country in southern Africa. Its population is just over 2 million people. However, Lesotho borders South Africa to the south and east, Namibia to the north, and Botswana to the west. Meanwhile, the capital city is Maseru. In addition, Lesotho is home to several mountains, including Mt. Mohala, Mt. Atsane, and Mt.
The following are the principal places and things to experience while in Lesotho:
Sahlabathebe is the largest protected area in Lesotho and one of the country's most important tourist destinations. However, the park is in the southeastern part of the country and covers an area of 2,000 km². Also, it is home to a wide variety of wildlife, including lions, elephants, leopards, hyenas, and hippos. There are also several different types of forests, including deciduous and evergreen rainforests.
Lesotho's equivalent of Cambridge or Massachusetts is Selibeng sa That Morija. Long considered a center for academic learning in Lesotho, it is widely regarded as where the secrets of the Basotho people and history are brought to light.
However, the Morija Museum and Archives is the primary place for visiting the relics that record the main periods of the Gun Wars and the Boer War. Also, English colonialism in southern Africa. Also, the town hosts a year-round arts and culture event that is visited by colorful festivities and dances in Lesotho.
Lesotho's lively town, known as Teyateyaneng is notable for its rural locations and souvenirs. In the city, galleries and artisan groups showcase local needlework and other specialty products. You can see it all if you visit Lesotho.
Suggested: Lesotho Visa Requirements - Application, Documentation And Types
During the 19th century, the Mafeteng Rock was the focal conflict point between the British and Zulu tribes. Subsequently, it became a factory town for Semonong and surrounding Saturday mornings.
Known for its flair for regional folk music, it's a place that's industrial and history-minded, with many five-star hotels and restaurants, not just local eateries and bars; Visit Lesotho and experience all.
However, Mafeteng is a convenient place to stop if you are making a beeline for the border at Wepener. Also, traveling north toward Malealea, or north to the hot spots of Morija.
The ancient Ha Kome dwellings in the Berea District of Lesotho Berea District are among the nation's most terrific sights. However, it is Carved out of the rock faces of the surrounding mountains. Also, it is not uncommon to find them hidden nearby in the clefts among the region's foothills if you visit Lesotho.
A compelling look at the traditional family structure in this area of Africa. The structures remain in place today thanks to the descendants of the original builders.
Go to the on-site Ha Kome Visitors Center for a closer look at the history and traditions. Also, the customs of the curious highland settlements.
In Mohale, beautiful highlands stretch across the landscape. However, the area is under the coverage of beautiful, gentle mountains on all sides. While only a couple of people come over to meet in the southeastern reaches of Bokong and Tsehlanyane, most have begun to take an interest in the area's attraction, the Mohale Dam.
However, this impressive structure is the alternative to the previously mentioned Kérastase Dam. Also, it spans a colossal 145 meters and encompasses the widest crest on the Senquenzane River of more than 700 meters.
Thaba Bosiu is a mountain you can see when you visit Lesotho. However, the mountain has an elevation of 2,694 meters and is one of the highest peaks in Lesotho.
Also, the square kilometers of land provided using the Thaba Bosiu plateau represent the ancestral organic fortress of Basotho. While This location primarily functions as an enclave through the Basotho battles with the Orange Free State in the 1850s. Also, towards the Boers during the Basotho battles at the Orange Free State in the mid-19th century.
Maletsunyane Falls is a waterfall you can experience as you Visit Lesotho Highlands near the town. Meanwhile, it is one of the most beautiful waterfalls in Africa and a popular tourist destination. Historically, the falls are named after the Goddess Maletsunyane, who is said to have created them with her tears. Also, the falls are accessible by foot or by car.
Thabana Ntlenyana is a religious complex in the Kingdom of Lesotho in the Leribe district. The complex was built in 1987 by then King Moshoeshoe II as a place for religious worship and instruction. However, the complex consists of several structures, including a large ceremonial hall, a library, and guesthouses. Also, Thabana Ntlenyana is visited by tourists who see its impressive architecture and religious significance.
The Katse Dam Lesotho is a large hydroelectric dam in the lower reaches of the Mafeteng River, about 50 kilometers northeast of Maseru. However, the dam was built between 1976 and 1978 by the African Development Bank, and its primary purpose was to provide a reliable source of electricity for the rapidly growing City of Maseru. The Katse Dam provides about 10% of Lesotho's total power needs, with an installed capacity of 5,000 megawatts.
To visit Lesotho, you may like to stay in One of the major cities in the State. However, below are the main cities in Lesotho:
#1. Maseru
This is the largest City in Lesotho and the country's capital. It was founded in 1869 on British territory. Throughout the colonial period, Maseru was the site of a British police camp and the capital of Lesotho.
#2. Teyateyaneng
Teyateyaneng is in Lesotho's Berea district; it has an average population of 75,115. This City was founded in 1886 by chief Masupha to establish a settlement between him and his adversaries in the British Empire. It also serves as the administrative capital for Berea.
#3. Mafeking
Mafeking is the capital of the Mafetang District of Lesotho, with a population of about 57,059. However, Mafetang is an important trading center and tourist attraction thanks to its rich historical significance and environmental pursuits such as hiking and pony-trekking.
#4. Hlotse
The English missionary John Widdicombe founded the town of Hlotse, Lesotho, in the early 1800s. The City will serve your accommodations when you visit Lesotho.
The best time to visit Lesotho is from May to November. However, the weather is warm, with average daytime temperatures ranging from 23℃ to 30℃ and nighttime temperatures averaging around 18℃. Meanwhile, the best time to travel is during the day when it's cooler, and there is less humidity. Meanwhile, the country has a relatively small population, so you'll have plenty of space to roam and explore.
There are many types of accommodations in Lesotho. Examples include guest houses, camping sites, lodges, and hotels. Each offers different amenities and prices. Choosing the right accommodation for your needs is essential, as not all places offer the same level of service. Some places may be more scenic or affordable, while others may be more accommodating to tourists.
The major airports in Lesotho are King Moshoeshoe International Airport, Mohale's Hoek Airport, and Mokhotlong Airport. However, these three airports handle most international flights into and out of Lesotho. The airports' main carriers are South African Airways, Ethiopian Airlines, and Kenya Airways.
Also Read: Immigrate to Canada from Lesotho – Workers, Students, Family
What do living conditions look like in Lesotho?
Living conditions in Lesotho vary depending on the location. In rural areas, people live in huts made of sticks and mud. Meanwhile, the wealthier parts of the country have bricks and mortar. However, there is little or no access to clean water or sanitation, and diseases are common. Many people work as subsistence farmers, growing crops such as maize, sugarcane, and tobacco. Also, they raise livestock such as cattle, sheep, goats, and chickens.
How do I visit Lesotho?
If you have an interest in visiting Lesotho, there are a few things that you should know. First and foremost, the country is small and has just over two million population. Secondly, Lesotho is mountainous, so it is not easy to get around. Thirdly, the language they speak in Lesotho is Sesotho, which they aren't speaking widely outside the country.
Can I Visit Lesotho without a Visa?
Visitors from most countries do not need a visa to visit Lesotho, but visitors from some countries, such as Iran, Iraq, Sudan, and Syria, may need a visa. You can obtain a visa from Lesotho's embassy or consulate in your home country. Depending on your trip's purpose and your passport's classification, you may also need a travel permit.
How strong is Lesotho Visa?
For visitors from most countries, a Lesotho visa is generally easy to obtain and allows for short stays. However, there are a few restrictions that visitors should be aware of. For example, visitors who do not have a passport from an African country will need to apply for a Lesotho visa in advance. Furthermore, visitors who are not citizens of an African country may need to provide additional documentation, such as proof of income or health insurance.
Is Lesotho a Popular tourist center?
Lesotho is a country in southern Africa that has been untouched by tourism. However, this is starting to change as the country becomes more popular among backpackers and independent travelers. Meanwhile, Lesotho has a rich culture, stunning scenery, and friendly people eager to share their country's secrets. Also, the country is known for its wine, which they produce in small quantities but have a strong flavor.
In conclusion, Lesotho is a country that offers visitors a vast array of attractions to explore. Whether you want to take in the natural beauty of the landscape, learn about traditional culture and history, or relax in a peaceful setting, there is sure to be something for you. However, some of the top places to see when you visit Lesotho include Mafeteng National Park, the Royal Palace, and the Quthingbo Waterfall.
Previous Visit Liberia – Top Places, Culture, Arts and Experiences
Next Visit Madagascar – Top Places, Arts, Culture and Experiences
Lesotho Visa Requirements – Application, Documentation And Types
15 Unique Things to do in Brampton – For Everyone
Do you think of things to do in Brampton? You are welcome to the Flower …
Philippines Visa on Arrival – Application and Requirements

redpajama_set_name: RedPajamaCommonCrawl


Sammy Chien will be playing with the legendary indie/electronic musician Sonic Deadhorse 音速死馬 鄭各均 and the craziest experimental jazz musicians in Taiwan— Min-Yen Terry Hsiehi 謝明諺 once again, this time, with 黃思農 who's a big name in the theatre scene in Taiwan, improv erhu. At the indexical bar/club/live house venue Revolver. We look forward to the magic.


text:
Q: Loop horizontal scrolling of two divs with mousewheel and buttons I need to loop horizontal scrolling of wide block. Also I need to controll scrolling with mousewheel and buttons.
I have created working demo on codepen.
Demo on CodePen
Here I use Endless.JS for loop scrolling (works with 2 divs and more) and jquery.mousewheel for mouse wheel support. Also I write some code for arrows. On hover -> block start scrolling with animation.
animate({scrollLeft:'+=40'}

This method works great with mouse wheel but I got some trouble with arrows. After I have scrolled first few divs other div become blinking and works like artifact in game :) (see demo)
Can you help me? Maybe I need to use some other method or lib?
Thanks a lot.

A: You should probably avoid jQuery.animate here. Not exactly sure what causes the problem, but using timeouts seems to work fine. That way, you also have more control over the delay and animation speed. http://codepen.io/anon/pen/zGbLB
  var timeout;

  function loop_next(){
    timeout = window.setTimeout(function() {
      container.scrollLeft(container.scrollLeft() + 2);
      loop_next();
    }, 20);
  }
  function loop_prev(){
    timeout = window.setTimeout(function() {
      container.scrollLeft(container.scrollLeft() - 2);
      loop_prev();
    }, 20);
  }
  function stop(){
    window.clearTimeout(timeout);
  }


Review for the film " 60 Vayathu Maaniram"
60 Vayadu Maaniram is a thriller movie scripted and directed by Radha Mohan. The story is by Hemanth Rao and the film is based on the Kannada movie Godhi Banna Sadharana Mykattu. 60 Vayadu Maaniram has the star cast of Prakash Raj, " Samuthirakani," Vikram Prabhu and " Indhuja." The dialogues are by Viji and the music composition is by " Ilaiyaraaja." Vivek Anand handled the camera and TS Jai edited the movie. V creations of Kalaipuli S Thanu produced the movie on a large scale.
Vikram Prabhu who is in Mumbai visits Chennai to see his father, Prakash Raj. Prakash Raj is suffering from Alzheimer's disease and he has been getting treatment at a special home. Vikram Prabhu takes Prakash Raj with him to a textile showroom. He misses his father at the showroom and searches for him. Meanwhile, Prakash Raj gets stuck in the hands of Samuthirakani, who has just murdered a cop. Samuthirakani gets an order from his boss that there should be no evidence for the murder and hence he was asked to kill Prakash Raj. What did Samuthirakani do? What happened to Prakash Raj? Did Vikram Prabhu find his father? Watch the film in theatres!
Prakash Raj and Samuthirakani… both are the star performers and we need not doubt about their performance. They had landed on a perfect role here. Samuthirakani emotes excellently well. Although he is a murderer, he tries to come out of that life and live as a normal person and his expressions are very beautiful. Prakash Raj's performance as an Alzheimer's patient makes us feel that none could do this role better than him. Coming to Vikram Prabhu… he has played an excellent character and his performance is quite natural.
Radha Mohan has scripted the film interestingly well. Each and every scene is interesting and the scene where Prakash Raj is caught in the hands of Samuthirakani fastens up the heartbeats. We could assure that whether the film makes a hit or not, Vikram Prabhu would get a good name for his performance. The dialogues are the pillars of the film and we should never forget Ilaiyaaraja's BGM that had played a strong role. The music Maestro has proved once again that without music nothing will look good in the world. However, the screenplay is a bit slow. The production values and the technical values are really good.
Although it is a remake movie, Radha Mohan has molded it for the Tamil audiences. This film will be in the list of the best performance movie for Vikram Prabhu, Prakash Raj and Samuthirakani. People, who want to watch the fast-paced movie might not like this film, but if you are a person who wants to watch a different film from the masala entertainers, this is the best choice, with a bag full of performance.
Vikram Prabhu's Multi-starrer With Mani Ratnam!..


Home > Can I buy life insurance at age 60?
In most cases, you can certainly expect to be able to buy life insurance at the age of 60. However, as you might have guessed, the premiums are much higher than those you would be paying had you initially purchased life insurance at a younger age.
In fact, if you expect to live until at least 80, you might find that the premiums threaten to equal, if not cost more, than the compensation. Furthermore, factors such as dangerous lifestyle habits (like smoking and drinking or severe illness) can also cause premiums to skyrocket. If your situation is considered exceptionally risky, then life insurance can even be denied.
When considering purchasing life insurance at age 60 with the intention to provide for loved ones in the future, you should think carefully. It is a good idea to evaluate all possible options. If you decide to go ahead then make sure that you examine offers from several different companies. Acting on impulse or accepting the first policy put in front of you is unlikely to secure you the best possible deal.
Life insurance policies are complex documents, filled with detailed information and, occasionally, hidden clauses. If you are seeking total peace of mind, then make sure that you are informed and satisfied when it comes to settling upon a particular company.
How does my health affect my eligibility for life insurance?
Even if you have suffered from an illness, it is likely that you are still a candidate for insurance. Some people imagine that they will not qualify, perhaps because of their age or because they have endured an accident or sickness. However, as time goes on, insurers become more flexible in this regard.
This is partly due to advances in medicine, science, and technology. Today's 20 year olds can are three times as likely to live to 100 years of age in comparison to their grandparents. They also are at least two times more likely than their parents to reach that age. Of the children coming into the world in 2011, one-third of the girls and one-quarter of the boys will probably live until the age of 100.
What caused the problem in the first place?
If you are over 60 and have endured a serious condition that is likely to repeat itself in the future with life-threatening consequences, this reduces the possibility of you being able to buy life insurance. Furthermore, if you are able to purchase a policy, you can expect the premiums to be immense.
How can I improve my chances of finding affordable life insurance at age 60?
You want to appear as though you are going to be paying that company for many years to come!
What kind of policy should I buy?
Life insurance companies offer an overwhelming array of products, but the two major kinds of life insurance available are term and permanent. When you buy term life insurance, you agree that you will receive compensation only if you pass away within a particular period. If you survive beyond the set date, you do not receive any payout, but then again, you'll still be breathing, so you probably won't be too disappointed! Term life insurance is cheap and usually reasonably easy to get.
Permanent life insurance provides you with both life insurance as well as savings. You can keep paying your permanent life insurance until you pass away or you can choose to access some of the money that you have invested while you are still alive. The catch is that you can expect to pay two or three times the amount for permanent than you do for term.
In addition, once you are over 60, it can be a good idea to hunt down an insurance company that offers guaranteed issue policies. Just make sure that you check their terms and conditions. You can't really go wrong being obsessive about the small print when it comes to life insurance.
Furthermore, find out if there are any ways of reducing payments. Does it make a difference if you pay every three months, bi-annually or annually?
Is it worth getting life insurance now that I am over 60? What are my other options?
Depending on your situation, it might be useful to keep in mind that there are alternatives to life insurance when it comes to looking after your family, friends and loved ones. If you already have assets and money saved and if none of those close to you are financially dependent on you, then you might be able to leave an impressive and helpful legacy without buying a life insurance policy. Make sure that you consider all possible options, as your money might be of greater benefit if spent or invested, elsewhere.


Official figure released by the Department for Communities and Local Government (DCLG) this morning showed a national rise on 14% in the numbers of people risking their lives on the streets. In Nottingham the figure remained unchanged – with 9 people sleeping rough on an average night.
*Listen to Street Outreach Manager Jason Marriott on BBC Radio Nottingham talking about this issue.
Framework, which has been operating a street outreach service in the city since 1997, and helps hundreds of people every year who find themselves sleeping rough. The team brings direct support and solutions to people sleeping rough – identifying what problems they have and in many cases helping them to access Framework accommodation.
Between April 1 and December 31 Framework's Street Outreach Team found 227 individuals sleeping rough in the city. The vast majority of them were helped very quickly to put an end to their rough sleeping, but 13 per cent of these were found ten times or more, indicating more serious problems for the team to overcome.
Framework Outreach Manager Jason Marriott said: "Whilst nine people sleeping rough is still nine too many, we are working very hard to keep a lid on the problem of rough sleeping in Nottingham, and are very proud of the help we have given to people at a desperate time in their lives. We know that if we were unable to carry on this work the level of rough sleeping in the city would increase significantly, as more people arrived on the streets and fewer people left.
Members of Framework's Street Outreach Team respond to local intelligence and visit known rough sleeping sites in the early hours of the morning – the best times for finding people sleeping rough. They also liaise directly with other agencies to identify and help people who are about to sleep rough – often for the first time. The team also works directly with The Queen's Medical Centre to ensure that homeless people leaving hospital have somewhere safe to go.
If people do see somebody who they think is sleeping rough, the most effective way for them to help is by calling Framework's Rough Sleepers Hotline 24 hours a day on 0800 066 5356. This resource is also used by rough sleepers themselves to ask for help.
Framework has also expressed concern about the numbers of people still sleeping rough in the rest of the county – particularly in the North – and is calling for an urgent dialogue with local authorities to address the issue.


The Continental is a restaurant with sophisticated European flair, featuring a full-service bar and open garden terrace. The restaurant offers contemporary European fare that balances authentic flavours with a touch of refinement. The stunning interiors exude an easy sophistication, framed by a distinctively textured ceiling and uninterrupted glass windows that afford expansive views of the lush garden terrace and bathe the restaurant in natural sunlight during the day.
The tartare is made of Tuna from Portugal and molded on top of avocado puree then garnished with an herb salad.
The Australian skirt steak is marinated with smoked paprika and herbs, then placed on top of the salad of tomato, rocket and beetroot.
Spaghetti served with shrimps and lobster meat in lobster cream sauce with chopped parsley, lemon juice and topped with rocket.


text:
Q: When installing node 14.18.1 using nvm my mac uses python 3.9 and throws error on installation I have an m1 mac with big surr.
I needed node v14 to run an old angular app. i had nodev16 ialraedy installed so i tried to install nvm . installed successfully and i have no problem installing any of the different versions of node v16 but when installing node 14.18.1 it is using python 3.9 for some weird reason.
I have installed python before  is it by mistake using python 3.9 instead of 2.7
also i am searching internet and stack overflow and i read that node v14 cant be run on m1 mac is this true?
can someone please tell how to solve this error.
nvm install 14.18.1
Downloading and installing node v14.18.1...
Downloading https://nodejs.org/dist/v14.18.1/node-v14.18.1-darwin-arm64.tar.xz...

curl: (22) The requested URL returned error: 404
Binary download from https://nodejs.org/dist/v14.18.1/node-v14.18.1-darwin-arm64.tar.xz failed, trying source.
grep: /Users/rohitkrishnamoorthy/.nvm/.cache/bin/node-v14.18.1-darwin-arm64/node-v14.18.1-darwin-arm64.tar.xz: No such file or directory
Provided file to checksum does not exist.
Binary download failed, trying source.
Detected that you have 8 CPU core(s)
Running with 7 threads to speed up the build
Clang v3.5+ detected! CC or CXX not specified, will use Clang as C/C++ compiler!
Local cache found: ${NVM_DIR}/.cache/src/node-v14.18.1/node-v14.18.1.tar.xz
Checksums match! Using existing downloaded archive ${NVM_DIR}/.cache/src/node-v14.18.1/node-v14.18.1.tar.xz
$>./configure --prefix=/Users/rohitkrishnamoorthy/.nvm/versions/node/v14.18.1 <
Node.js configure: Found Python 3.9.6...
INFO: configure completed successfully
/Library/Developer/CommandLineTools/usr/bin/make -C out BUILDTYPE=Release V=0
  touch /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/node_dtrace_header.stamp
  touch /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/specialize_node_d.stamp
  c++ -o /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/icuucx/deps/icu-small/source/common/uniset.o ../deps/icu-small/source/common/uniset.cpp '-DV8_DEPRECATION_WARNINGS' '-DV8_IMMINENT_DEPRECATION_WARNINGS' '-D_DARWIN_USE_64_BIT_INODE=1' '-DOPENSSL_NO_PINSHARED' '-DOPENSSL_THREADS' '-DU_COMMON_IMPLEMENTATION=1' '-DU_ATTRIBUTE_DEPRECATED=' '-D_CRT_SECURE_NO_DEPRECATE=' '-DU_STATIC_IMPLEMENTATION=1' '-DUCONFIG_NO_SERVICE=1' '-DU_ENABLE_DYLOAD=0' '-DU_HAVE_STD_STRING=1' '-DUCONFIG_NO_BREAK_ITERATION=0' -I../deps/icu-small/source/common  -O3 -gdwarf-2 -mmacosx-version-min=10.13 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -std=gnu++1y -stdlib=libc++ -fno-exceptions -fno-strict-aliasing -MMD -MF /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/.deps//Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/icuucx/deps/icu-small/source/common/uniset.o.d.raw   -c
  c++ -o /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/icuucx/deps/icu-small/source/common/dictbe.o ../deps/icu-small/source/common/dictbe.cpp '-DV8_DEPRECATION_WARNINGS' '-DV8_IMMINENT_DEPRECATION_WARNINGS' '-D_DARWIN_USE_64_BIT_INODE=1' '-DOPENSSL_NO_PINSHARED' '-DOPENSSL_THREADS' '-DU_COMMON_IMPLEMENTATION=1' '-DU_ATTRIBUTE_DEPRECATED=' '-D_CRT_SECURE_NO_DEPRECATE=' '-DU_STATIC_IMPLEMENTATION=1' '-DUCONFIG_NO_SERVICE=1' '-DU_ENABLE_DYLOAD=0' '-DU_HAVE_STD_STRING=1' '-DUCONFIG_NO_BREAK_ITERATION=0' -I../deps/icu-small/source/common  -O3 -gdwarf-2 -mmacosx-version-min=10.13 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -std=gnu++1y -stdlib=libc++ -fno-exceptions -fno-strict-aliasing -MMD -MF /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/.deps//Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/icuucx/deps/icu-small/source/common/dictbe.o.d.raw   -c
  c++ -o /Users/rohitkrishnamoorthy/.nvm/.cache/src/node-v14.18.1/files/out/Release/obj.target/icuucx/deps/icu-small/source/common/chariter.o ../deps/icu-small/source/common/chariter.cpp '-DV8_DEPRECATION_WARNINGS' '-DV8_IMMINENT_DEPRECATION_WARNINGS' '-D_DARWIN_USE_64_BIT_INODE=1' '-DOPENSSL_NO_PINSHARED' '-DOPENSSL_THREADS' '-DU_COMMON_IMPLEMENTATION=1' '-DU_ATTRIBUTE_DEPRECATED=' '-D_CRT_SECURE_NO_DEPRECATE=' '-DU_STATIC_IMPLEMENTATION=1' '-DUCONFIG_NO_SERVICE=1' '-DU_ENA

A: You might need to uninstall python 3.9 and install Python 2.7.18.
Node 14.18.1 does work on m1 mac but if you update to Monterey 12.3, the pre-installed Python will be removed. So you might have to install it again.


At the heart of the charity's philosophy is the prevention and cure of consumer debt problems in the UK.
Whilst our primary focus is on helping those that are in need of advice and support today, we strongly believe that improving financial literacy amongst the next generation is key to tackling increasing levels of unmanageable consumer debt in the UK.
the provision of free, impartial and appropriate debt advice to people with unaffordable debt.
to help people with debt problems to gain access to appropriate solutions that will help them.
to promote education, for the public benefit, in financial capability and money management so as to reduce the likelihood of debt misuse.
to undertake or fund research to understand why problem debt happens and its effect on individuals, families and the wider United Kingdom economy and to disseminate useful results.


text:
Neudecker, Christiane
Nirgendwo sonst (Nowhere Else)
Luchterhand Literaturverlag, February 2008, 272 pp.
SAMPLE TRANSLATION
This is a novel about how a journey to Burma at a critical stage in his life helps a young man to come to terms with his recent past and opens up the future. When we first meet him, this unnamed narrator is searching Mandalay for Sine, a Danish girl he recently met and fell in love with but whom he has lost after a quarrel.
To complicate matters, the narrator also has a girlfriend back in Berlin, a theatre director who grew up in the old GDR and made a daring escape in her teens into West Berlin. She too has travelled in Burma and must, thinks the narrator, have felt a particular affinity for the country, divided as it is between the prettified areas that tourists are allowed to see and those in the brutal grip of the military, a situation not dissimilar in feel to that in the old GDR. In a mountain village in Burma she had met opponents of the military regime and taken photographs home to show to the narrator. But shortly after her return a fire in their Berlin flat and a jump from a third-floor window have left her in a coma from which she is not expected to recover.
The young man's journey to Burma has the ostensible aim of giving the developed photographs to the people of the village concerned. Its deeper purpose, however, is for the narrator to come to terms with his situation, an attempt to find what is called 'closure'. In an ill-fated and confused moment, in front of Sine, he assumes his Berlin companion's experience, pretending that it was he and not she who made the dangerous escape to the West. The final break-up of their relationship, however, is a later event, when she glances inside his passport and discovers his place of birth: Cologne, thus very much the West.
It comes as no surprise to discover from the acknowledgements that Neudecker has herself travelled in Burma and shares with her characters a deep concern about the political situation of that country. The result is not just a gripping and absorbing tale, and a very pleasurable read, but a book that will stay in the reader's mind during what look like being troubled times for Burma still ahead.
'These stories are a wonderful discovery. Places, both foreign and familiar, appear in a new light. Christiane Neudecker's language is contemporary, straightforward and beautiful.'– Author Gregor Hens on In der Stille ein Klang
Christiane Neudecker was born in 1974 and studied theatre directing at the Ernst Busch Theatre School in Berlin. In 2005 she published her prose debut, a book of short stories entitled In der Stille ein Klang, for which she received the Wolframvon- Eschenbach prize and other recognition. Nirgendwo sonst is her first novel.
Previous works include:
In der Stille ein Klang (2005, Luchterhand)
Application for assistance with translation costs – Germany
Verlagsgruppe Random House GmbH
81673 Munich, Germany
Tel: +49 89 41 36 3313
Email: gesche.wendebourg@randomhouse.de
Contact: Gesche Wendebourg
Luchterhand Literaturverlag was founded by Hermann Luchterhand in 1924 and has been publishing literary titles since 1954, an early and triumphant success being Günter Grass's novel Die Blechtrommel (1959). Its list includes literary fiction and poetry, as well as scrupulously prepared editions of authors' complete works. In 1997 the firm was voted Publishing House of the Year by the German trade journal Buchmarkt. Luchterhand is now part of the Random House Group. Authors include Christa Wolf, Ernst Jandl, Pablo Neruda, António Lobo Antunes, Will Self, Frank McCourt, Hanns-Josef Ortheil and Terézia Mora.


text:
Global Resource Politics
EU's strategic dependence on Russian energy
As shown in the table, Russia, and specifically Gazprom, is the largest single supplier of gas to European countries.
In 2013, Gazprom exported a record volume of gas to Europe, significantly exceeding deliveries in the 2008– 2012 period and, due to a fall in European demand and deliveries from other indigenous and external suppliers, representing 34 per cent and 30 per cent respectively of European imports and demand (Dickel et. al, p. 4).
Geographical patterns of dependence on Russia
Turkey doubled its imports in the 2000s, and the UK imported no Russian gas prior to 2005 but had become Gazprom's fourth largest market by 2013. Aside from these countries, only Italy and Poland imported significantly more Russian gas in 2013 than they did a decade earlier, and many imported significantly less.
Different countries have different degrees of exposure to disruption of supplies from Russia. Germany and Italy import significant amount of gas from Russia but are protected from disruptions, because they have sufficient storage capacity and a very strong, long-lasting, and established commercial and political relationship with Russia.
France, the Netherlands, Italy, and Greece possess indigenous supplies and enough LNG facilities to diversify away from Russia.
Poland is classified as a country with potentially high exposure to energy supply insecurity. Most of former Eastern European and Baltic countries fall in this category. They are already dependent on Russian gas, and coal consumption dominates the energy mix. If European climate policy is effective in driving these member states to reduce CO2 emissions by diversifying away from coal consumption, then their exposure to natural gas supply security will grow (Chi-Kong Chyong & Vessela Tcherneva 2015).
Contractual and pricing dependence
The vast majority of Russian gas exports to Europe are sold on long-term contracts varying from 10 to 35 years in length. These contracts contain take-or-pay clauses which require buyers to pay for a minimum annual quantity of gas, irrespective of whether they take that quantity. In the post-2008 period, the take-or-pay level in many of these contracts was reduced from 85 to 70 percent. European buyers are committed to purchasing more than 125 bcm of gas from Gazprom in 2020 and around 70 bcm in 2030 (Dickel et. al., p. 4).
Gazprom has priced its gas according to individual market conditions, creating apparent anomalies in prices across Europe. Distance from Russia plays no role in the pricing decision. On average countries in South-East Europe and Central Europe pay more than countries in Western Europe (Henderson & Mitrova, p. 34).
[Russian gas exports to European countries, 2003-2013]
Source: Ralf Dickel et.al.,p. 3.
Dickel, Ralf, et. al., "Reducing European Dependence on Russian Gas: Distinguishing Natural Gas Security from Geopolitics," Oxford Institute for Energy Studies, OIES Paper, No. 95, October 2014.
Chi-Kong Chyong & Vessela Tcherneva,"Europe's vulnerability on Russian gas," European Council on Foreign Relations, March 17, 2015.
Global Resource Politics: the Past, Present and Future of Oil, Gas and Shale
University of Groningen
Religion and Conflict
Understand and analyse the role of religion in conflicts and peacebuilding in present-day societies, with this free online course.
Making Sense of Data in the Media
Learn what numbers reveal, when and why they mislead, and how to spot fake news.
European University Institute (EUI)
Cultures and Identities in Europe
What does it mean to be European? Discover European cultures, identities and policies with this course.
Browse more in Politics & Society


Márquez was a second-half sub for El Tri against Germany.
Rafael Márquez set a new World Cup record on Sunday. The legendary Mexico defender became the third player to appear in five World Cups when he came in for Andrés Guardado in the 74th minute for El Tri against Germany. More impressively, by taking the captain's armband from Guardado, Rafa Márquez became the first player to captain five teams at the World Cup.
Rafa Márquez appeared in his first World Cup in 2002, captaining El Tri to the Round of 16 (where, for the sake of Mexico fans and Landon Donovan, I won't mention how the tournament ended).
He also captained Mexico at the 2006, 2010 and 2014 World Cups.
The only other players to have appeared in five World Cups are fellow Mexican Antonio Carbajal (1950-66) and German Lothar Matthäus (1982-98). Gianluigi Buffon went to five World Cups but only played in four (and missed the 2018 World Cup because of Sweden).
Rafa Márquez came on to shore up the Mexico defense as Juan Carlos Osorio prepared his team for the onslaught of the defending champion, which trailed 1-0 at half thanks to a great counterattack finished by Chucky Lozano.
Márquez also shares the record for most cards in a World Cup with six, shared with France's Zinedine Zidane and Brazil's Cafu.
Mexico held on for a 1-0 victory against Germany.


Communion Assistants help out at the time of Communion. We distribute Communion by the method of intinction, bread dipped into the chalice. While the Celebrant and the Assisting Minister distribute the Communion Bread, Communion Assistants will present the chalice to the communicant to dip the bread in the wine. For more information, please call Elaine Alexander or send her an email using the link above.


Canned goods are foodstuffs which are preserved by sealing the food in cans. Can goods is incorrect, as can may only serve as a verb or a noun. Canned is the adjective form of can. Canning came about as the answer to the problem of preserving food for soldiers during the Napoleonic wars. Nicolas Appert inventing canning in 1809, using glass jars. Home cooks and farmers still use glass jars to can their harvests, commercial canning is most often accomplished using metal cans. Today, grocery stores and supermarkets are filled with foods that are canned, or canned goods.
But you can can goods, can't you?


Through August's 'Dancing With A Ghost', Roger's already summer-satisfied the chilled, more Sunlounger-ish side of his mind. This month though sees him return to the very serious business of roadblocking clubfloors.
For Elevate's next excursion, Roger's reteamed with the Hawaii-to-LA shuttling singer/songwriter LeiLani. Having scaled some heady Beatport chart heights together through 'Love Heals You', its successor 'Eternal Time' is primed to climb higher yet.
Played out by a deliberately floor-provoking tempo, 'Eternal Time's substantial drums and brisk percussion rig a formidable platform the track. From there Roger floats in zephyr-ish harmonies, diffused, hovering, piano notes and super-heated pad & chord movements. LeiLani's expectant lyrics and blissed-filled song meanwhile cut straight to the heart of the track, lending it wistful 'endless summer' vibe.


A few weeks ago, I went to see the new film adaptation of The Great Gatsby with friends. Reviews had already forewarned me about the extensive use of anachronism, from the music to the costuming to the manners. Fitzgerald's novel has been adapted for film multiple times, beginning in 1926, a scant few years after its publication. The first adaptation, now lost, remains only in sketches and hints: a vignette of the hero in top hat, a supporting cast who will later be famous in very different roles. The only one that I have seen is the 1974 version with Robert Redford, who (in his heyday as film icon) was handsome and golden enough to play Gatsby most satisfactorily.
What struck me in this year's adaptation was its nightmarish, phantasmagorical character. Nick's story, in the original text, concludes with dream sequences, some reported as nightmare and some as history. The new adaptation takes them for keynote: the visual design of Daisy's house, and Gatsby's, has the quality of dream. Those sets of memory and imagination are far too large to be real; the casual contemporary use of computer generated imagery, now part of the cinematic palette, invokes dream and fairy-tale even in the midst of what is ostensibly a realist narrative. No longer attempting to imagine something real, this imagery stretches far beyond the traditional matte-painter's or modeler's art, to physically implausible palaces of dream and nightmare, to text floating across the screen. Nick Carraway, in a snowbound sanatorium, is re-imagined not only as the teller but as the author of the narrative.
This bravura technique is nothing unusual for the creator of graphic novels or artist's books, and more than artistically appropriate for a tale which is aware of its own telling. It's inspiring to see it brought to the screen, as a movie remembers its deep roots in literary and oral storytelling.
The narrator, Nick Carraway, is himself a personage at the edge of the story. One of the great technical allures of the original text is just how far the reader is left to figure out the unseen; the reader is herself a detective. The novel is multi-layered, and so infinitely susceptible of adaptation. It's a mirror not of its own times, but of the times of the artist adapting it.
Every adaptation is in and of its time, and this one is no different. The summer of 1922 is remembered by very few who were alive then, and next to none who were adults. Nick Carraway turns 30 that year, which means he would have been born in 1892. If he were alive now, he would be 111 years old. We stand now at a generational changing of the guard; World War I has already passed into legend, with the death of its last veterans.
There are as many ways to play Gatsby as Hamlet.
I have seen multiple stage adaptations of the novel, including the Guthrie Theater's relatively straightforward version and the six-hour marathon Gatz, which plays every single word in the novel as a play-within-a-play set in a run-down 1970s-vintage office suite. When Robert Redford played the role in the 1974 adaptation, he and the rest of the ensemble firmly placed themselves in the realistic theatrical and film tradition. Special effects, that announced themselves as such, would have seemed completely out of place in that film; but in this fairy-tale version, the CGI plays an important esthetic role, twisting and distorting the scale of reality.
Particularly in the handling of the repeating motif of the green light at the end of the dock, the post-processing turns realistic film into a moving tapestry that edges into the surreal. The blowing drapes in Tom and Daisy's front room, the sweeping camera that takes us from West Egg to East Egg in one heart-stopping bird's-eye swoop, the eternal twilight of the valley of ashes under the watchful glance of the disembodied eyes on the weathered billboard for a long-gone optician, all refigure Fitzgerald's novel as a fable of a world dancing over the abyss.
The mere mention that Tom Buchanan's people made their money from railroads. In the 1920s it went without saying that his roots were as thoroughly thuggish as Gatsby's, though in a more comprehensively successful way and several generations back.
Tom's mention of a fictitious racist tract called The Rise of the Colored Empires, which sets the period tone and establishes a characterization: the conqueror with a bad conscience who fears being overthrown by those he has trampled.
In 1922, World War I had changed the face of Europe and set off in its wake a wave of revolution, from the two Russian Revolutions of 1917 to uprisings in Germany and Hungary, and general strikes in U.S. cities. The armories that sit in American city centers date from the 1920s-1930s, when elites were panicking at the thought of revolution in their own back yard.
The adaptation glosses over the racial realities of the 1920s in showing us a far more integrated New York than actually existed at the time. What's not remembered here is that Harlem in the 1920s was a tourist destination for white curiosity-seekers. The Great Migration of African-Americans from the South to the cities of the North was well underway, given an extra impetus by lynchings and other reprisals against returning black veterans of the Great War.
Fitzgerald's narrative touches on this in the Russian emigre musician who presents a Jazz History of the World. In 1922, it's only in avant-garde circles that African-American music is being assimilated to 'mainstream.
The 1920s are also nicknamed the Jazz Age, when that uniquely African-American music was taking its first steps into the mainstream, and the likes of Louis Armstrong and Josephine Baker were taking European capitals by storm. Contemporary commentary, not all of it on the right, was comparing their success to barbarian invasion.
What echoes for me in the novel is but faintly touched upon in the adaption. THe 1920s cultural panic of the elites finds echoes in the present day as birth rates for non-whites overtake those for whites. In the 1920s, terror for the supposed "decline of the west" expressed itself in a wave of nativist insistence on "100% Americanism." During this period, my German-immigrant grandfather had a cross burned on his family's lawn by the Klan, in rural New Jersey. That American demographic panic played out in compulsory sterilization laws and yet further curbs on immigration, which decades later barred Jewish and other victims of Hitler's genocides from seeking asylum on these shores.
All of which has deep contemporary resonance, as certain nativist commentators go so far as to recommend repeal of the 14th Amendment.
Reading novels from the 1920s and 1930s, one becomes quite aware that the American admirers of Hitler and Mussolini (then just beginning their political careers) were quite mainstream, just like modern apologists for torture and surveillance. More than once, I've shivered wondering what horrors await us in the coming decades.
When history passes out of memory into 'once upon a time', some critical lessons are lost. I wonder sometimes if the legendary 70-year cycle upon which human foolishness is claimed to repeat itself is a function of living memory. Though in its transmogrification into fairytale and fantasy, this most recent version of Fitzgerald's Gatsby throws a livid light on the nightmare of 1920s excess, with more than a hint of the abyss over which it danced.
This entry was posted in Books, Film, Writing and tagged film review, The Great Gatsby. Bookmark the permalink.
I remember reading a throwaway comment in LA CONFIDENTIAL by James Ellroy from a the point of view of a woman who remembered hearing Aimee Semple MacPherson urge white women to have more babies to keep them from being swallowed up. I haven't done the research on MacPherson to back this up, but it does sound believable.
(another note on LA CONFIDENTIAL–there was mention of a woman named Glenda who was the mistress of a mobster *and* a prominent police official. I wonder how she scheduled her time? And even more off the wall, one wonders if this Glenda was like really, REALLY fond of pink cashmere sweaters, cf. ED WOOD).


Genesis Myers has a passion for the written word – a passion that she has turned into her very own business! Genesis offers hand made books on her website Bookbinder Extraordinaire. She is also an accomplished public speaker and Lincoln-Douglas debater. She has been bookbinding since the fall of 2013 and is already looking to expand what she offers!
Take a look at the video we recorded a couple of weeks ago and learn about how she got the idea, started her business, and why she did this rather than going out and getting a part time job. I think you will be inspired to start thinking about your own business and how you might earn extra money. It is hard work but very rewarding.
Thanks so much for taking a look at the video – if you have a moment please take the time to leave a comment for Genesis, follow her on Facebook or Pinterest, and take a look at her website!
Thank you so much for the interview Eva.
It was so much fun talking with you Genesis! Thank you!


text:
Demolition moratorium around The 606 trail gets Mayor Lori Lightfoot's backing, heads for City Council vote
By John Byrne
Homes along The 606 trail in Chicago are shown Jan. 14, 2020. (Jose M. Osorio / Chicago Tribune)
After questioning the legality of a demolition moratorium to address gentrification around The 606 trail last week, Mayor Lori Lightfoot on Tuesday endorsed a similar plan by Northwest Side aldermen who have been trying to find ways to stop working class families from getting priced out of their homes.
The new ordinance is smaller in scope than the one Lightfoot criticized last week, saying "we need to use a surgical knife and not a club" to deal with the housing problems in parts of Humboldt Park and Logan Square near the popular elevated park.
Instead of a 14-month moratorium on all demolition permits — which supporters hope would slow down developers who are quickly replacing two- and three-flats in the area with million-dollar single-family homes — the moratorium would now last just six months, until August.
And the boundaries of the moratorium were shrunk considerably, now stretching west to east from Kostner Avenue to California Avenue, and south to north from Hirsch Street to Armitage Avenue.
An earlier, larger version contained a chunk of the 32nd Ward on the eastern end of the moratorium zone, but Ald. Scott Waguespack, 32nd, said he didn't think the moratorium was legal, and his ward was removed.
Lightfoot questioned the moratorium herself in a Friday news conference. "So stopping all demolitions, I don't even know how we would do that as a practical matter. And doing it in such a wide swath, I have concerns about it, and I have concerns whether or not it would be viewed as a taking by property owners whose property would be affected," she said then.
Sign up for The Spin to get the top stories in politics delivered to your inbox weekday afternoons.
It's still there, but in a Tuesday statement, mayoral spokeswoman Lauren Huffman said Lightfoot backs the new version as a temporary measure.
"After discussions with the local aldermen, the updated ordinance presented at today's committee hearing provides a legally defensible, but a temporary path to allow for a more comprehensive means to address affordable housing preservation along The 606 trail," Huffman said in a statement. "Importantly, this latest version includes a shorter time frame for a moratorium on demolitions only and narrower geography, while preventing a unilateral ban on zoning approvals in order to preserve the rights of existing property owners in the area."
The Spin with Lisa Donovan Newsletter
Your essential take on local politics, delivered weekday afternoons.
The Housing Committee discussed the ordinance Tuesday, and Chairman Ald. Harry Osterman, 48th, set a Wednesday morning vote on the plan. If it passes, the full City Council would consider it later Wednesday.
Candidate vying to replace Cook County Clerk of Court Dorothy Brown files ethics complaint against rival for campaign funds
On Chicago's South Side, the sincerity of Pete Buttigieg's quest to gain support for his Democratic presidential bid from African Americans gets questioned
The Spin: Jeanne Ives' camp blames typo for campaign flyer gaffe | Mayor Lightfoot makes MLK call to action | Is former state Rep. Luis Arroyo pleading guilty?
Humboldt Park Ald. Roberto Maldonado, 26th, said he would rather have included a moratorium on all building permits in a wider area for a longer time, but he can live with this compromise plan. If the city can't come up with a longer term solution to protect working class residences by August, Maldonado said he would try to extend the demolition ban.
"Gentrification ... is very parochial," Maldonado said. "It's citywide, the crisis, but it's very peculiar to many different communities. And so I think that we should treat it as such."
jebyrne@chicagotribune.com
Twitter @_johnbyrne


Salt Lake City, UT, Feb 10, 2019.- The study published on Feb. 4, 2019, in the journal Nature Communications.
Many scientists are building lasers with quantum dots. Quantum dots are tiny crystals of semiconductor materials grown to sizes of only about 100-atoms across. The size of the crystals determines the light beam's wavelength, from blue light to red light and even into the infrared.
People are interested in quantum dot lasers because they can tune properties simply by growing the crystals in different sizes by using different semiconducting materials and choosing different shapes and sizes of the lasers. The downside is that quantum dot lasers often contain miniscule defects that split the light into multiple wavelengths, which distributes the beam's energy and makes it less powerful. Ideally, you want the laser to concentrate the power into one wavelength.
The researchers then coupled two lasers together to correct the wavelength splitting. They put one laser at full gain, which describes the maximum amount of energy possible. To achieve full gain, the scientists shined a green light, called the "pump" light, onto the first laser. The quantum dot material absorbed the light and re-emitted a more powerful beam of red light. The stronger the green light they shined on the laser, the higher the gain in energy. When the second laser had no gain, the difference between the two lasers prevented any interaction, and splitting still occurred. However, when the team shined a green light onto the second laser, its gain increased, closing the gain difference between the two lasers. Once the gain in the two lasers became similar the interaction between the two lasers corrected the splitting and focused the energy into a single wavelength. This is the first time anyone has observed this phenomenon.


text:
William Shakespeare's Works/Comedies/As You Like It
< William Shakespeare's Works | Comedies
About the PlayEdit
As You Like It is a comedy by William Shakespeare written between 1599 and 1600. While the plot is meant to take place primarily in a duchy of France, the majority of the action actually takes place in the Forest of Arden.
The text for the play itself can be found at the bottom of the page. The purpose of this Wikibook is as a study guide.
ActsEdit
Act IV
Act V
Dramatis PersonæEdit
Duke Senior
Duke Frederick
Jacques de Boys
Le Beau
Sir Oliver Martext
Corin and Silvius
Wikisource has original text related to:
Retrieved from "https://en.wikibooks.org/w/index.php?title=William_Shakespeare%27s_Works/Comedies/As_You_Like_It&oldid=3267600"


text:
Tag: Seattle budget 2020
City Council, Cops, Equity, homelessness, human services, Mayor Durkan, Police, South Seattle Emerald	 September 22, 2020 September 22, 2020
In Surprise Vote, Seattle City Council Overrides Mayor's 2020 Budget Veto
This story first appeared in the South Seattle Emerald.
The Seattle City Council voted 7-2 to override Mayor Jenny Durkan's veto of the 2020 midyear "rebalancing" budget package they adopted in August, setting the stage for a showdown with the mayor in the upcoming 2021 budget discussions, which kick off formally next Tuesday.
The vote essentially reinstates the midyear budget the council passed back in August, after several feverish weeks of work to come up with a proposal that could win a veto-proof council majority. That budget included fairly modest cuts to the Seattle Police Department (a reduction of 100 positions, many achieved through attrition) and investments in community organizations that work to reduce violence and improve community safety, as well as a $3 million down payment on participatory budgeting.
Council members Alex Pedersen (D-4, Northeast Seattle) and Debora Juarez (D-5, North Seattle) voted to sustain the mayor's veto. Pedersen said he supported most elements of a "compromise" bill that council president Lorena González introduced in case the veto override vote failed, and said he believed that "we get more done in a faster and more sustainable way when we work together." Juarez, who frequently votes with Pedersen, was the only council member who didn't offer any public explanation of her vote.
PubliCola is supported entirely by generous contributions from readers like you.
If you enjoy breaking news, commentary, and deep dives on issues that matter to you, please support this work by donating a few bucks a month to keep this reader-supported site going.
If you don't wish to become a monthly contributor, you can always make a one-time donation via PayPal, Venmo (Erica-Barnett-7) or by mailing your contribution to P.O. Box 14328, Seattle, WA 98104. I'm truly grateful for your support.
Council members who voted to overturn the mayor's veto said that community members had made clear that they want the city to reduce police spending and reinvest in community-based programs more quickly than Durkan is willing to move. "There is broad agreement in the community that there is an urgent need to divest [from] the systems that have acted" against the interests of Black, Indigenous, and people of color (BIPOC) communities, council member Teresa Mosqueda said.
After the vote, King County Equity Now and Decriminalize Seattle, two groups that have been at the virtual council table during their budget discussions, issued a statement applauding the council for its vote and urging them not to backslide during budget negotiations this fall. "It should not take such prolonged, sustained community efforts for this minimal change but we recognize that Council's move to override the Mayor's anti-Black veto marks an urgent break from the decades of votes to expand racist policing," the statement said. "Going forward, we expect Councilmembers to continue to resist the Mayor's attempts to rewrite legislation that has already passed.
The mayor immediately denounced the vote. In a statement, a spokeswoman for the mayor's office said Durkan thought she and the council had reached a compromise—the backup "compromise," which PubliCola described in detail this morning—but that "they chose a different path."
"Votes do have consequences," the statement continued. "Because of Council's actions today, the Navigation [T]eam will be eliminated, severely restricting the City's ability to move people out of homelessness and deal with encampments for the rest of this year. The City will move forward with layoffs for the City staff who are coordinating and helping individuals experiencing homelessness at encampments across the City."
The mayor's statement appears to refer only to the civilian members of the Navigation Team—the field coordinators who manage encampment removals and cleanups, and the three "system navigators" who do direct outreach to people living in encampments. The team also includes 14 police officers, whose positions are subject to bargaining through the Seattle Police Officers Guild.
Durkan has the ability to direct the Human Services Department to lay off these workers, but if she does so unilaterally, without funding alternative outreach strategies and equipping them to succeed, the result could be some level of chaos. The council's budget didn't just call for slashing the team—it also directed the mayor to spend the money saved through staffing cuts to expand existing contracts with outreach providers, such as the nonprofit outreach nonprofit REACH, and to transfer the Navigation Team's outreach function to those providers.
The transition wouldn't just be a matter of shifting personnel. Currently, the Navigation Team has exclusive access to hundreds of shelter beds, which team members can access through a proprietary program called NavApp. The Human Services Department would need to hand over access to this system to any new outreach provider if it wanted to prevent a disruption in services, and to comply with a council requirement that the team report regularly on referrals and other data.
Of course, the mayor's statement could be bluster. (Her office did not immediately respond to an email asking if it was). Durkan's 2021 budget announcement, coming next Tuesday, reportedly includes a proposal to transition the Navigation Team into a smaller group focused on outreach and engagement rather than encampment removals; the new-look Nav Team would also work with encampment residents to reduce their impact on surrounding communities instead of routinely declaring encampments "obstructions" and removing them without notice, according to people familiar with the document.
Legislation that isn't signed by the mayor takes 30 days to take effect. Durkan could wait until next week, roll out her proposal, and negotiate a new deal with the council that would keep the Navigation Team in a different form. Or she could stick with her initial statement, start sending out pink slips, and eliminate the changes to the Navigation Team from her budget. The council indicated today that they're still open to amending the budget they adopted, which is now the official budget for the rest of 2020. The next move will be the mayor's.
Filed under: Lorena Gonzalez, Navigation Team, police defunding, Seattle budget 2020, Seattle Police Department
Bikes, campaign finance, City Council, Elections, Featured, homelessness, housing, human services, Mayor Durkan, Morning Crank, Police	 November 21, 2019 November 21, 2019
Council Reshuffles Durkan's Budget, Cop Encampment Training Led to Just Nine Shelter Referrals, and Shaun Scott's Near-Win
Mayor Durkan announces her plans for spending Mercer Megablock proceeds.
I'm back from vacation, the council has almost passed a 2020 budget with aggressive edits to Mayor Jenny Durkan's proposal, and the election is officially all-but-over (results will be certified on Friday). Here are a few items that are worth your attention.
1. Semi-final election results: Although the local and (to a much lesser extent) national press has fixated on the fact that incumbent Kshama Sawant came back from behind to defeat Amazon-backed challenger Egan Orion by more than 1,750 votes, an equally fascinating late-voting story has played out in Northeast Seattle's District 4, where neighborhood activist and former Tim Burgess aide Alex Pedersen, who was backed by both the business lobby and Burgess' People for Seattle PAC, is poised to defeat Democratic Socialists of America candidate Shaun Scott by fewer than 1,400 votes.
Sawant's swing was more dramatic, but for Scott to come so close in a district that is less than 3 percent African American—Scott is black—and with so much less money and institutional funding was a sign, perhaps, that District 4, which includes the University of Washington along with a number of higher-turnout precincts with views of Lake Washington and incomes to match, wasn't entirely convinced by Pedersen and Burgess' appeals to "Seattle Is Dying"-style populism. Or that students were compelled to actually turn out for a charismatic, hard-campaigning, issue-oriented socialist; we'll know more once precinct-level data becomes available.
Egan Orion's loss to incumbent Kshama Sawant has overshadowed Shaun Scott's comeback in District 4.
2. Council pushes back on Durkan's budget: Before I left, the council had already indicated it planned to alter Mayor Jenny Durkan's budget proposal pretty dramatically.
I reported on many of the changes back when they were still in the proposal stage, including:
• Amendments redirecting millions in proceeds from the sale of the Mercer Megablock to fund housing and bike lanes in South Seattle (which has no uninterrupted safe bike connections to downtown);
• A proviso requiring the Human Services Department to provide quarterly reports on what the encampment-clearing Navigation Team is up to;
• The elimination of funds to relocate a tiny house village in Georgetown that both neighbors and the city agree is working well;
• Cutting the size and scope of a proposed program that would help homeowners build second units and rent them out as moderate-income housing and requiring that the city do a race and social justice analysis of the proposal;
• Reducing or freezing funds for Durkan's plans for dealing with "prolific offenders," including a proposed expansion of probation;
Out of an unknown number of individuals contacted by the Navigation Team as the result of 124 officer calls, nine people "accepted" a referral to shelter, and an unknown number of those nine actually showed up at shelter.
• Repurposing some of the $3 million in soda tax revenues Durkan had proposed setting aside to fund capital improvements to P-Patches, including gardens in Ballard and Capitol Hill, for other initiatives to promote healthy food in low-income communities most impacted by the tax, and stipulating that any soda tax revenues that go to the P-Patch program must be spent in designated Healthy Food Priority Areas; and
ª $3.5 million in funding for the LEAD program, whose planned expansion Durkan did not propose funding. The new money, along with a $1.5 million grant from the Ballmer foundation, will allow the pre-arrest diversion program to manage its ever-expanding caseloads in the coming year.
Support The C Is for Crank
The C Is for Crank is supported entirely by generous contributions from readers like you. If you enjoy the breaking news, commentary, and deep dives on issues that matter to you, please support this work by donating a few bucks a month to keep this reader-supported, ad-free site going. Your $5, $10, and $20 monthly donations allow me to do this work as my full-time job, so please become a sustaining supporter now. If you don't wish to become a monthly contributor, you can always make a one-time donation via PayPal, Venmo (Erica-Barnett-7) or by mailing your contribution to P.O. Box 14328, Seattle, WA 98104. Thank you for keeping The C Is for Crank going and growing. I'm truly grateful for your support.
In addition, the council adopted a number of smaller-ticket items and placed conditions on some of the mayor's spending proposals, including:
• A request that the Human Services Department survey service providers that provide case management to homeless clients who wear Bluetooth-enabled "beacons" provided by a company called Samaritan, which created an app enabling donors to read up on the personal stories of beacon wearers in the area and give money to businesses and agencies on their behalf. Homeless participants can access the donations in the form of goods or debit cards, and are required to participate in case management and report on their progress through the app. The proviso asks HSD to find out what kind of burden the app is placing on agencies that provide case management, since the company requires its clients to participate in case management but does not fund any actual case managers. Continue reading "Council Reshuffles Durkan's Budget, Cop Encampment Training Led to Just Nine Shelter Referrals, and Shaun Scott's Near-Win" →
Filed under: Election 2019, homelessness, HSD, Mayor Durkan, Mercer megablock, Navigation Team, Seattle budget 2020, Shaun Scott, unauthorized encampments


Some time ago, the old Sudoku Players Forum disappeared into a really nasty commercial site. Most of the messages have been recovered, and are posted at the new PlaySudoku Forum. However, you will still find broken links to the old site.