Blurb: With dreams of marrying an Old Order Amish man, Leah Yoder plans on raising children in the peaceful Delaware community. But when Mennonite missionary Daniel Brown arrives to share his story with their church, Leah is fascinated by him. She spends time with Daniel in a forbidden courtship to learn how she truly feels about him. Before long, Leah has a choice to make. Should she stay with her community…or leave with the man she believes God has placed in her life's path?


"How to add web image and thumbnail viewers to a page of ASP.NET WebForms application?"
Vintasoft.Imaging.Svg.WebImageViewerJS can display one or several images simulateously.
Single page - the image viewer simultaneously displays 1 image.
Single continuous column - the image viewer simultaneously displays all images in 1 continuous column.
Single continuous row - the image viewer simultaneously displays all images in 1 continuous row.
Two columns - the image viewer simultaneously displays 2 images in 2 columns.
Two rows - the image viewer simultaneously displays 2 images in 2 rows.
Two continuous columns - the image viewer simultaneously displays all images in 2 continuous columns.
Two continuous rows - the image viewer simultaneously displays all images in 2 continuous rows.
Three columns - the image viewer simultaneously displays 3 images in 3 columns.
Three rows - the image viewer simultaneously displays 3 images in 3 rows.
Three continuous columns - the image viewer simultaneously displays all images in 3 continuous columns.
Three continuous rows - the image viewer simultaneously displays all images in 3 continuous rows.
Vintasoft.Imaging.Svg.WebImageViewerJS.set_MultipageDisplayMode - Gets or sets the multipage display mode.
Vintasoft.Imaging.Svg.WebImageViewerJS.set_MultipageDisplayRowCount - Gets or sets the count of displayed images in row or column in multipage display mode.
Vintasoft.Imaging.Svg.WebImageViewerJS.set_MultipageDisplayLayoutDirection - Gets or sets the images layout direction in multipage display mode.
Vintasoft.Imaging.Svg.WebImageViewerJS can preview image in different modes.
Vintasoft.Imaging.Svg.WebImageViewerJS allows to specify the appearance (background brush, background color, border color, border width, border style) for focused image using the Vintasoft.Imaging.Svg.WebImageViewerJS.set_FocusedImageAppearance function and for not focused images using the Vintasoft.Imaging.Svg.WebImageViewerJS.set_ImageAppearance function.
Vector images/documents, for example PDF documents, must be rendered before preview in the Vintasoft.Imaging.Svg.WebImageViewerJS.
Rendering settings for vector images/documents can be set with the Vintasoft.Imaging.Svg.WebImageViewerJS.set_RenderingSettings function.
The Vintasoft.Imaging.Svg.WebImageViewerJS.set_ImageRotationAngle function allows to set an orthogonal rotation angle of image in the image viewer.
The Vintasoft.Imaging.Svg.WebImageViewerJS.set_UseCache function allows to specify whether caching of the image tiles on server is necessary.
Vintasoft.Imaging.Svg.WebImageViewerJS.get_ContextMenuFunc allows to get the handler for "contextmenu" event of the viewer.
Vintasoft.Imaging.Svg.WebImageViewerJS.set_ContextMenuFunc allows to set the handler for "contextmenu" event of the viewer.
The visual tools complement functionality of Vintasoft.Imaging.Svg.WebImageViewerJS class and allow to process images visually.
The active visual tool of the Vintasoft.Imaging.Svg.WebImageViewerJS can be set using Vintasoft.Imaging.Svg.WebImageViewerJS.set_VisualTool function.
More detailed information about visual tools can be found here: "Visual tools for SVG image viewer."


What Do You Do If The Computer Is Stolen?
Some thoughts on data security for conventions.
Over the last year, I have been a member of three conventions which have stored their membership lists on a computer, and lost the data. There is no point in naming them; but if the cap fits it won't fall over deaf ears . While I wouldn't call myself a hacker, in the traditional sense of the term, I've been fiddling around with computers, both hardware and software, for long enough to be able to discuss the problems, and some of the answers. My current hardware is an IBM-compatible, with no hard disk. The principles are the same, whatever the machine, but at times I will be mentioning IBM-specific problems.
So far as I know, the three cases had very different causes. One involved a partial collapse of the organising committee, another theft of a computer system, and the third was a classic hard-disk failure. A few simple precautions would have made a big difference in all three cases. A fourth cause of data loss, which could also affect card indexes and other non-computer systems, is fire.
I don't want to get into the details of the Data Protection Act. There are certain exemptions which may be applied to science fiction conventions. There are also two general rules which apply to all personal data. First, you should not store data that you don't need. Second, you should keep data securely. At first sight, the second rule is easy enough to keep. Nobody else uses your computer, do they? Think about it.
Amstrad PCs are all over the place in fandom. IBM-compatibles are pretty common, and the Apple Macintosh has been seen at conventions. All these are to some degree seen as serious computers. The Atari ST and the Commodore Amiga are also quite capaple of storing a convention membership list. There are two simple questions which must be answered. Can the computer handle the amount of data you need? How easy is it to get at another computer which can read the data? Little else matters, though you should check that there is a printer available which can handle labels. There is little point in having the membership list on a computer if you cannot print the labels for the mailings.
Let's make a simple, approximate, estimate of how much space is needed for data.
200 bytes will store six lines of forty characters. That should be enough for a name and address and a membership number. The lowest-capacity floppy disk that I know of, on a Tandy Model 1, stores 87.5KBytes, which would be 448 records, each 200 bytes long. Well, not all that space on the disk is available to store the data, but all the computers I have named will store at least four times as much data on one disk. Call it at least 1600 names, and remember that figure for later.
I think it is fairly clear that any computer with a disk drive should be able to handle the membership list for a small con, provided the software does not expect all the data to fit in memory. Even an Eastercon is possible. When you start getting to Worldcon size, I 'm afraid that choices start to get limited. A database with around 6000 names and addresses could be squeezed onto a high-density floppy disk, but that format is found at the professional level. If you are talking about a Worldcon you are definitely in the realms of hard disks and purpose-written back-up software, because the data files will probably not fit onto one floppy disk.
So the important question is what to do if the computer becomes unavailable. The simple answer is to use a commonly available machine, and if it comes to a choice between a single high-powered IBM-clone or two Ataris, go for the Ataris. There is one small complication. Apart from older Apple Macintoshes, data on 720KB 3. 5" disk drives can be pretty readily exchanged between different systems. The format for the Atari ST is almost identical to MS-DOS. In other cases, there are programmes which will handle MS-DOS format disks. If that is an option, make sure you test it before you find you have to use it, or re-type six hundred membership forms.
This is the really important part. If the data files will fit onto a single floppy disk, and this is quite possible, backing up the data is easy. It so so easy that there is no excuse for not making a back-up. For machines using MS-DOS all you need is the DISKCOPY routine. There is also a simple method of planning when to take back-up copies. There are two advantages to keeping the data on a floppy disk. First, it can be kept somewhere safe from fire or theft, in this case at the home of another committee member. Second, floppy disks have write-protect tabs, so it takes two consecutive mistakes to accidentally erase a file. The same principles apply to making back-ups of files on a hard drive.
First, get some floppy disks specifically for the convention database. Label them. Format them. If you have a program like EZFORMAT, which also thoroughly checks the disks for bad sectors, use that at its most rigourous setting. If you are a little paranoid, buy branded disks, and reject the whole box for back-up use if any format with bad sectors.
Second, make a complete back-up of your software. Make it from the working disks, not from the master disks. And use the write-protect tabs. It is also worth making a back-up copy of the initial empty database file.
I will assume that our committee-member plans to update the database four times a month, and that he is willing to risk having to re-enter a month's new members. He labels four disks "Rotating Back-Up A" to "Rotating Back-Up D". A fifth will store the working copy of the database, and is so labelled. The first session, he entered the first names on the membership list. He then copies the data file onto the "Rotating Back-Up A" disk. It is worth making a second back-up copy, "Back-Up 1". In the next three sessions he makes back-up copies onto disks "B", "C", and "D".
At the end of session five he copies the data first onto "Back-Up 2", a new disk. He then removes the write-protect tag from "Back-Up A" and copies the data onto that. Assume that he over-writes the previous back-up, though perhaps the files are not yet that big. Again, in the next three sessions he makes back-up copies onto disks "B", "C", and "D".
And so on. It really is that simple. The key point is that "Back-Up l", rather than being kept at his home, is kept by another committee member, and the same with "2", "3", etc. Ideally they should be handed over in person. If they are posted, make an extra copy and arrange to confirm that it has arrived before re-using "Rotating Back-Up A".
You should never need them if you take all this trouble. Of course, the back-ups should be kept in a different room to the working copies. They should be write-protected. And if you have a fireproof safe check if it will protect magnetic data, the critical temperature is far lower than Fahrenheit 451.
If something goes wrong and you lose your working data, never remove the write protect tag from a back-up copy. Always make a working copy from the back-up and use that. If you suspect a virus attack, and most so-called virus attacks are really human errors, either the operator or the programmers, don't do any work on the back-ups until you are sure you can find and kill the virus. Then check with a working copy of the back-up.
Follow this routine and there will be copies of the data held by two committee members, so fire and theft will be very unlikely to affect both. Other problems are guarded against by the rotating back-ups. And you still have the paper files to fall back on.
The most common problem with backing-up data on IBM-compatible computers using MS-DOS is that the utilities provided, BACKUP and RESTORE, are highly specific to the particular version of the operating system. Back-up under version 3.20 and you are unlikely to be able to restore under version 3.30, while version 4.01 RESTORE will probably imitate a Norwegian Blue parrot. But if you have files on hard disk which will not fit onto one floppy, you need some sort of back-up utility, and these are free. They do work, but make sure you have a copy of MS-DOS and the utilities you need to reformat your hard drive, and RESTORE, on a floppy disk.
It is possible to recover an accidentally deleted file. Do not write to the disk, as this will possibly over-write the data. Under MS-DOS, the DEL command only changes one byte of the directory entry and modifies the FAT. The data is still on the disk. I use "File Rescue Plus", there are other programs which will un-erase a file. It makes it easier if the file is written in a continuous block, or has only non-deleted files breaking it up. Most file recovery packages also have routines to optimise files, which also makes reading the file quicker, by moving the data into a continuous block. DO NOT USE ANY DISK OPTIMISING OR FILE RECOVERY SOFTWARE UNDER A MULTI-TASKING OPERATING SYSTEM.
I have suggested that DISKCOPY is used to make back-ups of a floppy disk. This makes an identical copy of the original floppy, included deleted files, so use it if you have deleted a file. A more flexible method is to use XCOPY, which only copies files and subdirectories. The copy on the floppy will be optimised, as a side effect. With XCOPY it is possible to copy only files which have been altered since the last time they have been copied, or since a certain date. Look in the manual for details.
There are file archiving utilities which compress files into less disk space. The best have similar features to XCOPY. Make sure that they work, because the compressed file is unreadable. I would suggest PKZIP, which is a shareware package, if you want to try this. Don't confuse this with programmes which compress and expand data every time you write to and read from the disk drive. I am a little reluctant to trust them.
It is possible to prevent most losses of computer data by routine and methodical back-ups. Only the largest conventions need to store more data than will fit on one disk, so no special software is needed. What is your excuse?


Eye Candy for the organizationally obsessed.
I decided last week to organize my trim, rick rack, and sewing ribbons.
A small suitcase full of a messy mass of trims.
There are some pretty choices in there, but I was unhappy with how I had to root through the case EVERY time I needed some decoration.
Enter an 80-pocket jewelry organizer from Amazon. For ten dollars. Yep. Only $10.
And just LOOK at how amazing my trim looks now!
This side (did I mention that it's double-sided?) is in order according to colour.
I had to include some close-ups.
Now that I can see all of my trims, I love each of them even MORE!
Here is the other side - a lot of white trims and lace, plus some of my multi-coloured pieces that didn't fit into any colour category.
My organizer now hangs on the back of my studio door in all its glory. SO convenient and oh-so-pretty!
Love it, Shannon! This looks great and I'm sure that whenever you need a ribbon or trim, it will be a pleasure choosing it from now on. I may have to order a couple of those organizers!
What's at the End of YOUR Rainbow?


text:
Annona maritima este o specie de plante angiosperme din genul Annona, familia Annonaceae. A fost descrisă pentru prima dată de Záchia, și a primit numele actual de la H. Rainer. Conform Catalogue of Life specia Annona maritima nu are subspecii cunoscute.

Referințe

Annona

redpajama_set_name: RedPajamaWikipedia


text:
\section{Introduction}

Appropriate behaviour of an interactive system component
often depends on events generated by other components.
The ideal situation, in which perfect information is available across
components, occurs rarely in practice -- typically a component
only receives signals more or less correlated with the actual events.
Apart of imperfect signals generated by the system components,
there are multiple other sources of
uncertainty, due to
actions of the system environment or to unreliable
behaviour of the infrastructure connecting the components:
For instance, communication channels
may delay or lose signals,
or deliver them in a different order than they were emitted.
Coordinating components with such imperfect information
to guarantee optimal system runs is a significant, but
computationally challenging problem, in particular
when the interaction is of infinite duration.
It appears worthwhile to study the different sources
of uncertainty in separation rather than as a global phenomenon,
to understand their computational impact on the synthesis of
multi-component systems.

In this paper, we consider interactive systems modelled by concurrent
games among multiple players with imperfect information over finite
state-transition systems, or labelled graphs. Each state is associated
to a stage game in which the players choose simultaneously and
independently a joint action, which triggers a transition to a
successor state, and generates a local payoff and possibly further
private signals to each player.
Plays correspond to infinite paths through the graph and yield to each
player a global payoff according to a given aggregation function, such as mean payoff,
or parity. As solutions to such games, we are interested in
synthesising Nash equilibria in pure strategies, i.e.,
profiles of deterministic strategies that are self-enforcing
when prescribed to all players by a central coordinator.

The basic setting is standard for the automated verification and
synthesis of reactive modules that maintain ongoing interaction with
their environment seeking to satisfy a common global specification.
Generally, imperfect information about the play is
modelled as uncertainty about the current state in the underlying
transition system, whereas uncertainty about the actions of other players is
not represented explicitly.
This is because the main question concerns \emph{distributed} winning
strategies, i.e., Nash equilibria in the special case where all
players receive maximal payoff, which here is common to all of them.
If each player wins when all
follow the prescribed strategy, unilateral deviations cannot be
profitable
and any reaction to them would be ineffective,
hence there is no need to monitor actions of other players.
Accordingly, distributed winning strategies can be defined on
(potential) histories of visited states, independently of the history
of played actions.
Nevertheless, these games are computationally
intractable in general, already with respect to the question of whether
distributed winning strategies exist~\cite{PnueliRos90,PetersonRei79,AzharPetRei01}.

Moreover, if no equilibria that yield maximal payoffs
exist for a given game, and we consider arbitrary Nash equilibria,
it becomes crucial for a player to monitor the actions of other
players. To illustrate,
one elementary scheme for constructing equilibria in games of
infinite duration relies on \emph{grim-trigger} strategies: cooperate
on the prescribed equilibrium path until one player deviates, and at
that event, enter a coalition with the remaining players and switch to a
joint punishment strategy against the deviator.
Most procedures for
constructing Nash equilibria in games for verification and synthesis
are based on this scheme, which relies essentially on the ability of players
to detect \emph{jointly} the deviation~\cite{Ummels08,UmmelsWoj11,Brenguier13,BrihayeBP14}.
This works well under perfect, instant monitoring, where all players have
common knowledge about the last action performed by every other
player.
However, the situation becomes more complicated
when players receive only imperfect signals about the actions of other
players, and worse, if the signals are not delivered instantly, but
with uncertain delays that may be different for each player.

To study the effect of imperfect, delayed monitoring on equilibria in
concurrent games, we introduce a refined model in which
observations about actions are separated from observations about
states, and we incorporate a representation for nondeterministic
delays for observing action signals.
To avoid the general undecidability results from the basic setting,
we restrict to the case where the players have
perfect information about the current state.
Under the assumption that the delays are uniformly bounded, we show
that equilibrium outcomes from the version of a game where signals are
delivered instantly
can be preserved in the variant where they are delayed.
Towards this, we construct strategies for the
delayed-monitoring game by combining responses for the
instant-monitoring variant in such a way that any play with delayed
signals corresponds to a shuffle of several plays with instant
signals, which we call threads.
Intuitively, delayed-monitoring strategies are constructed, in a
Frankenstein manner, from a
collection of instant-monitoring equilibrium strategies.
Under an additional assumption that the payoff structure is
insensitive to shuffling plays this procedure allows to transfer
equilibrium values from the instant to the delayed-monitoring game.

We point out that when we set out with finite-state equilibrium strategies for the
instant-monitoring game, the procedure will also yield a profile of
finite-state strategies for the delayed-monitoring game. Hence, the
construction is effective, and can be readily applied to cases
where synthesis procedures for finite-state equilibria in games with
instant monitoring exist.

\paragraph*{Related literature}

One motivation for studying infinite games with delays comes from the
work of Shmaya~\cite{Shmaya11} considering sequential games on finitely
branching trees (or equivalently, on finite graphs)
where the actions of players are monitored
perfectly, but with arbitrary finite delays. In the setting of
two-player zero-sum games with Borel winning conditions, he shows that
these delayed-monitoring games are determined in mixed strategies.
Apart of revealing that infinite games on finite graphs are robust
under monitoring delays, the paper is enlightening for its
proof technique which relies on a reduction of the delayed-monitoring
game to a game with a different structure that features instant
monitoring but, in exchange, involves stochastic moves.

Our analysis is inspired directly from a recent article of Fudenberg, Ishii, and
Kominers~\cite{FudenbergIK14} on infinitely repeated games
with bounded-delay monitoring whith stochastically
distributed observation lags. The authors prove a
transfer result that is much stronger than ours, which also covers
the relevant case of discounted payoffs (modulo a controlled adjustment
of the discount factor).
The key idea for constructing strategies in the delayed-response game
is to modify strategies from the instant-response game by letting them
respond with a delay equal to the maximal monitoring delay so that all
players received their signals. This amounts to
combining different threads of the
instant-monitoring game, one for every time unit in the
delay period. Thus, the proof again involves a reduction between games
of different structure, with the difference that here one game is
reduced to several instances of another one.

Infinitely repeated games correspond to the particular case of
concurrent games with only one state. This allows applying
classical methods from strategic games which are no longer accessible
in games with several states~\cite{RosenbergSV06}.
Additionally, the state-transition structure of our setting
induces a combinatorial effort to adapt the delayed-response
strategies of Fudenberg, Ishii, and Kominers: As
the play may reach a different state
until the monitoring delay expires,
the instant-monitoring threads must be scheduled more carefully
to make sure that they combine
to a valid play of the delayed-monitoring variant.
In particular, the time for returning to a particular game state may be
unbounded, which makes it hard to deliver guarantees under
discounted payoff functions.
As a weaker notion of patience, suited for games with state
transitions, we consider payoff aggregation functions that are
\emph{shift-invariant and submixing}, as introduced by Gimbert and Kelmendi
in their work on memoryless strategies in stochastic games~\cite{GimbertKel14}.

Our model generalises
concurrent games of infinite duration over finite graphs. Equilibria
in such models have been investigated for the perfect-information
case, and it was shown that it is decidable
with relatively low complexity whether equilibria exist, and
if this is the case, finite-state equilibrium profiles can be
synthesised for several relevant cases of
interest~\cite{Ummels08,Ummels11,BouyerBMU11}.

The basic method for constructing equilibria in the
case of perfect information relies on grim-trigger strategies that
react to deviations from the equilibrium path by turning to a
zero-sum coalition strategy opposing the deviating player. Such an approach
can hardly work under imperfect monitoring where deviating actions
cannot be observed directly.
Alternative approaches to constructing
equilibria without relying on perfect monitoring comprise, on the one hand
distributed winning strategies for games that allow all players of a
coalition to attain the most efficient
outcome~\cite{KupfermanVar01,FinkbeinerSch05,BKP11},
and at the other extreme,
Doomsday equilibria, proposed by Chatterjee
et al. in~\cite{ChatterjeeEtAl14}, for games where any deviation
leads to the most inefficient outcome, for all players.

\medskip

In this paper, we prove a transfer result that implies effective
solvability of games with a particular kind of imperfect information,
due to imperfect monitoring of actions, and delayed delivery of
signals.
Towards this, we first introduce a new model of concurrent games
where observation signals associated to actions are detached from
the state information, and in which the emission and delivery time of
signals can be separated by a lag controlled by Nature.
Then, we present the proof argument which relies on a reduction
of a delayed-monitoring game
to a collection of instances of an instant-monitoring game.

\section{Games with delayed signals}

There are~$n$ players~$1, \dots, n$ and a distinguished agent called Nature.
We refer to a list $x=(x^i)_{1\le i \le n}$ that associates one element $x^i$ to every
player~$i$ as a \emph{profile}.
For any such profile, we write $x^{-i}$ to denote the
list $( x^j )_{1 \le j \le n, j \neq i}$ where the element
of Player~$i$ is omitted.
Given an element $x^i$ and a list $x^{-i}$, we denote by
$(x^i, x^{-i} )$ the full profile $(x^i)_{1 \le i  \le n}$.
For clarity, we
always use superscripts to specify to which player an element
belongs. If not quantified explicitly, we refer to Player~$i$
to mean any arbitrary player.

\subsection{General model}

For every player~$i$, we fix a set~$A^i$ of \emph{actions},
and a set~$Y^i$ of \emph{signals}; these sets are finite.
The \emph{action space}~$A$ consists of all action profiles, and
the \emph{signal space}~$Y$ of all signal profiles.

\subsubsection{Transition structure.}
The transition structure of a game is described by
a \emph{game graph} $G = (V, E)$ over a finite set~$V$ of
\emph{states} with
an edge relation
$E \subseteq V \times A \times Y \times V$
that represents \emph{transitions}
labelled by action and signal profiles.
We assume that for each state $v$ and every action profile~$a$,
there exists at least one transition $(v, a, y, v') \in E$.

The game is played in stages over infinitely many periods
starting from a designated initial state $v_0 \in V$
known to all players.
In each period~$t \ge 1$, starting in a state~$v_{t-1}$,
every player~$i$ chooses an action $a^i_t$,
and Nature chooses a transition
$(v_{t-1}, a_t, y_t, v_t) \in E$, which determines
a profile~$y_t$ of emitted signals and a successor state $v_t$.
Then, each player~$i$
observes a set of signals depending on the monitoring structure of the
game,
and the play proceeds to period $t+1$ with
$v_t$ as the new state.

Accordingly, a~\emph{play} is an infinite sequence
$v_0,~ a_1, y_1, v_1,~ a_2, y_2, v_2 ~
\dots\in V(AYV)^\omega$ such that $(v_{t-1}, a_t, y_t, v_t) \in
E$, for all $t \ge 1$.
A \emph{history} is a finite prefix
$v_0,~ a_1, y_1, v_1, ~\dots, ~a_t, y_t, v_t
\in V (AYV)^*$
of a play.
We refer to the number of stages
played up to period~$t$ as the \emph{length} of the history.

\subsubsection{Monitoring structure.}
We assume that each player~$i$ always knows the current state $v$
and the action $a^i$ she is playing.
However, she is not informed about the actions or signals
of the other players. Furthermore, she may observe
the signal~$y^i_t$ emitted in a period $t$ only in some later period
or, possibly, never at all.

The signals observed by Player~$i$ are described by an
\emph{observation} function
\begin{align*}
  \beta^i:V (A Y V)^+ \to 2^{Y^i},
\end{align*} which
assigns to every nontrivial history
$\pi = v_0,~ a_1, y_1, v_1, ~\dots, ~a_t, y_t, v_t$
with $t \ge 1$ a set
of signals that were actually emitted along $\pi$ for the player:
\begin{align*}
  \beta^i( \pi ) \subseteq \{ y^i_r \in Y^i~|~ 1 \le r \le t \}.
\end{align*}
For a global history~$\pi \in V(AYV)^*$,
the \emph{observed history} of Player~$i$
is the sequence
\begin{align*}
  \beta^i( \pi ) := v_0,~ a^i_1, z^i_1, v_1, ~
  \dots, ~a^i_t, z^i_t, v_t
\end{align*}
with
$z^i_r = \beta^i( v_0, ~ a_1, y_1, v_1,~ \dots, ~ a_r, y_r, v_r )$,
for all $1 \le r \le t$. Analogously, we define the
\emph{observed play} of Player~$i$.

A \emph{strategy} for player~$i$ is a mapping $s^i:V (A^i Y^i V)^* \to A^i$
that associates to every observation history $\pi \in V (A^i Y^i V)^*$ an action
$s^i( \pi )$. The \emph{strategy space}~$S$ is the set of all strategy profiles.
We say that a history or a play $\pi$ \emph{follows} a strategy~$s^i$, if
$a^i_{t+1} = s^i( \beta^i( \pi_t ))$, for
all histories $\pi_t$ of length $t \ge 0$ in $\pi$.
Likewise, a history or play
follows a profile $s \in S$, if it follows the strategy $s^i$ of each
player~$i$.
The \emph{outcome} $\mathrm{out}( s )$ of a strategy profile~$s$
is the set of all plays that follow it.
Note that the outcome of a strategy profile
generally consist of multiple plays,
due to the different choices of Nature.

Strategies may be partial functions. However, we require that for any
history~$\pi$ that follows a strategy $s^i$, the observation history
$\beta^i( \pi )$ is also included in the domain of $s^i$.

With the above definition of a strategy, we implicitly assume that players have
perfect recall, that is, they may record all the information acquired
along a play. Nevertheless, in certain cases, we can restrict our
attention to strategy functions computable by automata with finite memory.
In this case, we speak of \emph{finite-state strategies}.

\subsubsection{Payoff structure.}
Every transition taken in a play
generates an integer payoff to each player~$i$,
described by a \emph{payoff} function $p^i: E \to \mathbb{Z}$.
These stage payoffs are combined by a
 \emph{payoff aggregation} function
$u: \mathbb{Z}^\omega \to \mathbb{R}$
to determine the \emph{utility} received by Player $i$ in a play~$\pi$
as
$
  u^i( \pi ) := u (\, p^i( v_0, a_1, y_1, v_1), p^i(v_1, a_2, y_2,
v_2), \dots \,).
$
Thus, the profile of
\emph{utility}, or global payoff, functions $u^i: V (A Y V)^\omega \to \mathbb{R}$
is represented by a profile of payoff functions~$p^i$ and
an aggregation function~$u$, which is common to all players.

We generally consider utilities that
depend only on the observed play, that is,
$u^i( \pi ) = u^i (\pi')$, for any plays $\pi, \pi'$
that are indistinguishable to Player~$i$, that is, $\beta^i( \pi ) =
\beta^i( \pi' )$.
To extend payoff functions from plays to strategy profiles, we set
\begin{align*}
  u^i( s ) := \inf \{ u^i( \pi ) ~|~ \pi \in \mathrm{out}( s ) \},
  ~\text{for each strategy profile } s \in S.
\end{align*}

Overall, a game $\mathcal{G} = (G, \beta, u)$ is
described by a game graph with
a profile of observation functions and one of payoff functions.
We are interested in \emph{Nash equilibria},
that is, strategy profiles $s \in S$ such that
$u^i( s ) \ge u^i ( s^{-i}, r^{i} )$, for every player $i$
and every strategy $r^i \in S^i$. The payoff
$w = u^i( s )$ generated by an equilibrium~$s \in S$
is called an equilibrium payoff. An equilibrium payoff $w$ is
\emph{ergodic} if it does not depend on the initial state of the
game, that is, there exists a
strategy profile~$s$ with $u( s ) = w$, for every choice of an initial state.

\subsection{Instant and bounded-delay monitoring}

We focus on two particular monitoring structures,
one where the players observe their component of the signal profile instantly,
and one where each player~$i$ observes his private signal emitted in period $t$
in some period $t + d^i_t$,
with a bounded delay~$d^i_t \in \mathbb{N}$ chosen by Nature.

Formally, a game with \emph{instant monitoring} is one where the
observation functions~$\beta^i$ return, for every history
$\pi = v_0, ~ a_1, y_1, v_1, ~\dots, ~ a_t, y_t,v_t$ of length
$t\ge 1$,
the private signal emmited for Player~$i$ in the current stage, that is,
$\beta^i(\pi) =
\{ y^i_t \}$, for all $t \ge 1$.
As the value is always a singleton, we may
leave out the enclosing set brackets and write $\beta^i( \pi ) = y^i_t$.

To model bounded delays, we consider signals
with an additional component that represents a timestamp.
Concretely, we fix a set $B^i$ of \emph{basic signals}
and a finite set $D^i \subseteq \mathbb{N}$ of
\emph{possible delays}, for each player~$i$, and consider the product
$Y^i := B^i \times D^i$ as a new set of signals.
Then, a game with \emph{delayed monitoring} is a game over the signal space $Y$
with observation functions~$\beta^i$ that return,
for every history $\pi = v_0, ~ a_1,
(b_1,d_1), v_1, ~\dots, ~ a_t, (b_t, d_t), v_t$ of length~$t
\ge 1$, the value
\begin{align*}
  \beta^i( \pi ) = \{ (b^i_r, d^i_r) \in B^i\times D^i~|~r \ge 1,~r + d^i_r =
  t \}.
\end{align*}

In our model, the role of Nature
is limited to choosing the delays for
observing the emitted signals.
Concretely, we postulate that the basic signals
and the stage payoffs associated to transitions
are determined by the current state and the action profile chosen by
the players, that is, for every global state $v$ and action profile
$a$, there exists a unique profile $b$ of basic signals and a unique
state~$v'$ such that $(v, a, (b, d), v') \in E$, for some $d \in
D$; moreover, for any other delay profile $d' \in D$,
we require $(v, a, (b, d'), v' ) \in E$, and also that
$p^i(v, a, (b, d), v' )= p^i(v, a, (b, d'), v' )$.
Here again, $D$ denotes the \emph{delay space}
composed of the sets~$D^i$. Notice that under this assumption, the
plays in the outcome of a strategy profile $s$ differ only by
the value of the delays. In particular, all plays in $\mathrm{out}( s )$
yield the same payoff.

To investigate the effect of observation delays,
we will relate the delayed and instant-monitoring
variants of a game.
Given a game $\mathcal{G}$ with delayed monitoring,
the corresponding instant-monitoring game $\mathcal{G'}$ is
obtained by projecting every signal $y^i = (b^i, d^i)$
onto its first component $b^i$ and
then taking the transition and payoff structure induced by
this projection. As we assume that
transitions and payoffs are independent of delays,
the operation is well defined.

Conversely, given a game $\mathcal{G}$ with instant monitoring
and a delay space~$D$,
the corresponding game $\mathcal{G}'$ with delayed monitoring is obtained by
extending the set $B^i$ of basic signals in $\mathcal{G}$
to $B^i \times D^i$, for each player~$i$, and
by lifting the transition and payoff structure accordingly. Thus, the
game $\mathcal{G}'$  has the same states as $\mathcal{G}$
with transitions $E' := \{ (v, a, (b,d), w)~|~ (v, a, b, w) \in E, d \in D \}$,
whereas the payoff functions are given
by ${p'}^i( v, a, (b, d), w) := p^i( v, a, b, w )$,
for all~$d \in D$.

As the monitoring structure of games with instant or delayed monitoring
is fixed, it is sufficient to describe
the game graph together with the profile of payoff functions, and to
indicate the payoff aggregation function. It
will be convenient to include the payoff associated to a transition as an
additional edge label and thus represent the game simply as a pair
$\mathcal{G} = (G, u)$ consisting of a finite labelled game graph and an
aggregation function $u: \mathbb{Z}^\omega \to \mathbb{R}$.

\subsection{Shift-invariant, submixing utilities}

Our result applies to a class of games where the payoff-aggregation
functions are invariant under removal of prefix histories and
shuffling of plays. Gimbert and Kelmendi \cite{GimbertKel14}
identify these properties as a guarantee for the existence of simple
strategies in stochastic zero-sum games.

A function $f: \mathbb{Z}^\omega \to \mathbb{R}$ is \emph{shift-invariant},
if its value does not change when adding an arbitrary finite prefix to the
argument, that is, for every sequence $\alpha \in \mathbb{Z}^\omega$
and each element $a \in \mathbb{Z}$, we have
$f( a \alpha ) = f( \alpha )$.

An infinite sequence $\alpha \in \mathbb{Z}^\omega$ is a \emph{shuffle}
of two sequences $\beta, \gamma \in \mathbb{Z}^\omega$,
if $\mathbb{N}$ can be partitioned into two infinite sets
$I = \{ i_0, i_1, \dots \} $ and $J = \{j_0, j_1, \dots \}$ such that
$\alpha_{i_k} = \beta_k$ and $\alpha_{j_k} = \gamma_k$, for all $k \in
\mathbb{N}$.
A function $f: \mathbb{Z}^\omega \to \mathbb{R}$ is called \emph{submixing}
if, for every shuffle $\alpha$ of two sequences $\beta, \gamma \in
\mathbb{Z}^\omega$, we have
\begin{align*}
\min\{ f( \beta ), f( \gamma) \} \le f( \alpha ) \le \max \{ f(
\beta), f( \gamma )\}.
\end{align*}
In other words, the image of a shuffle product always lies between
the images of its factors.

The proof of our theorem relies on payoff aggregation functions
$u : \mathbb{Z}^\omega \to \mathbb{R}$ that are shift-invariant and
submixing. Many relevant game models used in
economics, game theory, and computer science satisfy this restriction.
Prominent examples are mean payoff or limsup payoff,
which aggregate sequences of stage payoffs $p_1, p_2,
\dots\in \mathbb{Z}^\omega$ by setting:
\begin{align*}
  \mathrm{mean}\text{-}\mathrm{payoff} ( p_1, p_2, \dots) & := \limsup_{t \ge 1} \frac{1}{t} \sum_{r =
    1}^{t} p_r, \quad \text{and} \\
  \mathrm{limsup}( p_1, p_2, \dots) & := \limsup_{t \ge 1} p_t.
\end{align*}

Finally, parity conditions which map non-negative integer payoffs
$p_1, p_2, \dots $ called priorities  to
$\mathrm{parity}(p_1, p_2, \dots ) = 1$ if the least priority that occurs
infinitely often is even, and $0$ otherwise, also satisfy the conditions.

\subsection{The transfer theorem}

We are now ready to formulate our result stating that, under certain restrictions,
equilibrium profiles from games with instant monitoring can be
transferred to games with delayed monitoring.

\begin{theorem}
Let $\mathcal{G}$ be a game with instant monitoring and
shift-invariant submixing payoffs, and let $D$ be a finite delay
space~$D$. Then, for every ergodic equilibrium payoff $w$ in $\mathcal{G}$,
there exists an equilibrium of the $D$-delayed monitoring game
$\mathcal{G}'$ with the same payoff~$w$.
\end{theorem}

The proof relies on constructing a strategy for the delayed-monitoring
game while maintaining a collection of virtual plays of the
instant-monitoring game on which the given strategy is queried.
The responses are then combined according to a
specific schedule to ensure that the actual play arises as a shuffle
of the virtual plays.

\section{Proof}

Consider a game $\mathcal{G} = (G, u)$ with instant monitoring where
the payoff aggregation function $u$ is shift-invariant and submixing,
and suppose that $\mathcal{G}$ admits an equilibrium profile $s$.
For an arbitrary finite delay space $D$, let
$\mathcal{G'}$ be the delayed-monitoring variant of $\mathcal{G}$.
In the following steps, we will construct a strategy profile $s'$ for $\mathcal{G'}$, that is in
equilibrium and yields the same payoff $u( s' )$ as $s$ in $\mathcal{G'}$.

\subsection{Unravelling small cycles}

To minimise the combinatorial overhead for scheduling delayed responses,
it is convenient to ensure that,
whenever the play returns to a state $v$, the signals emitted at the
previous visit at $v$ have been received by all players.
If every cycle in the given game graph~$G$ is at least as long as any possible
delay, this is clearly satisfied. Otherwise,
the graph can be expanded to avoid small cycles, e.g., by
taking the product with a cyclic group of order equal to the
maximal delay.

Concretely, let $m$ be the greatest delay among $\max D^i$, for all players $i$.
We define a new game graph $\hat{G}$ as the product of~$G$
with the additive group $\mathbb{Z}_m$ of integers modulo~$m$,
over the state set $\{ v_j ~|~ v \in V, j \in \mathbb{Z}_m \}$
by allowing transitions $(v_j, a, b, v'_{j+1})$,
for every $(v, a, b, v') \in E$ and all $j \in
 \mathbb{Z}_m$, and by assigning stage payoffs
$\hat{p}^i(v_j, a, b, v'_{j+1}) := p^i(v, a, b, v')$,
for all transitions $(v, a, b, v') \in E$. Obviously,
every cycle in this game has length at least $m$.
Moreover, the games $(\hat{G}, u)$ and $(G, u )$ are equivalent: Since the
index component $j \in \mathbb{Z}_m$ is not observable to the players,
the two games have the same sets of strategies,
and profiles of corresponding strategies yield the same observable
play outcome, and hence the same payoffs.

In conclusion, we can assume without loss of generality
that each cycle in the game graph~$G$ is longer than the maximal
delay $\max D^i$, for all players $i$.

\subsection{The Frankenstein procedure}

We describe a strategy $f^i$ for Player~$i$ in the delayed monitoring game
$G'$ by a reactive procedure that receives observations of states and
signals as input and produces actions as output.

The procedure
maintains a collection of virtual plays of the
instant-monitoring game. More precisely, these are observation
histories for Player~$i$ following the strategy $s^i$ in~$G$,
which we call \emph{threads}. The observations collected
in a thread $\pi = v_0,~a_1^i, (b_1^i, d_1^i), v_1, ~\dots,~
a_r^i, (b_r^i, d_r^i), v_r$ are drawn from the play of
the main delayed-monitoring game~$G'$. Due to delays,
it may occur that the signal $(b_r^i, d_r^i)$ emitted in the last
period of a thread has not yet been received.
In this case, the signal entry is replaced by a special symbol
$\#$, and we say that the thread is \emph{pending}.
As soon as the player
receives the signal, the placeholder $\#$ is overwritten with the actual value, and the
thread becomes \emph{active}. Active threads $\pi$ are used to query the
strategy~$s^i$; the prescribed action $a^i = s^i ( \pi )$ is
played in the main delayed-monitoring game and it is also used to continue
the thread of the virtual instant-monitoring game.

To be continued, a thread must be active and
its current state needs to match the
actual state of the play in the delayed-monitoring game. Intuitively,
threads advance more slowly than the actual play, so we need
multiple threads to keep pace with it.
Here, we use a collection of $|V|+1$ threads, indexed by an
ordered set $K = V \cup \{ \varepsilon \}$.
The main task of the procedure is to schedule the continuation of
threads. To do so, it
maintains a data structure $(\tau, h)$ that
consists of the threads $\tau = (\tau_k)_{k \in K}$ and
a scheduling sequence $h = h[0], \dots, h[t]$  of indices from $K$,
at every period $t \ge 0$ of the actual play.
For each previous $r < t$, the entry $h[r]$ points to the thread
according to which the action of period $r+1$ in the actual play has
been prescribed; the
last entry $h[t]$ points to an active thread that is currently scheduled for
prescribing the action to be played next.

The version of Procedure Frankenstein${}^i$ for Player~$i$, given
below, is para\-metrised by the game graph $G$ with the designated initial state, the
delay space $D^i$, and the given equilibrium strategy $s^i$ in the
instant-monitoring game.  In the initialisation phase, the
initial state $v_0$ is stored in the initial thread
$\tau_\varepsilon$ to which the current scheduling entry $h[0]$ points.
The remaining threads are
initialised, each with a different position from $V$.
Then, the procedure enters a non-terminating loop along the periods
of the actual play.
In every period~$t$, it outputs
the action prescribed by strategy $s^i$ for the current thread scheduled by
$h[t]$ (Line 5).
Upon receiving the new state, this current thread
is updated by recording the played action and the successor
state; as the signal emmitted in the instant-monitoring play is not
available in the delayed-monitoring variant, it is temporarility replaced by
$\#$, which marks the current thread as pending (Line 7).
Next, an active thread that matches the new state is scheduled (Line
9), and the received signals are recorded with the pending threads
to which they belong (Line 11 -- 14). As a consequence, these threads become
active.

\setlength{\interspacetitleruled}{0pt}%
\setlength{\algotitleheightrule}{0pt}%

\SetKw{KwAssert}{assert}
\SetKw{KwPlay}{play}
\SetKw{KwReceive}{receive}
\begin{algorithm}

\smallskip
\TitleOfAlgo{Frankenstein${}^{i}(G, v_0, D^i, s^i)$}
\label{fig:frankenstein}
\tcp{initialisation}
\nl
$\tau_{\varepsilon} := v_0$; $h[0] = \varepsilon$\;
\nl
\lForEach {$v \in V$} {$\tau_{v} := v$}\;
\medskip

\tcp{play loop }

\For {$t = 0$ \KwTo $\omega$ } {
\nl
$k := h[t]$\;
\nl
\KwAssert ($\tau_k$ is an active thread)\;
\nl
\KwPlay action $a^i:= s^i( \tau_k )$  \tcp*[r]{$a_{t+1}^i$ \hspace*{5cm}}
\nl
\KwReceive new state $v$  \tcp*[r]{$v_{t+1}$\hspace*{5.2cm}}
\nl
update $\tau_k := \tau_k \, a^i \# v$\;
\medskip
\nl
\KwAssert (there exists an index $k' \neq k$ such that
$\tau_{k'}$ ends at state $v$)\;
\nl
set $h[t+1]$ to the least such index $k'$ \;
\medskip
\nl
\KwReceive observation $z^i \in B^i \times D^i$
\tcp*[r]{$z_{t+1}^i$\hspace*{4cm}}
\nl
\ForEach{$(b^i, d^i) \in z^i$ } {
  \nl
  $k := h[t-d^i]$\;
  \nl
  \KwAssert ($\tau_k = \rho \# v'$, for some prefix $\rho$, state
  $v'$)\;
  \nl
  update $\tau_k := \rho (b^i, d^i) v'$\;
}
}

\label{algo:frankenstein}

\end{algorithm}

\subsection{Correctness}

In the following, we argue that the procedure Frankenstein${}^i$ never violates the
assertions in Line 4, 8, and 13 while interacting with Nature in the
delayed-monitoring game~$\mathcal{G'}$, and thus implements a valid strategy for
Player~$i$.

Specifically, we show that for every history
\begin{align*}
  \pi = v_0,~a_1, (b_1, d_1), v_1,~\dots,~a_{t}, (b_{t}, d_{t}),
v_{t}
\end{align*}
in the delayed-monitoring game that follows the prescriptions
of the procedure up to period $t>0$, (1) the
scheduling function $h[t] = k$ points to an active thread~$\tau_k$
that ends at state~$v_t$, and (2) for
the state~$v_{t+1}$ reached by playing $a_{t+1} := s^i( \tau_k )$ at~$\pi$,
there exists an active thread $\tau_{k'}$ that ends at $v_{t+1}$.
We proceed by induction over the period~$t$. In the base case,
both properties hold, due to the way in which the data structure is
initialised: the (trivial) thread $\tau_\varepsilon$ is active, and
for any successor state $v_1$ reached by $a_1 := s^i(
\tau_\varepsilon)$,
there is a fresh thread $\tau_{v_1}$ that is active. For the induction
step in period $t+1$, property (1) follows from property (2) of
period~$t$.
To verify that property (2) holds, we distingiush two
cases. If $v_{t+1}$ did not occur previously in $\pi$, the initial
thread $\tau_{v_{t+1}}$ still consists of the trivial history
$v_{t+1}$, and it is thus active.
Else, let $r < t$ be the period in which $v_{t+1}$ occurred
last. Then, for $k' = h[r]$, the thread $\tau_{k'}$ ends at
$v_{t+1}$. Moreover,
by our assumption that the cycles in $G$ are longer than any
possible delay, it follows that the signals emitted in period
$r < t - m$ have been received along $\pi$ and were recorded (Line
12--14). Hence, $\tau_{k'}$ is an active thread ending at $v_{t+1}$,
as required.

To see that the assertion of Line 13 is never violated,
we note that every observation history $\beta^i(\pi)$ of the actual
play $\pi$ in $\mathcal{G'}$ up to period $t$
corresponds to a finitary shuffle of the threads $\tau$ in the $t$-th iteration
of the play loop, described by the scheduling function $h$: The
observations
$(a_r^i,(b_r, d_r)^i, v_r)$ associated to any period $r \le t$
appear at the end of $\tau_{h[r]}$, if the signal $(b_r, d_r)^i$ was
delivered until period $t$, and with the placeholder $\#$, otherwise.

In summary, it follows that
the reactive procedure Frankenstein${}^i$ never halts, and
it returns an
action for every observation $\beta^i( \pi )$ of a history
$\pi$ that follows it. Thus, the procedure defines a strategy
$f^i: V (A^iY^iV)^* \to A^i$  for Player~$i$.

\subsection{Equilibrium condition}

Finally, we show that the interplay of the strategies $f^i$ described by the
reactive procedure Frankenstein${}^i$, for each player~$i$,
constitutes an equilibrium profile for the delayed-monitoring game~$\mathcal{G'}$
yielding the same payoff as $s$ in $\mathcal{G}$.

According to our remark in the previous subsection, every transition
taken in a play $\pi$ that follows the strategy $f^i$ in $\mathcal{G'}$
is also observed in some thread history, which in turn follows $s^i$.
Along the non-terminating execution
of the reactive Frankenstein${}^i$ procedure, some threads must be scheduled
infinitely often, and thus correspond to observations of plays in the
perfect-monitoring game~$G$. We argue that the observation
by Player~$i$
of a play that follows the
strategy~$f^i$ corresponds
to a shuffle of such infinite
threads (after discarding finite prefixes).

To make this more precise, let us fix a play $\pi$ that follows $f^i$
in~$\mathcal{G'}$, and consider the infinite
scheduling sequence $h[0], h[1], \dots$ generated by the procedure.
Since there are finitely many
thread indices, some must appear infinitely often in this sequence; we
denote by $L^i \subseteq K$ the subset of these indices, and look at the
least period $\ell^i$, after which only threads in $L^i$ are
scheduled. Then, the suffix of the observation $\beta^i(\pi)$ from
period $\ell^i$ onwards can be written as a $|L^i|$-partite shuffle
of suffixes of the threads $\tau_k$ for $k \in L^i$.

By our assumption that the payoff aggregation function $u$ is
shift-invariant and submixing, it follows that the payoff $u^i( \pi )$
lies between $\min \{  u^i (\tau_k)~|~k \in L^i \}$ and $\max \{ u^i
(\tau_k) ~|~ k \in L \}$.
Now, we apply this reasoning to all players to
show that $f^i$ is an equilibrium profile with
payoff $u( s )$.

To see that the profile $f$ in the delayed-monitoring game~$\mathcal{G'}$
yields the same payoff as $s$ in the instant-monitoring
game~$\mathcal{G}$,
consider the unique play $\pi$ that
follows $f$, and construct $L^i$, for all players~$i$, as above. Then,
all threads of all players~$i$ follow~$s^i$, which by ergodicity implies,
for each infinite thread $\tau_k$ with $k \in L^i$ that $u^i( \tau_k )
= u^i( s )$. Hence $\min \{  u^i (\tau_k)~|~k \in L^i \}$ = $\max \{ u^i
(\tau_k) ~|~ k \in L \}$= $u^i( \pi )$, for each player~$i$, and therefore
$u( f ) = u( s )$.

To verify that $f$ is indeed an equilibrium profile,
consider a strategy $g^i$ for the delayed-monitoring game and look at the
unique play~$\pi$ that follows $(f^{-i}, g^i)$ in $\mathcal{G'}$.
Towards a contradiction, assume that $u^i ( \pi ) > u^i ( f )$. Since
$u^i ( \pi ) < \max \{ u^i (\tau_k) ~|~ k \in L^i \}$, there must exist
an infinite thread $\tau_k$ with index $k \in L^i$ such that
$u^i( \tau_k ) > u^i( f ) = u^i( s )$. But $\tau_k$ corresponds to the
observation $\beta^i( \rho )$ of
a play $\rho$ that follows $s^{-i}$ in $\mathcal{G}$, and since
$s$ is in equilibrium strategy we obtain $u^i( s ) \ge u^i( \rho ) =
u^i( \tau_k)$, a contradiction.

This concludes the proof of our theorem.

\subsection{Finite-state strategies}

The transfer theorem makes no assumption on the complexity of
equilibrium strategies in the instant-monitoring game at the
outset; informally, we may think of these strategies as
oracles that the Frankenstein procedure can query.
Moreover, the procedure itself runs for infinite time along the
periods the play, and the data structure it maintains grows
unboundedly.

However, if we set out with an equilibrium profile of finite-state
strategies, it is straightforward to rewrite the Frankenstein
procedure as a finite-state automaton: instead of storing the
the full histories of threads, it is sufficient to maintain the curren
state reached by the the strategy automaton for the relevant player
after reading this history, over a period that is sufficiently long to
cover all possible delays.

\begin{corollary}
Let $\mathcal{G}$ be a game with instant monitoring and
shift-invariant submixing payoffs, and let $D$ be a finite delay
space~$D$. Then, for every ergodic payoff $w$ in
$\mathcal{G}$ generated by a profile of finite-state strategies,
there exists an equilibrium of the $D$-delayed monitoring game
$\mathcal{G}'$ with the same payoff~$w$ that is also generated by a
profile of finite-state strategies.
\end{corollary}

{
\bibliographystyle{siam}

redpajama_set_name: RedPajamaArXiv


Generational viewpoints, east coast and west coast conversations, a mix of media, and a common bloodline… These are the characteristics on display in Brett, Barry and Uncle Ed, a group exhibition celebrating the influence and enduring nature of family. For most people, family is important. For cousins Brett Amory and Barry Roebuck, it's everything. So is art. The offspring of a family of artists, they really couldn't help it. Their parents, aunts, and uncles all shared a creative spirit that demanded expression. However, one relative stood out as a seminal influence for both boys, Uncle Ed. Ed Roebuck is a fine artist and longtime resident of Hampton Roads. A gifted renderer, Roebuck is best known for the 1981 defacement of his own work in protest of its seizure by a creditor. The ensuing years of notoriety earned him considerable national exposure including interviews with the national media and a one man show for the U.S. House of Representatives. For Brett and Barry, Ed's influence was a critical ingredient in their artistic development. Now, more than a decade after his last public exhibition, Ed will appear in a new show alongside his nephews, both accomplished artists in their own right, in a simple, yet compelling tribute to creative expression and the unbreakable bonds of family.


text:
Q: Fine Tuning Pretrained Model MobileNet_V2 in Pytorch I am new to pyTorch and I am trying to Create a Classifier where I have around 10 kinds of Images Folder Dataset, for this task I am using Pretrained model( MobileNet_v2 ) but the problem is I am not able to change the FC layer of it. There is not model.fc attribute.
Can anyone help me to do this.
Thanks

A: From the MobileNet V2 source code it looks like this model has a sequential model called classifier in the end. Therefore, you should be able to change the final layer of the classifier like this:
import torch.nn as nn
import torchvision.models as models
model = models.mobilenet_v2()
model.classifier[1] = nn.Linear(model.last_channel, 10)

Unfortunately, I cannot test this code right now.
This is also a good reference, on how to finetune models.

A: Do something like below:
import torch
model = torch.hub.load('pytorch/vision', 'mobilenet_v2', pretrained=True)
print(model.classifier)

model.classifier[1] = torch.nn.Linear(in_features=model.classifier[1].in_features, out_features=10)
print(model.classifier)

output:
Sequential(
  (0): Dropout(p=0.2)
  (1): Linear(in_features=1280, out_features=1000, bias=True)
)
Sequential(
  (0): Dropout(p=0.2)
  (1): Linear(in_features=1280, out_features=10, bias=True)
)

Note: you would need torch >= 1.1.0 to use torch.hub.

A: MobilenetV2 implementation asks for num_classes (default=1000) as input and provides self.classifier as an attribute which is a torch.nn.Linear layer with output dimension of num_classes. You can use this attribute for your fine-tuning. You can have a look at the code yourself for better understanding.
import torchvision.models as models
model = models.mobilnet_v2(num_classes=10)

A: By looking into the last layer in models.mobilenet_v2, you can see the following:
(classifier): Sequential(
(0): Dropout(p=0.2, inplace=False)
(1): Linear(in_features=1280, out_features=1000, bias=True)

To edit the out_features from 1000 to any number of classes num_classes:
from torchvision import models
import torch.nn as nn
model_ft = models.mobilenet_v2(pretrained=True)
num_ftrs = model_ft.classifier[1].in_features
model_ft.classifier[1] = nn.Linear(num_ftrs, num_classes)

redpajama_set_name: RedPajamaStackExchange


text:
UPDATE 1-China holds most U.S. Treasuries since October, foreigners dump stocks
* Japan's Treasury holdings hit lowest since October 2011
* U.S. bonds in Ireland rises after record drop in February
* Offshore investors bought most agencies in nearly two years
* Foreigners shed most U.S. stocks since September 2015 (Adds details on latest TIC data)
NEW YORK, May 15 (Reuters) - China's holdings of U.S. Treasuries grew for a second month in March to $1.188 trillion, its highest level since October, even as overall foreign purchases of Treasuries fell, data from the Treasury Department showed on Tuesday.
Overseas investors also grew discontent with Wall Street, reducing their U.S. stock exposure by the largest monthly clip in 2-1/2 years.
The increase in China's U.S. bond ownership may soothe concerns about whether Beijing may pare back its Treasuries stockpile in retaliation against the Trump administration which has sought to slap stiff tariffs and erect barriers against nations it perceives are conducting unfair trade practices.
Japan's holdings of Treasuries, on the other hand, fell in March to $1.044 trillion, the lowest since October 2011, data showed.
Back in March, the dollar hit a 16-month low against the yen , making it less attractive for Japanese investors to own dollar-denominated investments, analysts said.
From their peak holdings of Treasuries in November 2014, Japan has now slashed its stake by $198 billion.
Meanwhile, the amount of Treasuries held in Ireland rose in March to $317 billion after a record $13.5 billion fall in February, which stoked speculation whether U.S. multinational companies may be repatriating some money back home in the wake of the massive tax overhaul enacted by Congress in December.
Dublin is a major hub for international fund management and custody businesses, but also reflects Ireland's hosting of the European centers of U.S. technology and pharmaceutical companies.
While China's and Ireland's holdings of Treasuries increased, foreigners overall sold U.S. government securities. Their net sales totaled $4.92 billion in March, compared with $43.19 billion in net purchases in February.
Offshore investors unloaded $23.05 billion in Treasuries in March, their steepest monthly sale since December 2016, while foreign central banks added $18.39 billion in U.S. government debt on top of the $19.06 billion they purchased in February, according to the latest Treasury data.
APPETITE FOR AGENCIES, CORPORATES
Foreigners, while less keen on Treasuries, scooped up agency securities and corporate bonds in March.
Their net purchases of agencies totaled $25.28 billion, the most since July 2016, while they bought $22.39 billion in corporate debt, the highest monthly increase since November, Treasury data showed.
In contrast, overseas investors sold $24.15 billion in stocks in March, the biggest monthly outflow since September 2015.
The S&P 500 index fell 2.7 percent in March, marking its first quarterly loss since the third quarter of 2015 due to worries about a possible trade war, rising interest rates and pricey technology stocks.
Additional reporting by Dan Burns; Editing by Jonathan Oatis and James Dalgleish

redpajama_set_name: RedPajamaCommonCrawl


Haven't installed F18 yet, but I assume that the bit about selecting a user from the lock screen is to allow a second user can log in, without having to log the first user out.
Yes, but it's not actually on the lock screen. It was the lock screen crashing, and then the dm starting again on the login screen.
Aha, so it's not just me. I'll be doing Enter/Esc from now on, thanks. You're right, the first time I thought the new update handling was to blame and had logged me out.
I'm not convinced the crash happened during package installation, as I had a 40 minute lunch after starting the upgrade. So if it indeed crashed on the lock screen, the install would have been finished. Also, the rpm querying started working again when the next set of installs was finished – will post some output from that that I saved before.
The -5 for that is an educated guess about something changing in rpm's locking, but I could indeed be proven wrong about that – and I guess I'll see on the other 2 installs I do.
Good to know, thanks. I heard it was going to be, and when bottom-right-corner triggering didn't work anymore I just kept pushing down until something happened. The third time I did that it started feeling strained. I'll just let it sit there to see. Ctrl-Alt-Tab is probably going to be about as painful though! Also, I think that used to cycle backwards through Alt-Tab ? On rare occasions I used that.
I echo many of your thoughts on Anaconda, but… torrent being hard to find? I had no problems. Went to the main Fedora project page, clicked on "More Options" under Download, searched within the page for "torrents" and found the link to standard torrents. Another link on that page "See all torrents" took me to all available torrents, including the DVD.
Now that you're telling me how to get there, I can find it too, and I vaguely recall it being hard last time around too. Yeah, I guess searching for the word would have been the wise thing to do. It's still three clicks on really small links away though, but I agree torrents aren't the obvious download choice for most users, so I'll accept it.
I also use a custom partition and the whole "i don't need help" + "reclaim space" combination was not giving me much assurance on what was going to happen next. I sat on it for a bit before I decided to go forward and see what happened. They need to rewrite that button. A go to partition steps or so would have been better.
Overall, I'm digging the new installer.
Me too, it looks slick!
The update process is way too slow, it is faster to download and install a nightly build iso than to update fedora 18 fresh system with 200+ packages using yum update (download, drpm->rpm, install/update, verify). Really slow!
And talking of non-free codecs, totem, rhythmbox, etc., they prompt to install rpm but they simply don't know which rpm packages to install from rpmfusion repo (enabled); can't play mp4, mkv, mp3, etc… unless manually install gstreamer plugins (good bad ugly) along with ffmpeg gst*libav; which is a trouble for new user.
fedora 18 is more like windows vista, hopefully fedora 19 or fedora 20 will be stable like windows 7 after unkempt windows vista.
Well-hidden option seems to be stretching it a bit – there's a big header "Other Options" with "Formats: DVD ISOs, Physical Media" on it. Click that, there's your DVDs. Someone else explained about the torrents. IIRC, the download page has not changed since at least F17 and possibly F16.
That's one we've considered, but no – the key is in the question "why have date/time setting in the installer at all?", which I asked the anaconda team this cycle. The answer is that, apparently, on some systems the clock can be really _badly_ wrong – like, 1970, or some ridiculous time in the future, or something – and that can sometimes break package scripts. The point of having date/time setting in the installer at all is to make sure it's at least sane-ish before beginning package install, so it can't be done at the same time as package install.
There isn't really a need to freeze the pending updates beyond release. Really, there's some fixes in there we want to have available _immediately_. There is still a benefit to them being 0-day updates rather than in the release package set: they can't screw up a media install if they're broken, and you can roll them back / avoid them if one of them happens to be bad. Again this isn't new, we've done 0-day updates forever.
It's not 'in the name of security'. If you have a repo enabled then you are indicating you want to install stuff from that repo. Why should we assume that if one of your repos is broken, you don't mind at all not getting packages from it? What if you want the version of package foo from your broken repo, not the one from another repo that's working? yum isn't about to start trying to intuit whether a repo is 'really important' to you or not. It just figures, you enabled it, you want it.
They ported a bunch of settings from gconf to gsettings between 3.4 and 3.6, they tried to get them all to migrate but a few don't seem to make it, indeed. And yeah, the sorting defaults seem pretty off.
As others have pointed out, 'Esc' to open the unlock screen. You can use super (start) to bring up the overview to get at notification area easy. Note the change to accessing notifications was a response to user feedback: people were complaining that they were triggering the notification area accidentally too often. It's hard to please all of the people all of the time.
didn't get the date/time reasoning. To fix the clock, why does it need to ask me about what timezone I'm in ? It could just reach out and get an ntp date and see if it's insanely off, no ?
As to the updates, I get the rationale for not putting all these tested updates on the release DVD, completely. I disagree with the fact that as soon as the release is out, the floodgates open and all these things pour through. I think there should be a slight window where updates are blocked to be really essential instead of everyone who's woken up to test and update their packages pushing them through. So much more concerted effort went into testing the actual release than in the updates, that it would make sense to let people use what was actually released and see what the shakeout of bugs from that is. But that's just me.
For yum, 'security' is what the argument has been in the past. None of your arguments are incompatible with the obvious solution of updating what is available. You can still make me mind that my repository is broken by telling me so. If I want the version from the broken repo, I'll be fine when it gets updated when the repo works again. Why not keep going with what's possible ? Why is it a good idea to make sure no security updates get installed from Fedora repo's until the configuration is fixed somehow ? Why default to copping out ?
I've stuck with Evolution for a really long time, but I feel it's slowly degrading. The huge horrible error messages in the top section, the problems logging in to address books that worked fine before, the amount of unkillable (even with evolution –force-shutdown) runs, … Evolution has gone through a bunch of "Let's move our settings or our files or folders and change the db type" in the last few years, and the migration has never been flawless. I think messing up migrating data and config is a bad mistake. I want to believe Evolution is going to get back on track though.
I definitely understand triggering the notification area is hard to get right. I'm not sure this one is it – I guess I was led to believe I had to pressure into it because, with the little thinkpad nub, unless I actually push it in a certain direction it doesn't necessarily stay exactly on the bottom pixel line. To be honest, I don't understand why it didn't go for a mirror effect to show that the bottom right corner would trigger the notification area – it's being done for the top left corner already, so it seemed obvious to me?
I think the point was that unrelated repo breaks -> no security updates.
My experience with 3rd-party repositories in Debian is that they are somewhat flaky. I think the default in Debian is just to ignore broken repositories. So in theory you could have the problem you mention that you overwrite a package, but I think in practice version numbers prevent that from being a real problem. Sometimes practice beats theory.
Don't forget that you (most likely) have modifier keys on both hand sides, so for example right-Ctrl+left-Alt+Tab isn't that hard to press. But Super+M is probably easiest, and close it with Esc (I think Super+M is a toggle in 3.8, but sadly not in 3.6).
Regarding the RPM Fusion GPG key, perhaps you were following the historical RPM Fusion process that involved installing the "-stable" versions of the release packages? If you do that, you'll get an old one dating back to F-16, which expects to find an arch-specific GPG key file for the current Fedora release, but of course doesn't include one for Fedora 18. That's what happened to me anyway.
The current configuration instructions on the RPM Fusion wiki say to install rpmfusion-*-release-18 packages; these work OK for me and come with the correct keys.
That's definitely possible, as I copy and paste my upgrade instructions from a file I update with each release. Hm, wouldn't that mean that the upgrade path for that is broken too though ?
Doesn't work if you have no network connection. Might be an interesting refinement if you do, but I think the feeling was 'well if we have to have it in there for some cases, let's just have it be a proper time setting thingy'. I can see your point, though.


You deserve happiness, love, joy and ease.
Remember this and find ways and opportunities to smile, laugh and celebrate.
The most elegant and beautiful thing about humanity is the ability to take a really hard situation, to feel the heartache and pain and to keep going... it is stunningly beautiful.
May you fall apart and re-build yourself anew.


Land of Talk at the Imperial Theatre, Vancouver, June 26 2017. Jessica Vandergulik photo.
Land of Talk at the Imperial, as part of the 2017 Vancouver International Jazz Festival.
Singer/guitarist Elizabeth Powell formed the band with Chris McCarron and Mark Wheaton after meeting them in the jazz program at Concordia University. The trio released an EP, Applause Cheer Boo Hiss, in 2006. The following year, Eric Thibodeau replaced Wheaton on drums. The new lineup released a full-length, Some Are Lakes, in 2008. They followed up with an EP, then in 2010 a second full-length Cloak and Cipher.
The third Land of Talk album, Life After Youth, appeared earlier this year.
According to cbc.ca, "In recent years, a number of personal obstacles—ranging from parting with bandmembers to losing music on her hard drive, to the ill health of her father—have either prevented a return or understandably taken precedence in Powell's life." According to cultmontreal.com, Powell returned to her hometown of Orillia, Ontario, where she painted and worked in a bakery.
This entry was posted in concert photos, Concerts 2017, Homepage Features and tagged Canadian music, Imperial Theatre, Land of Talk, Montreal bands, Vancouver concert photography, Vancouver concert photos, Vancouver concerts. Bookmark the permalink.


text:
Showing posts with label Transportation. Show all posts
Malaysia Transportation
Malaysia is served by an excellent transport system. Once you are in the country there is always transport available to you to even remote areas. Traveling by road in peninsula Malaysia is popular as it has well- developed network of roads. Once you are in the country there is always transport available to you to even remote areas. There are various options available as to how you might wish to get to a destination. Generally it depends convenience and affordability and what' s the best way to see the sights as you travel. In Sabah and Sarawak, traveling by four-wheel drive is recommended on unpaved roads, and many remote areas can only be reached by air or river-boats. Traveling by rail is also highly recommended as you get to see the countryside. Naturally the main transportation hub is from its capital, Kuala Lumpur
Driving is an interesting mode of seeing the country. An overland journey to Malaysia Thailand and Singapore be made easily driving through the North-South Expressway on the West coast and East-West highway to the East Coast. Car rental services are easily available. Buses, taxis and coaches, both interstate and local ply between various destinations. To drive on Malaysian road, you require a Malaysian Competent Driviong Licence, Probationary Driving Licence or an International driving Licence. To use a foreign licence, get it endorsed by the Road Transport Department. All vehicles move on the left-hand side of the road and that the use of safety belts by front pasengers is mandatory. Buses are an inexpensive way to travel in Malaysia. Most, if not all buses in Kuala Lumpur (KL) are air-conditioned but there are still non-air-conditioned buses in smaller towns around the country. Buses plying routes within towns and cities typically charge fares according to the distance covered while interstate buses have fixed rates.
Taxis in major cities are usually fitted with meters. In KL, the rate is currently RM2 for the first two kilometres and 10 sen for every subsequent 200 metres. However, a surcharge of 50% will be levied between midnight and 6am. Interstate and smaller town taxis charge a fixed rate and it's best to settle on a price before getting into the taxi.
Getting to Malaysia is easy with over 40 airlines, including Malaysia's own carrier, Malaysia Airlines. All flights arrive and depart at the new state-of-the-art Kuala Lumpur International Airport (KLIA) located at Sepang, about 50 km or an hour's drive south of Kuala Lumpur, the country's capital. From KLIA, visitors can take connecting flights to most major cities and towns in Malaysia as well as to Sabah and Sarawak. The airport is well equipped with the latest facilities and services to cater passengers either arriving into the country or on a transit to other destinations. Meanwhile, the old international airport, the Sultan Abdul Aziz Shah Airport in Subang, about 45 minutes by road west of Kuala Lumpur, caters only domestic air services.
The national carrier, Malaysia Airlines (MAS), currently flies to more than a hundred destinations worldwide. There is also a small but growing number of domestic airlines serving popular tourist destinations such as Kuala Lumpur, Kuala Terengganu, Pulau Tioman, Pulau Perhentian, Pulau Pangkor, Taman Negara, Kuantan, Ipoh, Penang, Malacca and Langkawi. These airlines are Air Asia, Transmile Air and Berjaya Air. Malaysia has six international airports are at Sepang in Selangor, Penang Island, Langkawi Island, Kota Kinabalu and Tawau in sabah, and Kuching in Sarawak.Malaysia is served by more than 35 airlines including Malaysia Airlines which services 94 international routes around the globe. in addition to Malaysia Airlines (MAS), a number of other airlines including Pelangi Air, Berjaya air and Mofaz Air also provide regular domestic flights to the many tourists destinations and cities within the country.
Please Check for more information:
Malaysia Airline System (MAS)
It is possible to travel by rail within and to Peninsular Malaysia via Thailand and from Singapore. Malayan Railways or Keretapi Tanah Melayu Berhad (KTM) connects all major towns in the Peninsular. First, Second or Economy Class air-conditioned coaches are available.
The northbound Ekspres Langkawi departs nightly from Kuala Lumpur to Arau in Kedah. Arriving in the morning, it then proceeds to Hatyai, Thailand before returning back to Arau in the evening. Senandung Malam is a KL-Butterworth-KL and KL-Singapore-KL sectional nightly service. Sleeping berths are provided in the first and second class coaches. All express services have a restaurant coach serving local and continental cuisine. Tickets may be purchased 60 days in advance from the date of travel. Children aged from four to twelve are charged half the adult fare whilst those below four travel free. Available to foreign tourists is the 30-day or 10-day Tourist Railpass which provides unlimited travel on KTM during that period.
There are several ports of entry in Malaysia, namely Penang, Port Klang, Kuantan, Kuching and Kota Kinabalu. Coastal ferries sail frequently between Penang and Butterworth, carrying both passengers as well as vehicles from the mainland to the island. Apart from that, there are many ferry/ boat services available for mainland-to-island and island-to-island travel around the country. Fast boats and small river crafts are a popular way of getting about in Sabah and Sarawak especially to the more isolated settlements.
There are also sea cruises and river-cruises run by local tour agents. For sea travel within the country there are services available from Port Klang (Selangor) to Kuantan (Pahang) and to Sabah or Sarawak. Besides that, there are also holiday cruises that take passengers to neighbouring countries.


Breakthrough technology which reduces grey a little bit with each shampoo for subtle gradual results. Use daily until you like what you see, then regularly to maintain the look you like.
Breakthrough technology which reduces grey a little bit with each shampoo for subtle gradual results. Use daily until you like what you see, then regularly to maintain the look you like. It never gets rid of 100% of your grey, so the look is always natural. It's a shampoo and conditioner that gently and thoroughly cleans and conditions in one step to leave hair soft and manageable. Best for all shades from light brown to black hair. Results may vary on naturally blonde and red hair. Not suitable for hair that has been lightened, bleached, highlighted or coloured.
Aqua, Disodium Lauryl Sulfosuccinate, Decyl Glucoside, Cetearyl Alcohol, Glycol Stearate, Ethanolamine, Cocamidopropyl Hydroxysultaine, Guar Hydroxypropyltrimonium Chloride, Dimethicone, Sodium Cocoyl Isethionate, N,N-Bis (2-Hydroxyethyl)-p-Phenylenediamine Sulfate, Acetic Acid, Aloe Barbadensis Leaf Juice,Chamomilla Recutita (Matricaria) Flower Extract, 1,2,4-Trihydroxybenzene, Cetearyl Glucoside, Erythorbic Acid, Sodium Sulfite, Phenoxyethanol, Caprylyl Glycol, Stearamide AMP, Panthenol, Manganese Sulfate, p-Aminophenol, Laureth-4, Laureth-23, Sorbic Acid, Etidronic Acid, Parfum, Limonene, Linalol.
You must perform the 48-hour Skin Allergy Test before use, and whenever you have not used this shampoo for 2 consecutive weeks or more. Peel off freshness tab under the cap. Do not leave tube open between uses. Massage into wet hair and leave on for about one minute. Use the palms of your hands, not your fingers, to avoid nail staining. Rinse hair thoroughly. IMPORTANT: Rinse off any shampoo that has dripped or splattered in the shower. Failure to do so can result in staining. Wash your hands thoroughly with soap and dry hair with an old or dark towel.
Hair colourants can cause severe allergic reactions. Before using this product, you must perform a preliminary 48-hour skin allergy test according to accompanying directions. this product is not intended for use by persons under the age of 16. Temporary "black henna" tattoos may increase your risk of allergy. Do not use this product if: You have already experienced any reaction to this or any other hair colour product. You have a rash on your face, or an irritated, sensitive or damaged scalp. You have experienced a reaction to a temporary "black henna" tattoo in the past. Remember to perform the 48-hour skin allergy test before each use even if you have previously used this or other hair colouring products, for this reason, buy this product two days before you intend to use it.


I came across the inspiration for this Apple Spice Cake with Sea Salt Caramel Glaze like many other recipes…on Pinterest. It sounded like the perfect Fall cake. I wanted to do one as a test, and then the second would be made for my mom's birthday in my new Crown Bundt pan.
I have no shortage of taste testers in my community, most of them being our kids' sports families. So, I fired up the regular bundt pan and made the first version of the cake.


text:
The Gateway Arch
St. Louis, MO 63102, USA
›Missouri›St Louis›Entertainment›The Gateway Arch
The Gateway ArchSt Louis, MissouriNot many people think about looking East from the arch, after all it is the gateway to the West. But east it is a great plain and river. This was... The Gateway ArchSt Louis, MissouriThe Iconic Gateway Arch in St Louis. Taken from across the Mississippi river The Gateway ArchSt Louis, MissouriGateway Arch National Park, St. Louis, MO. Two stitch panorama at f/11, 30 seconds, ISO 100, 24mm. The Gateway ArchSt Louis, MissouriView of the Old Courthouse and the Gateway Arch in St Louis, MO. For you history buffs, the old courthouse is the site of he Dred Scott case,... The Gateway ArchSt Louis, MissouriThe surrounding park is worth soaking in the sun The Gateway ArchSt Louis, MissouriThe Gateway Arch is a fascinating place, not just because of the architecture itself, but because of what it symbolizes: the Luisiana purchase, and... The Gateway ArchSt Louis, MissouriView from the Metro station... The Gateway ArchSt Louis, MissouriThis landmark of the cityscape of St Louis is even more impressive after a visit to the visitor center, where you can watch a video that shows you... The Gateway ArchSt Louis, MissouriBirthday trip visiting all the cool spots St. Louis has to offer. The Gateway ArchSt Louis, MissouriIf you are in St. Louis you have to take the time to get down and see The Arch. You will be in aww from the size of The Arch. The park surrounding... The Gateway ArchSt Louis, MissouriArch in St. Louis #architecture The Gateway ArchSt Louis, MissouriTraveling through. Gorgeous day. The Gateway ArchSt Louis, MissouriVisiting the Arch is mandatory in my opinion. The museum offers information on Westward Expansion, and how the Arch was built. Riding to the top is... The Gateway ArchSt Louis, MissouriKomo made it all the way to the top The Gateway ArchSt Louis, MissouriJust a short four min trip to the top and you can see for miles on a clear day. #gatewayarch, #stlouis,#exploresomethingcool The Gateway ArchSt Louis, MissouriI have been up in the St Louis Arch twice now. It is still thrilling. Tried to focus on just the base this time. The Gateway ArchSt Louis, MissouriA really beautiful, blue-sky day. I love the way the blue in the sky reflected off the Arch. #StunningStructures The Gateway ArchSt Louis, MissouriThe Gateway Arch in St. Louis, MO- Taking the tour to the top of the arch provides a unique vantage point of the city. #BVSBlue The Gateway ArchSt Louis, MissouriI grew up around St Louis and have always enjoyed the Arch, but never appreciated its architecture until now #bvsblue The Gateway ArchSt Louis, MissouriThe Gateway Arch, or the St. Luis arch to the West. Part of the Jefferson National Memorial. The observation deck is 630 feet up and is the tallest...


text:
Research ArticleCancer
Targeting aPKC disables oncogenic signaling by both the EGFR and the proinflammatory cytokine TNFα in glioblastoma
Yael Kusne1,2,*,
Eugenio A. Carrera-Silva3,*,
Anthony S. Perry4,
Elisabeth J. Rushing5,†,
Edward K. Mandell6,
Justin D. Dietrich7,‡,
Andrea E. Errasti3,
Daniel Gibbs8,
Michael E. Berens9,
Joseph C. Loftus10,
Christopher Hulme7,
Weiwei Yang11,
Zhimin Lu11,
Kenneth Aldape11,
Nader Sanai1,2,
Carla V. Rothlin3,§, and
Sourav Ghosh1,2,6,9,§
1Neuroscience Graduate Program, Arizona State University, Phoenix, AZ 85287, USA.
2Barrow Brain Tumor Research Center, Barrow Neurological Institute, Phoenix, AZ 85013, USA.
3Department of Immunobiology, Yale University School of Medicine, New Haven, CT 06520, USA.
4Department of Pathology, Banner MD Anderson Cancer Center, Gilbert, AZ 85234, USA.
5Armed Forces Institute of Pathology, Washington, DC 20306–0003, USA.
6Department of Neurology, Yale University School of Medicine, New Haven, CT 06511, USA.
7Bio5OV, The University of Arizona, Oro Valley, AZ 85737, USA.
8Department of Neurosciences, University of California, San Diego, San Diego, CA 92093, USA.
9Translational Genomics Research Institute (TGen), Phoenix, AZ 85004, USA.
10Mayo Clinic Arizona, Scottsdale, AZ 85259, USA.
11MD Anderson Cancer Center, Houston, TX 77030, USA.
↵§Corresponding author. E-mail: carla.rothlin{at}yale.edu (C.V.R.); sourav.ghosh{at}yale.edu (S.G.)
↵* These authors contributed equally to this work.
↵† Present address: University Hospital Zurich, 8091 Zurich, Switzerland.
↵‡ Present address: AbbVie, North Chicago, IL 60064, USA.
Vol. 7, Issue 338, pp. ra75
DOI: 10.1126/scisignal.2005196
Yael Kusne
Neuroscience Graduate Program, Arizona State University, Phoenix, AZ 85287, USA.Barrow Brain Tumor Research Center, Barrow Neurological Institute, Phoenix, AZ 85013, USA.
Eugenio A. Carrera-Silva
Department of Immunobiology, Yale University School of Medicine, New Haven, CT 06520, USA.
Anthony S. Perry
Department of Pathology, Banner MD Anderson Cancer Center, Gilbert, AZ 85234, USA.
Elisabeth J. Rushing
Armed Forces Institute of Pathology, Washington, DC 20306–0003, USA.
Edward K. Mandell
Department of Neurology, Yale University School of Medicine, New Haven, CT 06511, USA.
Justin D. Dietrich
Bio5OV, The University of Arizona, Oro Valley, AZ 85737, USA.
Andrea E. Errasti
Daniel Gibbs
Department of Neurosciences, University of California, San Diego, San Diego, CA 92093, USA.
Michael E. Berens
Translational Genomics Research Institute (TGen), Phoenix, AZ 85004, USA.
Joseph C. Loftus
Mayo Clinic Arizona, Scottsdale, AZ 85259, USA.
Christopher Hulme
Weiwei Yang
MD Anderson Cancer Center, Houston, TX 77030, USA.
Zhimin Lu
Kenneth Aldape
Nader Sanai
Carla V. Rothlin
For correspondence: carla.rothlin@yale.edu sourav.ghosh@yale.edu
Sourav Ghosh
Neuroscience Graduate Program, Arizona State University, Phoenix, AZ 85287, USA.Barrow Brain Tumor Research Center, Barrow Neurological Institute, Phoenix, AZ 85013, USA.Department of Neurology, Yale University School of Medicine, New Haven, CT 06511, USA.Translational Genomics Research Institute (TGen), Phoenix, AZ 85004, USA.
vol. 7 no. 338 ra75
https://doi.org/10.1126/scisignal.2005196
PubMed:
Print ISSN:
Online ISSN:
Accepted July 23, 2014
Copyright & Usage:
Copyright © 2014, American Association for the Advancement of Science
Article lifetime
Article usage: August 2014 to July 2019
Aug 2014 4959 269 418
Oct 2014 285 61 74
Nov 2014 146 45 34
Dec 2014 96 32 30
Jan 2015 94 35 32
Feb 2015 66 24 10
Mar 2015 70 18 19
Apr 2015 72 18 22
May 2015 48 32 21
Jun 2015 171 52 48
Sep 2015 25 15 20
Oct 2015 20 6 13
Nov 2015 3 3 13
Feb 2016 77 14 8
Mar 2016 82 9 15
Apr 2016 64 16 7
Nov 2016 100 6 7
Apr 2017 65 4 12
Nov 2018 34 16 3
Dec 2018 27 10 4
Mar 2019 41 10 3
Jun 2019 24 10 4
You are going to email the following Targeting aPKC disables oncogenic signaling by both the EGFR and the proinflammatory cytokine TNFα in glioblastoma
By Yael Kusne, Eugenio A. Carrera-Silva, Anthony S. Perry, Elisabeth J. Rushing, Edward K. Mandell, Justin D. Dietrich, Andrea E. Errasti, Daniel Gibbs, Michael E. Berens, Joseph C. Loftus, Christopher Hulme, Weiwei Yang, Zhimin Lu, Kenneth Aldape, Nader Sanai, Carla V. Rothlin, Sourav Ghosh
Science Signaling 12 Aug 2014 : ra75
Targeting a kinase common to both the EGFR and TNFα signaling pathways may prevent drug resistance in glioblastoma.


text:
The Office: remastered
Weird shrunken pepper-heads wreak havoc at MIWSFPA
The Budget has balanced itself
April 3, 2018 Dylan Bye Satire, Special Issues No comments
*Disclaimer: This article is from The Brock Press' 2018 satire publication, which followed the theme of 'fake news' meant to bring humour to our readers. All quotes are attributed to made up characters.
Justin Trudeau was once bullied for the claim he made back in 2014 that "the budget will balance itself". That statement now seems prophetic, however, as the budget has recently become sentient. "The Budget", the newly minted self-aware estimate of income and expenditure for a set period of time, has been deliberating with Trudeau. In the meantime, Trudeau has commissioned famous songwriter Geddy Lee to draft "The Book of Justin" a new amendment to many previous religious texts.
These are strange times for the Federal Government as overnight, it seems the voting population has turned from "who is the best candidate" to, "which candidate is the most likely to know whether or not a sentient budget can, or would, balance itself." When asked for what reason The Budget has only just started balancing itself, it gave a colloquial shrug, grin and smirk before responding "no one else had ever asked me to balance myself". He went on to explain that perhaps Canadians should have more faith in extrapolated mathematical and financial concepts.
Perhaps The Budget is right. The Budget has also insisted in a press release that it be referred to as 'The Budget', capitalized to separate itself from the non-sentient budgets. But, at this point how many mathematical concepts are sentient and simply waiting are anyone's guess. It does beg the question, what are they waiting for, and are they planning something? If so, what are they planning, and when? But frankly Scientists everywhere are hanging up their lab coats and collectively reporting: "I honestly have no idea how that is possible." Others wondering if any of their theories are also sentient. When asked, The Budget merely responded with a disappointed glance and the phrase: "duh."
'The Book of Justin' is expected to sell as many copies as they make, primarily due to curiosity but other reported aspects were clues to becoming a prophet and genuine disbelief that something like a budget can become sentient. This is the most outlandish news that we've reported on in sometime, what's next? Was Alex Jones right about the U.S. government making 'the fricken [sic] frogs gay with gay bombs baby," because frankly, that sounds ridiculous (more on pg. 7).
Moving forward, we will be looking into whether or not the Canadian government will consider all mathematical concepts sentient by nature, or rather wait for them to out themselves as sentient. University students across the country have reportedly been asking their student debt to balance itself as well, and should any of those debts take action and oust itself as being sentient, The Brock Press will be there to report it.
Truly, we are living in unbelievable times.
In celebrity news, The Budget a newly minted 'person' will be starring in ABC's the Bachelor, with many potential contestants citing its 'balance' as its most attractive quality. Trudeau is expected to host the season in a series first, as The Budget claimed that should he find true love, he would want Trudeau, the only man to ask him to balance himself, to officiate the wedding.
2018satireThe Brock Press
About Dylan Bye
View all posts by Dylan Bye →
U Sports to be featured in inaugural CEB...
The Toolbox Project hammers home success...
2018 in television: comedy gets serious...
Editorial: Want to get involved with The...


BCAW 2016 continues, and today's blog concerns a long-running and very important story that has been going on for nearly a year now. It was announced today that the President of Mitsubishi Motors, Tetsuro Aikawa, will stand down following the revelation last month that the company had been falsifying fuel emission tests for decades. The scale of the crisis for Mitsubishi can be seen in the fall in its share price by more than 50%, leading to rival Nissan securing a controlling stake in the company. Meanwhile Suzuki has admitted that "discrepancies" have been found in its fuel and emissions testing but denies cheating, asserting that "Any wrongdoing, such as manipulation of fuel efficiency data, were not found".
These are of course only the latest two companies to be dragged into the controversy: Nissan has been accused of irregularities (which it denies) around testing of the Qashqai model; Daimler is investigating its diesel emission testing results at the request of the US Justice Department; and both Renault and Peugeot have been raided by the French authorities. Returning to VW, where the scandal all began last September, the company announced yesterday that it was increasing its provisions for the diesel emissions scandal to £12.6b; more than double its initial estimate last year. This figure includes the cost of recalling 630 000 diesel vehicles to tweak engine software, the cost of buying back vehicles and legal costs.


Written by Ruxandra Cracea on 30 November 2016 .
Brussels, 30 November 2016: The Concrete Initiative welcomes the initiatives on buildings which the European Commission has outlined under its "Clean Energy for All Europeans" package, in terms of the important role which they will play to achieve the EU's 2030 energy and climate goals. The package, published today, contains important items relating to buildings, including proposed revisions of the Directives on Energy Performance of Buildings (EPBD), Energy Efficiency (EED) and Renewable Energy, and a new "Smart Finance for Smart Buildings" initiative.
Written by Ruxandra Cracea on 28 October 2016 .
Brussels, 28 October 2016: A new study by 3E has demonstrated the huge potential of buildings' thermal mass to maximise the use of renewable energy. This can result in up to a 25% CO2 reduction per dwelling, up to 50% reduction in the need for peak electricity supply capacity and savings of up to €300 per household per year.
Written by Jessica Johnson on 18 November 2015 .
Written by Jessica Johnson on 02 July 2014 .
Brussels, 2 July 2014: The Concrete Initiative welcomes the proposals put forward yesterday by the European Commission on resource efficiency opportunities in the building sector (COM(2014) 445). In order to achieve its purpose, it is important that the approach taken covers the impacts of the construction works during its whole life cycle. When only partial aspects are covered, their impacts should be assessed with the whole picture in mind in order to avoid transfer of burdens and sub-optimisation.
Written by Jessica Johnson on 27 May 2014 .
Brussels, 27 May 2014: Today, the European concrete sector gathered in Brussels to launch The Concrete Initiative. Bringing together key stakeholders at EU level, the launch centered around a high level debate on sustainable construction.