private double[][] calAvailability(double[][] rmatrix) {
        double[][] amatrix = new double[dNum][dNum];
        for (int i = 0; i < dNum; i++) {
            for (int k = 0; k < dNum; k++) {
                //首先计算max(0,R(j,k))对于j的求和，其中j!=i且j!=k
                double maxSum = 0;
                for (int j = 0; j < dNum; j++) {
                    if (j != i && j != k) {
                        maxSum += 0 > rmatrix[j][k] ? 0 : rmatrix[j][k];
                    }
                }
                double temp = rmatrix[k][k] + maxSum;
                if (i != k) {
                    amatrix[i][k] = 0 < temp ? 0 : temp;
                } else {
                    amatrix[i][k] = maxSum;
                }
                //TODO 进行收敛阻尼处理
//                amatrix[i][k] = (1 - lam) * amatrix[i][k] + lam * Amatrix[i][k];
            }
        }
        return amatrix;
    }