public synchronized void normalizeBSC(){
  if (!isSparse)   this.bitSet=concludeVote();
  votingRecord=new ArrayList<FixedBitSet>();
  votingRecord.add((FixedBitSet)bitSet.clone());
  totalNumberOfVotes.set(1);
  tempSet=new FixedBitSet(dimension);
  minimum=0;
}

public synchronized void normalizeBSC ( ) { if ( ! isSparse ) this . bitSet = concludeVote ( ) ; votingRecord = new ArrayList < FixedBitSet > ( ) ; votingRecord . add ( ( FixedBitSet ) bitSet . clone ( ) ) ; totalNumberOfVotes . set ( 1 ) ; tempSet = new FixedBitSet ( dimension ) ; minimum = 0 ; }
faster normalization according to the binary spatter code ' s " majority " rule
