On Wyner-Ziv Problem for general sources with average distortion criterion

The Wyner-Ziv Problem for general sources with average distortion under fixed-length coding is investigated in this paper. To solve the problem,an enhanced covering lemma for a Markov chain is first established. Then based on the lemma,a general formula for the rate-distortion function of the problem is derived,where the distortion is only assumed uniformly bounded and may be nonadditive. Finally,it is further pointed out that such methods can be used to establish more general results on multiterminal source coding problems.

Correlation between welding and hardening parameters of friction stir welded joints of 2017 aluminum alloy

An experimental study was undertaken to express the hardening Swift law according to friction stir welding （FSW） aluminum alloy 2017. Tensile tests of welded joints were run in accordance with face centered composite design. Two types of identified models based on least square method and response surface method were used to assess the contribution of FSW independent factors on the hardening parameters. These models were introduced into finite-element code ＂Abaqus＂ to simulate tensile tests of welded joints. The relative average deviation criterion, between the experimental data and the numerical simulations of tension-elongation of tensile tests, shows good agreement between the experimental results and the predicted hardening models. These results can be used to perform multi-criteria optimization for carrying out specific welds or conducting numerical simulation of plastic deformation of forming process of FSW parts such as hydroforming, bending and forging.

CONTINUOUS TIME MARKOV DECISION PROGRAMMING WITH AVERAGE REWARD CRITERION AND UNBOUNDED REWARD RATE

This paper deals with the continuous time Markov decision programming (briefly CTMDP) withunbounded reward rate.The economic criterion is the long-run average reward. To the models withcountable state space,and compact metric action sets,we present a set of sufficient conditions to ensurethe existence of the stationary optimal policies.

Nonzero-sum games for continuous-time Markov chains with unbounded transition and average payoff rates

This paper attempts to study two-person nonzero-sum games for denumerable continuous-time Markov chains determined by transition rates,with an expected average criterion.The transition rates are allowed to be unbounded,and the payoff functions may be unbounded from above and from below.We give suitable conditions under which the existence of a Nash equilibrium is ensured.More precisely,using the socalled "vanishing discount" approach,a Nash equilibrium for the average criterion is obtained as a limit point of a sequence of equilibrium strategies for the discounted criterion as the discount factors tend to zero.Our results are illustrated with a birth-and-death game.

Zero-Sum Stochastic Games with Average Payoffs:New Optimality Conditions

In this paper we study zero-sum stochastic games. The optimality criterion is the long-run expected average criterion, and the payoff function may have neither upper nor lower bounds. We give a new set of conditions for the existence of a value and a pair of optimal stationary strategies. Our conditions are slightly weaker than those in the previous literature, and some new sufficient conditions for the existence of a pair of optimal stationary strategies are imposed on the primitive data of the model. Our results are illustrated with a queueing system, for which our conditions are satisfied but some of the conditions in some previous literatures fail to hold.

STRONG N-DISCOUNT AND FINITE-HORIZON OPTIMALITY FOR CONTINUOUS-TIME MARKOV DECISION PROCESSES

This paper studies the strong n(n =—1,0)-discount and finite horizon criteria for continuoustime Markov decision processes in Polish spaces.The corresponding transition rates are allowed to be unbounded,and the reward rates may have neither upper nor lower bounds.Under mild conditions,the authors prove the existence of strong n(n =—1,0)-discount optimal stationary policies by developing two equivalence relations:One is between the standard expected average reward and strong—1-discount optimality,and the other is between the bias and strong 0-discount optimality.The authors also prove the existence of an optimal policy for a finite horizon control problem by developing an interesting characterization of a canonical triplet.

Multi-objective Model Predictive Control of Grid-connected Three-level Inverter Based on Hierarchical Optimization

In order to solve the problem of weighting factors selection in the conventional finite-control-set model predictive control for a grid-connected three-level inverter,an improved multi-objective model predictive control without weighting factors based on hierarchical optimization is proposed.Four control objectives are considered in this strategy.The grid current and neutral-point voltage of the DC-link are taken as the objectives in the first optimization hierarchy,and by using fuzzy satisfaction decision,several feasible candidates of voltage vectors are determined.Then,the average switching frequency and common-mode voltage are optimized in the second hierarchy.The average ranking criterion is introduced to sort the objective functions,and the best voltage vector is obtained to realize the coordinated control of multiple objectives.At last,the effectiveness of the proposed strategy is verified by simulation results.