text:
- Research
- Open Access
Joint interference cancellation and relay selection algorithms based on greedy techniques for cooperative DS-CDMA systems
- Jiaqi Gu1Email author and
- Rodrigo C. de Lamare1, 2
© Gu and de Lamare. 2016
- Received: 3 July 2015
- Accepted: 8 February 2016
- Published: 24 February 2016
In this work, we propose interference cancellation techniques and a multi-relay selection algorithm based on greedy methods for the uplink of cooperative direct-sequence code-division multiple access (DS-CDMA) systems. We first devise low-cost list-based successive interference cancellation (GL-SIC) and parallel interference cancellation (GL-PIC) algorithms with RAKE receivers as the front-end that can approach the maximum likelihood detector performance and be used at both the relays and the destination of cooperative systems. Unlike prior art, the proposed GL-SIC and GL-PIC algorithms exploit the Euclidean distance between users of interest and the potential nearest constellation point with a chosen threshold in order to build an effective list of detection candidates. A low complexity multi-relay selection algorithm based on greedy techniques that can approach the performance of an exhaustive search is also proposed. A cross-layer design strategy that brings together the proposed multi-user detection algorithms, and the greedy relay selection is then developed along with an analysis of the proposed techniques. Simulations show an excellent bit error rate performance of the proposed detection and relay selection algorithms as compared to existing techniques.
- DS-CDMA networks
- Cooperative systems
- Relay selection
- Greedy algorithms
- SIC detection
- PIC detection
1 Introduction
Multi-path fading is a major constraint that seriously limits the performance of wireless communications. Indeed, severe fading has a detrimental effect on the received signals and can lead to a degradation of the transmission of information and the reliability of the network. Cooperative diversity is a technique that has been widely considered in recent years [1] as an effective tool to deal with this problem. Several cooperative schemes have been proposed in the literature [2–4], and among the most effective ones are amplify-and-forward (AF) and decode-and-forward (DF) [4]. For an AF protocol, relays cooperate and amplify the received signals with a given transmit power amplifying their own noise. With the DF protocol, relays decode the received signals and then forward the re-encoded message to the destination. Consequently, better performance and lower power consumption can be obtained when appropriate decoding and relay selection strategies are applied.
1.1 Prior and related work
Direct-sequence code-division multiple access (DS-CDMA) systems are a multiple access technique that can be incorporated with cooperative systems in ad hoc and sensor networks [5–7]. Due to the multiple access interference (MAI) effect that arises from nonorthogonal received waveforms and narrowband interfering signals, the system performance may be adversely affected. To deal with this issue, multi-user detection (MUD) techniques have been developed [8] as an effective approach to suppress MAI. The optimal detector, known as maximum likelihood (ML) detector, has been proposed in [9]. However, this method is infeasible for ad hoc and sensor networks considering its computational complexity. Motivated by this fact, several sub-optimal strategies have been developed: the linear detector [10], the successive interference cancellation (SIC) [11], the parallel interference cancellation (PIC) [12], and the minimum mean-square error (MMSE) decision feedback detector [13]. A key challenge is how to design interference cancellation techniques with low cost and near ML performance. Moreover, such interference cancellation algorithms should be suitable to cooperative relaying systems and feasible for deployment at the relays and small devices.
In cooperative relaying systems, different strategies that utilize multiple relays have been recently introduced in [14–18]. Among these approaches, a greedy algorithm is an effective way to approach the global optimal solution. Greedy algorithms are important mathematical techniques that follow the approach of obtaining a locally optimal solution to complex problems with low cost in a step-by-step manner. Decisions at each step in the greedy process are made to provide the largest benefit based on improving the local state without considering the global situation. Greedy algorithms may fail to achieve the globally optimal choice as they do not execute all procedures exhaustively; however, they are still useful as they usually present a lower cost and can provide acceptable approximations. Greedy algorithms have been widely applied in sparse approximation [19], internet routing [20], and arithmetic coding [21]. In [19], orthogonal matching pursuit (OMP) and basis pursuit (BP) are two major greedy approaches that are used to approximate an arbitrary input signal with the near-optimal linear combination of various elements from a redundant dictionary. In [20], greedy routing is mentioned as a routing strategy where messages are simply forwarded to the node that is closest to the destination. In order to reduce the computational complexity and improve the overall speed of arithmetic coding, a greedy re-normalization step that contains greedy thresholding and greedy outputting is proposed and analyzed in [21]. In relay-assisted systems, greedy algorithms are used in [16, 17] to search for the best set of relays; however, with insufficient numbers of combinations considered, a significant performance loss is experienced as compared to an exhaustive search.
1.2 Contributions
This work presents cost-effective interference cancellation algorithms and multi-relay selection algorithms for cooperative DS-CDMA systems. The proposed interference cancellation algorithms do not require matrix inversions and rely on the RAKE receiver as the front-end. A cross-layer optimization approach that jointly considers the proposed interference cancellation and relay selection algorithms for ad hoc and sensor networks is also proposed. The proposed techniques are not limited to DS-CDMA systems and could also be applied to multi-antenna and multi-carrier systems. Cross-layer designs that integrate different layers of the network have been employed in prior work [22, 23] to guarantee the quality of service and help increase the capacity, reliability, and coverage of systems. However, MUD techniques with relay selection in cooperative relaying systems have not been discussed widely in the literature. In [3, 24], an MMSE-MUD technique has been applied to cooperative systems, where the results indicate that the transmissions are more resistant to MAI and obtain a significant performance gain when compared with a single direct transmission. However, extra costs are introduced, as matrix inversions are required when an MMSE filter is deployed.
We propose a low-cost greedy list-based successive interference cancellation (GL-SIC) multi-user detection method that can be applied at both the relays and the destination of wireless systems.
We also develop a low-cost greedy list-based parallel interference cancellation (GL-PIC) strategy which employs RAKE receivers as the front-end and can approach the ML detector performance.
We present a low-complexity multi-relay selection algorithm based on greedy techniques that can approach the performance of an exhaustive search.
An analysis of the computational complexity, the greedy relay selection method, and the cross-layer design is presented.
A cross-layer design that incorporates the optimization of the proposed GL-SIC and GL-PIC techniques, and the improved greedy multi-relay selection algorithm for the uplink of a cooperative DS-CDMA system is developed and evaluated.
The rest of this paper is organized as follows. In Section 2, the system model is described. In Section 3, the GL-SIC multi-user detection method is presented. In Section 4, the GL-PIC multi-user detection method is then developed. In Section 5, the relay selection strategy is proposed. In Section 6, the computational complexity and the greedy relay selection process are analyzed. In Section 7, the cross-layer design is explained. In Section 8, simulation results are presented and discussed. Finally, conclusions are drawn in Section 9.
Notation: in this paper, we use boldface upper and boldface lower fonts to denote matrices and vectors, respectively. (.) T and (.) H represent the transpose and Hermitian transpose, respectively. (.)−1 stands for the matrix inversion, E[.] denotes the expected value, ∣.∣ indicates the norm of a scalar, and ∥.∥ implies the norm of a vector.
2 Cooperative DS-CDMA system model
where \(a_{r_{l}d}^{k}\) is the amplitude for source (user) k from the l-th relay to the destination, \(\textbf {h}_{r_{l}d,k}\) is the L p ×1 channel vector for user k from the l-th relay to the destination, n rd is the M×1 zero mean complex Gaussian noise with variance σ 2, and \(\hat {b}_{r_{l}d,k}\) is the decoded symbol at the output of relay l after using the DF protocol.
The matrix A k (i) is an (L+1)×(L+1) diagonal matrix of amplitudes for user k, \(\textbf {b}_{k}(i)=[b_{k},\hat {b}_{r_{1}d,k},\hat {b}_{r_{2}d,k},\ldots \hat {b}_{r_{L}d,k}]^{T}\) is an (L+1)×1 vector for user k that contains the transmitted symbol at the source and the detected symbols at the output of each relay, and n(i) is a 2M×1 noise vector.
3 Proposed GL-SIC multi-user detection
In this section, we detail the GL-SIC multi-user detector that can be applied in the uplink of a cooperative system. The GL-SIC detector uses the RAKE receiver as the front-end, so that the matrix inversion required by the MMSE filter can be avoided. The GL-SIC detector exploits the Euclidean distance between the users of interest and their nearest constellation points, with multiple ordering at each stage; all possible lists of tentative decisions for each user are generated. When seeking appropriate candidates, a greedy-like technique is performed to build each list and all possible estimates within the list are examined when unreliable users are detected. Unlike prior work which employs the concept of Euclidean distance with multiple feedback SIC (MF-SIC) [25], GL-SIC does not require matrix inversions and jointly considers multiple numbers of users, constellation constraints, and re-ordering at each detection stage to obtain an improvement in detection performance.
3.1 Proposed GL-SIC design
where \(\phantom {\dot {i}\!}\textbf {y}_{\text {sr}_{l}}(i)\) represents the received signal from the source to the l-th relay, u k (i) stands for the soft output of the i-th symbol for user k, and w k denotes the RAKE receiver that corresponds to a filter matched to the effective signature at the receiver. After that, we order all users according to a decreasing power level and organize them into a K×1 vector t a . We choose the first n entries [t a (1),t a (2),…,t a (n)] which denote users k 1,k 2,…,k n ; the reliability of each of the n users is examined by the corresponding Euclidean distance between the desired user and its nearest constellation point c as explained next.
where the italic font \(\boldsymbol {h}_{\text {sr}_{l},\textbf {t}_{a}(t)}(i) = a_{\text {sr}_{l}}^{\textbf {t}_{a}(t)}\textbf {S}_{\textbf {t}_{a}(t)}(i)\textbf {h}_{\text {sr}_{l},\textbf {t}_{a}(t)}(i)\) stands for the desired user's channel vector associated with the link between the source and the l-th relay and \(\phantom {\dot {i}\!}\textbf {y}_{\text {sr}_{l},s}\) is the received signal from the source to the l-th relay at the s-th (s=1,2,…,K/n) cancellation stage. The process is then repeated with another set of n users being selected from the remaining users at the following stage, and this algorithm changes to the unreliable mode when unreliable users are detected. Additionally, since the interference created by the previous users with the strongest power has been mitigated, improved estimates are obtained by reordering the remaining users.
At this point, \(N_{c}^{n_{q}}\) combinations of candidates for n q users are generated. The detection tree is then split into \(N_{c}^{n_{q}}\) branches. After this processing, (12) is applied with its corresponding combination to ensure that the interference caused by the n detected users is mitigated. Following that, \(N_{c}^{n_{q}}\) numbers of updated \(\phantom {\dot {i}\!}\textbf {y}_{\text {sr}_{l}}(i)\) are generated, we reorder the remaining users at each cancellation stage and compute a conventional SIC with RAKE receivers for each branch.
\(\textbf {s}_{\text {pre}}(i)=[\hat {b}_{\textbf {t}_{a}(1)}(i),\hat {b}_{\textbf {t}_{a}(2)}(i),\ldots ]^{T}\) stands for the previous stages detected reliable symbols,
\(\textbf {s}_{p}(i)=[\hat {b}_{\textbf {t}_{p}(1)}(i), \hat {b}_{\textbf {t}_{p}(2)}(i),\ldots,\hat {b}_{\textbf {t}_{p}(n_{p})}(i)]^{T}\) is a n p ×1 vector that denotes the current stage reliable symbols detected directly from slicer Q(·) when (13) occurs,
\(\textbf {s}^{j}_{q}(i)=[c_{\textbf {t}_{q}(1)}^{m},c_{\textbf {t}_{q}(2)}^{m},\ldots,c_{\textbf {t}_{q}(n_{q})}^{m}]^{T}, j\in [1,2,\ldots,N_{c}^{n_{q}}]\) is a n q ×1 vector that contains the detected symbols deemed unreliable at the current stage as in (14), each entry of this vector is allocated a value from the constellation point set C; therefore, since each entry goes through all possible constellation points, with n q users contained in \(\textbf {s}^{j}_{q}(i)\), \(N_{c}^{n_{q}}\) combinations need to be considered and examined. j is the index number from all \(N_{c}^{n_{q}}\) combinations of \(\textbf {s}^{j}_{q}(i)\).
\(\textbf {s}^{j}_{\text {next}}(i)=[\ldots,\hat {b}_{\textbf {t}'(1)}^{\textbf {s}^{j}_{q}}(i),\ldots,\hat {b}_{\textbf {t}'(n)}^{\textbf {s}^{j}_{q}}(i)]^{T}\) includes the corresponding detected symbols in the following stages after the j-th combination of s q (i) is allocated to the unreliable user vector t q ,
t ′ is a n×1 vector that contains the users from the last stage.
Similarly, (12) is then applied and a conventional SIC with different orderings at each cancellation stage is performed via each branch.
\(\textbf {s}_{\text {pre}}(i)=[\hat {b}_{\textbf {t}_{a}(1)}(i),\hat {b}_{\textbf {t}_{a}(2)}(i),\ldots ]^{T}\) are the reliable symbols that are detected from previous stages,
\(\textbf {s}_{b}^{j}(i)=[c_{\textbf {t}_{b}(1)}^{m},c_{\textbf {t}_{b}(2)}^{m},\ldots,c_{\textbf {t}_{b}(n)}^{m}]^{T}, j\in [1,2,\ldots,{N_{c}^{n}}]\) is a n×1 vector that represents the number of users n which are regarded as unreliable at the current stage as shown by (18), each entry of \(\textbf {s}_{b}^{j}\) is assigned a value from the constellation point set C.
The vector \(\textbf {s}^{j}_{\text {next}}(i)=[\ldots,\hat {b}_{\textbf {t}'(1)}^{\textbf {s}_{b}^{j}}(i),\ldots,\hat {b}_{\textbf {t}'(n)}^{\textbf {s}_{b}^{j}}(i)]^{T}\) contains the corresponding detected symbols in the following stages after the j-th combination of s b (i) is allocated to all unreliable users.
where \(\textbf {H}_{\text {sr}_{l}}(i)= \left [\begin {array}{c c c c} \boldsymbol {h}_{\text {sr}_{l},1} & \ \ \boldsymbol {h}_{\text {sr}_{l},2} &\ldots & \ \ \boldsymbol {h}_{\text {sr}_{l},K} \end {array}\right ]\) is an M×K channel matrix for all users from the source to the l-th relay, \(\boldsymbol {h}_{\text {sr}_{l},k}=a_{\text {sr}_{l}}^{k}\textbf {S}_{k}(i)\textbf {h}_{\text {sr}_{l},k}(i)\) denotes a M×1 vector for user k from the source to the l-th relay.
Clearly, GL-SIC is a SIC receiver that is split at stage s into \(N_{c}^{n_{q}}\) parallel SIC receivers (branches) where s is the first stage having unreliable users. The best branch is decided at the end using the ML criterion (minimum residual energy). The optimum performance occurs when we examine the reliability for all users. However, in this work, once unreliable users are detected at stage s, for the following s+1, s+2,…, K/n stages, we process users directly through the conventional SIC detector to avoid further split of the detection tree as this would bring high complexity when large number of users are considered. Nevertheless, the performance gain can be compensated when increasing the number of users n that we considered per each stage.
The proposed GL-SIC algorithm is detailed in Algorithm 1.
3.2 GL-SIC with multi-branch processing
\(\textbf {O}_{l_{1}}=[K,1,2,\ldots,K-2,K-1]\),
\(\textbf {O}_{l_{2}}=[K-1,K,1,\ldots,K-3,K-2]\),
\(\textbf {O}_{l_{K-1}}=[2,3,4,\ldots,K,1]\),
\(\textbf {O}_{l_{K}}=[K,K-1,K-2,\ldots,2,1]\)(reverse order).
- 1.Obtain the best candidate branch \(\textbf {b}^{O_{l_{\text {base}}}}(i)\) among all K+1 (O included) parallel branches according to the ML rule:$$ \textbf{b}^{O_{l_{\text{base}}}}(i)= {\text{arg}} \min_{\substack{0\leq b\leq K}}\parallel \textbf{y}_{\text{sr}_{l}}(i)-\textbf{H}_{\text{sr}_{l}}\textbf{b}^{O_{l_{b}}}(i)\parallel^{2} $$(22)
- 2.
Re-examine the detected symbol for user k (k=1,2,…,K) by fixing the detected results of all other unexamined users in \(\textbf {b}^{O_{l_{\text {base}}}}(i)\).
- 3.
Replace the k-th user's detection result \(\hat b_{k}\) in \(\textbf {b}^{O_{l_{\text {base}}}}(i)\) by its corresponding detected values from all other K branches \(\textbf {b}^{O_{l_{b}}}(i)\), \((l_{b}\neq l_{\text {base}}, \textbf {O}=\textbf {O}_{l_{0}})\phantom {\dot {i}\!}\) with the same index, the combination with the minimum Euclidean distance is selected through the ML rule and the improved estimate of user k is saved and kept.
- 4.
The same process is then repeated with the next user in \(\textbf {b}^{O_{l_{\text {base}}}}(i)\) until all users in \(\textbf {b}^{O_{l_{\text {base}}}}(i)\) are examined.
The proposed modified ML selection technique is shown in Algorithm 2.
4 Proposed GL-PIC multi-user detection
As shown in Fig. 2, for the k-th user, the reliability of its soft estimates is determined by the Euclidean distance between u k (i) and its nearest constellation points c.
where \(\hat {b}_{\textbf {t}_{a}(t)}(i)\) denotes the detected symbol for the t a (t)-th user.
where \(\textbf {t}_{p}\cap \textbf {t}_{q}=\varnothing \) and t p ∪t q =t b .
\(\textbf {s}_{a} \ = \ [\hat {b}_{\textbf {t}_{a}(1)},\hat {b}_{\textbf {t}_{a}(2)},\ldots,\hat {b}_{\textbf {t}_{a}(n_{a})}]^{T}\) is a n a ×1 vector that contains the detected values for the n a reliable users,
\(\textbf {s}_{p}=[\hat {b}_{\textbf {t}_{p}(1)},\hat {b}_{\textbf {t}_{p}(2)},\ldots,\hat {b}_{\textbf {t}_{p}(n_{p})}]^{T}\) is a n p ×1 vector that represents n p unreliable users that are detected by the slicer Q(·) directly,
\(\textbf {s}^{j}_{q}=[c_{\textbf {t}_{q}(1)}^{m},c_{\textbf {t}_{q}(2)}^{m},\ldots,c_{\textbf {t}_{q}(n_{q})}^{m}]^{T}\) is a n q ×1 tentative candidate combination vector. Each entry of the vector is allocated a value from the constellation point set C, and all possible \(N_{c}^{n_{q}}\) combinations need to be considered and examined.
The trade-off between performance and complexity is highly related to the modulation type and the number (n q ) of users we choose from t b . Additionally, the threshold we set at the initial stage is also a key factor that could affect the quality of detection.
where \(\hat {b}_{j}^{\text {opt}}=\hat {b}_{j}^{(i-1)}\) denotes the detected symbol for user j that is used as the input (i=2) for the first PIC iteration, \(\hat {b}_{k}^{i}\) denotes the detected value for user k at the i-th PIC iteration, \(\phantom {\dot {i}\!}\textbf {H}_{\text {sr}_{l},j}\) stands for the channel matrices for the j-th user from the source to the l-th relay, \(\textbf {w}_{\text {sr}_{l},k}^{H}\) represents the RAKE receiver for user k from the source to the l-th relay, and \(\hat {b}_{j}^{i-1}\) is the detected value for user j that comes from the (i−1)-th PIC iteration. Normally, the conventional PIC is performed in a multi-iteration way, where for each iteration, PIC simultaneously subtracts off the interference for each user produced by the remaining ones. The MAI generated by other users is reconstructed based on the tentative decisions from the previous iteration. Therefore, the accuracy of the first iteration would highly affect the PIC performance as error propagation occurs when incorrect information imports. In this case, with the help of the GL-PIC algorithm, the detection performance is improved. The key novelty is that GL-PIC employs more reliable estimates by exploiting prior knowledge of the constellation points. The proposed GL-PIC algorithm is detailed in Algorithm 3.
5 Proposed greedy multi-relay selection method
where q represents the index number for an arbitrary user, Ω r denotes a possible combination set (r≤L(L+1)/2) of any number of selected relays, \({\mathrm {{SINR}_{\Omega _{r(q)}}}}\) represents the SINR for user q in set Ω r , and min \(({\mathrm {{SINR}_{\Omega _{r(q)}}}}) = {\mathrm {{SINR}_{\Omega _{r}}}}\) means that the SINR for relay set Ω r is equal to the minimum SINR for a single user in set Ω r . Ω best is the best relay set that provides the highest SINR.
Clearly, we can also consider the SINR for different relay combinations after applying convention SIC, conventional PIC, linear MMSE, or even the proposed detectors. However, RAKE receiver can bring the lowest complexity.
5.1 Standard greedy relay selection algorithm
and move to the third stage by removing the current poorest link and repeating the above process. The algorithm stops either when S I N R cur <S I N R pre or when there is only one relay left. The selection is performed once at the beginning of each packet transmission.
5.2 Proposed greedy relay selection algorithm
- 1.
Initially, a set Ω A that includes all L relays is generated and its corresponding SINR is calculated, denoted by S I N R pre .
- 2.
For the second stage, we calculate the SINR for L combination sets with each dropping one of the relays from Ω A . After that, we choose the combination set with the highest SINR for this stage, recorded as S I N R cur .
- 3.
Compare S I N R cur with the previous stage S I N R pre , if (36) is true, we save this corresponding relay combination as Ω cur at this stage. Meanwhile, we update the S I N R pre as in (37).
- 4.
After moving to the third stage, we drop relays in turn again from Ω cur obtained in stage two. L−1 new combination sets are generated, we then select the set with the highest SINR and repeat the above process in the following stages until either S I N R cur <S I N R pre or there is only one relay left.
This proposed greedy selection method considers the combination effect of the channel condition so that additional useful sets are examined. When compared with the standard greedy relay selection method, the previous stage decision is more accurate and the global optimum can be approached more closely. Furthermore, its complexity is less than L(L+1)/2, which is much lower than the exhaustive search. Similarly, the whole process is performed only once before each packet and only needs to be repeated when the channels change. The proposed greedy multi-relay selection algorithm is depicted in Algorithm 4.
Finally, it should also be noticed that relay selection can be also operated at the source-relay part as this is a two-phase process. However, in the current manuscript, we only consider the relay selection that occurs during the relay-destination links for the purpose of simplicity.
6 Analysis of the proposed algorithms
In this section, we analyze the computational complexity required by the proposed and existing interference cancellation algorithms and the proposed greedy relay selection method.
6.1 Computational complexity
Total number of users K.
The number of multi-path channel components L p .
The number of constellation points N c that correspond to the modulation type.
The parameter M which corresponds to the length of the receive filters, where M=N+L p −1 and N is the spreading gain.
Specifically, in the GL-SIC algorithm, n refers to the number of users we considered per each stage, and in the GL-PIC algorithm, n q represents the number of unreliable users that need to be re-examined in the second processing stage. The required flops are considered both in the case of real and complex matrix operations. It is worth noting that, in real arithmetic, a multiplication followed by an addition requires two flops while for the complex numbers, eight flops are required when an addition is executed after a multiplication. As a result, it can be approximated that the complexity of a complex matrix multiplication is four times of its real counterpart.
Computational complexity of existing and proposed MUD algorithms
Computational complexity (flops)
Matched filter
Conventional SIC
\(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p} +18K-12)-4K+2\)
Conventional PIC
Linear MMSE receiver
Proposed GL-SIC
\(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p}+6K) -2K+{N_{c}^{n}}(20MK-8Mn+4M-2K+2n-2) \)
Proposed GL-PIC
\(M(4{L_{p}^{2}}+4{KL}_{p}-2L_{p} +10K+4K^{2})-4K+N_{c}^{n_{q}}(8MK+8M-2)\)
Standard likelihood (ML) detector
For each case shown in Table 1, the upper bound of the complexity is given by the standard ML detector, where it explores all possible combinations of the detected results and chooses the one with the minimum Euclidean distance. However, when a large number of users need to be considered, an exponential complexity growth would limit its application in practical utilization. In contrast, with careful control of the number of unreliable users n and n q being re-examined in both proposed algorithms, a substantial complexity saving is achieved. Additionally, our proposed greedy list-based algorithms offer a clear complexity advantage over the linear MMSE receiver as they adopt the RAKE receiver as the front-end, so that the cubic complexity can be avoided. Another feature to highlight is that although our proposed algorithms have a complexity slightly higher than the matched filter, the conventional SIC, and the conventional PIC, they exhibit significant performance gains over existing techniques.
6.2 Greedy relay selection analysis
In fact, the idea behind the proposed algorithm is to choose relay combinations in a greedy fashion. At each stage, we select the set of relays with the highest SINR and the previous stage result always affects the following stage set of relays candidates. Then, we subtract off the contribution brought by each of the remaining relays and iterate on the residual. After several stages, the algorithm is able to identify the optimum relay set. To this end, we propose the following proposition.
7 Proposed cross-layer design
In this section, we present and analyze a cross-layer design strategy that combines the proposed MUD techniques with the proposed greedy multi-relay selection algorithm for the uplink of the cooperative DS-CDMA networks. This approach jointly considers the performance optimization across different layers of the network, since inappropriate data detection and estimation that are executed at the lower physical layer can spread incorrect information to the data and link layer where relay selection strategy performs, causing the loss of useful information and degradation of the overall system performance. In this case, when improved data detection is obtained at the physical layer, together with an effective relay selection, a better system performance can be achieved.
As stated in previous sections, the system operates in two phases, where for the first phase, the proposed MUD techniques are applied and processed at each of the relays with a DF protocol; after the detection process, the proposed greedy multi-relay selection algorithm is then performed to seek the optimum relay combination. In the second phase, the chosen relays take part in the transmission in order to forward the information to the destination. After all the data are received at the destination, the proposed MUD algorithms are applied to recover the transmitted data.
where b j stands for the j-th candidate list generated after applying the GL-SIC/GL-PIC algorithms at the destination, s denotes stage index in the relay selection process, Ω s represents the selected relay combination at the stage s, \({\text {SINR}}_{\Omega _{i(k)}^{s}}\) is the SINR for the k-th user in the i-th relay combination at stage s, and Ω opt is the optimum relay combination obtained through the proposed greedy relay selection method. The cross-layer optimization in (38) is a non-convex optimization problem due to the discrete nature of the joint detection and relay selection problems. We propose to solve it in two stages using the proposed greedy detection and relay selection algorithms.
The accuracy of \(\hat {b}_{r_{l}d,k}\) directly controls the re-generated signals y rd received at the destination via the physical layer as can be verified from (4); hence, it further affects the decisions \(\hat {b}_{k}\) made at the end as (5) computes.
Improper detection of \(\hat {b}_{r_{l}d,k}\) can cause the error propagation spreads in the second phase.
Consequently, in the second phase, the proposed greedy relay selection strategy is performed at the data and link layer; the selection takes into account the physical layer characteristics as appropriate detection result coming from the lower physical layer can prevent error propagation spreading into the upper data and link layer. In contrast, it also considers the features of the channel combinations so that poor channels can be avoided.
The proposed cross-layer design is detailed in Algorithm 5.
8 Simulations
In this section, a simulation study of the proposed multi-user detectors and the low-cost greedy multi-relay selection method is carried out. The DS-CDMA network uses randomly generated spreading codes of length N=32 and N=16; it also employs L p =3 independent paths with the power profile [0,−3,−6 dB] for the transmission link. The corresponding channel coefficients are taken as complex Gaussian variables and normalized to ensure the average power is unity over the packet. Note that due to fading, there are variations over the transmission but we employ the total average power to set the signal-to-noise ratio (SNR). We assume perfectly known channels at the receiver. Equal power allocation is employed during the transmission. The grey area in the GL-SIC and GL-PIC algorithm is determined by the threshold where d th=0.25. We consider packets with 1000 BPSK symbols and average the curves over 300 trials. For the purpose of simplicity, n=2 users are considered in the GL-SIC scheme at each stage and for the GL-PIC strategy, a three-iteration PIC process is adopted. The SNR is defined as \({\text {SNR}}={\sigma _{b}^{2}} / \sigma ^{2}\), where \({\sigma _{b}^{2}}\) corresponds to the signal power and σ 2 is the noise power. The following simulations are compared and analyzed in both non-cooperative and cooperative scenarios.
In conclusion, in every scenario, the proposed SIC and PIC algorithms perform better than the standard SIC or PIC. In the literatures, a method of standard SIC receivers with forward error coding (FEC) has been introduced and can perform very well. However, it has also been showed that without FEC, standard SIC receivers can show performance degradation in certain situations (low SNR, highly loaded systems, etc.). As a result, the proposed SIC and PIC receivers have the advantage of considering lists of potential candidates for detection, which can significantly improve the performance as compared to standard SIC/PIC receivers. We have limited our studies to uncoded scenarios but we acknowledge that the performance of GL-SIC and GL-PIC can be further improved with FEC.
9 Conclusions
In this work, we have presented the GL-SIC and GL-PIC interference cancellation algorithms, which can approach the ML performance at a much lower cost than competing techniques. We have also proposed a greedy multi-relay selection algorithms that outperforms existing greedy algorithms and obtains a performance close to an exhaustive search. A novel cross-layer design strategy that incorporates GL-SIC or GL-PIC, and a greedy multi-relay selection algorithm for the uplink of cooperative DS-CDMA systems has been also presented. This approach effectively reduces the error propagation generated at the relays, avoiding the poorest relay-destination link while requiring a low complexity. Simulation results demonstrate that the performance of the proposed cross-layer design is superior to existing techniques, can approach an interference-free scenario, and be applied to other wireless systems.
This work is funded by the ESII consortium under task 26 for low-cost wireless ad hoc and sensor networks.
Part of this work has been presented at the European Signal Processing Conference (EUSIPCO), 2014 and the International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2014, respectively.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors' Affiliations
- JG Proakis, Digital communications, 4th edn (McGraw-Hill, Inc, New York, 2011).Google Scholar
- A Sendonaris, E Erkip, B Aazhang, User cooperation diversity—parts I and II. IEEE Trans. Commun.51(11), 1927–1948 (2003).View ArticleGoogle Scholar
- L Venturino, X Wang, M Lops, Multi-user detection for cooperative networks and performance analysis. IEEE Trans. Signal Process.54(9), 3315–3329 (2006).View ArticleGoogle Scholar
- JN Laneman, GW Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behaviour. IEEE Trans. Inf. Theory. 50(12), 3062–3080 (2004).View ArticleMathSciNetMATHGoogle Scholar
- L Bai, L Zhao, Z Liao, A novel cooperation scheme in wireless sensor networks. IEEE Wirel. Commun. Netw. Conf., 1889–1893 (2008).Google Scholar
- MR Souryal, BR Vojcic, RL Pickholtz, Adaptive modulation in ad hoc DS/CDMA packet radio networks. IEEE Trans. Commun.54(4), 714–725 (2006).View ArticleGoogle Scholar
- M Levorato, S Tomasin, M Zorzi, Cooperative spatial multiplexing for ad hoc networks with hybrid ARQ: system design and performance analysis. IEEE Trans. Commun.56(9), 1545–1555 (2008).View ArticleGoogle Scholar
- S Verdu, Multiuser detection (Cambridge, New York, 1998).MATHGoogle Scholar
- S Verdu, Minimum probability of error for asynchronous gaussian multiple-access channels. IEEE Trans. Inform. Theory. IT32(1), 85–96 (1986).View ArticleMathSciNetGoogle Scholar
- R Lupas, S Verdu, Linear multiuser detectors for synchronous code-division multiple-access channels. IEEE Trans. Inform. Theory. 35(1), 123–136 (1989).View ArticleMathSciNetMATHGoogle Scholar
- P Patel, J Holtzman, Analysis of a simple successive interference cancellation scheme in DS/CDMA systems. IEEE J. Select. Areas Commun.12(5), 796–807 (1994).View ArticleGoogle Scholar
- MK Varanasi, B Aazhang, Multistage detection in asynchronous code-division multiple-access communications. IEEE Trans. Commun.38(4), 509–519 (1990).View ArticleGoogle Scholar
- RC de Lamare, R Sampaio-Neto, Minimum mean-squared error iterative successive parallel arbitrated decision feedback detectors for DS-CDMA systems. IEEE Trans. Commun.56(5), 778–789 (2008).View ArticleMathSciNetGoogle Scholar
- Y Jing, H Jafarkhani, Single and multiple relay selection schemes and their achievable diversity orders. IEEE Trans. Wireless Commun.8(3), 1084–1098 (2009).View ArticleGoogle Scholar
- P Clarke, RC de Lamare, Transmit diversity and relay selection algorithms for multi-relay cooperative MIMO systems. IEEE Trans. Veh. Technol. 61(3), 1084–1098 (2012).View ArticleGoogle Scholar
- M Ding, S Liu, H Luo, W Chen, MMSE based greedy antenna selection scheme for AF MIMO relay systems. IEEE Signal Process. Lett. 17(5), 433–436 (2010).View ArticleGoogle Scholar
- S Song, W Chen, MMSE based greedy eigenmode selection for AF MIMO relay channels. IEEE Globecom, 3628–3632 (2012).Google Scholar
- S Talwar, Y Jing, S Shahbazpanahi, Joint relay selection and power allocation for two-way relay networks. IEEE Signal Process. Lett. 18(2), 91–94 (2011).View ArticleGoogle Scholar
- J Tropp, Greedy is good: algorithmic results for sparse approximation. IEEE Trans. Inf. Theory. 50(10), 2231–2242 (2004).View ArticleMathSciNetMATHGoogle Scholar
- R Flury, SV Pemmaraju, R Wattenhofer, Greedy routing with bounded stretch. IEEE Infocom, 1737–1745 (2009).Google Scholar
- Y Jia, E Yang, D He, S Chan, A greedy re-normalization method for arithmetic coding. IEEE Trans. Commun.55(8), 1494–503 (2007).View ArticleGoogle Scholar
- RC de Lamare, Joint iterative power allocation and linear interference suppression algorithms for cooperative DS-CDMA networks. IET Commun.6(13), 1930–1942 (2012).View ArticleGoogle Scholar
- W Chen, L Dai, KB Letaief, Z Cao, A unified cross-layer framework for resource allocation in cooperative networks. IEEE Trans. Wirel. Commun.7(8), 3000–3012 (2008).View ArticleGoogle Scholar
- Y Cao, B Vojcic, in IEEE Wirel. Commun. Netw. Conf. MMSE multiuser detection for cooperative diversity CDMA systems, (2004), pp. 42–47.Google Scholar
- P Li, RC de Lamare, Multiple feedback successive interference cancellation detection for multiuser MIMO systems. IEEE Trans. Wirel. Commun.10(8), 2434–2439 (2011).View ArticleGoogle Scholar
- P Li, RC de Lamare, R Fa, Multi-feedback successive interference cancellation with multi-branch processing for MIMO systems. Veh. Technol. Conf. VTC Spring, 1–5 (2011).Google Scholar


text:
Should I purchase Bottled Water or Filtered Drinking Water Systems?
With the advances in water treatment technology, it is becoming less clear as to whether bottled water or filtered water in your home or business is the appropriate solution. The purpose of this writing is to provide information for home owners and purchasing managers to evaluate as these decisions are considered.
Culligan of Brown County, a full service bottled water and water system vendor, provides bottled water which is produced in a highly controlled and certified bottled water plant operation, as well as filtration and water treatment technology installed on-site to improve the drinking water provided at a home, business or government facility.
Bottled Water Delivery – the longest tradition for great tasting water
Based on decades of experience of delivering bottles of water to homes, offices, manufacturing facilities, health clubs, and numerous other locations, Culligan continues to serve needs of thousands of clients who prefer bottled water for use with water coolers and various types of dispensers. Coolers are usually rented on a month to month basis, and water is delivered on a fixed schedule basis every 4-8 weeks. Bottled water coolers and dispensers can be placed most anywhere, and there is no dependence on electricity or a water supply. If electricity is available, a cooler can be provided that provides hot or cold drinking water. If no electricity is available, room temperature water is provided.
Through experience, Culligan as observed that bottled water delivery is an excellent choice for many, many locations. The ideal situation is when a home or business consumes approximately 25-40 gallons (5-8 5-gallon jugs) of drinking water on a monthly basis at a single location, lacks access to a satisfactory water supply, and wishes to provide refreshing drinking water to clients, employees, family members or guests.
Some clients, over time, have requested a Culligan solution to address the following concerns:
- Storage space needed for the full and empty bottles
- Strength needed to lift the full 5-gallon or 3-gallons bottles of water and placing them on a cooler
For these situations, Culligan clients have considered, and in many cases, decided to deploy the Bottle-Free solution, to service all or part of their high quality drinking water needs.
Culligan Reverse Osmosis Technology Solutions
In some instances, such as in a home kitchen or a lunch room, a Culligan customer will have access to an acceptable water supply, as well as a location to install technology referred to as a reverse osmosis system, which Culligan has branded as its AC-30 Good Water Machine®. This system consists of filters and a reverse osmosis module that delivers gallons of delicious water at the kitchen tap, throughout the whole facility or home, at the cold water tap on the refrigerator, or even at the ice cube maker. In this case, a water dispenser will not be used, but replaced by the dispensing at the kitchen sink, other sinks, or at the refrigerator.
Culligan will assist
Culligan's representatives are trained and certified in the various challenges and technologies related to bottled water delivery as well as the Bottle-Free solutions. Additionally, Culligan provides industry leading services to insure a successfully installation plan is followed and post-installation services are configured correctly for each installation. Culligan's goal is to provide each client with the appropriate solution or solutions for their drinking water needs.
If you would like to further discuss your drinking water situation and the Culligan options for improved drinking water, contact us today in New Ulm at (507) 354-2311 or Sleepy Eye at (507) 794-5561, or send an email to firstname.lastname@example.com
We are ready to go to work for you, and hope we can earn the right to be your water system vendor.

subset: commoncrawl


text:
Less Risk = Less Return (if any)
Posted by jgugliada
You would think this is a concept that has its roots in business school. Unlike other professions, business, we have learned, is inherently risky. The level of success achieved can be a direct result of the risk(s) taken. This is even more so the case for entrepreneurs, small business owners & any business person attempting to develop business.
Yet, every week I encounter more & more people that either did not take this course or failed to grasp its very simple concept. I continually hear "I need to open new markets", "I want an importer for my goods," "I need top line growth" etc... I fully understand, especially in difficult times, the need to grow & expand. Then if we were to revert back to the risk/reward model, the question most should ask " what am I willing to invest (risk) for these results"?
Suprisingly the answer is nothing, zero, nada, zilch. I mention to these folks that I would like stock dividends but I do not want to invest in the stocks!!!
All kidding aside, I can only surmise that many do get this simple concept but are unwilling to invest in growth. Revenue, sales, growth etc. are not going to come knocking at your door.
Please think through a plan for growth that includes a risk/rewards analysis. No one stands still in business. If you are not growing & moving up the ladder, you are certainly falling.


text:
You are hereHome ›
Narrow Search
Now showing results 1-10 of 35
Through the use of rhythm patterns of sounds presented in a solar system model, learners will collect data to determine orbital periods. Then, using that data, they will derive Kepler's Third Law (the relationship between the distance of planets... (View More) from the sun and their orbital periods) and apply the equation to search for exoplanets in orbit around extrasolar systems. Educator resources include a 5E instructional lesson and alignments with Next Generation Science Standards (NGSS): ESS1.B: Earth and the Solar System. This resource is part of the Infiniscope space exploration experiences. (View Less)
Materials Cost: Free
A collection of nine atmospheric science and geography activities that guide students in developing the skills used to analyze GLOBE environmental data. GLOBE (Global Learning and Observation to Benefit the Environment) is a worldwide, hands-on,... (View More) K-12 school-based science education program. (View Less)
Materials Cost: 1 cent - $1 per group of students
Beginning with an online interactive exploration of Karijini Gorge in Australia and Oak Creek Canyon in Sedona, AZ, learners gather geologic evidence regarding the formation of the red rocks found in each. They then apply that information to support... (View More) a hypothesis as to why the rocks on Mars are red. Educator resources include a 5E instructional lesson and alignments with Next Generation Science Standards (NGSS); the NRC Framework for K-12 Science Education; Common Core State Standards for English Language Arts; and A Framework for 21st Century Learning. This resource is part of the Infiniscope space exploration experiences. (View Less)
Materials Cost: Free
NuSTAR has a 10-meter rigid mast that separates the optics from the detector. Inspired by this, students will design, test, and build a lightweight mast 1 meter tall that can fully support the weight of a typical hardcover textbook (~2 kg). The... (View More) footprint of the mast must be no larger than 11" x 14". This activity is from the NuSTAR Educators Guide: X-Rays on Earth and from Space, which focuses on the science and engineering design of NASA's NuSTAR mission. The guide includes a standards matrix, assessment rubrics, instructor background materials, and student handouts. (View Less)
Materials Cost: $1 - $5 per group of students
This is an online lesson associated with activities during Solar Week, a twice-yearly event in March and October during which classrooms are able to interact with scientists studying the Sun. Outside of Solar Week, information, activities, and... (View More) resources are archived and available online at any time. This is an activity about measurements of solar activity. Learners will observe an image of the Sun and sketch major features, plot data to begin to recognize patterns of solar activity, look for long-term patterns in graphed data, compare X-ray and visible light images of the Sun to find solar features common to both sets of images, and make a prediction of what the Sun will look like in a visible light image after observing an X-ray image taken on the same day. This activity is scheduled to occur during Monday of Solar Week. (View Less)
This set of three videos illustrates how math is used in satellite data analysis. NASA climate scientist Claire Parkinson explains how the Arctic and Antarctic sea ice covers are measured from satellite data and how math is used to determine trends... (View More) in the data. In the first video, she leads viewers from satellite data collection through obtaining a time series of monthly Arctic and Antarctic average sea ice extents for November 1978-December 2016. In the second video, she begins with the time series from the first video, removes the seasonal cycle by calculating yearly averages, and proceeds to calculate the slopes of the lines to get trends in the data, revealing decreasing sea ice coverage in the Arctic and increasing sea ice coverage in the Antarctic. In the third video, she uses a more advanced technique to remove the seasonal cycle and shows that the trends are close to the same, whichever method is used. She emphasizes the power of math and that the techniques shown for satellite sea ice data can also be applied to a wide range of data sets. Note: See Related & Supplemental Resources for the maps and data files (1978-2016) that will allow you to do the calculations shown in the video. These also include data for different regions of the Arctic and Antarctic, enabling learners to do additional calculations beyond those shown in the videos. (View Less)
Materials Cost: Free
In this lesson students investigate the effects of black carbon on arctic warming and are introduced to a mechanism of arctic warming that is not directly dependent on greenhouse gases in the atmosphere: black carbon deposition on Arctic snow and... (View More) ice. It can also be used to introduce the concept of albedo. Prerequisite knowledge: students understand the concepts of absorption and reflection of light energy. This lesson is designed to be used with either an Earth/environmental science or chemistry curriculum. It may also be used as an enrichment activity in physics or physical science during a unit on energy. Includes suggested modifications for students with special needs and low technology option. Requires advance preparation, including freezing ice samples overnight. (View Less)
Materials Cost: $10 - $20 per group of students
This worksheet introduces students to the Aura satellite and its Ozone Monitoring Instrument (OMI). Students are asked to visit the Aura website and examine OMI data visualizations to learn about emissions of atmospheric gases such as sulfur... (View More) dioxide, nitrogen oxide and nitrogen dioxide. Students gain experience interpreting OMI data visualizations and are asked to consider implications for climate and human health. (View Less)
Materials Cost: Free
This activity is a short engineering design challenge to be completed by individual students or small teams. A real-world problem is presented, designing buildings for hurricane-prone areas, but in a simulated way that works in a classroom, after... (View More) school club, or informal education setting. Students are given simple materials and design requirements, and must plan and build a tower as tall as possible that will hold up a tennis ball while resisting the force of wind from a fan. After the towers are built, the group comes together to test them. If there is time after testing, which can be observational or framed as a contest between teams, students can redesign their towers to improve their performance, or simply discuss what worked well and what didn't in their designs. (View Less)
Materials Cost: $1 - $5 per group of students
This chapter describes how to set a scale and measure distances and areas on satellite images. Using ImageJ, a freely available image analysis program that runs on most operating systems, users set the spatial calibration of an image, then select... (View More) and measure distances and areas on it. The measurement results are reported in real-world units. The technique is most useful and accurate for nadir view (straight down) images. In this chapter, users examine satellite images of the Aral Sea, which has shrunk dramatically since 1960 because the rivers that flow into it have been tapped for irrigation. Users access satellite images of the region, then set a scale and measure the width of the sea each year. On another set of images, they highlight areas that represent water and measure them to see how these areas of the sea changed. This chapter is part of the Earth Exploration Toolbook, which provides teachers and/or students with direct practice for using scientific tools to analyze Earth science data. Students should begin on the Case Study page. (View Less)
Materials Cost: Free


text:
Harding V MediaWorks (16/009)
Content: "Police appalled by 'alcohol-fuelled bravado" Thursday, 20 March 2016
Publisher: MediaWorks, Newshub website
Complainant: S. Harding
Click here to view full Decision
The Chairman accepted the Complainant was offended by the length and violent nature of the video in the article.
The Chairman took into account the preliminary comment from MediaWorks which said the video "was challenging but it was quite clearly relevant to the item and justified in the public interest". The Publisher said the lead in by the publisher to the video on the news item "gave a clear indication as to the nature of the upcoming fight footage, giving users sufficient information to make a viewing decision based on their own sensibilities: 'Newshub has obtained the shocking video of… a large brawl in Fort Street that lasted several minutes'. The nature of the footage was also made clear by the accompanying text article".
The Chairman said concerns about the material as it was broadcast, including the timing, fell outside the jurisdiction of the Online Media Standards Authority. The Chairman confirmed where previously broadcast material was made available on one of its members websites, a complaint could be considered by OMSA in relation to the online environment.
The Chairman assessed the context in which the violent content was shown concluded said the nature of the material was justified in the public interest. The Chairman also took into account the long lead into the story from both presenters and considered there was sufficient warning for the viewer.
Accordingly, the Chairman ruled the content subject to complaint met the requirements of Standards 5 and Guidelines 5e and 5f, there was no breach of the Code of Standards and therefore, no grounds for the complaint to proceed.
Ruling Date: 31 March 2016
Outcome: No Grounds to Proceed


text:
Last night we went to the Freedom Celebration (put on by our FBC McKinney) and had a lot of fun hanging out with our friends. The girls had a great time in the bounce houses, riding on the hay ride, petting the farm animals, and enjoyed some cotton candy. We ended our night by watching the fireworks show at Adriatica in McKinney.
Abigail was so proud that she made it to the top of the bounce house, thanks to Kinley holding up the line so she could climb up.


text:
In this section, Fiction articles are featured from well established writers from and outside Kashmir. This section is a treat for readers who are in search for Fiction articles regarding all the happenings in Kashmir.
The section is especially for those who readers who like to read the daily happenings in a manner so as to quench their thirst for literature. Sensitive topics like Conflict, Human Rights Abuse and other such topics are presented in a way as make you feel what is it like.
So head over to a journey to read about Kashmir in an all new way to broaden your view about the Paradise on Earth!


text: Orange Circle Christmas Photos December 18, 2016 Korry Brown The Circle at Orange in southern California is a great little old section of town with historic buildings, wonderful charm, and awesome photo backdrops. This couple wanted a little "urban" to their Christmas photos, and that's exactly what they got. How great is that red dress too? #NailedIt.


text:
The South Hagerstown High Alumni Association will meet Thursday at 7 p.m. in the South High media center. Items on the agenda include scholarship information, and planning for next June's golf tournament and alumni mixer.
For more information, go to www.shhsrebelalumni.org.
Pumpkin rolls for sale
St. Andrew's United Methodist Church is taking orders for Thanksgiving pumpkin rolls. The rolls, which are approximately 7 1/2 inches long, cost $6 each.
Orders must be received by Sunday, Nov. 13.
The rolls will be ready for pickup Tuesday, Nov. 22, at the church, which is across from South End Shopping Center.
To order, call 301-791-1773.
Diabetes support group to meet Wednesday
The diabetes support group at Walnut Towers will meet Wednesday at 1:30 p.m. in the eighth-floor community room.
The program will be "How to Keep your Feet if you have Diabetes," presented by Daniel D. Michaels with the Reconstructive Foot and Ankle Institute.
The group is open to individuals who live at Walnut Towers and anyone in the community.
It provides a forum for educating individuals with diabetes to help manage their disease and to gain support from others.
For more information, contact Lisa McCoy, Nutrition and Wellness Services, at 240-313-3360; TTY 240-313-3391
Travelogue series continues at South High
The Kiwanis Club of Hagerstown will present the second program of its Travelogue Series, "Mongolia, Land of Genghis Khan," on Wednesday, Nov. 16, at 7:30 p.m. in the South Hagerstown High School auditorium.
Buddy Hatton will host the program, which will feature a look at the sparsely populated land in the heart of Asia.
The Travelogue Series is a Kiwanis Club community service project.
Season tickets for remaining programs are available at $25 for adults and $10 for students. Single-admission tickets are available at the door at a cost of $10 for adults and $5 for students.
For information or to order tickets, call 301-739-1981.
Share your news about events in area
Call 301-331-5302 or send an email to email@example.com.


text:
I honestly am not sure because the only director I cared about was Matsuno. In my mind it's "some dude after Matsuno" but that name popped in my head first so I thought it may be him.
Oh, okay. I was thinking I'd been looking extra stupid talking about how much I missed Sakaguchi all this time if he hadn't even left. I think they replaced him with Yoshinori Kitase if I have my people straight, but I've no clue if that's who replaced Matsuno for XII.
My issue is paying separately for stuff that could've easily been in the game. I'm talking as far back as PS1 and PS2 days without networks to add things anyway.
So you're saying it happened back then too or it didn't ?
Oh, sorry. I meant my issue is paying for stuff, and I'm referencing PS1 and PS2 as the good ol' days back before DLC and add-ons when you got the whole game with the damn $50 price tag.


text:
EU calls on Turkey not to execute Ocalan
There were strong calls from European leaders for clemency yesterday after a Turkish court condemned the Kurdish rebel leader, Abdullah Ocalan, to death for leading separatist forces in a bitter conflict that has cost 29,000 lives in almost 15 years.
Ocalan (50) stood with his hands folded behind his back in a bullet-proof glass box in court and did not react when Judge Turgut Okyay told him he must hang for treason and mass murder.
"[He has] murdered thousands of innocent people without regard to babies, children, women or the elderly," said Judge Okyay, wearing a traditional black robe with high, scarlet collar.
EU leaders said carrying out the sentence would harm Turkey's prospects of joining the European Union, while the UN High Commissioner for Human Rights, Mrs Mary Robinson, expressed concern over the legal standards of the trial.
In a statement, Mrs Robinson said Ocalan had been subjected to 10 days of detention incommunicado, that his access to lawyers was severely limited, that lawyer-client confidentiality had been breached and that his lawyers were threatened and harassed.
She also expressed concern about the independence and impartiality of the trial judges.
The EU's External Relations Commissioner, Mr Hans van den Broek, emphasised the EU's opposition to the death penalty and said he hoped Turkey would take its position into account.
A French foreign ministry spokeswoman, the Prime Minister and Foreign Minister of Italy and the British Foreign Minister, Mr Robin Cook, added to the appeals for clemency.
Russia also called on Turkey not to carry out the sentence, but a White House spokesman, Mr Joe Lockhart, calling Ocalan an "international terrorist", would not comment on the sentencing of the PKK leader.
A State Department spokesman, Mr James Rubin, said the trial had been "orderly".
European cities stepped up security to avoid a repeat of the angry protests by members of the Kurdish diaspora that followed Ocalan's arrest.
Kurds gathered for protests in Moscow, Paris, The Hague and Strasbourg, but there were no immediate reports of violence. An appeal to Strasbourg's Court of Human Rights is expected.
Ocalan was arrested by Turkish special forces in Feburary in Kenya after months on the run through Europe and Africa.


text:
last week we went to fred and i found a button here and a button there. it was like finding a needle in a haystack. but some of them are pretty cool.
i love these old button cards. there's one with a pine tree scene. it's my favorite. they are so old that they are disintegrating. the prices give us a clue as to their age. honestly. a card full of buttons for .29 or .39?
i love the teeny tiny purple cluster. i couldn't believe i found those in that giant bin filled with junk.
the ships are intriguing.
a nice woman saw scout and i hunting for these and said she had a basket full of crafty items she'd found and she went and got them and handed them to us. it was so refreshing. i wondered didn't she want them and she said she only took them to save them because they were about to remove that bin and they would all go to the dump. i love that. it is something i would do. oddity loves company. you know that saying, don't you? sadly, we only chose a few small things, but the bins we left the remainder in were not going to be pulled right away. hopefully someone came along and loved them. she did have a huge plastic bag filled with smaller, sealed bags of matching buttons. i will show those another night soon. they are really nice. i think they are old also.
there's the pine tree card - the navy blue one with 10 cents on it. it is so fragile. i had fun arranging them and look forward to using them on what i know will be special projects.
sweet dreams, everyone. thanks for stopping by. until tomorrow. happiness to you. from me. with heart. ox joon


text:
Brace yourselves for an analogy.
Imagine, if you will, a world where we don't know anything about beavers or beaver dams. We're exploring a new continent.
Then, one day, our exploration group comes across a strange structure in occasional ponds and streams (you and I would identify it as a beaver dam). This phenomenon is now observed. We have no idea how they form, or why.
We stand around, pondering these strange structures, when someone in the back pipes up.
There's probably a small mammal with an oval flat tail, and big buck teeth, that gnaws down trees and builds these structures. Since this structure exists, that demonstrates this creature exists.You an I would know this person is technically correct, but he/she would be right for the wrong reasons. This person just plucked it out of thin air, and just happened to be correct, without appealing to any evidence, observation or data.
What if he/she said this instead?
There's probably a rainbow dragon with fourteen tongues, that ninja-chops down trees and build these structures. Since this structure exists, that demonstrates this creature exists.Now he/she would be wrong, but notice that all we did was swap one assertion with another... and yet the structure of the argument is the same. Setting aside the fact that dragons are less common than mammals, and that'd drastically reduce the probability of the assertion being true, it should be obvious what the problem is.
If we take it another step further, and swap the beaver with "God", and the beaver dam with "Earth", we get:
There's probably a God that makes planets. Since Earth exists, that demonstrates God exists.It's technically true that Earth is evidence for planet-causing things, but one can assert an endless list of planet-causing things, and Earth's existence would equally support them all (i.e. not much).
We do know that beavers exists, and they create beaver dams... but how do we know this?
- We observed that these dams exist.
- We observed that beavers exist.
- We observed a causal link between beavers and the damns, as we observed beavers making them.
Our knowledge has then confirmed Phenomenon A, Phenomenon B, and the Causal Link between A and B.
When it comes to Earth, and it being created by a god, we're still waiting on #2 and #3.


text:
Oratect AOT-06 FDA Cleared 6 Panel Saliva Drug Test for Employee Drug Testing
Alere Oratect® AOT-06 FDA Cleared Saliva Drug Test
FDA Cleared 6 panel saliva drug test. Free UPS ground shipping for orders over $75.00. Easy online ordering or order by phone by calling our toll free number 1-866-323-7336.
The Alere Oratect® AOT-06 Saliva Drug Test is a simple 6 panel saliva drug test for the detection of drugs of abuse.
The Oratect AOT-06 Saliva Drug Test Kits are:
- Two test strip configurations of 6 drugs
- FDA Cleared for employee drug testing
- Rapidly screen up to 6 illicit drugs and prescription drugs
- Simple procedure: collect and test in one step—results in five minutes
- Convenient and non-invasive rapid screening
- Avoids cross gender observation
- Reduces sample adulteration or contamination
- Includes transport tube for confirmation testing
- Made in the USA
|Drugs of Abuse Saliva Drug Test For
|Methemphetamines (ME)
|50 ng/mL
|Marijuana (TH)
|40 ng/mL
|Cocaine (CO)
|20 ng/mL
|Amphetamines (AM)
|50 ng/mL
|Opiates (OP)
|40 ng/mL
|Phencyclidine (PC)
|10 ng/mL
Saliva Drug Test – Oral Fluids Drug Test – Mouth Swab Drug Tests
Saliva drug testing has become an easier less invasive way of drug testing. Testing can be done anytime or anywhere. No restroom required. Saliva drug testing is becoming a very popular type of drug tests for employers. Drug Testing is easy for all types of employee drug testing:
Pre-Employment drug testing: New applicant drug testing is quick and easy.
Random Drug Testing: Random testing for current employees. No restroom required.
Reasonible Suspicion or for Cause Drug Testing: Saliva test can be done any where at any time.
FDA 510K approved for workplace saliva drug testing. The Oratect AOT-06 (6) panel saliva drug test is easy to administer and a low cost solution to your saliva drug testing need.
The Oratect AOT-06 tests for 6 drug of abuse : THC40, MET50, COC20, AMP50, OPI40, PCP10
US Screening Source provides FDA (510k cleared) saliva drug test. The Alere Oratect AOT-06 6 panel saliva drug test. See below for information about Forensic Use only devices.
- Sold in Boxes of 25 tests
- Includes Drug Tests Results Forms
- Free UPS Ground Shipping
- Made in the USA
- Free Online Drug Testing Training
Oratect AOT-06 Product Information
Package Insert and Instructions


text:
Re: BIOS upgrades
Re: BIOS upgrades
[ Follow Ups ] [ Post Followups ] [ FAQ ] [ Back to Messages ]
Posted by Henry on December 04, 2001 at 11:17:29:
In Reply to: BIOS upgrades posted by Bruno Oliveira on December 04, 2001 at 09:46:45:
: I need the file for BIOS Update, for the Asus P3B-F.
: Can you get it???
Why not get it yourself? You should look for a BIOS update on the mainboard maker's web site. You need to know your mainboard maker (ASUS), mainboard model and possibly the mainboard version.
The ASUS web site is:
Good Hunting,
Follow Ups:
- Re: BIOS upgrades Thor Ove Figenschou 18:44:29 1/29/02 (0)
Post a Followup


text:
Welcome to Drotar Financial Consultants
Certified Public AccountantCertified Fraud Examiner Business Valuations
Honest. Professional. Experienced.
For nearly 20 years, Drotar Financial Consultants has been providing exceptional financial services using a winning combination of expertise and customer service. We take a personal interest in each and every one of our clients, so you get a level of service that's rare in the industry. No matter what your financial issues, Drotar Financial Consultants will take care of everything.
At Drotar Financial Consultats we've built our business on one basic tenet: To provide the highest professional financial services at an affordable cost.Drotar Financial Consultants offers a broad range of financial services for both individuals and businesses. From basic accounting services to the final preparation of reports and taxes, we get the project done - efficiently and reasonably.Furthermore, all of our work is personally completed by Blase Drotar and his expert staff. Our work is never subcontracted out and discretion is always ensured. All of our personnel sign a confidentiality contract that prohibits discussion of clients' information with anyone outside the firm without the expressed permission of the client. With our wealth of experience, our personalized approach and our diverse menu of services, Drotar Financial Consultants helps put your financial goals within reach.
Certified Public Accountant | Certified Fraud Examiner | Business Valuations
Home Page - Clients and Contacts - Financial Consultants - Tax Preparation - Business Valuation - Forensic Accounting - Newsletters - Contact UsDrotar Financial Services, Inc. - 1608 Johnson Road, Plymouth Meeting, PA 19462Copyright © 2002 - 2018 Drotar Financial Services. All Rights ReservedSite design & maintenance by BRK Web Designs


text:
Scientists from Children's Health Research Institute, a program of Lawson Health Research Institute, and Western University have developed a new blood test that identifies with greater than 90% certainty whether or not an adolescent athlete has suffered a concussion.
Diagnosis of a clinically significant concussion, or a mild traumatic brain injury, can be difficult as it currently relies on a combination of patient symptom assessment and clinician judgment.
Equally problematic are the decisions to stop play or activities, or when patients who have suffered a concussion can safely return to normal activities without risking further injury.
In the new study, researchers have demonstrated that a blood test can now accurately diagnose a concussion using a form of blood profiling known as metabolomics.
Dr. Douglas Fraser, a physician in the Pediatric Critical Care Unit at Children's Hospital, London Health Sciences Centre and Lawson scientist, led the study.
In the relatively inexpensive test, blood is drawn from an individual that may have suffered a concussion as the result of a sudden blow to the head (or from transmitted forces from a sudden blow to the body) within 72 hours of the incident.
The scientists measure a panel of metabolites – small molecules that are the products of the body's metabolism – in the blood to search for distinct patterns that indicate a concussion has occurred.
This new method is unique in that previous attempts have looked unsuccessfully for a single highly accurate protein biomarker that can distinguish concussed from non-concussed adolescent patients.
In this latest successful attempt, the researchers took a different approach and investigated a full spectrum of 174 metabolites.
"We looked at all of these metabolites in concussed male adolescent patients and in non-concussed male adolescent patients and it turns out that the spectrum is really different," explains Daley, who is also Western's Associate Vice-President (Research) and a principal investigator at Western's renowned Brain & Mind Institute.
"There is no one metabolite that we can put a finger on but when we looked at all of them, those profiles are different enough that we could easily distinguish concussed patients from non-concussed."
"In fact, with fine tuning we can now look at sets of as few as 20-40 specific metabolites and maintain the diagnostic accuracy level of the test over 90%."
Concussion is a major public health concern, often resulting in significant acute symptoms and in some individuals, long-term neurological dysfunction.
"The discovery of a blood test that can aid in concussion diagnosis is very important," says Dr. Fraser.
"With further research, we anticipate that our blood test will also aid clinicians in predicting concussion outcome, as well as aid rehabilitation after concussion."
The findings were recently published in the international journal Metabolomics.
The technology is subject to a patent application filed through WORLDiscoveries®, the joint technology transfer office of Lawson and Western.
"This relatively quick and inexpensive blood test for concussion is by far the most accurate reported with tremendous potential for clinical management and commercialization," says Kirk Brown, Manager of Business Development for Lawson.
Follow Knowridge Science Report on Facebook, Twitter and Flipboard.
Citation: Daley M, et al. (2016). Metabolomics profiling of concussion in adolescent male hockey players: a novel diagnostic method. Metabolomics, 12: 185. DOI:10.1007/s11306-016-1131-5.
Figure legend: This Knowridge.com image is for illustrative purposes only.


text:
Super Mario 3D Land
- Please Note: 3DS titles are not compatible with standard Nintendo DS console
Mario veterans will have played a 3D Mario game before, but not like this!
Super Mario sees Mario travel into a 3D world where, for the first time, you can see the depth of the land, rather than a rendered 3D game where depth perception can be tricky!
Pulling from Mario games of yesteryear, Super Mario exclusively for the Nintendo 3DS will feature abilities that Mario fans have been asking for to make a return such as the Tanooki tail, giving Mario the ability to hover, glide and attack.
Mario will also gain some new moves in Super Mario to add to his impressive repertoire such as the Somersault attack and the ability to run faster with the dash move.
See also
There are no reviews yet.
Add review
Using Free Standard First Class delivery your order should arrive within 1-2 days (Sundays and Bank Holidays excluded).
For non UK residents delivery times may vary, but most orders arrive within 7 working days.
Please Note: As per Royal Mail guidelines please allow up to 10 working days before contacting us regarding items lost in post.


text:
Last night at the Fan Event for the up coming new Hobbit film, The Hobbit the Desolation of Samug, a new extended sneek peek trailer arrived and it looks good. Check it out below.
The Hobbit: The Desolation of Smaug will awaken in theaters Dec. 13th 2013 and stars: Martin Freeman, Richard Armitage, Ian McKellen, Elijah Wood, Evangeline Lilly, Christopher Lee, Ian Holm, Cate Blanchett, Richard Armitage.


text:
If you know me, it's no secret that I'm a fan of roasting chicken with lemon. This is mainly because of the delicious smells that emit from my oven and fill my apartment. I simply can't get enough. Thank goodness it only takes an hour to cook – any longer would be torture!
I borrowed/adapted this recipe from here, and I have to say – it literally couldn't be easier. Chop up the veggies, throw it all in a baking pan, and roast until it looks awesome. I serve it up with some rice or pasta, and let the delicious juices serve as a sauce.
Also, as a side note, please notice the quality of my pictures this time around. Do they look good or what?! This is the first time I've been able to cook during the day, and the experts aren't lying when they say natural light is best. I usually cook in the dead of night, but going forward my Sunday afternoons will be spent in the kitchen, as opposed to the bar, where you'll usually find me taking advantage of all the Bloody Mary deals in town.
Here's the ingredient list – nothing fancy. Salt, pepper, Italian seasoning, paprika, red pepper flakes, olive oil, sugar, sweet onion, garlic, orange(s), lemons, chicken. If you want to add more herbs, more power to you. Next time I might try some rosemary and thyme.
Slice it all up. Next time I will use 2 oranges instead of 1, since they were so delicious to eat with the chicken. But the lemon slices? Not so much. Sorry lemons, but you're only for flavor and garnish.
Here we have the lovely marinade, basking in some sunshine.
Now that washing chicken is no longer cool, feel free to just pat them dry, and add them into the pan. Drizzle the marinade over, and give each piece of chicken a good rub to make sure they're covered. I always feel a little awkward touching chicken in this manner, but it must be done. Spread out the onion, orange and lemon slices.
Pop it in the oven for about an hour. To get that delicious blackened look, broil on high for a few minutes. Et voila! Roasted citrus and herb chicken that tastes as good as it looks.
I drained a little of the juices out and served over basmati rice.
Citrus + Herb Roasted Chicken
Serves 4-5, cook time 1 hour 15 min
- 8-10 pieces of bone-in, skin-on chicken thighs and drumsticks
- 1/4 cup olive oil
- 3-4 cloves of garlic, minced
- 2 tablespoons of sugar
- 2 lemons – 1 juiced, 1 sliced
- 1 (make it 2) oranges – 1 juiced, 1 sliced
- 2 tablespoons Italian seasoning
- 1/2 teaspoon paprika
- 1/4 teaspoon red pepper flakes
- Salt + pepper, to taste
- 1 sweet onion, sliced thin
- Fresh herbs for garnish
- Pre-heat the oven to 400 degrees F.
- In a bowl, mix together olive oil, garlic, sugar, lemon juice, orange juice, Italian seasoning, paprika, red pepper flakes and salt + pepper. Take care to remove all the lemon and orange seeds.
- Place the chicken parts in a rimmed baking pan, spread out evenly. Drizzle the marinade all over, and rub into the chicken, making sure to coat each piece.
- Scatter the lemon, orange and onion slices in and around the chicken pieces.
- Bake uncovered for 1 hour. Broil on high for 2-3 minutes, until chicken and citrus are blackened.
- Remove half the juices, garnish with any other fresh herb you'd like, and serve hot over rice or pasta.


text:
Hello Mark,
Regarding your concerns,
- Post Mjob on top menu should be visible to non login users and when they try to post redirect to signin or signup.
It's the default workflow of the MjE theme that a user must login to be able to post a job. As it's related to the main workflow, unfortunately, there's no temporary solution I can offer you on this matter.
- Disable Banner and post you mjob in all other page except home page.
Please add this code to file style.css in child theme to disable block banner
.banner{ display: none !important; }
Hope it helps!


text:
A sheet set featuring a top sheet and two pillowcases embellished with a distinctive one-line embroidery on crisp cotton percale. The sheet set includes a top sheet, two pillowcases, and a solid bottom sheet. Pure cotton. Made in Italy. **Please note cotton percale has a crisp, cool feel, and does not have the silky soft hand of cotton sateen. If you prefer silky soft sheets, we recommend cotton sateen.**
Machine wash in cold water with mild liquid biodegradable detergent without added bleach or whiteners. Dry on low setting. Remove before completely dry to fold & iron.


text:
A Secret Weapon For calgary plumberFork out by using a paper trail: Pay back the services Skilled using a charge card or Examine, not dollars, and only pay back the assistance Expert or firm that you discovered on Angie's Record.
I need to offer a compliment to your professionalism that Darryl offered when he came by your house to repair a leak we had. He was quite complete and went as a result of many of the probable situations with me. I'd suggest you and Darryl for anybody that demands a plumber!
If you're still acquiring difficulties, check out Opera's assist page. You can even look for in close proximity to a city, area, or handle alternatively. Simply click Safari inside the Menu Bar at the highest of your screen, then Preferences.
No job is just too small or far too sophisticated. We can easily manage any set up, from the new kitchen faucet to developing an entire plumbing infrastructure to get a new household.
Angie's Checklist vendors you see presented as a possible match for your challenge request are paying out to advertise their companies. As component in their financial investment decision, these taking part support suppliers happen to be Accredited by Angie's Record.
Uncheck the box labeled Never ever make it possible for Internet sites to ask for your Bodily site if It is already checked.
Do your study: Before you employ the service of a contractor, get 2-3 bids to the task. Examine rankings and testimonials on Angie's Listing to check out what other homeowners have experienced to state a few pro's perform. Read through more about hiring a reputable contractor.
Our plumbers are available now for virtually any plumbing repairs or set up companies for your property or enterprise.
When Angie's Record functions challenging to make sure that you will be linked to high-quality service specialists, It truly is finally up to you to choose the correct provider for the undertaking.
Son-Increase Plumbing's totally certified and Qualified specialists are drug website examined and screened so that you don't have to worry about the sort of person you're inviting into your property. From drain cleansing and faucet installations to complex plumbing emergencies, Son-Rise Plumbing has you protected.
Our Accredited gurus demand by The work, not with the hour, there will not be any disagreeable surprises.
After you phone to schedule a plumbing support, whether or not it's here an set up or possibly a repair, we'll do our best to have a technician at your private home inside the same day. And if it's an unexpected emergency, don't wait to call. We respond 24/7 to all unexpected emergency calls.
When we experienced our household designed, the corporate we created with genuinely screwed up calgary plumber our rest room pipes in the learn bedroom. They arrived to… read through a lot more four. Day & Knight Plumbing & Heating
For more than forty decades Knight has actually been working hard to create the sort of plumbing assistance we'd want our very own buddies and people to employ.


text:
Efforts to help children on free school meals are being undermined by ministers' own reforms, according to the government's pupil premium champion.
Sir John Dunford said policies including the downgrading of vocational qualifications, the English Baccalaureate accountability measure and counting only first exam entries in league tables were disproportionately affecting the most disadvantaged pupils.
Speaking at the Independent Academies Association's autumn conference, Sir John said the pupil premium had provided a golden opportunity to close the gap between pupils on free school meals (FSM) and their more affluent peers.
The latest government figures show that 37.9 per cent of FSM pupils gained the equivalent of five or more A*-C GCSE grades, compared with 64.6 per cent of all other pupils.
But Sir John, the national pupil premium champion, said a number of changes were threatening to derail efforts to raise the achievement of FSM students.
"I do believe that there are some reforms that are making our task harder to raise achievement for disadvantaged youngsters and which will impact on our ability over the next couple of years to close the gap," he said.
Among these were the downgrading of vocational qualifications, which were "so important for many of these youngsters", he said.
The emphasis on the EBac, which measures performance in selected academic subjects, also failed to recognise that the skills of some students may lie elsewhere, he added.
Sir John, a past general secretary of the Association of School and College Leaders, was particularly critical of the decision to count only the first exam entry in accountability measures.
Although he accepted that allowing multiple entries had been open to misuse, he said that effectively stopping them altogether had not been the best solution.
"I think that has been particularly damaging to the interests of disadvantaged kids, who did have some encouragement and some practice and some advice in taking the exam first and then again a second time," he said. "If that is right for the children then you should be able to do it."
The decoupling of AS and A-levels, which meant students had to look two years ahead instead of one, plus the abolition of the education maintenance allowance and cuts to the careers service, created a disincentive to stay on at 16 that was particularly acute for disadvantaged pupils, he added.
Related stories:
Education lottery 'stacks odds against' poor pupils, says Oxford academic - 26 September 2014
Pupil premium children to get priority admission to schools under new government plans - 23 July 2014


text:
I was feelin' pretty much like a bamf in a really good Marudon group. I mean, people were kiting the slimes, and we had plenty of ranged to take them down (versus the one group I got where everyone was melee dps). We get to the final boss. Brusslehide Leggings. I grin! Yay, finally! And with only the priest to roll against me… I was ready to rock. Or lose the roll. I lost the roll! But was it to the priest? NO, IT WAS TO THE HUNTER. Guess who else rolled need? The rogue.
The rogue thought it had +agility on it, which it didn't; it had +stam, +int, +spirit. But the hunter, when I said he needed agility, not int/spirit/stam, traded them to me. I could assume the hunter saw LEATHER and was like YEAH NEED without really looking at the stats. But man it was a huge upgrade, so I'm glad he traded them to me. :D


text:
What am I trying to do?
Think about ...
a) how to make science engaging
b) how science communications communicates an underlying ideology (and how this ideology can be challenged through absurdist comedy)
-I need to do some research about 'symbiosis'
-I need to do some drawings and plans.
- I need to plan an event, an event where feedback can be collected from attendees.
From questions
From their own questions
-I need to make some videos.
Found footage editing (find a dvd ripper)
Film myself and friends with costumes and facepaints on
Animated drawings


text:
I was having a conversation with a group of people recently on the subject of prayer in the public schools. One person asked me for my opinion on should we have prayer in the public schools?
Of course I think we should have prayer in the schools just like we need Jesus in the homes of men and women.
Urban Conservative educators are the way of the future in public schooling in this country. We should not just push prayer in schools but also teaching some form of intelligent design (I mentioned this last year when Dick DeVos discussed it during his Gubernatorial run in Michigan) as well as demonstrating high standards in our classrooms.
Urban Conservatives need to oppose any form of degeneration of our public schools. We need to get beyond the banality of the self-comforting self and the superficiality of a compassion that always ends in a government program. We need to expose the deliberate leveling of our people by the liberals who are in charge of our education. The best way to do that is to be explicit about the conservative end of education.
Take a look at public schools in Detroit, Benton Harbor or Flint for instance. No God and more violence. Less home economics classes as well as etiquette courses and more discussion on ghetto life.
At present, urban conservatives advocate school policies such as more discipline, learning by rote, going back to the basics, teaching right and wrong, and making teachers accountable. They promote changes such as vouchers and charter schools designed to liberate our schools from unions and liberal bureaucrats. These are reforms worth fighting for, but it is tempting to invest too much in them by treating them as ends in themselves.
The key for us is to keep our eyes on the end beyond: the content of our education. We get a glimpse of this end in the general concern over falling standards in education. Though many deplore the obvious relaxation that comes with easy grading, only conservatives raise it as an issue. Here above all we witness the amazing decline in our time of liberalism as a philosophy of education.
In our public schools today there are rampant Gay and Lesbian gangs running the public schools, high drop out rate, low graduation rates (Detroit only graduates 25% while the DPS system has lied in public and graduate 61%), the lack of parental involvement and no spiritual guidance.
Why morality is needed in our Detroit Schools today? Did you look at former CEO William Coleman, who was indicated in Texas? Does he look like a man of God?
Although members of the Republican Party as a whole have been more inclined to support a school prayer amendment than their Democratic brethren, the party has by no means stood unified on the issue.
But for Black Republicans who I have discussed this issue with they stand 100% on the issue of instituting school prayer in the classrooms. After all, any time you have a crisis that faces you either in your personal life or as we have now in our country, reaching out to a supreme being is a very normal act.
Our children should be taught such values as patriotism, self-discipline, thrift, honesty, and that there is a moral difference between the United States and North Korea. In the Black Community the teaching of values and ethics in our public schools should be an integral part of the curriculum. The values on which there is wide agreement, for example, honesty, courage, humility, kindness, generosity, and patriotism have been eliminated from many texts. With so many fatherless homes and over 70% of households in our community are headed by single parents (mostly females) we need to re instill moral values in the schools to get rid of the ghetto culture that has ravaged our community.
Perhaps the clearest example is from our President, Ronald Reagan, who had this to say about education's basic purpose: "We're beginning to realize, once again, that education at its core is more than just teaching our young the skills that are needed for a job, however important that is. It's also about passing on to each new generation the values that serve as the foundation and cornerstone of our free democratic society--patriotism, loyalty, faithfulness, courage, the ability to make the crucial moral distinctions between right and wrong, the maturity to understand that all that we have and achieve in this world comes first from a beneficent and loving God."
Why stress the importance of moral character education in our public schools today?
Why is the home and church not sufficient for this task? We know that children are impressionable. Their minds and attitudes are forming as they grow. They learn attitudes, morals, and values from both adults and peers, but especially from adults. This is because of the human propensity to respect and obey authority figures, a trait that is impressed into children very early in life, and which also was selected for during human evolution because of the increased survival value it gave human populations. Teachers are adults who children learn from, identify with, and emulate. These authority figures spend a considerable portion of the day with each individual child, more so than the parents in many instances, and certainly more than most churches can provide. Teachers can reinforce proper morals and values in children to a great extent. If a child is not learning proper morals and values at home or in the church, which is in fact the situation to an alarming extent today in the United States, the teacher may be the only authority figure with whom the child has contact and who can inculcate the proper morals and values. Even if a child receives the proper training at home or church, I believe it is important for a teacher to reinforce moral instruction so that the child's total environment works for the same worthwhile end.
Today our children are exposed to such nonsense such as the ghetto culture, Flava of Love, Charm School on Vh1, New York from Flava of Love, Black Supremacy, Black liberal press, BAMN, liberal churches and Black organizations who uses race as a wedge issue against whites and other races of people.
The situation is so dire in Detroit that Rep. Shanelle Jackson has even proposed a bill in the State House to allow meditation to occur in the schools for the children. As an educator, I can clearly see why that is necessary.
We all need prayer in our hearts and schools. Let's make it happen.


text:
Transform your photos into one-of-a-kind, hand painted masterpieces!
by Van Cordle
The Fox Theater by Van Cordle - 7.375" x 10.000"
Archival Matte Paper
Rolled in a Tube
Assembly Charge
Art Print
The Fox Theater art print by Van Cordle. Our prints are produced on acid-free papers using archival inks to guarantee that they last a lifetime without fading or loss of color. All art prints include a 1" white border around the image to allow for future framing and matting, if desired.
Ships Within
2 - 3 business days
Van--you have been away far too long. Your works are all simply stunning.
You might be interested in a new group I started Signage Odd Interesting and Noteworthy. You have a number of pieces that could find a home there. Please consider joining.
Pristine! You might show your work to a museum in the area to see if they want to exhibit it or acquire it (money is tight, but you never know!)
Van, amazing work, You' ve just inspired me to do some more sign paintings!
Van, I grew up in Atlanta and used to live across the street from the Fox . All I can say is that this piece is absolute perfection and takes my mind right home!
Most excellent!
I can tell by some of the shadow detail that this an not a photograph but still the detail is awesome. Wonderful work.
wow,Van it´s amazing...i can´t believe that it is a painting...perfectly done
Both a wonderful experience and a mighty fine painting. I think you let it go for beans though :) And I've been to this Fox theater as I don't live far from Atlanta.
The Fox Theatre was on one side of Broadway, the Babcock Theatre on the other. Going to a Saturday matinee was magical. The buyer of this beautiful piece of movie history got a deal...wow!
Van . . . I LOVE, LOVE, LOVE this one!!! ~ Cher
Amazing :)
All prints ship in durable cardboard tubes.
Pixels is one of the largest, most-respected giclee printing companies in the world with over 40 years of experience producing museum-quality prints. All of our prints are produced on state-of-the-art, professional-grade Epson printers.
We use acid-free papers and canvases with archival inks to guarantee that your prints last a lifetime without fading or loss of color. Paper prints include a 1" white border around the image to allow for future framing and matting. Canvas prints include a 2.5" white border to allow for future stretching on stretcher bars.
Prints ship within 3 - 4 business days in durable cardboard tubes.
Average Rating (5 Stars):
January 21st, 2019
Michael Platarote
January 21st, 2019
January 20th, 2019
The Fox Theater in Atlanta Georgia, There used to be a Fox in just about every major city. This one was fully restored and in 1989 they celebrated the 60 th anniversary of "Gone With The Wind" with a black tie event and commissioned special posters of "the Fox Theater" commemorating the event! Ted Turner was there along with 7 of the original cast of the movie and many elite, I was there in black tie signing prints, a great event and a great painting! The original 36 x 48 oil painting sold for $10,000.00.
VAN B. CORDLE I consider myself to be a natural surrealist and although my paintings may at first bring to mind such terns as "photo-realism" or "super-realism", but they are in fact, quite painterly. Although they have been tightly rendered to give the illusion of reality, they are unlike the photo-replicative paintings of most photo-realists. When and if I take photographs, I use them as sketches to be used and surpassed, not as goals to be reached. I am inspired by the simplicity and nostalgia of old neon signs. I knew a few other artists had done some similar works, like John Badder did an occasional sign included in his Café series, but thought I was the first to do a serious series of oil paintings on Neon signs back...
Our return policy is very simple:
If you're not happy with a purchase that you made on Pixels.com, for any reason, you can return it to us within 30 days of the order date. As soon as it arrives, we'll issue a full refund for the entire purchase price. Please note - Pixels does not reimburse the outgoing or return shipping charges unless the return is due to a defect in quality.
Pixels sells thousands of pieces of artwork each month - all with a 100% money-back guarantee. We take great pride in the fact that hundreds of thousands of artists have chosen Pixels to fulfill their orders, and we look forward to helping you select your next piece!
All art prints ship from our production facility within 2 - 3 business days of your order.


text:
Issue 526
Published: 23rd November 2016
In this issue:
Latest News from around the UK National Network and the heritage railways, including Vintage Trains to become charter TOC, Government commits funding for East-West Rail and Class 442s could return under Alliance Rail plans.
PLUS! Hitachi Class 800s undertake Hertford Loop ETCS testing


text: Summers are tough. They make life a living hell due to the heat one has to bear and the hike in electricity bills they have to manage somehow. Price hikes are a commonplace in summers because almost everyone increases their usage of air conditioners, refrigerators, and even swimming pools, which all require electricity for their functioning and maintenance. But it isn't difficult to get a hold on your electricity bill in summer if you follow a few tips from Gold Coast Electricians. So what tips might they be? Well, to answer this questions in this post we have compiled an interesting list of "Top Tips for Surviving Summer from a Gold Coast Electrician".