| Package | Description |
|---|---|
| org.aika.corpus | |
| org.aika.network | |
| org.aika.network.neuron | |
| org.aika.network.neuron.recurrent | |
| org.aika.network.neuron.simple.lattice |
| Modifier and Type | Field and Description |
|---|---|
Node |
Conflicts.Conflict.n |
Node |
Conflicts.Key.n |
| Modifier and Type | Method and Description |
|---|---|
static void |
Conflicts.add(Iteration t,
Node n,
Option primary,
Option secondary) |
| Constructor and Description |
|---|
Conflict(Node n,
Option primary,
Option secondary,
Option conflict) |
Key(Option o,
Node n) |
| Modifier and Type | Field and Description |
|---|---|
TreeSet<Node> |
Iteration.addedNodes |
Set<Node> |
Model.allNodes |
TreeSet<Node> |
Iteration.hasActivations |
| Modifier and Type | Field and Description |
|---|---|
static Node |
Node.MAX_NODE |
static Node |
Node.MIN_NODE |
Node |
Activation.Key.n |
Node |
Neuron.node |
| Modifier and Type | Method and Description |
|---|---|
void |
Node.Queue.add(Node n,
boolean processFirst) |
static int |
Node.compare(Node a,
Node b) |
int |
Node.compareTo(Node n) |
static Activation |
Activation.get(Node n,
Activation.Key ak) |
static Activation |
Activation.get(Node n,
Integer rid,
Range r,
Range.Relation rr,
Option o,
Option.Relation or,
Integer fired,
Integer id,
boolean includeShadowed) |
static Activation |
Activation.get(Node n,
Range r,
Option o) |
static List<Activation> |
Activation.select(Node n,
Integer rid,
Range r,
Range.Relation rr,
Option o,
Option.Relation or,
Option no,
Integer fired,
Integer id,
boolean includeShadowed) |
| Constructor and Description |
|---|
Activation(Node n,
Range pos,
int rid,
Option o,
int fired) |
Activation(Node n,
Range pos,
int rid,
Option o,
int fired,
int id) |
Key(Node n,
Range pos,
int rid,
Option o,
int fired) |
Key(Node n,
Range pos,
int rid,
Option o,
int fired,
int id) |
| Modifier and Type | Class and Description |
|---|---|
class |
ClockNode |
class |
ClockTerminationNode |
class |
OutputNode |
class |
RecurrentNode |
class |
TerminationNode |
| Modifier and Type | Class and Description |
|---|---|
class |
AndNode |
class |
InputNode |
class |
LatticeNode |
class |
LogicNode |
class |
NegativeInputNode |
class |
OrNode |
class |
PositiveInputNode |
| Modifier and Type | Method and Description |
|---|---|
Map<Node,Double> |
AndNode.computeMinPRel() |
| Modifier and Type | Method and Description |
|---|---|
static void |
AndNode.addActivationsToNextLevelPattern(Iteration t,
LatticeNode firstNode,
Node secondNode,
AndNode.Refinement refinement,
Activation act,
Range addedRange,
Option conflict) |
static void |
AndNode.processCandidate(Iteration t,
LatticeNode firstNode,
Node secondNode,
AndNode.Refinement refinement,
Activation act,
Range addedRange,
Option conflict,
boolean train) |
Copyright © 2016. All rights reserved.