Utils.normalize(dist); return dist;
double sum = Utils.sum(dist); if (sum <= 0) { for (int j = 0; j < dist.length; j++) { dist[j] = 1.0 / (double)dist.length; } return dist; } else { Utils.normalize(dist, sum); return dist; }
  public double [] distributionForInstance(Instance instance) throws Exception {            double [] dist = new double[m_HyperPipes.length];    for (int j = 0; j < m_HyperPipes.length; j++) {      dist[j] = m_HyperPipes[j].partialContains(instance);    }    Utils.normalize(dist);    return dist;  }