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

Traffic forecasting is a crucial task for Intelligent Transportation Systems(ITS) \cite{tasci2018survey}.
Improving these forecasting systems is important for a wide range of applications,
such as autonomous vehicles operations, route optimization, and transportation system management. In this work, we focus on the \textit{traffic speed forecasting}, which predicts the future traffic speeds for each segment of road using historical speed data. Accurate traffic speed forecasting can help prevent traffic congestion, shorten travel time, and reduce carbon emissions.

For a better prediction, recent deep learning studies have started to utilize not only the historical speed data but also the spatial information of the road networks.
To manipulate spatial information into a format which can be used for deep networks like image-based CNNs,
\cite{ma2017image,polson2017deep} simply unfold the road network and
\cite{yu2017sensors} uses a grid-based representation resulting in map-like images.
However, these image-like representations cannot fully capture the complex spatial relationships of traffic networks, such as driving directions and on-path proximity.
To better understand the non-grid spatial characteristics of the traffic networks, recent works have started to employ the \textit{graph convolutional networks}(GCNs).

While most of the previous works are limited by using Euclidean distance as the only graph element for GCNs \cite{yu2017stgcn,yu2019stunet,chen2019gated}, some studies expand GCNs to include non-Euclidean dependencies. \cite{li2017dcrnn,cui2018reachability} modified distance graph with non-Euclidean relationships, such as flow direction and reachability.
For bike demand forecasting, \cite{chai2018bike,geng2019stmgcn,geng2019multi} implemented multi-graph convolution based on the three types of graph elements, such as transportation connectivity and functional similarity, in addition to the distance. To adapt multi-graph convolution to traffic forecasting, we first need to understand which non-Euclidean dependencies are important for traffic networks.

\begin{figure}[ht!]
\centering
    \vspace{-0.1cm}
    \includegraphics[width=0.32\textwidth]{figures/intro.png}
    \vspace{-0.1cm}
    \caption{\small{An example of the importance of non-Euclidean and directional characteristics of traffic networks.
    Target link is colored in red.
    }}
    \label{fig:motivation}
    \vspace{-0.2cm}
\end{figure}

Figure \ref{fig:motivation} shows a simple example.
Here we want to figure out how the speed pattern of the target link(colored in red) is related to the other four links, $A$, $B$, $C$, and $D$.
If we consider the \textit{distance} only, the directly neighbored links $A$ and $B$ might be the most related links to the target. However, due to the different \textit{driving direction}, $A$ might show quite a different speed pattern.
Compared to $A$, $C$ could have a more consistent speed pattern with the target, because $C$ shares the target's direction.
Additionally, $D$ could also share a similar speed pattern with the target because they are heading to the \textit{same area}. These properties might be more pronounced during commute hours.

In order to utilize these concepts, we define two types of spatial dependencies in our work in addition to \textit{distance}:
\textit{direction} and \textit{positional relationship}.
Then, we propose a new type of traffic prediction network called DDP-GCN (Distance, Direction, and Positional relationship Graph Convolutional Network).
In DDP-GCN, the non-Euclidean characteristics of direction and positional relationship of the complex road networks are described through \textit{multi-graphs}. In previous studies \cite{chai2018bike,geng2019stmgcn,geng2019multi}, multi-graph convolution has been defined using undirected graphs consisting of links without direction information for the bike demand prediction task. However, the same approach cannot be directly applied to traffic forecasting on the directed graphs, especially consisting of links with \textit{direction} information.
In this work, we define multi-graphs based on link vectors and link directions and suggest the partition filters to generate hybrid graphs that incorporate two different graph information.
When evaluated on two large-scale real-world datasets that are highly complex urban networks, DDP-GCN easily outperformed the state-of-the-art baselines.

Our main contributions are in two-folds.

\begin{itemize}
    \item We identify non-Euclidean spatial relationships, \textit{direction} and \textit{positional relationship}, and propose to encode them using multiple graphs. We also suggest the partition filters that can incorporate multi-graphs into a single hybrid graph.
    To our best knowledge, this is the first time multi-graphs are defined for the use in traffic speed forecasting.

    \item We propose a traffic forecasting network(DDP-GCN) which exploits the desired spatial dependencies effectively.
    This model is especially beneficial for long-term forecasting in a highly complex urban network, known as the most challenging problem.

\end{itemize}
\section{Related Works}
\label{sec:related_work}

\subsection{Graph Convolution}
Graph convolutional networks(GCNs) were first introduced in \cite{bruna2013spectral},
which bridges the spectral graph theory and deep neural networks.
\cite{defferrard2016} proposed ChebNet, which improves GCNs with fast localized convolution filters using Chebyshev polynomials.
ChebNet implicitly avoids the computation of the graph Fourier basis,
and it greatly reduces the computational complexity.
In addition, filters of Chebyshev polynomials are guaranteed to be localized in space.
\cite{kipf2016semi} introduced 1stChebNet, as an extension of ChebNet.
They not only showed the competitive performance for a variety of tasks
but also greatly reduced the computational cost by avoiding the eigenvalue decomposition
that was needed for finding the Fourier basis.

\subsection{Traffic Forecasting with GCNs}
As GCNs heavily depend on the Laplacian matrix of a graph, it is crucial to determine a proper edge weighting that reflects network geometry sufficiently well.
For traffic forecasting,
most studies define the connectivities as whether two nodes are directly adjacent,
and the edge weights are set inversely proportional to
the physical distance or the travel time between nodes in the network \cite{yu2017stgcn,wang2019,yu2019stunet}.
Some of the recent studies have started to
manipulate additional factors other than the distance in the road networks.
\cite{li2017dcrnn,cui2018reachability} modified distance graph with additional relationships, such as flow direction and reachability.
For the case of bike demand forecasting,
\cite{chai2018bike,geng2019stmgcn,geng2019multi} considered three types of graph elements, such as transportation connectivity and functional similarity,
and they implemented a multi-graph convolution as the sum of the individual operations.
In this work, we define two types of non-Euclidean graph elements. Then, we suggest a partition filter to modify graph elements and perform the multi-graph convolution in several ways, in addition to how it was performed in previous studies.

\section{Definitions and Problem Formulation}
\label{sec:definitions}

In this section, we define the key concepts for modeling road traffics and formulate the problem.
Using the link concept from \cite{seo2017traffic}, we newly define link vector and link direction as below.
In general, a \textit{link} represents a road segment without an internal merge/diverge section, as shown in Figure \ref{fig:link}(a).

\begin{figure}[h!]
\centering
    \vspace{-0.2cm}
    \includegraphics[width=0.33\textwidth]{figures/link-definition.png}
    \vspace{-0.4cm}
    \caption{\small{Defining links (a) Examples of four links shown in four different colors. (b) A link vector $R_i$, that represents a vector starting at $R_i^{start}$ and ending at $R_i^{end}$ in 2-D space, and its link direction $\angle{R_i}$.}}
    \label{fig:link}
    \vspace{-0.2cm}
\end{figure}

\textbf{Definition 1}:
\textit{
The \textbf{link vector} $R_i$ of a link $i$ is defined as the difference between the end point
$R_i^{end}$ and the start point $R_i^{start}$, and can be formulated as
\begin{equation}
    R_i = R_i^{end} - R_i^{start}
    \label{def:linkvector}
\end{equation}
where $R_i, R_i^{start}, R_i^{end} \in \mathbb{R}^2$. For link vector $R_i$, its \textbf{link direction} $\angle{R_i}$ is defined as
\begin{equation}
    \angle{R_i}=\arccos
    \left (
    \frac{R_i \cdot e_x}{\left \| {R_i} \right \|_2}
    \right )
    +
    \left ( \frac{\text{sign}\left ( R_i \cdot e_y \right )+1}{2} \right ) \pi,
    \label{def:direction}
\end{equation}
where $e_x$ and $e_y$ are the unit vectors in the direction of the x-axis and y-axis, respectively.
}

Note that $\angle{R_i}$'s value could be between 0 and $2\pi$. An illustration of a link vector and link direction are shown in Figure \ref{fig:link}(b).

\textbf{Definition 2}:
\textit{
A \textbf{traffic network graph} is a weighted directed graph $\mathcal{G}=\{V,E,W\}$ representing a road network, where
$V$ is the set of road links with $|V|=N$,
$E$ is the set of edges representing the connectedness among the road links, and
$W \in \mathbb{R}^{N\times N}$ is a weighted adjacency matrix representing spatial inter-dependencies.
}

Usually, the weighted adjacency matrix has $W(i,j)=0$ when the road links $i$ and $j$ are not connected. However, we will define new adjacency matrices later, where this property does not necessarily hold. It is also noted that $E$ is not used in our work because the connectedness is fully described by $W$. Finally, we formulate the problem as below.

\textbf{Problem}:
\textit{
    If a graph signal $X \in \mathbb{R}^{N\times 1}$ represents the traffic speed observed on
    $\mathcal{G}$,
    and $X^{(t)}$ represents the graph signal observed at $t$-th time interval,
    the traffic forecasting problem aims to learn a function $g(.)$ that
    maps the $T'$ historical graph signals to
    the $T$ future graph signals. For a given graph $\mathcal{G}$,
    \begin{equation}
        \left [ X^{(t-T'+1)}, ..., X^{(t)}\right ] \overset{g(.)} {\longrightarrow} \left [ X^{(t+1)}, ..., X^{(t+T)} \right ].
    \label{def:problem}
    \end{equation}
}

In general, $X$ can be of size $\mathbb{R}^{N\times P}$, where $P$ is the number of observed features for each link.
Even though our dataset includes only the speed feature, i.e. $P=1$, all of our results are directly applicable to the problems with $P>1$.
\section{Proposed Model}
\label{sec:methodology}

Before explaining our methods, we briefly summarize the general graph convolution based on the approximation of 1stChebNet\cite{kipf2016semi} for a single directed graph $\mathcal{G}$.
For a directed graph $\mathcal{G}=\{V,E,W\}$,
1stChebNet generalizes the definition of a graph convolution as
\begin{equation}
    \theta \ast x \approx \theta \left ( I_N + D^{-1}W \right ) x,
    \label{def:gc}
\end{equation}
where the signal $x \in \mathbb{R}^N$, a scalar for every node,
the learnable parameters $\theta \in \mathbb{R}^N$,
and the diagonal degree matrix $D \in \mathbb{R}^{N \times N}$ with $D_{ii}=\sum_j {W}_{ij}$.\footnote{
For a concise explanation,
we will refer to graph convolution as defined above,
however, it also can also be generalized to multi-dimensional tensors \cite{kipf2016semi,yu2017stgcn}.}

\subsection{Framework Overview}

\begin{figure}[ht!]
    \centering
    \includegraphics[width=0.47\textwidth]{figures/model-description.png}
    \vspace{-0.3cm}
    \caption{\small{Model description. Each box represents a single operation. $\phi$ refers to the nonlinear activation function(ReLU) and LN refers to the layer normalization\protect\cite{layernorm}. (a) The framework of DDP-GCN consists of two spatio-temporal convolutional blocks(ST-convolution blocks), and a simple 1x1 convolutional layer. (b) Each ST-convolutional block contains a spatial block and a temporal block. (c) A temporal block contains a 1-D convolution only.}}
    \label{fig:model}
    \vspace{-0.35cm}
\end{figure}

The system architecture of the proposed model DDP-GCN is shown in Figure \ref{fig:model}(a).
It consists of two spatio-temporal convolutional blocks(ST-convolutional blocks, Figure \ref{fig:model}(b)), and a simple 1x1 convolutional layer to reduce the number of channels at the end.
Each ST-convolutional block contains a temporal block(Figure \ref{fig:model}(c)) and a spatial block(Figure \ref{fig:modules}, as explained in Section \ref{spatial-modules}).
We represent a variety of spatial relationships of the road network in the form of three different graph elements.
After that, we apply a simple partition filter to generate modified graph elements that contain the hybrid information of two graph elements.
Finally, two types of multi-graph convolution are applied to effectively capture the complex spatial relationships.

\subsection{Definition of the Spatial Graph Elements}
\label{sec:spatialelements}

In order to improve our modeling capability of complex spatial relationships in road networks, as shown in Figure \ref{fig:adj-matrices},
we define two types of edge weight measures, in addition to distance, and build proper weighted adjacency matrices
that can be used as the spatial block graph elements.
For clarification, only the Prior 1 is currently known, and the other two are newly introduced in our work.
Previous works \cite{chai2018bike,geng2019stmgcn,geng2019multi} defined multi-graphs on undirectional networks for the bike demand forecasting. In contrast, in our work, we define multi-graphs on directional networks for traffic speed forecasting based on the domain knowledge in the traffic area.

\begin{figure}[!ht]
\centering
    \includegraphics[width=0.38\textwidth]{figures/measures-in-one.png}
    \vspace{-0.25cm}
    \caption{\small{
    Three types of weighted adjacency matrices for the same link pair$(i, j)$. Each relationship is reflected into the $W(i,j)$ value.
    (a) Matrix 1: The shortest path distance ($W_D(i,j)$), (b) Matrix 2: The difference between link directions ($W_\theta(i,j)$), (c) Matrix 3: Positional relationship, two links meet at $R_3^\ast$, where the extension of $R_i$ in the forward direction meets the extension of $R_j$ in the backward direction ($W_P(i,j)$).

    }}
    \vspace{-0.15cm}
    \label{fig:adj-matrices}
\end{figure}

\textbf{Prior 1 \cite{tobler1970}}: Everything is related to everything else. But near things are more related than distant things.

\textbf{Graph 1 (Distance, $W_D$)}: We consider the distance $dist(i, j)$ as the shortest inter-link distance on the path.
When the link vectors are directly connected, i.e. $R^{end}_i$ = $R^{start}_j$,
we calculate the distance as the average of the link lengths, i.e. $\frac{\left \| R_i \right \|_2 + \left \| R_j \right \|_2}{2}$.
When the link vectors are not directly connected, $R^{end}_i$ $\neq$ $R^{start}_j$,
the distance is evaluated based on the Dijkstra algorithm\cite{dijkstra1959note}.
After all the pair-wise distances are evaluated,
we define $W_D$ using the thresholded Gaussian kernel\cite{shuman2013graphsignal} as below, where
$\sigma$ and $\kappa$ are hyperparameters.
\begin{equation}
    W_D(i,j) =
    \begin{cases}
    e^{(-dist(i, j)^2 / \sigma^2)} &
    i \neq j \text{ and } \\&
    e^{(-dist(i, j)^2 / \sigma^2)} \geq \kappa
    \\
    0 & \text{otherwise}
    \end{cases}
\label{eq:Wdistance}
\end{equation}

\textbf{Prior 2}: Distant links can be related depending on their directions.
Links having the same directions might be more related than links having the opposite directions.

\textbf{Graph 2 (Direction, $W_\theta$)}:
We consider a simple direction measure with a proper normalization.
To our best knowledge, we are the first to utilize the relative direction information with graph convolutional networks.
\begin{equation}
    W_\theta(i, j)=\frac{\mod{\left (\angle{R_i}-\angle{R_j}, 2\pi\ \right )}}{2\pi}
    \label{eq:Wdirection}
\end{equation}

\textbf{Prior 3}: Links are related depending on how they can be connected. The positional relationship, such as whether two links are heading to closely located destinations, could be additionally informative to the distance for understanding how links interact.

\textbf{Graph 3 (Positional relationship, $W_P$)}:
While Graph 1 considers only the shortest path-distance that connects from $R_i^{end}$ to $R_j^{start}$, two links can be connected through many different paths.
In order to capture how two links are related while considering a variety of connection paths,
we extend the link vectors maintaining the start point $R_i^{start}$ and the link direction $\angle{R_i}$.
Then we define $W_P=\left\{ W_P^1, W_P^2, W_P^3, W_P^4 \right\}$ as the unweighted adjacency matrices that contain the information on where the two extended link vectors meet as described below for each $k \in \left\{ 1, 2, 3, 4\right\}$.
\begin{equation}
    W_P^k(i, j) =
    \begin{cases}
    1, R^\ast_k \text{ exists} \\
    0, \text{otherwise}
    \end{cases}
    \label{eq:positional-relationship}
\end{equation}

\begin{figure}[h!]
\centering
    \vspace{-0.25cm}
    \includegraphics[width=0.46\textwidth]{figures/positional-relationship-1row.png}
    \vspace{-0.25cm}
    \caption{\small{The four positional relationships. Each represents a different type of $W_P$, depending on where the two extended link vectors meet.
    }}
    \label{fig:cdiop-def}
\vspace{-0.2cm}
\end{figure}

Figure \ref{fig:cdiop-def} shows the four types of positional relationships.
$R_k^\ast$ represents four possible intersection points of two extended links vectors. $R_1^\ast$ exists if the extension of $R_i$ in the backward direction meets the extension of $R_j$ in the backward direction. $R_2^\ast$, $R_3^\ast$, and $R_4^\ast$ are similarly defined depending on whether forward or backward extensions of $R_i$ and $R_j$ can meet.
Each type implies how two links could interact. For example, two links would head to the same area when $R_2^\ast$ exists as described in Figure \ref{fig:cdiop-def}(b).
Note that any $R_k^\ast$ cannot exist when two links are exactly parallel. This case is taken into consideration by setting all $W_P^k$ values to zero.

\vspace{0.1cm}
\textbf{Partition filters} \hspace{0.5cm}
We also define a set of partition filters $\{t_m\}$ that can be used over $W$ to create
$t_m(W)=W_m\in\left \{{W}_{1}, \dots, {W}_{M} \right \}$. $t_m(.)$ is a scalar-input scalar-output function, and $t_m(W)$ decribes the element-wise application of filter $t_m(.)$. We constrain the set of partition filters $T_M=\{t_1, ..., t_M\}$ to satisfy $\sum_{m=1}^M{{t}_m(W)} = W$ in order to make sure that $W$ is spread over the $M$ partitioned matrices without any increase or decrease in the element-wise sum.
$M$ can be designed based on the histogram analysis.
To smoothly handle the boundary values, we choose triangular partition filters.
In our work, only $W \in \left \{W_\theta, W_D\right \}$ are considered for applying the partition filters.
Figure \ref{fig:partition-filters} shows 4-directional triangular partition filters, $T_{M=4}$.
Instead of using $T_M(W_\theta)$ directly, we will use $W_D\odot T_M(W_\theta)$ that contain hybrid information between distance and direction because of its empirical superiority.
For $W_D$, appropriate partition filters can be designed by investigating the density in a similar way.
\begin{figure}[h!]
\centering
    \vspace{-0.2cm}
    \includegraphics[width=0.37\textwidth]{figures/Urban2-smaller.png}
    \vspace{-0.3cm}
    \caption{\small{Creating partition filters from $W_\theta$.
    X axis shows angles and Y axis shows $t_m(W_\theta)$ values for the choice of partition filters.

    The direction histogram of the links is properly scaled for plotting purpose and smoothed with a Gaussian kernel. In our work, the four directions $\{0, 90, 180, 270\}$ degrees, happened to coincide with the histogram peaks, however, this is not the only possible choice, and the design of the partition filter allows any number and any choice of directions based on the histogram analysis.
    }}
    \vspace{-0.33cm}
    \label{fig:partition-filters}
\end{figure}

\subsection{Building a Spatial Block}
\label{spatial-modules}

With the newly defined graph elements, we are ready to build spatial blocks for extracting complex spatial relationships.
Spatial blocks are based on the three graph elements $W_D, W_\theta$, and $W_P$, and their partitioned versions.
$W_P$ has no partition filter expansion, but we use $\left\{ W_D \odot W_P \right\}$ instead of $W_P$ to exploit the hybrid information.

\begin{figure}[h!]
\centering
    \vspace{-0.1cm}
    \includegraphics[width=0.47\textwidth]{figures/modules.png}
    \vspace{-0.2cm}
    \caption{\small{Three types of spatial blocks. Each small box represents a single graph convolution and we only denote the weighted adjacency matrix for simplicity. $\oplus$ refers to the element-wise sum. Details are provided in the text.
    }}
    \vspace{-0.2cm}
    \label{fig:modules}
\end{figure}

In Figure \ref{fig:modules}, each box represents a single graph convolution as described in Eq. (\ref{def:gc}), and we only denote the weighted adjacency matrix in the figure for simplicity.
The number of convolutional operation and the choice of weight matrices can vary depending on the dataset or the prediction task.

We designed three types of spatial blocks, as shown in Figure \ref{fig:modules}.
\textit{Single}(Figure \ref{fig:modules}(a)) refers to the simple graph convolution considering only the Euclidean distance.
\textit{Parallel}(Figure \ref{fig:modules}(b)) and \textit{Stacked}(Figure \ref{fig:modules}(c))
refer to the multi-graph convolution including distance, direction, and positional relationship information.
While both utilize four convolutional operations with different graph elements individually, they have different structures for connecting the graph elements. \textit{Parallel} structure can be regarded as equivalent to multi-graph convolution structure as defined in previous works \cite{chai2018bike,geng2019stmgcn,geng2019multi}.

\subsection{Building a Temporal Block}
We conducted extensive experiments to design the temporal blocks, including graph convolution, self-attention\cite{vaswani2017attention}, multi-convolution\cite{szegedy2017inception}, and temporal relational reasoning\cite{zhou2018temporalrelation}. But it turns out that simple convolution showed the best performance with the shortest training time. Based on the empirical results, we adapt the simple temporal block as shown in Figure \ref{fig:model}(c).

\section{Experiment}
\label{experiment}

\subsection{Datasets}

We conducted experiments on two real-world large-scale datasets of Seoul, South Korea.
Urban1(Gangnam) and Urban2(Mapo) correspond to the most crowded regions in Seoul, and they have highly complex connectivity patterns that cannot be explained only with distance; they have bidirectional links and complicated traffic signals. The traffic data were collected every 5 minutes for a month ranging from Apr 1st, 2018 to Apr 30th, 2018. The datasets were collected using the GPS of over 70,000 taxis.

\begin{table}[!ht]
\centering
\caption{\small{\label{table:dataset}Details of datasets.}}
\vspace{-0.3cm}
\resizebox{0.45\textwidth}{!}{%
\begin{tabular}{c||c|c}
\hline
Dataset                                                                              & Urban1         & Urban2        \\ \hline
Time spans                                                               & \multicolumn{2}{c}{4/1/2018 $\sim$ 4/30/2018}          \\ \hline
Time interval                                                            & \multicolumn{2}{c}{5min}                        \\ \hline
Region size (width, height)(m)  & \multicolumn{2}{c}{(7000, 7000)}    \\ \hline
Number of links                                                                  & 480            & 455           \\ \hline
Speed mean(std)(km/h)         & 26.333(10.638) & 25.917(9.784) \\ \hline
Length mean(min, max)(m)                                              & 592(171, 2622) & 561(80, 2629) \\ \hline
Links per $\text{km}^2$ & 11.274 & 10.280 \\ \hline
Average directly connected links & 3.233 & 2.935 \\ \hline
\end{tabular}
}
\vspace{-0.1cm}
\label{table:dataset}
\end{table}

Most of the previous studies have focused on the traffic networks that include only freeways and have simply defined links as the points without direction information \cite{li2017dcrnn,yu2017stgcn,yu2019stunet,chen2019gated,cui2018reachability}.
Our datasets, however, not only include complex urban networks with a large number of intersections, traffic signals, and interactions with other roads(e.g. pedestrian paths), but also define links as the vectors including direction.
We compared some statistical properties of the network to compare how complex they are. First, while every link pair in our datasets is connected, only 27$\%$ of link pairs are connected in the METR-LA dataset used in \cite{li2017dcrnn,yu2019stunet}.
Second, as described in Table \ref{table:dataset}, for both datasets, most of the links can be directly connected on average to three paths(i.e. inflow, outflow, and more), and there are more than 10 links within a 1$\text{km}^2$.
They imply our dataset has a fairly dense link population when compared to the highway only network of same city, Seoul. For highway only network, most links can be directly connected on average in two paths(i.e. inflow and outflow only), and there are only around three links within a 1$\text{km}^2$.
Due to these dense link population characteristics, distance graph element alone cannot sufficiently reflect the complex spatial relationship of the urban networks.

\begin{table*}[t!]
\centering
\vspace{-0.3cm}
\caption{\small{Performance comparison(30/ 45/ 60min). The best performing models of each forecasting horizon and metric are shown in \textbf{Bold}. All cases are repeated five times.}}
\vspace{-0.2cm}
\resizebox{0.96\textwidth}{!}{%
    \begin{tabular}{c||c|c|c||c|c|c}
    \hline
    Model  & \multicolumn{3}{c}{Urban1}  & \multicolumn{3}{c}{Urban2}                         \\  \cline{2-7} \cline{2-7}
    & MAE    & MAPE (\%)          & RMSE                & MAE              & MAPE (\%)          & RMSE             \\ \hline\hline
    HA                                                             & 3.34/ 3.34/ 3.34 & 14.68/ 14.67/ 14.68 & 5.42/ 5.42/ 5.41 & 3.23/ 3.22/ 3.22 & 14.43/ 14.42/ 14.41 & 4.86/ 4.86/ 4.85 \\ \hline
    VAR                                                            & 5.06/ 4.99/ 4.97 & 23.10/ 22.82/ 22.73 & 7.04/ 6.92/ 6.88 & 4.58/ 4.52/ 4.49 & 20.82/ 20.55/ 20.43 & 6.31/ 6.22/ 6.19 \\ \hline
    LSVR                                                           & 3.82/ 3.89/ 3.93 & 15.35/ 17.99/ 17.39 & 5.64/ 5.74/ 5.84 & 4.38/ 4.22/ 3.92 & 17.01/ 16.82/ 18.45 & 5.83/ 5.71/ 5.47 \\ \hline
    ARIMA                                                          & 3.49/ 3.79/ 4.04 & 15.40/ 16.85/ 18.09 & 5.28/ 5.65/ 5.94 & 3.30/ 3.56/ 3.78 & 14.78/ 15.99/ 17.03 & 4.77/ 5.09/ 5.37 \\ \hline
    FC-LSTM                                                        & 3.91/ 3.92/ 3.92 & 17.29/ 17.32/ 17.31 & 6.38/ 6.39/ 6.39 & 3.81/ 3.81/ 3.82 & 17.10/ 17.12/ 17.12 & 5.57/ 5.58/ 5.58 \\ \hline
    DCRNN                                                          & 3.17/ 3.46/ 3.73 & \textbf{13.52}/ 14.83/ 15.95 & 4.94/ 5.30/ 5.61 & 3.08/ 3.31/ 3.50 & 13.55/ 14.63/ 15.52 & 4.58/ 4.86/ 5.08\\ \hline
    STGCN                                                          & 3.07/ 3.42/ 3.80 & 14.38/ 16.72/ 19.37 & 4.57/ 4.83/ 5.04 & 2.99/ 3.33/ 3.69 & 14.02/ 15.82/ 17.78 & 4.37/ 4.79/ 5.26 \\ \hline\hline
    \textbf{DDP-GCN(Single)} & 3.06/ 3.06/ 3.29 & 13.83/ 13.82/ 15.02 & 4.55/ 4.54/ 4.95 & 2.93/ 2.93/ 3.06 & 13.34/ 13.33/ 13.99 & 4.26/ 4.26/ 4.43 \\ \hline
    \textbf{DDP-GCN(Parallel)}      &   3.06/ 3.06/ 3.10               &     13.82/ 13.08/ 13.99                &    4.54/ 4.54/ 4.64              &     2.95/ 2.95/ 2.96             &      13.37/ 13.36/ 13.45               &     4.30/ 4.29/ 4.31             \\ \hline
    \textbf{DDP-GCN(Stacked)} & \textbf{3.00/ 3.00/ 2.99} & 13.57/ \textbf{13.56/ 13.51} & \textbf{4.45/ 4.45/ 4.47} & \textbf{2.90/ 2.89/ 2.88} & \textbf{13.18/ 13.17/ 13.14} & \textbf{4.24/ 4.23/ 4.22} \\ \hline
    \end{tabular}}
\vspace{-0.3cm}
\label{table:performance}
\end{table*}

\subsection{Experimental Settings}
We repeated the experiment five times and the average performances are provided in Table \ref{table:performance}.
For all datasets, we applied Z-score normalization.
After excluding the weekends, 70\% of the data is used for training, 10\% for validation and the remaining 20\% for testing in time order. For $W_D$, as defined in Eq. \ref{eq:Wdistance},
$\sigma$ and $\kappa$ are set depending on the data scale. In our study, we set $\sigma$ to be $10^6$ and $\kappa$ to be 0.
For partition filters, we determined the number of filters, $M$ for $W_\theta$ and $M'$ for $W_D$, based on the histogram analysis of each dataset as described in Section \ref{sec:spatialelements}.
We set the $M$ to be 4(Urban1, Urban2) and $M'$ to be 3(Urban1) or 4(Urban2).
We set both $T'$ and $T$ to 12 samples, where 12 corresponds to an one hour span.
All experiments were implemented using Tensorflow 1.15 on a Linux cluster(CPU: Intel(R) Xeon(R) CPU E6-2620 v4 @ 2.10GHz, GPU: NVIDIA TITAN V). The training process takes about 15 minutes on a single GPU.

\textbf{Baselines} \hspace{0.5cm} We compare the proposed model (DDP-GCN) with the following methods:
(1) HA: Historical Average;
(2) VAR: Vector Auto-Regression\cite{hamilton1994time};
(3) LSVR: Linear Support Vector Regression; (4) ARIMA: Auto-Regressive Integrated Moving Average model;
(5) FC-LSTM: Recurrent Neural Network with fully connected LSTM hidden units\cite{sutskever2014sequence}; (6) DCRNN: Diffusion Convolutional Recurrent Neural Networks\cite{li2017dcrnn}, which manipulates bidirectional diffusion convolution on the graph for capturing spatial dependency and uses sequence-to-sequence architecture with gated recurrent units to capture temporal dependency, and (7) STGCN: Spatio-Temporal Graph Convolutional Networks\cite{yu2017stgcn}, which is composed of spatiotemporal convolutional blocks including two gated sequential convolution layers and one spatial graph convolution layer in between.

\subsection{Performance Comparison}

Table \ref{table:performance} shows the performance comparison of DDP-GCN and the baselines of the datasets Urban1 and Urban2
for 30, 45, 60-min prediction on all datasets.
To note, each model predicted all 12 sequential traffic speed values at all links simultaneously.
These methods are evaluated based on three commonly used metrics in traffic forecasting, including
(1) Mean Absolute Error (MAE), (2) Mean Absolute Percentage Error (MAPE), and (3) Root Mean Squared Error (RMSE).

Our proposed model, especially DDP-GCN(Stacked), achieves the best performance for all cases with the exception of the 30-min prediction MAPE of the Urban1 dataset. For 1-hour forecasting, our model showed an improvement of 7.40\% on average (9.83\% maximum). In particular, the stacked spatial block, firstly introduced in our work, outperformed the parallel spatial block for all cases.
Unlike other baseline methods, DDP-GCN(Stacked) showed even better performance in longer forecasting horizons for some cases.
Interestingly, we observed that graph convolution-based methods are generally accurate only for (relatively) short-term predictions and HA tends to be more accurate for (relatively) long-term predictions. We believe that this result is mainly due to the strong weekly periodicity of our dataset. While others utilize only recent 1-hour speed information, HA utilizes a different type of information, i.e. weekly speeds. Even though we exploit only recent 1-hour information with our model, however, our model always outperformed the others, including HA. It suggests that the non-Euclidean spatial relationships, direction, and positional relationship, are quite powerful priors for the accurate speed forecasting.

\begin{figure}[!t]
\centering
    \vspace{-0.1cm}
    \includegraphics[width=0.48\textwidth]{figures/prediction-example-revised.png}
    \vspace{-0.6cm}
    \caption{\small{
    Examples of 60-min prediction results for the dataset Urban1. (Left: Apr 25th, Right: Apr 30th) DDP-GCN is more predictive of the abrupt changes.}}
    \vspace{-0.2cm}
    \label{fig:prediction-results}
\end{figure}

When HA that uses additional inputs is excluded and DDP-GCN is compared to the graph convolution based methods only(DCRNN, STGCN, and DDP-GCN), DDP-GCN(Stacked) showed 9.60\% average (19.84\% maximum) improvement over all forecasting horizons and 16.07\% average improvement for 1-hour forecasting. A segment of the prediction results is shown in Figure \ref{fig:prediction-results}, and we can easily see that DDP-GCN(Stacked) is superior at capturing the abrupt changes, even 1-hour ahead. This result suggests that non-Euclidean information is essential for capturing the abrupt changes in complex networks in advance.

\subsection{Benefits of Spatial Graph Elements}

To investigate the effect of each spatial graph element,
we evaluate the performance degradation by performing ablation tests using DDP-GCN(Stacked) on the Urban1 dataset.
The result is shown in Table \ref{table:rm-spat}.
Removing \textit{Direction}($W_D\odot T_M(W_\theta)$) decreased the performance the most and removing \textit{Distance}($W_D$) the least.
This result indicates that distance only element is not the most important graph element to reflect complex spatial relationships. On the other hand, non-Euclidean relationships, especially directions, should be fed into the network with partition filters.

\begin{table}[t!]
\caption{\small{Effect of each element on the spatial dependency modeling for the Urban1 dataset. The worst performing cases are shown in \textbf{Bold}. All cases are repeated five times.}}
\centering
\vspace{-0.1cm}
\resizebox{0.48\textwidth}{!}{%
\begin{tabular}{c||c|c|c}
\hline
\begin{tabular}[c]{@{}c@{}}Removed\\ Component\end{tabular}       & MAE              & MAPE(\%)            & RMSE             \\ \hline\hline
Distance                                                          & 3.01/ 3.01/ 3.00 & 13.59/ 13.58/ 13.51 & 4.47/ 4.47/ 4.47 \\ \hline
Direction                                                         & \textbf{3.04}/ \textbf{3.04}/ \textbf{3.03} & \textbf{13.76}/ \textbf{13.75}/ \textbf{13.70}  & \textbf{4.53}/ \textbf{4.53}/ \textbf{4.55} \\ \hline
\begin{tabular}[c]{@{}c@{}}Positional\\ Relationship\end{tabular} & 3.03/ 3.03/ \textbf{3.03} & 13.73/ 13.72/ 13.69 & 4.52/ 4.52/ \textbf{4.55} \\ \hline
\begin{tabular}[c]{@{}c@{}}Distance\\ \small{($W_D\odot t_m(W_D)$)}\end{tabular}       & 3.02/ 3.02/ 3.02 & 13.67/ 13.66/ 13.63 & 4.50/ 4.50/ 4.52 \\ \hline\hline
None                                                              & 3.00/ 3.00/ 2.99 & 13.57/ 13.56/ 13.51 & 4.45/ 4.45/ 4.47 \\ \hline
\end{tabular}
}
\vspace{-0.1cm}
\label{table:rm-spat}
\end{table}

\begin{table}[t!]
\caption{\small{Effect of spatial priors compared with SOTA graph-based algorithms utilizing K-hops of the distance matrix with respect to the 1-hour forecasting with Urban1 dataset based on RMSE. All cases are repeated five times except once with DCRNN whose training is very long. For DCRNN, the cases of $K>5$ are not conducted because the training is very long and unstable.}}
\vspace{-0.2cm}
\centering
\resizebox{0.48\textwidth}{!}{%
\begin{tabular}{c||c|c|c|c|c}
\hline
\textbf{K}  & \textbf{DCRNN} & \textbf{STGCN} & \textbf{\begin{tabular}[c]{@{}c@{}}DDP-GCN\\ (Single)\end{tabular}} & \textbf{\begin{tabular}[c]{@{}c@{}}DDP-GCN\\ (Parallel)\end{tabular}}& \textbf{\begin{tabular}[c]{@{}c@{}}DDP-GCN\\ (Stacked)\end{tabular}} \\ \hline\hline
1  & 5.57           & 5.61           & 4.95                                                              &  4.64    & 4.47                                                                 \\ \hline
2  & 5.27           & 5.55           & 4.82                                                                &    4.60  & 4.46                                                  \\ \hline
3  & 5.02           & 5.31           & 4.83 &    4.59 & 4.46                                 \\ \hline
4  & 4.85           & 5.43           & 4.75                                                              &  4.58    & 4.46                                                                 \\ \hline
5  & 4.82     & 5.37           & 4.73     &     4.58                                                          & 4.46                                                                 \\ \hline
10 & -              & 5.25     & 4.69                                                                &  4.56  & 4.47                                                                 \\ \hline
20 & -              & 5.30           & 4.68                                                            &  4.57 & 4.48                                                                 \\ \hline
\end{tabular}
}
\vspace{-0.4cm}
\label{table:large-hops}
\end{table}

We also examined if larger hops could be as important as non-Euclidean relationships. Here, instead of the 1stChebNet, we use K-polynomial ChebNet\cite{defferrard2016}. K-hops are applied only with the distance($W_D$).
As shown in Table \ref{table:large-hops}, even with large K, no model could outperform DDP-GCN(Stacked).
Moreover, the performance of DDP-GCN(Stacked) was not improved for larger K.
These results indicate that the direction and the positional relationship should be considered as important attributes for traffic forecasting, and they are more beneficial than the K-hop neighbors' information.

\section{Conclusion and Future Work}
\label{conclusion}

In this paper, we proposed and described a new traffic speed forecasting network utilizing three spatial dependencies, namely distance, direction, and positional relationships.
Our model includes multi-graph convolution based on the properly modified graph elements by the simple partition filters.
We have investigated examples of traffic forecasting problems and showed a large improvement in the long-term forecasting accuracy of highly complex urban networks when compared to the other state-of-the-art algorithms.
In the future, we will further evaluate our model on other datasets and investigate how temporal periodicity influences traffic forecasting.
\section{Introduction}

This short example shows a contrived example on how to format the authors' information for {\it IJCAI--PRICAI--20 Proceedings}.

\section{Author names}

Each author name must be followed by:
\begin{itemize}
    \item A newline {\tt \textbackslash{}\textbackslash{}} command for the last author.
    \item An {\tt \textbackslash{}And} command for the second to last author.
    \item An {\tt \textbackslash{}and} command for the other authors.
\end{itemize}

\section{Affiliations}

After all authors, start the affiliations section by using the {\tt \textbackslash{}affiliations} command.
Each affiliation must be terminated by a newline {\tt \textbackslash{}\textbackslash{}} command. Make sure that you include the newline on the last affiliation too.

\section{Mapping authors to affiliations}

If some scenarios, the affiliation of each author is clear without any further indication (\emph{e.g.}, all authors share the same affiliation, all authors have a single and different affiliation). In these situations you don't need to do anything special.

In more complex scenarios you will have to clearly indicate the affiliation(s) for each author. This is done by using numeric math superscripts {\tt \$\{\^{}$i,j, \ldots$\}\$}. You must use numbers, not symbols, because those are reserved for footnotes in this section (should you need them). Check the authors definition in this example for reference.

\section{Emails}

This section is optional, and can be omitted entirely if you prefer. If you want to include e-mails, you should either include all authors' e-mails or just the contact author(s)' ones.

Start the e-mails section with the {\tt \textbackslash{}emails} command. After that, write all emails you want to include separated by a comma and a space, following the same order used for the authors (\emph{i.e.}, the first e-mail should correspond to the first author, the second e-mail to the second author and so on).

You may ``contract" consecutive e-mails on the same domain as shown in this example (write the users' part within curly brackets, followed by the domain name). Only e-mails of the exact same domain may be contracted. For instance, you cannot contract ``person@example.com" and ``other@test.example.com" because the domains are different.

\end{document}

redpajama_set_name: RedPajamaArXiv


The Central Connecticut softball team defeated Massachusetts 6-4 Wednesday afternoon in Amherst, MA. Freshman Rian Eigenmann led the Blue Devils with two hits, two RBIs, and one run.
Massachusetts (18-15, 6-1 A10) got on the board early. With runners on first and second, UMass followed with two pop ups from the next two batters. Back to back single-RBIs put them on the board 2-0 before Central closed the inning.
The Blue Devils (14-15, 1-5 NEC) responded with three runs in the top of the second. Eigenmann had the bases loaded and hit a double out to right field sending juniors Emily Cronin and Giuliana Hathaway across home plate. Sophomore Meg Dugas scored the final run of the inning off a passed ball to give CCSU a 3-2 lead.
UMass tied the game in the third inning when Kaitlyn Stavinoha scored while Hannah Bunker got caught trying to steal second base. Central went ahead 4-3 in the fourth when junior Alicia Bertolino cracked one out of the park.
Both teams were scoreless in the next two innings and the Blue Devils allowed just two hits from Massachusetts. CCSU scored its final two runs in the seventh. Eigenmann scored and a sacrificed fly ball to center field by freshman Alexa Milius sent freshman Carli Backlund home.
Central gave up just one run, one hit in the bottom of the seventh, leaving two UMass runners on base to close the game.
Freshman Kari Marks pitched all seven innings for the Blue Devils. She allowed eight hits, four runs, and threw three strike outs.
Softball hosts Providence on Thursday at 4 p.m. and hosts NEC opponent Fairleigh Dickinson for a pair of games on Sunday, April 14 starting at noon.


text:
Bridges: Felton Area
Felton was home to several railroad bridges of various styles and qualities, running from the massive trestle-truss complex over the San Lorenzo River south of Big Trees to tiny unrecorded bridges over Toll House Gulch and other small seasonal streams. The Santa Cruz & Felton Railroad was initially responsible for overcoming most of these barriers, but both bridges over the San Lorenzo River in the Felton area came at a later date.
A South Pacific Coast train crossing the long trestle of the first Big Trees Bridge, c. 1880. [Harold van Gorder]
In early 1875, the Santa Cruz & Felton Railroad began grading south from Felton. It was a low-budget operation with few long-term plans and, as such, the company built relatively cheaply. All of its bridges were entirely constructed using old-growth redwood harvested from along the right-of-way and from local mills such as George Treat's near Toll House Gulch. Other than their existence, nothing is known about these early bridges except that they were all relatively short and probably followed a trestlework design. At a minimum, relatively substantial bridges were built over Shingle Mill Creek and Gold Gulch, with smaller structures required over Toll House Gulch and possibly other seasonal streams in this section. A total of eleven bridges were required along the entire route between Felton and the Santa Cruz Railroad Wharf, and not all of them have been accounted for and only three have extant photographs. Over the subsequent four years, the railroad reinforced and strengthened all of these bridges, as necessary, and it seems likely that the South Pacific Coast Railroad, which took over the line in 1879, retained the original structures when possible. There is little evidence in newspapers and other records of these bridges being replaced or upgraded during the decades of their existence. All such structures were removed around 1908, when the Old Felton Branch (as it was called by the Southern Pacific Railroad) was dismantled and a new bridge over the San Lorenzo River replaced it.
A scenic view of the first Big Trees Bridge from the river, showing the truss span, c. 1890s. [Bancroft Library]
Throughout late 1879, the South Pacific Coast Railroad erected a substantial bridge over the San Lorenzo River just to the south of Big Trees. This bridge acted to connect the new route to San Jose and Alameda Point to the old Santa Cruz & Felton Railroad line, which it joined at a new location called Felton Junction. The bridge crossed the river at an especially wide point over an old floodplain. Significant trestlework was required on the south side to bring the right-of-way to the grade of the existing railroad line. The Southern Pacific Railroad, which leased the line in 1887, filled in this trestlework and it remains an obvious fill today. Over the actual river, the South Pacific Coast installed an open-deck Warren truss bridge.
The second bridge at Big Trees after it was standard-gauged, 1908.
Note the trestlework beneath to support the truss and tracks. [Ken Lorenzen]
This truss was replaced in 1905 with a rather unique-looking thru double-intersecting Pratt truss bridge that gave much greater clearance under the bridge for the river and debris to pass under. The structure, built by Clarke, Reeves & Company and Phoenix Bridge Company, included two new wrought iron features: Whipple-Murphy truss supports and Phoenix columns, both of which were intended to provide additional support to the structure. This may have been a solution to winter storms, which habitually caused the water levels to rise and likely damaged the truss periodically. Photographic evidence reveals that this truss was expanded to support standard-gauge service around 1908, but the photograph above suggests that the bridge could not sustain the increased weight of the heavier trains, requiring extensive supports in the river to support the span. With destructive river storms a constant threat, cluttering the river with multiple bents and piles was impractical.
The DeWald family standing on the third Big Trees Bridge, c. 1910s. [Carol Harrington]
In late 1908, before winter, the Pratt truss was replaced with a heavy-duty Warren thru truss. This was designed specifically to support heavier trains and to keep the river clear so debris could move freely under the bridge. At a latter point in time, a short open-deck plate girder span was extended on the north side to allow vehicular traffic to pass under the bridge along Pipeline Road. This was in place by at least the late 1910s, as the photograph above makes clear.
Construction of the Old Felton Bridge in 1908, showing the fill and the Felton Covered Bridge. [Press-Banner]
The final railroad bridge in the Felton area is also the newest. Immediately to the south of the Felton Covered Bridge, a standard-gauge truss bridge was installed in 1908 during Southern Pacific's standard-gauging of its lines in order to abandon the majority of the Old Felton Branch, which was deemed too costly to maintain and standard-gauge for its limited use. At this time, the only regular business along this branch were the Holmes Lime Kilns, which was situated just west of downtown.
The Old Felton Bridge during the 1920s. Note the Covered Bridge in the background. [Yesteryear Depot]
This new bridge was not built along the Felton Branch but rather was a part of a newly-installed spur that broke off from the Boulder Creek Branch at what would become the entrance to Felton Grove and continued across the river and south, where it forked, with one spur going into the Holmes property and another ending outside Old Felton Depot. The bridge was composed of a compressed Pratt thru truss perched atop a concrete abutment on one side and a concrete pier on the other. A short open steel deck section connected the pier to a second concrete abutment and the railroad grade on the east side.
Postcard of the Felton Covered Bridge, with the Old Felton Bridge beside it, 1920s. [CardCow.com]
This bridge remained in operation until 1938, surviving even the abandonment of the Boulder Creek Branch in 1934. But the closure of the Holmes kilns during the Great Depression signalled the end for this bridge. It was dismantled and removed by 1940. The concrete pier may have been removed at this time, as well.
The western abutment of the Old Felton Bridge, 2012. [Derek R. Whaley]
Geo-Coordinates & Access Rights:
The Big Trees Bridge, 2012. [Derek R. Whaley]
Big Trees Bridge (San Lorenzo River Bridge #2): 37.0337N, 122.0582W
Toll House Gulch Bridge: Approx. 37.0327N, 122.0613W
Gold Gulch Bridge: 37.0390N, 122.0705W
Shingle Mill Creek Bridge: 37.0435N, 122.0733W
Old Felton Bridge (San Lorenzo River Bridge #3): 37.0507N, 122.0709W
Only the Big Trees Bridge still exists in its entirety today. The structure is still composed of the 1909 Warren truss bridge accompanied by the shorter plate girder span over Pipeline Road. It is crossed regularly by the Santa Cruz Big Trees & Pacific Railroad's Beach Train. Trespassing is not advised as the bridge had no guard-rails and remains a part of a live railroad line.
The remnants of the Old Felton Bridge can be viewed from the Felton Covered Bridge on the south side. On the west shore, the concrete abutment is easily accessible on foot, and the fill away from the bridge to the west is also easily noticed, with a driveway to the Felton horse stables cutting through the fill. The eastern abutment is more difficult to see but is intact in the side yard of a home. The ivy-covered abutment has been enclosed with a gate and protects the residence's garbage cans. No remnant of the pier that once sat on the east bank survives—whether it was removed or washed away in a storm is unknown.
No remnants survive of the other four known bridges. They all were removed by 1909 and would have been built almost entirely of wood, so they have either been repurposed or washed away.
Citations & Credits:
Hamman, Rick. California Central Coast Railways. Second edition. Santa Cruz, CA: Otter B Books, 2007.
"Hayden Bridge, Lane County, Oregon." BridgeHunter.com, 2018.
Whaley, Derek R. Santa Cruz Trains: Railroads of the Santa Cruz Mountains. Santa Cruz, CA, 2015.
Labels: Boulder Creek Branch, Bridges, Coast Division, Santa Cruz & Felton Railroad, Santa Cruz County, South Pacific Coast Railroad, Southern Pacific Railroad
Lawrence Manzo April 26, 2013 at 12:49 PM
I have read that originally this trestle was suspended from curb to curb, but as they hauled lime over it, it started to sag, and a concrete pier was installed in the middle as additional support. You can see the pier in one of your photos. Do you think they pulled it out of the river? Or are the remains somewhere downstream in the San Lorenzo?!?
Also, there is a line of tiny houses running along Covered Bridge Road, across from the park. I believe all these lots-- from the Laundromat to the bridge, were subdivided out of the old right-of way.
Please don't forget the Zayante creek trestle. There is still a curb in the woods on the Roaring Camp side of Zayante creek. I have a photo(in a book somewhere) of an engine going over that trestle.
Derek Whaley April 26, 2013 at 11:11 PM
You're right, I didn't even notice that support pier. Good eye! I'll add your segment to the article at a later point (don't have time now). I've never seen any evidence of it in the river but I think it was actually mounted on the shore but in a shallow spot that sometimes was submerged. It's not there anymore, for sure, though. I doubt it was pulled but I've never heard of the remains of a pier downriver either.
You are correct. When I do the Felton Grove article I will post a photo of the original right-of-way through the grove. You can also check https://maps.google.com/maps/ms?vps=2&ie=UTF8&hl=en&oe=UTF8&msa=0&msid=200612564695326767482.000464d86cc5713f2a423 for a view of the right-of-way overlaying Felton Grove.
I won't forget the Zayante Creek Trestle, I just need to find my photos of it! I have seen two, but I can't remember where I saw either of them! It's quite frustrating. I There is still a pier and the west curb being used for a water main while the wooden east curb is partially buried in the woods across from the Mount Hermon supply depot. I think the photo you have is the same one I saw of the train on the trestle. The other photo is taken from the Graham Hill Bridge looking at the trestle beside it with (two?) women posing on the bridge.
I also have seen a photo of the Felton Grove Trestle a few weeks ago with its tracks removed and some people walking across it.

redpajama_set_name: RedPajamaCommonCrawl


text:
Home / Tell Me The Truth About Love
Tell Me The Truth About Love
Buy + Add To Wish List + £12.99 - Few in stock
Shipping time: In stock | Expected delivery 1-2 days | Free UK Delivery
Some say love's a little boy,
And some say it's a bird,
Some say it makes the world go around,
Some say that's absurd...
Charting the course of a love affair - in song - through the eyes of a young woman who begins by asking the universal question, Tell me the truth about love presents a programme of 19th and 20th century song. The album takes its title from Benjamin Britten's 1938 seductive setting of W.H. Auden's amusing poem and tries to pin down and define the most elusive of human emotions.
The story takes us from love at first sight with Schumann's Seit ich ihn gesehen, breathless with wonder and fervent reverance and Chausson's Le charme which describes the quiver of excitement and the tender veneration the girl feels when the boy's smile catches her unawares to Loewe's Ich kann's nicht fassen, nicht gluben to describe the lovers first encounter.
As the love story unfolds and the couple become closer, it is illustrated with music such as Strauss's Nachtgang, Rachmaninov's Midsummer nights and Bridge's Adoration. However the magic is soon broken and Sunday brings deception and betrayal. The girl finds out that the young man does not love her and she bitterly awakes from her dream. The feeling of love lost is brought to life through Brahm's Am Sonntag Morgen, Schubert's Du liebst mich nicht and Kurt Weill's Je ne t'aime pas.
As a postlude, Britten's arrangement of Early one morning perfectly sums up the story of the young girl and the final message of 'how could you use a poor maiden so?' lingers in the ear.
Amanda Roocroft has secured an international reputation as one of Britain's most exciting singers, in opera, concert and recital and Joseph Middleton enjoys a busy and varied career as a chamber musician and song accompanist.
CHRCD040
Champs Hill
Artists Roocroft, Amanda
If you like Tell Me The Truth About Love, please tell your friends! You can easily share this page directly on Facebook, Twitter and via e-mail below.
Circus And Magic
Wiprud/ Barber/ Menotti: American Violin Concertos
The Crown Of Ariadne
Full English CHRCD036 28/05/2012 £12.99
Pictures At An Exhibition CHRCD030 27/02/2012 £12.99
From The Streets CHRCD026 14/10/2011 £12.99
Elgar: Elgar In Sussex CHRCD027 26/09/2011 £12.99
Various: Emanuel Ensemble CHRCD023 27/06/2011 £12.99


Netflix on Friday announced it had renewed the award-winning women's prison dramedy "Orange is the New Black" -- one of the streaming giant's tentpole series -- for three more seasons.
The fourth season of "Orange is the New Black" premieres June 17, and the new Netflix commitment will take the series into its seventh season.
The show has won four Emmy awards, including two for actress Uzo Aduba, who plays Suzanne "Crazy Eyes" Warren. It took home the Screen Actors Guild award last weekend for best ensemble cast in a comedy series.
"Orange," along with political drama "House of Cards," have established Netflix as a powerhouse in the realm of original content.
"Three more years! Not a political mandate, but still plenty of time to do interesting things," series creator Jenji Kohan said in the statement.
Kohan will remain as executive producer and showrunner, a role that involves being the lead writer as well as steering the program's production, for the three new seasons.
Kohan was previously the creator, executive producer and showrunner of Showtime's "Weeds," which aired from 2005 to 2012.


text:
Clashes in Libyan capital kill at least 20, airport closed
Trump, Syria and Facebook: the volatile cocktail of the 2010s
BENGHAZI (Libya), January 15, 2018 20:37 IST
The interior of Mitiga airport is seen empty following clashes, in Tripoli, Libya, January 15, 2018 | Photo Credit: Reuters
Another 63 were wounded in the fighting between two militias that are ostensibly allied with the internationally-backed government
Heavily armed Libyan militias clashed in Tripoli on Monday, killing at least 20 people and forcing the capital's only airport to close, officials said.
The Health Ministry said another 63 people were wounded in the fighting between two militias that are ostensibly allied with the internationally-backed government, underscoring the lingering instability in the country seven years after a popular uprising toppled long-ruling dictator Moammar Gadhafi.
Civilians were among the dead, including an airline employee who was trying to get home after Matiga airport shut down. An airport official said staffers were evacuated from Matiga airport and that five flights have been cancelled. A picture posted on the airport's Facebook page showed a passenger plane with its roof blown off.
The official spoke on condition of anonymity because he was not authorised to speak to the press.
The Special Deterrent Force, a militia which controls the airport, was fighting a rival militia led by local strongman Bashir al-Baqara. Both are allied with the internationally recognised government in Tripoli.
A rival government and parliament rule in Libya's east, but across the country real power is held by a dizzying array of armed groups.
The Presidency Council, one of the three ruling bodies in Tripoli, said al-Baqara's men wanted to release suspected al- Qaida and Islamic State members held at a prison near the airport that is also run by the Special Deterrent Force. The government has ordered al-Baqara's men to hand over their weapons and disband.
Special Deterrent Force spokesman Ahmed bin Salem said four of his men were killed. He said the situation is now under control, and that a number of the attackers were arrested while trying to storm the prison. On its Facebook page, the force says the prison houses 2,500 detainees.
The chaos in Libya has made it a major transit point for migrants from across Africa and the Middle East hoping to reach Europe.
Today, the coast guard intercepted three boats carrying at least 300 migrants bound for Europe, according to Ayoub Gassim, the spokesman for Libya's navy. The boats departed from different points near Tripoli and the coastal city of Sabratha, he said.
The story was updated with the latest death toll
Related Topics International
Printable version | Jan 30, 2020 2:24:26 AM | https://www.thehindu.com/news/international/clashes-in-libyan-capital-kill-9-close-airport/article22444381.ece
Watch | All about Trump's Middle East peace plan
A video on the Middle East peace plan proposed by U.S. President Donald Trump
The Hindu Net Desk
Fire continues to devastate Australia
The Australian navy on Friday began evacuating around 1,000 people stranded on the east coast of the fire-ravaged country as a searing weather front was set to whip up more blazes across the states of Victoria and New South Wales (NSW).


text:
Services Emergency care Pediatric emergency care Share
Pediatric emergency care
One size fits all doesn't work in emergency care, especially when it comes to kids. They need oxygen masks and other equipment sized just for them. They also need healthcare providers who know the right dose of medication for a child—and the right words to coax a smile.
Each of our Emergency Departments (EDs) in Elmhurst and Naperville, and a freestanding emergency center in Plainfield, provide specialized care for our youngest patients.
Pediatric ER
Edward's Emergency Department is recognized as an Emergency Department Approved for Pediatrics (EDAP). And, Edward Hospital is one of only 10 Pediatric Critical Care Centers (PCCC) in Illinois - offering the highest level of care available. We were the first pediatric ED in DuPage County (opened in 2000) and have treated hundreds of thousands of children. We're staffed by physicians who are board-certified in pediatrics and emergency medicine, and pediatric nurses who've been trained to treat kids. Our Pediatric ED also has family-friendly rooms and equipment designed for their sizes, shapes and needs.
Learn about our expert care for common pediatric issues, such as pediatric asthma and pediatric concussions.
For added peace of mind, Edward's Pediatric Intensive Care Unit (PICU) is available for children who need critical care, and its Level III Newborn Intensive Care Unit, the highest level possible in Illinois, provides specialized care for the sickest and most fragile newborns.
Child life specialists are available to comfort children and teens being treated. They help young patients relax, prepare them for treatment and teach them how to cope.
Meet our pediatric emergency medicine physicians
Kid-friendly ERs
Both the Elmhurst Hospital ED and the Plainfield Emergency Center are kid-friendly and ready to focus on the unique needs of children. The Elmhurst ED is state-recognized as an Emergency Department Approved for Pediatrics (EDAP). And, the freestanding emergency center in Plainfield is led and staffed by the team who operates Edward's Naperville ED. Open around-the-clock, both the ED and freestanding emergency center are staffed with board-certified emergency medicine doctors and certified emergency nurses. Each location provides streamlined care and is furnished with child-sized equipment and kid-friendly waiting areas.
When inpatient care is needed
Should your child's condition require hospitalization, including pediatric intensive care, both the Plainfield Emergency Center and the Elmhurst ED have transport services available. The Plainfield Emergency Center has a transport team on site 24/7 to transfer children to the Naperville campus. Elmhurst Hospital also transfers pediatric patients (infants through age 11) requiring hospital admission for basic pediatric inpatient care or a higher level of care to Edward Hospital's Inpatient Pediatrics and Pediatric Intensive Care Unit in Naperville via private ambulance. The transport team is trained in pediatrics as well as adult transports.
Children and teens, ages 12-17, who are treated in the Emergency Department or have undergone outpatient surgery at Elmhurst Hospital and need to be admitted to the hospital, will continue to receive inpatient care at Elmhurst on an adult inpatient unit.
View ED locations
Find a Healthy Driven™ Doctor
Keeping kids healthy is our top priority
Manage your health online
Take the Five Minute Test That Could Save Your Life
Health Aware
Edward, Elmhurst Hospitals named among America's Best for Cardiac Care Edward Hospital and Elmhurst Hospital have been named two of America's 100 Best Hospitals for Cardiac Care, according to Healthgrades.


text:
These Little Satellites Could Help Us Learn How Deadly Hurricanes Form

NASA is about to launch a fleet of satellites that will help researchers understand how deadly hurricanes develop.

The Cyclone Global Navigation Satellite System is made up of eight small spacecraft that are able to take measurements through the rain of a storm's inner eye, which conventional satellites can't do.

SEE MORE: Our Weather Forecasting Is About To Get A Huge Upgrade

The tiny satellites will collect data about the hurricane's core like wind speeds, clouds and rain. Officials hope it will help them better understand how the inside of a storm works.

What scientists know now is a storm's core acts as an engine: It takes energy from warm surface water evaporating into the atmosphere. And that energy is what keeps hurricanes and cyclones going.

NASA plans to launch the satellites from Cape Canaveral Air Station in Florida on Dec. 12. Once released, the satellites will continuously monitor Earth's oceans around tropical latitudes.

Trending stories at Newsy.com

What Could Trump's Policies Mean For Climate Science Efforts?

Ideas Circle About How Trump Will Handle The National Parks System

These Kids In Oregon Just Won A Big Climate Change Victory

By: Lindsey Pulse, Carter Woodiel
NASA is about to launch a fleet of satellites that will help researchers understand how deadly hurricanes develop.
The Cyclone Global Navigation Satellite System is made up of eight small spacecraft that are able to take measurements through the rain of a storm's inner eye, which conventional satellites can't do.
SEE MORE: Our Weather Forecasting Is About To Get A Huge Upgrade
The tiny satellites will collect data about the hurricane's core ??? like wind speeds, clouds and rain. Officials hope it will help them better understand how the inside of a storm works.
What scientists know now is a storm's core acts as an engine: It takes energy from warm surface water evaporating into the atmosphere. And that energy is what keeps hurricanes and cyclones going.
NASA plans to launch the satellites from Cape Canaveral Air Station in Florida on Dec. 12. Once released, the satellites will continuously monitor Earth's oceans around tropical latitudes.
Trending stories at Newsy.com
What Could Trump's Policies Mean For Climate Science Efforts?
Ideas Circle About How Trump Will Handle The National Parks System
These Kids In Oregon Just Won A Big Climate Change Victory


text:
Fetal and Maternal Medicine Review (3)
Cambridge Quarterly of Healthcare Ethics (1)
Journal of Dairy Research (1)
Royal College of Psychiatrists (11)
HTAi Organizational Members (1)
Royal College of Obstetricians and Gynaecologists Study Group (31)
Royal College of Obstetricians and Gynaecologists Advanced Skills (2)
Cambridge Texts in the History of Political Thought (1)
Cambridge Textbooks (1)
Chapter 18A - Management of Obstetric Hemorrhage: Obstetric Management
from Section 7 - Hemorrhagic Disorders
By Annette Briley, Susan Bewley
Edited by Sue Pavord, University of Oxford, Beverley Hunt, King's College London
Book: The Obstetric Hematology Manual
Print publication: 08 February 2018, pp 197-205
Chapter 2 - Domestic Violence in Pregnancy (Content last reviewed: 15th February 2018)
from Section 1 - Prepregnancy Problems
By Joanna R. Cook, Loraine J. Bacchus, Susan Bewley
Edited by David James, University of Nottingham, Philip Steer, Imperial College London, Carl Weiner, University of Kansas, Bernard Gonik, Wayne State University, Detroit, Stephen Robson
Book: High-Risk Pregnancy
Published online: 15 November 2017, pp 35-45
Chapter 8 - Domestic Violence and Abuse
from Section 1 - Generic Issues
By Rachel Adams, Susan Bewley
Edited by Leroy C. Edozien, P. M. Shaughn O'Brien
Book: Biopsychosocial Factors in Obstetrics and Gynaecology
Print publication: 24 August 2017, pp 54-65
Edited by Fiona Subotsky, Susan Bewley, Michael Crowe
Book: Abuse of the Doctor-Patient Relationship
Published by: Royal College of Psychiatrists
Published online: 25 February 2017, pp v-vi
List of figures, tables and boxes
Published online: 25 February 2017, pp vii-viii
Appendix 2 - Codes of ethics of psychiatric associations in other countries
Published online: 25 February 2017, pp 206-207
Canadian Psychiatric Association: position statement on sexual misconduct
The four points quoted below comprise the position statement submitted by the Professional Standards and Practice Council to the Board of Directors of the Canadian Psychiatric Association and was approved in 1995, when it replaced 1985 statement (online at http://publications.cpa-apc.org/media. php?mid=188&xwm=true).
• The Canadian Psychiatric Association deems sexual activity of any kind between a psychiatrist and his or her patient to be sexual misconduct and unacceptable in any circumstances.
• The Canadian Psychiatric Association deems any form of sexualisation by the psychiatrist of the psychiatrist–patient relationship to be unethical.
• The Canadian Psychiatric Association presumes sexual relationships with former patients to be unethical.
• Any member of the Canadian Psychiatric Association losing a medical licence as a result of sexual misconduct will have his or her membership in the Association revoked.
American Psychiatric Association: 'Principles of medical ethics'
The four points quoted below are taken from 'Principles of medical ethics, with annotations especially applicable to psychiatry', published by the American Psychiatric Association in November 2003 as an amended edition of a document first published in 2001:
• The requirement that the physician conduct himself/herself with propriety in his or her profession and in all the actions of his or her life is especially important in the case of the psychiatrist because the patient tends to model his or her behavior after that of his or her psychiatrist by identification.
• Further, the necessary intensity of the treatment relationship •• may tend to activate sexual and other needs and fantasies on the part of both patient and psychiatrist, while weakening the objectivity necessary for control.
• Additionally, the inherent inequality in the doctor–patient relationship may lead to exploitation of the patient.
• Sexual activity with a current or former patient is unethical.
Introduction: mapping the territory
By Fiona Subotsky, Royal College of Psychiatrists, London, Susan Bewley, St Thomas' Hospital, London, Michael Crowe, King's College London, London
Published online: 25 February 2017, pp 1-6
The breaking of boundaries in doctor–patient relationships has been discussed in many recent publications, mainly from North America, Australia and New Zealand, where there have also been extensive modifications to codes of medical practice as a result (see Sarkar, 2004). In view of the lessons learned from recent scandals, it is timely to write about the British experience, especially as the delivery of healthcare, the legal and financial contexts, and even the favoured theoretical understandings are so different. In this book, we have concentrated on the paradigm case of the breaching of sexual boundaries, although other areas of transgression are also discussed. The greatest risk appears to exist in the specialties of psychiatry, gynaecology and general practice, and so it is appropriate that this educational book has a multidisciplinary authorship and editorship.
The genesis of the book was in the Royal College of Psychiatrists' need to respond to both the process and the recommendations of the Kerr/Haslam Inquiry. This formal inquiry, chaired by Nigel Pleming QC, examined how, despite complaints of sexual abuse by patients over many years, two male psychiatrists working from the same hospital in the north of England were able to continue professionally without challenge (Department of Health, 2005; Kennedy, 2006). By reflecting on these events and other cases of boundary transgression, we hope readers may help avoid the repetition of such occurrences.
Are we perhaps too optimistic that people are interested in the topic of abuse within the doctor–patient relationship? After all, the public response to the final report of the Kerr/Haslam Inquiry was very muted. On the other hand, heightened interest in particularly shocking cases seems only to raise denial or distancing from the profession, and demands for extreme punishment and increased regulation from others. Between these two extremes doctors must recognise that it is by being aware of the need for professional boundaries that the vital trust of the public may be maintained. Thus, the Royal College of Physicians' report (2005) Doctors in Society: Medical Professionalism in a Changing World defines professionalism as: 'a set of values, behaviours and relationships that underpins the trust the public has in doctors'.
Unequal relationships
Abuses, and taboos to prevent them, do not occur in medicine alone. Any unequal relationship has the potential for sexual abuse and abuse of power built into it.
Published online: 25 February 2017, pp ix-x
Appendix 5 - Website resources and information
Royal College of Psychiatrists
Psychiatrists' Support Service
http://www.rcpsych.ac.uk/member/psychiatristssupportservice.aspx
Resource Catalogue
http://www.rcpsych.ac.uk/mentalhealthinfoforall/moreinformation/ordermaterials.aspx
Good Psychiatric Practice (3rd edition) (Council Report CR154), 2009. http://www.rcpsych.ac.uk/publications/collegereports/cr/cr154.aspx
Vulnerable Patients, Vulnerable Doctors. Good Practice in Our Clinical Relationships (Council Report CR146), 2007. http://www.rcpsych.ac.uk/publications/collegereports/cr/cr146.aspx
Sexual Boundary Issues in Psychiatric Settings (Council Report CR 145). http://www.rcpsych.ac.uk/publications/collegereports/cr/cr145.aspx
Major inquiries
Ayling Inquiry report, 2004
http://www.dh.gov.uk/en/Publicationsandstatistics/Publications/PublicationsPolicyAndGuidance/DH_4088996
Independent Investigation into the Conduct of David Britten, 2008 http://www.verita.net/pages/our_work/107/verita.html
The Kerr/Haslam Inquiry, 2005
The Neale Inquiry, 2004
The Ritchie report, 2000 (concerning Rodney Ledward)http://www.dh.gov.uk/en/Publicationsandstatistics/Publications/PublicationsPolicyAndGuidance/DH_4093337
The Shipman Inquiry, 2002
http://www.the-shipman-inquiry.org.uk/reports.asp
Council for Healthcare Regulatory Excellence (CRHE)
http://www.chre.org.uk
Reports from the CHRE
Clear Sexual Boundaries http://www.chre.org.uk/satellite/133
Gives access to:
• Guidance for Patients on Clear Sexual Boundaries With Healthcare Professionals
• Clear Sexual Boundaries Between Healthcare Professionals and Patients: Responsibilities of Healthcare Professionals
• Clear Sexual Boundaries Between Healthcare Professionals and Patients: Guidance for Fitness to Practise Panels
• Learning About Sexual Boundaries Between Healthcare Professionals and Patients: A Report on Education and Training
• Sexual Boundary Violations by Health Professionals – An Overview of the Published Empirical Literature
Clinic for Boundary Studies (formerly Witness)
http://professionalboundaries.org.uk
General Medical Council (GMC)
http://www.gmc-uk.org
http://www.npsa.nhs.uk
Public Concern at Work (PCAW)
http://www.pcaw.co.uk
Published online: 25 February 2017, pp i-iv
Appendix 1 - Extract from Vulnerable Patients, Safe Doctors
The following is taken from Vulnerable Patients, Safe Doctors: Good Practice in Our Clinical Relationships (Royal College of Psychiatrists, College Report CR146, 2007). Although the boundaries of the psychiatric encounter are described below, the principles hold for boundaries of all doctor–patient encounters and similarly for the avoidance of boundary violations.
Boundaries of the psychiatric encounter
A number of features help to provide the boundaries of the psychiatric professional encounter, all of which are the responsibility of the psychiatrist. These include:
• setting (hospital, clinic, care home or family home)
• time (usually within agreed service hours)
• duration (agreed and consistently maintained)
• use of appropriate professional language
• appropriate professional dress and insignia
• limited and socially sanctioned physical touch
• the patient's mental health needs, not social or sexual needs, being taken as paramount.
There is clear evidence that even minor violations of these boundaries may be damaging to patients. Some are unacceptable in any circumstances, while others are not always clearly harmful to patients. Even those not unequivocally harmful should raise questions for the doctor or patient about their appropriateness, but may not be finally judged except in their detailed context.
The commonest boundary violations are non-sexual, and include inappropriate self-disclosure, involving the patient in a dual role (e.g. employing a patient or a patient's relative), speaking aggressively or rudely to patients and financial exploitation. Sexual violations are less common, but often start with apparently minor boundary violations, such as unjustifiably prolonged sessions, appointments out of working hours, treatment outside the normal place of work, except where clinically justified, and (in private practice) not charging a fee. Sexual boundary violations between psychiatrists and their patients usually take place in the context of a 'special relationship', to which the patient 'assents' rather than consents; they usually come to light when the relationship ends and the patient then reports the unprofessional relationship. The General Medical Council sees sexual boundary violations by doctors as serious professional misconduct and will normally remove the doctor from the medical register.
Appendix 3 - Guidance from the Council for Healthcare Regulatory Excellence
Extract from Clear Sexual Boundaries Between Healthcare Professionals and Patients: Responsibilities of Healthcare Professionals (CHRE, 2008; http://www.chre.org. uk/_img/pics/library/0801_Clear_Sexual_boundaries_professionals.pdf).
Examples of sexualised behaviour by healthcare professionals towards patients or their carers:
• asking for or accepting a date
• sexual humour during consultations or examinations
• inappropriate sexual or demeaning comments, or asking clinically irrelevant questions, for example about their body or underwear, sexual performance or sexual orientation
• requesting details of sexual orientation, history or preferences that are not necessary or relevant
• internal examination without gloves
• asking for, or accepting an offer of, sex
• watching a patient undress (unless a justified part of an examination)
• unnecessary exposure of the patient's body
• accessing a patient's or family member's records to find out personal information not clinically required for their treatment
• unplanned home visits with sexual intent
• taking or keeping photographs of the patient or their family that are not clinically necessary
• telling patients about their own sexual problems, preferences or fantasies, or disclosing other intimate personal details
• clinically unjustified physical examinations
• intimate examinations carried out without the patient's explicit consent
• continuing with examination or treatment when consent has been refused or withdrawn
• any sexual act induced by the healthcare professional for their own sexual gratification
• the exchange of drugs or services for sexual favours
• exposure of parts of the healthcare professional's body to the patient
• sexual assault.
Appendix 4 - Examples of determinations by the General Medical Council's Fitness to Practise panels
The following eight cases, supplied by the GMC, were heard by Fitness to Practise Panels and the final determinations are given in full. They are included here to give real-life examples of doctors who breached boundaries and the GMC principles of Good Medical Practice (GMP). The GMC advises that it does not give clear thresholds between acceptable and unacceptable behaviour: each case which comes before a Fitness to Practise Panel is judged on its own merits and assessed on the particular circumstances of the case.
Cases 1 and 2 led to 12 months' suspension from the Medical Register; cases 3–8 led to erasure.
The doctor was admonished by a Medical Council outside the UK for pursuing an inappropriate relationship with a vulnerable psychiatric patient.
Relevant paragraphs of Good Medical Practice
The case relates to the Relationships with patients section of GMP, specifically paragraph 32 on maintaining trust in the profession. It also relates to the Probity section, specifically paragraphs 56 and 57 on being honest and trustworthy.
Determination on impaired fitness to practise
The Panel has now considered, on the basis of facts found proved, whether Dr X's fitness to practise is impaired, pursuant to section 35C(2)(e) of the Medical Act 1983 as amended, namely by reason of a determination by the X Medical Council to the effect that his actions amounted to professional misconduct.
The Panel has given detailed consideration to the evidence submitted, based upon the transcripts of the proceedings before the X Medical Council on [date]. It has noted the contents of text messages which passed between Dr X in [date] and a patient, Ms T, who had been under his care for a considerable period of time up to the termination of his contract in [date]. It also took account of the correspondence between Dr X and the X Medical Council and the report by Dr L [date] which was submitted to the X Medical Council Fitness to Practise Committee. The Panel has heard and accepts the evidence of Ms T's extreme vulnerability as a consequence of her social, medical and psychiatric history. That vulnerability would have been known to Dr X, even if he was not fully aware of the entirety of her history.
By Christine Bassindale, Helen Beckett, Susan J. Bewley, James A. Bloomer, Bernadette Butler, Nigel J. Callaghan, Beata Cybulska, Maureen Dalton, Vicky Evans, Carlene Firmin, Catherine Golding, Janet A. Hall, Kim Hosier, Caroline M. Jones, Nisha Krishnan, Zoe Lodrick, Lucy Love, Comfort Momoh, Mary Newton, Jason Payne-James, Karin Piegsa, Jean Price, Amrin Rahuf, Helena Thornton, Ian F. Wall, Catherine White, Katherine A. Zakhour
Edited by Maureen Dalton
Book: Forensic Gynaecology
Print publication: 09 October 2014, pp vi-viii
19 - Domestic abuse
By Nisha Krishnan, Susan J. Bewley
Print publication: 09 October 2014, pp 148-162
ADHERENCE IN PREGNANCY: A SYSTEMATIC REVIEW OF THE LITERATURE
MARY OLADEJO, SUSAN BEWLEY
Journal: Fetal and Maternal Medicine Review / Volume 23 / Issue 3-4 / November 2012
"Clinical decisions and research programs ultimately depend on the reliable and valid measurement of adherence. Yet, 50 years of research in this field have not provided the data necessary to answer critical measurement questions.".
Print publication: 01 November 2010, pp v-vi
Print publication: 01 November 2010, pp vii-viii
Print publication: 01 November 2010, pp i-iv


text:
Rush to open IRA accounts may shift economic outlook
By Ron Scherer Business correspondent of The Christian Science Monitor
In an effort to circumvent the tax man, Americans are opening up Individual Retirement Accounts (IRAs) at record rates. This surge in IRA accounts only two weeks before the final April 15 date for making contributions is bringing smiles to the bankers, brokers, and mutual-fund managers who stand to profit from them. It is a surge, they say, that is beyond their expectations.
In Boston, for example, the Fidelity Group, a mutual-fund complex, says it is opening up 10,000 new IRAs a week, compared with 3,000 a week a year ago. Kate Lorinczi, a Fidelity public-relations official, says: ''No one is getting out to lunch. We're manning the telephones.''
At Scudder Fund Distributors in New York, Dudley H. Ladd, a senior vice-president, says a huge run of new orders ''was more than we expected.'' Scudder, in fact, has brought some retired personnel back to its offices to help process the work load.
Jamie Shaw at Great Western Financial Corporation, a major thrift institution in California, says the bank has opened up 93 percent more 1982 accounts than 1981 accounts.
Nationwide, this surge in new IRAs is expected to have an impact on the economy. Mitchell Held, an economist with Smith Barney, Harris Upham & Co. says M2, one measure of the nation's money supply, should rise at a slower rate in April because of the surge. And Arnold Moskowitz, an economist at Dean Witter Reynolds Inc., says the crush of new IRA accounts could put some downward pressure on interest rates as some of the funds get invested in money-market mutual funds. Also, points out Robert Curtis, vice-president of Dollar Dry Dock Savings Bank, some of the new funds may go toward new mortgages. ''It's long-term in nature, so if it's invested in at least a three-year account, there is a likelihood it can be matched to a mortgage.''
Another Dean Witter economist, William Sullivan, points out that the boom in IRAs could result in lower tax payments to the government. At the end of March, he says, the US Treasury's cash balances were about $5 billion higher than the Treasury forecast. ''This,'' he says, ''either means the government is not spending as much money, or individuals are late filing their tax returns.'' If they are late - and continue to invest in IRAs - ''it could adversely impact the government's tax take in April and May.''
Wall Street observers also believe the big surge in investing could help to raise stock prices. ''To the extent that they are investing in stocks and bonds, it should help the stock market or help to lower interest rates,'' Mr. Moskowitz says.
Interviews in most of the major retail brokerage houses and in some large mutual-fund groups indicate investors are putting their money in the stock market. ''Last year most of the new money went into our money market fund,'' says Clark Gates, a Dreyfus Corporation official. ''This year a lot of the money is going into funds that invest in equities.'' Dreyfus is opening up 2,700 new accounts a week.
In part, the surge in new IRAs has occurred because a significantly greater number of individuals are eligible to invest. In 1981, only individuals who were not covered by an employer-sponsored pension plan were eligible to set up an IRA. However, after Congress changed the law, every income earner is now eligible to set one up.
In addition, points out Rick Lawson, assistant vice-president for product management at Security Pacific Bank in Los Angeles, last year the consumer was ''bombarded by advertising.'' This advertising, he says, ''created a lot of confusion,'' since individuals were uneducated about IRAs. Jamie Shaw of Great Western says: ''There was such a media blitz last year; it got people confused and they backed off from setting up IRAs.'' This year, Mr. Lawson says, the consumer is better informed about IRAs.
Across the country, bankers and brokers report a flood of new IRA accounts. At Merrill Lynch, for example, Donald Underwood, manager of retirement plans, says the company is opening up 5,000 new IRA accounts a day, and ''The numbers are rising every day.'' Many people, he notes, are opening up IRA accounts for both 1982 and 1983. And, in some cases, couples are making this investment, which amounts to $4,000 apiece.
The same is true at E.F. Hutton, where Gary Strum, first vice-president, states: ''We are doing as well as Merrill or better.'' As the April 15 deadline approaches, he says, ''IRA business is just walking in the door.'' One young E.F. Hutton account executive has opened up 250 new accounts in the last 31/2 weeks - and he has only reached the letter F in his list of customers.
At Shearson-American Express, Richard Weisshappel, director of the personal client-services group, says the IRA business is 30 to 35 percent ahead of last year.
Moreover, in the next two weeks everyone expects the business to get better. Comments Mr. Strum, ''People tend to wait until the last moment if it involves writing a check.''
In addition, advertising is beginning to pick up. Robert Hutchinson, a vice-president at Manufacturers Hanover Trust in New York, says he plans to start running newspaper and magazine adds to spark more interest. So far this year, the bank's IRA accounts are running 50 percent ahead of last year's pace. The same is true at Security Pacific, where, Mr. Lawson says, new accounts are up 50 percent. And in the next two weeks he expects more new accounts, since the bank just completed a mailing to 250,000 credit-card customers that included the suggestion that they fund the investment by borrowing against their line of credit.
For those who truly wait until the last minute, there is still hope. At Charles Schwab & Co., a discount brokerage house, the company plans to stay open until midnight, April 15. ''I don't know the number of people who wait until the last day to file a tax return,'' Mr. Schwab remarked. But he added, ''I've done it myself, and I do know the opportunity to list a last-minute deduction would have often been a big help to me.''
Here's how you can invest $20,000
How does a mutual fund work?
How is an HSA different from a regular savings account?


text:
Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility
Correa, Jose, Dütting, Paul, Fischer, Felix, Schewior, Kevin and Ziliotto, Bruno (2020) Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility. In: Proceedings of the 12th Innovations in Theoretical Computer Science Conference, ITCS'21, forthcoming. ACM Press. (In Press)
Text (Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility) - Accepted Version
Pending embargo until 1 January 2100.
A prophet inequality states, for some α ∈ [0, 1], that the expected value achievable by a gambler who sequentially observes random variables X1, . . . , Xn and selects one of them is at least an α fraction of the maximum value in the sequence. We obtain three distinct improvements for a setting that was first studied by Correa et al. (EC, 2019) and is particularly relevant to modern applications in algorithmic pricing. In this setting, the random variables are i.i.d. from an unknown distribution and the gambler has access to an additional βn samples for some β ≥ 0. We first give improved lower bounds on α for a wide range of values of β; specifically, α ≥ (1 + β)/e when β ≤ 1/(e − 1), which is tight, and α ≥ 0.648 when β = 1, which improves on a bound of around 0.635 due to Correa et al. (SODA, 2020). Adding to their practical appeal, specifically in the context of algorithmic pricing, we then show that the new bounds can be obtained even in a streaming model of computation and thus in situations where the use of relevant data is complicated by the sheer amount of data available. We finally establish that the upper bound of 1/e for the case without samples is robust to additional information about the distribution, and applies also to sequences of i.i.d. random variables whose distribution is itself drawn, according to a known distribution, from a finite set of known candidate distributions. This implies a tight prophet inequality for exchangeable sequences of random variables, answering a question of Hill and Kertz (Contemporary Mathematics, 1992), but leaves open the possibility of better guarantees when the number of candidate distributions is small, a setting we believe is of strong interest to applications.
https://dl.acm.org/conference/itcs
© 2020 ACM, Inc
Q Science > QA Mathematics > QA75 Electronic computers. Computer science


text:
using System.Configuration;
using System.Web.Caching;
using System.Collections.Generic;
using PetShop.ICacheDependency;

namespace PetShop.CacheDependencyFactory {
    /// <summary>
    /// This class is provided to ease the usage of DependencyFactory from the client.
    /// It's main usage is to determine whether to invoke the DependencyFactory.
    /// When no assembly is specified under CacheDependencyAssembly section in configuraion file,
    /// then this class will return null
    /// Notice that this assembly reference System.Web
    /// </summary>
    public static class DependencyFacade {
        private static readonly string path = ConfigurationManager.AppSettings["CacheDependencyAssembly"];

        public static AggregateCacheDependency GetCategoryDependency() {
            if (!string.IsNullOrEmpty(path))
                return DependencyAccess.CreateCategoryDependency().GetDependency();
            else
                return null;
        }

        public static AggregateCacheDependency GetProductDependency() {
            if (!string.IsNullOrEmpty(path))
                return DependencyAccess.CreateProductDependency().GetDependency();
            else
                return null;
        }

        public static AggregateCacheDependency GetItemDependency() {
            if (!string.IsNullOrEmpty(path))
                return DependencyAccess.CreateItemDependency().GetDependency();
            else
                return null;
        }
    }
}

redpajama_set_name: RedPajamaGithub


Mark Schlagel, 64, passed away at his home in Santa Barbara surrounded by family and friends after a short battle with cancer.
crazy. As if he was taking flight. Fly free my brother, fly free! You will always be in our hearts!!!
Born and raised in Santa Barbara, Mark attended Dolores & Jefferson Elementary, SB Jr. High, and SB High School class of 71. He excelled on the water polo team and also played the saxophone in a band. Go Dons! He went on to graduate from SBCC.
Mark worked side by side with his brother at Mike Schlagel Concrete for 35+ years and will be dearly missed by all who worked with him. He loved surfing back in the day, traveled Europe on his motorcycle, loved to play golf, played softball most of his life with the local softball community starting way back with the La Bamba team in the 70's. He liked fishing, live music and dancing, telling a joke, creating projects but mostly finishing them, doing crosswords, reading, going on adventures with Deb and his friends & was a pro at Guesstures & jigsaw puzzles at family parties.
Mark had a sense of humor, lived his life from his heart and was kind and thoughtful. It seemed like he was always helping someone out. We lost one of the good guys! Mark left his 'mark' on us all and we will forever be touched by his loving spirit.
Mark passed on his mother's birthday, who preceded him in death 8 years. He is survived by his father, Don Schlagel; sister Teresa; brothers Mike & wife Lisa, Jerry & Randy; nieces Alexandra, Michele & Emily and nephew Preston; his best friend, partner in crime and wife Deb (who he tied the knot with this past Valentines Day) and her family; Tammy Schlagel and family; many cousins and close friends who loved him dearly, and all the kids and adults who called him 'Uncle Mark'. A special thanks to his friends: Joe, Brah, Sammy, Billy, and the Rest of the 'A Team' for being there 24-7 in the final days.
Also thanks to the professional and compassionate people at the Cancer Center of Santa Barbara and Hospice of Santa Barbara who provided us with care, support and love.
A Celebration of Life will be held on Sunday, April 23 from 11-3pm at lower Manning Park. For more information check out YouCaring.com or Mark Schlagel Memorial facebook pg.


text:
An urgent appeal for the people of Syria
The scale of the destruction in Syria was brought home to me recently when I watched a video circulating on social media. Taken from a drone, it shows in graphic detail what five years of conflict have done to Syrian cities like Aleppo and Homs.
Those haunting images – houses, streets, entire suburbs reduced to piles of rubble – made me wonder how anyone could still be living in these places. No wonder nearly 5 million Syrians have sought safety across the border. No wonder this war has become the greatest humanitarian crisis of our time and UNHCR's largest ever relief operation.
For five years, UNHCR has led the international relief effort for Syrians living as refugees in neighbouring Jordan, Lebanon, Turkey and Iraq. We've been working on the frontline, providing protection, relief and services to displaced families living in camps and in the community as urban refugees.
We are also helping the 6.5 million people who are displaced inside Syria and struggling to survive in a warzone. In recent months UNHCR has been able to expand these internal operations, leading cross-line relief missions to deliver essential supplies to people in stricken suburbs of Aleppo and Damascus as well as many hard-to-reach and besieged villages and towns.
I know it's easy to feel overwhelmed by the sheer scale of this crisis. We need to remind ourselves that behind the daunting statistics are the stories of individual people.
People like 4-year-old Ahmed who has never known peace. Born just after the conflict began, this bright little boy has grown up in a collective shelter in the besieged city of Aleppo. His family lives in a tall unfinished building with no walls where he is often exposed to rain and cold winds, as well as the danger of falling to the streets below.
Ahmad was very excited in February when a relief convoy finally made it through to his part of the city. "I am waiting for my parents to get my blanket and winter clothes," he told my UNHCR colleagues at the distribution centre. "Yes, all I need during this cold weather is that grey blanket and those new clothes. Today I am very happy to get them."
We hear the stories of so many people like this across the Syrian region.
People like 12-year-old Ivra who, living in a camp in Turkey, is losing all hope of fulfilling her dreams of the future. She used to spend her free time with her friends in Kobane, listening to One Direction and dreaming of becoming a famous singer. She doesn't know exactly where her friends are now. They are scattered in camps and dwellings across the region. Ivra treasures the time she spends at school in the refugee camp but because the school is so overcrowded, she can only stay there for four hours a day. She doesn't hold high hopes for where this education could take her.
People like Hamda who, at the age of 106, never imagined she'd be living out her days in a rented room in Lebanon with the power disconnected. "At first we only heard bombing in the distance, but within a few weeks they were upon us," she says sadly, recalling the day her entire town was destroyed. "Maybe it's a good thing that God took my eyesight before I saw the destruction of my country."
These are some of the many thousands of people who will benefit from our new Syria Emergency Appeal. Australia for UNHCR supporters have made a major contribution to the relief effort over the past five years, contributing more than AU$4 million in shelter, essential relief items and vital services like health care and schools for Syrian refugees.
Please give generously to provide a lifeline for families struggling to survive the fallout of this terrible war.
An urgent appeal for the people of SyriaThe scale ...