Examples of Node

Examples of de.tuclausthal.informatik.winf.mobileagents.p2p.Node

143
144
145
146
147
148
149
150
151
152
153
//        String filename = this.po.PurpleXferGetFilename(sig.a);
        String localpath = this.po.PurpleXferGetLocalFilename(sig.a);
        String sender = this.po.PurpleXferGetRemoteUser(sig.a);
        System.out.println("Xfer id " + sig.a + ", local filename " + localpath
                + ", sender " + sender);
        Node from = this.getNode(sender);
       
       
        if (this.deliverAgent(fh.unpackFromFile(localpath), from) == this.REPLY_ERROR) {
            System.out.println("Error unpacking agent");
            System.out.println("  Xfer id: " + sig.a);
View Full Code Here

Examples of diva.graph.modular.Node

129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
                g = factory.createGraph();
                root = (CompositeNode) g.getRoot();
            }

            public void run() throws Exception {
                Node first = g.createNode(null);
                g.addNode(this, first, root);

                for (int i = 1; i < 32; i++) {
                    Node n = g.createNode(null);
                    g.addNode(this, n, root);

                    Edge e = g.createEdge(null);
                    g.connectEdge(this, e, first, n);
                }
View Full Code Here

Examples of dk.brics.string.flow.Node

141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
                    s.visitBy(this); // visit each defined variable (including aliases) for each statement
                    if (dv.defines(s, v)) {
                        trans_map.put(s, map.get(s).get(v));
                    }
                    if (vi.isTaint()) {
                        Node n = map.get(s).get(v);
                        if (n != null) {
                            n.setTaint(true);
                        }
                    }
                }
            }
        }

        for (Map<Variable, Node> vmap : map.values()) {
            for (Variable v : vmap.keySet()) { // TODO: inefficient, use entrySet iterator instead
                Node n = vmap.get(v);
                n.setTaint(v.isTaint());
            }
        }
       
        // create field nodes
        for (Field field : app.getFields()) {
View Full Code Here

Examples of dk.brics.xact.Node

111
112
113
114
115
116
117
118
119
120
121
    }

    @Override
    public void startElement(String uri, String localname, String name, Attributes attrs) {
        Origin origin = getOrigin();
        Node n;
        if (uri.equals(XMLParser.XACT_NAMESPACE)) {
            if (localname.equals("tgap")) {
                n = new TemplateGap(attrs.getValue("", "gap"), attrs.getValue("", "type"), origin);
            } else { // agap
                String ns = null;
View Full Code Here

Examples of dk.brics.xmlgraph.Node

227
228
229
230
231
232
233
234
235
236
237
238
   * @return a new XML graph
   */
  private XMLGraph safeCloneGraph(XMLGraph xg) {
      final XMLGraph output = xg.clone();
      for (int i=0; i<xg.getNodes().size(); i++) {
          Node node = output.getNode(i);
          node.process(new NodeProcessor<Object>() {
              @Override
              public Object process(AttributeNode n) {
                  n.setName(n.getName().clone(), output);
                  return this;
              }
View Full Code Here

Examples of edu.byu.ece.rapidSmith.router.Node

184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
    // Checking for duplicate PIP sinks
    HashMap<Node,Net> pipSinks = new HashMap<Node, Net>();
    MessageGenerator.printHeader("CHECKING FOR DUPLICATE PIP SINKS ... ");
    for(Net net : design.getNets()){
      for(PIP pip : net.getPIPs()){
        Node n = new Node(pip.getTile(), pip.getEndWire(), null, 0);
        Net tmp = pipSinks.get(n);
        if(tmp == null){
          pipSinks.put(n, net);
        }
        else{
          System.out.print("  Duplicate PIP Sink: " + n.toString(design.getWireEnumerator()));
          System.out.println("  in nets: ");
          System.out.println("           " + net.getName());
          System.out.println("           " + tmp.getName());
        }
      }
View Full Code Here

Examples of edu.cmu.sphinx.result.Node

30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
      LogMath logMath = LogMath.getLogMath();
     
    Lattice lattice = new Lattice();

    Node a = lattice.addNode("A", "A", 0, 0);
    Node b = lattice.addNode("B", "B", 0, 0);
    Node c = lattice.addNode("C", "C", 0, 0);
    Node d = lattice.addNode("D", "D", 0, 0);

    double acousticAB = 4;
    double acousticAC = 6;
    double acousticCB = 1;
    double acousticBD = 5;
    double acousticCD = 2;

    lattice.setInitialNode(a);
    lattice.setTerminalNode(d);

    lattice.addEdge(a, b, logMath.linearToLog(acousticAB), 0);
    lattice.addEdge(a, c, logMath.linearToLog(acousticAC), 0);
    lattice.addEdge(c, b, logMath.linearToLog(acousticCB), 0);
    lattice.addEdge(b, d, logMath.linearToLog(acousticBD), 0);
    lattice.addEdge(c, d, logMath.linearToLog(acousticCD), 0);

    lattice.computeNodePosteriors(1.0f);
    double pathABD = acousticAB * acousticBD;
    double pathACBD = acousticAC * acousticCB * acousticBD;
    double pathACD = acousticAC * acousticCD;
    double allPaths = pathABD + pathACBD + pathACD;

    double bPosterior = (pathABD + pathACBD) / allPaths;
    double cPosterior = (pathACBD + pathACD) / allPaths;

    double delta = 1e-4;
    Assert.assertEquals (logMath.logToLinear((float) a.getPosterior()), 1.0, delta);
    Assert.assertEquals (logMath.logToLinear((float) b.getPosterior()), bPosterior, delta);
    Assert.assertEquals (logMath.logToLinear((float) c.getPosterior()), cPosterior, delta);
    Assert.assertEquals (logMath.logToLinear((float) d.getPosterior()), 1.0, delta);
  }
View Full Code Here

Examples of edu.gmu.seor.prognos.unbbayesplugin.jt.prs.Node

81
82
83
84
85
86
87
88
89
90
91
            dataPT.remove(linearCoordToKill);
            return;
        }

        int fim = (index == control) ? 1 : 0;
        Node node = variableList.get(control);
        for (int i = node.getStatesSize()-1; i >= fim; i--) {
            coord[control] = i;
            argMax(control-1, index, coord);
        }
    }
View Full Code Here

Examples of edu.harvard.wcfia.yoshikoder.dictionary.Node

315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330

  public void actionPerformed(ActionEvent e) {
    if (yoshikoder.getProject().getDocumentList().size() > 1){

      Node n = yoshikoder.getSelectedNode();
      CategoryNode cnode = null;
      if (n instanceof CategoryNode)
        cnode = (CategoryNode)n;
      else // patternnode
      cnode = (CategoryNode)n.getParent();
      final CategoryNode catnode = cnode;

      File file;
      try {
        int resp = chooser.showSaveDialog(yoshikoder);
View Full Code Here

Examples of edu.indiana.extreme.xbaya.graph.Node

30
31
32
33
34
35
36
37
38
39
40
41
42
            ComponentRegistryException {
        WorkflowCreator creator = new WorkflowCreator();
        Workflow workflow = creator.createSimpleMathWorkflow();
        Graph graph = workflow.getGraph();

        Node node = graph.getNode("Adder_add");
        assertNotNull(node);
        int originalSize = graph.getPorts().size();
        int portNum = node.getAllPorts().size();
        graph.removeNode(node);

        assertEquals(originalSize - portNum, graph.getPorts().size());
    }
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.