t

# AnytimeProbEvidenceSampler 

#### trait AnytimeProbEvidenceSampler extends AnytimeSampler with AnytimeProbEvidence

Anytime sampling algorithms that compute probability of evidence.

Linear Supertypes
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. AnytimeProbEvidenceSampler
2. AnytimeProbEvidence
3. ProbEvidenceAlgorithm
4. AnytimeSampler
5. Sampler
6. Anytime
7. Algorithm
8. AnyRef
9. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Type Members

1. class Runner extends Actor

A class representing the actor running the algorithm.

A class representing the actor running the algorithm.

Definition Classes
Anytime

### Abstract Value Members

1. abstract def computedResult: Double
Attributes
protected
Definition Classes
ProbEvidenceAlgorithm
2. abstract def doSample(): Unit
Attributes
protected
Definition Classes
Sampler
3. abstract def resetCounts(): Unit
Attributes
protected
Definition Classes
Sampler
4. abstract val universe
Definition Classes
ProbEvidenceAlgorithm
5. abstract def update(): Unit
Attributes
protected
Definition Classes
Sampler

### Concrete Value Members

1. final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
4. val active: Boolean
Attributes
protected
Definition Classes
Algorithm

The algorithm used to compute the probability of additional evidence, as created by probAdditionalEvidence.

The algorithm used to compute the probability of additional evidence, as created by probAdditionalEvidence. This algorithm can be different to the one defined in this class. (For example, a one-time algorithm can use an anytime algorithm for additional evidence.)

Definition Classes
AnytimeProbEvidenceSamplerProbEvidenceAlgorithm
6. final def asInstanceOf[T0]: T0
Definition Classes
Any
7. def awaitResponse(response: Future[Any], duration: Duration)
Attributes
protected
Definition Classes
Anytime
8. val blockSize: Int

Number of samples that should be taken in a single step of the algorithm.

Number of samples that should be taken in a single step of the algorithm.

Definition Classes
AnytimeSampler
9. def cleanUp(): Unit

Removes the evidence provided in the constructor from the universe.

Removes the evidence provided in the constructor from the universe.

Definition Classes
ProbEvidenceAlgorithmAlgorithm
10. def clone(): AnyRef
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
11. val customConf: Config

The actor running the algorithm.

The actor running the algorithm.

Definition Classes
Anytime
12. val denominator: Double
Definition Classes
ProbEvidenceAlgorithm
13. def doKill(): Unit
Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
AnytimeAlgorithm
14. def doResume(): Unit
Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
AnytimeAlgorithm
15. def doStart(): Unit
Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
AnytimeAlgorithm
16. def doStop(): Unit
Attributes
protected[com.cra.figaro.algorithm]
Definition Classes
AnytimeAlgorithm
17. final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
18. def equals(arg0: Any): Boolean
Definition Classes
AnyRef → Any
19. val evidence: List[NamedEvidence[_]]
Definition Classes
ProbEvidenceAlgorithm
20. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
21. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
22. def handle(service: Service)

A handler of services provided by the algorithm.

A handler of services provided by the algorithm.

Definition Classes
AnytimeProbEvidenceAnytime
23. def hashCode(): Int
Definition Classes
AnyRef → Any
24. def initialize(): Unit

Since probability of evidence algorithms introduce additional evidence (namely, their evidence argument), into an existing universe, a mechanism must be provided for introducing the evidence when the algorithm begins and cleaning it up at the end.

Since probability of evidence algorithms introduce additional evidence (namely, their evidence argument), into an existing universe, a mechanism must be provided for introducing the evidence when the algorithm begins and cleaning it up at the end. This is achieved with the initialize method, called when the algorithm starts, and the cleanUp method, called when the algorithm is killed.

Definition Classes
ProbEvidenceAlgorithmAlgorithm
25. def isActive: Boolean
Definition Classes
Algorithm
26. final def isInstanceOf[T0]: Boolean
Definition Classes
Any
27. def kill(): Unit

Kill the algorithm so that it is inactive.

Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
28. def logProbEvidence: Double

The computed log probability of evidence.

The computed log probability of evidence.

Definition Classes
ProbEvidenceAlgorithm
29. implicit val messageTimeout: Timeout

default message timeout.

default message timeout. Increase if queries to the algorithm fail due to timeout

Definition Classes
Anytime
30. final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
31. final def notify(): Unit
Definition Classes
AnyRef
32. final def notifyAll(): Unit
Definition Classes
AnyRef

Returns an algorithm to compute the probability of the additional evidence provided.

Returns an algorithm to compute the probability of the additional evidence provided.

Definition Classes
ProbEvidenceAlgorithm
34. def probEvidence: Double

The computed probability of evidence.

The computed probability of evidence.

Definition Classes
ProbEvidenceAlgorithm
35. def probabilityOfEvidence(): Double

Returns the probability of evidence of the universe on which the algorithm operates.

Returns the probability of evidence of the universe on which the algorithm operates. Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
AnytimeProbEvidence
36. def resume(): Unit

Resume the computation of the algorithm, if it has been stopped.

Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
37. def runStep(): Unit

Run a single step of the algorithm.

Run a single step of the algorithm. The algorithm must be able to provide answers after each step.

Definition Classes
AnytimeSamplerAnytime
38. val runner: ActorRef
Definition Classes
Anytime
39. val running: Boolean
Definition Classes
Anytime
40. def shutdown: Unit

Release all resources from this anytime algorithm.

Release all resources from this anytime algorithm.

Definition Classes
Anytime
41. def start(): Unit

Start the algorithm and make it active.

Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.

Definition Classes
Algorithm
42. def stop(): Unit

Stop the algorithm from computing.

Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
43. def stopUpdate(): Unit

Override the stopUpdate function in anytime to call the sampler update function

Override the stopUpdate function in anytime to call the sampler update function

Definition Classes
AnytimeSamplerAnytime
44. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
45. val system: ActorSystem
Definition Classes
Anytime
46. def toString(): String
Definition Classes
AnyRef → Any
47. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
48. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
49. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )