text:
A memory architecture is provided to enable parallel access along any dimension of an n-dimensional data array. To enable parallel access of s data elements along any dimension, the data elements of n-dimensional data array are mapped to s parallel memory banks in such a way that consecutive s data elements along any dimension are mapped to different memory banks. This mapping is defined by two functions, which define the memory bank number and location within a memory bank for each data element in n-dimensional data array. The necessary and sufficient conditions, which the mapping functions should satisfy in order to enable parallel data access, are described. These generic function pairs are described for all combinations of (n, s). Two particular instances of the mapping, namely circular permutation (rotation) along 0th dimension and dyadic permutation along 0th dimension have been discussed in detail. The mapping defined as dyadic permutation along 0th dimension holds only for values of s, which is integer power of 2. The mapping defined as circular rotation holds for any integer value of s. For these mappings, the basic architecture as well as its extensions are discussed. The basic architecture is for n-dimensional data array which has only s data elements along each dimension, whereas the extensions are for data arrays with m data elements along each dimension under the constraint that m is an integer multiple of s.
1. An apparatus for providing parallel access to data elements of a data vector of an n-dimensional rectangular array, comprising:
an address generation logic module, for receiving an index of a first data element of a data vector to be stored into memory and for receiving a dimension of access, generating addresses to which to store the data elements of the data vector, the address generation logic requiring that each data element of a data vector is stored in a different memory bank to allow parallel access along any dimension of the n-dimensional rectangular array;
a permuter, coupled to the address generation logic module, for receiving the addresses, receiving the dimension of access, and receiving the index information of the first data element of the data vector, for carrying out a permutation operation on the addresses by generating a bank number of a memory bank to which to issue the addresses, the permuter requiring that each data element of a data vector is stored in a different memory bank to allow parallel access along any dimension of the n-dimensional rectangular array, and for storing data elements at the generated address and bank number corresponding to the each data element of the data vector; and
at least s memory banks, coupled to the permuter to allow parallel access by the permuter to the s memory banks, to receive addresses to store each data element of the data vector, where s is equal to the number of data elements in a data vector.
2. The apparatus of
an inverse permuter, for receiving the index information of the first data element of a data vector and for receiving the information of a read operation, and coupled to the s memory banks, for performing the permutation operation on data elements, which is the inverse of the permutation operation performed by the permuter on the addresses, to generate the bank numbers from which to retrieve the data elements of the data vector.
3. The apparatus of
4. The apparatus of
5. The apparatus of
6. The apparatus of
where [an−1, an−2, . . . , an−0] is the index of first data element of the data vector, n is the dimension of the data array, and s is the number of data elements in the data vector.
8. The apparatus of
where [an−1, an−2, . . . , a0] is the index of first data element of the data vector, j is the dimension of access, n is the dimension of the data array, s is the number of data elements in the data vector, and m=st where t is an integer.
10. The apparatus of
11. The apparatus of
13. The apparatus of
the parameter for circular permutation is given by aj mod s, where ⊕ denotes bit-wise EXORing, [an−1, an−2, . . . , a0] is the index of the first data element of the data vector, j is the dimension of access, n is the dimension of the data array, s is the number of the data elements in the data vector, and m=st where t is an integer.
15. The apparatus of
16. The apparatus of
17. The apparatus of
18. The apparatus of
19. The apparatus of
20. The apparatus of
This application claims the benefit of Provisional application No. 60/114,374 filed Dec. 30, 1998.
The present invention is related to the field of memory architecture, more specifically, to n-dimensional hyper-matrix (rectangular data array) with s-data elements along each dimension.
The design of a memory architecture for a n-dimensional rectangular data array is a well-known problem and its scope stretches to a myriad of applications. The particular cases of parallel data access in 2- and 3-dimensional rectangular data array is of importance for signal processing applications. Specifically, the memory architecture for 2-dimensional data access is attractive for video, image, and graphics processing whereas data access to 3-dimensional space is attractive for 3-dimensional graphics and video signal processing.
Many image and video processing algorithms require either row-wise or column-wise access to data in a 2-dimensional data array (an image or a frame of a video sequence). The most relevant applications are lossy compression algorithms for images and video, which use 2-dimensional separable transforms such as Discrete Cosine Transform (DCT) and Inverse Discrete Cosine Transform (IDCT). These transforms are an integral part of compression techniques utilized in widely accepted video and image compression standards such as MPEG (Moving Picture Expert Group), H.261, H.263, JPEG (Joint Photographic Expert Group), etc. In accordance with the recommendations made in these standards, each image or a frame in a video sequence is divided into macroblocks, which is further divided into blocks of (8�8) data array. In the encoder, the 2D-DCT operation is applied over this block of (8�8) data array followed by quantization and entropy coding to achieve compression. In the decoder, a 2D-IDCT operation is performed after variable length decoding and de-quantization operations. The 2D-DCT (or 2D-IDCT) is a separable transform and can be computed by performing a 1D-DCT (or 1D-IDCT) operation over all the rows of a block followed by a 1D-DCT (or 1D-IDCT) operation over all columns, or vice-versa.
As shown in FIG. 1, after the first 1D-(I)DCT operation 12 over all the rows (or columns) of 8�8 block 11, the data is to be fed to second 1D-(I)DCT block 14 in column-(or row-)wise fashion. This requires a memory 13 which allows both row-wise as well as column-wise access because after the first 1D-(I)DCT operation 12 the data is written into memory 13 in row(column)-wise fashion, whereas for second 1D-(I)DCT operation 14 data is read from the memory 13 in column-(row-)wise fashion. For a DSP 15 processor with SIMD architecture having 4 data-elements vector as operands, each (8�8) block can be divided into four data arrays of size (4�4). For each row (or column) of this (8�8) block, two row-wise (or column-wise) accesses are required to be made, each access fetching four consecutive elements. The present invention provides a scheme that meets this requirement.
Similarly, the 3D-(I)DCT can also be achieved using 1D-(I)DCT but in this case the transpose memory should be such that it allows the parallel access to data along all three dimensions. The present invention describes a memory architecture for a n-dimensional data array allowing parallel access to data along any of the n dimensions.
The problem of 2-dimensional memory architecture allowing row-wise as well as column-wise access is not new, but there is no record of extension of the same concept to higher dimensions to the best of the authors knowledge. As a solution to carrying out 2-dimensional matrix transpose operation, several conventional transpose memories have been proposed.
In U.S. Pat. No. 5,740,340, as is understood, the memory cells are organized as an (s�s) data array. The s rows and s columns are addressed by 2s addresses, and there is a decoder that decodes any one of the said 2s addresses and enables access to said s rows of data and said s columns of data. This solution appears quite restrictive, since it needs a special kind of 2-D memory in which any row or any column can be enabled at a time for accessing. In addition, all enabled locations are accessed at a time. So the extension of this architecture will be very complex for large data arrays which are segmented into smaller (s�s) data sub-arrays as only a complete row (or column) of a data array is enabled, not part of it. The mentioned complexity is not addressed in the disclosed document of the patent. Further, the complexity of this scheme is higher as it involves s2 banks as compared to s banks in the present invention. Moreover, this scheme can not be generalized to n-dimensional data arrays.
The U.S. Pat. No. 5,481,487 appears to suggest a different memory architecture, which requires 4 parallel banks to store one (8�8) data array. Each bank stores one of the four quadrants of the data array, each quadrant being a (4�4) data array. This scheme appears to have the following restrictions:
1. Though address and data buses are provided for all the four banks, not all are accessed in parallel.
2. This memory architecture is restrictive in the sense that it implements only a transpose function. If data is written in row (column) order, it can be read only in column (row) order.
3. This scheme is restricted to only one (8�8) block, and cannot be generalized to store larger 2-dimensional data arrays.
4. This architecture can store consecutive (8�8) blocks (in the same memory locations) but with the following restriction. If a first (8�8) block is written in row-wise (column-wise) order then a second block must be written in column-wise (row-wise) order.
5. This scheme may not be generalized for storing n-dimensional data arrays.
In U.S. Pat. No. 4,603,348, a memory architecture has been described for storing a multi-dimensional array. According to this scheme, the n-dimensional array is divided into a number of divisions, which do not overlap. Each such division is defined as an n-dimensional array with 2 elements in each dimension. The number of banks in the proposed architecture is equal to the number of elements in each of these divisions. Each bank has one data element from a given division, hence enabling the parallel access to all elements of a division. This scheme appears to provide access only to a division of an n-dimensional array. In contrast, the scheme disclosed in the present invention provides access to data along any given dimension.
In U.S. Pat. No. 4,740,927, a bit addressable memory has been proposed in which a 2-dimensional array of bits is divided into partition sectors equal to the number of parallel memory modules (banks) provided. Each memory module has addresses equal to number of bits in each partition sector. Each partition is divided into several s�s matrices, where s is the number of parallel banks. The logical placement of the bits of these matrices is such that bits of any row or column lie in different memory modules, providing parallel access along row and column. However, the present invention proposes an architecture with less complex address generation logic. A particular case of proposed architecture, referred to as memory architecture with dyadic permutation, provides an address generation logic in which a main operation is a logical EXORing operation as against the addition operation in address generation logic proposed in the prior art. Moreover, unlike this scheme, the invention disclosed in this document is much more generic and holds good for a dimension greater than 2 as well.
The present invention provides a novel solution to overcome the disadvantages of the prior arts.
The objective of the present invention is to provide a generalized framework of memory architecture for n-dimensional rectangular data arrays such that parallel access to data along any of the n dimensions is possible. It is claimed that the memory architecture of the present invention is generic and less complex as compared to architectures discussed in prior arts. It also overcomes the disadvantages of the prior arts for 2-dimensional transpose memories. The objective of this invention is achieved by applying a simple, yet effective, method of rearranging (permuting) the elements of the data array while reading/writing data from/to the memory. This rearrangement is the distinguishing feature of this invention. The brief description of the invention is as follows.
The proposed memory architecture allows parallel access to s data elements along any given dimension of an n-dimensional data array, each dimension having s-data elements1. It is evident that in order to provide parallel access to s-data elements, there must be s-parallel memory banks. The data of this array is stored in these banks in such a fashion that all s data elements of a vector of data, which is parallel to any of the n dimensions, lie in different banks.
1 For 2-dimension (s�s) data array, it means that the memory architecture of the present invention allows parallel access to all s elements in any row or column of the said data array.
1. More specifically, the present scheme allows parallel access to s-elements along any given dimension of an n-dimensional data array with s-elements in each dimension. For an example with n=s=3, please refer to Sub-array 21 in FIG. 2.
2. The hardware complexity of this scheme is less than the similar solutions proposed in past. The reduction in complexity is achieved by introducing a particular type of rearrangement in the data to be read from/written into the memory. This particular feature makes this scheme different from other solutions for the given problem.
3. Unlike the schemes proposed in prior arts, the scheme described in the present invention is not restricted to only 2-dimensional data arrays. This scheme is generic for n-dimensional rectangular data array.
4. Unlike other similar solutions, this scheme can be extended to cover a larger n-dimensional data array with m (m=st; where t is greater than 1) data elements along each dimension, which can be divided into smaller n-dimensional rectangular data sub-arrays with s-elements along each dimension. Please refer to FIG. 2 for an illustration with n=s=3 and m=6.
5. Further, at the cost of a little more complexity, the scheme can be generalized to access the s data elements in parallel, from any index within an n-dimensional sub-array. More precisely, the s-data elements to be accessed need not start from a boundary of one sub-array and hence may as well stretch to adjacent n-dimension sub-array (Refer to Sub-arrays 22, 23, & 24 in FIG. 2).
6. The complexity of address generation logic in this scheme gets reduced significantly if the parameter s is an integer power of 2.
7. This scheme can also be used to access data serially, if addresses are issued serially.
FIG. 1 shows the implementation of 8�8 2D-(I)DCT using 8-point 1D-(I)DCT.
FIG. 2 shows the possible accesses in the proposed memory architectures which allows parallel access to 3 data elements (i.e., s=3) in 3-dimensional data array.
FIG. 3 shows the basic memory architecture for n-dimensional rectangular data array with m data elements along each dimension.
FIG. 4 shows a memory architecture for Case A under Circular Rotation Permutation.
FIG. 5 shows a memory architecture for Case C under Circular Rotation Permutation.
FIG. 6 shows a memory architecture for Case A under Dyadic Permutation.
FIG. 7 shows a memory architecture for Case B under Dyadic Permutation.
FIG. 8 shows a memory architecture for Case C under Dyadic Permutation.
FIG. 9 shows the correspondence between an index in a 4�4 matrix and a location in memory bank.
The present invention provides a generalized framework for a memory architecture for a n-dimensional rectangular data array, which enables parallel access to data along any of the n dimensions. The underlying concept of this invention is first described in a generic sense with an aim to define a class of architectures, which include all possible variants of this scheme. Subsequently, a scheme is described with examples for a particular case, which, apparently, has the least complexity in the class of variants of that case. Before proceeding further, the following three definitions have been provided to enhance the readability of the document.
1.1 Definitions
1. n-dimensional hyper-matrix: It is an n-dimensional rectangular data array. Any location of a data element in an n-dimensional hyper-matrix is given by index [an−1, an−2, . . . , aj, . . . , a0]. Here, aj is the index for dimension j. The data array has a single data value stored at each of its locations.
2. p-bounded n-dimensional hyper-matrix: It is an n-dimensional hyper-matrix with p data elements along each dimension (i.e. ai ε{0,1, . . . , p−1}). For example, a p-bounded 2-dimensional hyper-matrix is a (p�p) matrix. The notation (p,n)-hyper-matrix is used to represent a p-bounded n-dimensional hyper-matrix. In this document, a (m,n)-hyper-matrix with m=st (t being an integer greater than one); will be assumed to be divided into tn number of smaller (s,n)-hyper-matrices. The starting index of each (s,n)-hyper-matrix in (m,n)-hyper-matrix is an integer multiple of s along each of the n-dimensions.
3. Data Vector: A data vector in a (m,n)-hyper-matrix is a sequence of s data in the hyper-matrix along any given dimension. It is defined by the index of the starting location in the hyper-matrix and the dimension along which its elements lie. A data vector along the dimension j which starts from the index [an−1, an−2, . . . , aj=d, . . . , a0], constitutes a sequence of data at indices given by [an−1, an−2, . . . , aj=d, . . . , a0], [an−1, an−2, . . . , aj=(d+1), . . . , a0], . . . , [an−1, an−2, . . . , aj=(d+s−1), . . . , a0]. Here, 0<=d<=m−s. It should be noted that, for data vectors along the dimension j in an (s,n)-hyper-matrix, the index aj in the starting location will be 0.
1.2 Theory of Underlying Concept
The present invention describes a memory architecture with s parallel banks for storing all data elements of a (s,n)-hyper-matrix, so as to enable parallel access to all the s data elements of a data vector. Since s data elements are accessed in parallel, the total number of banks used in this invention are indeed minimum. The data of a (s,n)-hyper-matrix is re-arranged before it is stored in the s-parallel banks of memory. The rearrangement of data is such that it ensures that all s elements of any data vector in this (s,n)-hyper-matrix are stored in different banks.
Two functions, g and f define the rearrangement described above. These functions take the index of a data element as its argument. The data element at index [an−1, an−2, . . . , a0] in the (s,n)-hyper-matrix is mapped to address g(an−1, an−2, . . . , a0) in the bank number f(an−1, an−2, . . . , a0).
Functions, f and g must satisfy the following conditions to ensure the parallel access to all elements of any data vector.
Condition 1: g(an−1, an−2, . . . , a0)ε{0,1, . . . , sn−1 −1} and
f(an−1, an−2, . . . , a0)ε{0,1, . . . , s−1}
Condition 2: The function f(an−1, an−2, . . . , a0) should be such that for any given value of j, f(an−1, an−2, . . . , aj=p, . . . , a0) equals to f(an−1, an−2, . . . , aj=q, . . . , a0), only if p=q. This condition ensures that all s elements of any data vector maps to different memory banks.
Condition 3: Further, g and f should be such that above mentioned mapping is one-to-one. It means that the pair (g(an−1, an−2, . . . , a0), f(an−1, an−2, . . . , a0)) will be unique for any given index [an−1, an−2, . . . , a0]. This condition ensures that no two data elements of a hyper-matrix are stored at the same address in the same bank.
It is claimed that for a given value of n and s (in an (s,n)-hyper-matrix), many such rearrangements are possible. In other words, there exists more than one distinct pair of functions (g,f) for given values of n and s.
The present invention scheme can easily be generalized for a (m,n)-hyper-matrix, which is assumed to be divided into (s,n)-hyper-matrices (Please refer to FIG. 2 for illustration). The different (s,n)-hyper-matrices in the (m,n)-hyper-matrix are linearly mapped in s-parallel banks. It should be noted that for each (s,n)-hyper-matrices, the data is rearranged before it is stored in the memory. In this context, at least two variations are possible.
1. All s data elements of the accessed data vector, lie within a given (s,n)-hyper-matrix,
2. All s data elements of the data vector to be accessed, may span over two adjacent (s,n)-hyper-matrix.
1.3 Description of Basic Memory Architecture
The basic architecture for proposed memory for (m,n)-hyper-matrix is shown in FIG. 3. Here, m=st and t is an integer. For storing the s-data elements of any data vector into the memory banks, n-dimensional starting index, the dimension along which the data is to be stored, and the s data elements are provided to this architecture. For reading s data elements in parallel, the n-dimensional starting index and the dimension of access are provided to the memory architecture. Based on these, the addresses for all of s banks 34 are computed by Address Generation Logic 31 and issued to the banks 34 after carrying out a permutation (rearrangement) by Permutation Logic 32, which ensures that only the required locations are accessed in each bank. The Inverse Permutation Logic 33 for the data read from (written into) the memory is inverse (same) of Permutation Logic 32 for addresses. Although, the Address Generation Logic 31 and Permutation Logic 32 are shown as separate blocks, they can be merged into one block.
As discussed earlier, for a given value of n and s (in an (s,n)-hyper-matrix), many such rearrangements are possible. The Address Generation Logic 31 defined by the functions g and f are different for each rearrangement. Therefore, the complexity of the Address Generation 31 and Permutation Logic 32 in the architecture described in FIG. 3 will also be different for different rearrangements. Among all possible rearrangements, the preferable ones are those which lead to simpler and regular hardware. All other possible rearrangements for a given value of n and s are claimed to be different architectural realizations though conceptually same as discussed in the present invention. One class of such rearrangements is permutation along any one dimension. In the rest of the document, the permutation along 0th dimension is taken up without loss of generality. For this case, the permutation and address generation logic is also provided.
1.1 Permutation Along 0th Dimension
In an (s,n)-hyper-matrix, there are sn−1 data vectors which are along the 0th dimension. The starting index for these data vectors is given by [an−1, an−2, . . . , a1, 0]. For this case, s-elements of any such data vector are stored at the same memory address but in different banks. The bank number for elements of any such given data vector is obtained by using a function f, which satisfies the conditions mentioned earlier. The advantage of this rearrangement is that the mapping (function g) of the elements of data vectors to address in the banks becomes independent of the function f. The address function g(an−1, an−2, . . . , a1, a0) is taken as
which clearly satisfies the Condition 1 for function g. It should be noted that a0 is not involved in computation of the address for the banks 34, as the address is same for all elements of these data vectors. Since, a0 will be different for all elements of any such data vector, the function f will ensure that these elements are indeed stored in different banks. Hence, Condition 3 is also satisfied.
In reference to the memory architecture of FIG. 3 for this case, the data at index [an−1, an−2, . . . , a0] in the (s,n)-hyper-matrix is stored at the address g(an−1, an−2, . . . , a1, a0)
in the bank number given by f(an−1, an−2, . . . , a0). Now for accessing a data vector along jth dimension and starting from index [an−1, an−2, . . . , aj=0, . . . , a0], the Address Generation Logic 31 generates addresses
The Permutation Logic 32 permutes these addresses using function f and send them to banks f(an−1, an−2, . . . , aj=0, . . . , a0), f(an−1, an−2, . . . , aj=1, . . . , a0), . . . , f(an−1, an−2, . . . , aj=s−1, . . . , a0), respectively. The read vector is obtained after applying inverse permutation in Inverse Permutation Logic 33.
A permutation function f is to be defined to complete the description of the memory architecture. Among all rearrangements corresponding to the permutation along any given dimension, the one which is obtained by dyadic permutation appear to be the least complex for values of s which is an integer power of 2. For any general value of s, a circular permutation can be used. These two permutations are taken up to explain the concept for following three scenarios.
Case A This memory architecture is for a (s,n)-hyper-matrix which allows parallel access to all elements of any data vector,
Case B This memory architecture is for a (m,n)-hyper-matrix which is divided into a (s,n)-hyper-matrix. This memory architecture allows parallel access to all elements of any data vector which lies within a single (s,n)-hyper-matrix,
Case C This memory architecture is for a (m,n)-hyper-matrix which is divided into a (s,n)-hyper-matrix. It allows parallel access to all s data elements of any data vector which may span over two adjacent (s,n)-hyper-matrix. It should be noted that Case B is the special case of Case C.
1.4.1 Memory Architecture for Circular Rotational Permutation
The permutation function corresponding to circular rotation is given below. It is obvious from the properties of mod s addition that this function satisfies Conditions 1 and 3.
Case A: For this permutation function, the data at index [an−1, an−2, . . . , a0] in the (s,n)-hyper-matrix is stored at the address
in the bank number given by
mod s (refer to FIG. 4). More precisely, for accessing all s data elements in parallel manner along the jth dimension 42 from [an−1, an−2, . . . , aj=0, . . . , a0] starting index 41, the s addresses 47 are
Here, s−1 should be treated as 0. The Permutation Logic 44 for the addresses is an anti-clockwise circular rotation by
mod s. The direction of circular rotation in Inverse Permutation Logic 45 is anti-clockwise for storing data into the memory, whereas it is reverse (clockwise) for reading data from memory. The amount of rotational shift in Inverse Permutation Logic 45 for the data read/write operation remains the same as for the addresses.
Case C: The basic architecture (shown in FIG. 5) for this generalization (an (m,n)-hyper-matrix where m=st and ai′s (0<=i<n; 0<=ai<m) being the indices along the dimension i) remains the same as in Case A, only the address generation logic and width of the address bus changes. For a given value of index ai; let ai″=(ai mod s) and ai′=(ai−ai″). For the s consecutive data elements to be accessed along the jth dimension 52, starting from index [an−, an−2, . . . , aj, . . . , a0]51, let the index of kth accessed elements be denoted by [an−1 k, an−2 k, . . . , aj k, . . . , a0 k].
For all the s data elements to be accessed only index aj k in the n-dimensional index is different and the others remain same. The index aj k is equal to aj+k. Therefore, the s addresses generated by Address Generation Logic 53 for the memory banks 56 are given by
where k=0, . . . , (s−1). The Permutation Logic 54 for the addresses is an anti-clockwise circular rotation by
mod s. The direction of circular rotation in Inverse Permutation Logic 55 is anti-clockwise for storing data into the memory, whereas it is reverse (clockwise) for reading data from memory. The amount of rotational shift for the data read/write operation in the Inverse Permutation Logic 55 is given by
mod s.
Case B: This is a specific instance of Case C. For this case, the index aj in the n-dimensional index of the first data in the required data vector will be such that aj″=0. The aj k will be equal to (aj+k) for the s successive data. Hence, the term for address calculation
can be simplified to b+ksj−1, where
Here, s−1 should be treated as 0.
1.4.2 Memory Architecture under Dyadic Permutation (for s=2x)
For numerous signal-processing applications, n-dimensional memory architectures with s as an integer power of 2 are of much importance. The complexity of the hardware to realize all of the architectures described in Subsection 1.4.1 gets reduced significantly if s is a power of 2. The advantage is obvious from the fact that the computation of all terms of type aisi−1 is equivalent to left shifting of ai by (i−1).x bits and the (mod s) operation is equivalent to logical AND operation with (s−1). Further, the dyadic permutation function gives much simpler permutation logic. Another advantage of this permutation function is that the permutation logic turns out to be same as inverse permutation logic. It is easy to see that this permutation function satisfies the Conditions 1 and 3.
Here, ⊕ denotes the bit-wise EXORing.
Case A: For the dyadic permutation function described above, the data at index [an−1, an−2, . . . , a0] in the hyper-matrix is stored at the address
in the bank number given by
More precisely, for accessing all s-data elements of a data vector which is parallel to jth dimension 62 and starts from the index [an−1, an−2, . . . , aj=0, . . . , a1, a0] 61, the s addresses 66 are
Here, s−1 should be treated as 0. The proposed memory architecture is given in FIG. 6.
The operation
is equivalent to concatenating binary values of an−1, an−2, . . . , a1 to form a single x(n−1) bit address. The s successive addresses are generated by stuffing values 0, 1, . . . , (s−1) at bit locations corresponding to a, in x(n−1) bit address. The Inverse Permutation Logic 64 is equivalent to issuing the kth address to memory bank
In FIG. 6, b is equal to
It is easy to see that the Address Generation Logic and the Permutation Logic modules can be combined into single module 63.
Case B: Let (m,n)-hyper-matrix with m=2x+y be divided into (s,n)-hyper-matrices. These (s,n)-hyper-matrix are linearly mapped to the memory space. The architecture to access data within a hyper-matrix, however, remains the same. Hence, if s-parallel data are to be accessed along the direction parallel to jth dimension 72 starting from index [an−1, an−2, . . . , aj, . . . , a1] 71, then upper y bits of indices ai 's will yield the address 74 of the (s,n)-hyper-matrices and lower x bits of ai 's will give the addresses 75 for data within the (s,n)-hyper-matrices. Moreover, lower x bits of aj will be 0 as data is to be accessed from the boundary of the (s,n)-hyper-matrices. Here, ai 's are (x+y) bits wide. In the architecture given in FIG. 7, a′i and a″i denote the upper y and lower x bits of ai, respectively. The yn bits 74, obtained by concatenating the a′i 's, gives the upper bits of address for each bank 77, whereas lower x bits are obtained by using a″i 's in the method described in Case A. Here, b is equal to
Case C: In this case, the index of the first data in the data vector may start from the data element that does not lie on the boundary of (s,n)-hyper-matrix. If the first data to be accessed is l data elements away from the boundary of any (s,n)-hyper-matrix (i.e., l=a″j), then first (s−l) data elements will belong to same (s,n)-hyper-matrix whereas the next l elements will belong to the adjacent (s,n)-hyper-matrix along the jth dimension. More precisely, the upper y bits will be a′j for first (s−l) data and (a′j+1) for the next l data. If l is equal to 0, a′j will be used for computing upper yn bits of addresses 84 and 85 for all banks 88. Moreover, permutation of data also involves circular rotation by l 87. For writing operation, the circular rotation is in anti-clockwise direction, whereas clockwise direction for data reading operation (refer to FIG. 8).
1.5 An Example of a Single 2-Dimensional Data Array with s=4
This example illustrates the above-described scheme for a 2-dimensional (4�4) matrix 91. The correspondence between location in matrix 91 and memory banks 92 for data elements is shown in FIG. 9 for dyadic permutation case. It is apparent from the shown rearrangement that elements of the matrix 91, which lie in the same row (or column) are stored in different banks 92. Accessing this memory bank 92 involves two steps:
1. Computing the address for each bank;
2. Reordering of the 4-element after (before) reading (writing) from the 4 banks.
The following table indicates the bank number in which the ith data element in the ath row (or column) lies. This can be used to reorder the data elements for reading from or writing into the memory banks.
It is apparent that for column-wise access, the 2-bit address for all data elements in the column to be read (or written into) from the memory is same as index i. On the other hand, row-wise access the address is same as row number a of the data element.
2 Alternative Embodiments of the Invention
The following are alternate embodiments of the present invention.
1. Though the scheme has been described for only two rearrangements, all other rearrangements under the scope of discussion in the previous section will lead to other alternative implementations of the same scheme.
2. If any application demands access along only some particular dimensions, then minor variation of the proposed scheme will lead to significant reduction in hardware complexity.
3. For the Cases B and C discussed in Section 0, the number of elements along each dimension need not be same for larger hyper-matrix. That is, the value of m may be different for each dimension. For this alternative implementation, only the address computation for accessing any (s,n)-hyper-matrix will change, the logic to compute addresses for elements data vector within (s,n)-hyper-matrix will remain same.
4. Though the scheme has been described for parallel access, it can be also used for accessing the data in serial. It can be accomplished by issuing all the addresses corresponding to s-data elements sequentially. Given the constraint of sequential access, some minor changes in the architecture will lead to reduction in hardware complexity.
Patent Citations
Referenced by
Legal Events
Original Image


text:
Ultimate Assortment Burger Combo Pack
The perfect answer to please everybody when you can't settle on just one kind of Tender Filet burger. Delicious assortment of 6-oz. Mushroom & Onion Steak Burgers, Sirloin Steak Burgers and Steak & Bacon Burgers. 8 of each. MoreExperience restaurant-quality gourmet meats from The Tender Filet. Buy now & pay later with Choose 'n Charge Credit.

subset: commoncrawl


text:
Find commute times to your work, school, gym and more.
Palm Crest At Station 40
Contact this property
Floor Plans
Prices, specials, features and availability subject to change.
Property Features
- Parking
- Covered Parking
- Convenience
- Business Center
- Extra Storage
- On Site Maintenance
- On Site Management
- Wireless Internet Access
- Leisure
- Fitness Center
- Hot Tub
- Swimming Pool
- Laundry
- Laundry Facility
- Washer & Dryer In Unit
- Other
- 2 Laundry Facilities on Site
- 2 Sparkling Swimming Pools and 2 Spas
- 24-Hour Emergency Maintenance
- Accepts Credit Card Payments
- Accepts Electronic Payments
- BBQ/Picnic Area
- Emergency Maintenance
- Great Location
- Green Community
- New/Renovated Interior
- Online Rental Payments
- Patio
- Professional and Friendly Staff
- Public Transportation
- Resident Business Center
- Short Term Available
- Spanish Speaking Staff
- Trail, Bike, Hike, Jog
Units may feature
- Amenities
- Air Conditioning
- Cable Ready
- Ceiling Fan(s)
- Fireplace
- Garbage Disposal
- Oversized Closets
- Kitchen
- Dishwasher
- Refrigerator
- Outdoor
- Balcony
Property Details
Welcome to Palm Crest At Station 40.
Experience affordable living at a convenient location! Palm Crest's affordable and comfortable lifestyle gives you spacious floor plans with patios and balconies for quiet enjoyment of the beautifully landscaped outdoors. Our friendly atmosphere combined with a professional responsive management team, is just a small part of making your new home the best it can be. Palm Crest's great location provides convenient access to Loop 101, I-10 and Desert Sky Mall! It's only minutes from the fabulous brand new sports arenas of Glendale. Palm Crest at Station 40 proudly offers renovated pet friendly apartments in Phoenix, AZ. Please call for an appointment today.
Leasing Information
Pet Policy
Dogs Allowed. Cats Allowed. Pets Accepted. Call for service animal policy.
Our lease terms are: 6 to 13 Month Terms Available (Please note that lease terms may vary, are subject to change without notice, and are based on availability. Inquire with property staff for complete details)
Pet Policy: Maximum 2 pets per apartment. Restrictions: Pet friendly Apartment homes (restrictions apply). Call for details.
For more information, please
or check availability.
Office Hours
Monday-Friday: 9:00am-6:00pm
Saturday: 10:00am-5:00pm
Sunday: 11:00am-4:00pm
Managed by
Riverstone Residential GroupView all Riverstone Residential Group properties
Check Availability
Call or email the property directly:
Check Availability
Similar Properties
Similar Properties
Neighborhood Info
My Commute
Edit Address
Save your commutes
Scores are compared to the national average. The higher the bar, the higher the crime risk. The lower the bar, the lower the crime risk.
near Phoenix, 85033Transit


text:
Du royalty has Kipp confused
Du has been ordered to start paying a royalty to the UAE government, reducing the profits that can be distributed to the company's shareholders (mostly the UAE government).
February 15, 2011 2:03 by Samuel Potter
The UAE government has ordered UAE-government owned telco Du to pay it 15 percent of its net profit from 2010 as a royalty. The move is sure to disappoint shareholders of the company, a group for the most part comprised of the government.
If you're scratching your head right now, you're not alone. Let Kipp lay it out for you: Du, once known as the Emirates Integrated Telecommunications Company, is owned as follows: 40 percent by the UAE federal government; 20 percent by Mubadala Development Company (itself owned by Abu Dhabi government); 20 percent by Tecom Investments (a subsidiary of Dubai Holding, itself owned by the Government of Dubai); and 20 percent by public shareholders. So 80 percent owned by UAE government, then.
So, Du (80 percent owned by the government) released a statement this week announcing that the Ministry of Finance has ordered it to commence paying a 15 percent royalty to the Federal government on its 2010 earnings. The level of the royalty in future will be announced 'in due course.' In the meantime the royalty must be paid (to the government) before any distribution of profits to shareholders (mostly the government).
Kipp is sure there are perfectly sensible reasons for this financial maneuvering, we just can't for the life of us work out what they are. It feels like we're watching one of those games where a guy shuffles three cups so that you can't follow the ball. Then again, we have been known not to understand stuff before, like the guy in the office who can detach the top half of his thumb and slide it up his hand.
Anyway the royalty was apparently expected, but the 15 percent was a welcome surprise – analysts expected much higher. Why was it expected to be higher? Well because of what Etisalat has to pay, of course.
Ready? Okay, here we go: Etisalat, 60 percent owned by the UAE government, has to pay 50 percent of its profits in royalty charges. Apparently the government owned company has asked the government if it can get a reduction in the money it has to pay to the government; the government is considering it and many analysts are predicting that the royalty will drop. This, presumably, will allow Etisalat to pass on more of its profits to its shareholders, more than half of whom are the UAE government.
It's confusing enough to have Kipp curled in a tight ball in the corner, rocking back and forth. It reminds us of the time we found ourselves on a boat with a senior telco exec in the UAE (long story). We were asking him if there would be network sharing (and hence some real competition in the market), and he said to us: "What does it matter? The money is all going the same way." Presumably to the man holding the cups.
More on Analysis
Top 5 things to do in the UAE this weekend
Top 5 festive events not-to-be-missed in Dubai
Prime office rents shooting up in Dubai
Top 10 YouTube videos in UAE during 2014
Sony hack: Are Middle East companies safe?
Top 10 global topics of 2014
UAE residents' current savings 'inadequate'
Top 10 most checked-in places in the UAE during 2014
Top five things to do in the UAE this weekend
DIFF opens with The Theory of Everything
Rents slump in Abu Dhabi
Technology rapidly taking over our life
Dubai gets ready for DIFF's red carpet galas
Falling oil prices not to impede infrastructure growth in Dubai
Retailers splurge on digital tactics
The most valuable items ever left in a taxi
Top 5 things to do in the UAE this weekend
Dubai Municipality fights development of luxury property
$3.1 million pair of boots in Dubai
Top brands offer big deals
Lately on Kipp
Etisalat users redirected to Chinese site
Top 5 things to do in the UAE this weekend
Cold vs Hot: The festive season
Video: Renault races round The Dubai Mall
UAE announces New Year holiday
In pictures: Most searched local brands in the UAE this year


text:
Lori Paisley Bath Mats
Final-sale items, identified by a price ending in $.99, cannot be returned. Once placed, your order for this item cannot be cancelled. Quantities are limited. The same price is also available when you shop our catalog.
No longer available
Jacquard woven from organic Turkish cotton, our bath rug pampers bare feet. The color palette reverses on the back, giving you two ways to decorate the bath.
21" wide x 34" long
Made of pure organic cotton.
Yarn dyed for vibrant, lasting color.
Machine wash.


text:
The Hotel features free deluxe continental breakfast daily, 24 hour front desk assistance, an indoor heated swimming pool, Jacuzzi and sauna, a fitness room with state-of-the-art cardio machines, a private meeting room (seats up to 30), wireless internet access, board games, an extensive DVD rental library, free weekend shuttle to Chinook Winds casino, complimentary on-site parking, in-room massage service, Wine social hours, home baked cookies at the front desk, concierge service and a 100% smoke free environment .
Guest rooms feature Sealy Posturpedic Plush Supreme Beds, 300-thread count luxury linens, bamboo blended towels, apa robes, eco-friendly bath amenities by Archive, hairdryers, 32-inch LCD flat screen HDTV with premium cable channels, HD DVD Player, iHome iPod docking station alarm clock, a French Press coffee maker and fresh ground gourmet coffee from Sisters Coffee Company .
|Check-in Policy
|Check-out Policy
|# Of Rooms
|# Of Floors
|Link Code


text:
At the beginning of December, 5 Pointz was basically gone, but the streets of New York City are stilled filled with art. Graffiti complaints are up throughout the city and for those of us who love hunting for street art, there has been no better time be a part of the art scene here. Over the summer, we listed the Top 10 Street Art Murals of The Year (So Far) and with the year coming to an end, we selected our 10 favorite pieces that made the streets of NYC that much more interesting.
Today's most popular reads:
Earlier this fall, New York City was (rightfully) up in arms about the shops putting up the "No Hoodies" signs, but we will venture to say that they were just the tip of the iceberg when it comes to DIY signage in this city telling residents what they can't do. We've been slowly photographing this trend as we come across it. If you have more, send them our way via Twitter or Instagram #untappedcities. You'd think the above photograph comes from perhaps a neighborhood filled with crime, but actually it's just next to Lincoln Center. Wok City Chinese takeout on Amsterdam Avenue is filled with even better gems like "We do not cut wings," "Sorry no barbecue sauce," and "Seats for Employees Only."
One of New York City's most unique pieces of property was Hess Triangle, only 500 square inches and the smallest plot of land at the time. Now marked by mosaic tiles on a piece of pavement on Christopher Street and 7th Avenue, it represents one man's final stand against eminent domain: "Property of the Hess Estate Which Has Never Been Dedicated for Public Purposes." While Hess Triangle was combined into the Village Cigars property, there are many awkwardly shaped lots on record today with the NYC Department of City Planning and Department of Finance. One final project at Columbia University GSAPP, led by Kohn Peterson Fox architect Lucien Wilson in the Parametric Site Analysis class, looked into these "untapped" plots of land as development opportunity.
It's been a fun year for "untapped" quirky news, and our readers proved to us the range of their urban interests, from abandoned locales, hidden restaurants, judgmental maps, urban planning projects to street art. Here are the top 10 articles on Untapped Cities in 2014!
Rendering of the Kingsbridge National Ice Center
If we were the betting kind, we'd wager that soon people will be saying that the Bronx is the new Brooklyn. Or the new whatever is the latest neighborhood. Untapped Cities readers proved they're ahead of the curve with the popularity of this policy article about 5 big urban planning projects in the Bronx.


text:
Republic Services, Inc. (NYSE:RSG)
Provider of non-hazardous solid waste collection and disposal services in the United States.
This stock has basically under-performed the benchmark S&P in the last 3 years as a result of flat revenue growth. One of the reasons is that RSG is really dependent on household growth since it deals with domestic non-hazardous waste.As the number of households declined due to unemployment and lack of opportunities for new graduates, so have RSG's revenues. Look for the stock to rebound as housing recovers in the next 5-10 years but I am red-thumbing in the near to medium term.


text:
It's harvest season on America's farms, the time of year when farmers reap the rewards of their tireless work during the spring and summer. The food from this harvest will end up on tables across the country, but just as important as full bellies are the economic rewards from U.S.
Data scientists are working to help improve energy efficiency and make new forms of energy more economically viable, and are building new, profitable businesses in the process.
The Foundation's Corporate Citizenship Center and its Data-Driven Innovation project are exploring responses to the outbreak of the deadly virus.
- Entrepreneur reports that 9.1 million US businesses are owned by women. Female owned companies in totally employ 7.8 million people and generating $1.4 trillion in revenues.
One in three Americans relies on Blue Cross and Blue Shield companies for access to safe, quality, and affordable healthcare, but our responsibility does not end there.
Wayne State University hosted the third annual Techonomy Detroit conference, a gathering that uses Detroit as a model for urban revival through technological innovation.
Recently, I spoke with Jim Corcoran, President & CEO, Fairfax County Chamber of Commerce on the future of corporate citizenship and small businesses.


text:
" />
Edible Pictures & Edible Images
No preservatives, nuts, dairy, eggs or gluten. Kosher certified edible image sheets®.
Easy to apply to fondant, frosting, chocolate, icing, marshmallows, Jell-O, candy, any confection!
Free Text! Free Standard SHIPPING on orders of $34.00. (248) 247-5476.
We can make a picture for you, most free of charge.
Custom Images Cupcake Toppers Cake Wraps Filmstrips Scout Badges Luggage Stickers Baby Holiday Order Below.
Select Icing Sheets for Frosting, Chocolate, Fondant, Any Confection! Great for pictures, photos & text.
Select Edible Paper for Fondant, Gumpaste & Cookie Icing. Great for pictures, logos, cartoons & text.
If you do not see your Label above, just type in the Name of Label you want before adding to cart.
Click Continue Shopping in your cart to return here.
Fanned Money Bills Normal Size 3 per sheet
In Your Cart click Continue Shopping to return.
EDIBLE NEWSPAPER Customized Free.
Send us your Photo, Text, & Date.
To Send us your photo, click Link at Top or click Return to Site after Checkout.
To Send us your photo, click Link at Top or click Return to Site after Checkout.
Matching Cake Wraps click here.
8 per sheet PLAYING CARDS, Backs or Jokers
Actual Size or Request smaller size.
To Send us your photo, click Link at Top or click Return to Site after Checkout.
Custom Sizes Call (248) 247-5476.
Review Your Information at Payment to select Standard or Rush Delivery.
We ship in 1-2 days.
For Custom Sized Sheets, go to
Custom Edible Images
edible pictures, edible images, cupcake toppers, icing image, edible money, edible filmstrips, photo cookies, edible photos, picture cake, holiday, 48091.
cake stickers, cookie decals, cake wraps, cake strips, wedding favors, edible prints, edible image design, logos, edible logo, gumpaste, marzipan, fondant, chocolate, frosting sheets, oreos, cake-pop, cake pops, grad, graduation, baptism, communion, baby shower, birthday, anniversary, wedding, congratulations, seasonal, holiday, party favors, cake decorations, cookie favor, dollar bill, money bills, photo money, coins, money stack, edible paper, film strip, scout merit badges, eagle scout badge, boyscout, travel stamps, luggage stickers, passport, liquor labels, beer, wine, whiskey, whisky, drink label, newspaper, cartoon character, cartoons, magic show, casino, poker chips, playing cards, animal prints, leopard design, animals, star wars, transformers, butterflies, hello kitty, pirates, flags, edible cake topper, custom sizes.
Edible Image, Print-Ons, Dec-Ons are registered trademarks of The Lucks Company.
Custom Images Cake Wraps About Us Shipping Cupcake Toppers Holidays FAQ Ingredients Edible Filmstrips Baby Shower Contact Us


text:
I think the lack of negativity is due to the press not putting the usual negative spin on this (I'm talking all outlets) that they do for the Xbox One. I've seen some really awful headlines from the press demonising the Xbox One and they are all doing it because it's fashionable. It's sickening. Not saying GB does this though. One of the very few sites who don't bow down to this kind of behaviour which is why I regard this site so much. Kudos to them all.
My take on this. I think it will be chaos on launch day as I will guess Sony's servers won't be up to it. They just aren't as advanced in this field as Microsoft. If anyone is a real fan of multiplayer gaming I'd recommend they think long and hard about their console choice, it's looking very much like dedicated servers all round on the Xbox One with an easy, and well supported implementation.
Never had any real issues with MP on the PS3, PS4 will have dedicated servers for BF4, Ghosts, and Killzone day one. I thought long and hard about the online component of the consoles and decided to go with the one that didn't put everything, including their web browser, behind a pay wall.
On the other side of the coin, we're already seeing reports of XB1 versions suffering from lower native resolutions that PS4 versions of the same games (1080p vs. 720p with Ghosts for instance). Even Jeff has said on the podcast that it looks like the PS4 will probably be the place to go for multiplats. If the One is showing signs of weakness out of the gate, I would be more worried about how it's going to perform 2-3 years out when developers are really starting to push the systems.
To each his own though.


text:
Well, it has certainly been a long time since I have written a blog, about 8 months. Today I have reached my 60th year in this life. I am ready to get serious about losing weight once again. Of course the Birthday cake and Ice Cream did not help in that area but hey, I feel good about celebrating my life.......celebrating LIFE!! God gave this life to me and evidently still has plans for me here, so I am thankful. I am blessed so much and so thankful I serve a God who loves me despite my many shortcomings and failures. I am thankful for His mercy and grace. I am thankful for my family He has blessed me with and also for my friends, especially for those I have gained here on Spark who hold a special place in my heart.
I praise God for leading me to SparkPeople for they have been so helpful in my weight loss success despite my back slide now. There are so many tools here on the site that are still free to use and I plan to do just that and turn this weight gain around once again. I refuse to give up. With God's help, I CAN do this and I plan on success once again. I stayed around my goal weight for three years from 2008-2011..... ....
Thank you Spark friends for all the encouragement. I have missed you all and I plan on interacting with you again in the near future. You have blessed me much. I hope I will be able to bless you also. Till next time, God bless you, Shirley
Tonight when I got home from work my muscles hurt too much to allow sleeping. So, instead I decided to put in a little computer time since I usually don't have the time. It just so happens that I have the next two days off and I potentially have the option of 'sleeping in' come morning....I hope. Well, I surfed Facebook a little and then read through some emails and finally ended up here on SP. I've been adjusting my weight ticker sporadically trying to force myself to feel bad enough about the weight I have put on to get serious about doing what it takes to take it off. Wow! That's about all I can say.
My weight has escalated to a whopping 35 pound gain since this time last year. My, my how fassssst it flies on compared to how sloooow it creeps off or at least that's the way it is for this old body.
I keep asking myself and the Lord, WHY? Why do I keep cramming stuff I don't really need in my mouth? I feel really really bad when I'm done eating it.... I know I've failed God and myself. I think about how long it took to lose it this time which was about six years total and I still praise God that I with His help lost 100 pounds and kept it off for three whole years. What happened? I said I'd NEVER be that big again.... One has to really be careful with what one says, I zooming that way quickly.
Well, this one thing I know, God never changes, so I know it is ME. "Jesus Christ, the same yesterday, today, and forever." that's what the good Book says. I keep praying that the Lord will take this thing, this attachment I have to food or whatever it is away. I've found myself in this place where I have to really take a long honest assessment of me. I also know there has to be a reason I am here just stuck. I don't have the answer yet but I know God is faithful and merciful and patient and kind and loving even though I feel unworthy of all those things. I suppose more than anything I just needed to say these things or "vent" so to speak.
I do feel at this moment a peace that it will be okay. My God is bigger than whatever is wrong in my life. Even if I don't understand, He does and He will never leave me or forsake me. No matter what happens, no matter what the circumstances God is good and my refuge in time of trouble.
"May the words of my mouth and the meditation of my heart be pleasing to you, O Lord, my rock and my redeemer." Psalms 19:14 This is my prayer.
In fact I haven't spent very much time on SparkPeople this year at all and my weight shows that. The five pounds that I had gained by 16 December in 2011 has increased now to 21 lbs. How quickly they pile up when left to chance. The fact is that I haven't completely stopped trying to lose it but obviously I'm not dedicated to losing it the way I need to be.
In my defense however, I have made a major life change. Beginning on 31 January 2012, I obtained a new job after not working in nearly 20 years. In addition, I had been battling migraine headaches for many months before I returned to work. Thank God, the headaches are better controlled and now I am more adjusted to working after nearly six months into the job. I have to praise God for that too because without Him I couldn't have pulled it off! Without Him I can do nothing!!
Today I was thinking as I often do about "why do I keep on eating like this when I know what it does to me?". Sometimes I eat things I don't even like the taste of........why? I eat way too much of the things that do taste good like I'm never going to get anymore......ever. I do not like the way that feels. I do not like that food has that effect on my emotions. I really believe it is time to listen to my heart and the Holy Spirit as He teaches me what I really need......spiritual food. I don't mean to quit eating, but to eat to live healthy. I feel the Holy Spirit leading me to the next chapter of my life and that doesn't include letting food ruin my health again.
I took my troubles to the Lord; I cried out to him, and he answered my prayer.
~ Psalm 120:1, NLT
"I reached my goal in 2008 and then set a lower goal that I reached in August the same year. I have maintained for almost three years now. That is something that I have never done before." That is a direct quote from my blog on 21 April, 2011. I have been pondering for the past few months about my recent weight gain. I know the enemy would have me be so down on myself for many "splurges" that have resulted in this weight gain. I am now officially five pounds over my 120 goal weight and I am NOT happy about it, nor am I ready by any means to just give up and let food take over my life again. The Bible encourages me in Romans 8:37 "Yet in all these things we are more than conquerors through Him who loved us." (NKJV)
I cannot do this alone, I readily admit. I never could. But "I can do all things through Christ who strengthens me." Phillipians 4:13 This is no small statement, this is a fact. I have lost 100 lbs of weight that caused me to be unhealthy and to feel badly about myself. I have kept it off for three years. So, tonight I looked at my weight chart for the whole year. The scale went up along the middle of September, 2011. I haven't lost the excess to date. So, my question to myself is 'what now'?
I have to be realistic about the time of year and I know I am not going to restrict ALL the treats of this season. For me, those treats are part of the celebration of Christmas. So, I WILL with God's help refuse to allow the sweets (which are where I tend to lose control) defeat me. I will enjoy SOME treats giving thanks to the Lord and enjoy my ALL my family God has given me and celebrate my dear Saviour's birth. After the Christmas season, I will do what it takes to lose those excess pounds with God's help. I must keep my eyes upon Him and my faith in Him and not in my own strength. I believe His Word is true. I will use the resources He has given me through this site and the wonderful people on Sparkpeople.com who encourage me, educate me, and are my friends whom are traveling with me on this journey. I truly hope and pray that I may be a blessing and a help to others whom are traveling this same road.
Thank you for listening to my heart and for taking the time to read my blog. May God richly bless you and help you as well.
Eighteen years ago today, July 2, 2011, my life changed forever. I had to say good bye to my baby girl whom God had given us for just shy of fifteen years. She was full of laughter as soon as she walked into the front door. She brought our family so much joy especially me. She once came home from school and wanted me to go purchase a little boy in her class some clothes because kids were making fun of him. Then, there was the time she cooked a meal and took it down the street to some neighbors because they didn't have a way to cook their food. She was beautiful inside and out. We all miss her so much but God gives us grace to make it through the pain of separation.
A few days before she died, oddly enough, I asked her if she died at that moment would she go to heaven? She hesitated for a little bit, then she answered, "yes". She wasn't perfect, no one is, but she was a good person who loved people and cared about people and I believe she knew Jesus died for her sins.
Lisa Darlene Grisham July 30, 1978-July 2, 1993
We love you and miss you.
Dad, Mom & Jennifer


text:
Wednesday, March 19, 201403/19/2014
Quinn Curtis
Quinn Curtis, Associate Professor of Law at the University of Virginia. He talks with Les Sinclair about benefits and what to look out for when investing in a 401(k).
Wednesday, March 19, 201403/19/2014
Tamara Rollison
Tamara Rollison of VDOT shares information on a recently announced advisory panel.
Wednesday, March 19, 201403/19/2014
Kevin McFaden
Kevin McFaden of Virginia Foundation of the Humanities joins Les Sinclair to discuss the kickoff of this year's Festival of the Book and what we can expect from the festivities.
Wednesday, March 19, 201403/19/2014
Jill Schlessinger
CBS Business Analyst Jill Schlessinger talks with Les Sinclair about the possible timeframe on interest rate increases.
Wednesday, March 19, 201403/19/2014
Hour 2: Erik Kolbell, Courteney Stuart
Reverend Erik Kolbell talks about his book, When Your Life is on Fire, What Would You Save, and Courteney Stuart gives a C-ville news roundup.
Wednesday, March 19, 201403/19/2014
Hour 1: Bob Fenwick, Scott Bandy, Norm Novitsky
Charlottesville City Councilor Bob Fenwick discusses the budget proposal, Scott Bandy performs "A Touch of Graft" and Norm Novitsky talks about his film, In Search of Liberty.
Tuesday, March 18, 201403/18/2014
Jon Marcus
Jon Marcus joins Les Sinclair to talk about his article, College, Federal Financial Aid Increasingly Benefits the Rich.
Tuesday, March 18, 201403/18/2014
Larry Miller
Attorney Larry Miller joins Les Sinclair to talk about lottery winnings.
Tuesday, March 18, 201403/18/2014
Lou Hatter
Lou Hatter, spokesperson for VDOT, joins Les Sinclair to talk about the snow removal budget.
Tuesday, March 18, 201403/18/2014
Hour 2: Rich Miniter, Laura Hollis
Rich Miniter talks about his book, Eyes On Target: Inside Stories from the Brotherhood of the US Navy SEALS, and Laura…


text:
Carl Edwards wins All-Star pole at Charlotte
May 17, 2013, 8:30 PM EST
With the name of the late short track legend Dick Trickle above the door of his No. 99 Roush Fenway Racing Ford, Carl Edwards claimed the pole for tomorrow night's NASCAR Sprint All-Star Race at Charlotte Motor Speedway.
Edwards, who won the 2011 All-Star Race, topped the time sheets with a speed of 145.556 miles per hour and will be joined on the front row by Kurt Busch (144.068 mph) after Dale Earnhardt Jr. was knocked from P2 because of a five-second penalty for a loose lug nut.
The All-Star Race sees drivers qualify by running three laps and taking a mandatory four-tire pit stop; the driver with the lowest total time earns the pole. Adding to the uniqueness of the format is that this year, NASCAR removed all speed limits on pit road during the qualifying (they'll be back for the race). Per USA Today's Jeff Gluck, Edwards entered pit road off Turn 4 at 154 mph.
Greg Biffle and Kyle Busch will make up Row 2 of the All-Star Race, with Joey Logano (who had the fastest speed entering pit road at 158 mph) and Clint Bowyer in Row 3. Denny Hamlin, Mark Martin, Kasey Kahne, and Jeff Gordon rounded out the Top 10.
Martin Truex Jr. won the pole for the Sprint Showdown preliminary event, which will see the top two finishers and the winner of a fan vote advance into the All-Star Race. Among the competitors in the Showdown will be Jamie McMurray, who will start on the front row alongside Truex, and Danica Patrick, who will start seventh.
Tomorrow's All-Star Race will be split into five segments (four 20-lap segments and a fifth and final 10-lap segment). This year, the running order at the end of Segment 4 will be repositioned based on the average finish for the first four segments directly behind the caution car before pit road opens for a mandatory four-tire stop; how the cars come out of the pits will determine the starting order of the final segment.
The race winner will win a $1 million prize from Sprint. A second $1 million bonus — dubbed "Bruton's Big Bonus" after Charlotte Motor Speedway and Speedway Motorsports Inc. CEO Bruton Smith — is also in play if a driver can win all five segments of the event.
Video from NASCAR America
Top Posts
- John Force like you've never seen him: 'Papa John' the grandfather (video) 0
- Michael Schumacher's son, Mick Jr., has 'secret' F4 test 3
- Report: The Sprint Experience will not return in 2015 4
- Vergne joins Ferrari as a test driver 1
- IndyCar champ Will Power's hidden talent — breakdancing 0
- NASCAR: Bubba Wallace confirmed for Roush Fenway XFINITY program 2
- Top NASCAR stories of 2014: No. 13 – Chase Elliott wins final Nationwide Series championship at record age 0
- B. Vickers (1953)
- K. Busch (1945)
- C. Coughlin (1852)
- D. Armstrong (1604)
- L. Cassill (1434)
- A. Self (1412)
- R. Black Jr. (1345)
- B. Kennedy (1200)
- D. Suarez (1155)
- M. Tifft (1101)


text:
Skip to Main Content
Service-oriented thinking, which is becoming popular in both the business and the information technology (IT) communities, is based on the concept of service as a well-defined, self-contained function that does not depend on the context or state of other services. In the IT community service-oriented architectures (SOAs) have emerged as the main approach for dealing with the challenge of interoperability of systems in heterogeneous environments. SOAs also hold the promise of additional benefits, such as reuse of components, improved reliability, and reduced development and deployment costs. In the business world, the service-oriented approach helps automate the managing of business processes by enabling the "orchestration" of services in order to achieve the needed functionality.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.


text:
Interview: Scott Mills on Radio 1, his Uganda documentary and covering Eurovision
Post your comment
Comments on this article are now closed.
Reader comments
Better be careful in Azerbaijan they are just as bad as Uganda for gay rights.
Azerbaijan is pretty backward when it comes to LGBT rights in terms of discromination; harassment etc; however being gay is not a crime in Azerbaijan, as it is in Uganda, where the law says that gay people deserve 10 years in jail (however Uganda is trying to introduce the death penalty).
I am disappointed that this interview does not ask him his thoughts on holding the Eurovision in bigotted nations like Russia and Azerbaijan.
2 years ago Graham Norton made an embarrasing fool of himself by not even mentioning the fact that an entire Gay Pride groups had been harassed and arrested by police when they dared to have a Pride to coincide with Eurovision.
Does Scott Mills think that the Eurovision should send out an explcitily pro-gay message and officially endorse Pride events in these backward nations which win the contest?
Seeing as the Eurovision is the 'gay World Cup' to use Mills' own description surely LGBT rights in the host countries should have been asked about?
Scott Mills goes to Uganda and is shocked by homophobia. Next week Ainsley Harriot visits a White Supremicist camp.
i am a huge fan of scott mills and i think that the way he has approached his sexuality throughout his career has been commendable. he does not hide his sexuality but it doesn't (and it shouldn't) define him. It's by behaving like this that he shows young gay people that the gay community is just as diverse as the straight community, that they don't need to be stereotypical or become so to fit in. He is clearly not in his element talking about political issues (and so he should be admired for trying to raise awareness, although i would have liked a less reactionary and better reasoned documentary) but I think he does plenty for the gay community just by being himself.
Yes he needs to be careful of people who make trouble for gay people. One America president was known to say "walk softly but carry a big stick", he is a brave gay man for exposing hate and hostilities toward LGBT people, we need many more like him.
For example I tried to get a date on Adam 4 Adam and a terrorist Christian showed up at my house trying to convert me into being straight. I don't know if anybody has had this happen to them but Scott should investigate and expose Christians who pretend to be gay so they can infiltrate gay sites and hang outs so they can make trouble for LGBT people.
These comments are un-moderated and do not necessarily represent the views of PinkNews. If you believe that a comment is inappropriate or libellous, please contact us.
More like this
- Melanie Phillips voted Stonewall's 'Bigot of the Year' 94
- BBC World Debate programme asks 'Is homosexuality un-African?' 70
- Video: Scott Mills experiences 'bizarre' Ugandan gay cure ritual 22
- Scott Mills: 'Gay hatred is everywhere in Uganda' 68
- TV preview: Scott Mills explores homophobia in Uganda 56
Most commented this week
- US extends non-discrimination laws to transgender people 82
- Anti-gay activist complains bakeries won't make 'gay marriage is wrong' cake 77
- Study: Gay men earn less than straight men, but lesbians are paid more 77
- Ex-UKIP candidate: There is a witch hunt against working class people who say 'poofter' and 'chinky' 67
- US radio host: Gays will die out because 'they don't reproduce' 66
- Café manager shot dead in Sydney siege hailed as hero 58
- 10 reasons to be worried the DUP might hold the balance of power in Westminster 53
- A 9-year-old girl gave this heartfelt letter to her teacher after he came out as gay 53
- Catholic League attacks 'homosexual' Tom Ford over penis pendants 50
- This is what happened when a guy with cerebral palsy took a trip to a gay bar 48


text:
|NSFW Content
|User Rankings
|Original Content
|Funny Pictures
|Funny Videos
|Funny GIFs
|YouTube Videos
|RSS Feeds
Top Rated Controversial Best Lowest Rated Newest Per page:Order:
What do you think? Give us your opinion. Anonymous comments allowed.
#116 - darthacerbus (02/10/2012) [-]
I never understood why it's called "evolution" when they're really just getting older.
#122 to #118 - ThePsychoKitty (02/10/2012) [-]
Yes but evolution is change over time in generations via natural selection, genetic mutation, and genetic drift and not in a single individual. Darthacerbus is right, it's not really evolution. It's something else entirely.
-1#159 to #136 - icantusecaps **User deleted account** has deleted their comment [-]
#139 to #136 - ThePsychoKitty (02/10/2012) [-]
Still not evolution because it's still missing all the factors as I've mentioned. There's no natural selection, no genetic drift and no genetic mutation which only happen when parents pass on imperfect genes to their children. Even if you were to include genetic mutation it still wouldn't be evolution because it's missing the other two factors. Not to mention, that again, evolution happens over time (short or not) in generations, not a single individual. Which is what Pokemon "evolution" is, it's change in a single individual.
#161 to #143 - ThePsychoKitty (02/10/2012) [-]
Possible but still unlikely. There are some species that reproduce asexually, known as parthenogenesis, generally lizards and snails. However there is a problem asexual species still produce offspring, as in they don't change themselves, and those offspring are basically clones of their parent. And an even bigger problem is that those offspring are still susceptible to the same diseases and issues as their parents, because they lack genetic variation. Meaning that all Pokemon, in all their variations, could be easily wiped out because they don't have the variations to handle new diseases. Besides with the male/female spec added to the games we know that Pokemon are not asexual and reproduce as normal animals would.
#115 - sebbiechan (02/10/2012) [-]
#112 - ragingbrony ONLINE (02/10/2012) [-]
#111 - jakerszzzz (02/10/2012) [-]
#104 - tankerdude (02/10/2012) [-]
#107 to #104 - anonymous (02/10/2012) [-]
**anonymous rolled a random image posted in comment #35 at If you know what i mean ** you sir are a genius
#102 - anonymous (02/10/2012) [-]
Protestant version is the master race.
#101 - sosyourmom (02/10/2012) [-]
#99 - gwankwo (02/10/2012) [-]
#97 - anonymous (02/10/2012) [-]
I don't mean to sound politically correct (OK, I do), but some of that is only attributed to Catholicism. Catholics make their own rules pretty much.
#90 - thisgezz (02/10/2012) [-]
**thisgezz rolled a random image posted in comment #79 at Going for a Run **
#83 - darklit (02/10/2012) [-]
#82 - mmoranoderp (02/10/2012) [-]
0#78 - francineforpres **User deleted account** has deleted their comment [-]
#76 - KiraLives (02/10/2012) [-]
#71 - expensiveprice (02/10/2012) [-]
For the snake on you forgot Dratini and Dragonair. Aren't those also snakes?
#105 to #94 - expensiveprice (02/10/2012) [-]
Idk why my comment got two toenail clippings down, honestly I haven't played nor had a chance to for about four or so years now, and I thought they were snake pokemon, and no I don't mean snake type, I used to be an expert and used to be able to name evry pokemon up to platinum. I meant snkae type pokemon as well as Pikachu being the mose type or mangneton being a magnet-type pokemon, honestly sorry people for what I did to deserve toenail clippings-down and look like an idiot.
Back to the content 'Christian Pokemon' Leave a comment


text:
Fighting for Independence
Mugeez and Paedae da Pralem independently form the record label R2Bees Entertainment to put out their own product. They immediately signed some of the top hiplife artists like Under, Humble Dis and Criss Waddle.
(Photo: Courtesy R2BEES Entertainment)
OutKast Throws a True Players Ball07/11/2014
What A Day: BET Experience Highlights, Part 306/30/2014
BET Experience After Dark: Party Highlights Day 306/30/2014
What We Learned From the Genius Talks06/30/2014
Mary J Blige, Trey Songz and Others Take Over the Staples06/30/2014
Swag Bags for the Stars: Celebrity Gift Suite06/30/2014
BET Awards 2014 | All Access Pass06/29/2014
The Most Unforgettable Show Moments06/29/2014
In Memoriam: Casey Kasem06/29/2014
Jay Z's and Beyoncé's Flyest Performances06/29/2014
In Memoriam: JayAre (Cali Swagg District)06/29/2014
In Memoriam: DJ E-Z Rock06/29/2014
In Memoriam: Dr. Maya Angelou06/29/2014
In Memoriam: Ruby Dee06/29/2014
BET Awards 2014 Pre-Show06/29/2014
Acoustically Speaking With Host Big Tigger06/29/2014
Celebrities Hit the Radio Broadcast Center06/29/2014
Supa Dupa Fly: Missy Elliott06/29/2014
In Memoriam: Bobby Womack06/29/2014
Acoustically Speaking With Host Big Tigger06/29/2014
Inside the Celebrity Basketball Game06/28/2014
What A Day: BET Experience Highlights, Part 206/28/2014
Stars Gather for Debra Lee's Pre-BET Awards Dinner06/28/2014
Red Carpet Style Stage Looks06/28/2014
I Styled Who: Tiara Thomas06/28/2014
Inside Fashion @ BET Experience06/28/2014
Inside the #ShineStrong Studio06/28/2014
106 & Park: Exclusive Access Day 106/28/2014
Maxwell, Jill Scott and Others Take the Stage06/28/2014
What a Day: BET Experience Highlights, Part 106/27/2014
Travis Barker: Road to the BET Awards 201406/25/2014
Chris Brown: Road to the BET Awards 201406/25/2014
Tyga Road to the BET Awards06/25/2014
Iggy Azalea: Road to the BET Awards06/23/2014
T.I. Road to the BET Awards06/19/2014
John Legend: Road to the BET Awards06/18/2014


text:
The Bursa Malaysia Stock Forum! Sharing money making strategies among members for worldwide financial market!
bursa, malaysia, stock, forum, call, warrant, commodity, forex, dowjones, investment, trading, klci, equities, berhad, #main, board, mesdaq, daytrade, chart, business, derivative, currency
Naruto RPG
naruto, shinobi, story, forum, ninja, jutsu, chakra, konoha, suna, kiri, kumo, leaf, wind, #water, earth, cloud, bijuu, tailed, beasts, villages, role, play, fire, lightning, sand, sharingan, chidori, rinnengan, raseng
Free forum : In the beginning of things, in ages past there was the Elexorien, master of flesh, fire, steel, water, earth, air, acid and lightning who forged the elements of which the land of Lokonia
free, forum, lokonia, forbidden, realms, beginning, things, ages, past, there, elexorien, master, flesh, fire, steel, #water, earth, forged, elem
An elemental RP called Amelia.
elemental, amelia, element, fire, #water, metal, earth, plant, electricity, darkness, role, play, roleplay, daemon, animal
The GS: RP forum is meant for OOC purposes. From the main server rules to the showrooms of our members. Explore it all!
free, forum, golden, state, roleplay, samp, meant, purposes, from, #main, server, rules, showrooms, members, explore, all!
A forum for artists who paint with Water Soluble Oils
#water, soluble, oils, miscible, forum, color, theory, artists, mixing, paint, going, digital, mixable, painting, solvent-free, acrylics, watercolors, plein, artist, demonstrations
For vw originals & modifieds vw, . VW SPECIALS. vw volkwagen modifieds forums golf caddy beetles, air cooled water cooled
volkwagen, modifieds, classics, golf, caddy, beetles, cooled, #water
Welcome to the -ATOMIC ENERGY- Community site for Navy Field .
free, forum, aef-nf, welcome, navyfield, navy, field, world, fleets, fleet, atomic, energy, wars, #water, ocean, japan, warships, warplanes
Porsche 924 944 968 928 and other classic car forum
porsche, classic, forum, owners, front, engined, club, tipec, pcgb
Free forum : open forum for all of those interested in racing R/C in Northern Maine RCCC
free, forum, northern, #main, open, rccc, those, interested, racing


text:
Quikshift Crankcase Breather Filters - Quikshift Racing Crankcase Breather Filters - larkspeed.com
car performance and styling
like us on facebook
my account
All prices include VAT
show prices in:
my basket
Basket Empty
site search
We use cookies to ensure that we give you the best experience on our website. These cookies are completely safe and secure and will never contain any sensitive information. If you continue without changing your settings, we'll assume that you are happy to receive all cookies on our website. You may change your browser settings to prevent cookies being stored, however this will prevent you logging on or shopping on this website.
Dismiss this message
browse by type
Air Filters, Oil Filters & Induction Kits
Alloy Wheels
Brakes & Clutches
Car Mats, Car Care & Security
Coolant, Oil & Brake Fluid
Engine Components
Exhaust Systems & Heat Wrap
Fuel Delivery
Ignition, Electrical & Horns
Lights & Bulbs
Performance & Tuning incl Hoses & Valves
Roof Bars & Leisure Products
Seats, Harnesses & Motorsport Accessories
Suspension & Polybushes
Wheel Spacers & Other Wheel Accessories
Web Site Updates
We are implementing a number of changes to our website over the coming weeks. We are keeping the look that you love, but making the site easier to use.
The first thing you notice will be the new wider layout, making things easier to read, and allowing us to give you even more information.
Like us on Facebook (link above), and let us know what you think!
Quikshift > Quikshift Crankcase Breather Filters
Quikshift Racing Crankcase Breather Filters
Privacy & Complaints
About Larkspeed
Ordering Info
Contact Info
Returns & Warranty Claims
We accept Paypal, Google Wallet, and most major credit cards directly.
For alternative payment methods -
see order information
Copyright © 2005 Larkspeed Limited. All rights reserved. Security and Privacy Notice. All prices appearing on this site are in UK Pounds. Larkspeed Limited reserve the right to make alterations to specifications and prices without further notice. E&OE
Have you considered:
Cosworth Air Filters
D2 Big Brake Kits
Piper Exhausts
Gaz Suspension
Peco Exhausts
Prewoodec Tailored Dashboard Styling Kits
Polybush Suspension Bushes
Yokohama Tyres
Motorsport & Rally Accessories
Wheel Nuts
Hi Spec Big Brake Kits
OZ Alloys
Pipercross Air Filters
AEZ Alloys
Cosworth Brake Pads & Big Brake Kits
Tarox Brake Discs, Pads & Fluid
Mountney Tailored Car Mats
Ultra Power Bulbs & Xenon Conversions
Revotec Fans & Gauges
Ultra Tailored Fit Lights
Ring Bulbs & Neon Products
Fondmetal Alloys
Dimma Fuel Cap Trims
Radius Alloys
Janspeed Exhausts
Black Diamond Brake Fluid
Wheel Bolts
BMC Air Filters
Wheel Spacers
Sparco Car Mats
Cibie Lighting
Kent Cams
Evans Waterless Engine Coolants
Savage Back Boxes
Supersprint Exhausts
AP Suspension
H&R Suspension
TIM Instrument Gauges
BC Racing Coilovers
Apex Suspension
Denso Iridium Spark Plugs
Seat Covers & Protectors
E-TECH: Interior & Exterior Styling products......
Remus Exhausts
Morette Twin Headlamp & Rear Lamp Conversions
Samco Silicone Hoses
Ronal Alloys
Motul Oils


text:
United States & Canada Customers: Call 1-800-813-6897
Available 24 hours a day, 7 days a week.
International Customers: Call 1-512-837-4810
Available 24 hours a day, 7 days a week. English language only.
The FootJoy Men's Flat Back Rib Half-Zip Pullover allows the player to adapt to changing weather conditions quickly and easily. The four-way stretch fabric provides for a full range of motion and protects you from damaging UV rays, and its easy-care nature avoids wrinkling and offers minimal shrinkage.
Additional features:
Online Shipping Information
Golfsmith.com offers simple, flat-rate shipping to destinations in the continguous U.S. via FedEx.
Our policy is to strive for the best possible combination of price and service for your shipment.
In order to better serve our guests, we will occassionally offer discounted shipping promotions. Any shipping discounts will be applied in your shopping cart.
"Overnight" shipments will arrive the next business day (excluding weekends and holidays) after departing Golfsmith. "2-Day Air" shipments arrive in two business days after departing Golfsmith. On-time delivery for both methods is guaranteed by FedEx. Shipping delays may occur during busy Holidays or in the spring -- we will do our best to accommodate last minute and expedited orders placed during these times.
Most orders are shipped within 48 hours of online placement. Orders must be placed by 9am (CST) Monday-Friday in order to be eligible for that day's "Overnight" or "2-Day Air" shipments. Orders for residential delivery placed on Sunday or Monday will not be shipped until Tuesday and orders for business delivery placed on weekends will not ship until Monday, so please take this into consideration when specifying expedited shipping requests.
Online Shipping Information
Additional Shipping Information
Sales Tax details
International & Canadian Orders
Men's Dri-FIT Performance Half-Zip Pullover
Men's Embossed Lizard Skin Belt
Men's ProDry Performance Base Layer Crew$58.00
Men's Long Sleeve Quarter-Zip Heather Pullover
Personalized Pro V1 High Numbers Golf Balls
Men's ColdGear Long Sleeve Mock$49.99
Men's Ultra Stripe Short Sleeve PoloPriced Too Low to Show
Men's ClimaWarm Quarter-Zip Colorblock Training Top$80.00


text:
Trying to make contact with the Descendants of William RUDOLPH and Helena Isabel FARNSWORTH that resided in Bremerton, Washington. It is known that William died between 1920 and 1930 and Helena died on 8/12/1947 in Seattle, Washington. They had the following children: Susan J., Helena F., Dora Marie, Harry W., Bessie and Lucile.
Notify Administrator about this message?
|Home | Help | About Us | Site Index | Jobs | PRIVACY | Affiliate
|© 2007 The Generations Network


text:
Good afternoon and welcome to our live coverage of the first huge game of what promises to be a fabulous day in the Premier League.
Manchester United vs Liverpool has always been one of the biggest games in English football, and this year's edition promises to be especially exciting.
David Moyes appears to be slowly getting to grips with the task at hand after a wobbly start to life at Old Trafford, and will be eyeing a win to boost morale.
But the hosts won't have it easy against the in-form Reds, who have been superb this season.
Should be a cracking game. Stick with us for goals, analysis and reaction.
The teams are in. Nemanja Vidic returns to partner Phil Jones in the heart of the United defence, with Chris Smalling missing out. Joe Allen gets the nod over Philippe Coutinho for Liverpool, while Glen Johnson keeps his place at full-back.
- Man United: De Gea, Rafael, Jones, Vidic, Evra, Mata, Fellaini, Carrick, Januzaj, Rooney, Van Persie
- Subs: Lindegaard, Ferdinand, Cleverley, Kagawa, Valencia, Young, Welbeck
- Liverpool: Mignolet, Johnson, Skrtel, Agger, Flanagan, Gerrard, Allen, Henderson, Sterling, Suarez, Sturridge
- Subs: Jones, Sakho, Cissokho, Lucas, Coutinho, Moses, Aspas
The RVP PR campaign continues apace...
.@Persie_Official on #mufc fans: "They've been our 12th man this season. We want to repay them for their support." pic.twitter.com/gfNAbYgelJ— Manchester United (@ManUtd) March 16, 2014
Want the key stats before the game? Luckily for you, our pals at WhoScored have crunched the numbers, comparing Wayne Rooney and Luis Suarez, as well as a whole heap of other parameters.
Jim Boardman of the Anfield Wrap has given us his view on today's game. He feels the dynamic of what he calls "the biggest game in English football" is beginning to change, with Liverpool now in the ascendancy.
David Moyes: Tactical pioneer.
#MindGames RT @SimonSaunders77 Mata in goal and De Donut midfield is a brave set up pic.twitter.com/1YUR6RwrDu— Mirror Football (@MirrorFootball) March 16, 2014
Some more pre-match reading? Very well then.
- Stan Collymore reckons Liverpool can win this game.
- Ian Holloway on Steven Gerrard: "The best Premier League player never to have won the title."
Eloquent as ever, Jamie Carragher has just uttered a delightful sentence on Sky Sports. Liverpool, he believes, are now "slight onsiders for the title". Superb stuff.
Kick-off less than ten minutes away now. Excitement building.
The majority of our readers fancy Liverpool this afternoon, it seems:
The public has spoken. Over 70 PER CENT of you think Liverpool will win this http://t.co/WCXFxkzl3y pic.twitter.com/lD8A4OtHHA— Mirror Football (@MirrorFootball) March 16, 2014
We're underway at Old Trafford. It's a summery afternoon in Manchester, with the pitched bathed in sun. All set up for a cracker, I'd say.
Man Utd due a big performance at home but Liverpool unbeaten in PL this year. Old Trafford can be flat but cracking atmosphere. #MUFC #LFC— David McDonnell (@DiscoMirror) March 16, 2014
The first chance of the game falls to Daniel Sturridge, who runs onto Jordan Henderson's slide-rule pass and blazes a shot just wide of the target.
Luis Suarez then winds his way into the area, with Marouane Fellaini a touch lucky not to concede a penalty.
This tickled me.
A few poor tackles from John Flanagan but he remains unfazed... pic.twitter.com/igYM7tT83l— Sam Diss (@SamDiss) March 16, 2014
United's turn to threaten now, with Adnan Januzaj leading an attack down the left. Marouane Fellaini's cross eventually comes to Robin van Persie, but the Dutchman's shot is charged down.
Daniel Sturridge then wasts a chance at the other end, shooting straight at David De Gea when he perhaps should have fed Raheem Sterling. Lively start to the game.
Fascinating, high-tempo stalemate at Old Trafford. Liverpool have had the best two chances, created with alarming simplicity down the inside-right channel and both wasted by Daniel Sturridge.
Liverpool have had the better quality possession and have been more hungry in the challenge but Van Persie and Rooney have shown hints of their threat, too.
Interesting seeing Gerrard and Carrick in opposition, too. Gerrard's conversion to holding midfielder could cost Carrick dear when Roy Hodgson, who is here today, is finalising his World Cup squad.
So this happened:
THE ICE CAPS ARE MELTING http://t.co/WCXFxkzl3y pic.twitter.com/jI6eh576bT— Mirror Football (@MirrorFootball) March 16, 2014
Intense start to this game and a cracking atmospehre inside Old Trafford.
Liverpool have had the upper hand so far, with Daniel Sturridge twice getting in behind the United defence but squandering the opportunities.
Luis Suarez had a decent shout for a penalty early on when Marouane Fellaini clipped him from behind but, surprisingly, the Liverpool forward chose to stay on his feet, when he would surely have earned a spot-kick had he gone down.
Liverpool have played with energy, enterprise and confidence. United, by comparison, have looked strangely inhibited.
Two yellow cards in as many minutes at Old Trafford. Jon Flanagan is the first to be booked after a series of niggling fouls in the opening half hour.
He's swiftly followed by Rafael, who is punished for an industrial challenge on Steven Gerrard.
First blood to the visitors at Old Trafford. Luis Suarez collects a diagonal pass and looks to nip inside Rafael, whose hand hits the ball. The referee awards a penalty to Liverpool, but chooses not to hand the Brazilian a second yellow. Steven Gerrard sends David De Gea the wrong way from the spot.
Rafael showed in the space of a couple of minutes why he has become such a liability this season. Booked for a nasty lunge on Steven Gerrard, he then compounded that with a handball to give Liverpool a penalty which their captain duly converted.
Quite why Rafael was not shown a second yellow - and a subsequent red card - only ref Mark Clattenburg knows, but the United full-back can consider himself lucky to have stayed on the pitch.
Liverpool have been worthy of their lead, while United have been insipid. With Rafael already on a yellow and living dangerously, David Moyes has a decision to make as to whether to take him off at half-time, bring Rio Ferdinand on and switch Phil Jones to right-back.
We found Nani! Rejoice!
Bravo RT @WildeLife85: @MirrorFootball Why is Nani not on the bench? pic.twitter.com/uUuHr9R48J— Mirror Football (@MirrorFootball) March 16, 2014
Liverpool deservedly ahead and hard to see how United are not down to 10 men. Rafael is too often a hot-headed liability at the back and after getting a yellow card for a late tackle on Gerrard, he should have been sent off for the deliberate handball that led to Liverpool's penalty.
Mark Clattenburg, who has been at his most animated in the spotlight today, chose not to penalise him for the handball. It may yet prove to be a significant decision.
That's it for the opening period at Old Trafford. Liverpool have shaded the play and lead through Steven Gerrard's well-taken penalty. United will feel thankful they still have 11 men on the field after Rafael's three minutes of madness, but they have work to do to get back in this.
Standard Twitter silliness:
RT @FootbalIVines: United fans to Sir Alex Ferguson... https://t.co/JrIUluHHLG— Mirror Football (@MirrorFootball) March 16, 2014
The second half is barely a minute old when Liverpool double their lead. Steven Gerrard is the scorer again, once more from the penalty spot after Phil Jones bundled over Joe Allen in the area. That's David Moyes' half-time team talk in tatters then...
Poor Dave. Poor, poor Dave.
*MOYES SADFACE KLAXON* http://t.co/UVj3evvkFX pic.twitter.com/B7uxHxd1mH— Mirror Football (@MirrorFootball) March 16, 2014
United, as you may expect, are pouring forward in search of an equaliser. But it's just not happening for them. The pass is always a touch overhit, or the touch a little heavy.
Incredibly frustrating for the home fans.
More chances for United. Juan Mata's snap shot is charged down on the edge of the area, before Marouane Fellaini screws his shot high and wide seconds later.
Robin van Persie then shoots into the side netting - but the offside flag was up.
United are in danger of being overwhelmed. They are trying to press to get back into the game but so far their efforts have verged on shambolic.
Liverpool look so much quicker, so much sharper that it is becoming embarrassing. Evra and Vidic have struggled to keep up for much of the game and Carrick is failing to exert any positive influence. Fellaini simply looks off the pace. Only Rooney looks like he played for the old United.
For David Moyes, in particular, if things stay as they are, the inquest into this one will not be pretty.
Nemanja Vidic is booked for a foul on Luis Suarez, before Steven Gerrard's drive is deflected just wide.
At the other end, Robin van Persie nods wide from a good position after good work by Wayne Rooney. Danny Welbeck and Tom Cleverley are on for United.
Scenes. Liverpool win a THIRD penalty when Daniel Sturridge tumbles under Nemanja Vidic's challenge. Replays show he dived, but the defender is dismissed by Mark Clattenburg. Steven Gerrard steps up to seal his hat-trick but... misses! The ball comes back off the post.
What a save! Luis Suarez powers his way past David De Gea and unleashes a thunderous volley, only for David De Gea to react and turn the ball round the post. Sensational stop from the Spaniard.
Well that is that then. Daniel Sturridge scuffs his shot into the path of Luis Suarez, who controls before slotting a finish past David De Gea to make it 3-0. This is comprehensive now.
Manchester United are slipping to their ninth league defeat this season, something that has only happened once before - in 2001-02 - in the Premier League era. Liverpool are fully deserving of their 3-0 lead, probing United throughout, while the home side have failed to carry any kind of attacking threat and played with little conviction.
If this is the best United can muster under David Moyes, then Olympiakos will fancy their chances of progessing at their expense in the Champions League when they come to Old Trafford on Wednesday.
The only consolation for United was Gerrard failing to score a hat-trick of penalties, after Daniel Sturridge dived to win his side a controversial spot-kick which saw Nemanja Vidic sent off for a second yellow.
The ordeal is over, United fans. Liverpool thoroughly deserve their win.
Thanks for joining us for this one, folks. Have a read of our match report here, and join Joe Mewis for coverage of the north London derby in this blog.


text:
Would you be willing to answer a few brief questions about PlayStation Forums?
Hey guys been pretty fun, i love this game as of late its harder and harder to find squaddies.
I have and play veitnam, original and onslaught
i can be found playing rush or conquest USAUALLY HARDCORE im not too picky
I DO have a mic
You can usually find me either busting up vehicles as an engineer or rolling medic mowin down fools with a lmg
I am a pretty damn good pilot with either chopper type
I am on eastern standard time and can usually be found online any where from 2 pm to 3 am or so, depends on work
What I am looking for:
as long as you can have fun and joke around during play i don't care how good you are.
A mic is a big plus
know how to play XD derp?
oh and a living breathing person XD
If interested toss me a ps3 invite username Artef
Count me in! I have been looking for a reason to play this game a lot more, and this just might be it. I have a mic, and love to spawn on squadmates....
PSN - god_smaka
i finished bfbc 2, but i do own bfbc 1, and am working on the 10,002 kills trophy
Hey, not sure if you've got a position still available, but I am totally ip for it. I have a mic, and am online most of the week after about 3 pm. I'm in central Canada so hopefully the timezones will work. Message back if interested, anyone.
i just added bunch of you feel free to add mine! BushXw00kie pi just started on the ps3 i sold my beast computer awhile back u can search up for the PC name is .//Fallen. im a decent sniper and engineer! so hit me up and ill take out what you need wether it be a super fast apache going across the screen or some scrub player standing still i gotcha covered!


text:
This page contains Darius Burst Unlockables for PSP called "Ships" and has been posted or updated on Feb 18, 2010 by jenniferb. Let us know what you think of this Unlockable by thumbs voting.
- Developer: Pyramid
- Publisher: Square Enix
- Genre: Action Shooter Scrolling
- Release Date: Dec 24, 2009
- ESRB: Not Set
You can unlock extra ships by clearing modes. Path of completion doesn't matter.
|How to Unlock:
|Clear Arcade Mode once.
|Clear Burst Mode.
More Unlockables
Back to all Cheats
Stuck on this game? Set a specific, clearly defined question and let others answer your question or view answers to previously asked questions. If you think you are an Darius Burst expert then please try to help others with their questions.
Ask a Question
Videos You May Like...
Grisaia No Rakuen: Le Eden De La Grisaia - Gameplay Review Trailer
- Nov 13, 2014, Views: 84
Grisaia No Kajitsu: Le Fruit De La Grisaia - Gameplay Review Trailer
- Nov 13, 2014, Views: 63
Grisaia No Meikyuu: Le Labyrinthe De La Grisaia - Gameplay Review Trailer (JP)
- Nov 13, 2014, Views: 79
View All Latest Videos
Meiji Toukyou Renka: Twilight Kiss - Gameplay Video
- Nov 13, 2014, Views: 72
Game Related Options
Latest PSP Videos
- Gran Turismo - Introduction Trailer, (PSP)
- Grand Theft Auto: Vice City Stories - Trailer, (PSP)
- Harvest Moon: Boy And Girl - Gameplay, (PSP)
- Harvest Moon: Hero Of Leaf Valley - Review Trailer, (PSP)
- God Eater Burst - Story Trailer, (PSP)
- Naruto Shippuden: Ultimate Ninja Impact - Trailer, (PSP)
- The Sims 2: Castaway - Gameplay, (PSP)
- Monster Hunter Portable 3rd - Trailer, (PSP)
New Added Games
- Heart No Kuni No Alice Wonderful Wonder And Twin World (Twin Pack), (PSP)
- Grisaia No Kajitsu: Le Fruit De La Grisaia, (PSP)
- Yu-Gi-Oh! ARC-V Tag Force Special, (PSP)
- Harukanaru Toki No Naka De 6, (PSP)
- Rappa The Rapper, (PSP)
- Dissidia 012 Prologus: Final Fantasy, (PSP)
- Meiji Toukyou Renka: Twilight Kiss, (PSP)
- Flowers, (PSP)
- Omerta: Chinmoku No Okite - The Legacy, (PSP)
- Kuroyukihime: Snow Magic, (PSP)
Popular Videos
- Kim Kardashian: Hollywood - Gameplay, (iPhone-iPod)
- Episode: Choose Your Story - Gameplay, (iPhone-iPod)
- How To Train Your Dragon 2 - Ready To Fly Trailer, (Wii)
- The Settlers - Kingdoms Of Anteria - Announcement Trailer, (PC)
- Entwined - Quick Look Trailer, (PS3)
- Blue Estate - Official Launch Trailer, (PS4)
- Goat Commando 3D Simulator - Gameplay, (iPhone-iPod)
- Munin - Official Launch Trailer, (iPad)