text:
Introducing: BruDa, a new pan-European restaurant from two Little Italy vets
By Gizelle Lau | December 21, 2011
By Gizelle Lau | 12/21/2011
Inside BruDa, once home to Negroni (and, briefly, Carpano)
Little Italy has seen a brisk changing of the guard in the past couple years, with the rise of new buzzy spots like Woodlot, Acadia and Frank's Kitchen. A couple weeks ago, Neil Da Costa and Victor Brum, two veterans of the neighbourhood who first met at Trattoria Giancarlo, opened BruDa in the space that long held Negroni (and briefly held Carpano). Rather than pigeonholing themselves into specifically Italian, French or Spanish cuisine, they describe their restaurant's menu as "European."
Da Costa and Brum renovated the space themselves, creating a large, open-concept room with high charcoal ceilings and classic white walls, which house artwork by local artists like Nadia Lloyd and Loredana Blandisi. At the heart of the restaurant is an open kitchen helmed by executive chef Gordon Calman, whose most recent stint was at the Inn on the Twenty in Jordan. Calman aims to bring some of that wine country sensibility to his approachable menu here, with dishes that are simple yet refined.
The lunch menu is casual, with items like like wild mushroom bisque ($8), a smoked ham hock sandwich ($12) and chef-rolled gnocchi with truffle, Brussels sprouts and Ontario burrata ($14). At dinnertime, there are classic seared scallops ($13), slow-cooked spiced rabbit served on a potato cake ($10) and double-smoked pork tenderloin in a coffee-fig reduction ($17). The wine menu, chosen by Brum (who's also a sommelier), includes European as well as Canadian selections. Just don't ask for a negroni at the bar.
(Image: Gizelle Lau)
Fish stew with monkfish and French beans ($17)
Introducing: BruDa
https://torontolife.com/wp-content/uploads/2011/12/bruda-fish-stew-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-fish-stew.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-fish-stew/
bruda-fish-stew
Smoked ham hock sandwich with gruyère, clothbound cheddar and a side salad ($12)
https://torontolife.com/wp-content/uploads/2011/12/bruda-ham-hock-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-ham-hock.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-ham-hock/
bruda-ham-hock
Slow-cooked spiced rabbit with potato cake and micro greens ($10)
https://torontolife.com/wp-content/uploads/2011/12/bruda-rabbit-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-rabbit.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-rabbit/
bruda-rabbit
Executive chef Gordon Calman's open kitchen
https://torontolife.com/wp-content/uploads/2011/12/bruda-kitchen-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-kitchen.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-kitchen/
bruda-kitchen
https://torontolife.com/wp-content/uploads/2011/12/bruda-table-2-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-table-2.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-table-2/
bruda-table-2
The long family table
https://torontolife.com/wp-content/uploads/2011/12/bruda-table-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-table.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-table/
bruda-table
https://torontolife.com/wp-content/uploads/2011/12/bruda-inside-96x96.jpg
https://torontolife.com/wp-content/uploads/2011/12/bruda-inside.jpg
https://torontolife.com/food/restaurants/introducing-bruda/slide/bruda-inside/
bruda-inside
BruDa, 492 College St., 416-927-0222, brudarestaurant.com
Topics: BruDa Little Italy Negroni New Restaurants Openings Restaurants Toronto Trattoria Giancarlo
4 thoughts on "Introducing: BruDa, a new pan-European restaurant from two Little Italy vets"
J Fin says:
Stay clear – – Manager was extremely rude, food was middling, but not worth the price or the attitude. Carbonera was weak. "Brined chicken" was dry and just tasted like salt.
SaraD says:
Went for Saturday night dinner with my family, and was greeted by a warm and friendly atmosphere. It was our visit, and luckily we beat the rush. We each tried a different appetizer+entree selection so that we could sample as much of the menu as possible. All of us were intregued and very satisfied with all dishes! Favourites include the seared scallops, the wild mushroom bisque, the new world carbonara, and the smoked pork tenderloin.
Definitely return visits are in the future!!
We had a great evening here. The wine list was great, so much more diverse than most new places in the city. The relaxed atmosphere was really welcoming. The food was good but it was really all elements together that made BruDa memorable.
EcologyProf says:
Just ran into Bruda for lunch today after standing in line at the Service Ontario office a few doors west, to renew my plate sticker.
I was blown over by the delicacy of the gnocchi and the fabulous home made ice-cream that I had – very reasonable prices. Superbly executed. Way to go, Neil and colleagues.


So everyone's waiting for election results in Delhi. I'm not from Delhi but i still want Kejriwal to win the elections. Sure, he did a mistake by turning his back last time but then everyone deserves a second chance. And that is not big a crime compared to a few other politicians.
The reason I support Kejriwal is that he truly wants to remove corruption. We should stop making an issue if he travels in a business class or has a luxurious house and rather look into what he is willing to do for our country. I mean if he really wanted all these luxuries, he could have already got them with all the fat pay his previous job could potentially earn him. You call him a liar, a 'bhagoda' or anything but i still feel he deserves a second chance and he surely will do good to Delhi.
Remember how in his 49 days, he worked even when he was ill? How your electricity bills went down suddenly in his rule?
These are my views and opinions. You are entitled to yours.
Isn't it a beauty? I recently bought this clutch from an online site . The packaging and delivery was very good. I have been a regular customer and never faced any issues in my orders. But this particular clutch, i totally LOVE IT.
I carried it to a friend's wedding and got compliments from many people. It's a very nice and classy piece and it's worth the amount paid. Looks beautiful and has a small handle too that can be squeezed inside itself when u feel like.
P.S. Name of the site has been removed because later had a very bad shopping experience with them.
Well, I personally don't find this day so special. Not because I don't have a someone special, but because I don't believe that love should be expressed on just one day. I mean why do you need to express your love on a specific day even if you don't feel like? Love has feelings and a mere day cannot make them grow or fade away. Isn't it?
For me every day is a special day and one should express their feelings only when they feel like.
I would rather speak out my feelings to my special someone when I feel it. But then ofcourse, everyone has a different view.
Welcome to my blog. Here i post all about me - my life, my experiences, my shopping, my views, my achievements (yet to come :P) and what not!
I'm a CA Final student. I believe in living life my way and i am a very cheerful person. I have lots of friends and i love hanging out with them, not that i do it all the time.
Copyright 2015. Simple theme. Powered by Blogger.


text:
\section{}

\section{Preliminaries}\label{intro}

The Polya urn problem describes a well-studied family of random processes that have been fruitfully applied in diverse fields ranging from telecommunications to understanding self-organizing processes like network formation and herd behavior.
In the classical Polya urn problem, one begins with $d$ bins, each containing one ball. Additional balls arrive one at a time, and the probability that an arriving ball is placed in a given bin is proportional to $m^\gamma$, where $m$ is the number of balls in that bin.

In this note, we consider the case of $\gamma = 1$, which corresponds to a process of ``proportional preferential attachment'' and is a critical point with respect to the limit distribution of the fraction of balls in each bin.
It is well known that for $\gamma < 1$ the fraction of balls in the ``heaviest'' bin (the bin with the most balls) tends to $1/d$, and for $\gamma > 1$ the fraction of balls in the ``heaviest'' bin tends to $1$. (See, for instance, surveys such as \citep{Chung2003} and \citep{Pemantle2007} or books such as \citep{JohnsonKotz1977} and \citep{Mahmoud2008}.) Unexpectedly, though scientists and engineers are interested in analogous quantities such as ``the size of the largest (biological) plague'', this question has not been explored for the case of $\gamma=1$.

The modest contribution of this note is to explore that very problem. We characterize the limit distribution of the fraction of balls in the ``heaviest'' bin for $\gamma=1$ by providing explicit analytical expressions for all its moments.

\section{The Main Result}\label{main}

Denote the number of balls in the ``heaviest'' urn (when there are $d$ urns), after a total of $n-d \ge 0$ balls are added, as $H_d(n)$. For integer $m \ge 0$ and integer $d \ge 1$, let
\begin{equation}\label{frac_def}
	M^{(m)}_d := \lim_{n\rightarrow\infty}\Ex{\left(\frac{H_d(n)}{n}\right)^m}.
\end{equation}
For notational convenience, let $M_0^{0} := 1$. We note that there are three equivalent ways of describing $M^{(m)}_d$:

\begin{proposition}[Limiting Moments of the Fraction of Balls in the ``Heaviest'' Urn]\label{prop_asymp_frac_exp}
	For $m\ge 1$ and $d \ge 2$,
	\begin{equation}\label{asymp_frac_moments_1}
		M^{(m)}_d
		= \sum_{k=0}^{m}{
			\frac{d-1}{d^k}
			\frac{m!}{(m-k)!}
			\frac{(m+d-k-2)!}{(m+d-1)!}
			M^{(m-k)}_{d-1}
		},
	\end{equation}
	\begin{equation}\label{asymp_frac_moments_2}
		M^{(m)}_d
		= \frac{d-1}{m+d-1} M^{(m)}_{d-1} + \frac{m}{d(m+d-1)} M^{(m-1)}_d, {\rm\ and}
	\end{equation}
	\begin{equation}\label{asymp_frac_moments_3}
		M^{(m)}_d
		= \frac{m}{m+d-1} \sum_{j=1}^{d}{ \frac{(d-1)!}{j!} \frac{(m+j-2)!}{(m+d-2)!} M^{(m-1)}_j}.
	\end{equation}
\end{proposition}

This result is an explicit characterization in the sense that the computations to be done using either of equations (\ref{asymp_frac_moments_1}) thru (\ref{asymp_frac_moments_3}) are explicit (typically simple arithmetic) rather than implicit (e.g.: solving a system of equations).
One readily observes that this is so because the next $M^{(m)}_d$ to be computed depends only on already computed moments. (It is clear that $M^{(0)}_d = 1$ for all $d\ge 1$ and $M^{(m)}_1 = 1$ for all $m\ge 1$.)

The first and second moments being typically of special interest, we may use equation (\ref{asymp_frac_moments_3}) to compute them:
\begin{corollary}[Limiting Mean/Second Moment of the Fraction of Balls in the ``Heaviest'' Urn]\label{cor_asymp_frac_mean_2M}
	\begin{equation}\label{asymp_frac_mean}
		\frac{1}{d}\log d \le M^{(1)}_d = \frac{1}{d}\sum_{k=1}^{d}{\frac{1}{k}} \le \frac{1}{d} (\log d + 1)
	\end{equation}
	and
	\begin{equation}\label{asymp_frac_2M}
		M^{(2)}_d = \frac{2}{d(d+1)} \sum_{j=1}^{d}{ M^{(1)}_j }
			= \frac{2}{d(d+1)} \sum_{j=1}^{d}{ \frac{1}{j} \sum_{k=1}^{j}\frac{1}{k} }.
	\end{equation}
\end{corollary}
Both ``scale like'' $d^{-1} \log d$.
Direct computation reveals that the coefficient of variation (the ratio of the standard deviation to the mean) of the fraction of balls in the ``heaviest'' urn rises to a peak of about 0.27 at $d=10$ after which it begins to decline with increading $d$ to a limiting value of $0$.

More generally, though the recurrences enable us to obtain expressions for any given moment by iterated substitution, there does not appear to be any special structure that enables drastic simplification. This is unfortunate.

Before proceeding to the prove Proposition \ref{prop_asymp_frac_exp}, we reproduce, for completeness, the following well known result on the distribution of the number of balls in each bin:

\begin{lemma}\label{lemma_pref_attach_uniform}
	The number of balls in the $d$ urns after $m$ additional balls are added is uniformly distributed on
\begin{equation}
	S_{(d,m)} := \{v \in \mathbb{Z}^d: v \ge e, v^T e = d+m\}.
\end{equation}
Furthermore,
\begin{equation}\label{eq_num_states}
	|S_{(d,m)}| = \frac{(m+d-1)!}{m!(d-1)!} = \left( m + d - 1 \atop d - 1\right).
\end{equation}
\end{lemma}
{\noindent\bf Proof of Lemma \ref{lemma_pref_attach_uniform}:}
Let the probability that $v_k$ balls are in the $k$-th urn (of $d$) after $m$ additional balls are added be $\pi_{(d,m)}(v)$. Clearly, $\pi_{(d,0)}(e) = 1$.
If $\pi_{(d,m)}(v) = \eta_{(d,m)}$ for some constant $\eta_{(d,m)}$ for all $v \in S_{(d,m)}$. Then, for all $v\in S_{(d,m+1)}$,
\begin{align}
	\pi_{(d,m+1)}(v)
		& = \sum_{v_k > 1} { \eta_{(d,m)} \frac{v_k - 1}{m+d} } \nonumber\\
		& = \sum_{k=1}^{d} { \eta_{(d,m)} \frac{v_k - 1}{m+d} } \nonumber\\
		& = \eta_{(d,m)} \frac{m+1}{m+d} \label{eq_num_states_inv} \\
		& =: \eta_{(d,m+1)} \nonumber
\end{align}
where the first equality follows from the dynamics of preferential attachment.
Now, $|S_{(d,m)}| = 1/\eta_{(d,m)}$, and $|S_{(d,0)}| = 1$. Therefore, by equation (\ref{eq_num_states_inv}),
\begin{equation*}
	S_{(d,m)} = 1\cdot\frac{d}{1}\cdot\frac{d+1}{2}\ldots \frac{m+d-1}{m}
\end{equation*}
and the proof is complete.
\hfill$\blacksquare$

Subsequently, Lemma \ref{lemma_pref_attach_uniform} and a simple partitioning of the set of possible outcomes ($S_{(d,m)}$, a discrete simplex) will be used to characterize the limiting distribution of the fraction of balls in the ``heaviest'' urn. We will also make use of the easily verifiable fact that:

\begin{lemma}\label{simple_lemma}
	For integer $a,b>0$ and real-valued $c>0$,
	\begin{equation}\label{simple_lemma_eq}
		\int_{0}^{c}{x^a (c-x)^b\;dx} = \frac{a! b!}{(a+b+1)!} c^{a+b+1}.
	\end{equation}
\end{lemma}

{\noindent\bf Proof of Proposition \ref{prop_asymp_frac_exp}:}
Clearly, $M^{(0)}_d = 1$ and $M^{(m)}_1 = 1$.
For cases where $m > 0$ and/or $d > 1$, an expression for the desired moment for finite $n$ will be constructed, and the limit as $n\rightarrow\infty$ evaluated.

Now, the set $S_{(d, (\alpha-1)d )}$ (for $\alpha\in\mathbb{N}$), as defined in Lemma \ref{lemma_pref_attach_uniform}, may be expressed as the following disjoint union:
\begin{equation*}
	S_{(d, (\alpha-1)d )} = \{\alpha e\} \cup
		\bigcup_{\mu=1}^{\alpha - 1} \bigcup_{\tau=1}^{d - 1} T_{(\alpha, d, \mu, \tau)}
\end{equation*}
where
$
	T_{(\alpha, d, \mu, \tau)} := \{v \in \mathbb{Z}^d: v \ge \mu e, v^T e = \alpha d, \gamma(v, \mu) = \tau\}
$
and $\gamma(v,x) := | \{k : v_k = x\} |$ is the number of entries of the vector $v$ with the value $x$. This is so because there is a single vector in $S_{(d, (\alpha-1)d )}$ where all entries take the same value ($\alpha e$), and $\alpha-1$ other possible values of the smallest entry of vectors in $S_{(d, (\alpha-1)d )}$ (specifically, $1, 2, \ldots, \alpha - 1$). In each of the latter cases, the number of entries taking on the minimum value may range from $1$ to $d-1$.

Noting that vectors in $T_{(\alpha, d, \mu, \tau)}$ each have $\tau$ entries taking value $\mu$, and $d-\tau$ entries taking values strictly larger than $\mu$, the cardinality of $T_{(\alpha, d, \mu, \tau)}$, must be $|S_{(d-\tau, (\alpha-\mu)d - (d-\tau) )}|$ multiplied by the number of ways to pick the $\tau$ entries taking value $\mu$. Therefore, using Lemma \ref{lemma_pref_attach_uniform}, one may deduce that
\begin{equation}\label{cardinality_of_T}
	|T_{(\alpha, d, \mu, \tau)}| = |S_{(d-\tau, (\alpha-\mu)d - (d-\tau) )}| \left( d \atop \tau \right) = \left( (\alpha - \mu) d - 1 \atop d - \tau - 1\right) \left( d \atop \tau \right).
\end{equation}
Thus one obtains the identity
$
		\left( \alpha d - 1 \atop d - 1\right) = 1 + \sum_{\mu=1}^{\alpha - 1} \sum_{\tau=1}^{d - 1} \left( (\alpha - \mu) d - 1 \atop d - \tau - 1 \right) \left( d \atop \tau \right)
$
which, itself, may be proven directly by induction.

Now, equation (\ref{frac_def}) may be written equivalently as
\begin{equation}\label{asymp_frac_exp2}
	\Ex{H_d(n)^m} = M^{(m)}_d n^m + o(n^m)
\end{equation}
for integer $m\ge 1$.
Equation (\ref{asymp_frac_exp2}) clearly holds for $d=1$.
Now, suppose that equation (\ref{asymp_frac_exp2}) is true for $1, 2, \ldots, d-1$ urns. Using the fact that conditional on realizations being in $T_{(\alpha, d, \mu, \tau)}$, the uniform probability of outcomes implies that the distribution of $H_{d}(n)$ is identical to the (unconditional) distribution of $H_{d-\tau}((\alpha - \mu) d) + \mu$, the $m$-th moment of the number of balls in the ``heaviest'' urn is given by
\begin{align}
	\Ex{H_{d}(n)^m \big| T_{(\alpha, d, \mu, \tau)}}
	& = \Ex{(H_{d-\tau}((\alpha - \mu) d) + \mu)^m} \nonumber\\
	& = \sum_{k=0}^{m}{ \left( m \atop k \right)M^{(m-k)}_{d-\tau} ((\alpha - \mu) d)^{m-k} \mu^k} + o(\alpha^m) \label{eqn_conditional_moments}
\end{align}
following an application of equation (\ref{asymp_frac_exp2}).
Through equation (\ref{cardinality_of_T}), we obtain
\begin{equation}\label{the_expectation}
	\Ex{\left(\frac{H_{d}(\alpha d)}{\alpha d}\right)^m}
		=
	\frac{1}{(\alpha d)^m}
	\frac{1}{\displaystyle\left( \alpha d - 1 \atop d - 1\right)}
	\left[
	\displaystyle\alpha^m + \sum_{\mu=1}^{\alpha - 1} \sum_{\tau=1}^{d - 1}

	\Ex{H_{d}(n)^m \big| T_{(\alpha, d, \mu, \tau)}}
	\left( (\alpha - \mu) d - 1 \atop d - \tau - 1 \right) \left( d \atop \tau \right)
	\right].
\end{equation}
Subsequently, taking limits,
\begin{align*}
	\lim_{\alpha\rightarrow\infty} \Ex{\left(\frac{H_{d}(\alpha d)}{\alpha d}\right)^m}
		& = \lim_{\alpha\rightarrow\infty} \frac{1}{(\alpha d)^m}
			\frac{1}{\displaystyle\left( \alpha d - 1 \atop d - 1\right)}
			\left[

			\displaystyle\alpha^m + \sum_{\mu=1}^{\alpha - 1} \sum_{\tau=1}^{d - 1}
			\Ex{H_{d}(n)^m \big| T_{(\alpha, d, \mu, \tau)}}
			\left( (\alpha - \mu) d - 1 \atop d - \tau - 1 \right)
			\left( d \atop \tau \right)
			\right]\\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{
			\displaystyle\alpha^m + \sum_{\mu=1}^{\alpha - 1} \sum_{\tau=1}^{d - 1}
			\left[
				\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-\tau}((\alpha - \mu) d)^{m-k} \mu^k} + o(\alpha^m)
			\right]
			\left[
				\frac{ ((\alpha - \mu)d)^{d - \tau - 1} }{(d - \tau - 1)!} + o(\alpha^{d - \tau - 1})
			\right]
			\left( d \atop \tau \right)
			}
			{\displaystyle (\alpha d)^m \frac{(\alpha d)^{d-1}}{(d-1)!}} \\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{
			\displaystyle \sum_{\mu=1}^{\alpha - 1}
			\left(
				\left[
					\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-\tau}((\alpha - \mu) d)^{m-k} \mu^k} + o(\alpha^m)
				\right]
				\frac{ (\alpha - \mu)^{d-2} d^{d-2} }{(d-2)!} d
				+
				o(\alpha^{m+d-2})
			\right)
			}
			{\displaystyle (\alpha d)^m \frac{(\alpha d)^{d-1}}{(d-1)!}} \\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{d-1}{d^m \alpha^{m+d-1}}
			\sum_{\mu=1}^{\alpha - 1}
			\left(
			\left[
				\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-1}((\alpha - \mu) d)^{m-k} \mu^k} + o(\alpha^m)
			\right] (\alpha - \mu)^{d-2}
			+
			o(\alpha^{m+d-2})
			\right)
			 \\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{d-1}{d^m \alpha^{m+d-1}}
			\sum_{\mu=1}^{\alpha - 1} \left[
				\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-1}(\alpha - \mu)^{m+d-k-2} \mu^k d^{m-k}} + o(\alpha^{m+d-2})
			\right] \\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{d-1}{d^m \alpha^{m+d-1}}
			\left[\int_{0}^{\alpha}{
				\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-1}(\alpha - \mu)^{m+d-k-2} \mu^k d^{m-k}}
			+ o(\alpha^{m+d-2}) \;d\mu } + o(\alpha^{m+d-1}) \right]\\
		& = \lim_{\alpha\rightarrow\infty}
			\frac{d-1}{d^m \alpha^{m+d-1}}
			\left[
				\sum_{k=0}^{m}{ \left( m \atop k \right) M^{(m-k)}_{d-1} \frac{(m+d-k-2)! k!}{(m+d-1)!} \alpha^{m+d-1} d^{m-k}}
			+ o(\alpha^{m+d-1})\right]\\
		& = \lim_{\alpha\rightarrow\infty}
			\left[
				\sum_{k=0}^{m}{\frac{d-1}{d^k}  \frac{m!}{(m-k)!} \frac{(m+d-k-2)!}{(m+d-1)!} M^{(m-k)}_{d-1}  }
			+ o(1)\right]\\
		& = 	\sum_{k=0}^{m}{\frac{d-1}{d^k}  \frac{m!}{(m-k)!} \frac{(m+d-k-2)!}{(m+d-1)!} M^{(m-k)}_{d-1}  }.
\end{align*}
The seventh equality follows from an application of Lemma \ref{simple_lemma} to evaluate the integral.

To complete the proof, we argue that the limit
$$
	\lim_{r\rightarrow\infty} \Ex{\left(\frac{H_{d}(n_r)}{n_r}\right)^m} =
\sum_{k=0}^{m}{\frac{d-1}{d^k}  \frac{m!}{(m-k)!} \frac{(m+d-k-2)!}{(m+d-1)!} M^{(m-k)}_{d-1}  }.
$$
also arises for all increasing positive integer sequences $\{n_r\}_{r=1}^{\infty}$
whose elements are greater than $d$ but are not all necessarily integral multiples of $d$.

Note that given any $n$, for $\beta_{x,d} := d \lfloor x/d\rfloor$, we have $\beta_{n,d} d \le n \le (\beta_{n,d}+1)d$. Since, in the right-hand-size of equation (\ref{the_expectation}), both the numerator and denominator are increasing in $\alpha$, one can construct upper and lower bounds by using either $\beta_{n,d}$ or $\beta_{n,d}+1$ accordingly in place of $\alpha$ in the numerator and denominator. For both bounds, the same leading order terms arise and hence the same limits. Therefore, with this sandwiching, we establish equation (\ref{asymp_frac_moments_1}).

With equation (\ref{asymp_frac_moments_1}), we may reduce the multiple term recurrence to a two term recurrence, yielding equation (\ref{asymp_frac_moments_2}), and then perform iterative substitution to obtain equation (\ref{asymp_frac_moments_3}). This proceeds as follows:
\begin{eqnarray*}
	M^{(m)}_d
	& = & \frac{d-1}{m+d-1} M^{(m)}_{d-1} + \frac{m}{d(m+d-1)} M^{(m-1)}_d \\

	& = & \prod_{j=2}^{d}{\frac{j-1}{m+j-1}} + \sum_{j=2}^{d-1}{\left(\prod_{k=j+1}^{d}\frac{k-1}{m+k-1}\right) \frac{m}{j(m+j-1)} M^{(m-1)}_j} + \frac{m}{d(m+d-1)} M^{(m-1)}_d \\
	& = & \frac{m!(d-1)!}{(m+d-1)!} + \sum_{j=2}^{d-1}{ m\frac{(d-1)!}{j!} \frac{(m+j-2)!}{(m+d-1)!} M^{(m-1)}_j} + \frac{m}{d(m+d-1)} M^{(m-1)}_d.
\end{eqnarray*}
(The second equality holds because $M^{(m-1)}_1=1$.) Simplifying yields equation (\ref{asymp_frac_moments_3}), as desired.
\hfill$\blacksquare$

\section{Numerical Experiments
}\label{numerical_experiments}

Illustrations of Proposition \ref{prop_asymp_frac_exp} may be found in Figures \ref{fig_asymp_frac_exp_100} thru \ref{fig_asymp_frac_exp_20000} along with simulated average fractions of balls in the ``heaviest'' urn and quantiles obtained from simulation (for $n$ ranging from 100 to 20,000).
Those simulations suggest that the limiting values are good approximations even for systems with just thousands of balls added.

	\definecolor{orange}{rgb}{1,0.5,0}
	\definecolor{brown}{rgb}{0.75,0.25,0}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_100.data};
			\draw[brown, dashed] plot file {herding_sim_100_q20.data};
			\draw[brown, dashed] plot file {herding_sim_100_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_100_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_100_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 100}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_100}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_250.data};
			\draw[brown, dashed] plot file {herding_sim_250_q20.data};
			\draw[brown, dashed] plot file {herding_sim_250_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_250_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_250_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 250}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_250}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_500.data};
			\draw[brown, dashed] plot file {herding_sim_500_q20.data};
			\draw[brown, dashed] plot file {herding_sim_500_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_500_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_500_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 500}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_500}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_1000.data};
			\draw[brown, dashed] plot file {herding_sim_1000_q20.data};
			\draw[brown, dashed] plot file {herding_sim_1000_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_1000_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_1000_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 1,000}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_1000}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_2000.data};
			\draw[brown, dashed] plot file {herding_sim_2000_q20.data};
			\draw[brown, dashed] plot file {herding_sim_2000_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_2000_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_2000_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 2,000}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_2000}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_5000.data};
			\draw[brown, dashed] plot file {herding_sim_5000_q20.data};
			\draw[brown, dashed] plot file {herding_sim_5000_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_5000_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_5000_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 5,000}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_2000}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_10000.data};
			\draw[brown, dashed] plot file {herding_sim_10000_q20.data};
			\draw[brown, dashed] plot file {herding_sim_10000_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_10000_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_10000_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 10,000}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_10000}
	\end{center}\end{figure}

	\begin{figure}[H]\begin{center}
		\begin{tikzpicture}[y=4.05cm, x=.485cm]

			\draw (0,0) -- coordinate (x axis mid) (25,0);
		    	\draw (0,0) -- coordinate (y axis mid) (0,1);

		    	\foreach \x in {0,5,...,25} {
		     		\draw (\x,3pt) -- (\x,-3pt)
					node[anchor=north] {\x};
				}
		    	\foreach \y in {0,0.2,0.4,0.6,0.8,1} {
					\draw (3pt,\y) -- (-3pt,\y)
		     			node[anchor=east] {\y};
				}

			\node[below=0.4cm] at (x axis mid) {$d$};
			\node[rotate=90, above=0.8cm] at (y axis mid) {$\displaystyle{H_d(n)} / n$};

			\draw[blue, thick] plot file {herding_asymp_exact_25.data};
			\draw[red, thick] plot[mark=*, only marks] file {herding_sim_20000.data};
			\draw[brown, dashed] plot file {herding_sim_20000_q20.data};
			\draw[brown, dashed] plot file {herding_sim_20000_q80.data};
			\draw[orange, dashdotted] plot file {herding_sim_20000_q05.data};
			\draw[orange, dashdotted] plot file {herding_sim_20000_q95.data};

			\begin{scope}[shift={(9,0.985)}]
				\draw[blue, thick, yshift=0\baselineskip]
					plot[blue] (0,0) -- (1.5,0)
					node[right]{Expectation: Proposition \ref{prop_asymp_frac_exp} ($n\rightarrow\infty$)};
				\draw[red, thick, yshift=-1\baselineskip]
					plot[mark=*, only marks] (0.75,0);
				\draw[red, thick, yshift=-1\baselineskip] (1.5,0) -- (1.5,0)
					node[right]{Simulation Mean};
				\draw[brown, dashed, yshift=-2\baselineskip] (0,0) --
					plot[brown] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.2 and 0.8};
				\draw[orange, dashdotted, yshift=-3\baselineskip] (0,0) --
					plot[orange] (0,0) -- (1.5,0)
					node[right]{Simulation Quantiles: 0.05 and 0.95};
			\end{scope}
		\end{tikzpicture}
		\caption{Maximum Fraction of Balls in the ``Heaviest'' Urn: The Limiting Mean and Simulated Data ($n={\rm 20,000}$; 10,000 samples)}
		\label{fig_asymp_frac_exp_20000}
	\end{center}\end{figure}

\section{Herding by Preferential Attachment}

For the author, the particular question of what fraction of the balls, in an instance of a Polya urn problem, would end up in the urn with the most balls arose from studying a discrete choice model of connected agents whose choices affect those of others \citep{SNatCPM2013WP}.
In that model, an agent would probabilistically select a choice based on his/her own preferences or adopt the choice of some other agent (i.e.: in ``steady state'', the former agent makes choices in accordance with the choice probabilities of the other agent).
By imposing specific decision making dynamics on that ``steady state model'', a stochastic model was obtained whereby, in any sample path, the realized choice of any given agent might be traced ``up the tree of choice adoption'' to some ``decisive agent'' (an agent making his/her choices based on his/her own preferences rather than by adopting that of another agent). As such, each outcome would correspond to a ``forest'' of ``trees'' each containing exactly one ``decisive agent'' and rooted at that agent.
Let us denote all the agents connected by choice adoption decisions to each ``decisive agent'' to be the ``herd'' associated with that ``decisive agent''.

To gain some insight on herd behavior, the model might be simplified to one where, conditional on the ``decisive agents'', any agent adopting the choice of another would select uniformly among the other agents. Further conditioning on there being $d$ ``decisive agents'', one obtains an instance of the Polya urn model with $d$ urns.
Using the largest herd as a proxy for the extent of herding behavior, Proposition \ref{prop_asymp_frac_exp} (and Corollary \ref{cor_asymp_frac_mean_2M}, in particular) inform one about the relationship between herding and the ``decisiveness'' of agents. Furthermore, should one desire to evaluate the ``risk'' associated with herding as the expectation of some (smooth) function of the fraction of agents in the largest herd, given that the moments are decreasing and bounded between $0$ and $1$ and that numerical experiments indicate the limiting distributions are ``close'' for reasonably sized populations of agents, good Taylor-expansion-based approximations can be computed.

\bibliographystyle{elsarticle-num}

redpajama_set_name: RedPajamaArXiv


RStar Consulting in conjunction with experienced associates can guide your company or project through the STO process.
STO replacing IPO as New Fundraising Platform for Crypto Entrepreneurs. How ?
STO (Security Token Offering) looks very similar to IPO (Initial Public Offer), but that is not the true case. Though, they both serve the purpose of raising money, still when seen from different angles they don't share everything. They are terribly different from each other. Now we must focus on points where they don't enjoy the same ride.


KANSAS CITY, Mo. — Kansas City police say a man was a struck and killed by a driver fleeing from police on Saturday night.
The deadly crash happened at about 9:30 p.m. in the 400 block of Monroe. Investigators say officers spotted someone driving a Toyota Tacoma involved in an aggravated assault investigation and attempted to stop them. That driver didn't stop, and a pursuit began westbound on Smart Avenue.
The Tacoma driver didn't stop at a stop sign, and hit a Chevrolet Impala on the driver's side that was headed south on Monroe. The Impala was smashed into a retaining wall, the driver was taken to a hospital where he was pronounced dead.
The Tacoma driver wasn't hurt, officers arrested them at the scene.
Police haven't released the name of the man killed. Both the initial investigation into the aggravated assault and this deadly crash investigation are ongoing. When KCPD released this information Sunday morning, it also included the department's policy on pursuits, you can read it at this link.


text:
October 2021 Key Leaders Series
Upcoming DISA Small Business Conference
2021 Members Only Networking Reception
Welcome New Members — December 2022
President's Reception 2022
Tuesday 5:00 pm-6:30 pm
Rising Stars Network Executive Speakers Series
January 31, 2023 • 5:00 p.m. to 6:30 p.m. Lockheed Martin 410 National Business Parkway Annapolis Junction, MD 20701 Women in Leadership If you're an…
Wednesday 8:00 am-10:30 am
Key Leaders Series
FMA's Key Leaders Series, an opportunity to hear directly from national leaders on important topics, welcomes Chris Inglis, National Cyber Director and Principal Adviser to…
Wednesday 3:30 pm-4:30 pm
MBC Monthly Meet-Up
February's topic for our Meade Business Connect (MBC) monthly online meeting is Understanding State and County Resources. Learn directly from State and County staff what…
Your ticket for the: 2021 Members Only Networking Reception

redpajama_set_name: RedPajamaCommonCrawl


If you, or someone you know is having trouble with a teen, take a few moments and answer the following questionnaire to see if this teen is at risk. This can serve as a point of reference for you in understanding the severity of the problems your teen is currently facing.
Sometimes the problems are so severe that they can only be properly addressed by getting professional help in a controlled environment, such as a residential center, treatment program or specialty school that is designed to deal with troubled teens. Other times problems can be resolved right in the home by setting better limits and tightening up the basic family rules and structure.
After completing the questionnaire, count how many questions you answer "yes" to and refer to the scoring guide which will offer suggestions, and recommendations based on the results of your own responses.
Are you concerned about your child's well being and their future?
Are you concerned that your teen may be sexually promiscuous?
Are you exhausted and worn out from your teen's defiant and/or destructive behavior and choices?
Are you worried that your teen may not finish high school?
Do you find yourself picking your words carefully when speaking to your teen, so as not to elicit a verbal attack or rage from them?
Do you have a lack of trust with your teen?
Do you have trouble getting your teen to do simple household chores or homework?
Do you suspect at times you have had money or other valuables from your home?
Do you suspect that your teen sometimes lies or is dishonest with you?
Do you think your teen is possibly using or experimenting with drugs/alcohol?
Does your teen associate with a bad peer group?
Does your teen engage in activities you don't approve of?
Does your teen have problems with authority?
Does your teen seem depressed/withdrawn?
Does your teen seem to constantly be in opposition to your family values?
Does your teen seem to demonstrate a lack of motivation?
Does your teen seem to lack self-esteem and self-worth?
Does your teen's behavior concern you for their safety?
Has your teen ever been suspended, expelled, truant, or had a drop in school grades?
Has your teen ever displayed any evidence of suicide ideation?
Has your teen lost interest in former productive activities, hobbies or sports?
Has your teen's appearance and/or personal hygiene changed?
Is your teen angry or display temper outbursts?
Is your teen manipulative and/or deceitful?
No matter what rules and consequences are established, do you feel that your teen will defy them?
When dealing with your teen, do you often feel that you are powerless?
Get help! A residential treatment program or specialty boarding school is strongly recommended.
It is possible that the problems can be resolved by tightening up the family rules and structure. However, it may be that your child is at-risk. Residential treatment program or specialty boarding school needs to be considered. Some parents consider a boot camp or wilderness program.
Up to 8: Moderate risk.
Tighten up family rules/understandings, and be consistent with your monitoring and follow through, you may consider counseling or a therapist.
© 1999 Teen Help Adolescent Services All Rights Reserved.


text:
New luxury housing community proposed for north Raleigh
August 5, 2015 /in Press /by 8 Dot Graphics
Reprinted from the Triangle Business Journal | Jun 23, 2015
Photo Courtesy Al Ross Luxury Homes
Raleigh real estate investor Mark MacDonald is proposing a plan for something the Triangle home building market hasn't seen for some time: A large-lot community for custom, million-dollar homes.
MacDonald, a former managing director of investments for Stratford Land Fund, is working through the final site details with Wake County planners for a project he's calling Avalaire, a 160-acre housing community off Durant Road in north Raleigh.
Avalaire is slated to have a total 90 wooded home lots when completed, each averaging more than one acre. "The custom builders (of high-end homes) are having a hard time finding lots because there's not much left out there. Most of them are on the other side of the lake," MacDonald says, referring to Falls Lake in northern Wake County where commutes can be 30 minutes or more into downtown Raleigh or Research Triangle Park.
The draw, he says, for discerning high-end buyers is Avalaire's location and its large lot sizes. Because it will connect into the neighboring Faircroft community, it won't be gated. It also won't have a big neighborhood amenity center, he says, because most of its buyers will likely build their own pool and fitness gym.
The heavily-wooded property has been owned by members of the Parker family for generations. "The family forever has said it's not for sale, but then one day our phone rang," MacDonald says.
He would not disclose yet how much his development firm, Arcadia Real Estate Advisors of Raleigh, is paying for the property, but he says the average finished lot price at Avalaire will be around $334,000.
Considering that on average the finished lot price for a new home accounts for about 20 percent of the sales price, average home values at Avalaire will likely be more than $1 million.
Avalaire's property will be built in two phases on both the north and south side of Durant Road, near the intersection with Honeycutt Road. The first finished lots for builders and buyers at Avalaire should be ready by May 2016, says MacDonald.
Because it's outside the Raleigh city limits, each lot will have to have its own septic system, and the whole community will be tied into a well water system that will be managed by Aqua NC, a subsidiary of Aqua America (NYSE: WTR).
Plans for Avalaire were also filed three months after another high-end project of a similar size also filed plans with the Wake County planning department.
The owners of a 151-acre site on Camp Kanata Road have proposed plans to build there a new high-end residential community with 123 home lots and 38 acres of open space. A subsidiary of GreenHawk Corp., a land development company based in Raleigh, had purchased the property in October for $4.7 million.
https://www.avalaire.com/wp-content/uploads/2015/08/outdoor-grilling-300750xx4267-2400-131-0.jpg 421 750 8 Dot Graphics https://www.avalaire.com/wp-content/uploads/2015/08/Copper-Avalaire-Logo-H.png 8 Dot Graphics2015-08-05 09:11:192018-09-24 09:37:31New luxury housing community proposed for north Raleigh
Top-Selling Luxury North Raleigh Community, Avalaire, Boasts Three of The Highest Priced Homes in the 2018 Triangle Parade of HomesOctober 5, 2018 - 2:31 pm
Avalaire Hosts Summer Soiree for Triangle Elite RealtorsJune 8, 2018 - 9:13 am
Coldwell Banker, HPW — The Young Team
John Young | 919.271.8820 | JohnYoung@avalaire.com
Leslie Young | 919.280.5401 | LeslieYoung@avalaire.com
An Avalaire Community
North Raleigh, North Carolina
© 2019 Avalaire. Privacy Policy
Avalaire Community Announces Finalized Builder Team


The Vans Authentic Slim and a classic low top slim cut shoe. This Vans Authentic has a low profile vulcanized sole, and a canvas finish. Offering supreme support and comfort along with low cut and slim style, the Vans Authentic Slim and perfect.


Built for use with Xona/TiAL v-band turbine housings. Efficiently supports 1000 whp and edges out the small runner in high rpm power.
Maintains all OEM accessories such as A/C and power steering.
Edges out the small runner v-band in high rpm power with 35r or equivalent and larger turbos on a 2.0 liter or larger displacement engine.
Built for use with Xona/TiAL v-band turbine housings.


text:
<?php
/**
 * The PHP_CodeSniffer has its own autoloading system, which we
 * need to hook into
 *
 * @author Ed Barnard
 * @license MIT
 */

//defined('PHP_CODESNIFFER_VERBOSITY') or define('PHP_CODESNIFFER_VERBOSITY', 2);

/** @noinspection UsingInclusionOnceReturnValueInspection */
$autoloader = require_once dirname(__DIR__) . DIRECTORY_SEPARATOR .
	'vendor' . DIRECTORY_SEPARATOR . 'autoload.php';

// The code sniffer autoloader
require_once dirname(__DIR__) . DIRECTORY_SEPARATOR .
	'vendor' . DIRECTORY_SEPARATOR .
	'squizlabs' . DIRECTORY_SEPARATOR .
	'php_codesniffer' . DIRECTORY_SEPARATOR .
	'autoload.php';

// The test wrapper
require_once dirname(__DIR__) . DIRECTORY_SEPARATOR .
	'vendor' . DIRECTORY_SEPARATOR .
	'squizlabs' . DIRECTORY_SEPARATOR .
	'php_codesniffer' . DIRECTORY_SEPARATOR .
	'tests' . DIRECTORY_SEPARATOR .
	'AllTests.php';

if (is_object($autoloader)) {
	$GLOBALS['finder'] = $autoloader;
}

redpajama_set_name: RedPajamaGithub


Hi all! I'm a psychiatrist with a background in philosophy. I like reading, studying and trying to understand how people and our society work. In 2013 I completed my PhD by studying the stigma of mental illnesses, and I decided I had to write novels. I think fiction is a different means to achieve the truth than scientific writing. By creating fiction you can reach the truth in an artistic and unconscious manner, and then share this truth with your reader.
I started writing in 2013, after my PhD. I was kind of satisfied with my academic achievements, and I decided I had to do something different. Something to do with the arts. I had lots of things I needed to tell the world, things I could not write in scientific papers. And so my books came out.
I write fiction with psychological themes. I like to create characters similar to real persons. I put many of the conflicts I see in people, my patients, and myself in my characters, and I feel they need to share these feelings with the readers. In my view when you read a book it needs to provide you a take home message. Or at least cause the reader to reflect on the world he is living in. That's why I write, to urge people to think.
Surely the greatest joy of writing is to receive feedback from my readers. I love to discuss my books with them. And it satisfies me more when I see that a person really loved the reading, and that my book changed his life in some way.
My latest book is "Laplatia – or, The City That Could Not Dream". I have some forthcoming projects but they are still very incipient. I need to shape them to have a better idea of what they will turn out to be in the future.
Laplatia is a city in the near future where natural resources for the generation of electricity have exhausted. In this society mankind invented machines to capture electricity from dreams and imagination's brain waves to turn it into society's electrical power. So, no one can freely imagine or dream anymore. How would it be to live in a world like that? Laplatia resembles our society, where our thoughts are shaped by the mass media culture. We are all sort of Laplatians in some way. And so I reproduce common current existential anguishes people show in our society in the book. It has something of darkness, of desperation, and of self-questioning. It's an unforgettable journey into our own thoughts to read Laplatia.
There is Aaron, who works in one of the facilities that extracts electricity from human brains to turn it into societal electrical power. Though he is married, he is a lonely person, who finds himself trapped in his daily routine. There is his wife Daphne, who thought he was the love of her life but got deeply disappointed after years of marriage. Argos is one of the extractor facility's leaders. He is a bit arrogant, and very stupid with his wife Ophelia. She, in turn, caught him cheating on her in the beginning of the marriage but still decided to stay with him. She is a very disturbed person who cuts herself to diminish her anguish. There is also a doctor, a drug addict, and so on. Wow, got a little bit excited here but never mind, there are no spoilers, lol.
8. A fun fact you would like your readers to know about you or your book.
9. Is there a message in your book? Do you want your readers to take something home?
Yes. There are several critiques on the homogenization of our culture. We know how films end, there are sort of "recipes" for writing books and making movies and TV shows. The new is rare. Though much has been debated about canned culture and its consequences, like dehumanization and the distant and impersonal character of human relationships in general, we keep doing things the same. Laplatia aims to provoke those questions in the reader's mind.
How would it be to live in a city where no one was allowed to use his imagination freely? Where dreams and fantasy had to be used for socioeconomic purposes? Laplatia is a dystopian city in the near future where natural resources for the production of electrical power on Earth have been depleted. With increasing chaos due to this shortage, civilization invented the Extractors, machines capable of extracting human imagination and turning it into Fos, electricity's raw material. Consequently, citizens were prohibited to "spend useless thoughts," such as those provided by imagination, dreams, and fantasy, unless they were destined to the Extractors. In this city, we follow the story of seven characters, their anguishes, their relationships, and their solitude. Laplatia is an erratic story that emotionally moves the reader and urges him to reflect about himself and the society. After all, who said one's thought is free?
Alexandre A. Loch is a psychiatrist who graduated from the University of Sao Paulo, Brazil, obtaining a PhD degree by studying the stigma of mental illnesses. He also holds a bachelor degree in philosophy, and in 2013, he started his career as a writer. Besides writing, he currently acts as a researcher, having authored many scientific articles published in international journals, and being the associate editor of Frontiers in Public Mental Health.
His first released book, Bile Negra (Black Bile), is an introspective psychological fiction about Iago and his soul's journey through a big city. The book was well received by the Brazilian critic. In 2016, he will release Laplatia (The City that Could Not Dream), in the United States, by Black Rose Writing.
"I like to make people think with my fictions. A book should provoke catharsis; induce the reader to reflect about himself, his life, and the society he is living in. For that, I usually use a sharp style that touches directly the reader's soul."


text:
const std::string Downloader::downloader_program = "wget";
const std::string Downloader::downloader_program_options = "--quiet";
const std::string Downloader::downloader_program_to_file_option = "--output-document=";

int Downloader::DownloadPage(const std::string& link,
    const std::string& filename)
{
  int result =
    system((downloader_program + " " + downloader_program_options +
          " '" + link + "' " +
          downloader_program_to_file_option + "'" + filename + "'").c_str());
  return result;
}


text:
«Rather Be» — песня английской группы Clean Bandit, исполняющей электронную музыку. В записи песни также приняла участие британская певица Джесс Глинн. Трек был выпущен 17 января 2014 года в качестве четвёртого сингла с дебютного студийного альбома группы  (2014). Текст песни был написан участниками группы Грейс Чатто и Джеком Паттерсоном в соавторстве с Джеймсом Нейпир и Николь Маршалл, также Грейс Чатто и Джек Паттерсон стали продюсерами этого сингла. Warner Music Group выпустила ряд официальных ремиксов с участием ,  и OVERWERK.

Песня дебютировала на первом месте в UK Singles Chart и стала вторым самым продаваемым синглом в 2014 году, а также самым продаваемым синглом января со времен  Babylon Zoo в 1996 году. «Rather Be» провела четыре недели на вершине чарта, а с момента выхода сингла было продано более миллиона копий. Британская ассоциация производителей фонограмм присвоила песне статус 3-х платинового сингла. Лучшей позицией сингла в чарте Billboard Hot 100 стала десятая строчка чарта. Само издание Billboard поместило «Rather Be» на четвертую позицию в своем рейтинге лучших синглов 2014 года.

«Rather Be» получил международную популярность благодаря вирусному ролику с участием японской актрисы . На 57-ой ежегодной церемонии вручения наград «Грэмми» песня одержала победу в категории Лучшая танцевальная запись.

Коммерческий успех
«Rather Be» дебютировал на первом месте в UK Singles Chart и был третьим быстро продаваемым синглом за неделю в 2014 (после  с «Do They Know It's Christmas?» и  с""), и самым продаваемым синглом января со времен  Babylon Zoo в 1996 году. Песня продержалась на первом месте в течение четырёх недель, оставаясь самым долгим пребыванием на вершине чарта в течение трех лет. «Rather Be» стал вторым самым продаваемым синглом по итогам 2014 года в Великобритании, разойдясь свыше 1,13 миллионов копий на конец этого года. В США в чарте Billboard Hot 100 лучшей позицией стало 10 место, это первое попадание Clean Bandit в американский чарт. Песня получила большой успех в мире, попав в топ чартов в 13 различных странах мира.

За первую неделю в Великобритании было продано более 163 тысяч копий сингла. В январе обычно очень низкие продажи синглов и альбомов. Однако, «Rather Be» нарушил эту тенденцию, став самым продаваемым синглом, выпущенном в январе, со времен «Spaceman» Babylon Zoo в 1996 году. В августе 2015 Британская ассоциация производителей фонограмм сертифицировала «Rather Be» как трёх платиновый сингл, ставший шестым синглом столетия достигшего такого результата. Песня продержалась 73 недели в топ 75 UK Singles Chart, установив новый рекорд по непрерывному нахождению в чарте (позже рекорд повторил Эд Ширан с песней «Thinking Out Loud»). К сентябрю 2017 в Великобритании было продано чистых копий более 1 283 000, а также более 93 миллионов стриминга, что в совокупности 2 219 000 единиц комбинированных продаж.

Чарты

Еженедельные чарты

Годовые чарты

Сертификации

Примечания

Ссылки
 Официальный сайт Clean Bandit

Синглы 2014 года
Песни Clean Bandit
Премия «Грэмми» за лучшую танцевальную запись
Синглы, возглавлявшие UK Singles Chart
Синглы, возглавлявшие UK Dance Chart
Синглы, возглавлявшие хит-парад Ирландии
Данс-поп-песни
Синглы Big Beat Records
Синглы Atlantic Records
Синглы, возглавлявшие хит-парад Nederlandse Top 40
Синглы, возглавлявшие хит-парад Single Top 100
Синглы, возглавлявшие хит-парад Австрии
Синглы, возглавлявшие хит-парад Германии
Синглы, возглавлявшие хит-парад Польши
Синглы, возглавлявшие хит-парад Финляндии
Синглы, возглавлявшие хит-парад Швеции
Синглы, возглавлявшие хит-парад Норвегии
Япония в культуре и искусстве
Синглы, возглавлявшие Billboard Dance/Electronic Songs

redpajama_set_name: RedPajamaWikipedia


text:
LSO/Antonio Pappano – Respighi's Festivals, Fountains and Pines of Rome – Lise de la Salle plays Rachmaninov's Paganini Rhapsody
Rhapsody on a Theme of Paganini, Op.43
Fontane di Roma
Pini di Roma
Lise de la Salle (piano)
Sir Antonio Pappano
Reviewed by: Colin Anderson
Venue: Barbican Hall, London
It was a short first half, Rachmaninov's ingenious Paganini Rhapsody played by Lise de la Salle (replacing the hand-injured Alice Sara Ott). The performance took a little while to settle and warm to its task. There was scintillation and style on offer from the soloist, but she lacked for variegation. While such a black and white, even brittle, approach didn't lack for dynamic variety, the pianist had her moments of outgunning the LSO, which in turn matched her brashness, Nigel Thomas's dead-sounding timpani strokes only serving to literally emphasise the rumpus (he would be much better in the Respighi). Slower, lyrical sections were more engaging, although Lise de la Salle's impetuosity gave the impression of impatience. For all the energy that Antonio Pappano issued to achieve clarity and togetherness, there was an 'unfinished' feel to this account. Maybe because the pianist was called upon to save the day, rehearsals had been compromised, but the blustery excitement generated didn't quite square with Rachmaninov's soul and seamless organisation. There was though a witty pay-off.
It was a longer second half, Respighi's magnificent Roman Trilogy. Like its two predecessors, Roman Festivals (1928) is superbly scored – and also extravagant with extra trumpets, piano, organ, mandolin and plenty of percussion – and found the LSO in gladiatorial form for music that can attack the jugular. There is much that is expressive and evocative, too, the music as capable of serenading as it is of suggesting all the fun of the fair, where of course drink is freely available and tipsiness is the result. Perhaps the least-appreciated of the Trilogy, the LSO and Pappano revelled in Roman Festival's orgy of colour and description, and how spellbinding things were when dynamics were pared down to almost nothing.
Throughout Festivals, balances were spot on, as they were in the other two pieces. Fountains of Rome (1916), from Dawn to Sunset, is full of musical poetry and here ravished the senses – with some wonderfully tender and impressionistic contributions – contrasted with the bright glare of daylight and the tumultuous overflow of 'The Trevi Fountain at Noon'.
Pines of Rome (1924) also employs a Technicolor orchestration (what fabulous imagination and skill Respighi possessed), the named trees witnessing children at play, guarding a catacomb, taking delight in a balmy evening and observing the return of triumphant legionnaires. How ebullient was the opening section, how mysterious the next and with a magically distant trumpet, and how delectable and peaceful was the Janiculum, Chris Richards's exquisitely whispered clarinet solo, mellifluous solo strings and the real song of a nightingale (Respighi's chosen Brunswick phonograph is now digitised) all creating raptness, an invitation to picnic under the stars. The apparition of the foot soldiers changes the mood as the documented past becomes the glorious present. Here the additional brass instruments were placed high and mighty for a majestic and tremendous effect.
Antonio Pappano and the LSO, a time-honoured partnership, pulled off something compelling and convincing throughout the Trilogy, with perfectly judged tweets and perspectives and swaggering and refined playing, Pappano shedding blood on behalf of Respighi's noble Roman visions.
It was a stupendous way to end January MMXVI.
LSO www.lso.co.uk
Barbican www.barbican.org.uk
Pappano conducts King Roger


CHICAGO (WLS) -- Six women are suing Chicago Public Schools over a carbon monoxide leak at their children's school on the Northwest Side.
The leak at Prussing Elementary happened on Oct. 30, hospitalizing 71 children and seven adults.
Officials say the school's boiler caused the leak.
The women are seeking $700,000 in damages.


What would you like to have changed about the expedition?
Would you like to go on other expeditions or camps in the future with Scouts?
The kit cost a lot of money. Swaps or loans?
Would have liked to have seen a little more of what they did, where they went etc.
Better, clearer, much earlier communication and information from leaders.
All in all though, the organisation was superb, and he had a great time. Well done to everyone.
Scout Leaders were absolutely fantastic.
Could not have been lovelier- incredibly kind and supportive to all the Scouts.
I really appreciated seeing the updates on Instagram and Facebook.


Üllo is delighted to announce that luxury UK department store, Selfridges, now stocks the Üllo product range, including the Üllo Wine Purifier, a first-of-its-kind product that purifies wine by removing sulfites to restore it to its natural state.
Üllo was set up by American entrepreneur James Kornacki, who holds a doctorate in chemistry from Northwestern University. Kornacki was inspired to create the product after he learnt that his aunt was unable to drink wine because of her intolerance to sulfites, a chemical that is added to wine as a preservative.
It was then that he made it his mission to use his scientific acumen to create a filter that would allow consumers to enjoy wine as if their bottle was opened right at the vineyard. This journey led James to develop the brand's innovative Selective Sulfite Capture™ technology, and since then the company has continued to grow.
As well the Üllo Wine Purifier, Üllo also offers the Selective Sulfite Capture Filters™ and a wider product range including carafes and decanters. In addition to Selfridges, Üllo is also currently stocked within a range of other prominent retailers across the world including Harrods and Firebox.com in the UK, Bloomingdales in the US, El Corte Inglés in Spain and Amazon globally.


If a friend or someone around us is enthusiastic there's a certain energy or presence that shines from them that can be infectious. It doesn't even matter what they're enthusiastic about; if we're in their presence, it's easy to be lifted up by their energy.
I've always loved seeing people express their enthusiasm. It brings such an authentic quality of who they are through the things that excite them. The thing they're excited about may seem insignificant to others, but their enthusiasm shines with something very special—a quality of their presence that's beyond words, beyond the stress, dramas, or stories that sometimes take hold in life.
I had an experience recently with a friend of mine that inspired me to share my enthusiasm for enthusiasm.
I'd just finished having dinner when I received a text message from my friend, telling me she'd just finished making some home-made chocolate and had a piece for me. She was keen to know what I thought about it.
She'd made it using leftovers, peanut butter being a main ingredient. But not just any peanut butter, probably the last part in the jar, where all the oil has risen to the top, leaving the bottom extremely dry and pasty. Mixed with some cacao powder, a little honey, and I can't remember what else, the taste was good but the texture made it hard to swallow without some fluid.
We both had a good laugh about it, and she told me when she makes a new batch she'd give me a taste, no doubt to redeem herself.
So now, a week later she was now dropping off her new chocolate creation.
It's interesting how we can often feel self-conscious about our actions when we're enthusiastic. It doesn't actually happen when we're enthusiastic, it's when we drop out of it, into our ordinary thinking mind and start questioning ourselves. We can be so spontaneous, but then have moments of thoughts like, "Is that ok?" "Am I crazy?" or "What will my friends think?" that disconnect us from the experience.
If I didn't feel her enthusiasm I might have thought it was a little strange; however, I've always found it easy to feel people's excitement and passion. The thing they're excited about may not always be my cup of tea, but their enthusiasm always is.
For me interacting with people is really about human connection, so in a way, the content of the interaction is secondary. In this case the chocolate was delicious, but connecting with her enthusiasm was more important!
It's so easy to connect with people when we're expressing feelings like enthusiasm. It creates a warmth that's instantly uplifting.
Enthusiasm is like a joyous fire, and for me when someone is in that state it's easy to meet them there. It's connecting on a level beyond words.
In astrology the sun refers to the highest aspect of our self, or Higher Self.
I like the metaphor of the sun, because when people are expressing feelings like enthusiasm, wonder, curiosity, compassion, or love there is something of this sun principle shining through.
When we see people shining with enthusiasm, it's usually about something; in this story it would be my friend's chocolate creation, but for me the "something" is more a handle into their sun inside. Their presence.
Like knows like. When we witness this shining it's easy to be uplifted because we recognize their sun from our own sun, and the reason it feels so good is because we're in touch with our own sun.
The sun inside is the source of our true happiness. It's an unwavering force of vitality, joy, and fullness. It's the spark of life, beyond the limitations of the mind.
Whether you resonate with the word "god" or not, what it's pointing to is that there is something very special about the expression of enthusiasm. Something that comes from deep inside us.
Think of a time when you were doing something enthusiastically.
Was it easy to lose track of time when you're doing it?
It felt good, right? There was a fullness inside. The things that might usually weigh on your mind, just don't exist in that state.
I've found a powerful observation to make is that when we're in a state of enthusiasm and those thoughts come in and start question our spontaneity, they come from a very different part of our mind, a part that is usually graspy, controlling, and fear-based—not our sun.
When I feel enthusiastic, I feel a fullness and warmth in my heart and a that sense I could do anything, but if I have a thought of something like, "Is this okay?" or "Am I just weird?" I feel small, empty, and fearful.
The next time you're having a moment of spontaneous enthusiasm notice the sense of freedom and aliveness that comes. Then, if doubting thoughts come in, notice how restrictive and lifeless they are.
This is important because it helps us separate the real, authentic parts of us from the fearful and disconnected parts. The more clarity we gain here, the more choice we have to live authentically from our sun.
To start cultivating your sunny enthusiasm, simply start by noticing it when it comes and pay attention to it. In those moments when it comes, just allow yourself to feel it. By feeling it, I mean enjoying it! Resist the temptation to question it.
What are the things you're passionate about? Do them! These are the things that will bring out your enthusiasm.
Notice how your enthusiasm, your sun, naturally uplifts people. Your enthusiasm, besides making you feel good, is a gift to others. There may be people who react negatively, but keep in mind that's more about them than you. If they weren't reacting to you, they'd be reacting to someone else.
Notice other people's enthusiasm, and how it can spark something in you.
Enthusiasm is awakening. It makes us feel alive and part of something greater than just ourselves.
Just the fact of keeping it in your awareness will naturally help you discover and cultivate more.
Remember, it is contagious, but this is something the world needs more of, so go ahead and share your enthusiasm.
Ben is a meditation teacher, "stillness coach," and founder of the Peacekeeper Project, a community dedicated to impacting humanity by helping more people silence the mind and live from the heart. Ben believes stillness is a superpower available to anyone. You can learn more and download a free meditation at the Peacekeeper Project and find Ben on Facebook and Instagram.
The post Your Enthusiasm is Contagious, So Share Your Passion Loud and Proud appeared first on Tiny Buddha.


Blue Bell, PA, USA. June 17, 2003.
Unisys Corporation announced today that the Federal Deposit Insurance Corporation (FDIC), on behalf of the Federal Financial Institution Examination Council (FFIEC) agencies, has selected the company to modernize the current collection of bank data, known as Call Report processing, and to help the agencies transition toward a paperless, electronic environment. The bank data are used in a wide range of regulatory, supervisory and analytical functions, including the design and conduct of banking policy and industry risk assessment.
The business process outsourcing contract has an initial term of seven years and value of approximately $28 million; the FDIC can extend it for three additional one-year periods. In addition, the FDIC can order optional technical requirements. If the FDIC exercises all options and extensions, the contract will be worth approximately $39 million.
Streamlining the Call Report process should help the agencies to reduce paperwork and lower the cost of doing business. Key to the new process is the implementation of a central data repository (CDR) using proven technologies to collect and process the bank data as well as serve as a single source for all information related to this data submitted by financial institutions.
To help the Call Report agencies modernize business operations, the CDR will provide the platform for timely, efficient, low-cost and standardized exchange, storage and distribution of accurate Call Report data. Unisys will provide a range of services covering solution development, hosting, help desk and application maintenance.
"The solution combines Microsoft .NET technology with Unisys consulting solutions and enterprise family of servers. We expect that this solution will become a mainstay of the banking community's federally mandated reporting process," said Greg Baroni, president, Global Public Sector, Unisys. "Overall, this initiative will demonstrate Unisys ability to deliver a complete business process outsourcing solution quickly and efficiently."
The solution will be implemented in a Web services architecture leveraging the Microsoft .NET framework. As a Web services-based architecture, the solution implements Extensible Business Reporting Language (XBRL) as the standard data format for the Call Reports. XBRL is the XML-based standard for identifying and better communicating the complex financial information in corporate business reports allowing for easier and more reliable exchange of corporate financial information.
The Federal Financial Institutions Examination Council is a formal interagency body empowered to prescribe uniform principles, standards, and report forms for the federal examination of financial institutions by the Board of Governors of the Federal Reserve System (FRB), the Federal Deposit Insurance Corporation (FDIC), the National Credit Union Administration (NCUA), the Office of the Comptroller of the Currency (OCC), and the Office of Thrift Supervision (OTS) and to make recommendations to promote uniformity in the supervision of financial institutions.
Unisys is a worldwide information technology services and solutions company. Our people combine expertise in systems integration, outsourcing, infrastructure, server technology and consulting with precision thinking and relentless execution to help clients, in more than 100 countries, quickly and efficiently achieve competitive advantage. For more information, visit www.unisys.com.
Prepared by Robin Cover for The XML Cover Pages archive. General references in "Extensible Business Reporting Language (XBRL)."


text:
QBE CEO dismissal a mystery
QBE has remained quiet over why former chief executive, Pat Regan, was dismissed last September or why he was forced to leave without his share rights worth $10 million.
Regan was dismissed after an external investigation over an issue of workplace communication, where the QBE board concluded it did not meet the standards set out in the group code of ethics and conduct.
At the House Standing Committee on Economics, deputy chair Andrew Leigh, asked if it was due to Regan's position on the board of online consultancy firm Expert360, for which he had joined two months earlier.
Jonathan Groves, QBE chief risk officer, and Chris Esson, chief financial officer, said both they could not add anything to the public statements that had been made.
Asked if they had looked to other conflicts of interest beyond the former with regards to Expert360, Grove said: "We have a conflicts of interest process, appropriate for a public organisation such as QBE and it's my understanding the process was appropriately followed".
Expert360 listed QBE as one of the organisations that services it used, but neither Groves nor Esson would confirm QBE retained its services.
Asked if QBE approved of the board directorship that Regan took on, Groves said: "We have a robust conflicts of interest policy, which we operate as an organisation and to my understanding that was assessed at the time".
Leigh asked whether the dismissal process was handled correctly, particularly regarding any severances or pay-outs due.
"It's interesting that in a world where we worry about golden handshakes, that Mr Regan was forced to go without his share rights which had been estimated at some $10 million. Do you see that as your processes working effectively?" Leigh said.
Both denied they knew the basis of the termination and did not feel they were being kept in the dark.
"I don't think that's the case; QBE as a group has made statements that are clear in this regard," Esson said.
Fresh Mozzarella: to freeze or not to freeze
IT leaders prioritising agile over hybrid working and cloud


text:
Q: How do I open a new page from code behind? This question is probably already answered here, but I couldn't find the answer?  Is there any way to navigate to another page in code-behind?

A: Response.Redirect("path_to/newpage.aspx");

A: In addition to Response.Redirect, you can also use Server.Transfer("~/path_to/newpage.aspx"), which is useful when you want to display a different page to the user without the URL in the browser changing.

A: by using
1) Response.Redirect("path");
2)Server.Transfer("path");

redpajama_set_name: RedPajamaStackExchange


The clear objective of the ideal shop lighting is to showcase the product to its best advantage, both by highlighting its physical shape and by creating an atmosphere around the product, always with a view to promoting sales of the product.
Riegens has the expertise and experience to create the optimum retail lighting solution.
Energy savings also play an important role. Many shops find operating costs in the form of rent and consumption quite a challenge. Accordingly, energy-efficient lighting can definitely make a positive contribution to the bottom line.
The lighting solution needs to be tailored to each area so as to create the perfect setting for the user, whilst not using any more energy than is absolutely necessary.


The NYSE financial index consists of more than 900 banks, brokerage houses, savings and loan institutions, insurance companies, and other financial corporations. Top financial institutions such as Citigroup Inc., American International Group, Morgan Stanley Corp., Bank of America, and Wells Fargo are among the index's components. The index is designed to track the performance of the major and most widely traded financial stocks in the New York Stock Exchange.


text:
Blue Island–Vermont Street is a Metra station in Blue Island, Illinois, servicing the Rock Island District and Metra Electric District Lines. On the Rock Island, it is  from LaSalle Street Station. For the Metra Electric, it is the southern terminus of the Blue Island Branch, and is  from Millennium Station.

On the Rock Island Line, as of 2022, Blue Island-Vermont Street is served by 37 trains in each direction on weekdays, by all 16 inbound trains and all 17 outbound trains on Saturdays, and by all 14 trains in each direction on Sundays.

On weekdays, 16 inbound trains originate from Vermont Street and 16 outbound trains terminate at Vermont Street. On weekends, six inbound trains originate from Vermont Street and six outbound trains terminate at Vermont Street. All trains that terminate/originate from here travel along the Rock Island's Beverly Branch.

On the Metra Electric Line, as of 2022, Blue Island is served by eight inbound trains and 10 outbound trains on weekdays, and by four trains in each direction on Saturdays. There is no service on the Blue Island branch of the Metra Electric Line on Sundays or holidays.

The two stations share the same parking facilities and the same bus connections. Although these two stations are across the street from each other and trains do not use the same platform areas, the proximity of the two to each other functionally allows riders to transfer from one to the other with only a very short walk (less than an eighth of a mile) between them.

Blue Island-Vermont Street is one of the busiest stations on the Rock Island District. It is the centerpiece of the entire line, historically and presently. Many trains terminate here, most of them locals on the Beverly Branch, and most rush hour trains stop at this station, running express to and from this station. A coach yard is located just north of the station and is used to store out-of-service trains when not in use.

Vermont Street is a favorite of railfans due to its unique four-track setup, frequent train action, and switching movements. Later on in the day, Iowa Interstate Railroad runs a daily freight train along the Rock Island tracks, from Blue Island to Council Bluffs, Iowa. For this reason, this daily freight train is officially named the BICB. Blue Island's police and fire departments are located several blocks away from Vermont Street.

Blue Island–Vermont Street station and Blue Island station are both in zone D of Metra's zone-based fare system. As of 2018, Blue Island-Vermont Street station on the Rock Island District is the 84th busiest of Metra's 236 non-downtown stations, with an average of 595 weekday boardings. Blue Island station on Metra Electric is the 164th busiest of Metra's 236 non-downtown stations, with an average of 197 weekday boardings.

History
Rock Island service was established in Blue Island in 1852, and the current brick station at Vermont Street replaced the original frame depot in 1868.  The Beverly Branch splits from the main line here and runs at the base of the ridge serving stations in Blue Island and the Chicago neighborhoods of Morgan Park and Beverly before veering east to serve Brainard and reconnecting to the main line at the Gresham station at 87th and Vincennes. This branch line was created in 1889 through the influence of the Blue Island Land and Building Company to serve its interests in the development of what was then the village of Morgan Park and carries most of the passenger traffic for the area, although some rush-hour trains travel north-east on the main line. In 1891, the Metra Electric station was built as a branch of the Illinois Central's commuter line from Kensington-115th Street.

On July 12, 1971, the station began service to Amtrak trains. (The sited station list shows non-Amtrak stations, and mentions that at the top of the page.  The cash-starved Rock Island couldn't afford to join Amtrak, and ran their own intercity passenger trains until Illinois withdrew the operating subsidy and service was terminated on December 31, 1978.) By the 1980s, the station became part of the Metra system.

Tracks
The station has six tracks for in-service trains, four for the Rock Island and two for the Metra Electric. Of the Rock Island platforms, two are on the Beverly Branch, and two are on the main line. Each branch has one side platform, but all four tracks can be accessed. Most trains on the Beverly Branch terminate at this station, (except late at night,) and run inbound back to LaSalle Street Station.

The Metra Electric station, being a stub terminus, has two tracks and one island platform. It is currently the only accessible station on the Blue Island branch, and one of only two stations on the branch to have more than one track, the other being  where the line has a passing siding.

Bus connections
Pace

References

External links

Old image of former Rock Island Station (Rock Island Technical Society)
Station from Vermont Street from Google Maps Street View

Metra stations in Illinois
Former Chicago, Rock Island and Pacific Railroad stations
Vermont Street (Metra)

Railway stations in Cook County, Illinois
Railway stations in the United States opened in 1868
1868 establishments in Illinois
Former Illinois Central Railroad stations
1891 establishments in Illinois
Railway stations in the United States opened in 1891


text:
Utah, Colorado competition heating up before cooperation is the norm
By Bart Taylor | Jan 25, 2016
Two weeks ago, the Denver Business Journal reported that a national nonprofit organization with ties to outdoor recreation is poised to choose between Utah and Colorado for its new home, with a move sometime in 2016. That's no surprise to us; we've been speculating for over a year that both states will benefit from a growing trend among startups and established lifestyle companies to make the Rocky Mountains including the Wasatch Front, home.
I wrote about one company, Mercury Wheels, that relocated to Ogden from Mississippi after narrowing their choice to Colorado and Utah, and guessed at the time it would be an exercise duplicated often by other companies as the region's lifestyle attributes and focus on business prove hard to resist.
Colorado has gone so far as to copy Utah's Office of Outdoor Recreation as a means to fully develop industry-cluster strategies and gain a competitive edge in recruiting and developing lifestyle businesses. Fiona Arnold, executive director of Colorado's Office of Economic Development and International Trade, was excited about the development in the DBJ article.
"We know that the outdoor recreation industry is a really booming and growing industry. And for quite a while, Utah was kicking our butt," Arnold said in the DBJ. "Being able to recruit this organization if we can really starts to bring critical mass in the outdoor recreational industry to Colorado and allows us to be able to say we really own this space."
Arnold would likely acknowledge that simply creating the office and hiring a director to staff it won't overcome Utah's two- or three-year head start. Nor will landing a single company constitute 'owning' the space.
A more likely scenario is that each state will benefit from numerous relocations and a frothy startup environment for lifestyle companies regardless of economic development efforts. Colorado remains far away from developing a meaningful industry-cluster strategy to attract lifestyle businesses regardless of the development of its own Office of Outdoor Recreation.
For one, lifestyle manufacturers require a robust supply chain. Neither state can claim sufficient cut-and-sew labor to support gear and apparel makers; contract manufacturers required to machine and tool critical parts are here, but need sustained orders to invest in the sector and re-tool operations; and in Colorado, it's unclear how 'lifestyle' intersects with the state's economic development blueprint.
Despite this, industry is taking matters into its own hands. Lifestyle manufacturers like Osprey Packs sustain operations in both states. To them and others, what's needed is less a competition between states and more cooperation to develop a support ecosystem that spans the region.
Until then, it's each state for itself -- except here, at CompanyWeek. We're rooting for more 'coopetition' and less hyperbole.
Bart Taylor is publisher of CompanyWeek. Reach him at btaylor@companyweek.com.


text:
Live Review: Manic Street Preachers – 3rd December 2021 – Wembley Arena, London, UK
Welsh rockers Manic Street Preachers return to London to blow the roof off Wembley Arena with powerful career defining set! @Manics
Live Review: Steps – 27th November 2021 – O2 Arena, London, UK
.@OfficialSteps deliver 5 star pop spectacle at London's O2 Arena and we were there! @_clairerichards @faye_tozer @ianhwatkins @lslofficial @llatchfordevans
Live Review: Per Gessle – 19th November 2021 – Filidelfia Convention Centre, Stockholm, Sweden
Pop icon Per Gessle delivers 5 star Unplugged show for Stockholm fans and we were there!… @TheRealRoxette @LiveNationSwe @PartyPleaser
Rag'n'Bone Man – 6th November 2021 – Eventim Apollo, London, UK
English singer-songwriter Rory Graham, better known as Rag'n'Bone Man, rose to prominence after his 2017…
Live Review: Richard Ashcroft – 1st November 2021 – Royal Albert Hall, London, UK
Celebrating the recent release of his brand new album, Acoustic Hymns Vol. 1, singer-songwriter and…
Live Review: Michael Bolton – 25th October 2021 – Royal Albert Hall, London, UK
As the world gradually reacclimatizes to being back in packed venues again following 18 months…
Live Review: Erasure – 17th October 2021 – O2 Arena, London, UK
Electropop group Erasure, comprised of Andy Bell (vocals) and Vince Clarke (keyboards), has penned more…
Live Review: Turin Brakes – 9th October 2021 – Shepherds Bush Empire, London, UK
It's been a long 18 months since we last attended any form of live event….
Live Review: Tori Kelly – 16th March 2020 – Roundhouse, London, UK
Sam Etzioni
Tori Kelly – the song-writing, record-producing and arguably one of the most revolutionary musical sensations…
Live Review: Stereophonics – 6th March 2020 – O2 Arena, London
Welsh rockers Stereophonics made a victorious return to London's O2 Arena last night with a…
Live Review: The Script – 29th February 2020 – O2 Arena, London
Closing the end of a successful decade for the trio, frontman Danny O'Donoghue, drummer Glen…
Live Review: Little Mix- 31 October 2019- London O2 Arena
Multi-million selling British girl group Little Mix are more than half-way through their LM5 tour….
Live Review: The Cardigans – 7th December 2018 – Eventim Apollo, London, UK
One of Sweden's most successful musical exports returned to the capital this past weekend to…


Today a friend of mine had his site hacked, and when browsing to the site with Google Chrome it warned me that the site was infected with malicious code. Awhile back I provided an article regarding Monitor MythTV with Nagios. I figured I could write a Nagios check to see if a given site was listed on the Google Safe Browsing list. While this is far from sophosticated, it should provide a good start to monitoring the Google list for problems. You should also consider monitoring for posted or hidden content on your front-page, but that won't always catch malicious hackers.
command_line $USER1$/check_http -H www.google.com -u /safebrowsing/diagnostic?site=http://$ARG1$ -p 80 -s "This site is not currently listed as suspicious"
You'll notice that this check is not running supper frequently. We don't want to abuse Google's service, and we also can expect that they aren't checking your site all that frequently either. The check simply looks in the output "This site is not currently listed as suspicious" which indicates everything is OK (in theory) from Google's point of view.