Package stallone.api.ints

Examples of stallone.api.ints.IIntArray

185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
        return (res/(double)centers.size());
    }

    public IDoubleArray membershipToState(IClustering crisp, int state)
    {
        IIntArray clusterIndexes = crisp.getClusterIndexes();
        IDoubleArray res = Doubles.create.array(clusterIndexes.size());
        for (int i=0; i<res.size(); i++)
        {
            if (clusterIndexes.get(i) == state)
                res.set(i, 1);
            else
                res.set(i, 0);
        }
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
        IClustering cluster = Cluster.util.densityBased(obscat, nstates);

        System.out.println("done.");

        IIntArray ci = cluster.getClusterIndexes();
        IDoubleArray[] res = new IDoubleArray[nstates];
        for (int state=0; state<nstates; state++)
        {
            IParameterEstimator estimator = Statistics.create.parameterEstimatorGaussian1D();
            res[state] = estimator.estimate(obscat, Cluster.util.membershipToState(cluster, state));
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
    }

    public IIntArray giantComponent(IDoubleArray P)
    {
        List<IIntArray> C = connectedComponents(P);
        IIntArray largest = C.get(0);
        int size = C.get(0).size();
        for (int i=1; i<C.size(); i++)
        {
            if (C.get(i).size() > size)
            {
                largest = C.get(i);
                size = largest.size();
            }
        }
        return largest;
    }
View Full Code Here
130
131
132
133
134
135
136
137
    }

    public IDoubleArray estimateCmilestoning(IIntArray traj, Iterable<IIntArray> cores, int lag)
    {
        MilestoningFilter filter = new MilestoningFilter(cores);
        IIntArray filteredTraj = filter.filter(traj);
        return estimateC(filteredTraj, lag);
    }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        visited[s] = true;

        while (todo.size() > 0)
        {
            int v = ((Integer) todo.remove(0)).intValue();
            IIntArray neighbors = g.getNeighbors(v);
            for (int i = 0; i < neighbors.size(); i++)
            {
                int neighbor = neighbors.get(i);
                //System.out.println(v+":"+distances[v]+" -> "+adjList[v][i]+":"+distances[adjList[v][i]]);
                if (!visited[neighbor])
                {
                    distances[neighbor] = distances[v] + 1;
                    predecessors[neighbor] = v;
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
    @Override
    public IIntArray load()
    {
        //System.out.println("loading "+filename+" size = "+size()+" firstTime = "+times.get(0));
        IIntArray res = Ints.create.array(size());

        int firstTime = times.get(0);
        int currentTime = times.get(0);
        int lastData = data.get(0);
        res.set(currentTime-firstTime, lastData);

        for (int i=1; i<times.size(); i++)
        {
            while(currentTime < times.get(i))
            {
                //System.out.println(i+" "+currentTime+"\t"+firstTime+"\t"+(currentTime-firstTime)+"\t"+times.get(i));
                res.set(currentTime-firstTime, lastData);
                currentTime++;
            }
            if (currentTime == times.get(i))
            {
                lastData = data.get(i);
                res.set(currentTime-firstTime, lastData);
                currentTime++;
            }
        }
        return res;
    }
View Full Code Here
184
185
186
187
188
189
190
191
192
193
    {
        int N = dtraj.size();
        List<IIntArray> res = new ArrayList();
        for (int s = 0; s < tau; s += dt)
        {
            IIntArray I = intsNew.arrayRange(s, N, tau);
            res.add(ints.subToNew(dtraj, I));
        }
        return res;
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
            {
                if (!Ints.util.contains(target, j) && A.get(j,j) == 0)
                    zeros.append(j);
            }

        IIntArray nonzeros = Ints.util.removeValueToNew(Ints.create.listRange(0, A.rows()), zeros);

        // clean matrix
        IDoubleArray Aclean = A.view(nonzeros.getArray(), nonzeros.getArray());

        // rhs
        IDoubleArray b = Doubles.create.array(A.rows());
        for (int i=0; i<b.size(); i++)
            b.set(i, -1);
        for (int i=0; i<target.size(); i++)
            b.set(target.get(i), 0);

        // clean vector
        IDoubleArray bclean = Doubles.util.subToNew(b, nonzeros);
        // Attention: we had done the following here... does this make sense??
        // int[] tmp = {0};
        // DoubleMatrix2D Bclean = B.viewSelection(nonzeros, tmp);

        IDoubleArray X = Algebra.util.solve(Aclean, bclean);

        // reshuffle x into full vector
        this.mfpts = Doubles.create.array(T.rows(), Double.NaN);
        for (int i=0; i<nonzeros.size(); i++)
            mfpts.set(nonzeros.get(i), X.get(i));
    }
View Full Code Here
314
315
316
317
318
319
320
321
322
323
324
        {
            try
            {
                loader.close();

                IIntArray res = loader.load();

                itraj++;
                if (itraj < numberOfSequences())
                {
                    loader.setSource(sources.get(itraj));
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
87
88
89
    {
        if (!(o instanceof IIntArray))
        {
            return (false);
        }
        IIntArray oo = (IIntArray) o;
        for (int i = 0; i < oo.size(); i++)
        {
            if (oo.get(i) != this.get(i))
            {
                return (false);
            }
        }
        return (true);
View Full Code Here
TOP

Related Classes of stallone.api.ints.IIntArray

  • stallone.api.cluster.ClusterUtilities
  • stallone.api.discretization.DiscretizationFactory
  • stallone.api.doubles.DoubleUtilities
  • stallone.api.graph.GraphUtilities
  • stallone.api.hmm.HMMFactory
  • stallone.api.mc.MarkovModelUtilities
  • stallone.api.mc.MarkovModelUtilitiesTest
  • stallone.api.mc.TPT
  • stallone.cluster.CompactRandomClustering
  • stallone.cluster.MilestoningFilter
    • Copyright © 2018 www.massapicom. 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.