text:
\section{Introduction}

The logical depth is related to complexity with bounded resources.
Computing a string $x$ from one of its shortest programs
may take a very long time.
However, computing the same string from a program a simple `print$(x)$'
program of length about $|x|$ bits takes very little time.

A program for $x$ of larger length than a given program
for $x$ may decrease the computation time but except for
pathological cases does not increase it.
Therefore, except for pathological cases we associate
the longest computation time with a shortest
program for $x$. Such a program is incompressible.
There arises the question how much time can be saved
by computing a given string from a $b$-incompressible  program
(a program that can be compressed by at most $b$ bits) when $b$ rises.
\subsection{Related Work}
The minimum time to compute a string by a $b$-incompressible
program was first considered in
\cite{ben88}. This minimum time
is called the {\em logical depth} at significance
$b$ of the string concerned.
Definitions, variations, discussion and early results can be found
in the given reference.
A more formal treatment as well as an intuitive approach was given in
the textbook \cite{LiVi}, Section 7.7.
In \cite{afmv06} the notion of {\em computational}
depth is defined as $K^d(x) -K(x)$ (see definitions below).
This would equal the negative logarithm of the expression
$Q^d_U(x)/Q_U(x)$ in Definition~\ref{def.ld} if the following were
proved. Since \cite{lev74}
proved in the so-called Coding Theorem that $-\log Q_U(x) = K(x)$ up
to a constant additive term it remains to prove
$-\log Q_U^d (x) = K^d(x)$ up to a small
additive term. The last equality
is a major open problem in Kolmogorov complexity theory,
see \cite{LiVi} Exercises 7.6.3 and 7.6.4.

\subsection{Results}
All computations below vary by the choice
of reference optimal prefix machine.
We prove that there is an infinite sequence of strings,
$x_1,x_2, \ldots$ with $|x_{m+1}|=|x_m|+1$,
such that for every $m>0$ each $x_m$ is computed by
$b_1^m,b_2^m$-incompressible programs
in $d_1^m,d_2^m$ steps, respectively,
with $b_2^m=b_1^m+1$
while $d_1^m-d_2^m$ rises faster than any computable function
but not faster than the Busy Beaver function
the first incomputable function \cite{Ra62}
(Theorem~\ref{theo.3} and Corollary~\ref{cor.2}).
We call $b_j^m$ the ``significance'' of ``logical
depth'' $d_j^m$ of string $x_m$ ($j =1,2$).
We prove next (Theorem~\ref{theo.BB}) for this
infinite sequence of strings that
the running times of shortest programs associated with
this sequence
rise faster than any computable function but again not
so fast as the Busy Beaver function. We also give a new proof
(provided by a referee) of a new result
showing the closeness of the two versions of logical depth
(Theorem~\ref{Teo1}).

The rest of the paper is organized as follows: in Section~\ref{sect.2},
we introduce some notation, definitions and basic results needed
for the paper.
In Section~\ref{instabilidade}, we prove the results mentioned.

\section{Preliminaries}\label{sect.2}
We use {\em string} or {\em program} to mean a finite binary string. The
alphabet is $\Sigma=\{0,1\}$, and $\Sigma^*= \{0, 1\}^*$ is the
set of all strings. Strings are denoted by the
letters $x$, $y$ and $z$. The {\em length} of a
string $x$ (the number of occurrences of bits in it) is
denoted by $|x|$, and the {\em empty} string by $\epsilon$. Thus,
$|\epsilon|=0$.
We use the notation $\Sigma^n$ for the set of strings of
length $n$.
We use the binary logarithm which is denoted by ``$\log$.''
Given two functions $f$ and $g$, we say that $f \in O(g)$ if there is a constant $c >0$,
such that $f(n) \leq c \cdot g(n)$,
for all but finitely many natural numbers $n$.

\subsection{Time Bounds}
Often the resource-bounds are
{\em time constructible}. There are many definitions. For example,
there is a Turing machine whose running time is exactly $t(n)$
on every input of size $n$, for some function $t: \mathbb N \to \mathbb N$,
where $\mathbb N$ is the set of natural numbers. However,
in this paper there are functions that
are not time constructible. An example
is the Busy Beaver function $BB: \mathbb N \to \mathbb N$ (Definition~\ref{bbfunction})
which is not computable
(it rises faster than any computable function).
In this case, and when we just mean a number of steps, we
indicate in the superscript the number of steps taken, usually
using $d$.
 Given a program $p$, we denote its running time (the number of
steps taken by the reference optimal prefix Turing machine defined
below) by $time(p)$.

\subsection{Computability}
A pair of nonnegative integers,
such as $(p,q)$ can be interpreted as the rational $p/q$.
We assume the notion of a computable function with rational arguments
and values.
A function $f(x)$ with $x$ rational is \emph{semicomputable from below}
if it is defined by a rational-valued total computable function $\phi(x,k)$
 with $x$ a rational number
and $k$ a nonnegative integer
such that $\phi(x,k+1) \geq \phi(x,k)$ for every $k$ and
  $\lim_{k \rightarrow \infty} \phi (x,k)=f(x)$.
This means
that $f$ (with possibly real values)
can be computed in the limit from below
(see \cite{LiVi}, p. 35).  A function $f$ is  \emph{semicomputable
from above} if $-f$ is semicomputable from below.
 If a function is both semicomputable from below
and semicomputable from above then it is \emph{computable}.

\subsection{Kolmogorov Complexity}

We refer the reader to the textbook
\cite{LiVi} for details, notions, and history.
We use Turing machines with a read-only one-way input tape, one or more
(a finite number) of work tapes at which the computation takes place,
and a one-way write-only output tape. All tapes are semi-infinite,
divided into squares, and each square can contain a symbol
from a given alphabet or blanks.
The machine uses for all of its
tapes a finite alphabet and all tapes are one-way infinite.
Initially, the input tape is inscribed with a
semi-infinite sequence of 0's and 1's.
The other tapes are empty (contain only blanks).
At the start, all tape heads scan
the leftmost square on their tape. If the machine
halts for a certain input then the contents of the scanned segment
of input tape is called the {\em program} or {\em input}, and the contents of
the output tape is called the {\em output}. The machine thus described
is a {\em prefix Turing machine}. Denote it by $T$.
If $T$ terminates, then the program is $p$
and the output is $T(p)$. The set
${\cal P}=\{p:T(p)<\infty \}$ is {\em prefix-free} (no element of the set
is a proper prefix of another element). By the ubiquitous Kraft inequality
\cite{Kr49} we have
\begin{equation}\label{eq.kraft}
\sum_{p \in {\cal P}} 2^{-|p|} \leq 1.
\end{equation}
The same holds for a fixed conditional or auxiliary.
The above unconditional case
corresponds to the case where the conditional is $\epsilon$.
Among the universal prefix-free Turing machines we consider a special
subclass called {\em optimal}, see Definition 2.0.1 in \cite{LiVi}.
To illustrate this concept: let $T_1,T_2, \ldots$ be a standard enumeration of (prefix)
Turing machines, and let $U_1$ be one of them.  If $U_1 (i,pp) = T_i(p)$
for every index $i$ and program $p$ and outputs 0 for inputs that are
not of the form $pp$ (doubling of $p$),
then $U_1$ is also universal. However,
$U_1$ can not be used to define Kolmogorov complexity. For that we need
a machine $U_2$ such that $U_2(i,p)=T_i(p)$ for every $i,p$.
A machine such as $U_2$ is called an {\em optimal} prefix Turing machine.
Optimal prefix Turing machines are a strict subclass of
universal prefix Turing machines. The above
example illustrates the strictness. To define Kolmogorov
complexity we require optimal prefix Turing machines
and not just universal prefix Turing machines.
The term `optimal' comes from the founding paper \cite{Ko65}.

It is still possible that two different optimal prefix Turing machines
have different computation times for the same input-output pairs or
even different sets of programs. To avoid these problems we
fix a reference machine. Necessarily, the reference machine has a
certain number of worktapes.
A well-known result of \cite{HeSt66} states that $n$ steps of
a multiworktape
prefix Turing machine can be simulated in $O(n \log n)$ steps
of a two-worktape prefix Turing machine. Thus,
for  such a simulating optimal Turing machine $U'$ we have
$U'(i,p)=T_i(p)$ for all $i,p$; if $T_i(p)$ terminates in time $t(n)$
then $U'(i,p)$ terminates in time $O(t(n)\log t(n))$.
Altogether, we fix such an simulating (as above)
optimal prefix Turing machine $U'$ and call it the {\em reference
optimal prefix Turing machine} $U$.

\begin{definition}
Let $U$ be the reference optimal prefix-free Turing machine,
and $x,y$ be strings.
The \em prefix-free Kolmogorov complexity \em
$K(x|y)$ of $x$ given $y$ is defined by
$$
  K(x|y)=\min \{|p| : U(p,y)= x \}.
$$
The notation $U^d(p,y)=x$ means that $U(p,y)=x$ within
$d$ steps.
The \em $d$-time-bounded
prefix-free Kolmogorov complexity \em $K^{d}(x|y)$ of $x$ given $y$ is
defined by
$$K^{d}(x|y) =\min \{|p| : U^d(p,y)=x \}.$$
\end{definition}

The default value for the auxiliary input $y$ for the program $p$,
is the empty string $\epsilon$. To avoid overloaded notation we usually
drop this argument in case it is there.
Let $x$ be a string. Denote by $x^*$ the first shortest program in standard
enumeration such that $U(x^*)=x$.

\begin{definition}
Let $|x|=n$.
The string $x$ is \em $c$-incompressible \em if \[K(x)\geq n+K(n)-c.\]
The string $x$ given $n$ is \em $c$-incompressible \em if \[K(x|n)\geq n-c.\]
\end{definition}

A simple counting argument can show the existence of $c$-incompressible strings
($c$-incompressible strings given their length)
of every length for the plain complexity $C(x)$.
Since $K(x) \geq C(x)$ ($K(x|n \geq C(x|n)$ we have the following:
\begin{lemma}\label{lemmai}
There are at least $2^n(1-2^{-c})+1$ strings $x\in \Sigma^n$ (given $n$)
that are $c$-incompressible with respect to prefix Kolmogorov complexity.
\end{lemma}

\section{Logical Depth}
The logical depth \cite{ben88} consists of two versions.
One version is based on $Q_U(x)$,
the so-called {\em a priori} probability \cite{LiVi} and its
time-bounded version. Here $U^d(p)$ means that $U(p)$ terminates in
at most $d$ steps.
\[
Q_U(x)=\sum_{U(p)=x}2^{-|p|}, \;\;\;\;\;Q^d_U(x)=\sum_{U^d(p)=x}2^{-|p|}
\]
For convenience we drop the subscript and consider $U$ as understood.
\begin{definition}\label{def.ld}
Let $x$ be a string, $b$ a nonnegative integer.
The logical depth, tentative version 1,
of $x$ at significance level $\varepsilon= 2^{-b}$ is
\[
\ld{\varepsilon}^{(1)}(x) = \min \left\{d:\displaystyle\frac{Q^d(x)}{Q(x)}\geq \varepsilon\right\}
\]
\end{definition}
Using a program that is longer than another program for output $x$
can shorten the computation time. Thus,
the $b$-significant logical depth of an object $x$ is defined
as the minimal time
the reference optimal prefix Turing machine needs
to compute $x$ by a $b$-incompressibel
program (one that can be compressed by at most $b$ bits).
\begin{definition}\label{logicaldepth}\label{def.final}
Let $x$ be a string, $b$ a nonnegative integer.
The logical depth, tentative version 2, of $x$ at significance level
$b$, is:
\[
\ld{b}^{(2)}(x) = \min \{time(p) : |p| \leq K(p) + b \wedge U(p) = x\} \,.
\]
In this case we say that the string $x$ is {\em $(d,b)$-deep}.
\end{definition}
\begin{remark}
\rm
It is easy to see that $\ld{0}^{(2)}(x)$ is the least number of steps to compute $x$
from an incompressible program. For example, $x^*$ is known to be
incompressible up to an additive constant \cite{LiVi}.
Thus, $time(x^*) \geq \ld{0}^{(2)}(x)$.
For higher $b$ the value of $\ld{b}^{(2)}(x)$
is monotonic nonincreasing until
$$\ld{|x|-K(x)+O(1)}^{(2)}(x)=O(|x| \log |x|),$$
the $O(1)$ term represents a program to copy the literal representation
of $x$ in $O(|x| \log |x|)$ steps.
It is the aim of this paper to study the
properties the graph of $f_x$ can have. For example, if $x$ is random
(i.e., $|x|=n$ and $K(x) \geq n+K(n)$) then always $b=O(1)$ and always $d=O(n \log n)$.
These $x$'s, but not only these, are called {\em shallow}.
\end{remark}

Version (2) is stronger than version (1) in that in the version (2)
every individual
program at significance level $b$ must take at most $\ld{b}^{(2)}(x)$ steps
to compute $x$, while version (1) to be equivalent would
require only that a weighted average of
all programs for $x$ require at most $\ld{2^{-b}}^{(1)}(x)$ steps.
The quantitative difference between the two versions of logical
depth is small as the
following statement shows. Compare with
Theorem 7.7.1 together with Exercise 7.7.1 in \cite{LiVi}.
The anonymous referee provided a slightly different
statement and the new proof below.
\begin{theorem}\label{Teo1}
Let $x$ be $(d,b)$ deep. Then
\[
\frac{1}{2^{b+K(b)+O(1)}} \leq \frac{Q^d(x)}{Q(x)}
< \frac{1}{2^{b+1}}.
\]
\end{theorem}
\begin{proof}
(Right $\leq$) This follows from: {\em If for integers $d,b>0$ the total
a priori probability $Q^d(x)$ of all programs that compute $x$
within $d$ steps
is at least $2^{-b-1} Q(x)$, then one of these programs is
$b+1$-incompressible}. Indeed, if for some $c$
all programs computing $x$ within $d$ steps are $c$-compressible,
then the twice iterated
reference optimal Turing machine (in its role as decompressor) computes
$x$ with probability $2^c Q^d(x) \geq 2^{c-b-1}Q(x)$
from the $c$-compressed versions.
But $Q(x) \geq 2^{c-b-1}Q(x)+2^{-b-1} Q(x)$.
Hence $c-b-1 < 0$  that is $c < b+1$. Hence there is a program computing
$x$ within $d$ steps that is $b+1$-incompressible. Then
$x$ may be $(d,b+1)$-deep contradicting the assumption that
$x$ is $(d,b)$-deep.
Hence $Q^d(x) < 2^{-b-1} Q(x)$.

(Left $\leq$) This follows from: {\em If for integers $d,b$ there exists a
$b$-incompressible program that computes $x$ in time $d$, then
$Q^d(x) \geq 2^{-b-K(b)-O(1)} Q(x)$}.
Assume by way of contradiction
that $Q^d(x) < 2^{-B} Q(x)$ for some $B$ (see below about the choice
of $B$).
Consider the following lower semicomputable
semiprobability (the total probability is less than 1):
for each string $x$ we enumerate
all programs $p$ that compute $x$ in order of halting (time), and
assign to each halting $p$ the probability $2^{-|p|+B}$ until
the total probability would pass $Q(x)$ with the next halting $p$.
Since $Q(x)$ is lower semicomputable we can postpone
assigning probabilities.
But eventually or never for some $p$
the total probability may pass $Q(x)$ and this $p$ and all subsequent
halting $p$'s for $x$ get assigned probability 0.
Therefore, the total probability assigned to all halting programs
for $x$ is less than $Q(x)$. Since by assumption $Q^d(x) < 2^{-B} Q(x)$
we have
$2^B Q^d(x) = \sum_{U^d(p)=x} 2^{-|p|+B} < Q(x)$. Since $Q(x) < 1$ we
have $Q^d(x) < 2^{-B}$ and therefore all programs that
compute $x$ in at most $d$ steps are $(B-O(1))$-compressible
given $B$, and therefore $(B-K(B)-O(1))$-compressible.

By assumption there exists a $b$-incompressible
program from which $x$ can be computed in $d$ steps. We obtain
a contradiction with this for $B-K(B)-O(1)  \geq b$. This is the case if
we set $B = b+K(b)+c$ for a large enough constant $c>0$.
Namely $B-K(B)-O(1)=
b+K(b)+c-K(b+K(b)+c)-O(1) \geq b+K(b)+c-K(b+K(b))-K(c)-O(1)>b$
(note that $K(b+K(b)) \leq K(b,K(b))+O(1) \leq K(b)+O(1)$
by some easy argument \cite{LiVi} and $K(c) = O(\log c) < c/2$
for large $c$). Therefore, $Q^d(x) < 2^{-B} Q(x)$ is contradicted.
Hence $Q^d(x) \geq 2^{-B} Q(x)$ which implies
$Q^d(x) \geq 2^{-b-K(b)-O(1)} Q(x)$.
By assumption $x$ is $(d,b)$-deep satisfying the condition of
this case.
\end{proof}

\begin{remark}
\rm
We can replace $K(b)$ by $K(d)$ by changing the constriction of the
semiprobability: knowing $d$ we generate all programs that compute
$x$ within $d$ steps and let the semiprobabilities be propertional to
$2^{-|p|}$ and the sum be at most $Q(x)$. In this way $K(b)$
in Theorem~\ref{Teo1} is substituted by $\min\{K(b),K(d)\}$.
\end{remark}
Theorem~\ref{Teo1} shows that the quantitative difference between
the two versions of logical depth
are small.
We choose version 2 as our final definition of logical depth.

\begin{definition}\label{bbfunction}
The \em Busy Beaver function \em $BB: \mathbb N \rightarrow \mathbb N$ is defined by
\[
BB(n) = \max_{p:|p|\leq n}\{\mbox{\rm running time of $U(p) < \infty$}\}
\]
\end{definition}

\section{The graph of logical depth}\label{instabilidade}

Even slight changes of the
significance level $b$ can cause large changes
in logical depth.

\begin{lemma}\label{lemma1}
Let $n$ be large enough. There exist strings $x$ of length $n$
such that the running time of a computation from a shortest program
to $x$ is incomputable.
\end{lemma}
\begin{proof}
By \cite{Ga74} we have $K(K(x)|x) \geq \log n - 2 \log \log n-O(1)$.
(This was improved to the optimal $K(K(x)|x) \geq \log n -O(1)$ recently
in \cite{BS03}.) Hence there is no computable function $\phi(x) =
\min\{d: U^d(p)=x ,\; |p|=K(x)\}$. If there were, then we could run
$U$ for $d$ steps on any program of length $n+O(\log n)$. Among the
programs which halt within $d$ steps we select the ones which output $x$.
Subsequently, we select from this set a program of minimum length.
This is a shortest program for $x$ of length $K(x)$. Therefore,
the assumption that $\phi$ is computable implies that $K(K(x)|x = O(1)$:
contradiction.
\end{proof}
The following result was mentioned informally in \cite{ben88}.
\begin{lemma}\label{lemma2}
The running time of a program $p$
is at most $BB(|p|+O(\log |p|))$.
The running time of a shortest program for a string $x$ of length $n$
is at most $BB(n+O(\log n))$.
\end{lemma}
\begin{proof}
The first statement of the lemma follows from
Definition~\ref{bbfunction}. For the second statement we use
the notion of a simple prefix-code called a {\em self-delimiting} code.
This is obtained by reserving one
symbol, say 0, as a stop sign and encoding a string $x$ as $1^x 0$.
We can prefix an object with its length and iterate
this idea to obtain ever shorter codes:
$\bar{x}= 1^{|x|} 0 x$ with
length $|\bar{x}| = 2|x| + 1$, and
$x'= \overline{|x|} x$ of length $|x|+2||x||+1=
|x|+O(\log |x|)$ bits. From this code $x$ is readily extracted.
The second statement follows since $K(x) \leq |x|+O(\log |x|)$.

\end{proof}

\begin{theorem}\label{theo.3}
Let $n$ be large enough.
There is a string $x$ of every length $n$ such
that $\ld{i}(x)$ is incomputable and
$\ld{i+1}(x)$ is computable for some $i$
that satisfies $0 \leq i \leq n+O(\log n)$.
\end{theorem}

\begin{proof}
Let $x$ be a string of length $n$ as in Lemma~\ref{lemma1}.
Then $\ld{0}(x)$ is incomputable.
However, $\ld{n-K(x)+O(\log n)}(x)= O(n \log n)$ and therefore
computable. Namely,
a self-delimiting encoding
of $x$ can be done in $n+O(\log n)$ bits. Let $q$ be such an encoding
with $q=1^{||x||}0|x|x$ (where $||x||$ is the length of $|x|$).
Let $r$ be a self-delimiting program of $O(1)$ bits which prints the
encoded string in the next self-delimiting string. Consider the program $rq$.
Since $x$ can be compressed to length $K(x)$,
the running time  $\ld{n-K(x)+O(\log n)}(x)$ is at most
the running time of $rq$ which is $O(n \log n)$.

Consider the sequence $\ld{0}(x), \ldots , \ld{n-K(x)+O(\log n)}(x)$.
Since $\ld{0}(x)$ is incomputable and $\ld{n-K(x)+O(\log n)}(x)$ is
computable, there must be an $i$ satisfying $0 \leq i < n-K(x)+O(\log n)$
such that $\ld{i}(x)$ is incomputable and
$\ld{i+1}(x)$ is computable. Let set of all such $i$'s is finite
and discrete.
Hence it has a maximum.
\end{proof}

Let $x$ be as in Theorem~\ref{theo.3} and
$i_{\max}$ be the $i$ which reaches the maximum
of $\ld{i}(x)-\ld{i+1}(x)$,
$0 \leq i \leq n+O(\log n)$.

\begin{corollary}\label{cor.2}
\rm
There exists an infinite sequence of strings $x_1, x_2, \ldots$ with
$|x_{m+1}|=|x_m|+1$, each $x_m$ with an $i_{m,\max}$ ($0 \leq i < |x_m|-K(x_m)
+O(\log |x_m|)$), and $h(m)=\ld{i_{m, \max}}(x_m)-\ld{i_{m+1, \max}}(x_m)$ is
the maximal gap in the logical depths of which
the significance differs by 1.
The function $h(m)$ rises faster than any computable function but is not
faster than $BB(|x_m|+O(\log |x_m|)$ by Lemma~\ref{lemma2}.
\end{corollary}
\begin{theorem}\label{theo.BB}
There is an infinite sequence $x_1,x_2, \ldots$
with $|x_{m+1}| = |x_m|+1$  such that
$h(m) \leq \ld{0}(x_m)  \leq BB(|x_m|+O(\log |x_m|))$.
(Note that $\ld{0}(x_m)$ is the shortest time of a computation
of a shortest program for $x$ by $U$.)
\end{theorem}
\begin{proof}
\rm
The logical depth function $\ld{b}(x)$
is monotonic nonincreasing in the significance argument $b$
for all strings $x$ by its Definition~\ref{def.final}.
By Lemma~\ref{lemma2} and Corrollary~\ref{cor.2} the theorem follows.
\end{proof}

\section{Conclusion}

We studied the behavior of the
logical depth function associated
with a string $x$ of length $n$.
This function is monotonic nonincreasing. For
argument 0 the logical depth is the minimum running time of the
computation from a shortest program for $x$ to $x$. The
function decreases to $O(n \log n)$ for the argument
$|x|-K(x)+O(\log |x|)$.
We show that there is an infinite sequence of strings such that
the difference in
logical depths of some significance levels differing by one
rises faster than any computable function,
that is, incomputably fast, but not more than the Busy Beaver function.
This shows that
logical depth can increase tremendously for
only an incremental difference in significance.
Moreover, there is an infinite sequence of strings such that the
minimal computation times of associated shortest
programs
rises incomputably fast  but not so fast as the
Busy Beaver function with as argument
twice the length of the string plus an
additive logarithmic term in the length.

\section*{Acknowledgments}
We thanks Bruno Bauwens for helpful discussions and comments,
and the anonymous referee for additional comments and the new proof
of Theorem~\ref{Teo1}.

\bibliographystyle{plain}

redpajama_set_name: RedPajamaArXiv


text:
We Could Already Know One Of The New Spider-Heroes Joining Into The Spider-Verse 2
James Whitbrook
Published 2 years ago: November 6, 2019 at 1:30 pm -
Filed to:io9
japanese spider manspider man into the spider versespider man into the spider verse 2spider-mantakuya yamashirotoei
Suit up, Spider-Heads: the Emissary of Hell is here, and he means business.
We might have only just learned last week that the Spider-Verse sequel has an official release date, but now producer Phil Lord may have already given our first bit of news about the heroes we can expect to see when Miles Morales ventures out into the multiverse once more. Replying to a tweet from a fan about the likelihood of Toei's live-action Spider-Man being in the film, Lord simply said that the character has already been designed for an appearance in the sequel:
He's designed!
— Phil Lord #BlackLivesMatter #StopAsianHate (@philiplord) November 5, 2019
For those unfamiliar, Japanese Spider-Man"sometimes known as Supaidaman"was the version of our webslinging hero created for Toei's 1978 live-action Tokusatsu series. Born out of a licensing deal between Stan Lee and Toei, the series was originally going to involve Lee and Marvel co-funding and eventually adapting several seasons of Toei's iconic Sentai franchise for the West in exchange.
While that never happened"leaving it till the "˜90s for the series to be turned into Power Rangers by Saban"it did give us instead an entirely new take on Spider-Man: Takuya Yamashiro of Earth-51778.
A young motorcyclist who encounters an alien from the Planet Spider, Takuya is granted both the superpowers of his Western comics counterpart as well as an honest to god giant robot named Leopardon to battle Professor Monster and his villainous Iron Cross Army.
Spider-Man may have run for just a single season, but its influence is wide-reaching in a particularly weird way: Leopardon built the groundworks for Toei's Sentai shows to use giant robots of their own, becoming Super Sentai in the process. Basically, without Spider-Man, the Megazord as you know it today wouldn't exist.
Now, to clarify, Lord simply said that that Takuya has been designed for the sequel"that doesn't necessarily mean he makes the final cut. Or that, even if he does, it'll be in a role on a similar level to the alternate Spider-heroes of the first movie. It could be a cameo, he could be as vital as they were, hell, he could come crashing in through realities of the multiverse just to smash whatever the film's villain is in the face with Leopardon (Peni does need someone to talk mecha design with, after all). We don't know.
But it would make sense for him to make the swing over to Spider-Verse 2. Takuya might be a weird obscurity in the long history of Spider-Man adaptations, but he's had a bit of a resurgence in popularity in recent years, mostly thanks to Marvel Comics including him in the original 2014 event series that loosely inspired Into the Spider-Verse in the first place, Spider-Verse.
Since then, he's made a few more appearances in the comics, including the spiritual sequel event Spider-Geddon, letting him live on a a bit more than just a quirky bit of spider-trivia.
It's also not going to stop us from gesticulating wildly about one of the greatest, goofiest, and surprisingly most influential takes on Spider-Man in the webhead's entire, weird history, and speculating how he'll fit into Into the Spider-Verse 2. If each Spider-hero in Spider-Verse takes on animation styles and techniques from their own Earths, what does that mean for an explicitly live-action hero like Takuya?
Peni already acts as a riff on traditionally overstylized manga and anime aesthetics. Could Takuya somehow attempt to recreate an old school, "˜70s-era TV aesthetic in 3D animation? Will there be dramatic posing and background pyrotechnics for seemingly little reason? Could he just sort of move and animate like he's a stunt guy in a suit? Could that be how Leopardon animates, less like a mech, more like someone in a bulky costume? Because, c'mon. You don't bring Takuya over without bringing Leopardon.
We've got a very long time to speculate: Spider-Man: Into the Spider-Verse 2 will hit theatres April 8, 2022.
The Tangled Web of Every Spider-Man Movie Currently in the Works
Breaking Down the Sinister Secrets of Spider-Man: No Way Home's Trailer
The Spider-Man: Into the Spider-Verse Sequel Has a Trio of New Directors
Marvel's Japanese Spider-Man Documentary Is a Joy at the Strangest Time

redpajama_set_name: RedPajamaCommonCrawl


text:
Mercer wrestling takes 11th in nation
alockwood|March 16, 2011
(photo courtesy of Mercer Wrestling) Kevin Andres' team produced six All-Americans during last week's NCWA Championship.
Wrestling in a national championship is a tough undertaking. Hosting a national championship is exponentially harder––just ask Mercer head wrestling coach Kevin Andres. A very tired but elated Andres was glad to see Mercer and the city of Macon successfully host the National Collegiate Wrestling Association's championship tournament over March 10-12 at the University Center as 77 teams from all over the nation wrestled in the men's and women's brackets.
"The tournament went phenomenally and we had hundreds of compliments on facility," Andres said after the tournament ended last Saturday. "Everyone wants to come back next year and do this again in the University Center," he added.
Coordinating the logistics and running the tournament added responsibility for Andres, but despite his hosting efforts he was able to coach his men's team to an 11th-place finish and his women's team to a 2nd-place finish overall.
Teams from all across the United States dotted the UC arena where six mats contained the ongoing matches during the three-day event. Wrestling programs from California, Texas and the Northeast traveled for a chance at glory in this year's edition of the NCWA Championships. Twice as large as the NCAA, the NCWA encompasses many of the Division I and Division II colleges and universities with competitive wrestling programs but without NCAA athletic status.
With such tough competition during the tournament, Andres couldn't have been more pleased with his team's effort.
"The team did very well and actually wrestled very close to the expectations we had set going into the weekend," Andres said.
On the men's side, Charlie Farr (7th – 285 lb.) and Derek Wojcik (7th – 174 lb.) were both named Freshman All-Americans with their impressive performances in the tournament and on the women's side, Kalia Burnette won the 148 lb. category to become Mercer wrestling's first women's national champion by defeating Sarah McCurdy of Southern Virginia in a one-minute pin.
Altogether, the women's side would have three other NCWA All-Americans including Christina Le (2nd – 159 lb.), Felicia Fowler (3rd – 148 lb.) and Mary Rosher (3rd – 176 lb.).
California Baptist (156.5) would top the men's overall standings with Grand Valley State (121) and 2009 champion Central Florida (99.5) rounding out the top three teams in the Division I standings. Northwest Missouri State (45) would easily take the Division II men's title while Yakima Valley CC (123.5) would run away with the women's title, besting Mercer (45) by nearly 80 points.
Mercer's 11th-place finish comes on the heels of their 3rd-place conference finish at the SEC Championship held at Palm Coast, Fla.
Why the Braves have to re-sign Marcell Ozuna
Mercer students start club basketball team amid COVID-19
The most important players of the 2020 World Series
Bears suffer last-second Homecoming loss, look towards spring schedule
Intramural referees tackle their jobs amid COVID-19
Letter to the Editor regarding recent Mercer Wrestling article
To the Editor: As Director of the Recreational Sports and Wellness Department, I was surprised to see The Cluster's recent piece titled "Sprawl or...
Sprawl or nothing
Editor's note: This piece contains several inaccuracies and false assumptions. Please see this letter to the editor, which responds to and corrects...
Mercer wrestling finishes strong
Wrestling takes third in NCWA SEC finals
Mercer women's soccer falls to The Citadel
MLB Postseason: What to expect, and why it might cause problems
NBA playoffs ramp up leading to finals
US Open: Three things you missed, and how they will shape the future of tennis
Middle Georgia high schools set own football schedules amid COVID-19 concerns


text:
Evidence Management Webinar 5: Omaha Police Department Virtual Tour – Part 3
Featuring Ben Townsend, CEO of Tracker Products, and special guest, Staci Witkowski of the Omaha Police Department – a large organization with 600+ officers and hundreds of thousands of pieces of active evidence.
Completely revamping an evidence unit is a major challenge. As such, Ben asked, "I'm curious… on those days when you wanted to pull your hair out…. Can you give us an example of when you were like, What the heck is going on around here?"
Staci laughed and said, "There were a lot of them! But, one of them would be… When we first started out, we had 17 standup refrigerator-freezer units! So, one of the days that I wanted to pull my hair out – and head off – was when we were moving items from the 17 stand up refrigerator-freezers. Unbeknownst to us, one of the outlets blew during the night, and things started to melt down onto paper envelopes.
We were in a panic going, Okay, we have evidence that's wet! What are we going to do? We set it all over tables, got fans to help dry it; trying to make sure the integrity wasn't lost. And it was just like, You've gotta be kidding me. Then we started really panicking, thinking, We've still got other refrigerator-freezers. So, we started checking those. We discovered most were on a power outlet, but one was on an extension cord outlet, and that's the one that had blown the fuse.
RELATED: EVIDENCE MANAGEMENT WEBINAR 5: OMAHA POLICE DEPARTMENT VIRTUAL TOUR – PART 1
Those were the days where you're like, Oh my. But, that's how they used to run things. They actually had a checkoff sheet on one of the refrigerator-freezers that had duct tape holding it shut. So, that would be a hair-pulling-out day. But, it got better. And, I've got a nice walk-in refrigerator and a nice walk-in freezer now, so we don't have those problems anymore.
It was a lot of work. Here's the thing… anything that's worthwhile is a lot of work. Now, it's a lot easier to maintain."
Staci asked Ben to pull up a few photos to show how they've organized their evidence facility. The one below is their walk-in refrigerator.
Staci said, "Those are items that used to be in the refrigerator portion of those old 17 refrigerator-freezers. There could be chest cavity blood from autopsies… You'll also see those square boxes, that's our DUI urines or our urines from our rape kits. Obviously those will stay in there until the cases have been adjudicated.
I can send information out through SAFE, run a search query on urine, and then send that list out to the officer with the case number to have them do the research, which is helpful. There's also a light-duty officer who is working on them and making sure those cases are adjudicated, so that we can get rid of those items."
The second photo, below, is their "C Asile."
About this photo, Staci said, "Those are smaller banker boxes. So, anything that would fit in there, wouldn't fit in – what we call – our envelope shelf aisle. They're 12 x 18" boxes that fit on that shelf and we can put three of them on there. You can run a query on each box. There are a lot of screwdrivers, pop bottles… things that would maybe have been found at a burglary scene, or off an auto-theft, or DOP. It's a very long aisle that we don't research too often. The statute of limitations on our burglaries and DOPs is three years. So, we have plenty of time to come back and get those items researched."
RELATED: THE DES MOINES PD VIRTUAL EVIDENCE ROOM TOUR
Ben shared another photo…
About this photo, Staci said, "So, this aisle is a little bit deeper and we use long leaf bags. Those items in there are felony assault items: clothing, tennis shoes, coats, sweat shirts; bigger bulkier items that we don't necessarily want to put in a box. You don't want to package clothing in plastic because it creates mildew and mold. You can bag them up in like a grocery bag size, paper sack. Sometimes we'll put items in there and we put a container label on the outside. The aisle on the right is a felony assault and you can see there are empty spaces, because we've already researched that aisle. The only thing that goes in that aisle is felony assault evidence.
When that starts getting full, we'll run queries and send it up to our felony assault unit and say, Hey, can you review these cases and see if there's anything that we can get rid of? Typically we look for that three-year rule and then we send it on.
On the other side of that is the sexual assault aisle. Any of the sexual assault clothing – not the kits – but any clothing or bedding goes on that side and then it goes all the way down. That way we also know – since we don't get rid of anything because sexual assault has no statute of limitations – we can eventually transfer that upstairs to our longterm sexual assault/homicide storage location.
Having an aisle for each of these different items really helps us because we know where we need to research and who we need to send that [notification] to. And, usually what we try to do is research two different areas, so that two different lieutenants in our Detective Bureau have things going on."
They moved onto the next slide…
About this aisle, Staci said, "This is our small envelope aisle. On this particular side, it has a lot of our discs. Our 'Dream Unit,' basically downloads all body worn cameras, the cameras inside the cars, or any stuff from, say the QuickTrip or a bank that had surveillance. The white envelopes in there are the master copies and the yellows are checkout. So if it goes to court, we always keep a master.
Up until two years ago, we didn't really have that felony assault aisle and sexual assault aisle… We changed that because we figured, You know what? This is so much easier than trying to figure out what's in those smaller boxes. We're still evolving. You still find better ways to do something."
Ben agreed, saying, "Yeah. You can wear yourself out with 'How's the best way to do something?' And you'll spend so much time trying to figure out the right way, versus just doing it… Adjust, if you need to. Come back and do things again, but just get it started."
They moved to the next slide…
About this image, Staci said, "This aisle is kind of our catch-all; like backpacks, and bags, and large purses…things like that. Briefcases, suitcases, things that come in from found-property, or off of narcotics search warrants, or something of that nature. We couldn't figure out what else to put on there and it was like, Oh well these fit really well in there, so let's put this stuff there."
Questions were pouring in from attendees, so… Ben asked and Staci answered…
Question: "If you have large and small items collected from a case, do you separate them based on size of packages, or do you just store it all together?"
Answer: "Say you have a rape kit, the clothing of the victim – or the bedding where it occurred – and a CD/DVD of an interview. The CD/DVD of the interview would go in that envelope space. We actually have specific shelves for the rape kits because of their size. And then all the clothing would go in that sexual assault aisle. But each item the officer enters is its own item and its own package. So that kind of determines where things go."
RELATED: THE DELUGE OF DIGITAL EVIDENCE
Question: How do you handle a case with multiple serious crimes – such as a robbery, rape, ADW – as far as choosing what section to store it in.
Answer: "It depends on how it's packaged. If it's clothing, and it's a sexual assault, everything will go to the sexual aisle because we will not get rid of anything on a sexual assault. If it's a DVD or a CD of an interview, it's going to go to the envelope aisle.
Except on a homicide. If there's a homicide, everything goes into one banker box. But, with our homicides, it's usually two to four banker boxes on average. So, CDs would go in a homicide's banker's box, but that's the only exception."
Question: When you started entering data into Tracker's SAFE software, did you start with the newest items and go to the oldest, or did you start by location?
Answer: "We would try to stick to our system of the new things coming in. Then everything that was before… try to adapt it to what we were trying to do. Dumping [information from] the old system was a good and a bad thing. Good in the sense that it gave us [all of the information]. But, the system we had before also had things that were stolen [from the evidence unit]. If it had a serial number, it got dumped in as if we actually had it. And, until you went to actually look at the item to see, Okay, well where's this item? What was stolen? So, we had to go back and do a bunch of item-entry errors to get rid of the things that were stolen items, not actual items."
Question: What is your approval process for getting rid of evidence?
Answer: "A lot of it depends on the statute of limitations for the crime. If it's over six years old – and it's not narcotics, or homicide, or sexual assault – I'll review the case and I'll dispose of it. When I say I'll review it… somebody else has researched it and given me a report that basically says… he has served his time of two years – for whatever crime – and I'll sign off on it.
If the statute of limitations is still going on, we will not send it anywhere. From three to six years, we'll send it to the actual Detective Bureau unit, for the Lieutenant of that unit to make a determination."
Question: You approve your own dispositions? Are you telling me there's no court involved? There's no County? There's no sending it to the chief. Is Stacy as capable – of making a determination on destroying evidence?
Answer: "As a Lieutenant? Yes, I can. Now… I do property crimes. The 'person crimes' has to go to the unit Lieutenant – which is robbery, felony assault, and homicide. They will make a determination depending on cases. If it's gone federal, most of the things that we're sending up for those unit detectives/supervisors to approve, the person's already been in and out of jail for that particular crime. So, we'll send it for verification. And then they will contact the County attorney, et cetera if need be. But, burglary, auto theft units… those are property crimes and yes, I am the Unit Lieutenant. We're able to make those determinations without any court interference.
But, everything has to have been researched. We have a report that's a specific report. It's called a 200 D. Everything that we want to get rid of has to have that with it and be approved by a supervisor. Otherwise, it cannot be disposed."
Tracker Products and The Evidence Management Institute want to give you something productive to think about during this time of uncertainty. This is the fifth webinar – of a series of free evidence management training and panel discussions. Watch and comment on the recordings here, or – to get in on the discussion – join the Evidence Management Community Forum.


text:
Comedian Zelensky with no political experience wins Ukraine presidency
April 22 (AZINS) A comedian with no political experience won a landslide victory in Ukraine's presidential election Sunday, exit polls showed, dealing a stunning rebuke to the country's political establishment.Volodymyr Zelensky, whose only previous political role was playing the president on television, trounced incumbent Petro Poroshenko by taking 73 per cent of the vote, according to exit polls conducted by several think tanks.Poroshenko lost to the television star across all regions of the country, including in the west where he traditionally enjoyed strong support.
It was an extraordinary outcome to a campaign that started as a joke but struck a chord with voters frustrated by poverty, corruption and a five-year war that has claimed some 13,000 lives. The 41-year-old star of TV series "Servant of the People" will now take the helm of a country of 45 million people beset by challenges and having run on the vaguest of political platforms.
After taking the most votes in last month's first-round election, Zelensky had enjoyed a strong lead over the 53-year-old Poroshenko going into Sunday's poll.Voting earlier in the capital Kiev, the beaming frontrunner had said his campaign managed to bring Ukrainians together."We have united Ukraine," he said, wearing a casual suit with a t-shirt and accompanied by his wife. "Everything will be all right." Sparkling wine was on offer at his campaign headquarters as the star's team prepared to toast his victory on Palm Sunday, a week before Orthodox Easter.
Preliminary results were expected in several hours but the same exit polls were accurate in the first round.From Ukrainian-speaking regions in the west of the country to Russian-speaking territories in the war-torn east, many voters said they feared uncertainty but yearned for change. "We're tired of all the lies," said Marta Semenyuk, 26, who cast her ballot for the comedian."I think it just cannot get any worse and I hope he'll live up to his promises," said Larisa, an 18-year-old student from the government-held eastern port city of Mariupol.
Zelensky's victory opens a new chapter in the history of a country that has gone through two popular uprisings in the last 20 years and is mired in a conflict with Moscow-backed separatists in the east.His supporters say only a fresh face can clean up Ukraine's politics and end the separatist conflict. But others doubt the showman will be able to take on the country's influential oligarchs, negotiate with the likes of German Chancellor Angela Merkel and stand up to Russia's Vladimir Putin.
"People have gone mad," Viktoriya Olomutska, a 39-year-old Poroshenko supporter, said in Kiev. "Cinema and reality are two different things." Poroshenko mocked his rival's lack of political experience and argued he was unfit to be a wartime commander-in-chief. The outgoing leader came to power after a 2014 pro-Western uprising ousted a Kremlin-backed regime, triggering Moscow's annexation of Crimea.His supporters credited him with rebuilding the army and securing an Orthodox Church independent of Russia.
But many feel like the country's ruling elite have forgotten the promises of the revolution.Earlier Sunday, Poroshenko warned Ukrainians against taking a chance on Zelensky. "Because this is not funny. Well, at first it can be a bit funny and then it might hurt afterwards," he said after casting his ballot. The comic shunned traditional campaign rallies and instead performed comedy gigs and used social media to appeal to voters.
The Ukrainian president has strong powers over defence, security and foreign policy but needs backing from parliament to push through reforms.Poroshenko's faction has the most seats in the current legislature and new parliamentary polls are due in October.
The West has closely watched the race amid concern a new government might undo years of economic reforms. US Secretary of State Mike Pompeo called both Zelensky and Poroshenko on the eve of the run-off vote.


"'You could get sick, disgusting': An analysis of alcohol counter-adver" by Chloe S. Gordon, Sandra C. Jones et al.
Gordon, C. S., Jones, S. C., Kervin, L. K. & Howard, S. J. (2018). 'You could get sick, disgusting': An analysis of alcohol counter-advertisements created by children. Health Education Research, 33 (5), 337-350.
Advertisements are persuasive texts designed to communicate ideas explicitly and implicitly through visual grammar. Counter-advertisements allow students to engage with advertising texts as creators rather than consumers and challenge media messages. Based in critical media literacy theory, this paper explores how elementary students interpret and redesign advertisements to create meaning. This study focused on the messages upper-elementary school students created about alcohol following a 10-lesson alcohol media literacy programme. Text from the counter-advertisements (n = 161) was analysed using discourse analysis. The counter-advertisements were also content analysed for message content, persuasion strategies and production components using a media literacy framework. The content of male-targeted, female-targeted and gender-neutral ads was compared using chi-square analyses. The four main themes identified in the discourse and content analysis were 'vomit', 'sick', 'danger' and 'poison', highlighting an emphasis on short-term consequences of alcohol misuse. Sensory (un)appeal was the most frequently used persuasion strategy, while objects/symbols and colour were the most frequently used production components. The use of these devices differed depending upon the advertisement's target gender. Involving elementary students in the redesign of advertisements is a powerful pedagogy that enables students to demonstrate their understanding of media literacy practices and create health promotion messages.


text:
Mason v. T&M Boat Rentals, Llc.
First Bank & Trust v. Proctor's Cove II, LLC
See Evans v. Bordelon, 13–888 (La.App. 3 Cir. 3/19/14), ––– So.3d ––––, 2014 WL 1047052 (wherein the Third…
Woodlands Dev., L.L.C. v. Regions Bank
Any such memorandum or written motion to strike shall be served pursuant to Article 1313 within the time…
5 Citing Cases
Full title:JEFF MASON v. T & M BOAT RENTALS, LLC., LESTER NUNEZ, CHALMETTE LEVEE…
Court:COURT OF APPEAL FOURTH CIRCUIT STATE OF LOUISIANA
137 So. 3d 741 (La. Ct. App. 2014)
COURT OF APPEAL FOURTH CIRCUIT STATE OF LOUISIANA
No. 2013–CA–1048.
Jeff MASON v. T & M BOAT RENTALS, LLC., Lester Nunez, Chalmette Levee Constructors Joint Venture and M.V. Mr. Charles.
Alphonse M. Thompson, Jr., Thompson, Gibbons, & Westholz, L.L.C., New Orleans,LA, for Plaintiff/Appellant, Jeff Mason. David S. Bland, Matthew C. Guy, Brendhan H. Thompson, LeBlanc Bland P.L.L.C., New Orleans, LA, for Defendant/Appellee, T & M Boat Rentals, LLC and Chalmette Levee Constructors Joint Venture.
(Court composed of Judge DENNIS R. BAGNERIS, SR., Judge TERRI F. LOVE, Judge SANDRA CABRINA JENKINS).
Judge TERRI F. LOVE.
This appeal arises from the injuries sustained by the plaintiff, who alleged that his injuries were covered pursuant to general maritime law and the Longshore Harbor Workers Compensation Act. The defendants filed a motion for summary judgment, which was granted by the trial court. However, we find that the trial court improperly considered the exhibits attached to the motion for summary judgment that were not automatically deemed admitted into evidence because the amendment to La. C.C.P. art. 966 does not apply retroactively. Therefore, we reverse the ruling of the trial court and remand for further proceedings.
FACTUAL BACKGROUND AND PROCEDURAL HISTORY
Jeff Mason was working for Chalmette Levee Constructors Joint Venture ("CLC") when he sustained a tibial plateau fracture, which allegedly lead to avascular necrosis in the hip. Mr. Mason subsequently filed a Petition for Damages against T & M Boat Rentals, LLC ("T & M"), Lester Nunez, CLC, and M.V. Mr. Charles ("The Mr. Charles") seeking damages arising from his injuries based upon the theory of "maritime negligence." The Defendants filed a Motion for Summary Judgment asserting that no genuine issues of material fact existed because Mr. Mason's only remedy relative to CLC was through the Longshore Harbor Workers Compensation Act ("LHWCA"), that T & M was not liable because it chartered The Mr. Charles to CLC, and that Mr. Mason possessed no claims against The Mr. Charles because he was not a Jones Act seamen. The trial court granted the Defendants' Motion for Summary Judgment, but granted Mr. Mason leave to amend his Petition for Damages.
T & M, CLC, and The Mr. Charles are collectively referred to as the Defendants.
Mr. Mason then filed his First Supplemental and Amended Petition asserting a cause of action pursuant to 33 U.S.C.A. 905(b) of the LHWCA. The Defendants filed a second Motion for Summary Judgment based upon the original suppositions with the additional contention that Mr. Mason "was not engaged in longshore activities, was not engaged in maritime employment and is not covered under the LHWCA." Mr. Mason filed a Motion for Leave to File a Second Supplemental and Amended Petition. Following a hearing, the trial court denied Mr. Mason's Motion for Leave to File a Second Supplemental and Amended Petition and granted the Defendants' second Motion for Summary Judgment, dismissing Mr. Mason's claims with prejudice. Mr. Mason's devolutive appeal followed.
Mr. Mason contends that the trial court erred in relying on evidence not offered, introduced, and admitted into evidence at the hearing, in striking and refusing to admit Mr. Mason's affidavit, which was attached to the Motion for Leave to File Second Supplemental and Amended Petition, and erred in granting the Defendants' Motion for Summary Judgment because genuine issues of material fact exist regardingMr. Mason's coverage by the LHWCA.
MOTION FOR LEAVE TO FILE REPLY BRIEF
Counsel for Mr. Mason filed a Motion for Leave to File Reply Brief on January 31, 2014, after both parties filed their supplemental briefs following oral argument, as ordered by this Court. The Motion for Leave to File Reply Brief is denied.
STANDARD OF REVIEW
A motion for summary judgment "shall be rendered forthwith if the pleadings, depositions, answers to interrogatories, and admissions, together with the affidavits, if any, admitted for purposes of the motion for summary judgment, show that there is no genuine issue as to material fact, and that mover is entitled to judgment as a matter of law." La. C.C.P. art. 966(B)(2). The burden of proof on the motion for summary judgment remains with the movant. La. C.C.P. art. 966(C)(2). However,
[I]f the movant will not bear the burden of proof at trial ... the movant's burden on the motion does not require him to negate all essential elements of the adverse party's claim, action, or defense, but rather to point out ... that there is an absence of factual support for one or more elements essential to the adverse party's claim, action, or defense.
La. C.C.P. art. 966(C)(2). The adverse party must "then produce factual support sufficient to establish that he will be able to satisfy his evidentiary burden of proof at trial" to defeat the motion for summary judgment. La. C.C.P. art. 966(C)(2).
This Court reviews the trial court's grant of a motion for summary judgment utilizing the de novo standard of review. Transworld Drilling Co. v. Texas Gen. Res., Inc., 604 So.2d 586, 589 (La.App. 4th Cir.1992). This Court will review the record "using the same criteria applied by trial courts to determine whether summary judgment is appropriate." Id.
AMENDMENTS TO LA. C.C.P. ART. 966
Mr. Mason contends that the trial court erred by considering evidence that was not properly offered, accepted, and introduced as evidence at the hearing on the motion for summary judgment.
Pursuant to Acts 2012, No. 257, § 1, approved on May 25, 2012, and effective August 12, 2012, La. C.C.P. art. 966(E)(2) provided that "[o]nly evidence admitted for purposes of the motion for summary judgment shall be considered by the court in its ruling on the motion." The amendment also revised La. C.C.P. art. 966(B)(2) by deleting "on file" as follows:
[t]he judgment sought shall be rendered forthwith if the pleadings, depositions, answers to interrogatories, and admissions, together with the affidavits, if any, show that there is no genuine issue as to material fact, and that mover is entitled to judgment as a matter of law.
However, pursuant to Acts 2013, No. 391, § 1, approved on June 18, 2013, and effective on August 1, 2013, (E)(2) was entirely eliminated and (F)(2) was revised to read as follows:
[e]vidence cited in and attached to the motion for summary judgment or memorandum filed by an adverse party is deemed admitted for purposes of the motion for summary judgment unless excluded in response to an objection made in accordance with Subparagraph (3) of this Paragraph. Only evidence admitted for purposes of the motion for summary judgment may be considered by the court in its ruling on the motion. (Emphasis added.)
Also, La. C.C.P. art. 966(B)(2) was revised as follows:
[t]he judgment sought shall be rendered forthwith if the pleadings, depositions, answers to interrogatories, and admissions, together with the affidavits, if any, admitted for purposes of the motion for summary judgment, show that there is no genuine issue as to material fact, and that mover is entitled to judgment as a matter of law. If the motion for summary judgment is denied, the court should provide reasons for the denial on the record, either orally upon rendition or in writing sua sponte or upon request of a party within ten days of rendition. (Emphasis added.)
The Defendants' second motion for summary judgment was filed in November 2012 and the trial court ruled in December 2012. Accordingly, Mr. Mason asserts that the version of La. C.C.P. art. 966 in effect at that time of the hearing and ruling on the Defendants' motion for summary judgment applied. The Defendants aver that the version of La. C.C.P. art. 966, effective on August 1, 2013, retroactively pertained to the summary judgment proceedings and, consequently, the analysis of this appeal.
La. C.C. art. 6 provides that "[i]n the absence of contrary legislative expression, substantive laws apply prospectively only. Procedural and interpretative laws apply both prospectively and retroactively, unless there is a legislative expression to the contrary." Although La. C.C.P. art. 966 is contained in the Louisiana Code of Civil Procedure, its retroactivity is not presumed. This Court must "engage in a two-fold inquiry." Cole v. Celotex Corp., 599 So.2d 1058, 1063 (La.1992). "First, we must ascertain whether in the enactment the legislature expressed its intent regarding retrospective or prospective application." Id. "If the legislature did not, we must classify the enactment as substantive, procedural or interpretive." Id. "Substantive laws either establish new rules, rights, and duties or change existing ones." St. Paul Fire & Marine Ins. Co. v. Smith, 609 So.2d 809, 817 (La.1992). "Interpretive laws, on the other hand, do not create new rules, but merely establish the meaning that the interpretive statute had from the time of its enactment." Id. "When an existing law is not clear, a subsequent statute clarifying or explaining the law may be regarded as interpretive, and the interpretive statute may be given retrospective effect because it does not change, but merely clarifies, pre-existing law." Id.
The version of La. C.C.P. art. 966 in effect at the time of the hearing and the trial court's ruling required that evidence used to support or oppose a motion for summary judgment be "admitted" instead of simply being "on file." Therefore, the statute, at the time, required the mover to offer, introduce, and receive permission from the trial court to admit evidence into the record on a motion for summary judgment. This also placed an onus on the opponent to object to any evidence "admitted" by the trial court. That amendment placed new duties upon both the mover and the opponent of a motion for summary judgment in order to ensure that only "admitted" evidence was in the record as opposed to being "on file." The amendment to La. C.C.P. art. 966 currently in effect provides that "[e]vidence cited in and attached to the motion for summary judgment ... is deemed admitted." Thus, the new amendment removed the duties the previous version placed upon both parties and changed the parties' required duties. Accordingly, we find that Acts 2013, No. 391, 1 is substantive in nature and cannot be applied retroactively because to do so would remove the Defendants' responsibility to introduce evidence and deprive Mr. Mason's right to object to the admission of evidence the trial court was required to approve and deem admitted.
The Defendants contend that [c]ounsel for Defendants did not have an opportunity to formally introduce the evidence attached to the briefs because no oral argument commenced. The transcript reveals otherwise. Once the trial court ruled at the scheduled hearing regarding Mr. Mason's Motion for Leave to File Second Supplemental and Amended Petition, the trial court stated that the hearing for the Defendants' motion for summary judgment was scheduled for January 4, 2013, but that if both parties waived their rights "to be noticed and to have that opportunity to respond," it would proceed with a ruling. The trial court then reiterated numerous times that those rights belonged to the parties and could not be waived by the trial court. Both parties waived their rights and stated that they were prepared to proceed. The trial court then asked, "[y]ou all want to argue it" Counsel for the Defendants stated, "I am prepared to submit it on the brief, Your Honor." Therefore, the Defendants' assertion that there was no opportunity to formally introduce evidence is disingenuous.
Defendants further aver that this Court previously held that the latest amendment to La. C.C.P. art. 966 was retroactive in Igbokwe v. Moser, 12–1366 (La.App. 4 Cir. 4/24/13), 116 So.3d 727, 730, writ denied, 13–1196 (La.9/13/13), 120 So.3d 698, and Garcia v. City of New Orleans, 12–1459 (La.App. 4 Cir. 4/3/13), 115 So.3d 515, 516. This argument also lacks merit. Neither Igbokwe nor Garcia discussed the retroactivity of Acts 2013, No. 391, 1. Both cases merely referenced the deletion of "on file" in La. C.C.P. art. 966(B)(2) in identical footnotes that state: "[w]e note that La. C.C.P. art. 966(B) was amended in 2012 to delete 'on file.' However as this case was filed prior to the amendment the former version is applicable." Igbokwe, 12–1366, p. 3, 116 So.3d at 730, n. 2;Garcia, 12–1459, p. 3, 115 So.3d at 517, n. 1. In fact, if we analyze the dicta contained in these footnotes, this Court stated that the amendment that deleted "on file" was not applicable because the cases occurred prior to the amendment. Thus, this Court discussed that the amendment would not be applied retroactively. Therefore, having found that the Defendants' assertions lack merit and that the new version of La. C.C.P. art. 966 cannot be applied retroactively, we reverse the trial court's granting of the Defendants' Motion for Summary Judgment and remand for further proceedings.
For the above-mentioned reasons, we find that the trial court improperly considered the exhibits attached to the Defendants' Motion for Summary Judgment that were not automatically deemed admitted into evidence because the amendment to La. C.C.P. art. 966 does not apply retroactively. Therefore, the trial court's ruling is reversed and the matter is remanded for further proceedings.
REVERSED AND REMANDED, MOTION DENIED.


text:
Harlem Native Dr. Paul G. Falkowski Wins Nobel Prize For The Environment
Dr. Paul G. Falkowski, born 1951, is an American biological oceanographer in the Institute of Marine and Coastal Sciences at Rutgers University in New Brunswick, New Jersey. His research work focuses on phytoplankton and primary production, and his wider interests include evolution, paleoecology, photosynthesis, biogeochemical cycles and astrobiology.
Born in Harlem, New York, Falkowski was educated at the City College of New York, where he received his BSc. and MSc. degrees. He completed his doctoral thesis in biology and biophysics at the University of British Columbia in 1975.
After postdoctoral research at the University of Rhode Island, he moved to the Brookhaven National Laboratory in 1976 to join its newly formed oceanography department, and in 1998 he moved to Rutgers University. He received a Guggenheim Fellowship in 1992, and was appointed as Cecil and Ida Green Distinguished Professor at the University of British Columbia in 1996.
Falkowski's research work has included studies of phytoplankton nutrient acquisition and the relationships with light of both phytoplankton and corals. He has also studied the biophysical controls on ocean productivity and export production, and the importance of the nitrogen and iron cycles in ocean biogeochemistry. His research has also drawn in geoengineering, astrobiology, and the evolution of groups including phytoplankton and placental mammals. He is also a coauthor, with John Raven, of the influential textbook Aquatic Photosynthesis.
He has been elected to a number of learned societies including the American Geophysical Union (2001), the American Academy of Arts and Sciences (2002) and the National Academy of Sciences (2007). He has also received a number of awards including the A.G. Huntsman Award for Excellence in the Marine Sciences (1998), the G. Evelyn Hutchinson Award (2000), the European Geosciences Union Vernadsky Medal (2005) and the ECI Prize (2010). In 2018, Paul Falkowski was nominated as a recipient of the Tyler Prize for Environmental Achievement for his work on phytoplankton as it relates to climate change impacts. He shares the 2018 Tyler Prize[20][better source needed], known as the "Nobel Prize" of the environment, with fellow biological oceanographer Dr. James J. McCarthy of Harvard University.
Related: Air Jordan 1 Retro Low OG For Harlem Style
This entry was posted in bio, biography, education, Harlem, Science and tagged City College of New York, Dr. Paul G. Falkowski, Harlem, science by Harlem World Magazine. Bookmark the permalink.


text:
President Trump defends firing Comey as Comey fires Mueller probe
President Trump on Wednesday defended firing FBI Director James Comey as the investigation into Russian interference in the 2016 presidential election continues.
During a press conference in the Rose Garden, Trump again denied that he asked Comey to stop the FBI's Russia probe and blamed the move on "a lot of things."
Trump said the decision to fire Comey came after the FBI director made an "unfair" suggestion about former Secretary of State Hillary Clinton's emails.
"He said to me, 'Look, this is a Russia investigation.
You know why?' and I said, 'I don't know.'
And he said, I can't do it, he said that," Trump said."
And I said that, and he said I have to," Trump continued."
I said, okay, well you've got to do it.
And I'm going to do what's right for the country."
Trump added that he believes the president is in charge of the investigation.
"When I say I'm in charge, I mean I'm the one who's in charge," Trump added.
"When I'm not in charge I can call the shots."
Comey fired Comey on May 9 amid the FBI investigation into the Russian interference campaign.
Comey testified to Congress in May that the president had pressured him to end the investigation and said the president told him he wanted to fire him.
Trump said Thursday that he was not asking Comey to end or change the investigation, but said that Comey had asked him to stop it and that he believed he was in charge.
"If I asked him if I was in control, I would say that," the president said.
"I'm in control.
That's the reason I fired him."
Trump's comments came as lawmakers, including Rep. Adam Schiff of California, a member of the House Intelligence Committee, were considering whether to investigate whether Trump obstructed justice by firing Comey.
In a letter to Trump on Thursday, Schiff said that Trump's actions violated the Hatch Act, which prohibits lawmakers from interfering in the executive branch's investigations.
"The Hatch Act does not apply to the conduct of the President, as the President's conduct is directly contrary to the law," Schiff wrote.
"President Trump has engaged in a series of illegal and unconstitutional actions and has ignored the law, including the Hatch and Whistleblower Protection Act.
Congress must immediately investigate the President for obstruction of justice, including by impeachment, as a means of restoring trust and restoring the rule of law," the letter concluded.
'Dirt' of Trump-Russia collusion investigation leaked to NYT
Why the Germans should take over the UK


Create multiple projects and add tasks to each of it. Each project has own tasks and each task is customizable with start and end time, priority, progress, display color and more.
Easily move or reorganize tasks on the main interface. It support drag and drop to rearrange tasks as parent -> child mode.
Add resources like person names and contact details.
Export your project as image (png, jpeg), as CSV file (to open with Excel), as Microsoft project file, HTML or PDF.
It offers basic tasks for a project management tool.


text:
Home Arts Theatre Don't Call Him Mr Mari Kita: The Power Of Stories & Songs
Don't Call Him Mr Mari Kita: The Power Of Stories & Songs
Carolyn Chiam
What do we know about Zubir Said (1907-1987), who composed Singapore's National Anthem, 'Majulah Singapura' (Onwards Singapore) in 1958? To find out more, we caught W!ld Rice's 2022 staging of "Don't Call Him Mr. Mari Kita" on 22 July, significant in that it was also Zubir Said's birthday.
Review: Don't Call Him Mr Mari Kita by Wild Rice
The brainchild of Julian Wong (Performer, Writer, Music Director and Arranger) and Cultural Medallion recipient Ivan Heng (Director and Set Designer), this creative production about the man behind the music, was brilliantly delivered with moving sincerity and exuberance, balanced with the occasional comic lines during the course of the show, along with a bounty of words and music.
Performing with Julian Wong, who was the lead narrator, were the supporting cast of Hannah Nordin, Malcolm Lim and Rohaniah Sa'id and a band of four musicians, Din Safari, Leonard Mikhail, Riduan Zalani and Ryan Sim. Their combined energy mixed with historical nuggets reinforced Julian's sparkling presence as a compelling storyteller and musician, be it the masterful stretch of his fingers over the piano keys or violin strings, the tale relayed in a witty, engaging matter-of-fact manner, which connected well with the audience, with some of us singing along to familiar songs.
They took us on a heart-warming and informative musical journey that was an insightful tribute to the composer through glimpses into his rich personal history while navigating the historical backdrop and politics of the times. The varied and thoroughly enjoyable repertoire of songs chronicled his life, moving to the beat of keronchong, samba, waltz, rhumba, and joget rhythms while presenting a collage of dreams and dislocation, sentiment and nationalism, nature and nourishment, knowledge and education.
Ivan Heng's striking set design in red and gold, with tall vertical diamonds (paying architectural tribute to the Singapore's long-demolished National Theatre) framed by a golden arch of musical notes (transcribing the melody to "marilah kita bersatu dengan semangat yang baru/come let us unite with a new spirit", from the National Anthem) and costumes by Frederick Lee referencing the era, added a visual treat to the vocal and musical excellence on stage.
Touching Hearts of Young and Old Theatre-goers
The 80-minute meaningful production was a joy to watch, touching hearts of young and old theatre-goers. Well-paced right up to the oh-so-familiar yet poignantly-played final song of the show, the rendition of 'Semogia Bahagia' offered an unexplored re-look into the Children's Day song sung in Singapore schools every year.
Julian Wong embodies the 'Semogia Bahagia' spirit of pursuing and sharing knowledge, and being happy and blessed. Through careful research, he has explored and extracted Zubir Said's songbook, giving new life to sixteen of Zubir Said's songs with fresh arrangements, while remaining respectful of the composer-songwriter's original intentions. It was a history lesson one would want to revisit to tell our own stories, through the medium of songs interspersed with historical elements, rendered as an energised mix of simple anecdotes.
In his later years, Zubir Said dedicated much of his life and energy to teaching students to learn, play and love music, including the late Music Director and Cultural Medallion recipient Iskandar Ismail, who went on to mentor Julian Wong. With four of Julian's former students also performing in this show, it was a celebration of Pak Zubir's musical legacy and his music's power to unite people, the stories of Singapore's artists, as well as the generative relationship between teachers and students.
It was a pity that many of Zubir Said's songs have faded into obscurity and this narrative restoration of some of his musical gems won the hearts of the audience with a compelling show about Zubir Said's life and convictions as a man beyond merely the composer of our National Anthem and what it means to be Singaporean.
He was a man of peace as a recurring word that kept cropping up in his songs was "sentosa" meaning "peace and tranquility" in Malay. In forging ahead, his self-drive was evident in the telling the story of a youth who pursued dreams and knowledge and won the battle against despair and dislocation. May we all battle against this.
The Power of the Story
Julian Wong wielding his storytelling power through the story behind the story with heart reminded us that our own generative stories have as much power as the ones we have been told. It was encouraging to see Pak Zubir's living legacy and influence in the works.
With the echoes of a tale still lingering in our hearts, we left the theatre, warmed and inspired.
Don't Call Him Mr Mari Kita runs till 26 July 2022. Get tickets here.
Carolyn Chiam is an arts manager, who firmly believes that books and theatre open up possibilities and allow the imagination to explore new worlds and landscapes. Married to a musician, Joel Nah, they share their love for the arts with their children, Elliot and Elizabeth. If you would also like to contribute to Little Day Out, contact us at hello@littledayout.com.
Fly High And Discover The Wonders Of Aviation With SRT
Wild Rice's Pinocchio: A Uniquely Singaporean Pantomime Celebrating Family & Friendships
The Journey West: White Bone Fiend (In Mandarin) Review – Puppetry Magic By Paper Monkey Theatre
Gretel & Hansel (Mandarin): A Siblings Story Told With Humour & Escapades
Things To Do This Hari Raya Haji Long Weekend in Singapore: 9, 10 & 11 July 2022
Bite-Sized Parenting: 7 Ways To Motivate Children To Practise Music
Musical Playground At Gardens By The Bay: Make Music Together
Gallery Of Secrets: The Lost Lily – A Multi-Platform Treasure Hunt By The Theatre Practice


text:
Prega 75
Prega 75 Dosage/Direction for Use
Hetero Labs
Royal Distribution
ESTI Pharma
SELECT Concise Prescribing Info Full Prescribing Info Contents Description Action Indications/Uses Dosage/Direction for Use Overdosage Contraindications Special Precautions Use In Pregnancy & Lactation Side Effects Drug Interactions Storage MIMS Class ATC Classification Regulatory Classification Presentation/Packing
Concise Prescribing Info Full Prescribing Info Contents Description Action Indications/Uses Dosage/Direction for Use Overdosage Contraindications Special Precautions Use In Pregnancy & Lactation Side Effects Drug Interactions Storage MIMS Class ATC Classification Regulatory Classification Presentation/Packing
Posology: The dose range is 150 to 600 mg per day given in either two or three divided doses.
Neuropathic pain: Pregabalin treatment can be started at a dose of 150 mg per day given as two or three divided doses. Based on individual patient response and tolerability, the dose may be increased to 300 mg per day after an interval of 3 to 7 days, and if needed, to a maximum dose of 600 mg per day after an additional 7-day interval.
Epilepsy: Pregabalin treatment can be started with a dose of 150 mg per day given as two or three divided doses. Based on individual patient response and tolerability, the dose may be increased to 300 mg per day after 1 week. The maximum dose of 600 mg per day may be achieved after an additional week.
Generalised Anxiety Disorder: The dose range is 150 to 600 mg per day given as two or three divided doses. The need for treatment should be reassessed regularly.
Pregabalin treatment can be started with a dose of 150 mg per day. Based on individual patient response and tolerability, the dose may be increased to 300 mg per day after 1 week. Following an additional week, the dose may be increased to 450 mg per day. The maximum dose of 600 mg per day may be achieved after an additional week.
Discontinuation of Pregabalin: In accordance with current clinical practice, if pregabalin has to be discontinued, it is recommended that this should be done gradually over a minimum of 1 week independent of the indication.
Patients with renal impairment: Pregabalin is eliminated from the systemic circulation primarily by renal excretion as unchanged drug. As pregabalin clearance is directly proportional to creatinine clearance, dose reduction in patients with compromised renal function must be individualised according to creatinine clearance (CLcr), as indicated in Table 1, determined using the following formula: See equation.
Pregabalin is removed effectively from plasma by haemodialysis (50% of drug in 4 hours). For patients receiving haemodialysis, the pregabalin daily dose should be adjusted based on renal function. In addition to the daily dose, a supplementary dose should be given immediately following every 4-hour haemodialysis treatment. See Table 1.
Patients with hepatic impairment: No dose adjustment is required for patients with hepatic impairment.
Paediatric population: The safety and efficacy of Pregabalin in children below the age of 12 years and in adolescents (12-17 years of age) have not been established. No data are available.
Elderly (over 65 years of age) population: Elderly patients may require a dose reduction of pregabalin due to a decreased renal function.
Method of administration: Pregabalin may be taken with or without food.
Pregabalin is for oral use only.


text:
package com.zimbra.qa.unittest.prov.ldap;

import com.zimbra.common.localconfig.LC;
import com.zimbra.cs.ldap.LdapClient;
import com.zimbra.cs.ldap.LdapUsage;
import com.zimbra.cs.ldap.ZAttributes;
import com.zimbra.cs.ldap.ZLdapContext;
import com.zimbra.cs.ldap.ZLdapFilter;
import com.zimbra.cs.ldap.ZLdapFilterFactory;
import com.zimbra.cs.ldap.ZMutableEntry;
import com.zimbra.cs.ldap.ZSearchControls;
import com.zimbra.cs.ldap.ZSearchResultEntry;
import com.zimbra.cs.ldap.ZSearchResultEnumeration;
import com.zimbra.cs.ldap.ZSearchScope;
import com.zimbra.cs.ldap.LdapException.LdapSizeLimitExceededException;
import com.zimbra.cs.ldap.LdapServerConfig.GenericLdapConfig;
import com.zimbra.cs.ldap.ZLdapFilterFactory.FilterId;

public class LdapExample {

    private GenericLdapConfig getLdapConfig() {
        String ldapUrl = "ldapi:///";
        boolean startTLSEnabled = false;
        String bindDN = "cn=config";
        String bindPassword = LC.ldap_root_password.value();

        return new GenericLdapConfig(ldapUrl, startTLSEnabled, bindDN, bindPassword);
    }

    public void getAttributes() throws Exception {

        GenericLdapConfig ldapConfig = getLdapConfig();

        ZLdapContext zlc = null;
        try {
            zlc = LdapClient.getContext(ldapConfig, LdapUsage.SEARCH);

            /*
             * get attributes zimbraId, cn and description on DN "cn=default,cn=cos,cn=zimbra"
             */
            ZAttributes attrs = zlc.getAttributes("cn=default,cn=cos,cn=zimbra", new String[]{"zimbraId", "cn", "description"});
            String zimbraId = attrs.getAttrString("zimbraId");

            /*
             * get all attributes on DN "cn=default,cn=cos,cn=zimbra"
             */
            ZAttributes allAttrs = zlc.getAttributes("cn=default,cn=cos,cn=zimbra", null);

        } finally {
            // Note: this is important!!
            LdapClient.closeContext(zlc);
        }
    }

    public void search() throws Exception {
        String base = "cn=servers,cn=zimbra";
        String filter = "(objectClass=zimbraServer)";
        String returnAttrs[] = new String[]{"objectClass", "cn"};

        ZLdapFilter zFilter = ZLdapFilterFactory.getInstance().fromFilterString(FilterId.ZMCONFIGD, filter);

        ZSearchControls searchControls = ZSearchControls.createSearchControls(
                ZSearchScope.SEARCH_SCOPE_SUBTREE, ZSearchControls.SIZE_UNLIMITED,
                returnAttrs);

        GenericLdapConfig ldapConfig = getLdapConfig();

        ZLdapContext zlc = null;
        try {
            zlc = LdapClient.getContext(ldapConfig, LdapUsage.SEARCH);

            ZSearchResultEnumeration ne = zlc.searchDir(base, zFilter, searchControls);
            while (ne.hasMore()) {
                ZSearchResultEntry entry = ne.next();

                String dn = entry.getDN();

                ZAttributes attrs = entry.getAttributes();
                String cn = attrs.getAttrString("cn");
                String[] objectClasses = attrs.getMultiAttrString("objectClass");

                System.out.println("dn = " + dn);
                System.out.println("cn = " + cn);
                for (String objectClass : objectClasses) {
                    System.out.println("objetClass = " + objectClass);
                }
            }
            ne.close();

        } catch (LdapSizeLimitExceededException e) {
            e.printStackTrace();
            throw e;
        } finally {
            // Note: this is important!!
            LdapClient.closeContext(zlc);
        }
    }

    public void createEntry() throws Exception {
        // dn of entry to create
        String dn = "uid=user1,ou=people,dc=test,dc=com";

        GenericLdapConfig ldapConfig = getLdapConfig();

        ZLdapContext zlc = null;
        try {
            zlc = LdapClient.getContext(ldapConfig, LdapUsage.ADD);

            ZMutableEntry entry = LdapClient.createMutableEntry();
            entry.setDN(dn);

            entry.addAttr("objectClass", "inetOrgPerson");
            entry.addAttr("objectClass", "zimbraAccount");
            entry.addAttr("objectClass", "amavisAccount");

            entry.setAttr("uid", "user1");
            entry.setAttr("cn", "user1");
            entry.setAttr("sn", "lastname");
            entry.setAttr("zimbraAccountStatus", "active");
            entry.setAttr("zimbraId", "ba6198a3-bb49-4425-94b0-d4e9354e87b5");
            entry.addAttr("mail", "user1@trest.com");
            entry.addAttr("mail", "user-one@test.com");

            zlc.createEntry(entry);
        } finally {
            // Note: this is important!!
            LdapClient.closeContext(zlc);
        }
    }

    public void deleteEntry() throws Exception {
        String dn = "uid=user1,ou=people,dc=test,dc=com";

        GenericLdapConfig ldapConfig = getLdapConfig();

        ZLdapContext zlc = null;
        try {
            zlc = LdapClient.getContext(ldapConfig, LdapUsage.DELETE);
            zlc.deleteEntry(dn);
        } finally {
            // Note: this is important!!
            LdapClient.closeContext(zlc);
        }
    }

    public void modifyEntry() throws Exception {
        String dn = "cn=config,cn=zimbra";
        GenericLdapConfig ldapConfig = getLdapConfig();

        ZLdapContext zlc = null;
        try {
            zlc = LdapClient.getContext(ldapConfig, LdapUsage.MOD);

            ZMutableEntry entry = LdapClient.createMutableEntry();
            entry.setAttr("description", "so this gets modified");
            zlc.replaceAttributes(dn, entry.getAttributes());
        } finally {
            // Note: this is important!!
            LdapClient.closeContext(zlc);
        }
    }

    public static void main(String[] args) throws Exception {
        // only needs to be called once per JVM
        LdapClient.initialize();

        LdapExample test = new LdapExample();

        test.getAttributes();
        test.search();
        test.createEntry();
        test.deleteEntry();
        test.modifyEntry();
    }
}

redpajama_set_name: RedPajamaGithub


text:
DARE 2019: machinic assemblages of desire (forthcoming) DARE 2017: aberrant nuptials DARE 2015: the dark precursor
ethics and politics image music and sound philosophy performance space things transversal writing
coLab concert dialogue encounter from afar in absence in words keynote on screen on view performed
Search in https://dareconferences.org/
On Contemporary Philosophy and Art: Towards a Diagrammatic Critique of Aesthetics
conference: DARE 2015: the dark precursor
venue: Sphinx Cinema
format: keynote
practice: image
keywords: aesthetic regime, aesthetics, contemporary art, diagram
abstract video about the author(s)
It is less a matter of trying to produce a philosophy of contemporary art than of maintaining a position in-between Art and Philosophy so as to introduce an oscillation between them, a new pulsation passing between contemporary art and contemporary philosophy. We will seek to show how the diagram, in the form of a diagrammatic thought, can be mobilised as the probe-head of a contemporary art, the concept of which it helps to construct by distinguishing it from the aesthetic regime of art and the formal analysis that subtends its all too generic constitutive indetermination.
Éric Alliez (born 1957) is Professor Of Modern European Philosophy at Kingston University and at the University of Paris 8. His books include The Guattari Effect (2011), Capitalism and Schizophrenia and Consensus: Of Relational Aesthetics (2010), L'œil-cerveau (2007), La Pensée-Matisse (2005), The Signature of the World (2005), and Capital Times (preface by Gilles Deleuze, 1997) and Undoing the Image: Of Contemporary Art, vol. 1, Body Without Organs, Body Without Image, with Jean-Claude Bonne. Translated by Robin Mackay (Falmouth: Urbanomic, 2017).
Kingston University, UK, and University of Paris 8, FR
E.Alliez [AT] kingston.ac.uk
fass.kingston.ac.uk
philosophie.univ-paris8.fr
receive important updates about DARE
orpheus institute | responsibility | open access | terms & conditions | contact us


text:
A Surgeon and Humanitarian For Life
It all began in the 80s, when Assoc Prof Chua Yeow Leng, Senior Consultant from the Department of Cardiothoracic Surgery (CTS) began training as a general surgeon.

Assoc Prof Chua receiving the National Outstanding Clinician Award 2019 from Minister for Health, Mr Gan Kim Yong in the 2019 award ceremony.
It all began in the 80s, when Assoc Prof Chua Yeow Leng, Senior Consultant from the Department of Cardiothoracic Surgery (CTS), graduated from medical school and began training as a general surgeon. Initially, Assoc Prof Chua was interested in the trauma specialty, "I liked the excitement from working in trauma cases, and always found the abdomen quite familiar but did not know much about what is above it!"
As part of his training, he was first exposed to CTS and quickly found it to be exciting, with unlimited possibilities. Witnessing patients who went from extremely sick to having their lives turned around after a heart surgery, Assoc Prof Chua said, "No doubt it takes plenty of intense commitment and that the long hours take a toll on family life but when I realised how CTS can change a patient's life through our surgical team's efforts, I knew it was the vocation for me."
Specialising in the care for patients
Being a recognised leader and expert for heart valve repair surgery in Singapore and the region was just one of the many reasons why Assoc Prof Chua was recently awarded the National Outstanding Clinician Award 2019, held at the National Medical Excellence Awards earlier this month.
Sharing why he chose to specialise in atrial fibrillation (AF) and valve surgery, Assoc Prof Chua explained that out of all abnormal heart rhythms, AF is the most common arrhythmia which is typically detected in patients with heart valve problems.
"When one has AF, the risk of stroke goes up many times – sometimes up to 30 times. The aim of a valve repair surgery is to normalise the heart rhythm, effectively reducing the risk of stroke for these patients."
Highlighting the importance of teamwork with cardiologists for valve repair cases, Assoc Prof Chua shared, "Repairing a valve involves much more work as compared to changing one. It requires intensive pre-surgery preparation work – a surgeon has to know exactly what is wrong, how to classify and describe the valve problem, on top of many more details."
He is particularly thankful to Assoc Prof Ding Zee Pin and other NHCS Echocardiography cardiologists for their help with visualising patients' valves before a surgery, "Different specialties need to come together to look at valve repair cases, speak the same language and work together, only then can our treatment be administered well."
Citing the ability to gain patient's confidence as one the most important qualities for a clinician, Assoc Prof Chua expressed, "Gaining the trust from my patients is very important. As a surgeon, I have to be forthcoming and truthful in explaining their health condition, and establishing good rapport is key, even before the actual surgery."
The Birth of NHCS
Working at the Singapore General Hospital (SGH) and thereafter NHCS, Assoc Prof Chua has met many exceptional doctors whose dedication greatly inspired him. Heart surgery in the 70-80s was then in its developing stage in Singapore, and he had witnessed how his seniors and mentors improved on novel techniques and placed tremendous effort to ensure that surgeries went smoothly, "I was very fortunate to work with many brilliant doctors," Assoc Prof Chua recounted jovially.
He was also one of many who were involved in establishing NHCS, "Our hard work finally paid off when in 1994, Singapore Heart Centre finally opened at Mistri Wing on SGH campus. My employee number then was '02' – meaning I was the second staff in the organisation!"
In our first heart transplant case performed in Singapore, Assoc Prof Chua was responsible for many behind-the-scenes preparation work, "I was very excited for our first heart transplant surgery but had to go on a two-year HMDP Fellowship at Mayo Clinic in the United States and had to miss the actual surgery!"
Later, he played a key contributing role in several new initiatives and services such as the introduction of Mechanical Heart Assist Devices, Extra-Corporeal Membrane Oxygenator (ECMO) and the robotics surgery programme to NHCS.
Steering the surgical ship
At the young age of 35, Assoc Prof Chua became the Head of CTS. It was a huge challenge then as he was the main surgeon at NHCS. He juggled the (almost) daily on-calls and interrupted sleeps with phone calls coming from the hospital in the middle of the night updating him on the conditions of critical patients. It was not until new blood joined the department over the years that the workload became more manageable, allowing the whole CTS team to further strengthen their skills and capabilities.
While he stayed focused on his intensive and extensive surgical work, Assoc Prof Chua also made a commitment to train his junior surgeons. A firm believer in imparting his knowledge and skills to younger generations of doctors and other medical staff, he also believes in succession planning for leadership for the institution, "You need to have two or three staff trained in every discipline, this is why training and learning is so important."
He believes that each individual has their unique strengths and is dedicated to grooming and developing these doctors to their fullest potential in all aspects – from clinical care, research to personal development.
Going beyond local borders
Besides treating patients in Singapore, Assoc Prof Chua also leads medical and mission teams to China, Myanmar, Vietnam and more, for surgeries and case discussions. He believes that one of the ways to achieve beyond what a clinician can do is to look at improving healthcare in global health perspective. For examples, important causes such as bringing healthcare aid to the rest of the world like healthcare provision to places with malaria and emerging disease.
In 2014, Assoc Prof Chua was appointed the Group Director for the International Collaboration Office for SingHealth. He has since led teams of healthcare professionals in outreach and humanitarian mission efforts to regions such as China, Papua New Guinea, Nepal, Cambodia and Vietnam.
Assoc Prof Chua went on multiple medical mission trips to Kayin Chiang Station Hospital, Myanmar where he and his team are on a 10-year project to assist with patient consultations.
With these humanitarian efforts, Assoc Prof Chua said that resources such as medical equipment and supplies were often needed, "Some may think I'm a beggar or a karang guni (rag-and-bone) man. Those whom I meet often are asked to give money (for funding of humanitarian trips) or medical equipment!" He added that unwanted hospital equipment such as ECMO machines or hospital beds were often sent to countries on his mission trips, where they were given a new lease of life.
Closer to home, Assoc Prof Chua had helped to garner funding for the prestigious International Council of Nurses Congress 2019, held for the first time in Singapore.
His mentor
When asked who was his biggest influencer or mentor, Assoc Prof Chua was almost hard-pressed for an answer, recalling how there were too many 'teachers' in his life, "A great mentor I really cherish was Professor Abu Rauff whom I had learnt so much from and was a very important figure during my surgical training days.
He told of how he had initially failed one of his medical exams, "Prof Rauff was a positive force. He told me not to worry about failures and said that I may feel like it's the end of the world now but in future, I would surely look back at this as a defining moment in making me a stronger person. He then paid for me to retake the exams."
Assoc Prof Chua (middle) with fellow supportive colleagues.
When asked if he had any advice for younger, aspiring cardiothoracic surgeons, Assoc Prof Chua had this to share, "You need the fire in your belly in whatever you do in life. Do your best and learn to enjoy things that come your way."
Our outstanding clinician certainly has lots that we can learn from, and we are immensely proud for all that he had achieved for NHCS and beyond!
Article written by:


text:
Is it time for OG to fulfill their top ten destiny?
It's been quite a while ago now but OG's entry to the CS:GO scene was quite a tantalizing prospect and there was quite a lot of expectation on the squad. An odd mishmash of results followed as the world turned upside down, but after a seemingly endless stream of 14-16 losses and overtime defeats, it seems like they have finally turned a corner, ready to challenge for the top spots.
An ode to big brains
Let me start by saying that OG is exactly the sort of team I adore, and therefore I may very well be biased in their assessment. The idea of a group of big brain players with limited firepower coming together after having been rejected by their respective squads is exactly the sort of revenge/redemption story I watch CS for, and I always found a flank more impressive than a flick, if only because I myself can only rely on the former in the game. That said, there's no denying this is one of the more exciting projects in the scene, an international side with an approach closer to Astralis' than FaZe's, one that has already leapfrogged all but one of the squad members' previous teams.
Let's run down the list: ENCE is down in the dumpster having burned through most of the capital they earned with the fans, North remain a perennial punchline, Hellraisers is so irrelevant you wouldn't even be able to tell whether they're in the top 30 without looking it up (nope, #34 at the time of writing) and ALTERNATE aTTaX have never really been a part of this conversation to begin with. Vitality have done well after shedding their skin twice, and they are certainly among the top teams right now, but they still remain incredibly top-heavy – and a quick glance at Na'Vi's last few years tells everything you need to know about the ceiling of such a side.
The potential has always been there for OG and now it finally seems to have begun to materialize, and it makes sense that a team full of cerebral players would show slow but steady progress instead of a quantum leap to the top of the charts. As the many close defeats begin to turn into wins and their tournament runs get deeper over time, there's a very tempting direct comparison you can make about the team: their win over EG yesterday versus how they accomplished the same at BLAST Premier Spring Series back in February.
Cooler heads prevail
14-16 on Inferno, 16-14 on Nuke, 19-17 on Dust 2 to cap things off. Though OG seems to have some sort of a spell over Evil Geniuses, the different nature of their victory this time around is worth discussing. Not only were two of the maps a whole lot more one-sided (and the veto questionable on EG's part, floating Overpass despite their awful record on the map, not to mention their economic self-immolation in the last rounds of the series), the way the close rounds played out were markedly different and less chaotic than in the Spring Series event. This comms sample from OG the February BLAST broadcast was full of crosstalk and noise in the late-round scenario. Now listen to this clip from yesterday's game against Na'Vi where Aleksib is basically playing as a Commander in Natural Selection 2 rather than the dead guy in the middle of a round of CS:
The difference is night and day, and make no mistake, the sense of calm and focus on the comms in the middle of such a close game (and especially the fact that they still managed to close out the map 16-14 after losing this retake) suggests they have shattered the mental block that caused so many of their narrow defeats. The numbers also bear this out: the players' clutch success rate has ticked up since the end of the summer, with Aleksib himself contributing three different ones against Na'Vi across the two maps. This may not seem like much, but when your team became synonymous with close defeats, turning around one or two rounds on confident and calm individual play matters a lot. No wonder their position in the HLTV rankings has also shown the same sort of slow but consistent improvement over the last few months.
It's rare in CS to see a team materially improve without a roster change over the course of multiple months, and one has to wonder whether they would have been given the chance to work things out the same way had the LAN circuit not been interrupted by the pandemic. With OG's recent performances, the question is rapidly becoming academic, and they will no doubt be an exciting prospect once the offline events roll around.
Though it's usually the pressures of LAN we consider the most important mental part of competition, doing well in the online era requires its own sort of resilience. More games, lower prize pools, less prestige, no end in sight, stuck at home – more than six months into this upside down world, we've got to give credit to those who keep on keeping on playing the same permutations of CS over and over again for our entertainment, and finding a way to get better in the meantime. With that in mind, the teams forged in the monotony of the pandemic may end up doing a whole lot better than expected once the LAN circuit returns.
What would a Niko-less FaZe look like?
Something something NA CS LUL KEKW
A quick word about one of OG's vanquished rivals, too: the first act of the much-hyped intercontinental reunion has not worked out the way North American fans would have hoped it to, with Evil Geniuses suffering an early and painful exit, but there's no reason to panic about their level of play just yet. Small and closed ecosystems don't tend to produce excellence, and with the same set of familiar faces going up against each other over and over again in the NA bracket of the online era, there's more to adjust to than just the bootcamp circumstances in Serbia. Even if the North American sides fail to live up to expectations at the first few events where they get to compete against the European powerhouses, their level of play will only improve from there as the cross-regional encounters (hopefully) become regular affairs again going forward.
Now, if FURIA come in hot and dominate the competition, that would paint a very different picture altogether…


text:
Q: Helmholtz operator fundamental solution How can I find the fundamental solution to the following PDE in $R^3$:
$$-\Delta + 1 = 0$$.
So far I have that $\hat{u} = \frac{1}{1-|s|^2}$, but how can i get the inverse FT in 3D. Any help is appreciated.

redpajama_set_name: RedPajamaStackExchange