Package cern.colt.matrix

Examples of cern.colt.matrix.DoubleMatrix2D.columns()

1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
    double score_CC=1./2,score_BB=(2+score_CC*k)/4, score_AA=(1+k*score_BB)/2;
    {
      GDLearnerGraph ndGraph = new GDLearnerGraph(gr,LearnerGraphND.ignoreNone, false);
      LSolver solver = ndGraph.buildMatrix(threadNumber);
      DoubleMatrix2D Ax=solver.toDoubleMatrix2D();
      Assert.assertEquals(6,Ax.columns());
    }
    Set<PairScore> pairsSet = addAllPermutations(gr.pairscores.chooseStatePairs(PAIR_INCOMPATIBLE*2,10,threadNumber,null,filter, new NonRandomRandom()));
    Set<PairScore> exp = addAllPermutations(Arrays.asList(new PairScore[]{
        new PairScore(gr.findVertex("A"),gr.findVertex("A"),(int)(10*score_AA),1),
        new PairScore(gr.findVertex("A"),gr.findVertex("B"),10*PAIR_INCOMPATIBLE,1),
 
View Full Code Here
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
      int indexRow = findIndexOf(incompatiblePairs, row);
      assert indexRow >= 0;
      PairScore pairRow = getPairScore(indexRow, 0,0);
     
      boolean firstValue = true;
      for(int column = 0;column < matrix.columns();++column)
      {
        double value = matrix.getQuick(row, column);
        if (value != 0) // this is not a computed value, hence it is reasonable to compare this double to zero in this way.
        {
          int indexColumn = findIndexOf(incompatiblePairs, column);
View Full Code Here
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
      int indexRow = findIndexOf(incompatiblePairs, row);
      assert indexRow >= 0;
      PairScore pairRow = getPairScore(indexRow, 0,0);
     
      boolean firstValue = true;
      for(int column = 0;column < matrix.columns();++column)
      {
        double value = matrix.getQuick(row, column);
        if (value != 0) // this is not a computed value, hence it is reasonable to compare this double to zero in this way.
        {
          int indexColumn = findIndexOf(incompatiblePairs, column);
View Full Code Here
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
    double score_CC=1./2,score_BB=(2+score_CC*k)/4, score_AA=(1+k*score_BB)/2;
    {
      GDLearnerGraph ndGraph = new GDLearnerGraph(gr,LearnerGraphND.ignoreNone, false);
      LSolver solver = ndGraph.buildMatrix(ThreadNumber);
      DoubleMatrix2D Ax=solver.toDoubleMatrix2D();
      Assert.assertEquals(6,Ax.columns());
    }
    Set<PairScore> pairsSet = addAllPermutations(gr.pairscores.chooseStatePairs(PAIR_INCOMPATIBLE*2,10,ThreadNumber,null,filter, new NonRandomRandom()));
    Set<PairScore> exp = addAllPermutations(Arrays.asList(new PairScore[]{
        new PairScore(gr.findVertex("A"),gr.findVertex("A"),(int)(10*score_AA),1),
        new PairScore(gr.findVertex("A"),gr.findVertex("B"),10*PAIR_INCOMPATIBLE,1),
 
View Full Code Here
886
887
888
889
890
891
892
893
894
895
896
    double score_CC=1./2,score_BB=(2+score_CC*k)/4, score_AA=(1+k*score_BB)/2;
    {
      GDLearnerGraph ndGraph = new GDLearnerGraph(gr,LearnerGraphND.ignoreNone, false);
      LSolver solver = ndGraph.buildMatrix(ThreadNumber);
      DoubleMatrix2D Ax=solver.toDoubleMatrix2D();
      Assert.assertEquals(6,Ax.columns());
    }
    Set<PairScore> pairsSet = addAllPermutations(gr.pairscores.chooseStatePairs(PAIR_INCOMPATIBLE*2,10,ThreadNumber,null,filter));
    Set<PairScore> exp = addAllPermutations(Arrays.asList(new PairScore[]{
        new PairScore(gr.findVertex("A"),gr.findVertex("A"),(int)(10*score_AA),1),
        new PairScore(gr.findVertex("A"),gr.findVertex("B"),10*PAIR_INCOMPATIBLE,1),
 
View Full Code Here
784
785
786
787
788
789
790
791
792
793
794
      int indexRow = findIndexOf(incompatiblePairs, row);
      assert indexRow >= 0;
      PairScore pairRow = getPairScore(indexRow, 0,0);
     
      boolean firstValue = true;
      for(int column = 0;column < matrix.columns();++column)
      {
        double value = matrix.getQuick(row, column);
        if (value != 0) // this is not a computed value, hence it is reasonable to compare this double to zero in this way.
        {
          int indexColumn = findIndexOf(incompatiblePairs, column);
View Full Code Here
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
    double score_CC=1./2,score_BB=(2+score_CC*k)/4, score_AA=(1+k*score_BB)/2;
    {
      GDLearnerGraph ndGraph = new GDLearnerGraph(gr,LearnerGraphND.ignoreNone, false);
      LSolver solver = ndGraph.buildMatrix(threadNumber);
      DoubleMatrix2D Ax=solver.toDoubleMatrix2D();
      Assert.assertEquals(6,Ax.columns());
    }
    Set<PairScore> pairsSet = addAllPermutations(gr.pairscores.chooseStatePairs(PAIR_INCOMPATIBLE*2,10,threadNumber,null,filter, new NonRandomRandom()));
    Set<PairScore> exp = addAllPermutations(Arrays.asList(new PairScore[]{
        new PairScore(gr.findVertex("A"),gr.findVertex("A"),(int)(10*score_AA),1),
        new PairScore(gr.findVertex("A"),gr.findVertex("B"),10*PAIR_INCOMPATIBLE,1),
 
View Full Code Here
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
      int indexRow = findIndexOf(incompatiblePairs, row);
      assert indexRow >= 0;
      PairScore pairRow = getPairScore(indexRow, 0,0);
     
      boolean firstValue = true;
      for(int column = 0;column < matrix.columns();++column)
      {
        double value = matrix.getQuick(row, column);
        if (value != 0) // this is not a computed value, hence it is reasonable to compare this double to zero in this way.
        {
          int indexColumn = findIndexOf(incompatiblePairs, column);
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
      BufferedWriter writer =
        new BufferedWriter(new FileWriter(filename));
      DoubleMatrix2D matrix = GraphMatrixOperations.<V,E>graphToSparseMatrix(graph,
          mWeightKey);
      for (int i=0;i<matrix.rows();i++) {
        for (int j=0;j<matrix.columns();j++) {
          writer.write(String.format("%4.2f ", matrix.getQuick(i,j)));
        }
        writer.write("\n");
      }
      writer.close();
View Full Code Here
338
339
340
341
342
343
344
345
346
347
348
    {
        DoubleMatrix2D temp = GraphMatrixOperations.graphToSparseMatrix(G,
                edgeWeights);
        for (int i = 0; i < temp.rows(); i++)
        {
            for (int j = 0; j < temp.columns(); j++)
            {
                double value = -1 * temp.get(i, j)
                        + stationaryDistribution.get(j);
                if (i == j)
                    value += 1;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.