Package jline.api.dpfqn

Class DpfqnNcLdResult

java.lang.Object
jline.api.dpfqn.DpfqnNcLdResult
public final class DpfqnNcLdResult extends Object
Normalizing constants of a discrete-time closed cycle of state dependent Bernoulli servers.

All four tables are in one common scale, so that the marginal law P(X_j = n) = W[j][n] * Gc[j][N-n] / G[N] is exact whatever the scale; lG carries the true log constant.

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    final double[]
    G
    Normalizing constants G(k) for k = 0..N, in the common scale.
    final double[][]
    Gc
    Complement constants of the cycle with node j removed, indexed [j][k].
    final double
    lG
    Logarithm of the normalizing constant G(N,J).
    final double[][]
    W
    Time-stationary node weights w_j(n), indexed [j][n] with n = 0..N.
    final double[][]
    Wa
    Arrival node weights v_j(n) = w_j(n) q_j(n) of proposition 3.5.

  • Constructor Summary

    Constructors
    Constructor
    Description
    DpfqnNcLdResult(double lG, double[] G, double[][] W, double[][] Gc, double[][] Wa)
     

  • Method Summary

    Modifier and Type
    Method
    Description
    double[]
    marginal(int j)
    Marginal queue length law of node j, P(X_j = n) for n = 0..N.

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Field Details

    • lG

      public final double lG
      Logarithm of the normalizing constant G(N,J).

    • G

      public final double[] G
      Normalizing constants G(k) for k = 0..N, in the common scale.

    • W

      public final double[][] W
      Time-stationary node weights w_j(n), indexed [j][n] with n = 0..N.

    • Gc

      public final double[][] Gc
      Complement constants of the cycle with node j removed, indexed [j][k].

    • Wa

      public final double[][] Wa
      Arrival node weights v_j(n) = w_j(n) q_j(n) of proposition 3.5.

  • Constructor Details

    • DpfqnNcLdResult

      public DpfqnNcLdResult(double lG, double[] G, double[][] W, double[][] Gc, double[][] Wa)

  • Method Details

    • marginal

      public double[] marginal(int j)
      Marginal queue length law of node j, P(X_j = n) for n = 0..N.