text:
!-----------------------------------------------------------------------
      subroutine coocsr(nrow,nnz,a,ir,jc,ao,jao,iao)
!-----------------------------------------------------------------------
      real*8 a(*),ao(*),x
      integer ir(*),jc(*),jao(*),iao(*)
!-----------------------------------------------------------------------
!  Coordinate     to   Compressed Sparse Row
!-----------------------------------------------------------------------
! converts a matrix that is stored in coordinate format
!  a, ir, jc into a row general sparse ao, jao, iao format.
!
! on entry:
!---------
! nrow      = dimension of the matrix
! nnz      = number of nonzero elements in matrix
! a,
! ir,
! jc    = matrix in coordinate format. a(k), ir(k), jc(k) store the nnz
!         nonzero elements of the matrix with a(k) = actual real value of
!         the elements, ir(k) = its row number and jc(k) = its column
!        number. The order of the elements is arbitrary.
!
! on return:
!-----------
! ir       is destroyed
!
! ao, jao, iao = matrix in general sparse matrix format with ao
!       continung the real values, jao containing the column indices,
!      and iao being the pointer to the beginning of the row,
!      in arrays ao, jao.
!
! Notes:
!------ This routine is NOT in place.  See coicsr
!
!------------------------------------------------------------------------
      do 1 k=1,nrow+1
         iao(k) = 0
 1    continue
! determine row-lengths.
      do 2 k=1, nnz
         iao(ir(k)) = iao(ir(k))+1
 2    continue
! starting position of each row..
      k = 1
      do 3 j=1,nrow+1
         k0 = iao(j)
         iao(j) = k
         k = k+k0
 3    continue
! go through the structure  once more. Fill in output matrix.
      do 4 k=1, nnz
         i = ir(k)
         j = jc(k)
         x = a(k)
         iad = iao(i)
         ao(iad) =  x
         jao(iad) = j
         iao(i) = iad+1
 4    continue
! shift back iao
      do 5 j=nrow,1,-1
         iao(j+1) = iao(j)
 5    continue
      iao(1) = 1
      return
!------------- end of coocsr -------------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine dcsort(ival, n, icnt, index, ilo, ihi)
!-----------------------------------------------------------------------
!     Specifications for arguments:
!     ----------------------------
      integer n, ilo, ihi, ival(n), icnt(ilo:ihi), index(n)
!-----------------------------------------------------------------------
!    This routine computes a permutation which, when applied to the
!    input vector ival, sorts the integers in ival in descending
!    order.  The permutation is represented by the vector index.  The
!    permuted ival can be interpreted as follows:
!      ival(index(i-1)) .ge. ival(index(i)) .ge. ival(index(i+1))
!
!    A specialized sort, the distribution counting sort, is used
!    which takes advantage of the knowledge that
!        1)  The values are in the (small) range [ ilo, ihi ]
!        2)  Values are likely to be repeated often
!
!    contributed to SPARSKIT by Mike Heroux. (Cray Research)
!    ---------------------------------------
!-----------------------------------------------------------------------
! Usage:
!------
!     call dcsort( ival, n, icnt, index, ilo, ihi )
!
! Arguments:
!-----------
!    ival  integer array (input)
!          On entry, ia is an n dimensional array that contains
!          the values to be sorted.  ival is unchanged on exit.
!
!    n     integer (input)
!          On entry, n is the number of elements in ival and index.
!
!    icnt  integer (work)
!          On entry, is an integer work vector of length
!          (ihi - ilo + 1).
!
!    index integer array (output)
!          On exit, index is an n-length integer vector containing
!          the permutation which sorts the vector ival.
!
!    ilo   integer (input)
!          On entry, ilo is .le. to the minimum value in ival.
!
!    ihi   integer (input)
!          On entry, ihi is .ge. to the maximum value in ival.
!
! Remarks:
!---------
!         The permutation is NOT applied to the vector ival.
!
!----------------------------------------------------------------
!
! Local variables:
!    Other integer values are temporary indices.
!
! Author:
!--------
!    Michael Heroux
!    Sandra Carney
!       Mathematical Software Research Group
!       Cray Research, Inc.
!
! References:
!    Knuth, Donald E., "The Art of Computer Programming, Volume 3:
!    Sorting and Searching," Addison-Wesley, Reading, Massachusetts,
!    1973, pp. 78-79.
!
! Revision history:
!    05/09/90: Original implementation.  A variation of the
!              Distribution Counting Sort recommended by
!              Sandra Carney. (Mike Heroux)
!
!-----------------------------------------------------------------
!     ----------------------------------
!     Specifications for local variables
!     ----------------------------------
      integer i, j, ivalj
!
!     --------------------------
!     First executable statement
!     --------------------------
      do 10 i = ilo, ihi
        icnt(i) = 0
 10   continue
!
      do 20 i = 1, n
        icnt(ival(i)) = icnt(ival(i)) + 1
 20   continue
!
      do 30 i = ihi-1,ilo,-1
        icnt(i) = icnt(i) + icnt(i+1)
 30   continue
!
      do 40 j = n, 1, -1
        ivalj = ival(j)
        index(icnt(ivalj)) = j
        icnt(ivalj) = icnt(ivalj) - 1
 40   continue
      return
      end
!-------end-of-dcsort---------------------------------------------------

!-----------------------------------------------------------------------
      subroutine csrjad(nrow, a, ja, ia, idiag, iperm, ao, jao, iao)
      integer ja(*), jao(*), ia(nrow+1), iperm(nrow), iao(nrow)
      real*8 a(*), ao(*)
!-----------------------------------------------------------------------
!    Compressed Sparse Row  to   Jagged Diagonal storage.
!-----------------------------------------------------------------------
! this subroutine converts  matrix stored in the compressed sparse
! row format to the jagged diagonal format. The data structure
! for the JAD (Jagged Diagonal storage) is as follows. The rows of
! the matrix are (implicitly) permuted so that their lengths are in
! decreasing order. The real entries ao(*) and their column indices
! jao(*) are stored in succession. The number of such diagonals is idiag.
! the lengths of each of these diagonals is stored in iao(*).
! For more details see [E. Anderson and Y. Saad,
! ``Solving sparse triangular systems on parallel computers'' in
! Inter. J. of High Speed Computing, Vol 1, pp. 73-96 (1989).]
! or  [Y. Saad, ``Krylov Subspace Methods on Supercomputers''
! SIAM J. on  Stat. Scient. Comput., volume 10, pp. 1200-1232 (1989).]
!-----------------------------------------------------------------------
! on entry:
!----------
! nrow 	  = row dimension of the matrix A.
!
! a,
! ia,
! ja      = input matrix in compressed sparse row format.
!
! on return:
!----------
!
! idiag = integer. The number of jagged diagonals in the matrix.
!
! iperm = integer array of length nrow containing the permutation
!         of the rows that leads to a decreasing order of the
!         number of nonzero elements.
!
! ao    = real array containing the values of the matrix A in
!         jagged diagonal storage. The j-diagonals are stored
!         in ao in sequence.
!
! jao   = integer array containing the column indices of the
!         entries in ao.
!
! iao   = integer array containing pointers to the beginning
!         of each j-diagonal in ao, jao. iao is also used as
!         a work array and it should be of length n at least.
!
!-----------------------------------------------------------------------
!     ---- define initial iperm and get lengths of each row
!     ---- jao is used a work vector to store tehse lengths
!
      idiag = 0
      ilo = nrow
      do 10 j=1, nrow
         iperm(j) = j
         len = ia(j+1) - ia(j)
         ilo = min(ilo,len)
         idiag = max(idiag,len)
         jao(j) = len
 10   continue
!
!     call sorter to get permutation. use iao as work array.
!
      call dcsort (jao, nrow, iao, iperm, ilo, idiag)
!
!     define output data structure. first lengths of j-diagonals
!
      do 20 j=1, nrow
         iao(j) = 0
 20   continue
      do 40 k=1, nrow
         len = jao(iperm(k))
         do 30 i=1,len
            iao(i) = iao(i)+1
 30      continue
 40   continue
!
!     get the output matrix itself
!
      k1 = 1
      k0 = k1
      do 60 jj=1, idiag
         len = iao(jj)
         do 50 k=1,len
            i = ia(iperm(k))+jj-1
            ao(k1) = a(i)
            jao(k1) = ja(i)
            k1 = k1+1
 50      continue
         iao(jj) = k0
         k0 = k1
 60   continue
      iao(idiag+1) = k1
      return
!----------end-of-csrjad------------------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine aplb(nrow,ncol,job,a,ja,ia,b,jb,ib,c,jc,ic,nzmax,iw,
     *ierr)
      real*8 a(*), b(*), c(*)
      integer ja(*),jb(*),jc(*),ia(nrow+1),ib(nrow+1),ic(nrow+1),
     *iw(ncol)
!-----------------------------------------------------------------------
! performs the matrix sum  C = A+B.
!-----------------------------------------------------------------------
! on entry:
! ---------
! nrow	= integer. The row dimension of A and B
! ncol  = integer. The column dimension of A and B.
! job   = integer. Job indicator. When job = 0, only the structure
!                  (i.e. the arrays jc, ic) is computed and the
!                  real values are ignored.
!
! a,
! ja,
! ia   = Matrix A in compressed sparse row format.
!
! b,
! jb,
! ib	=  Matrix B in compressed sparse row format.
!
! nzmax	= integer. The  length of the arrays c and jc.
!         amub will stop if the result matrix C  has a number
!         of elements that exceeds exceeds nzmax. See ierr.
!
! on return:
!----------
! c,
! jc,
! ic	= resulting matrix C in compressed sparse row sparse format.
!
! ierr	= integer. serving as error message.
!         ierr = 0 means normal return,
!         ierr .gt. 0 means that amub stopped while computing the
!         i-th row  of C with i=ierr, because the number
!         of elements in C exceeds nzmax.
!
! work arrays:
!------------
! iw	= integer work array of length equal to the number of
!         columns in A.
!
!-----------------------------------------------------------------------
      logical values
      values = (job .ne. 0)
      ierr = 0
      len = 0
      ic(1) = 1
      do 1 j=1, ncol
         iw(j) = 0
 1    continue
!
      do 500 ii=1, nrow
!     row i
         do 200 ka=ia(ii), ia(ii+1)-1
            len = len+1
            jcol    = ja(ka)
            if (len .gt. nzmax) goto 999
            jc(len) = jcol
            if (values) c(len)  = a(ka)
            iw(jcol)= len
 200     continue
!
         do 300 kb=ib(ii),ib(ii+1)-1
            jcol = jb(kb)
            jpos = iw(jcol)
            if (jpos .eq. 0) then
               len = len+1
               if (len .gt. nzmax) goto 999
               jc(len) = jcol
               if (values) c(len)  = b(kb)
               iw(jcol)= len
            else
               if (values) c(jpos) = c(jpos) + b(kb)
            endif
 300     continue
         do 301 k=ic(ii), len
           iw(jc(k)) = 0
 301     continue
         ic(ii+1) = len+1
 500  continue
      return
 999  ierr = ii
      return
!------------end of aplb -----------------------------------------------
!-----------------------------------------------------------------------
      end

!-----------------------------------------------------------------------
      subroutine vperm(n, x, perm)
      integer n, perm(n)
      real*8 x(n)
!-----------------------------------------------------------------------
! this subroutine performs an in-place permutation of a real vector x
! according to the permutation array perm(*), i.e., on return,
! the vector x satisfies,
!
!	x(perm(j)) :== x(j), j=1,2,.., n
!
!-----------------------------------------------------------------------
! on entry:
!---------
! n 	= length of vector x.
! perm 	= integer array of length n containing the permutation  array.
! x	= input vector
!
! on return:
!----------
! x	= vector x permuted according to x(perm(*)) :=  x(*)
!
!----------------------------------------------------------------------c
!           Y. Saad, Sep. 21 1989                                      c
!----------------------------------------------------------------------c
! local variables
      real*8 tmp, tmp1
!
      init      = 1
      tmp       = x(init)
      ii        = perm(init)
      perm(init)= -perm(init)
      k         = 0
!
! loop
!
 6    k = k+1
!
! save the chased element --
!
      tmp1      = x(ii)
      x(ii)     = tmp
      next      = perm(ii)
      if (next .lt. 0 ) goto 65
!
! test for end
!
      if (k .gt. n) goto 101
      tmp       = tmp1
      perm(ii)  = - perm(ii)
      ii        = next
!
! end loop
!
      goto 6
!
! reinitilaize cycle --
!
 65   init      = init+1
      if (init .gt. n) goto 101
      if (perm(init) .lt. 0) goto 65
      tmp       = x(init)
      ii        = perm(init)
      perm(init)=-perm(init)
      goto 6
!
 101  continue
      do 200 j=1, n
         perm(j) = -perm(j)
 200  continue
!
      return
!-------------------end-of-vperm---------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine dperm (nrow,a,ja,ia,ao,jao,iao,perm,qperm,job)
      integer nrow,ja(*),ia(nrow+1),jao(*),iao(nrow+1),perm(nrow),
     *qperm(*),job
      real*8 a(*),ao(*)
!-----------------------------------------------------------------------
! This routine permutes the rows and columns of a matrix stored in CSR
! format. i.e., it computes P A Q, where P, Q are permutation matrices.
! P maps row i into row perm(i) and Q maps column j into column qperm(j):
!      a(i,j)    becomes   a(perm(i),qperm(j)) in new matrix
! In the particular case where Q is the transpose of P (symmetric
! permutation of A) then qperm is not needed.
! note that qperm should be of length ncol (number of columns) but this
! is not checked.
!-----------------------------------------------------------------------
! Y. Saad, Sep. 21 1989 / recoded Jan. 28 1991.
!-----------------------------------------------------------------------
! on entry:
!----------
! n       = dimension of the matrix
! a, ja,
!    ia = input matrix in a, ja, ia format
! perm       = integer array of length n containing the permutation arrays
!        for the rows: perm(i) is the destination of row i in the
!         permuted matrix -- also the destination of column i in case
!         permutation is symmetric (job .le. 2)
!
! qperm      = same thing for the columns. This should be provided only
!         if job=3 or job=4, i.e., only in the case of a nonsymmetric
!        permutation of rows and columns. Otherwise qperm is a dummy
!
! job      = integer indicating the work to be done:
! * job = 1,2 permutation is symmetric  Ao :== P * A * transp(P)
!             job = 1      permute a, ja, ia into ao, jao, iao
!             job = 2 permute matrix ignoring real values.
! * job = 3,4 permutation is non-symmetric  Ao :== P * A * Q
!             job = 3      permute a, ja, ia into ao, jao, iao
!             job = 4 permute matrix ignoring real values.
!
! on return:
!-----------
! ao, jao, iao = input matrix in a, ja, ia format
!
! in case job .eq. 2 or job .eq. 4, a and ao are never referred to
! and can be dummy arguments.
! Notes:
!-------
!  1) algorithm is in place
!  2) column indices may not be sorted on return even  though they may be
!     on entry.
!----------------------------------------------------------------------c
! local variables
      integer locjob, mod
!
!     locjob indicates whether or not real values must be copied.
!
      locjob = mod(job,2)
!
! permute rows first
!
      call rperm (nrow,a,ja,ia,ao,jao,iao,perm,locjob)
!
! then permute columns
!
      locjob = 0
!
      if (job .le. 2) then
         call cperm (nrow,ao,jao,iao,ao,jao,iao,perm,locjob)
      else
         call cperm (nrow,ao,jao,iao,ao,jao,iao,qperm,locjob)
      endif
!
      return
!-------end-of-dperm----------------------------------------------------
      end

!-----------------------------------------------------------------------
      subroutine rperm (nrow,a,ja,ia,ao,jao,iao,perm,job)
      integer nrow,ja(*),ia(nrow+1),jao(*),iao(nrow+1),perm(nrow),job
      real*8 a(*),ao(*)
!-----------------------------------------------------------------------
! this subroutine permutes the rows of a matrix in CSR format.
! rperm  computes B = P A  where P is a permutation matrix.
! the permutation P is defined through the array perm: for each j,
! perm(j) represents the destination row number of row number j.
! Youcef Saad -- recoded Jan 28, 1991.
!-----------------------------------------------------------------------
! on entry:
!----------
! n       = dimension of the matrix
! a, ja, ia = input matrix in csr format
! perm       = integer array of length nrow containing the permutation arrays
!        for the rows: perm(i) is the destination of row i in the
!         permuted matrix.
!         ---> a(i,j) in the original matrix becomes a(perm(i),j)
!         in the output  matrix.
!
! job      = integer indicating the work to be done:
!             job = 1      permute a, ja, ia into ao, jao, iao
!                       (including the copying of real values ao and
!                       the array iao).
!             job .ne. 1 :  ignore real values.
!                     (in which case arrays a and ao are not needed nor
!                      used).
!
!------------
! on return:
!------------
! ao, jao, iao = input matrix in a, ja, ia format
! note :
!        if (job.ne.1)  then the arrays a and ao are not used.
!----------------------------------------------------------------------c
!           Y. Saad, May  2, 1990                                      c
!----------------------------------------------------------------------c
      logical values
      values = (job .eq. 1)
!
!     determine pointers for output matix.
!
      do 50 j=1,nrow
         i = perm(j)
         iao(i+1) = ia(j+1) - ia(j)
 50   continue
!
! get pointers from lengths
!
      iao(1) = 1
      do 51 j=1,nrow
         iao(j+1)=iao(j+1)+iao(j)
 51   continue
!
! copying
!
      do 100 ii=1,nrow
!
! old row = ii  -- new row = iperm(ii) -- ko = new pointer
!
         ko = iao(perm(ii))
         do 60 k=ia(ii), ia(ii+1)-1
            jao(ko) = ja(k)
            if (values) ao(ko) = a(k)
            ko = ko+1
 60      continue
 100  continue
!
      return
!---------end-of-rperm -------------------------------------------------
!-----------------------------------------------------------------------
      end

!-----------------------------------------------------------------------
      subroutine cperm (nrow,a,ja,ia,ao,jao,iao,perm,job)
      integer nrow,ja(*),ia(nrow+1),jao(*),iao(nrow+1),perm(*), job
      real*8 a(*), ao(*)
!-----------------------------------------------------------------------
! this subroutine permutes the columns of a matrix a, ja, ia.
! the result is written in the output matrix  ao, jao, iao.
! cperm computes B = A P, where  P is a permutation matrix
! that maps column j into column perm(j), i.e., on return
!      a(i,j) becomes a(i,perm(j)) in new matrix
! Y. Saad, May 2, 1990 / modified Jan. 28, 1991.
!-----------------------------------------------------------------------
! on entry:
!----------
! nrow       = row dimension of the matrix
!
! a, ja, ia = input matrix in csr format.
!
! perm      = integer array of length ncol (number of columns of A
!         containing the permutation array  the columns:
!         a(i,j) in the original matrix becomes a(i,perm(j))
!         in the output matrix.
!
! job      = integer indicating the work to be done:
!             job = 1      permute a, ja, ia into ao, jao, iao
!                       (including the copying of real values ao and
!                       the array iao).
!             job .ne. 1 :  ignore real values ao and ignore iao.
!
!------------
! on return:
!------------
! ao, jao, iao = input matrix in a, ja, ia format (array ao not needed)
!
! Notes:
!-------
! 1. if job=1 then ao, iao are not used.
! 2. This routine is in place: ja, jao can be the same.
! 3. If the matrix is initially sorted (by increasing column number)
!    then ao,jao,iao  may not be on return.
!
!----------------------------------------------------------------------c
! local parameters:
      integer k, i, nnz
!
      nnz = ia(nrow+1)-1
      do 100 k=1,nnz
         jao(k) = perm(ja(k))
 100  continue
!
!     done with ja array. return if no need to touch values.
!
      if (job .ne. 1) return
!
! else get new pointers -- and copy values too.
!
      do 1 i=1, nrow+1
         iao(i) = ia(i)
 1    continue
!
      do 2 k=1, nnz
         ao(k) = a(k)
 2    continue
!
      return
!---------end-of-cperm--------------------------------------------------
!-----------------------------------------------------------------------
      end

!------ MULTI COLORING -------------------------------------------------
      subroutine multic (n,ja,ia,ncol,kolrs,il,iord,maxcol,ierr)
      integer n, ja(*),ia(n+1),kolrs(n),iord(n),il(maxcol+1),ierr
!-----------------------------------------------------------------------
!     multicoloring ordering -- greedy algorithm --
!     determines the coloring permutation and sets up
!     corresponding data structures for it.
!-----------------------------------------------------------------------
! on entry
! --------
! n     = row and column dimention of matrix
! ja    = column indices of nonzero elements of matrix, stored rowwise.
! ia    = pointer to beginning of each row in ja.
! maxcol= maximum number of colors allowed -- the size of il is
!         maxcol+1 at least. Note: the number of colors does not
!         exceed the maximum degree of each node +1.
! iord  = en entry iord gives the order of traversal of the nodes
!         in the multicoloring algorithm. If there is no preference
!         then set iord(j)=j for j=1,...,n
!
! on return
! ---------
! ncol  = number of colours found
! kolrs = integer array containing the color number assigned to each node
! il    = integer array containing the pointers to the
!         beginning of each color set. In the permuted matrix
!         the rows /columns il(kol) to il(kol+1)-1 have the same color.
! iord  = permutation array corresponding to the multicolor ordering.
!         row number i will become row nbumber iord(i) in permuted
!         matrix. (iord = destination permutation array).
! ierr  = integer. Error message. normal return ierr = 0. If ierr .eq.1
!         then the array il was overfilled.
!
!-----------------------------------------------------------------------
!
      integer kol, i, j, k, maxcol, mycol
!
      ierr = 0
      do 1 j=1, n
         kolrs(j) = 0
 1    continue
      do 11 j=1, maxcol
         il(j) = 0
 11   continue
!
      ncol = 0
!
!     scan all nodes
!
      do 4 ii=1, n
         i = iord(ii)
!
!     look at adjacent nodes to determine colors already assigned
!
         mcol = 0
         do 2 k=ia(i), ia(i+1)-1
            j = ja(k)
            icol = kolrs(j)
            if (icol .ne. 0) then
               mcol = max(mcol,icol)
!
!     il used as temporary to record already assigned colors.
!
               il(icol) = 1
            endif
 2       continue
!
!     taken colors determined. scan il until a slot opens up.
!
         mycol = 1
 3       if (il(mycol) .eq. 1) then
            mycol = mycol+1
            if (mycol .gt. maxcol) goto 99
            if (mycol .le. mcol) goto 3
         endif
!
!     reset il to zero for next nodes
!
         do 35 j=1, mcol
            il(j) = 0
 35      continue
!
!     assign color and update number of colors so far
!
         kolrs(i) = mycol
         ncol = max(ncol,mycol)
 4    continue
!
!     every node has now been colored. Count nodes of each color
!
      do 6 j=1, n
         kol = kolrs(j)+1
         il(kol) = il(kol)+1
 6    continue
!
!     set pointers il
!
      il(1) = 1
      do 7 j=1, ncol
         il(j+1) = il(j)+il(j+1)
 7    continue
!
!     set iord
!
      do 8 j=1, n
         kol = kolrs(j)
         iord(j) = il(kol)
         il(kol) = il(kol)+1
 8    continue
!
!     shift il back
!
      do 9 j=ncol,1,-1
         il(j+1) = il(j)
 9    continue
      il(1) = 1
!
      return
 99   ierr = 1
      return
!----end-of-multic------------------------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine filter(n,job,drptol,a,ja,ia,b,jb,ib,len,ierr)
      real*8 a(*),b(*),drptol
      integer ja(*),jb(*),ia(*),ib(*),n,job,len,ierr
!-----------------------------------------------------------------------
!     This module removes any elements whose absolute value
!     is small from an input matrix A and puts the resulting
!     matrix in B.  The input parameter job selects a definition
!     of small.
!-----------------------------------------------------------------------
! on entry:
!---------
!  n	 = integer. row dimension of matrix
!  job   = integer. used to determine strategy chosen by caller to
!         drop elements from matrix A.
!          job = 1
!              Elements whose absolute value is less than the
!              drop tolerance are removed.
!          job = 2
!              Elements whose absolute value is less than the
!              product of the drop tolerance and the Euclidean
!              norm of the row are removed.
!          job = 3
!              Elements whose absolute value is less that the
!              product of the drop tolerance and the largest
!              element in the row are removed.
!
! drptol = real. drop tolerance used for dropping strategy.
! a
! ja
! ia     = input matrix in compressed sparse format
! len	 = integer. the amount of space available in arrays b and jb.
!
! on return:
!----------
! b
! jb
! ib    = resulting matrix in compressed sparse format.
!
! ierr	= integer. containing error message.
!         ierr .eq. 0 indicates normal return
!         ierr .gt. 0 indicates that there is'nt enough
!         space is a and ja to store the resulting matrix.
!         ierr then contains the row number where filter stopped.
! note:
!------ This module is in place. (b,jb,ib can ne the same as
!       a, ja, ia in which case the result will be overwritten).
!----------------------------------------------------------------------c
!           contributed by David Day,  Sep 19, 1989.                   c
!----------------------------------------------------------------------c
! local variables
      real*8 norm,loctol
      integer index,row,k,k1,k2
!
      index = 1
      do 10 row= 1,n
         k1 = ia(row)
         k2 = ia(row+1) - 1
         ib(row) = index
         goto (100,200,300) job
 100     norm = 1.0d0
         goto 400
 200     norm = 0.0d0
         do 22 k = k1,k2
            norm = norm + a(k) * a(k)
 22      continue
         norm = sqrt(norm)
         goto 400
 300     norm = 0.0d0
         do 23 k = k1,k2
            if( abs(a(k))  .gt. norm) then
               norm = abs(a(k))
            endif
 23      continue
 400     loctol = drptol * norm
         do 30 k = k1,k2
         if( abs(a(k)) .gt. loctol)then
               if (index .gt. len) then
               ierr = row
               return
            endif
            b(index) =  a(k)
            jb(index) = ja(k)
            index = index + 1
         endif
 30   continue
 10   continue
      ib(n+1) = index
      ierr = 0
      return
!--------------------end-of-filter -------------------------------------
!-----------------------------------------------------------------------
      end

!-----------------------------------------------------------------------
      subroutine getu (n,a,ja,ia,ao,jao,iao)
      integer n, ia(*), ja(*), iao(*), jao(*)
      real*8 a(*), ao(*)
!------------------------------------------------------------------------
! this subroutine extracts the upper triangular part of a matrix
! and writes the result ao, jao, iao. The routine is in place in
! that ao, jao, iao can be the same as a, ja, ia if desired.
!-----------
! on input:
!
! n     = dimension of the matrix a.
! a, ja,
!    ia = matrix stored in a, ja, ia, format
! On return:
! ao, jao,
!    iao = upper triangular matrix (upper part of a)
!      stored in compressed sparse row format
! note: the diagonal element is the last element in each row.
! i.e. in  a(ia(i+1)-1 )
! ao, jao, iao may be the same as a, ja, ia on entry -- in which case
! getu will overwrite the result on a, ja, ia.
!
!------------------------------------------------------------------------
! local variables
      real*8 t
      integer ko, k, i, kdiag, kfirst
      ko = 0
      do  7 i=1, n
         kfirst = ko+1
         kdiag = 0
         do 71 k = ia(i), ia(i+1) -1
            if (ja(k)  .lt. i) goto 71
            ko = ko+1
            ao(ko) = a(k)
            jao(ko) = ja(k)
            if (ja(k)  .eq. i) kdiag = ko
 71      continue
         if (kdiag .eq. 0 .or. kdiag .eq. kfirst) goto 72
!     exchange
         t = ao(kdiag)
         ao(kdiag) = ao(kfirst)
         ao(kfirst) = t
!
         k = jao(kdiag)
         jao(kdiag) = jao(kfirst)
         jao(kfirst) = k
 72      iao(i) = kfirst
 7    continue
!     redefine iao(n+1)
      iao(n+1) = ko+1
      return
!----------end-of-getu -------------------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine submat(n,job,i1,i2,j1,j2,a,ja,ia,nr,nc,ao,jao,iao)
      integer n,job,i1,i2,j1,j2,nr,nc,ia(*),ja(*),jao(*),iao(*)
      real*8 a(*),ao(*)
!-----------------------------------------------------------------------
! extracts the submatrix A(i1:i2,j1:j2) and puts the result in
! matrix ao,iao,jao
!---- In place: ao,jao,iao may be the same as a,ja,ia.
!--------------
! on input
!---------
! n      = row dimension of the matrix
! i1,i2 = two integers with i2 .ge. i1 indicating the range of rows to be
!          extracted.
! j1,j2 = two integers with j2 .ge. j1 indicating the range of columns
!         to be extracted.
!         * There is no checking whether the input values for i1, i2, j1,
!           j2 are between 1 and n.
! a,
! ja,
! ia    = matrix in compressed sparse row format.
!
! job      = job indicator: if job .ne. 1 then the real values in a are NOT
!         extracted, only the column indices (i.e. data structure) are.
!         otherwise values as well as column indices are extracted...
!
! on output
!--------------
! nr      = number of rows of submatrix
! nc      = number of columns of submatrix
!        * if either of nr or nc is nonpositive the code will quit.
!
! ao,
! jao,iao = extracted matrix in general sparse format with jao containing
!      the column indices,and iao being the pointer to the beginning
!      of the row,in arrays a,ja.
!----------------------------------------------------------------------c
!           Y. Saad, Sep. 21 1989                                      c
!----------------------------------------------------------------------c
      nr = i2-i1+1
      nc = j2-j1+1
!
      if ( nr .le. 0 .or. nc .le. 0) return
!
      klen = 0
!
!     simple procedure. proceeds row-wise...
!
      do 100 i = 1,nr
         ii = i1+i-1
         k1 = ia(ii)
         k2 = ia(ii+1)-1
         iao(i) = klen+1
!-----------------------------------------------------------------------
         do 60 k=k1,k2
            j = ja(k)
            if (j .ge. j1 .and. j .le. j2) then
               klen = klen+1
               if (job .eq. 1) ao(klen) = a(k)
               jao(klen) = j - j1+1
            endif
 60      continue
 100  continue
      iao(nr+1) = klen+1
      return
!------------end-of submat----------------------------------------------
!-----------------------------------------------------------------------
      end

!-----------------------------------------------------------------------
      subroutine infdia (n,ja,ia,ind,idiag)
      integer ia(*), ind(*), ja(*)
!-----------------------------------------------------------------------
!     obtains information on the diagonals of A.
!-----------------------------------------------------------------------
! this subroutine finds the lengths of each of the 2*n-1 diagonals of A
! it also outputs the number of nonzero diagonals found.
!-----------------------------------------------------------------------
! on entry:
!----------
! n	= dimension of the matrix a.
!
! a,    ..... not needed here.
! ja,
! ia    = matrix stored in csr format
!
! on return:
!-----------
!
! idiag = integer. number of nonzero diagonals found.
!
! ind   = integer array of length at least 2*n-1. The k-th entry in
!         ind contains the number of nonzero elements in the diagonal
!         number k, the numbering beeing from the lowermost diagonal
!         (bottom-left). In other words ind(k) = length of diagonal
!         whose offset wrt the main diagonal is = - n + k.
!----------------------------------------------------------------------c
!           Y. Saad, Sep. 21 1989                                      c
!----------------------------------------------------------------------c
      n2= n+n-1
      do 1 i=1,n2
         ind(i) = 0
 1    continue
      do 3 i=1, n
         do 2 k=ia(i),ia(i+1)-1
            j = ja(k)
            ind(n+j-i) = ind(n+j-i) +1
 2       continue
 3    continue
!     count the nonzero ones.
      idiag = 0
      do 41 k=1, n2
         if (ind(k) .ne. 0) idiag = idiag+1
 41   continue
      return
! done
!------end-of-infdia ---------------------------------------------------
!-----------------------------------------------------------------------
      end

      subroutine csrdia (n,idiag,job,a,ja,ia,ndiag,diag,ioff,ao,jao,iao,
     *ind)
      real*8 diag(ndiag,idiag), a(*), ao(*)
      integer ia(*), ind(*), ja(*), jao(*), iao(*), ioff(*)
!-----------------------------------------------------------------------
! Compressed sparse row     to    diagonal format
!-----------------------------------------------------------------------
! this subroutine extracts  idiag diagonals  from the  input matrix a,
! a, ia, and puts the rest of  the matrix  in the  output matrix ao,
! jao, iao.  The diagonals to be extracted depend  on the  value of job
! (see below for details.)  In  the first  case, the  diagonals to be
! extracted are simply identified by  their offsets  provided in ioff
! by the caller.  In the second case, the  code internally determines
! the idiag most significant diagonals, i.e., those  diagonals of the
! matrix which  have  the  largest  number  of  nonzero elements, and
! extracts them.
!-----------------------------------------------------------------------
! on entry:
!----------
! n	= dimension of the matrix a.
! idiag = integer equal to the number of diagonals to be extracted.
!         Note: on return idiag may be modified.
! a, ja,
!    ia = matrix stored in a, ja, ia, format
! job	= integer. serves as a job indicator.  Job is better thought
!         of as a two-digit number job=xy. If the first (x) digit
!         is one on entry then the diagonals to be extracted are
!         internally determined. In this case csrdia exctracts the
!         idiag most important diagonals, i.e. those having the largest
!         number on nonzero elements. If the first digit is zero
!         then csrdia assumes that ioff(*) contains the offsets
!         of the diagonals to be extracted. there is no verification
!         that ioff(*) contains valid entries.
!         The second (y) digit of job determines whether or not
!         the remainder of the matrix is to be written on ao,jao,iao.
!         If it is zero  then ao, jao, iao is not filled, i.e.,
!         the diagonals are found  and put in array diag and the rest is
!         is discarded. if it is one, ao, jao, iao contains matrix
!         of the remaining elements.
!         Thus:
!         job= 0 means do not select diagonals internally (pick those
!                defined by ioff) and do not fill ao,jao,iao
!         job= 1 means do not select diagonals internally
!                      and fill ao,jao,iao
!         job=10 means  select diagonals internally
!                      and do not fill ao,jao,iao
!         job=11 means select diagonals internally
!                      and fill ao,jao,iao
!
! ndiag = integer equal to the first dimension of array diag.
!
! on return:
!-----------
!
! idiag = number of diagonals found. This may be smaller than its value
!         on entry.
! diag  = real array of size (ndiag x idiag) containing the diagonals
!         of A on return
!
! ioff  = integer array of length idiag, containing the offsets of the
!   	  diagonals to be extracted.
! ao, jao
!  iao  = remainder of the matrix in a, ja, ia format.
! work arrays:
!------------
! ind   = integer array of length 2*n-1 used as integer work space.
!         needed only when job.ge.10 i.e., in case the diagonals are to
!         be selected internally.
!
! Notes:
!-------
!    1) The algorithm is in place: ao, jao, iao can be overwritten on
!       a, ja, ia if desired
!    2) When the code is required to select the diagonals (job .ge. 10)
!       the selection of the diagonals is done from left to right
!       as a result if several diagonals have the same weight (number
!       of nonzero elemnts) the leftmost one is selected first.
!-----------------------------------------------------------------------
      job1 = job/10
      job2 = job-job1*10
      if (job1 .eq. 0) goto 50
      n2 = n+n-1
      call infdia(n,ja,ia,ind,idum)
!----------- determine diagonals to  accept.----------------------------
!-----------------------------------------------------------------------
      ii = 0
 4    ii=ii+1
      jmax = 0
      do 41 k=1, n2
         j = ind(k)
         if (j .le. jmax) goto 41
         i = k
         jmax = j
 41   continue
      if (jmax .le. 0) then
         ii = ii-1
         goto 42
      endif
      ioff(ii) = i-n
      ind(i) = - jmax
      if (ii .lt.  idiag) goto 4
 42   idiag = ii
!---------------- initialize diago to zero -----------------------------
 50   continue
      do 55 j=1,idiag
         do 54 i=1,n
            diag(i,j) = 0.0d0
 54      continue
 55   continue
!-----------------------------------------------------------------------
      ko = 1
!-----------------------------------------------------------------------
! extract diagonals and accumulate remaining matrix.
!-----------------------------------------------------------------------
      do 6 i=1, n
         do 51 k=ia(i),ia(i+1)-1
            j = ja(k)
            do 52 l=1,idiag
               if (j-i .ne. ioff(l)) goto 52
               diag(i,l) = a(k)
               goto 51
 52         continue
!--------------- append element not in any diagonal to ao,jao,iao -----
            if (job2 .eq. 0) goto 51
            ao(ko) = a(k)
            jao(ko) = j
            ko = ko+1
 51      continue
         if (job2 .ne. 0 ) ind(i+1) = ko
 6    continue
      if (job2 .eq. 0) return
!     finish with iao
      iao(1) = 1
      do 7 i=2,n+1
         iao(i) = ind(i)
 7    continue
      return
!----------- end of dcsrdia ---------------------------------------------
!-----------------------------------------------------------------------
      end


Town of Pazin is located in the center of the Istrian peninsula, on a plateau surrounded by the surrounding hills forming a valley. The old town is located above the steep cliffs beneath which lies the abyss of the river Pazinčica thus creating a geological phenomenon known as the Cave of Pazin. From the old part, the city was spreading to the west, or in the hinterland of the Cave of Pazin. Rivulet Pazinčica in its course creates the famous waterfall Zarecki krov whose pond in the summer months attracts young people that there find a place for refreshment. Due to the geographical position Pazin is characterized by a continental climate with hot summers.


Prefer not to have to write a check? We offer payment by phone: 877-926-4600.
Like face-to-face contact when you pay? We have convenient locations to serve you.
*Online payments are temporarily unavailable. You can still make a payment over the phone by calling 877-926-4600.
Find mail works best for you? No problem, we accept payment via mail as well.


text:
Whats with these short kick off?
boomermet
Kick it in the end zone . Dont understand
I dunno. But I don't like it.
I wondered that also, when your Kicker has done it all year????????
And they have the best kick return guy in college football.
Oklahomazeppelin
It literally changed the game. It's like the squib kick that changed the Rose Bowl. Neither are necessarily game-deciders, but really flawed strategy. And it's that -- mistakes by coaching -- that drives me more nuts than a missed call, a dropped INT, or missed kick...
Hopefully whoever decided those learned from those.
Apparently he didn't learn from the one in January.
soonerrick46
The wind played a major factor in the kicking game today.
SoonerSpock
Seibert was able to kick the ball out of the end zone with the wind to his back Not so kicking into the wind. The real killer was the unsportsmanlike penalty for celebration that gave Turpin the opportunity to return the kick-off. Seibert just did a poor job of not kicking to Turpin.
Of course the celebration penalty for unsportsmanlike conduct resulted in a 15 yard penalty that prohibited kicking through the end zone on Turpin's TD return. But the frogs did return 3 other kickoffs for 90 yards.

redpajama_set_name: RedPajamaCommonCrawl


text:
« Previous Post | World Now Home | Next Post »
Gunfire across Syrian border kills two in Turkish refugee camp
April 9, 2012 | 8:59 am
This story has been updated. See the note below.
REPORTING FROM BEIRUT -- Gunmen fired across the Syrian border into a refugee camp in Turkey on Monday, killing two camp residents and wounding at least four others, while gunfire along the Syrian border with Lebanon killed a television cameraman.
Syrian activists blamed the gunfire into the Kilis camp in Turkey on Syrian forces.
At least 15 other people were wounded outside the facility as they were fleeing Syria into Turkey, the activists said.
Clashes between Syrian forces and Free Syrian Army rebels are taking place regularly during the night along the Turkish-Syrian border, activists told The Times. However, this reportedly was the first known incident of direct fire at a refugee camp.
"There were clashes in the border area between FSA and the regular army," said an activist at the camp who requested to be identified only as Tariq. "It started around 3 a.m. We hear gunfire every night. But it is the first time they directly fire at the camp."
The camp is 400 to 500 yards from the border and hosts about 8,000 refugees, though it has a capacity of 12,000, he said.
"The regular army fired at the camp around noon," he said. "There are four wounded, including a Turkish nurse, and two Syrian refugees who were killed. They were both standing next to me on a higher ground, watching the clashes; I was filming when they were killed."
In Lebanon, gunfire from the Syrian village of Armouta killed Al Jadeed television cameraman Ali Shaaban, the Associated Press reported.
His colleague, reporter Hussein Khreis, said the team heard heavy gunfire around them from all sides, "falling like rain," AP reported. Shaaban was inside a car when he was struck, Khreis said.
"If you see the car you would think it was in a war zone," Khreis said on Al Jadeed TV. "It is completely destroyed from the bullets."
The shooting at the Kilis camp led Turkish authorities to summon the Syrian ambassador in Ankara, the capital, to demand an end to clashes at the border area.
[Updated April 9, 11:49 a.m.: "Syrian citizens who took refuge in our country from the brutality of the current regime in Syria are under Turkey's full protection," the Turkish Foreign Ministry said in a later statement. "We will certainly take necessary measures if such incidents reoccur."]
A Foreign Ministry official speaking on the condition of anonymity denied that Turkey has sent reinforcement to the area. However, he said "everything is on the table" when asked if the shooting will affect Turkey's involvement in the conflict, including steps to create a buffer zone along the border or to allow weapons to go to the rebels.
"No Turkish reinforcements were sent so far," the activist in Kilis said. "People in the camp are anxious; they organized a sit-in demanding better protection. We are on Turkish land and this has happened, what if we were in Syria? Not even an ambulance was sent."
Syria peace plan appears to fall apart
At least 38 people killed in Easter suicide bombing in Nigeria
White ribbons fill Red Square as Russian officials allow protest
-- Rima Marrouch
Video: This footage, uploaded to YouTube on Monday by opposition activists, purports to show traces of gunfire on housing units in the Kilis refugee camp in Turkey.


Depending on the final application of the product a follow-up treatment is demanded more often. In order to prevent tension in the end product the material can be glowed free of tension in our factory beforehand. If necessary this can be repeated after the rough first treatment. For several surface treatments Tieltjes has a network of suppliers who each have their own skills. Once a week our own transport visits these companies in behalf of an optimal flow of products.
Only stainless steel turning and milling parts can be polished electrolytically bij ourselves. In our modern, well equipped cleanroom we are able te clean ultrasonically and pack the products customer specifically. In this way we avoid the chance of minuscule defects.
Tieltjes doesn't polish electolytically only for its own production. You can contact us for an informal offer.


anything else im gonna need? or i should change? some of this stuff i have installed already ill list that below so those i wont change till the whole setup is done then i can worry about changing it if need be but maybe i need injectors or sumthin?
info + comments + whp guess' + 1/4 time guess' please!
i really need advice and help with this guyz so thanks in advance!!
ur gunna need pretty high compression and LOTS of headwork to make those cams work well, personally, in my opinion, they're too big for a b16. Any decent n/a setup NEEDS a solid port and polish and a good valve job.
I'd also say ditch the megan header for something better, a good header is also very important (and too often overlooked) when building a n/a setup.
I would also stay away from the skunk2 intake manifold and too big of a throttle body, that will kill any low end power you might have out of the 1.6L.....IMO a 68mm throttle body is overkill.
This is just from my experience, from building my b16 for n/a....if i could pass on one peice of advice.....is....DON'T DO IT!!!!!
Do a b20 bottom end, or build a nice lsvtec....or better yet.....BOOST.
The money you'd spend on all of the parts to build a n/a b16 could easily buy you a decent turbo kit and would get you soooo much more bang for the buck. Again, talking from experience here. I love my boosted b16, i kept all of the goodies from my n/a build (11.5:1 compression and all) and put a turbo on it, man, i should have done that in the first place.
I don't wanna hear any of this turbo cars aren't reliable bull, b/c its not true. I've tuned literally dozens of turbo hondas this summer and they're all as reliable as any n/a setup, i've seen n/a cars that are less reliable than most turbo cars.
8-10psi on a decent t3/t4 with a free flowing exhaust on a b16 will get you 250+whp easy. If you wanted to turn up the boost a little 300whp isn't that hard to hit.
well what kinda turbo kit should i run then????
why stay away from the skunk2 intake manifold? i hear good things?
and what size tb would u recomend then?
im looking to spend around 3000 to 3500, with everything installed tuned i can get all the skunk2 stuff i said installed and tuned for about that now i dont know anything about turbo's but i wouldnt be able to run 8-10 lbs on a stock engine?
boost a stock b16 with a t3/t4 50 or 57 trim.
I'm not a fan of the skunk2 intake manifold and for most cases an ITR manifold and throttle body is more than sufficient.
A bigger throttle body will rob low end power. I'm using a 64mm bored b16 throttle body on my setup and lost 2 ft/lbs of torque after switching to it.....and every ft/lb counts on a n/a build.
Any engine can handle 8-10psi. But thats all relative to the size of the turbo, 10psi off a t3/t4 50 trim with .50 A/R is a lot different than 10psi off a GT35R with .80 A/R.
Personally, i'd run a smaller turbo with a little higher boost. I'm running a bigger turbo with less boost, but my case is different, i didn't really get to choose the parts, i was given them from someones setup, so i couldn't be picky.
I've got a GT3255E with .63 A/R (60 trim, i think) so it spools slow, but the power at 8000-8500 is amazing. Its basically a large(er/ish) t3/t4 (too big for a b16 IMO, but splitfire seemed to think this was a good turbo for my buddys setup) that starts to spool at 4000rpm and reaches full boost (8psi right now) by 4500-4800rpms and holds STRONG until 8500rpms (prolly higher, its a decent sized turbo).
My engine is a b16 with roughly 11.5:1 compression stage 2 cams, yadda yadda, but stock, bone stock bottom end. Its held up fine for the time i've abused it.
and since i duno much bout turbo's whats the best company to go with? garrett? greddy? turbonetics?
if i decide to go N/A would pro 1's or stage 2 cams be better?
and would 9000rpm be an option or would it be useless?
well i've got dual valve springs and titanium retainers to match the cams and my heads been ported, so i'm not worried.
question tho, im gonna swap out my block to a b20, so which is better b20b or b20z? and why?
and how much hp does a stock b20vtec make? more or less then a stock b16?
how much power do you want to make and how much can you realisticly spend?
For a IM look at AEBS and BLOX there almost identical to the skunk2 IM but cheaper as well ive herd of sk2 TB's sticking, professional products (AEBS) make TB's and ive never heard of them sticking.
you can get the AEBS IM and TB for probally what that sk2 IM would cost. check HT.
And of course Boost that B16.
Zeeman, throughout the next few years I'm going to build the most kick-*** street driven NA tuned B16A2 on ITB's just to spite you!!!
Wanted Opinions On A New Setup.


Duplex House India Pictures - for many, home design is an notably daunting method. understanding in which to begin, to not point out finding out on something specific or a unconscious for the complete apartment, is a few component many individuals leave to experts. but, at we've got made matters hassle-free; our rooms internet web page helps you to view the most famous images of the day. It additionally acts as a top degree view for the to be had different types for house tips and home decor or maybe where professionals in the us of a are positioned. Are your desires very distinctive? Do you ideal need tips for certain rooms? desirable, that's ok.


text:
Forums › Sports › Geekzone Rugby (Union) Discussion Thread
Prev 1 | ... | 242 | 243 | 244 | 245 | 246 | 247 | 248 | 249 | 250 | 251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 259 | 260 | 261 | 262 | ... | 354 Next
tdgeek
# 2100774 3-Oct-2018 13:19
networkn:
tdgeek:
Objective is about blaming the loser? It takes two to tango. So a losing side has a bad day at the office. Cannot possibly be that the winning side, brought a strategy that shut down parts of the AB's play or theme. No, can't be that.... You have confirmed what I read here from some, not all. Being a big fan is one thing, unashamed non objective bias is another. Fan Club stands. Its is for some, a club of fans. For others fanboyism
Ticker tape parade? Childish comment. I broke the rules here, that's patently clear
Blaming anyone but the loser would be making excuses. How many times have you seen critism over the way fans reacted to the loss in 2007? SA got props for the way they played, but it's not enough according to you.
As a team/player, you can only control yourselves. That is who should get the blame for a loss.
Ok, I disagree, that's my opinion. My basis is this. A team, especially in rugby can effect control over the game. Targeting areas they feel will shut down strengths of the opposition. Thats often mentioned. Their lineout sux so lets kick to their line, close to the try line. Fusitua scores on the right wing at will, lets keep the ball away from him, their forwards are too good, lets not take them on, and so on. IMHO thats a big part of team sport, and individual sports. Its up to both sides to target those favourable areas, and try to respond when the opposition is doing the same. Any team or player can have a bad day at the office, Id expect a lot less from the top top sides, and there will always be statistical anomalies which is bad luck, not the run of the green. That happens. But its a two side game. The opposition isn't playing a scripted game play, they are playing their game as well as they can and going after weaker areas they feel they have an advantage. IMO, RSA did that, played well, and it paid off. If AB's say now, we should have been more ruthless, why didn't they do that? Thats an excuse. If we drop balls more than usual, that can mean the other side is pressuring us, we are taking risks because of that. They have affected our game. I can blame the AB's for not adapting to the way RSA was playing, and I have. RSA created that, AB's did not respond. Maybe they could not, in which case AB's are not to blame. Their side and skill was outplayed by the other side and their skill. But to only blame the losing side isn't how I see it. Of all the factors involved, they fell short, they had the same 80 minutes as the other side. You can blame them for not doing this or that, but a lot of that is a direct effect what the other side took to them. On that they were beaten by a better side, playing better on the day.
This week I expect a 15 point win. RSA's tactics worked, but that's no secret now. They will try other things, we need to nullify them. The last match was a top effort by them strategically and execution, yet that only gave them what is in effect an even score line. RSA aren't that great. They achieved their maximum. If they payed AB's 10 times we win 8 of them. Maybe 9. TAB has them evens at 13.5 points, I feel it will be 15 and a bit more to NZ
tdgeek:Ok, I disagree, that's my opinion. My basis is this. A team, especially in rugby can effect control over the game. Targeting areas they feel will shut down strengths of the opposition. Thats often mentioned. Their lineout sux so lets kick to their line, close to the try line. Fusitua scores on the right wing at will, lets keep the ball away from him, their forwards are too good, lets not take them on, and so on. IMHO thats a big part of team sport, and individual sports. Its up to both sides to target those favourable areas, and try to respond when the opposition is doing the same. Any team or player can have a bad day at the office, Id expect a lot less from the top top sides, and there will always be statistical anomalies which is bad luck, not the run of the green. That happens. But its a two side game. The opposition isn't playing a scripted game play, they are playing their game as well as they can and going after weaker areas they feel they have an advantage. IMO, RSA did that, played well, and it paid off. If AB's say now, we should have been more ruthless, why didn't they do that? Thats an excuse. If we drop balls more than usual, that can mean the other side is pressuring us, we are taking risks because of that. They have affected our game. I can blame the AB's for not adapting to the way RSA was playing, and I have. RSA created that, AB's did not respond. Maybe they could not, in which case AB's are not to blame. Their side and skill was outplayed by the other side and their skill. But to only blame the losing side isn't how I see it. Of all the factors involved, they fell short, they had the same 80 minutes as the other side. You can blame them for not doing this or that, but a lot of that is a direct effect what the other side took to them. On that they were beaten by a better side, playing better on the day.
You can try and psychoanalyse it as many times as you want (and you have over numerous repetitive posts) - you still don't make sense.
It's a basic game, you win or lose. The AB's win more than not, don't try and over complicate it.
clevedon:
For crying out loud. I was responding to a post that said the loser is always to blame.
Sorry if that bothers you. Sorry also that its not allowed to comment here unless its not acceptable to the fan club. Is there a problem if one poster says that you only blame the loser and another poster disagrees? Is that not allowed? I know disagreeing with anything here is a problem as its so fickle and shallow
So my response to his fair question and point is psychoanalysing? Its a discussion, or at least I thought it was, but not here clearly for the obvious fickle fanboy reasons. I considered his opinion of only blame the loser a fair discussion point.
networkn
https://www.stuff.co.nz/sport/rugby/opinion/107558324/all-blacks-midfielders-are-all-chasing-jack-goodhue-the-form-runner
Interesting that this writer thinks that 12 is Crottys best position, I believe it to be 13. SBW is best at 12, but I am unsure where I see Goodhue who I agree with the writer is in probably the best form of any midfielder right now. I feel it would be tough to toss Crotty out, and SBW certainly showed class in the game last week, but for my money you simply can't leave Goodhue out given his compelling performances. He may end up on the bench. SBW is a beast defensively, something he is way under rated in. Goodhue and Crotty also. Some of the tackles Goodhue made during SR made me wonder if he had thors hammer with him. I thought he might have killed a couple of guys they were so thunderous.
The only positions that i understand are 10, 2 & 9.
The rest ... Who knows what they actually do! When they don't have the ball the forwards try to get it by bashing each other while the rest are in some kind of man marking sideways shuffling choreography. When they have the ball some random backs run in some preset ways while the other backs wait and run a second wave, and that's after the forwards have bashed each other up until there's nobody else to bash.
12, 13 in fact are the most mysterious numbers to me. After 8. Maybe 6 & 7 too.
Involuntary autocorrect in operation on mobile device. Apologies in advance.
7 Steals the ball from the other team in rucks and mauls, well at least our one used to. This is something the number 8 does for Australia.
Good luck with scrumaging without 1 and 3 :)
Not much going to be going on in the lineouts without 4 and 5 :)
Well the inside prop is stronger than the outside prop, and they have some kind of a reverse tug of war contest when the ball is fed. Then like the whack the mole game, one prop inevitably pops up and say hi and the referee gets crossed.
The locks bury their heads in between butt cheeks and binds their mates' crotch together for the whack the mole contest. Then they also shout some random codes and magically get lifted to the ball, sometimes also dropped onto their heads when lifters forget to put them down.
But the tactics board must be 99 pages long, the attacking plays and defensive formations are pretty complicated, compared to say golf for example.
I wasn't even aware this event had occurred. What a horrible end to this proud mans Rugby Career.
are you talking about Rob Horne?
Doh didn't post the link!
Handle9
That used to be the case but not really anymore. The laws don't allow it and a big tackle is more likely to create a turnover than a pilfer. McCaw didn't really play that game at the end of his career, he was a very different player from when he first made the All Blacks in the early 2000s
If you look at the Super Rugby Stats the difference between Pocock and Cane was 3 turnovers through the whole tournament.
https://www.foxsports.com.au/rugby/super-rugby/stats/teams
Teams recycle the ball at a rate of greater than 95% now so it's not a skill that is so important anymore. What is important for a flanker is slowing ball down legally and making tackles behind the gain line. This is an article from 2016 but it shows some more advanced thinking than is typically displayed by the mainstream media.
https://www.stuff.co.nz/sport/rugby/all-blacks/82528201/digging-the-data-what-stats-reveal-about-the-all-blacks-no-7-debate
I think the guys doing the 1014 rugby show are doing some of the most interesting and nuanced analysis around and they really bring some interesting stats to the table. They showed when we lost to Australia last year and when we lost to South Africa a couple of weeks ago we lost the battle of the advantage line. We gained a lot less territory per carry than we normally do and that killed our game plan.
That was another really enjoyable test. South Africa have dominated our pack two matches in a row. Their physicality and commitment is really enjoyable and they are playing these matches with a real physical edge. Our line out hasn't really been great and they have won the battle at the ruck.
They are going in with a plan to slow the ball down and they are doing that consistently and mostly legally. They're also creating a lot of traffic on attack and their block players are very very close to the edge of what is legal. I felt that they got away with sheperding in the build up to one of their tries.
I also found Gardeners ruling when Smith threw the ball into an offside player crazy. Whether or not it was deliberate from Smith it was a clear offside. South Africa are going in to create a messy breakdown area which is fine but they should be penalised when they get caught.
All that said the All Blacks showed amazing character and had a dose of luck when Mo'unga missed touch but got it anyway. Great finish and I'm really looking forward to the northern tour.
Handle9: They are going in with a plan to slow the ball down and they are doing that consistently and mostly legally. They're also creating a lot of traffic on attack and their block players are very very close to the edge of what is legal. I felt that they got away with sheperding in the build up to one of their tries.
Another SANZAR game, another completely different interpretation of the rules we've all spent the last ten months playing under. These interpretations almost always seem to give the benefit of the doubt to the team that isn't the All Blacks.
There has been a lot of runners ahead of the ball and clearing out past the rucks just not enforced during the tests, but the Super Rugby TMOs were hot on it. It took 23 minutes for the All Blacks to get a penalty. I think we were warned 12 minutes in? This is despite some other games where teams just repeatedly infringed on their line the whole game and didn't even lose a player. Even more maddening is the constant boring tweets from NH idiots who think the ABs get favouritism from the referees. They wouldn't know fast flowing rugby if it bit them on the bum.
Likewise I recall the Blues losing a game because of a penalty given after a halfback threw the ball into a retiring player. In any other game, that has been a penalty. Even more confusing? Gardener: "You threw it forward into the player". Well call a knock-on then!
Still, glad we won.
frednz
A great comeback that certainly didn't look likely with only a few minutes to go! I think the All Blacks gifted a lot of possession to the Boks by some rather pointless kicking. Why can't they back themselves to hang on to the ball for longer and show that they can make progress without having to kick away possession so often?
So it's either great game or poor refereeing then eh, depending on how you see it!


Photo Journalist Richard Todd is invited to document a grey whale hunt off the coast of Washington state. When a body is found during the dismantling, speculation is that it was simply a fisherman dragged on shore. Someone else thinks it was a sign from God.
When Richard and the body vanish, Richards's wife Sara, a Correctional Investigator at one the state's largest prisons, teams up with the Clallam Sheriff's office and the Makquah tribal Chief, to find him and the unknown man– and ultimately discovers the truth behind the faith of a Nation.


All Hallow's Eve is just around the corner, so naturally we're brewing up some of the most hauntingly beautiful Halloween wedding ideas that will leave you totally spellbound. From voluminous black tulle gowns to floral eye masks, these 31 tricks and treats will continue to wow us even into the afterlife. Expect to see a wide spectrum of colors dancing with noir and bordeau palettes, and prepare yourself for a sweet tooth you did your best to ignore before sweater weather. Let's jump right in, shall we?
Photo by Becky van Straalen Photography with cake by The Sweet Society Co.
A black lace bodice with a smoky gray skirt? This woodland bride absolutely wins fall bridal fashion.
And then there's this statement confection with shadowy mauve and golf foil pops to breathe life into the darkness.
This couple deserves all the awards for expertly hosting a Harry Potter themed wedding. Chocolate frogs at every place setting, suspended lights in the night sky and gold chalices to toast forever with!
An abandoned space sets the perfect mood for this beauty-in-ruins ambiance – and is that a Dutch flower floor decal we see?!
This groom is rocking his burgundy velvet suit jacket. And how bout her gold metal belt? Totally moody chic.
Who needs to gaze at the constellations when you have this galaxy-inspired cake?
A modern take on Halloween, we're pretty bewitched by this whole anthurium-filled scene. With that black printed gown and a dried branch canopy, this look can't be beat!
Are you as addicted to these moody wedding styles as we are? From the dark palettes to the mysterious details, there's no way you could go wrong using these looks as inspiration for your own Halloween soiree. I hope this puts you in the mood for some apple cider and Hocus Pocus – maybe even one of those smoke bath bombs too. 'Till next Wednesday, happy haunting!


At the Universidad Alfonso X el Sabio we offer a Degree in Telematic Engineering based on a committed educational project to train highly qualified professionals.
The degree in Telematic Engineering is structured over four years and trains professionals in the fields of data communications between computers and systems. It involves in-depth study of how computer networks work and the design and programming of products and services, using the current capacities of networks, including mobile devices.
During the first and second year students study basic subjects such as computer systems, the content of telematic systems, and online telematic services. In the last two years of the course, students come into full contact with the reality of the profession, completing their training in areas such as telematic applications, multimedia services, network administration and communication network security.
There is a strong emphasis on practical work. For example, in application programming and development, students learn to develop client/server systems, web services and services based on databases; in electronics, they measure and build automatic systems and programme microcontrollers; in communications networks, they configure network devices, manage communications and configure network services.
Students can use the Communications Network laboratory, where they create and analyse different data communication architectures and protocols; Computer Languages and Systems laboratories, where they use programmes for different subjects such as programming, developing online services or simulating communications networks and services; the Electronics laboratory, where they build and analyse electronic circuits and devices of varying degrees of complexity, and the Electronic Systems laboratory, where they use microprogrammed systems to create electronic systems.
Telecommunications and computing engineers and doctors form the teaching staff for this degree. The lecturers have extensive professional experience in the specific fields they teach, as they work in well-known companies in the sector such as Telefónica de España, Denodo Technologies, EADS, etc.
Students can carry out tutored practical work and experience their future professional field at first hand, thanks to visits to companies as important to the sector as Oracle, Telefónica I+D, Accenture, Astec, etc. Students visit companies and are introduced to the workings of different departments.
Especially in the final years, students work with their lecturers on research tasks and projects, such as projects to simulate intermodal traffic systems, cloud computing management systems and configuration, tracking operators with GPS, etc.
The career opportunities for these graduates may be in companies which implement and develop network communications systems, telephony, data and TV operators, telecom engineering consultants, companies which design, develop and implement software systems and services, or in developing internet or mobile phone services.


The kids and I had an excellent time at the Minnesota Children's Museum in Rochester last weekend. We purchased special tickets to have breakfast with Curious George. The same exhibit had been at the museum in St. Paul a few years ago and we took Benjamin there to see it when he was about Lucy's age.
Lucy really enjoys watching George, too. Her love of giant costumed characters has not changed since we saw Sesame Street live and she didn't hesitate at all to run and give George multiple hugs!


Kohler 1 Handle 3 Hole 8 1 2inch Reach Kitchen Faucet Chrome K 15171 F G $185.54 Handle Style: Lever. Ceramic disc valve included.. 1.5 GPM (Gallons Per Minute). Add style and functionality to everyday tasks with the durable Coralais kitchen sink faucet. . This faucet features a swing spout to accommodate pots and pans, while a single lever handle and onepiece ceramic valve offer precise water temperature and volume control.. Single lever handle is simple to use and makes adjusting water temperature easy.. Swing spout offers increased clearance for filling pots and cleaning.. Temperature memory allows faucet to be turned on and off at the temperature set during prior usage.. Hightemperature limit setting for added safety.. Ceramic disc valves exceed industry longevity standards, ensuring durable performance for life.. Premium metal construction.. Kohler finishes resist corrosion and tarnishing.. Singlehole or threehole installation (escutcheon included).. Includes flexible supply lines.. This product meets water savings requirements for California Energy Commission (CEC), CALGreen, and Colorado SB 14103.. ADA compliant.. ASME A112.18.1/CSA B125.1. NSF/ANSI 61. NSF/ANSI 372. All applicable US Federal and State material regulations. DOE Energy Policy Act 1992. ICC/ANSI A117.1. CSA B651.
Artifacts single hole kitchen sink faucet with joystick handle. Composed Tall single handle bathroom sink faucet with joystick handle. Composed Tower single handle bathroom sink faucet with 10 1 pull out spray spout. Artifacts hole kitchen sink faucet with joystick handle. KOHLER Kohler 1 Handle 3 Hole 8 Mistos Single Handle Standard Kitchen Faucet in. Composed Tall single handle bathroom sink faucet with pure handle Barclay Marble Single Basin Apron Front Kitchen Sink Galala Fsmsb5014 Mpga. 1 or Hole 1 Hole. Number of Handles. Select This Item. Hole installation Pop up drain included Shop the Worth Collection in Vibrant.
Single hole or hole kitchen sink faucet with 1 1 swing spout and matching finish two function sidespray with Sweep and BerrySoft spray Victorian spout design. KOHLER Rubicon Single Hole Single Handle Bathroom Faucet in Vibrant Brushed Nickel Progress Lighting Pro Replay 2 Light Semi Flush Convertible Nickel P3424 09. Margaux single hole bathroom sink faucet with joystick handle. Artifacts hole kitchen sink faucet with 1 1 swing spout and matching finish two function sidespray with Sweep and BerrySoft spray Victorian spout design.
Composed Tall single handle bathroom sink faucet with 1 1 swing spout and matching finish two function sidespray with Sweep and BerrySoft spray Victorian spout design. Margaux single hole bathroom sink faucet with lever handle and spout. Composed Tower single handle bathroom sink faucet with joystick handle Progress Lighting Ashbury Five Light Chandelier Light Silver Ridge P4462 134.
Convenient to install. Bring a wonderful touch to your bathroom with this KOHLER Katun Deck Mount Tub Faucet in Brushed Nickel Progress Lighting Inspire Six Light Chandelier Light Brushed Nickel P4739 09. Sweep and BerrySoft spray Victorian spout design. Offers convenience for washing bulky items while a single lever handle allows you to. Widespread Handle. KOHLER Worth in.
Kohler K T1 1 BGD Purist Two Handle Wall Mount Lavatory Faucet Trim with 1 Spout and Cross Handles Valve Not Included Vibrant Moderne Brushed GoldPurist faucets combine simple architectural forms with sensual design lines and careful detailing. Margaux single hole bathroom sink faucet with 1 1 swing spout and matching finish two function sidespray with Sweep and BerrySoft.
You Can Only Compare Products. Artifacts hole kitchen sink faucet with 1 1 swing spout and matching finish two function sidespray with Sweep and BerrySoft. Hole installation Pop up drain included Shop the Rubicon Collection in.
Artifacts single hole kitchen sink faucet with 10 1 pull out spray spout. Products from.
Sleek modern appearance to your decor with KOHLER Devonshire Widespread Low Arc Bathroom Faucet in Polished. Product description. Please remove one in order to allow adding this new compare to the list.


text:
Adult Child (o veces como Adult/Child) es un álbum de estudio inédito de la banda de rock estadounidense The Beach Boys. Como Love You, es prácticamente un proyecto en solitario de Brian Wilson junto a otros miembros del grupo que sirven principalmente como vocalistas adicionales. Después de que fuera rechazado por Reprise Records, la banda editó M.I.U. Album que en su lugar una lista de canciones prácticamente renovada. Unas pistas proyectadas para Adult Child fueron editadas en álbumes posteriores y compilaciones. Actualmente, el álbum está disponible solo a partir de grabaciones piratas.

Stylus Magazine resume concisamente la obra es: "un disco de Brian al estilo Sinatra. Arreglos como de las grandes bandas de las Vegas, covers que parecían de bronce, algunas canciones escritas con la esperanza de que el propio Presidente podría cantarlas. El sello escuchó y probablemente lo rechazó antes de que comenzara la pista 2". A pesar de su estatus esotérico inédito dentro del catálogo de los Beach Boys, el álbum ha desarrollado un culto leve entre los seguidores aficionados y músicos.

Antecedentes
Desde un principio, el álbum debía estar compuesto enteramente de tomas descartadas registradas durante las sesiones de 15 Big Ones de 1976 y Love You se asoció con material que se origina de 1965. Después del lanzamiento de Love You en abril de 1977, el grupo cayó en una disputa en torno de la dirección de la banda, lo que casi provoca la ruptura de la banda. Concebido como una secuela de Love You, y mezcla para un nuevo álbum titulado Adult Child, fue completado por los Beach Boys con Brian Wilson en calidad de productor.

Lo mismo ocurre con "Good Time" en Love You, algunas pistas de Adult Child eran tomas descartadas procedentes de anteriores álbumes de los Beach Boys. Las sesiones para el álbum fueron el 19 de enero de 1977, solo cinco días después de terminado el montaje de Love You. Al mismo tiempo, Dennis Wilson trabajó en su álbum en solitario Pacific Ocean Blue, que no sería editado hasta el 22 de agosto de ese mismo año. Según el gerente de la banda Stan Love -hermano menor de Mike Love- cuando Mike escuchó las grabaciones de los demos aproximados de Adult Child repletos de arreglos de swing, se volvió hacia Brian y le preguntó: "¿Qué carajo estás haciendo?". Fue proyectado para otoño de 1977, pero el álbum fue rechazado por Reprise Records por no ser comercialmente viable.

Música y letras
Brian compuso, escribió y cantó en la mayoría de las canciones de Adult Child, ocasionalmente sus hermanos y compañeros de banda Carl y Dennis hicieron voces. De manera excepcional, Brian incluyó covers del grupo de "Deep Purple", "On Broadway", y la canción folk tradicional "Shortenin' Bread", con la cual Brian se había obsesionado por varios años. Dick Reynolds fue el encargado para los arreglos en cuatro pistas. Anteriormente, en 1964, Reynolds hizo los arreglos de cuerdas para The Beach Boys' Christmas Album, y de The Four Freshmen los ídolos de Brian y Frank Sinatra.

Las letras del álbum reflejan sobre todo pequeños detalles de la vida de Brian durante la década de 1970. Algunas canciones se centran en la condición física, la alimentación saludable, y la ecología, mientras que "Lines" se trata simplemente de esperar en línea para ver una película. Cooper Al describir "Hey Little Tomboy", que era un descarte de Love You, Brian dijo "se trata de una niña que es una especie de marimacho, y este tipo la convence para convertirse en una chica bonita, y por supuesto ella se convierte poco a poco en una chica bonita, empieza a afeitar sus piernas, a usar shorts, usa lápiz labial y maquillaje. Así que ella es un poco tomboy... Nos sentimos muy contentos con ella".

Lanzamiento
El álbum ha sido lanzado a través de numerosas ediciones piratas, pero está oficialmente disponible, aunque no en su totalidad como un álbum sino fragmentado. "Hey Little Tomboy" aparece ligeramente modificado en M.I.U. Album. "Shortenin' Bread" se trataba de una canción tradicional de folk que a Brian le gustaba mucho, fue modificada y apareció en L.A. (Light Album) (1979). "Games Two Can Play", "It's Over Now", "H.E.L.P. Is on the Way" y "Still I Dream of It" fueron editadas en el box set Good Vibrations: Thirty Years of The Beach Boys (1993). Un Demo de piano alternativo de "Still I Dream of It" fue incluido en I Just Wasn't Made for These Times (1995), álbum solista de Brian Wilson.

Lista de canciones
Adult Child se mezcló y montó en el siguiente orden, el 27 de junio de 1977, pero se informa que "Shortenin' Bread" y "It's Over Now" pueden haber sido eliminadas cinco días más tarde: "It's Trying to Say" también se conoce como "Baseball's On". Las grabaciones piratas, en algunas ediciones incluyen grabaciones adicionales hechas por el grupo entre los años 1960 y 1980.

Personal
The Beach Boys
 Al Jardine — voz, armonías y coros.
 Mike Love — voz, armonías y coros.
 Brian Wilson — voz, armonías y coros, productor.
 Carl Wilson — voz, armonías y coros.
 Dennis Wilson — voz, armonías y coros.

Músicos de sesión y plantilla de producción
 Dick Reynolds — arreglos
 Marilyn Wilson — voz, armonías y coros

Referencias

Álbumes inéditos de The Beach Boys
Álbumes de Brian Wilson
Álbumes inéditos
Álbumes no oficiales
Álbumes pirata de The Beach Boys

redpajama_set_name: RedPajamaWikipedia


text:
Q: Sub divide a dictionary into smaller parts I am trying to sub divide a dictionary into smaller parts. My approach works, I am just wondering if there is a more efficient way of doing it. For the sake of the example, the dictionary has 10 elements but my code can have up to 1000 and would be in batches of 50 to which I am passing to an api.
My Questain is there a more efficient way of doing this...?
int divideamount = 2;

Dictionary<string, string> dictionary = new Dictionary<string, string>();
dictionary.Add("cat1", "cat");
dictionary.Add("dog2", "cat");
dictionary.Add("cat3", "cat");
dictionary.Add("dog4", "cat");
dictionary.Add("cat5", "cat");
dictionary.Add("dog6", "cat");
dictionary.Add("cat7", "cat");
dictionary.Add("dog8", "cat");
dictionary.Add("cat9", "cat");
dictionary.Add("dog10", "cat");

var divided_dictionary
    = dictionary.Select((value, index) => new { Index = index, Value = value })
                .GroupBy(x => x.Index / divideamount)
                .Select(g => g.Select(x => x.Value).ToDictionary(x => x.Key, x => x.Value))
                .ToList();

foreach (Dictionary<string, string> division in divided_dictionary)
{
    // do some work
}

Thanks in advance for any help or comments.

A: You can use Partition method from moreLINQ library.
var divided_dictionary
    = dictionary.Partition(divideamount)
                .Select(x => x.ToDictionary(i => i.Key, i => i.Value));

I wrote a blog post about partitioning collections using LINQ a while ago. You may find it useful: Partitioning the collection using LINQ: different approaches, different performance, the same result.

redpajama_set_name: RedPajamaStackExchange


On tap at Poor Henry's, enticing hibiscus-honeyed tripel stays soft on the tongue as sweet fruited malts gain resilience above delicate floral hops. Red apple juicing spreads across red cherry tang, raspberry tartness, tropical passionfruit-mango-guava conflux and spritzy citric nuances while bustling 10% ABV remains hidden. Perfectly centered hibiscus adjunct allows subtle rose petal, lilac and jasmine undertones to tweak fabulous fruitful finish.


Discussion in 'Modding' started by MrBadidea, 5 Aug 2002.
I have a PC-70 and I'm very happy with it, fantastic build quality and plenty of room inside for all your bits and bobbs.... the 410 seems like a very nice case as well but at almost twice the price is it worth it or arent you better of buying the pc-70 and lots of other little bits.. ?
I dont think you would be disaspointed if you do get a pc-70.
i <3 my pc 71, and that coolermaster is just plain ugly.
the ATC-410 is a really nice case.
neither get a cardboard box and give me the money. I want a cm because everyone i know who lives near me has a lian li and they just looking the norm now.
I thought you bought a case because that was the one you wanted?
coolermasters are built much better than the lians, you learn that in the basics. lians are really nice, just that coolermasters are better.
I wub them both just as much- its now just a case of which one fits meh needs best.
I leik the fact that with a few simple swaps the 410 can be converted into a Rackmount- something that I may have to do in the future due to the sheer number of computers in meh room- wack up some rackmountage and free up some floor space.
Have you actually seen these cases in the flesh? If notthen I suggest you do. I used to think the LL looked dull and boring until I actually saw one for real.
Have you considered the cost? The coolermaster is £100 quid more expensive than the lian-li. Think of all the nice mods you could do for that amound of money.
frontpanels are good as then you don't have to stealth/paint all your drives.
My PC70-USB is awesome, but I dont know what luck you would have in anodizing the inside of the case. You would have to completely disassemble the case, including popping all the rivets. Plus, the anodizing could warp the thin material, leading to an illfitting reconstruction. I work in the metal field and had similar thoughts when I bought my case, but the realized that it would be more trouble than what it is worth.
i managed to do it one handed while taking pics with my digi cam.
Go for it. If it turns out well, I may even risk it, but right now, Im just too wimpy to take that chance. make sure you post some pics when youy get it done. Ill print them out and motivate myself to risk the demise of my $250 case.


Learn English irregular verb past participles.
You should no all these words for good English language.
They are common, modern words that everyone knows and uses.
Read or speak or listen - good for teachers, students of English language and teachers.
Soyez le premier à démarrer une discussion à propos de Past Participle English Demo dans nos forum !


text:
For Prompt and
Friendly Service Call:
Serving Our Community's HVAC and
Building Maintenance Needs for Over Ten Years!
eminence Maintenance & Building Services, LLC
Service Calls
Service Maintenance Plans
Commercial Service Plan
Residential Service Plan
Value. Commitment. Integrity.
The key ingredient to the success of Eminence Maintenance & Building Services is the strength of our team and the emphasis we place on the three words above: value, commitment, and integrity. By keeping these three words in the forefront of our approach, we ensure that each customer contact is a stellar experience. Read below to learn more about how this focus is reflected in our exemplary team.
noticed a recurring theme from customers and in her own experiences, and she realized that there was an opportunity to develop a service company who could achieve two goals: The first was to provide competent, exemplary service where the problem is handled correctly on the first contact. The second goal was to provide exemplary customer service during each phase of the service interaction, from the first phone call to the end of the service visit. Out of these two goals, Eminence Maintenance & Building Services was born, and over the past ten years Eminence has built a reputation upon placing these two goals at the forefront of every connection we make. We view these two goals as more than just a lucid dream, but a strategic business model. By completing each job to perfection, it increases customer satisfaction and allows our technicians to enjoy their work. Our focus on customer satisfaction gives us the benefit of enjoying a high rate of customer returns and referrals. This not only allows our company to maintain a healthy stance in the industry, but it also creates a family-like atmosphere when dealing with clients we've known for years. Wait no further - contact us today and experience the Eminence Maintenance & Building Services difference for yourself.
Eminence Maintenance & Building Services, LLC, was conceptualized out of a necessity to fill a niche in the service industry. As a tenured professional in the private sector, our founder
At Eminence Building & Maintenance Services, LLC, we strive to fill our ranks with individuals who understand and promote our core values. We are proud of our workforce, which consists of a diverse makeup of individuals who are passionate about putting each customer first. Our employee base is made up of individuals from a wide range of backgrounds and experiences in the areas of HVAC, building maintenance, project management, sales, marketing, strategic planning, sales, marketing, and customer service to name a few. We believe that when we treat each employee with value and care, they will pass these values on to each client and customer alike. For over a decade, this philosophy has enabled EMBS to enlist the #1 building maintenance workforce in the region, and we look forward to hearing from you so that you can experience the difference at Eminence.
COMPANY VISION
The mission of Eminence Maintenance & Building Services is to provide professional quality facility services to each customer, while keeping in mind the crucial need for cooling and cleanliness at your place of business.
Eminence Maintenance & Building Services was conceptualized on a solid foundation and sound core values that will forever guide this company: Exceptional Service; Promptness; Talent in Workforce; Integrity; Polite Atmosphere; and Always Working to Establish a Delightful Company to Client Relationship.
Sina Avery
President & Founder
Ms. Sina Avery, President & CEO of Eminence Maintenance & Building Services, LLC, has been instrumental in leading the company in a positive direction. As a female minority business owner, she fully understands the need to treat each client as if it is the only project she has. "I know that there is a lot of competition in the building maintenance industry, and that's why I make sure that we go above and beyond for each customer we service", says Sina. Her work ethic has been the driving force behind EMBS' high rate of customer satisfaction and return.
Ms. Avery is a graduate of Rutledge of Washington School of Business, and holds a certification in Data Entry/Administrative Assistance. She boasts an impressive resume which includes over 25 years in the private sector; she also has a strong background in sales and marketing. Sina is very passionate about her entrepreneurial endeavors, and believes that EMBS has not yet reached its full potential. "We have experienced consistent year over year growth, and I am excited about the many opportunities we have before us in the upcoming year", said Sina. There is no doubt that she will continue to drive Eminence Building & Maintenance Services, LLC to the pinnacle of success.
Antonio Avery
Managing Member
Deryk Beck
Lead Project Manager
Hear What Our Clients Say About Us
The staff at Eminence Maintenance & Building Services, LLC is a group of hand-picked individuals who bring a unique set of skills and expertise to our organization. We are confident that our team is well equipped to handle your building & maintenance service needs with precision and stellar execution. Learn more about what our clients are saying, and please don't hesitate to Contact us directly with any concerns. We look forward to making the team at Eminence Building & Maintenance services into your team!
Mr. Deryk Beck, Lead Project Manager of Eminence Maintenance & Building Services, LLC, is known for his hard work and his zealous pursuit of success. He attributes his success to his philosophy of always being accountable. "If you point the finger, 4 fingers always point back at you, so I try to be accountable at every level and never pass the buck", says Deryk. He brings a wealth of knowledge and experience to Eminence, with over 25 years of experience in the HVAC industry.
Mr. Beck is a graduate of Montgomery College and received his certification for Electrical Mechanical Apprenticeship. Deryck's areas of expertise includes his multiple stints as Project Superintendent for new construction projects, HVAC and plumbing with building properties of over 300,000 square feet, installing HVAC ducts, ventilator fans, exhaust fans, setting Lievert units, and various other pieces of HVAC equipment. Mr. Beck is also proficient at supervising large crews of various sizes and ordering and maintaining equipment and materials for large projects.
Mr. Antonio Avery, Managing Member of Eminence Maintenance & Building Services, LLC, offers a welcome compliment to the EMBS management team. He takes pride in his ability to help steer the company in the positive trajectory it has experienced over the past several years. Mr. Avery has over 30 years .
In addition to his tenure in the industry, Mr. Avery is a graduate of National Association of Power Engineers with a certificate of completion in Steam Boiler Operations and Master HVAC first class. His experience has led him to work directly with major private, commercial, and government establishments as the Lead Engineer for companies including Nations Bank, Bank of America, and Baxter Pharmaceuticals to name a few. He has also maintained and operated high pressure steam boilers, centrifugal chillers, rooftop unit replacement services, and VAV control boxes and building energy control systems. Antonio is very excited about the direction of the company, and predicts that EMBS will continue to evolve in its product and services line over the next decade.
We look forward to Servicing Your Needs...
Get In Touch to Learn More.
Eminence Maintenance & Building Services is the premier source in Maryland, Washington, DC, and Northern Virginia. We specialize in preventative maintenance contracts, system installations, and building maintenance repair services.
For immediate assistance:
Eminence Maintenance &
Building Services, LLC
4562 Beech Road
(888) 626-2066 - Toll Free
We gladly accept cash, credit cards, and personal checks.
Certifications &
Govt. Contracting
© 2021 by Eminence Maintenance & Building Services
Design & Concept by dcbizpros.com