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

Patrizio Colaneri - One of the best experts on this subject based on the ideXlab platform.

  • dwell time analysis of Deterministic and stochastic switched systems
    European Control Conference, 2009
    Co-Authors: Patrizio Colaneri
    Abstract:

    This paper collects a number of recent results on stability and L 2 gain of switched linear systems (both Deterministic and stochastic) under a dwell time constraint. The switching signal orchestrates the commutations between linear systems (in the Deterministic Case) or Markov jump linear systems (in the stochastic Case). In the latter Case, the switching affects both the dynamics of the underlying systems and the associated transition probability matrices. The main focus is on the computation of the minimum dwell time ensuring stability and an upper bound of the L 2 gain, in the Deterministic Case, or stochastic stability (both in the mean square sense and almost sure sense), in the stochastic Case. Being the minimum dwell time very hardly computable, viable procedures are proposed for a computation of an upper bound through Kronecker calculus, standard H ∞ theory and coupled Lyapunov inequalities.

  • ECC - Dwell time analysis of Deterministic and stochastic switched systems
    European Journal of Control, 2009
    Co-Authors: Patrizio Colaneri
    Abstract:

    This paper collects a number of recent results on stability and L 2 gain of switched linear systems (both Deterministic and stochastic) under a dwell time constraint. The switching signal orchestrates the commutations between linear systems (in the Deterministic Case) or Markov jump linear systems (in the stochastic Case). In the latter Case, the switching affects both the dynamics of the underlying systems and the associated transition probability matrices. The main focus is on the computation of the minimum dwell time ensuring stability and an upper bound of the L 2 gain, in the Deterministic Case, or stochastic stability (both in the mean square sense and almost sure sense), in the stochastic Case. Being the minimum dwell time very hardly computable, viable procedures are proposed for a computation of an upper bound through Kronecker calculus, standard H ∞ theory and coupled Lyapunov inequalities.

Gerhard Kramer - One of the best experts on this subject based on the ideXlab platform.

  • broadcast channels with cooperation capacity and duality for the semi Deterministic Case
    Information Theory Workshop, 2015
    Co-Authors: Ziv Goldfeld, Haim H Permuter, Gerhard Kramer
    Abstract:

    The semi-Deterministic (SD) broadcast channel (BC) where the decoders cooperate via a one-sided link is considered and its capacity region is derived. The direct proof relies on an achievable region for the general BC that is tight for the SD scenario. This achievable region follows by a coding scheme that combines rate-splitting and binning with Marton and superposition coding. The SD-BC is shown to be operationally equivalent to a class of relay-BCs (RBCs) and the correspondence between their capacity regions is established. Furthermore, a dual source coding problem, referred to as the Wyner-Ahlswede-Korner (WAK) problem with one-sided encoder cooperation, is proposed. Transformation principles between the problems are presented and the optimal rate region for the AK problem is stated. The SD-BC capacity and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Special Cases of the two problems are inspected and shown to maintain duality.

  • ITW - Broadcast channels with cooperation: Capacity and duality for the semi-Deterministic Case
    2015 IEEE Information Theory Workshop (ITW), 2015
    Co-Authors: Ziv Goldfeld, Haim H Permuter, Gerhard Kramer
    Abstract:

    The semi-Deterministic (SD) broadcast channel (BC) where the decoders cooperate via a one-sided link is considered and its capacity region is derived. The direct proof relies on an achievable region for the general BC that is tight for the SD scenario. This achievable region follows by a coding scheme that combines rate-splitting and binning with Marton and superposition coding. The SD-BC is shown to be operationally equivalent to a class of relay-BCs (RBCs) and the correspondence between their capacity regions is established. Furthermore, a dual source coding problem, referred to as the Wyner-Ahlswede-Korner (WAK) problem with one-sided encoder cooperation, is proposed. Transformation principles between the problems are presented and the optimal rate region for the AK problem is stated. The SD-BC capacity and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Special Cases of the two problems are inspected and shown to maintain duality.

Dong-cheng Mei - One of the best experts on this subject based on the ideXlab platform.

  • Noise and time delay : Suppressed population explosion of the mutualism system
    Europhysics Letters (EPL), 2007
    Co-Authors: L. R. Nie, Dong-cheng Mei
    Abstract:

    We have analyzed effects of noise and time delay in a classical Lotka-Volterra model of mutualism system. We show that the consideration of the noise and the time delay change drastically the behavior of the system in the Deterministic Case. To a certain degree, the noise or the time delay can suppress the population explosion of the mutualism system, which takes place in the Deterministic Case, however, the average species population of system with only the noise or the time delay does not converge. Combination of the noise and the time delay completely suppress the population explosion of the mutualism system.

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

  • Scheduling of the batch annealing process — Deterministic Case
    Computers & Chemical Engineering, 1999
    Co-Authors: Sungdeuk Moon, Andrew N Hrymak
    Abstract:

    Abstract This study addresses the short-term scheduling problem for the batch annealing process in the heat treatment of steel coils. Scheduling in the batch annealing process has the following objective: determine the optimal movement plan for satisfying high utilization of shared equipment (a crane, furnaces, and coolers) among parallel bases. This process is a multipurpose batch plant which may contain re-entrant flows in the batch annealing cycles and units in parallel, including sequence-dependent setup time and transfer time . A novel mixed-integer linear programming (MILP) model for the scheduling of the batch annealing process is proposed. For large size problems of the batch annealing process, a scheduling solution can be obtained by using a novel algorithm. Although this procedure does not guarantee optimality of the solution, the computational efficiency was improved and feasible solutions for large problems can be obtained in a reasonable CPU time. Application of the proposed model and algorithm is illustrated with several example problems including a problem that consists of 29 pieces of equipment and up to 24 bases.

  • scheduling of the batch annealing process Deterministic Case
    Computers & Chemical Engineering, 1999
    Co-Authors: Sungdeuk Moon, Andrew N Hrymak
    Abstract:

    Abstract This study addresses the short-term scheduling problem for the batch annealing process in the heat treatment of steel coils. Scheduling in the batch annealing process has the following objective: determine the optimal movement plan for satisfying high utilization of shared equipment (a crane, furnaces, and coolers) among parallel bases. This process is a multipurpose batch plant which may contain re-entrant flows in the batch annealing cycles and units in parallel, including sequence-dependent setup time and transfer time . A novel mixed-integer linear programming (MILP) model for the scheduling of the batch annealing process is proposed. For large size problems of the batch annealing process, a scheduling solution can be obtained by using a novel algorithm. Although this procedure does not guarantee optimality of the solution, the computational efficiency was improved and feasible solutions for large problems can be obtained in a reasonable CPU time. Application of the proposed model and algorithm is illustrated with several example problems including a problem that consists of 29 pieces of equipment and up to 24 bases.

Ziv Goldfeld - One of the best experts on this subject based on the ideXlab platform.

  • broadcast channels with cooperation capacity and duality for the semi Deterministic Case
    Information Theory Workshop, 2015
    Co-Authors: Ziv Goldfeld, Haim H Permuter, Gerhard Kramer
    Abstract:

    The semi-Deterministic (SD) broadcast channel (BC) where the decoders cooperate via a one-sided link is considered and its capacity region is derived. The direct proof relies on an achievable region for the general BC that is tight for the SD scenario. This achievable region follows by a coding scheme that combines rate-splitting and binning with Marton and superposition coding. The SD-BC is shown to be operationally equivalent to a class of relay-BCs (RBCs) and the correspondence between their capacity regions is established. Furthermore, a dual source coding problem, referred to as the Wyner-Ahlswede-Korner (WAK) problem with one-sided encoder cooperation, is proposed. Transformation principles between the problems are presented and the optimal rate region for the AK problem is stated. The SD-BC capacity and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Special Cases of the two problems are inspected and shown to maintain duality.

  • ITW - Broadcast channels with cooperation: Capacity and duality for the semi-Deterministic Case
    2015 IEEE Information Theory Workshop (ITW), 2015
    Co-Authors: Ziv Goldfeld, Haim H Permuter, Gerhard Kramer
    Abstract:

    The semi-Deterministic (SD) broadcast channel (BC) where the decoders cooperate via a one-sided link is considered and its capacity region is derived. The direct proof relies on an achievable region for the general BC that is tight for the SD scenario. This achievable region follows by a coding scheme that combines rate-splitting and binning with Marton and superposition coding. The SD-BC is shown to be operationally equivalent to a class of relay-BCs (RBCs) and the correspondence between their capacity regions is established. Furthermore, a dual source coding problem, referred to as the Wyner-Ahlswede-Korner (WAK) problem with one-sided encoder cooperation, is proposed. Transformation principles between the problems are presented and the optimal rate region for the AK problem is stated. The SD-BC capacity and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Special Cases of the two problems are inspected and shown to maintain duality.