I have suffered several times with the League of Legends Camera Lock bug! I can be playing and all of a sudden the Camera Lock gets enabled.
Once the Camera Lock gets enabled there seems to be no way of getting the camera lock to become disabled.
You can click on the Camera Lock button and nothing happens!
Originally I found if I wanted to fix the League of Legends Camera Lock bug I would just exit the game and re-join. As you know in LoL, time is very important. Just disconnecting and reconnecting can mean the game.
On the Minimap, Click AND Drag your mouse.
If it doesn't work try it a couple of time.
Then click around the Mini-map.
You should notice the Camera lock is now unlocked and everything is as it should!


text:
Q: Reset all control on ActiveSheet I need to reset all controls on Activesheet (not a userform) to null.
I tried to loop using ( OLEObject or Controls) but I got :

Run-time error '438': Object doesn't support this property or method.

At this line For Each ctrl In ActiveSheet.OLEObject .  I even tried to use the not recommended On Error Resume Next, But it did not help.
The activesheet only contains two TextBox (ActiveX) and one ComboBox (ActiveX)
Sub Reset_All_control_on_ActiveSheet()
    Dim ctrl As OLEObject
     For Each ctrl In ActiveSheet.OLEObject
        ctrl.Value = ""
     Next
End Sub

A: Please, try the next way:
     'your code...
     For Each ctrl In ActiveSheet.OLEObjects
        ctrl.Object.Value = ""
     Next

If you intent to place other oleObjects (in the future) you can condition the code to run only if the objects are of type TextBox of ComboBox:
   For Each ctrl In ActiveSheet.OLEObjects
     If TypeOf ctrl.Object Is MSForms.TextBox Or _
          TypeOf ctrl.Object Is MSForms.ComboBox Then 'to exclude other types...
        ctrl.Object.Value = ""
     End If
   Next

redpajama_set_name: RedPajamaStackExchange


131 .IX Title "RAND_load_file 3"
18ed9402 132 .TH RAND_load_file 3 "2008-09-27" "0.9.8i" "OpenSSL"
158 too small for the path name, an error occurs.
163 if \fBmax_bytes\fR is \-1, the complete file is read.
167 \&\fIRAND_load_file()\fR in a later session.
170 \&\fIRAND_load_file()\fR returns the number of bytes read.
MD 173 bytes written were generated without appropriate seed.
74dab6c2 178 .IX Header "SEE ALSO"
74dab6c2 181 .IX Header "HISTORY"
183 all versions of SSLeay and OpenSSL.


text:
Work With Us ---> 
Owner // Director
AGENCY REP: SHINE & POLISH EMAIL INSTAGRAM
FAA CERTIFIED DRONE OPERATOR: Flying DJI Inspire 2
Canon C300 MK III, Canon R5, and Canon 1DX MK III
A professional climber for twenty years, Jon has traveled the world climbing rocks up to 5.14 and V14. His authentic view of climbing and the Outdoor Industry grew from simple beginnings as a committed climber. Recently his focus has shifted from the rock to the camera as a director who captures the heart and soul of cutting-edge climbing. Through dedication and consistency he has grown his company, Louder Than Eleven, into one of the Outdoor Industry's most trusted production houses.
As an insider Jon works with pro athletes on their level and has directed a variety of award-winning features and international campaigns for The North Face, Mountain Hardwear, Marmot, Black Diamond, La Sportiva, Petzl, USA Climbing, Outdoor Research, and Buff. Jon shoots from precarious places where most filmmakers don't have the skills to go. He captures commercial quality images in both the vertical and horizontal worlds.
Jon enjoys hanging from the side of El Capitan capturing free ascents 3000 ft off the valley floor, climbing in the
Rocky Mountains and traveling to the corners of the earth to capture rare moments in sport. He likes to follow personalities and develop deep, authentic stories about talented people doing the coolest stuff out there.
JESSICA TALLEY
Photographer // Social Media
PORTFOLIO EMAIL INSTAGRAM
Jessica is a photographer based in Boulder, CO. Her first professional job was photographing concerts with her film camera as a teenager. She spends the majority of her time photographing dancers and creating commercial work in the outdoor industry, and rest of her time is spent researching and writing her doctoral dissertation on 19th century photography and history of the American West.
MIKE WIDEBURG
Music Producer // Fizzix Productions
FIZZIX WEBSITE EMAIL
Louder Than Eleven has partnered with FIZZIX Productions' Mike Wideburg to provide original music and sound design for all of our video productions. As one of the most innovative audio production companies in the outdoor industry today, FIZZIX Productions has developed a unique sound tailored exclusively for Louder Than Eleven and the outdoor industry.
Mark LOREM IPSUM

redpajama_set_name: RedPajamaCommonCrawl


text:
\section{Introduction}

Recently, cell-free (CF) massive multiple-input multiple-output (MIMO) systems have attracted a lot attention \cite{CF_LSFD,CF_SC, Nayebi_TWC} and   have been recognized as an effective and appealing approach for next generation wireless networks. CF massive MIMO systems consist of very large number of single-antenna distributed access-points (APs) serving simultaneously,  over same time/frequency resources,  a relatively small number of users \cite{CF_SC}. CF massive MIMO  improves considerably macro-diversity and  provides the network with substantially higher coverage probability.

	 CF massive MIMO can rely on channel reciprocity and  uplink  training in order to acquire  channel  state information  (CSI) by adopting time-division duplex (TDD) mode  \cite{CF_SC}.
With a large number of  APs, CF massive MIMO  can exploit  favorable propagation that results from mutual orthogonality of users' channel \cite{fp_massive}.  In \cite{CF_SC}, the authors leveraged favorable propagation to derive  closed-form expressions for the downlink  and uplink achievable rates  for CF massive MIMO systems.  The  spatial correlation resulting from  the distributed deployment of APs may however have a detrimental impact  on the favorable propagation. More specifically, users that are relatively closed to each other will incur high spatial correlation which will jeopardize the mutual orthogonality of the users' channel.

 Channel  hardening  and favorable  propagation  in CF massive MIMO  using stochastic geometry model  were investigated in \cite{DBLPzheng}. Therein, the authors concluded that  one may not completely rely on channel hardening and favorable propagation when
assessing  the system' performance since the derived bounds may not be tight  due to the  impact of spatial correlation between some users.  Consequently, improving favorable propagation in presence of distributed antennas systems is of great necessity.

 In this  work,   we  analyze how  spatial correlation between users' channels vector influences  favorable propagation and explore how to improve orthogonality between users' channel by taking into account solely the large-scale fading and the number of  available APs.
We establish a design optimization problem based on the perspective of user's scheduling. The proposed design advocates  how users' grouping can improve favorable propagation. However, the resulting optimization problem is difficult to solve in general. We demonstrate that the  formulated problem is NP-hard and  we invoke semidefinite relaxation (SDR) \cite{Luo_SDR}  approach to design a polynomial time solvable randomized procedure to find a sub-optimal solution to the NP-hard problem.  In addition to that, to increase users' throughput, we investigate the problem of  bandwidth allocation for the resulting scheduling design strategy.  The numerical results demonstrate that considerable performance improvement is achieved through the proposed efficient user grouping procedure and the bandwidth allocation scheme.

\vspace{-0.03cm}

	\section{System Model And Preliminaries}

	We consider a CF massive MIMO  system  that consists of of $K$ single omni-directional antenna users that are served simultaneously by $M$ single antenna APs. In this work, It is assumed that $K<<M$ and that the APs are using the  same  time-frequency  resources. APs are randomly located within a given  coverage area and  are managed by a central processing unit (CPU)  to  which  they are connected  through  perfect back-haul links.
	The CPU  handles  part of  the physical layer processing such as data coding and decoding.
	 Let $\bm{g}_{k} \in \mathbb{C}^{M \times 1}$,  denote the complex channel vector between user $k$ and all the APs. Specifically, the $m$-th  element,   $g_{mk}$ is the channel coefficient between the $k$-th user and the  $m$-th AP and is modeled as follows: \vspace{-0.1cm}
		\begin{align}\label{eq:channel_element}
		& g_{mk} = \sqrt{\beta_{mk}} h_{mk }
		\end{align}
	where $ h_{mk } \sim \mathcal{C}\mathcal{N}(0,1), m=1,\cdots,M,\quad k=1,\cdots,K,$ denote the small-scale fading coefficients which  are independent and identically distributed (i.i.d) while  $ \beta_{mk }, m=1,\cdots,M,\quad k=1,\cdots,K,$  the large scale fading coefficients that include path-loss and shadowing.

	Similarly to the work done in \cite{CF_SC}, we assume uplink/downlink  channels reciprocity.
Provided that the system operates according to a TDD protocol,  each coherence interval is divided between  uplink training,  downlink and uplink data  transmission. In  order to   perform  multiplexing and  de-multiplexing, the APs need to acquire CSI  through  uplink training.
Let $T_c$ be the length of the  coherence interval (measured in samples) and  $\tau$,  the uplink training duration with $\tau < T_c$.  During the  uplink  training  phase, a maximum of  $\tau$ users simultaneously send  their pilot  sequences   to the APs. Under such setting,     we consider a set of orthonormal training sequences, denoted by $ \mathbf{q} _k\in \mathbb C^{\tau \times 1}, \forall k=1, \cdots, \tau$ such that $  \mathbf{q} ^{\dagger}_k  \mathbf{q} _j =\delta_{kj} $ (with $\delta_{kj}$ be the Kronecker delta).

Channel estimation is  performed in  a decentralized fashion where each AP $m$ independently estimates $g_{mk}$ of  the  $\tau$ active users. The received pilot vector signal at  the $m$th AP can be expressed as \vspace{-0.3cm}
 		\begin{align}\label{eq:uplink_training}
 		& \bm{y}_{m,p}=   \sqrt{\rho_p} \sum\limits_{k=1}^{\tau} g_{mk}  \mathbf{q} _k + \bm{n}_{m,p}
 		\end{align}
  where $\rho_p$ is the transmit power during the training phase  and $\bm{n}_{m,p}$ is the  additive Gaussian noise vector at the $m$-th AP. The elements of  $\bm{n}_{m,p}$  are i.i.d. random variables.
  The $m$-th AP  performs minimum mean-square error  (MMSE) channel estimation  using $\bm{y}_{m,p}$  in order to  obtain the channel estimates  given by \vspace{-0.3cm}
	\begin{align}\label{eq:channel_estimates}
	& \hat{g}_{mk}=   \frac{\sqrt{\rho_p}  \beta_{mk}   }{  \rho_p  \beta_{mk}       +1} \big( \sqrt{\rho_p}  g_{mk}  + \bm{n}_{m,p}  \mathbf{q} ^\dagger_k \big),  \,   k=1,\cdots,\tau
	\end{align}
Since  the pilot sequences are mutually  orthogonal, there  is no  pilot contamination and  the channel  estimate of each user  $k$ is independent of    $g_{mj}, \forall j \neq k$.
Each AP  independently  estimates the channel for each active user  and  the channel estimate is then used to precode the downlink signal. As in \cite{CF_SC}, we assume that conjugate beamforming is employed to communicate with the active users. Consequently, the transmit signal  of the  $m$-th AP can be expressed as \vspace{-0.3cm}
	\begin{align}\label{eq:downlink_ap}
	& y_{m,d}= \sqrt{\rho_d} \sum\limits_{k=1}^{\tau} \hat{g}^*_{mk} d_k
	\end{align}
where $d_k$ with  $\E{\lvert d_k\rvert^2}=1$,  denotes  the data symbol intended to user $k$ while $\rho_d$, the  downlink transmit power. The  received signal at the $k$-th user  is then given by
\begin{align}\label{eq:dsignal_k_user_decomposition}
	& r_{k,d}= \sqrt{\rho_d} \left(  \sum\limits_{m=1}^{M} {g}_{mk} \hat{g}^*_{mk} d_k+
	 \sum\limits_{m=1}^{M} \sum\limits_{j \neq k}^{\tau}  {g}_{mk} \hat{g}^*_{mj} d_j \right)+ n_{k,d},
	\end{align}
where $n_{k,d}$ denotes the white additive Gaussian noise at user $k$.
By assuming  a large number of APs, users can detect their downlink data using only the channel statistics \cite{CF_SC}. The resulting  rate  of a given user $k$  can be written as \cite{EE_CF}
	{\small{\begin{align}\label{eq:dsignal_k_user_decomposition}
	& R_{k,d}= \mathcal{B} \big(1-  \frac{\tau}{T_c} \big)\; \text{log}_2 \left(	1+\frac{\rho_d (\sum\limits_{m=1}^{M} \nu_{mk}     )^2   }{\rho_d\sum\limits_{m=1}^{M} \sum\limits_{j =1}^{\tau}  \nu_{mk'} \beta_{mk} +1}  \right)
	\end{align}}}where $\mathcal{B}$ denotes the  bandwidth of the system and $ \nu_{mk}\triangleq  \frac{\rho_p\beta_{mk}^2}{1+\rho_p\beta_{mk}} $  is the  variance of $\hat{g}_{mk}$, the MMSE estimate of the channel.

	\section{ Improving favorable propagation:  which users can be active simultaneously?}

	Favorable propagation  represents an important property in   large antenna systems. It refers to  the  mutual  orthogonality between users' vector wireless channel.
	With favorable propagation, the overall system' performance is guaranteed to be very appealing with simple linear processing \cite{fp_massive} since the effect of interferences is considerably attenuated.
	To  obtain favorable propagation, users' channel vectors need to  be mutually orthogonal, i.e
				\begin{equation}\label{eq:favorable}
				\begin{aligned}
				&  \bm{g}^\dagger_k \bm{g}_j=
				\left\{
				\begin{array}{ll}
				0 & \mbox{if $k\neq j$,}  \\
			     \lVert \bm{g}_k\rVert^2  \neq 0& \mbox{otherwise, }
				\end{array}
				\right.\\
				\end{aligned}
				\end{equation}
	Practically, the condition in \eqref{eq:favorable} cannot be exactly met, but it can be approximately  achieved. This is the case when
	 the number of antennas  grows large and the  channels are said to provide  asymptotically favorable propagation. The asymptotically favorable propagation condition is  stated as
	 	\begin{align}\label{eq:favorable_asympt}
	 	&     \frac{\bm{g}^\dagger_k \bm{g}_j}{M}      \longrightarrow  0,\; M  \longrightarrow\infty  \quad  \text{for} \quad k \neq j,
	 	\end{align}
	By using the channels gain from each AP to the users, equation \eqref{eq:favorable_asympt}  can be  equivalently rewritten  as
		\begin{align}\label{eq:favorable_asympt_product}
		&     \frac{ \sum\limits_{m=1}^{M} \sqrt{\beta_{m,k}}  \sqrt{\beta_{m,j}} h^*_{m,k} h_{m,j}}{M}      \longrightarrow  0  \quad  \text{for} \quad k \neq j,
		\end{align}
	Contrarily to collocated massive MIMO systems,  the large scale fading coefficients from  each AP to  a given user are different in a cell-free Massive MIMO network.  Intuitively, this  spatial diversity will  have a considerable impact on  the favorable propagation.
	 Consequently, spatial channel correlation is an important parameter that need to be taken into consideration  to  improve favorable propagation in the system.

	In a practical scenario,   the  number of APs can be made very  large but cannot grow indefinitely. Provided that asymptotically favorable propagation is achieved when $M$ tends to infinity, the condition in \eqref{eq:favorable_asympt} will not meet for practical scenario.  Given that favorable propagation is important to achieve good performance of CF massive MIMO, we use a different perspective to make condition in \eqref{eq:favorable_asympt} works for practical scenario.  To do so, we leverage  the complementary  cumulative distribution function  of the  inner product  between two given users'  channel \vspace{-0.5cm}
	   \begin{align}\label{eq:favorable_asympt_prob}
	   &   P_\theta= \mathbb{P} \left\{\frac{\bm{g}^\dagger_k \bm{g}_j}{M}  \geq \theta    \right\}
	   \end{align}
 Concretely,  to  improve favorable propagation, $P_\theta$ should be as close to zero as possible for any value of  $\theta \geq 0$.  Making  $P_\theta, \;\forall \theta \geq 0$ arbitrarily small  means that the users' channel vectors achieve \emph{near orthogonality}.
   Using  Chebychev's inequality \cite{prob_ineq},  $P_\theta$ can be lower-bounded  by
   \begin{align}\label{eq:favorable_inequality}
   &   P_\theta= \mathbb{P}\left \{  \frac{\bm{g}^\dagger_k \bm{g}_j}{M}  \geq \theta   \right\}    \leq  \frac{1}{1+ \frac{M^2 \theta^2}{\sum\limits_{m=1}^{M} {\beta_{m,k}}  {\beta_{m,j}}}} ,
   \end{align}
	 From~\eqref{eq:favorable_inequality}, it can be observed that a viable way to reduce the value of $P_\theta$,  is  to minimize the inner product  between the users large scale  fading  vectors i.e., $ \sum\limits_{m=1}^{M} {\beta_{m,k}}  {\beta_{m,j}}$ which quantifies the  spatial  correlation  between the channels  of users  $k$ and $j$. 	Consequently, reducing spatial  correlation  between active  users' channel  in a CF massive MIMO  system can considerably improve favorable propagation.

 One plausible way to reduce spatial correlation is to resort to appropriate selection of active users. In this  work, we construct a user' scheduling optimization problem that  enables  users to be active simultaneously  only when their  channels have low  spatial correlation.   Our proposed scheme is discussed in the next section.
\vspace{-0.5cm}
	 \subsection{Graphical Modeling and proposed solution}
	In the  considered setting,  the first step is  to construct a spatial  correlation graph that  captures the level of  favorable  propagation  for a set of users which are active  simultaneously.
	More specifically,   we design an undirected favorable propagation graph $\mathcal{G}(\mathcal{V},\mathcal{E})$. The set of of vertices  $ \mathcal{V} $ represents the users  in the  coverage  area. Each edge  $e_{k,j} \in \mathcal{E}$ is associated with  a weight $\omega_{k,j} \triangleq  \sum\limits_{m=1}^{M} \beta_{mk} \beta_{mj}, $ which is directly related to the spatial  correlation between the two users channel.
    Using  the constructed graph $\mathcal{G}(\mathcal{V},\mathcal{E})$, we  formulate a user selection optimization  problem.

    The considered optimization consists of minimizing the  spatial correlation between the channels  of  users that belong to the same group. Consequently, we formulate a problem where we maximize the inter-group weights. The latter is equivalent to  constructing  groups with improved favorable propagation since users having high spatial correlation between their channels will be allocated to different groups.
   It is worth mentioning that  the resulting  uplink training  overhead should be taken into account in the formulated optimization problem. To this end, the cardinality of each group should not violate a certain threshold  so that CSI  estimation can be performed without  pilot contamination  with a maximum  training sequence of length  $\tau$. Moreover,  to fully exploit spatial  diversity, a  given user  is allowed to belong to multiple  groups simultaneously.

Define the following variable
    \begin{equation}
    \begin{aligned}
    & x_{k,c}   =
    \left\{
    \begin{array}{ll}
    1  & \mbox{if  user $k $ is allocated to the $c$-th group}  \\
    0 & \mbox{otherwise}
    \end{array}
    \right.\\
    \end{aligned}
    \end{equation} The user scheduling problem is formulated  as the following  combinatorial optimization problem
             \begin{equation}\label{eq:problem_grouping}
			\begin{aligned}
		\max_{\substack{ x_{k,c}  \in \{0, 1\} , \,\forall c, \forall k}}~& \sum_{c=1}^{C}  \sum_{k \in\mathcal{V} }^{} \sum_{j \in\mathcal{V}, j \neq k}^{}  w_{k,j}\left( 1- x_{k,c} \right)x_{j,c}\\
		\text{s.t.} 	~&  \sum_{c=1}^{C} x_{k,c} \leq \alpha, \forall k \in  \mathcal{V}    ,\\
			~&  \sum_{k \in\mathcal{V}}^{}  x_{k,c} \leq \tau  , \forall c=1,\ldots,C,
			\end{aligned}
               \end{equation}
where $C$ denote the total number of groups and $\alpha$, the maximum number of groups to which a user can belong at the same time.

Before proceeding to solve problem \eqref{eq:problem_grouping}, we  investigate its  computational tractability for $\alpha=1$. This is done through the following lemma.
			\begin{lemma}
			Problem \eqref{eq:problem_grouping} is  NP-hard in general.
			\end{lemma}
	\emph{Proof:}  		We demonstrate the NP-hardness of problem \eqref{eq:problem_grouping} by considering a special case of our setting. Specifically, we study the complexity of problem \eqref{eq:problem_grouping} for $\alpha=1$ and  $C*\tau \geq K$. It refers to the case where  each user is allocated,  at most, to one group and the constraints allow each users to be allocated at least once.
The goal is to build the equivalence between this special case and the problem of partition into cliques of bounded size which is defined as follow \cite{hard1}:
		\begin{Definition}\label{Definition_problem}
					Consider a graph $\mathcal{G}(\mathcal{V},\mathcal{E})$, a set function $f : 2^\mathcal{V} \longrightarrow R^+$ and a bound $\tau \in  Z^+$. The
					problem is to find a partition of the graph $\mathcal{G}$ into cliques $K_1,..., K_C$ of size at most $\tau$, that is,$ \lvert K_c\rvert \leq \tau, c = 1,..., C$, such that the objective function $\sum_{c=1}^{C} f(K_c)$ is minimized.
				\end{Definition}
		For $\alpha=1$, the maximization of the objective function of \eqref{eq:problem_grouping} is equivalent to maximizing $ \sum_{c=1}^{C}  \sum_{k \in\mathcal{V} }^{} \sum_{j \in\mathcal{V}, j \neq k}^{}  w_{k,j}  -\sum_{c=1}^{C}  \sum_{k \in\mathcal{V} }^{} \sum_{j \in\mathcal{V}, j \neq k}^{}  w_{k,j} x_{k,c}x_{j,c}$.
		As $C*\tau \geq K$, each user will be allocated to a given cluster. The first sum is then nothing but $2$ times the total weight between users.
		The considered optimization is then equivalent to minimizing $\sum_{c=1}^{C}  \sum_{k \in\mathcal{V} }^{} \sum_{j \in\mathcal{V}, j \neq k}^{}  w_{k,j} x_{k,c}x_{j,c}$.
			Consequently, the simplified  setting, with the cardinality constraints per group,  is equivalent to solving  a cardinality constrained graph partitioning into cliques  that minimizes the sum of  the clique functions given here by $\sum_{c=1}^{C} f(K_c)= \sum_{c=1}^{C}  \sum_{k \in\mathcal{V} }^{} \sum_{j \in\mathcal{V}, j \neq k}^{}  w_{k,j} x_{k,c}x_{j,c}$.

			In graph theory,  a clique is a subset of vertices of an undirected graph with complete induced subgraph.
					The aim of the problem given in Definition (\ref{Definition_problem}) is to partition the graph into cliques $K_1..K_{C}$ of maximum size $\tau$ such that
					the sum of the cost function over the cliques is minimized. The cost function in our case is given by the sum of the edges'  weights  that have both their endpoints in the same  cliques.
					Cardinality constrained graph partitioning into cliques with cost minimization contains  the	classic NP-hard clique cover
					problems. It is known as an NP-hard  problem even with a submodular cost function  in complete graphs \cite{hard1}. Considering that problem \eqref{eq:problem_grouping} is equivalent to solving a cardinality constrained graph partitioning into cliques with cost minimization on the complete graph of spatial correlation,   we  deduce that  it  is a NP-hard problem.

				One can prove the NP-hardness  of \eqref{eq:problem_grouping} by another method. In fact, we can show that for $\alpha= 1$, \eqref{eq:problem_grouping} is equivalent to another NP-hard problem, namely the capacitated max-$C$-cut problem. We skip the details for brevity.

					\hfill{$\blacksquare$}

Since problem \eqref{eq:problem_grouping} is NP-hard for alpha=1,  its global optimal solution cannot be found by mean of  polynomial time solvable algorithms. For the general case of problem \eqref{eq:problem_grouping},  where $\alpha \neq 1$, we design here a low-complexity algorithm to find a local optimal solution to problem \eqref{eq:problem_grouping}. To do so, we will resort to semidefinite programming \cite{Vandenberghe_1996}.

Define following variables and changes of variables
                       \begin{equation}\label{eq:variables}
			\begin{aligned}
     \mathbf{x} _c ~& \triangleq \left(x_{1,c} \cdots, x_{K,c}   \right)^\top, \,  \mathbf{y} _c \triangleq 2 \mathbf{x} _c-\mathbf{1}_K \\
 \mathbf{W} ~& \triangleq
\begin{pmatrix}
 0 & w_{2,1}& \cdots & w_{K,1}  \\
w_{1,2} & 0& \cdots & w_{K,2}  \\
\vdots & \vdots& \ddots & \vdots  \\
w_{1,K} & w_{2,K} & \cdots & 0  \\
\end{pmatrix}
			\end{aligned}
                       \end{equation}
where $\mathbf{1}_K$ is a column vector which entries are $1$.  Using \eqref{eq:variables}, problem \eqref{eq:problem_grouping} can be equivalently reformulated as
\begin{subequations}\label{prob:optim_equi}
\begin{align}
\max_{\substack{ }}~&\frac{1}{4} \sum_{c =1}^{C}\left( \varsigma - \mathbf{y} _c^\top  \mathbf{W}    \mathbf{y} _c  \right)   \\
\text{s.t.} ~& \sum_{c=1}^C  \mathbf{y} _c \leq \bar{\alpha} \label{eq: constra_1}\\
~&  {\mathrm{Tr}} \left(  \mathrm{diag} \left( \mathbf{y} _c   \right)  \right) \leq \bar{\tau}, \, \forall c  \label{eq: constra_2}\\
~& \mathbf{y} _c  \in \{-1,1 \}^K, \forall c
\end{align}
\end{subequations}
where $\varsigma =\mathbf{1}_K^\top \mathbf{W} \mathbf{1}_K, \,   \bar{\alpha}= 2\alpha-C, \, \bar{\tau}= 2\tau-K$. The proposed method consists of combining the semidefinite relaxation method \cite{Luo_SDR} with the \emph{Schur complement} \cite{Stephen2004}. More specifically,  the quadratic terms $ \mathbf{y} _c^\top  \mathbf{W}    \mathbf{y} _c=  {\mathrm{Tr}} \left( \mathbf{W}    \mathbf{y} _c  \mathbf{y} _c^\top \right), \, \forall c $ of the optimization problem \eqref{eq:problem_grouping}  is approximated by the linear terms $ {\mathrm{Tr}} \left(  \mathbf{W}   \mathbf{\text{Y}}_c \right), \, \forall c  $ with the rank-one matrices $  \mathbf{y} _c \mathbf{y} _c^\top, \, \forall c$ being replaced by  positive semidefinite matrices  $\mathbf{\text{Y}}_c, \, \forall c$ of arbitrary rank.   The approximated problem is therefore formulated as
\begin{equation}\label{prob:optim_sdr_approximation}
\begin{aligned}
\max_{\substack{ \mathbf{\text{Y}}_c \succeq  0, \,\forall c }}~&\frac{1}{4} \sum_{c =1}^{C}\left( \varsigma - {\mathrm{Tr}} \left(  \mathbf{W}   \mathbf{\text{Y}}_c \right)  \right)   \\
\text{s.t.} ~& \sum_{c=1}^C  \mathbf{y} _c \leq \bar{\alpha} \\
~&  {\mathrm{Tr}} \left(  \mathrm{diag} \left( \mathbf{y} _c   \right)  \right) \leq \bar{\tau}, \, \forall c \\
~&  \mathrm{diag} \left(\mathbf{\text{Y}}_c  \right)=\mathbf{1}_K \\
\quad~&
\begin{pmatrix}
\mathbf{\text{Y}}_c&  \mathbf{y} _c  \\
 \mathbf{y} _c^\top & 1
\end{pmatrix}
\quad \succeq  0, \, \forall c  \\
\end{aligned}
\end{equation}
Problem \eqref{prob:optim_sdr_approximation} is a standard convex optimization problem and can be efficiently solved using interior-point based solvers such as CVX \cite{cvx}. Since the optimization problem \eqref{prob:optim_sdr_approximation} is a relaxation of problem \eqref{prob:optim_equi}, the  optimal $\mathbf{\text{Y}}_c^\star, \,\forall c $ may not be of rank one. Hence, we resort to a randomized procedure, in the vein of Gaussian randomization \cite{Luo_SDR}, to convert the optimal solution of \eqref{prob:optim_sdr_approximation} into a feasible solution to problem \eqref{prob:optim_equi}. The proposed randomized scheme is summarized in Algorithm \ref{alg:random_algol}

\begin{algorithm}[H]
\begin{algorithmic}[1]
\STATE {\bf{input}} an optimal solution $\mathbf{\text{Y}}_c^\star, \,\forall c $ to problem \eqref{prob:optim_sdr_approximation}.
\STATE Generate $\bm{\xi}_c \sim \mathcal{N} (\bm{0},\mathbf{\text{Y}}_c^\star ), \, \forall c$;
\STATE Set $\widetilde{\bm{\xi}_c}= \bm{\xi}_c /  {\mathrm{Tr}} \left(  \mathrm{diag} \left(\bm{\xi}_c  \right) \right), \, \forall c$;
\STATE Generate $L$ vector samples $\widetilde{ \mathbf{y} }_c^l, \, l=1,\cdots, L$ feasible for problem \eqref{prob:optim_equi} such that each entry $ \widetilde{y}^l_{k,c}, \, k=1,\cdots, C $  is drawn from the following distribution: \vspace{-0.2cm}
 \begin{equation}
    \begin{aligned}
    & \widetilde{y}_{k,c}^l   =
    \left\{
    \begin{array}{ll}
    1  & \mbox{with probability $(1+\widetilde{\xi}_{k,c})/2$}  \\
    -1 & \mbox{with probability $(1- \widetilde{\xi}_{k,c})/2$}
    \end{array}
    \right.\\
    \end{aligned}
    \end{equation}
\STATE Compute {\small{$l^\star= \arg max_{l=1,\cdots, L}\frac{1}{4} \sum_{c =1}^{C}\left( \varsigma - \left(\widetilde{ \mathbf{y} }_c^l\right)^\top  \mathbf{W}   \widetilde{ \mathbf{y} }_c^l \right) $}}
\STATE {\bf{output}} the solution $\widehat{ \mathbf{y} }_c= \widetilde{ \mathbf{y} }_c^{l^\star}, \, \forall c$.
\end{algorithmic}
\caption{A randomized algorithm  to solve  problem  \eqref{prob:optim_equi} }
\label{alg:random_algol}
\end{algorithm}

\subsection{Bandwidth allocation problem}
Once a solution to problem  \eqref{prob:optim_equi} is found, we proceed to investigate the problem of bandwidth allocation. We denote $\Gamma(c)$, the set of users that belong to group $c$.  Each  group will be active  over the assigned spectrum.  The problem is formulated as \vspace{-0.3cm}
      \begin{equation}\label{eq:problem_Bandwidth}
	\begin{aligned}
\max_{\substack{ 0 \leq \gamma_c  \leq 1, \,\forall c }}~&  \sum_{c, k \in{\Gamma}(c)}^{}\gamma_c  \widetilde{R}_{k,c} \\
       \text{s.t.} ~&\overline{R}_k \leq \sum_{c=1}^{C}\gamma_c \widetilde{R}_{k,c}, \forall k \\
	~&  \sum_{c=1}^{C} \gamma_c \leq 1
       \end{aligned}
  \end{equation}
where ${\small{\widetilde{R}_{k,c} \triangleq \mathcal{B} \frac{T_c- \lvert {\Gamma}(c) \rvert}{T_c} \; \text{log}_2 \left(	1+\frac{\rho_d (\sum\limits_{m=1}^{M} \nu_{mk}     )^2   }{\rho_d\sum\limits_{m=1}^{M} \sum\limits_{ \substack{k' \in \Gamma(c)\\ k' \neq k} }^{\tau}  \nu_{mk'} \beta_{mk} +1}  \right ) }} $ is the rate of  the $k$th user within group $c$. And, $\overline{R}_k$ is the minimum rate requirements for the $k$th user. Problem \eqref{eq:problem_Bandwidth} is a convex linear optimization problem and the optimal solution can be found using the interior-point method \cite{Stephen2004}.

		\section{Numerical results}

		 In this section,  numerical  results  are provided in order to assess the performance of  the  proposed schemes. We consider  a circular region having an  area of $1 \; \text{Km}^2$ where $M$ APs and $K$ users are randomly located according to a uniform distribution. 	The  large-scale fading coefficients include the impact of the  path loss, which  is computed using
	    a three slope  path loss model \cite{EE_CF}, and  log-normal shadow fading with standard deviation $\sigma_{sh}$. The large-scale fading coefficient  $\beta_{mk}$ from user $k$ and AP $m$ is given by
\vspace{-0.01cm}
			 {\small{   \begin{equation}\label{eq:pathloss}
			    \begin{aligned}
			    & \beta_{mk}= \left\{\begin{array}{ll}
			   & (-L-35\;\text{log}_{10}(r_{mk})  ) \times SF_{mk},\; \mbox{if  $r_{mk}>  d_1$,}  \\
			   & (-L-15\;\text{log}_{10}(d_1) -20\;\text{log}_{10}(r_{mk}))\times SF_{mk}\\
			   &  \qquad\qquad\qquad\qquad\qquad\qquad\mbox{if $d_0\leq r_{mk}\leq  d_1$, } \\
			   & ( -L-15\;\text{log}_{10}(d_1) -20\;\text{log}_{10}(d_0)) \times SF_{mk} \\
			  &  \qquad\qquad\qquad\qquad\qquad\qquad\qquad\mbox{if $ r_{mk}<  d_0$. } \\
			    \end{array}
			    \right.\\
			    \end{aligned}
			    \end{equation}}}where $SF_{mk}$ denotes the log-normal shadow fading between user $k$ and AP $m$ and  $	L$ is a constant depending on the carrier frequency,  the user and AP heights. All other simulation parameters are summarized in  Table \ref{parameters}. The performance of the proposed scheme is compared with the approach provided in \cite{CF_SC} but with uniform power allocation (we  refer to this  scheme as conventional CF).
			\begin{center}
				\footnotesize{
				\begin{tabular}{|c|l|c|l|}
					\hline
				Carrier frequency & $1.9 \;\text{GHz}$ & Bandwidth & $20 \; \text{MHz}$\\
					\hline
					Noise figure & $ 9 \; \text{dB} $ & AP antenna height & $15 \;\text{m}$\\
						\hline
						$\sigma_{sh}$& $8 \;\text{dB} $ & User antenna height & $1.7 \;\text{m}$\\
					\hline
						$T_c$& $   200   $ & $\rho_d, \rho_p$  & $200, 150 \;\text{mW} $\\
						\hline
				\end{tabular}
								\captionof{table}{Simulation parameters}\label{parameters}
				}
			\end{center}

			\begin{figure}[!]
			\centering
			\includegraphics[scale=.51]{cdf_corr}
			\captionsetup{font=footnotesize}
			\caption{Comparison of CDFs of normalized large-scale fading correlation for  $K=20,\alpha= 6, C=4$   \label{fig:CDF_coorelation} }
		\end{figure}

			Figure \ref{fig:CDF_coorelation} shows the impact of the proposed spatial grouping (SG) on the normalized large-scale fading correlation for different values of  $M$.
		We can see that appropriate spatial user grouping  substantially reduces spatial correlation within each group which results in more favorable propagation. From Figure \ref{fig:CDF_coorelation}, we observe that  SG enables to achieve, for $M=100$, spatial correlation levels comparable to conventional CF with $M=200$. This means that SG can be a very practical alternative to  network densification.

	Figure \ref{fig:AVG_SRD} exemplifies the average downlink net throughput versus the number of APs ($M$) for  $K=10$ and $15$,  respectively.
	Figure \ref{fig:AVG_SRD} demonstrates that the performance of both approaches improves as M increases. This is  a direct consequence of  array gain increase. In addition,  Figure \ref{fig:AVG_SRD} also shows that the proposed SG with bandwidth allocation (BA) outperforms the conventional CF system. This is due to the fact that SG improves favorable propagation within each group. Indeed,   SG enables gains of  $18.5\%$  and $17.05\%$, for  $(M=100, K =10)$ and  $(M=100, K =15)$, respectively. Consequently, appropriate user grouping and selection can be a more practical and cost efficient alternative to  increasing the number of APs. Indeed,  for $K=15$, SG achieves approximately the same downlink throughput ( $14.956 \; Mbits/s$) at $M=85$ as the conventional CF system with $M=100$.

			\begin{figure}[!]
			\centering
			\includegraphics[scale=.51]{sum_rate}
			\captionsetup{font=footnotesize}
			\caption{Average Downlink Throughput versus the number of APs and different K values ($\tau=K$)   \label{fig:AVG_SRD} }
		\end{figure}
			\section{Conclusion}

			In this work, we   investigated how favorable propagation can be  improved in  CF massive MIMO systems. We formulated an NP-hard spatial  user grouping problem based on  large-scale fading coefficients. We  designed an  SDR-based algorithm to find an efficient  sub-optimal solution. Orthogonal  frequency resources are also allocated to the spatial  groups. The simulation results showed that reducing  spatial  correlation between  active users through  efficient  spatial  grouping  considerably improves favorable  propagation, increases the  average throughout and enables to  achieve better performance with lower numbers of APs.

redpajama_set_name: RedPajamaArXiv


Sure you are one of those who spend all day stuck in Netflix all day and not find anything new to watch. But not to worry, each month, Netflix renews his catalog in Mexico and brings new content so you don't get bored with the same options. So as is usual, in October get new series and movies that will interest you. Some are brand new and others are more productions to old, but what is important is that there are for all tastes and ages. Discover with us, everything new on Netflix Mexico that arrives in September.
In October, Netflix we re-connect with the witch Sabrina with their new original series. However, with Kierna Shipka embodying the new Sabrina, we'll see a different story from the one you already enjoy in the years 90, but that will still full of witchcraft, mystery and adventure.
The first season of this documentary series recounts the case of Steven Avery, a man who served 18 years in prison for a crime he didn't commit, being accused of murder, together with his nephew. The series emphasis on dramatic analysis of the events that led to the prosecution of Avery and Brendan Dassey, eliciting responses from both the White House and Supreme Court. The second season explores the aftermath of these events, and the appeals made.
The series that started the collaboration of Marvel with Netflix returns with a third season, and will have to achieve a lot to top the success of the first two seasons of the series, with the watchful blind Matt Murdock (Charlie Cox) and the memorable villain, Wilson Fisk (Vincent D'onofrio), as well as a tremendous cast of secondary characters.


text:
Alliance secretariat
Advocacy & campaigns
Strengthening community groups
May 2017 Change Agents Meeting
July 2014 meeting
Feb 2014 meeting
Oct 2013 meetings
SALT Alliance Members are all independently registered South African non-profit organisations. Their common focus is family and community strengthening through work with children, youth, couples, families and community groups (such as local churches, women's groups, youth groups, food security groups).
Work is across a range of topics including health and HIV, youth life skills (including sexual and reproductive health), care, protection and development of vulnerable and orphaned children, income generation, agriculture. Members share an active, biblical Christian world view and faith.
Geographical reach
Nakekela Christian Community Centre (NCCC) is a "Step Down Facility/Hospice" giving care to the terminally ill in the greater KwaMhlanga community.
Nakekela's mission is to render palliative and curative care in a holistic manner to both in– and out–patients in the KwaMhlanga Community whose lives are impacted by HIV/AIDS.
Find out more at www.nakekela.co.za or follow Nakekela on Facebook: Nakekela-Christian-Community-Centre-Association.
eThembeni, formerly CMD Usizo Aids Trust, meaning "place of hope", supplies holistic, relevant social services in KwaZulu-Natal, South Africa, focusing on the more rural, poor communities of the uThukela district and the uMsinga municipality. eThembeni's services address HIV and Aids-related issues and encourage communities to take control of their own situation in their private life, family structures and society.
This is achieved through Home Based Care, Self Help Groups, Early Childhood Development training, Life/Sport Skills at schools, Family Preservation interventions, assisting religious leaders to understand HIV and to create congregations that are without bias, and outreach to orphans and vulnerable children (OVC).
Find out more about eThembeni at www.ethembeni.org or visit their Facebook page: ethembeni.kzn
Mfesane is a Christian Development Agency whose vision is to empower communities. Mfesane has developed several successful programmes to address the basic needs of vulnerable groups including a Church Mobilisation Programme, HIV Counselling and Testing; Palliative Care; Orphans and Vulnerable children; Peer Education ; Community Development; Skills Development in Ancillary Health Care, Child and Youth Care Work, New Venture Creation, Community Development, Welding and Bricklaying.
Find out more about Mfesane at www.mfesane.org.za or follow them on Facebook: mfesaneza
Thembalethu Christian Community Centre delivers a comprehensive service to orphans and vulnerable children and their families - from early childhood development (ECD) to teenagers - addressing their physical, spiritual, social, emotional and educational needs.
Located in KwaMhlanga, Mpumalanga (90 km from Pretoria), the Centre currently reaches approximately 110 orphaned and vulnerable children between the ages of 2 and 18 from the local community, and their care-givers and addresses the immediate needs of the beneficiaries as well as the cause (root) of the problem. Although they receive some subsidies from the government and uses fund-raising to generate needed income, they are also engaged in economic activities to contribute towards sustainability.
Find out more about Thembalethu Christian Community Centre at thembalethucommunitycentre.weebly.com or visit their Facebook page: Thembalethu Center
Thembalethu Nkomazi is located in the Nkomazi region of Mpumalanga province, on the border of Swaziland and Mozambique. Thembalethu Nkomazi offers home-based care, orphan care, spiritual counseling, social welfare, garden projects, burials, health services and food parcel distribution.
Thembalethu Nkomazi has an active online presence. Visit their website www.thembalethu.biz or find them on Facebook: thembalethunkomazi.
Trans World Radio Africa's (TWR Africa) vision is to reach the world for Christ through mass media so that lasting fruit is produced. As a ministry unit within TWR Africa, SALT works with TWR-KZN. Its offices are located in Botha's Hill, just outside Durban.
TWR Africa works in close partnership with the church, media networks, organizations and the private sector to make disciples of Jesus Christ. Within South Africa it produces relevant programmes to address the challenges of the nation through mass media.
Visit TWR Africa online at www.twrafrica.org or find them on Facebook: TWR Africa
"The thief comes only in order to steal, kill, and destroy.
I have come in order that you might have life—life in all its fullness."
Alliance groups
Prioritising families


text:
Project Lifecycle
Develop A Proposal
Route and Submit Your Proposal
Set Up, Manage, Close out
Sponsored Operations
VP for Research Office
Associate VP for Research Development
Associate VP for Research Administration
Innovation and Commercialization
Research Facts and Figures
Guidelines, Procedures, and Policies
Proposal Processing
Budget Justification Sample
Equipment Grants
Vice President for Research Office
Annual Requirements and Reauthorization
Shared Facility Equipment
Equipment Finder
Foreign Visitor Procedures
Limited Submission Guidelines and Opportunities
Proposal and Award Guide
COVID-19 Research Protocols
Equipment Grants Available
Below is a list of federal opportunities for equipment acquisition and equipment development. Keep in mind that many federal sponsors allow for the purchase of equipment items on many research projects provided they are necessary to the project's performance and sufficiently justified in the project proposal and justification.
If you have questions about the opportunities listed below, or any other funding opportunities, we encourage you to contact the Research Development team to discuss your funding needs.
The National Science Foundation (NSF)
Major Research Instrumentation Program (MRI)
Program: Major Research Instrumentation Program (MRI)
Deadline: January 1-19, annually
Award Amount: Track 1: $100,000-$1,400,000; Track 2: $1,400,000-$4,000,000; Track 3: $100,000-$1,400,000 for requests that include the purchase, installation, operation, and maintenance of equipment and instrumentation to reduce consumption of helium.
Description: The Major Research Instrumentation (MRI) Program serves to increase access to multi-user scientific and engineering instrumentation for research and research training in our Nation's institutions of higher education and not-for-profit scientific/engineering research organizations. An MRI award supports the acquisition or development of a multi-user research instrument that is, in general, too costly and/or not appropriate for support through other NSF programs.
Note: Limited submission opportunity. Please follow the Limited Submission Guidelines
Mid-scale Research Infrastructure-1 (Mid-scale RI-1)
Program: Mid-scale Research Infrastructure-1 (Mid-scale RI-1)
Deadline: January (anticipated deadline - review program site for updates)
Award Amount: Implementation: $6,000,000-$20,000,000; Design: can be <$600,000
Description: The Mid-scale RI program (RI-1 and RI-2) provides a flexible, yet robust, competitive opportunity to support research infrastructure of intermediate scales above the MRI and below the Major Facilities thresholds, respectively. This Mid-scale RI-1 solicitation calls for mid-scale projects in the lower portion of that range, from $6 million up to but not including $20 million in total project costs for implementation projects and $600,000 up to but not including $20 million for design projects. This funding range will support a variety of activities to implement or design visionary and unique high-priority projects with broad impact, as identified by research communities in the United States, unlike projects with a campus-centric focus.
Deadline: February (anticipated deadline - review program site for updates)
Award Amount: $20,000,000-$100,000,000
Description: The NSF Mid-scale RI-2 program supports implementation of projects that comprise any combination of equipment, instrumentation, computational hardware and software, and the necessary commissioning and human capital in support of implementation of the same. Mid-scale RI-2 projects will directly enable advances in any of the research domains supported by NSF, including STEM education. Mid-scale RI-2 will support projects in high states of readiness for implementation, i.e., those that have already matured through previous developmental investments. Projects may also include upgrades to existing research infrastructure.
Earth Science, Instrumentation and Facilities (EAR/IF)
Program: Earth Science, Instrumentation and Facilities (EAR/IF)
Deadline: Rolling
Award Amount: $500,000 max
Description: The Instrumentation and Facilities Program in the Division of Earth Sciences (EAR/IF) supports meritorious requests for infrastructure that promotes research and education in areas supported by the Division. EAR/IF will consider proposals for the acquisition or upgrade of research equipment that will advance laboratory and field investigations, and student research training opportunities in the Earth sciences.
National Facilities
Program: National Facilities
Description: The National Facilities program supports the operation of national user facilities: National Facilities are research facilities with specialized instrumentation available to the scientific research community in general and the materials research community in particular. These facilities provide unique research capabilities that can be located at only a few highly specialized laboratories in the Nation. They provide open user service for scientists and engineers from a broad range of disciplines including biology, chemistry, geosciences, materials research. and physics. They include facilities and resources for research using high magnetic fields, ultraviolet and x-ray synchrotron radiation, neutron scattering, and nanofabrication. They serve as science and technology-related resources and experiences for students. They conduct student and teacher education, general public awareness activities, curriculum development, and educational research.
Oceanographic Facilities and Equipment Support
Program: Oceanographic Facilities and Equipment Support
Deadline: December, annually (check program website for exact deadlines)
Description: Oceanographic facilities and equipment are supported by the Integrative Programs Section (IPS) of the Division of Ocean Sciences (OCE), Directorate for Geosciences (GEO). These awards are made for the procurement, conversion and/or up-grade, enhancement or annual operation of platforms in the ocean, coastal, near-shore and Great Lakes. Awards are generally directed specifically to support facilities that lend themselves to shared use within the broad range of federally-supported research and education programs. Most of these platforms and facilities also receive partial support from federal agencies other than NSF. This includes state and local governments and private sources on a proportional basis usually through a daily rate mechanism. The primary objective of these awards is to ensure the availability of appropriate facilities for federally-funded investigators and educators. Individual project-based facilities and instrumentation, limited to one, or a small group of investigators, should be supported through appropriate research programs as opposed to the IPS programs listed herein.
Defense University Research Instrumentation Program (DURIP)
Program: Defense University Research Instrumentation Program (DURIP)
Award Amount: $50,000-$1,500,000
Description: The Department of Defense University Research Instrumentation Program (DURIP) is designed to improve the capabilities of U.S. institutions of higher education to conduct research and to educate scientists and engineers in areas important to national defense, by providing funds for the acquisition of research equipment.
The National Institutes of Health (NIH)
Basic Instrumentation Grant Program (BIG)
Program: Basic Instrumentation Grant Program (BIG)
Deadline: June 1, 2023; June 3, 2024 (check program site for updates)
Award Amount: $25,000-$250,000
Description: The Shared Instrument Grant (SIG) Program encourages applications from groups of NIH-supported investigators to purchase a single high-priced, specialized, commercially available instrument or an integrated instrumentation system.
Shared Instrument Grant (SIG)
Program: Shared Instrument Grant (SIG)
Description: The Shared Instrument Grant (SIG) Program encourages applications from groups of NIH-supported investigators to purchase or upgrade a single item of high-priced, specialized, commercially available instruments or integrated instrumentation system. The minimum award is $50,000. There is no maximum price limit for the instrument; however, the maximum award is $600,000. Instruments supported include, but are not limited to: X-ray diffractometers, mass spectrometers, nuclear magnetic resonance spectrometers, DNA and protein sequencers, biosensors, electron and light microscopes, flow cytometers, and biomedical imagers.
High End Instrumentation Grant
Program: High End Instrumentation Grant
Award Amount: $600,001-$2,000,000
Description: The High-End Instrumentation (HEI) Grant Program encourages applications from groups of NIH-supported investigators to purchase or upgrade a single item of high-end, specialized, commercially available instruments or integrated systems. The minimum award is $600,001. There is no maximum price limit for the instrument; however, the maximum award is $2,000,000. Instruments supported include, but are not limited to, X-ray diffractometers, high throughput robotic screening systems, mass spectrometers, nuclear magnetic resonance spectrometers, DNA and protein sequencers, biosensors, electron and light microscopes, flow cytometers, and biomedical imagers.
ROSES Planetary Science Enabling Facilities
Program: ROSES Planetary Science Enabling Facilities
Deadline: Multiple due dates
Award Amount:
Description: The Planetary Science Enabling Facilities (PSEF) program element allows proposals for experimental and analytical research facilities to be made available to the community that does research under the programs supported by the Planetary Science Division in the Science Mission Directorate of NASA. Proposals must clearly articulate the scientific value of the research facilities that would be made available, as well as demonstrate that there is a significant need and user base for the facility within the community.
Laboratory Equipment Donation Program
Program: Laboratory Equipment Donation Program
Award Amount: Variable
Description: The Laboratory Equipment Donation Program (LEDP) was established by the United States Department of Energy (DOE) to grant surplus and available used laboratory equipment to full-time faculty at universities and colleges in the United States for use in energy oriented Science, Technology, Engineering, and Mathematics (STEM) educational programs. This program is managed by the Office of Workforce Development for Teachers and Scientists (WDTS). The listing of equipment available through LEDP is updated as new equipment is identified. It is available at no cost for a limited time and is granted on a first-received qualified application basis.
National Endowment for the Humanities (NEH)
Infrastructure and Capacity Building Challenge Grants
Program: Infrastructure and Capacity Building Challenge Grants
Deadline: October 5, 2022
Award Amount: $1,000,000 maximum
Description: The purpose of the Challenge Grants program is to strengthen the institutional base of the humanities by enabling infrastructure development and capacity building. Awards aim to help institutions secure long-term support for their core activities and expand efforts to preserve and create access to outstanding humanities materials.
The program funds two distinct types of projects, each with its own Notice of Funding Opportunity:
Capital Projects supports the design, purchase, construction, restoration, or renovation of facilities for humanities activities. This includes the purchase and installation of related movable and permanently affixed equipment for exhibiting, maintaining, monitoring, and protecting collections (whether on exhibit or in storage), and for critical building systems, such as electrical, heating ventilation and air conditioning, security, life safety, lighting, utilities, telecommunications, and energy management.
Digital Infrastructure supports the maintenance, modernization, and sustainability of existing digital scholarly projects and platforms.
Lakeshore Center, 3rd Floor
Houghton, Michigan 49931-1295


text:
Arras station (French: Gare d'Arras) is a railway station serving the town Arras, Pas-de-Calais department, northern France. This station, which opened in 1846, is located on the Paris–Lille railway and Arras-Dunkirk railway and accessible from LGV Nord. The train services are operated by SNCF.

Train services
The station is served by the following services:

High speed services (TGV) Valenciennes - Douai - Arras - Paris
High speed services (TGV) Dunkerque - Hazebrouck - Arras - Paris
High speed services (TGV) Lille - Arras - Paris
High speed services (TGV) Lille - Aeroport CDG - Lyon - Avignon - Marseille
High speed services (TGV) Lille - Aeroport CDG - Le Mans - Rennes / Angers - Nantes
High speed services (TGV) Lille - Aeroport CDG - St-Pierre-des-Corps - Bordeaux
Regional services (TER Hauts-de-France) Lille - Douai - Arras - Paris
Regional services (TER Hauts-de-France) Arras - Lens - Bethune - Hazebrouck
Local services (TER Hauts-de-France) Saint-Pol-sur-Ternoise - Arras

References

Railway stations in Pas-de-Calais
Gare
Railway stations in France opened in 1846

redpajama_set_name: RedPajamaWikipedia


The ERTS Scripting Language is available within Cognition Lab in form of a predefined test paradigm. "ERTS Script". When you open the configuration screen of this paradigm, you will see an text editor with syntax highlighting to author ERTS Scripts online. After saving your script, you can immediately preview the new test paradigm in the preview window since Cognition Lab interprets the text-based script directly without creating intermediate source code or binary.
For developing new scripts, we recommend to take a look at the open script community Cognition Lib. There you can find ERTS scripts shared by other community members or publish your scripts. Cognition Lib is also providing an instant preview and error handling to help you develop your script. Once your script is ready, just copy/paste it into your custom script paradigm in Cognition Lab.
PICTURE Visual stimulus material (including instructions) is defined with the PICTURE data type. This data type supports a variety of different flavors like text, graphics, and video (mp4, webm, ogg). Pictures can be displayed on multiple screen location in different alignments and rotations.
POSITION The POSITION data type defines screen locations on which a picture will be displayed. ERTS uses a logical coordinate system in millimeters which may be adjusted to individual monitor dimensions.
A position definition may consist of multiple screen coordinates to form circles, grids, or lines. A position definition may also serve as a set of screen locations which may be filled with random pictures or chosen at random.
TONE The tone data type is used to define all types of auditory stimuli. ERTS supports the definition of sine wave tone (CHROME only) and external sound files (mp3, wav, ogg).
COLOR The color data type is used for defining foreground and background colors. Colors can be defined in RGB or HSV color space.
FONT. This data type defines fonts for text pictures. What font is exactly available depends on the OS and browser.
SET. The set data type is used to group data objects into sets that an be used for random processes. A set definition may consist of a list of data objects like pictures, positions, tones, colors, or fonts. During the experiment you can then randomly draw from a set to realize randomization that goes beyond the permutation of trials.
KEY This data type is used to define the response keys that will be used in an experiment. All standard key names of the PC keyboard are predefined. Adding a '^'-symbol to the key name refers to the release event instead of the press event.
Procedural commands are used to define the event sequence of an experiment. The ERTS script language supports three levels to define the event flow.
Trial A trial definition consists of several trial commands that define the actual events as experienced by the test participant. A trial definition with one or more variable command arguments is called a trial schema. In this case the final values for the trial commands will be defined later at the block level.
Block A block definition lists the trials which should be executed within this block either in fixed or random order. If trials have variable arguments, they must be specified at the block level. The values of a trial specification are captured in the result file to document the independent variables for each trial.
Session A session definition defines the overall structure of an experiment. This structure is a composition of trials and blocks that are executed in the order as defined.


text:
GenJag T-Shirts
GenJag Hats
GenJag Stickers
GenJag Gift Cards
JAGUARS NEWS
DANIEL THOMAS VS. COLLIN JOHNSON: WHICH ROOKIE WILL HAVE A GREATER IMPACT IN 2020 & BEYOND
Collin Johnson (Daniel Dunn/Icon Sportswire)
Which Jaguars' fifth-round pick will find more success early on? Long term?
BY JORDAN DE LUGO
The Jaguars have an absurdly large rookie class. In total, there are 30 rookies on the Jaguars' roster, with 12 being draft picks. Because of the high volume of drafted players, I'm going to switch up my strategy with providing insight into what to expect from each rookie in 2020. I've already covered CJ Henderson, K'Lavon Chaisson, Laviska Shenault, DaVon Hamilton, Ben Bartch, Josiah Scott, and Shaq Quarterman. Today, I'm going to take a look at both of the Jaguars' fifth-round picks and tell you which one has a better chance at making an impact on the field for the Jaguars in 2020 and beyond.
The Jaguars drafted senior safety Daniel Thomas from Auburn with the 157th overall selection and the added senior receiver Collin Johnson from Texas at 165. Both players saw extensive playing time throughout their four-year college careers.
Johnson is a hulking six-foot-six, 222-pound receiver with linear athleticism, strong hands, and plenty of strength for the position. Thanks to his size, reliable hands, and penchant for winning in contested catch situations, it's easy to envision a role Johnson in the red zone. But his path to the field is filled with obstacles. DJ Chark and Laviska Shenault should lead the Jaguars in targets from the receiver position. But behind them, Chris Conley, Dede Westbrook, and Keelan Cole all have proven skill sets and experience playing with Gardner Minshew. If Collin Johnson can prove he has more reliable hands and ball skills than Chris Conley inside the 20, he'll have a chance to be a short field winner for the Jaguars. When Johnson does find the field, he'll be an asset in the run game with physicality as a blocker.
Daniel Thomas should come in and immediately lock up the third safety role for the Jags. He's only five-foot-ten but makes up for it with his 37" vert and 4.5 speed. Thomas also packs a punch at 215 pounds. If the Jaguars' current starting free safety, Jarrod Wilson, struggles during training camp, the preseason, or early on in the regular season, he could have a short leash. Thomas is more athletic and has superior power in his frame compared to Wilson. But Wilson has length and experience on his side. The Jaguars don't ask their safeties to cover receivers one-on-one deep down the field too often, so Thomas should be able to play reasonably well in coverage. But his lack of length and lateral agility could hurt his chances to make it big at the next level. He's solid in shallow zones and is a heat-seeking missile when rolling down-hill towards ball carriers.
Duval Knucks Tee
It's easy to see why the Jaguars were drawn to these two players in the fifth round. But which one will have a more immediate impact?
Thomas will likely be higher on the depth chart than Johnson, so one injury to Jarrod Wilson or Ronnie Harrison and Thomas could be thrown into the fire. Thomas will also be a better special teams contributor from a coverage standpoint. He should find success in that role immediately.
But Collin Johnson has a unique skill set to the Jaguars' roster, which should allow him to be a red-zone threat early on in his career.
Thomas should have more of an impact on special teams and will be one injury away from starting duties. But Johnson should be able to have a great impact in the red zone for the Jaguars. I expect Thomas to be on the field more, but Johnson could have the more impactful rookie season.
Long term, both could be fixtures for the Jaguars. Johnson will need to improve as a route runner and in his ability to beat press coverage to excel regularly on the outside. I believe his best role in the NFL will be as a flex/slot receiver who can win against mismatched linebackers and safeties. But it remains to be seen if the Jaguars will utilize in that fashion. As for Thomas, his best role is as a box safety who can attack the run and play instinctively in zone coverage. But the way the Jaguars deploy their safeties, it's not too hard to project him into a starting role for the Jaguars at free safety.
Overall, Johnson appears to be the more talented player and has superior upside. He could potentially be a reliable third or fourth target in a high powered offense. Thomas projects more as a reliable third safety in a strong defensive backfield.
Follow Jordan on Twitter for all the latest Jaguars news and analysis.
SHOP GENJAG
2018 GenJag Member Shirt
Generation Jaguar · Jaguars Week 15: Titans, Ravens, and Free Agent Strategy
Tweets by generationjag
GENJAG
FOR YOUR INBOX
Voted #1 Blog in Jax
DUUUUVAL Daily
#GENJAG
© 2021 Generation Jaguar | Terms | Privacy |
This site is not affiliated with nor endorsed by the NFL or the Jacksonville Jaguars."NFL" is a registered trademark of the National Football League. "Jacksonville Jaguars" are a registered trademark of the Jacksonville Jaguars. The information provided on this website is provided for information and entertainment purposes only. RSS Feed.


text:
Environment Update 23rd September 2019
Monday, 23 September, 2019
This year, the UK became the first G7 country to target net zero by 2050. Since 2010 we have reduced emissions by 25% and our new laws aim to end the contribution the UK makes to global warming by 2050. The UK also celebrated the longest run without coal for Great Britain since 1882 and introduced 41 new marine conservation zones.
Last week I met with local residents about how we can all work together to tackle climate change. It turned out to be a pertinent day for the meeting with climate protests taking place around the world, including in Southampton, and it being announced that the world's biggest offshore wind park planned off the coast of England could generate power cheaper than by burning coal.
The key issues we discussed included reducing Green House Gas emissions from UK housing stock, supporting developing countries to protect their carbon sinks such as the Amazon rainforest, increasing safety for cyclists and incentivising use of public transport. I know how important these issues - as well as the broader issue of tackling climate change - are to people in our area, with them regularly filling my inbox, and was delighted when environmentalist Zac Goldsmith was promoted by the Prime Minister to the very centre of Government, working as a Minister both in DEFRA and DFID, as well as at the Cabinet table. At the meeting we all agreed that this is the issue of our time, and as Eastleigh's MP I will always ensure it's a priority.
Indeed, the Prime Minister has announced that he will make £10 million immediately available to help step up efforts to protect and restore the Amazon rainforest in Brazil - including in areas affected by the current fires. The new funding builds on support the UK has already invested to restore the rainforest in Brazil and neighbouring countries and will help safeguard the huge biodiversity of animal and plant species found in the Amazon.
During the G7 Summit, the Prime Minister urged countries to back Britain's call to protect 30% of the world's ocean by 2030 – to reverse the damage being done by overfishing, plastic pollution and climate change. Having worked alongside Ministers and the Department for Environment, Food and Rural Affairs on a number of key animal welfare issues, including most recently the Animal Welfare Sentencing Bill, which has been incredibly influential in strengthening the UK's position as a global leader on animal welfare. I am also pleased to welcome a funding boost in addition to £7 million to extend the Blue-Belt scheme and protect and manage vital marine ecosystems in conservation areas around Britain's overseas territories - supporting the protection of key species such as turtles, whales, fish, seabirds and wider marine life.
Outside the EU Britain can develop global gold standard environmental policies, taking a more targeted approach. Having left the Common Agricultural Policy we can use public money for public goods, rewarding environmentally responsible land use. Meanwhile, by leaving the Common Fisheries Policy we will be able to grant access and allocate quotas based on sustainability, allowing us to pursue the highest standards in marine conservation.
You can find regular updates on all environmental and animal welfare here: https://www.gov.uk/search/all?organisations%5B%5D=department-for-environment-food-rural-affairs&order=updated-newest&parent=department-for-environment-food-rural-affairs


Create invited 150 industry guests to its annual venue dinner in April, which took place at one of London's most spectacular venues, the unique Cutty Sark.
Representatives from more than 40 London venues were able to taste create's new Spring/Summer canapés, followed by a four course sit-down dinner and after dinner food stalls, at the venue which re-opended in April 2012.
The menu, tailor made for the evening, consisted of a starter of saffron, beetroot and parsley-infused quail's eggs with accompanying dipping sauces, served in an egg box. The dish also included quail served three ways, with a saffron-stuffed quail's leg, quail ballotine and a quail and parsley kiev, served alongside soft boiled scotch quail's egg.
The main course featured milk-fed leg of lamb followed with wild garlic gnocchi, broad beans and beetroot purée. Dessert was inspired by the Cutty Sark's tea clipper history, and consisted of a vanilla custard panna cotta with rhubarb, as well as hibiscus tea served in glass teapots.
create also showcased its fairground-inspired petit four and fresh tea station, which was built up high on perspex tables. The interactive station allowed guests to take petit fours and dip them into purées. A coffee and dark rum station also proved very popular on the night.


On May 12th 160 people including WineCollective's David, attended a great event held at Local 002 in Calgary, 'Beer and Burger Night for Cystic Fibrosis'. The event raised awareness and funds for research and treatment of Cystic Fibrosis. Blair and Sandra Smith hosted the event, raising money to support Blair's second time cycling the 1200km treck from Vancouver to Banff with GearUp4CF. The ride took place June 16-24, and to date this year's efforts has raised over $232,000.
In Calgary alone, 350 people suffer from this deadly lung disease where 1 in 25 people are genetic carriers. It is an inherited disease with no cure. You can learn more about the disease from Cystic Fibrosis Foundation Canada.
WineCollective and Tannic helped by contributing a WineCollective Evolution (4 bottle) & Cartier (2 Bottle) Package ($130 Value) along with a 1 Year's Membership to Tannic.ca ($195 value.) Through everyone's generosity and hard work, the event raised over $14,000 for CF research. WineCollective and Tannic are very proud to be able to support this extraordinary cause.
To view more photos and find more information on the event, visit GearUp4CF.


Martin Arnold is a musician based in Toronto. His notated compositions are performed nationally and internationally. Martin is also an active member of Toronto's improvisation and experimental jazz/roots/rock communities performing on live electronics, banjo, melodica, and guitar. Martin is the Artistic Director of Arraymusic and he lectures in the Department of Cultural Studies at Trent University and the Department of Art, Culture and Media, at the University of Toronto, Scarborough.
For more information about Martin Arnold, click here.


text:
Sexual Communication Offences (1180A/21)
27 October 2021 | Incident and Crime Statistics
I am writing to request data for the purpose of conducting research to support the development of knowledge, training and support tools for parents and schools on the subject of online safeguarding for children who engage with online chat platforms. Therefore, I require data on the following:
Please provide the number of recorded offences that relate to s.15A of the Sexual Offences Act 2003, Sexual Communication with a child, HO Crime Code 71/17 between April 2018 and April 2021. Please, where possible, provide the ages of the victims and offenders if known, break the data down by month and year.
Please provide the method of communication with the child and the App used to communicate eg. Text, Whatsapp, Facebook, Snapchat, Omegle, Kik, Discord, Twitter, Tiktok, Twitter, other chatroom etc) for all recorded offences relating to s.15A of the Sexual Offences Act 2003, sexual communication with a child, HO Crime Code 71/17 between April 2018 and April 2021. Please break the data down by month and year.
Please provide the Outcomes for all s.15A of the Sexual Offences Act 2003, sexual communication with a child, HO Crime Code 71/17 between April 2018 and April 2021. Please break the data down by month and year.
Our data are not organised in such a way as to allow us to provide this information within the appropriate (cost) limit within the Freedom of Information (FOI) Act. This is because we do not have a marker on our crimes system that allows us to easily identify the forms of communication used in connection with recorded offences under s.15A of the Sexual Offences Act 2003, sexual communication with a child. Therefore in order to determine the information for question 2, we would need to conduct a manual review of every case. Researching each individual case however would exceed the appropriate limit (FOIA, s.12).
This means that the cost of providing you with the information is above the amount to which we are legally required to respond i.e. the cost of locating and retrieving the information exceeds the 'appropriate level' as stated in the Freedom of Information (Fees and Appropriate Limit) Regulations 2004.
In accordance with the Freedom of Information Act 2000, this letter acts as a Refusal Notice for this part of the request and if one part of a request exceeds the fees limit then S12 of the Act applies to the whole request.
However, in order to assist, we can provide information for the remainder of your request in relation to all offences recorded under the HO Crime Code 71/17. Please find this information attached.
These data should be interpreted with caution; the figures provided are our best interpretation of relevance of data to your request, but you should be aware that the collation of figures for ad hoc requests may have limitations and this should be taken into account when those data are used.
This should not be taken as a precedent that additional information would be supplied outside of the time/fees legislation for any subsequent requests.
1180A_Attachment


text:
Rokia Traoré: Ka Moun Kè
August 15, 2013 By guillaume
Since her international début in 1997, Malian singer songwriter Rokia Traoré (b. 1974) has always managed to strike an interesting balance between tradition and innovation. A ngoni and balafon player, she mainly sings in the Bambara language and draws inspiration from the rich tradition of the Mandé song repertoire or from other contemporary Malian singers. She has also been promoting and supporting Malian music and culture since 2009 with her Fondation Passerelle.
At the same time, the musician has consistently been breaking new ground, crossing over to contemporary classical music and arranging two songs with the Kronos Quartet on Bowmboï (2003), collaborating with the Orchestre National de Jazz on the Around Robert Wyatt project (2009) or writing the score for Toni Morrison and Peter Sellars' multimedia play Desdemona (2011).
Rokia Traoré – Beautiful Africa (2013)
Released in early 2013, Beautiful Africa signals a new departure with a more drum and guitar-based sound. Bringing in P.J. Harvey's long-time collaborator John Parish to produce the album, Rokia Traoré's fifth recording is a lot closer to rock music, while still retaining a ngoni player and two backing singers. Singing in Bambara but also in French and in English, Rokia Traoré voices her concern for Mali's and wider Africa's unstable political situation.
[…] Battered, wounded Africa,
Why do you keep the role of the beautiful naive deceived
Yet, my faith does not know failure
More intense than ever,
My faith does not know failure
I love you beautiful Africa
Afrique je t'aime […]
Beautifully captured in the hall of The Trianon in Paris, this is a stripped down version of Ka Moun Kè set to a gorgeous hypnotic groove by Human Beatboxer Jason Singh and Rokia Traoré's electric guitar.
http://www.rokiatraore.net/
Rokia Traoré: Titati/Africa Unite
Boubacar Traoré & Vincent Bucher: Mondeou
Boubacar Traoré: Tunga Magni
Piers Faccini & Vincent Ségal: Songs of Time Lost
Tamikrest: Tisnant an Chatma
Trio Da Kali and Kronos Quartet: Ladilikan
Filed Under: Contemporary Tagged With: Rokia Traoré, songwriting
Subscribe to Spellbinding Music
Never miss a post and subscribe to Spellbinding Music via email. Receive weekly and enchanting musical updates straight into your inbox - and it's free!
E-Mail Address Subscribe to newsletter?


Anyone for a game of Monopoly? No?
11 Comments on Anyone for a game of Monopoly? No?
In the Williams family, getting together over Christmas generally involves board games at some point. If I'm choosing it's likely to be Settlers of Catan or Carcassone. If my wife is choosing it'll involve making words, and she will win. My brother introduced us to Small World this year, and we're partial to an epic session of Lord of the Rings edition Risk.
There's one game we won't play, and that's Monopoly. For one thing, it's a very dry prospect once you've discovered the far better games that come out of Germany's thriving board game scene. It also goes on forever, is guaranteed to start arguments, and is miserable for all but one player. Why it remains Britain's best-selling board game is beyond me.
Said inventor, Elizabeth Magie, submitted the game to Parker Brothers in 1904. They rejected it as too political, so she published it herself and it was taken up by Quaker households, economics students and socialists of one stripe or another. Over the years, various people discovered the game and began to create their own versions, often making their own boards with local street names. Magie welcomed this and the game took on a sort of folk quality, although some ripped it off and issued it commercially too. Eventually, thirty years after the original submission, it landed back at Parker Brothers under the name Monopoly. It was essentially the same game but with its principles all backwards – it was now a game celebrating economic monopoly.
As a practical demonstration of land-grabbing, the game still works. But if you want to play something that shows how you fix the problem, you'll have to look elsewhere. You could look up the original , which appears in various forms on the internet. Then there's , launched in 1973, which takes an interesting twist. You start the game with the board in a state of monopoly, like it would be at the end of a normal game, and then you try to undo it. There's even a radical German challenger from the 1970s called Provopoli that pits the monopolists against squatters and anti-capitalist terrorists.
And then there's , which launched last year. In this version, players have to work together to run a cooperative. Everyone wins or loses together. True to its principles, it's also the first game made under Fairtrade conditions, and you can choose the price you want to pay for it when you buy it online.
I haven't played any of these, so I can't really recommend them. What I do know is that it's high time Monopoly was eased out of its position as the world's bestselling board game.
Now, who's for a quick round of Saboteur?
"it's high time Monopoly was eased out of its position as the world's bestselling board game." By government fiat? Direct action?
I think you are over thinking things. If you spend your life seeking the moral in everything you become a joyless soul (Risk is about conquest, I could riff on how those who play it are budding Hitlers). Monopoly is a fun game because you are trying to stiff your friends and family. I have been spending break time the last few weeks teaching junior school children how to play. It is great. They get to practice maths and negotiation skills, learn to take risks, and develop forbearance of the whims of luck and stickwithitness to win.
While it it isn't the whole of capitalism in a game I'd also say that you can't just sit still and win. If you don't develop your property, don't take risks, and negotiate then you will lose. Useful skills for life. And its fun, which is why I have a long waiting list to play.
By being outsold by a better game, of which there are many! I gave my reasons why I don't like it in the second paragraph, and morality isn't one of them.
If you enjoy monopoly, I'm not going to judge you. Millions of people apparently do, although I'm being entirely serious when I say I don't really understand why. It's really only fun if you're winning, and it can take hours and hours to lose – that's a badly designed game in my opinion.
A badly designed game that sells in its millions and has done for decades? Its that thing about the market being able to process information better than some 'expert's' opinions.
Perhaps you just don't have the skills to play it well and so blame the game. I'm not good at Backgammon. But I don't blame its design. Could explain a great deal of the opinion here. A youthful bad experience at Monopoly drives a desire to redesign the economy.
You're taking this very seriously aren't you? Sure you don't want to read the post again and see if you've misjudged the tone a little? It's the run up to Christmas and I'm writing about a board game. Calm down.
And yes, it is a badly designed game, on so many levels. But if you've not played a well designed game, you might not know that. Anything that is based on rolling dice to move around a board isn't worth playing, in my opinion. Once introduced to German games, one doesn't go back, in my experience.
No, I'm not taking it seriously, I'm smiling at how much you may be revealing with a supposedly light-hearted post. You do sound like a sore loser justifying their loss, "I don't understand why anyone likes this game, its just badly designed! It's no fun if you are losing! We should all play something else!" Cue stamping away from the dinning table and much slamming of doors.
I do remember enjoying Monopoly when I was about twelve. And it is fun in a non-challenging way for about half an hour. After that you generally know who's going to win and you've got another three hours to play – hence a bad game. The fact that almost everyone who still plays it has a bunch of 'house rules' to make it work also suggests the original rules aren't up to task. But if you enjoy it, carry on. I'd rather play Ticket to Ride or Settlers of Catan.
Monopoly demonstrates that the so-called capitalist free market is far from free. Most people are in the position of a player who joins the game after all the boards have become "owned" by the original players. Apart from a dozen of the squares, wherever they land they have to pay rent. That is the reality of what passes for "capitalism". It calls for extraordinary enterprise and creativity to break out of that disadvantage, whilst the "owners" need to do nothing more than pay someone else to collect the rent.
It requires next to no skill to win a game of Monopoly, once you know the rules. Despite Darrow's modificatins, is quite a realistic model of the so-called free market economy as we know it. The owners of Park Lane and Mayfair usually win in the end, and landing on one of those squares is a disaster for any of the other players.
It is easy to tinker with the rules of Monopoly to make it sustainable, but then it makes for a boring game. The Georgist model would return the site rentals into a pot which was shared out every so often, which would probably make the game last indefinitely.
Monopoly also demonstrates another truth about the economy. When all the sites have become owned by one of the players, it is impossible for anyone else to join the game, as, almost wherever they land, the newcomer has to pay rent to one of the original players.
Tip, Park Lane and Mayfair aren't the winners, its the Vine Street set (mid market with good risk.reward ratio).
Thanks for the shout out regarding Co-opoly! At TESA (our co-op, we're the makers of Co-opoly), we also prefer games that are not about luck, but about skill and savvy (and in the case of Co-opoly, solidarity). We believe strongly that education should be fun, hence our game, which offers an alternative to cutthroat capitalism (we think of it as an antidote to the issues Monopoly raises) and a raucous good time for players. If you get a chance to play Co-opoly, we'd love to hear what you think!


text:
THE FIRST RESULTS OF THE RE.STO.RE PROJECT, IN A LIVELY AND TOPICAL PANEL DISCUSSION. BORN FROM THE PASSION OF THOSE WHO BELIEVE IN SOCIAL AND COMMUNITY THEATER
October 6, 2022 |
The Re.Sto.Re project, co-funded by the European Commission's Erasmus+ program, made its entrance into the academic world in the prestigious Sala Volpi of the University of Roma Tre, an associate partner of the project, in the Department of Education Sciences.
In a packed hall and with numerous spectators who also followed the event online thanks to the live social broadcast, Oltre le Parole Onlus, as the lead partner, offered a succession of valuable speakers, coordinated by Giulia Morello, president of Dire Fare Cambiare, associate partner of the Re.Sto.Re project.
Three sessions: project results, multiplier effect, direct experience of participants.
First, an intense introduction by Prof. Gilberto Scaramuzzo, Associate of General and Social Pedagogy and director of the Master's Program in Pedagogy of Expression, on how theater is an expression of the very nature of human beings, so that improving people's ability to express themselves means improving society as well.
Pascal La Delfa, Artistic Director of Oltre Le Parole Onlus, among other project achievements, turned the spotlight on the many social theater practitioners across Europe who also worked during the pandemic, generating cascading social impact on multiple spheres, from family to community or territory, but without recognition or professional protections, in part the goal of the Re.Sto.Re project itself.
Prof. Emiliane Rubat du Mèrac, from the Department of Social, Developmental and Educational Psychology and Research at La Sapienza University in Rome, told about her work in training and educational planning with students starting with the theme of relationship and how it is reductive to enter into relationship only through spoken language. How much more interesting it is to develop other artistic languages, such as the use of the body, colors, and sign language, which open up worlds often never explored. As part of this exchange between formal and nonformal education, a memorandum of understanding will be created with Oltre le Parole onlus to pool skills and experiences.
Of the value of the theater experience, Monica Barzanti, head of International Relations of the Community of San Patrignano, a partner in the Re.Sto.Re project, also spoke about it, reading a letter from a girl from the community who is part of the Theater Company (established in 2012). The letter highlights how even fragilities manage to find a way for expression and therefore recovery, making theater an instrument linked not only to particular elites. The deep connection that theater generates between people, from heart to heart, then produces an unimaginable multiplier effect. Data, one more time, do not fully tell the story and account for all the work done.
Tiziana Bergamaschi, director of Teatro Utile Il Viaggio, allowed us to tiptoe into her work with migrants, particularly in the workshop conducted together with Lorenzo Mosca, a number of psychologists and actors, who began in 2019 a path for refugees with major psychological trauma and who through theater are able to read reality in a different way.
The project, born from a synergy of professionals with different skills, is supported by the UHNCR, the UN agency specializing in the protection of refugees.
Massimo Bonechi, actor and director, drawing on his many years of experience in the field of theater and training, underlined how much the social theater operator needs ongoing training and requires skills and abilities as well as constant sharing among operators, which networks can facilitate.
Paola Borgia, director, actress, and teacher corroborated, through the telling of her own work experiences, how much theater offers, in situations of fragility, a new way forward. Mention should be made of MIUR, which, with the 2015 Good School Project, has begun to include theater in schools, but with a gap to be filled with respect to the training of specialized operators in the field.
Magdalena Zalent , director and cultural organizer, addressed the topic of international connections starting with the experience of Poland, emphasizing all the work that has been done with the institutions for the purpose of recognition, because bringing the method of the social theater operator to be recognized means changing society.
The direct experience of the participants in the Re.Sto.Re project was then a breath of beauty, innovation, and possibility, and everyone was impressed by the testimonies of the young people from the Arcobaleno1 socio-occupational center in Mirandola (MO) led by Patrizia Ficarelli, by the discoveries and insights of Elena Galeotti in a multi-sport with disabled children, by Antonella Miceli's engaging account of the experience of theater in prison and the subsequent reintegration, thanks also to the short film "Dodicimetriquadri" presented in national preview at the closing of the meeting.
In summary, a project, strongly desired by Oltre le Parole Onlus, which involved other partners in Italy such as the Community of San Patrignano, and in Europe, Poland, Spain, Slovenia, Ireland, and Portugal, who put their strong convictions and knowledge regarding the figure of the theater operator in social work and giving an overview of the future of the profession.
NB. The interventions can be viewed on Oltre le Parole Onlus' social channels and from the YouTube playlist of the dedicated Re.Sto.Re Project channel.
Previous WE ARE AT SCHOOL AGAIN!
Next ELENA GALEOTTI AND EMMA CAVEDAGHI. TWO YOUNG GRADUATES WHO CLOSELY INVESTIGATE THE PROJECT RE.STO.RE


Next message: Standard American accent?
earliest dated citation that seems reliable.
The evidence (that can be trusted) is the evidence.
> 1858 or 1880 or 1893.
labelled "LATER" that will bring you to the revised OED.


This modern, shallow glass bowl features a textured, dimpled pattern with a unique 24-karat gold rim sandwiched between layers of glass. Use it for a large salad, fruit, or as an elegant centerpiece bowl.
Dishwasher safe but not for use in a microwave.


The purchase area of the eLanguage website is 100% secure. We use industry-standard Secure Sockets Layer (SSL) technology to allow for the encryption of potentially sensitive information such as your name, address and other critically sensitive information, including your credit card details.
Information passed between your computer and the eLanguage website cannot be read in the event it is intercepted by someone else.
To make sure you are accessing our secure server before you submit personal, financial information, look at the lower right-hand corner of your browser once you are on a page that asks you to submit personal information.
If you see an unbroken key or a closed lock (depending upon your browser), SSL is active, and your purchased is secure.