The Experts below are selected from a list of 150 Experts worldwide ranked by ideXlab platform

J.d. Scargle - One of the best experts on this subject based on the ideXlab platform.

N. Dobigeon - One of the best experts on this subject based on the ideXlab platform.

J. Tourneret - One of the best experts on this subject based on the ideXlab platform.

Bruce Schmeiser - One of the best experts on this subject based on the ideXlab platform.

  • Winter Simulation Conference - I-SMOOTH: iteratively smoothing piecewise-Constant Poisson-process rate functions
    Proceedings of the 2011 Winter Simulation Conference (WSC), 2011
    Co-Authors: Huifen Chen, Bruce Schmeiser
    Abstract:

    Piecewise-Constant Poisson process rate functions are easy to estimate and provide easy random-process generation. When the true rate function is continuous, however, a piecewise-Constant approximation is sometimes unacceptably crude. Given a non-negative piecewise-Constant rate function, we discuss SMOOTH (Smoothing via Mean-constrained Optimized-Objective Time Halving), a quadratic optimization formulation that yields a smoother non-negative piecewise-Constant rate function having twice as many time intervals, each of half the length. I-SMOOTH (Iterated SMOOTH) iterates the SMOOTH formulation to create a sequence of piecewise-Constant rate functions having an asymptotic continuous rate function. We consider two contexts: finite-horizon and cyclic. We develop a sequence of computational simplifications for SMOOTH, moving from numerically minimizing the quadratic objective function, to numerically computing a matrix inverse, to a closed-form matrix inverse obtained as finite sums, to decision variables that are linear combinations of the given rates, and to simple approximations.

  • I-SMOOTH: Iteratively smoothing piecewise-Constant Poisson-process rate functions
    Proceedings of the 2011 Winter Simulation Conference (WSC), 2011
    Co-Authors: Huifen Chen, Bruce Schmeiser
    Abstract:

    Piecewise-Constant Poisson process rate functions are easy to estimate and provide easy random-process generation. When the true rate function is continuous, however, a piecewise-Constant approximation is sometimes unacceptably crude. Given a non-negative piecewise-Constant rate function, we discuss SMOOTH (Smoothing via Mean-constrained Optimized-Objective Time Halving), a quadratic optimization formulation that yields a smoother non-negative piecewise-Constant rate function having twice as many time intervals, each of half the length. I-SMOOTH (Iterated SMOOTH) iterates the SMOOTH formulation to create a sequence of piecewise-Constant rate functions having an asymptotic continuous rate function. We consider two contexts: finite-horizon and cyclic. We develop a sequence of computational simplifications for SMOOTH, moving from numericallyminimizing the quadratic objective function, to numerically computing a matrix inverse, to a closed-form matrix inverse obtained as finite sums, to decision variables that are linear combinations of the given rates, and to simple approximations.

Huifen Chen - One of the best experts on this subject based on the ideXlab platform.

  • Winter Simulation Conference - I-SMOOTH: iteratively smoothing piecewise-Constant Poisson-process rate functions
    Proceedings of the 2011 Winter Simulation Conference (WSC), 2011
    Co-Authors: Huifen Chen, Bruce Schmeiser
    Abstract:

    Piecewise-Constant Poisson process rate functions are easy to estimate and provide easy random-process generation. When the true rate function is continuous, however, a piecewise-Constant approximation is sometimes unacceptably crude. Given a non-negative piecewise-Constant rate function, we discuss SMOOTH (Smoothing via Mean-constrained Optimized-Objective Time Halving), a quadratic optimization formulation that yields a smoother non-negative piecewise-Constant rate function having twice as many time intervals, each of half the length. I-SMOOTH (Iterated SMOOTH) iterates the SMOOTH formulation to create a sequence of piecewise-Constant rate functions having an asymptotic continuous rate function. We consider two contexts: finite-horizon and cyclic. We develop a sequence of computational simplifications for SMOOTH, moving from numerically minimizing the quadratic objective function, to numerically computing a matrix inverse, to a closed-form matrix inverse obtained as finite sums, to decision variables that are linear combinations of the given rates, and to simple approximations.

  • I-SMOOTH: Iteratively smoothing piecewise-Constant Poisson-process rate functions
    Proceedings of the 2011 Winter Simulation Conference (WSC), 2011
    Co-Authors: Huifen Chen, Bruce Schmeiser
    Abstract:

    Piecewise-Constant Poisson process rate functions are easy to estimate and provide easy random-process generation. When the true rate function is continuous, however, a piecewise-Constant approximation is sometimes unacceptably crude. Given a non-negative piecewise-Constant rate function, we discuss SMOOTH (Smoothing via Mean-constrained Optimized-Objective Time Halving), a quadratic optimization formulation that yields a smoother non-negative piecewise-Constant rate function having twice as many time intervals, each of half the length. I-SMOOTH (Iterated SMOOTH) iterates the SMOOTH formulation to create a sequence of piecewise-Constant rate functions having an asymptotic continuous rate function. We consider two contexts: finite-horizon and cyclic. We develop a sequence of computational simplifications for SMOOTH, moving from numericallyminimizing the quadratic objective function, to numerically computing a matrix inverse, to a closed-form matrix inverse obtained as finite sums, to decision variables that are linear combinations of the given rates, and to simple approximations.