This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain e...This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.展开更多
The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy imp...The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.展开更多
The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the po...The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the possibility of sudden price variations （jumps） resulting of market crashes. A solution is to use stochastic processes with jumps, that will account for sudden variations of the asset prices. On the other hand, such jump models are generally based on the Poisson random measure. Many popular economic and financial models described by stochastic differential equations with Poisson jumps. This paper deals with the approximate controllability of a class of second-order neutral stochastic differential equations with infinite delay and Poisson jumps. By using the cosine family of operators, stochastic analysis techniques, a new set of sufficient conditions are derived for the approximate controllability of the above control system. An example is provided to illustrate the obtained theory.展开更多
Established system equivalences for transition systems, such as trace equivalence and failures equivalence, require the ob- servations to be exactly identical. However, an accurate measure- ment is impossible when int...Established system equivalences for transition systems, such as trace equivalence and failures equivalence, require the ob- servations to be exactly identical. However, an accurate measure- ment is impossible when interacting with the physical world, hence exact equivalence is restrictive and not robust. Using Baire met- ric, a generalized framework of transition system approximation is proposed by developing the notions of approximate language equivalence and approximate singleton failures （SF） equivalence. The framework takes the traditional exact equivalence as a special case. The approximate language equivalence is coarser than the approximate Slc equivalence, just like the hierarchy of the exact ones. The main conclusion is that the two approximate equiva- lences satisfy the transitive property, consequently, they can be successively used in transition system approximation.展开更多
The on line computational burden related to model predictive control (MPC) of large scale constrained systems hampers its real time applications and limits it to slow dynamic process with moderate number of inputs....The on line computational burden related to model predictive control (MPC) of large scale constrained systems hampers its real time applications and limits it to slow dynamic process with moderate number of inputs. To avoid this, an efficient and fast algorithm based on aggregation optimization is proposed in this paper. It only optimizes the current control action at time instant k , while other future control sequences in the optimization horizon are approximated off line by the linear feedback control sequence, so the on line optimization can be converted into a low dimensional quadratic programming problem. Input constraints can be well handled in this scheme. The comparable performance is achieved with existing standard model predictive control algorithm. Simulation results well demonstrate its effectiveness.展开更多
Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large am...Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.展开更多
The electrode regulator system is a complex system with many variables, strong coupling and strong nonlinearity, while conventional control methods such as proportional integral derivative （PID） can not meet the req...The electrode regulator system is a complex system with many variables, strong coupling and strong nonlinearity, while conventional control methods such as proportional integral derivative （PID） can not meet the requirements. A robust adaptive neural network controller （RANNC） for electrode regulator system was proposed. Artificial neural networks were established to learn the system dynamics. The nonlinear control law was derived directly based on an input-output approximating method via the Taylor expansion, which avoids complex control development and intensive computation. The stability of the closed-loop system was established by the Lyapunov method. The current fluctuation relative percentage is less than ±8% and heating rate is up to 6.32 ℃/min when the proposed controller is used. The experiment results show that the proposed control scheme is better than inverse neural network controller （INNC） and PID controller （PIDC）.展开更多
The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are ...The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.展开更多
In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to...In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.展开更多
This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–M...This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.展开更多
The Majorana zero modes in vortex cores are of extensive interest in the context of topological quantum computing.However,a zero-energy bound state may arise accidentally but is not necessarily a Majorana zero mode.Su...The Majorana zero modes in vortex cores are of extensive interest in the context of topological quantum computing.However,a zero-energy bound state may arise accidentally but is not necessarily a Majorana zero mode.Such accidental zero modes should be carefully ruled out in experiment in order to identify the genuine Majorana zero modes.We show that in a spin-orbital coupled multi-band superconductor,such as the iron-selenide superconductor,accidental zero modes indeed arise in the vortex core if the pairing symmetry is the so-called nodeless d-wave(defined in the absence of spin-orbital coupling).Instead,if the pairing sym-metry is s_(++)or s_(+−)with respect to the Fermi pockets split by the spin-orbital coupling,the accidental zero modes do not appear in the limit of weak spin-orbital coupling.Our results are not only important in the experimental identification of Majorana zero modes,but also provide an avenue to pinpoint the pairing symmetry of the iron-selenide superconductor.展开更多
The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates informa...The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates information from genetic models,is more powerful than the commonly used Pearson’s chi-square test.However,the true genetic model is usually unknown in practice,and the power of the CAT test could be substantially reduced with a wrongly specified genetic model.To achieve a power that is close to that of a correctly specified CAT test,it is natural to apply trend tests under different possible genetic models and to report the most significant test result.This results in a MAX-type testing procedure,and it was found that this test is usually more powerful than the Pearson’s chi-square test.Although the signi-ficance(i.e.,p value)of the MAX-type test can be accessed by either large sample approximation or permutation methods,requirements for sample size or simulation replicates are demanding with respect to accuracy and efficiency.This paper proposes an approach to calculate the exact p values of MAX-type tests based on the combinatorial counting method.The simulation results show that the exact method is more accurate than the large sample approximation methods and more computationally efficient than the permutation method,and our method can be readily applied to genome-wide association studies(GWASs).The proposed methodis built in an R package,MaXact,which is available at the https://github.com/Myuan 2019/MaXact/.展开更多
A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-co...A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.展开更多
Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A s...Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A simple approximate theory and extensive Monte Carlo computer simulations were used to calculate the steady-state phase diagrams and bulk densities. It is found that the phase diagram for local inhomogeneity in TASEP with different hopping rates p is qualitatively similar to homogeneous models. Interestingly, there is a saturation point pair （a＊, fl＊） for the system, which is decided by parameters p and q. There are three stationary phases in the system, when parameter p is fixed （i.e., p=0.8）, with the increase of the parameter q, the region of LD/LD and HD/HD phase increases and the HD/LD is the only phase which the region shrinks. The analytical results are in good agreement with simulations.展开更多
In this study,the approximate and exact solutions for the stationary-state of the solids model with neglecting reactant consumption for both non-uniform and uniform temperature systems were applied on gas ignition und...In this study,the approximate and exact solutions for the stationary-state of the solids model with neglecting reactant consumption for both non-uniform and uniform temperature systems were applied on gas ignition under a constant pressure condition.The criticality conditions for a slab,an infinite cylinder,and a sphere are determined and discussed using dimensionless temperatures under constant ambient and surface temperatures for a non-uniform temperature system.Exact solution for a Semenov model with convection heat loss was also presented.The solution of the Semenov problem for constant volume or density as a solid and constant pressure were compared.The critical parameterδis calculated and compared with those of Frank-Kamenetskii solution values.The validation of the calculated ignition temperatures with other exact solution and experimental results were offered.The relation between critical parameters form Semenov and F.K.models solution was introduced.展开更多
基金supported by the National Natural Science Foundation of China(6157328561305133)
文摘This paper researches the adaptive scheduling problem of multiple electronic support measures(multi-ESM) in a ground moving radar targets tracking application. It is a sequential decision-making problem in uncertain environment. For adaptive selection of appropriate ESMs, we generalize an approximate dynamic programming(ADP) framework to the dynamic case. We define the environment model and agent model, respectively. To handle the partially observable challenge, we apply the unsented Kalman filter(UKF) algorithm for belief state estimation. To reduce the computational burden, a simulation-based approach rollout with a redesigned base policy is proposed to approximate the long-term cumulative reward. Meanwhile, Monte Carlo sampling is combined into the rollout to estimate the expectation of the rewards. The experiments indicate that our method outperforms other strategies due to its better performance in larger-scale problems.
基金supported by the National Natural Science Foundation of China(60774100)the Natural Science Foundation of Shandong Province of China(Y2007A15)
文摘The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea. First, this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval, then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens （IFMP） and interval-valued fuzzy modus tel- lens （IFMT） problems. At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given. It is shown that the existing unified forms of α-triple I （the abbreviation of triple implications） methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.
基金supported by the National Board for Higher Mathematics,Mumbai,India under Grant No.2/48(5)/2013/NBHM(R.P.)/RD-II/688 dt 16.01.2014
文摘The modelling of risky asset by stochastic processes with continuous paths, based on Brow- nian motions, suffers from several defects. First, the path continuity assumption does not seem reason- able in view of the possibility of sudden price variations （jumps） resulting of market crashes. A solution is to use stochastic processes with jumps, that will account for sudden variations of the asset prices. On the other hand, such jump models are generally based on the Poisson random measure. Many popular economic and financial models described by stochastic differential equations with Poisson jumps. This paper deals with the approximate controllability of a class of second-order neutral stochastic differential equations with infinite delay and Poisson jumps. By using the cosine family of operators, stochastic analysis techniques, a new set of sufficient conditions are derived for the approximate controllability of the above control system. An example is provided to illustrate the obtained theory.
基金supported by the National Natural Science Foundation of China(1137100311461006)+4 种基金the Natural Science Foundation of Guangxi(2011GXNSFA0181542012GXNSFGA060003)the Science and Technology Foundation of Guangxi(10169-1)the Scientific Research Project from Guangxi Education Department(201012MS274)Open Research Fund Program of Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis(HCIC201301)
文摘Established system equivalences for transition systems, such as trace equivalence and failures equivalence, require the ob- servations to be exactly identical. However, an accurate measure- ment is impossible when interacting with the physical world, hence exact equivalence is restrictive and not robust. Using Baire met- ric, a generalized framework of transition system approximation is proposed by developing the notions of approximate language equivalence and approximate singleton failures （SF） equivalence. The framework takes the traditional exact equivalence as a special case. The approximate language equivalence is coarser than the approximate Slc equivalence, just like the hierarchy of the exact ones. The main conclusion is that the two approximate equiva- lences satisfy the transitive property, consequently, they can be successively used in transition system approximation.
文摘The on line computational burden related to model predictive control (MPC) of large scale constrained systems hampers its real time applications and limits it to slow dynamic process with moderate number of inputs. To avoid this, an efficient and fast algorithm based on aggregation optimization is proposed in this paper. It only optimizes the current control action at time instant k , while other future control sequences in the optimization horizon are approximated off line by the linear feedback control sequence, so the on line optimization can be converted into a low dimensional quadratic programming problem. Input constraints can be well handled in this scheme. The comparable performance is achieved with existing standard model predictive control algorithm. Simulation results well demonstrate its effectiveness.
文摘Aggregate nearest neighbor(ANN) search retrieves for two spatial datasets T and Q, segment(s) of one or more trajectories from the set T having minimum aggregate distance to points in Q. When interacting with large amounts of trajectories, this process would be very time-consuming due to consecutive page loads. An approximate method for finding segments with minimum aggregate distance is proposed which can improve the response time. In order to index large volumes of trajectories, scalable and efficient trajectory index(SETI) structure is used. But some refinements are provided to temporal index of SETI to improve the performance of proposed method. The experiments were performed with different number of query points and percentages of dataset. It is shown that proposed method besides having an acceptable precision, can reduce the computation time significantly. It is also shown that the main fraction of search time among load time, ANN and computing convex and centroid, is related to ANN.
基金Project(N100604002) supported by the Fundamental Research Funds for Central Universities of ChinaProject(61074074) supported by the National Natural Science Foundation of China
文摘The electrode regulator system is a complex system with many variables, strong coupling and strong nonlinearity, while conventional control methods such as proportional integral derivative （PID） can not meet the requirements. A robust adaptive neural network controller （RANNC） for electrode regulator system was proposed. Artificial neural networks were established to learn the system dynamics. The nonlinear control law was derived directly based on an input-output approximating method via the Taylor expansion, which avoids complex control development and intensive computation. The stability of the closed-loop system was established by the Lyapunov method. The current fluctuation relative percentage is less than ±8% and heating rate is up to 6.32 ℃/min when the proposed controller is used. The experiment results show that the proposed control scheme is better than inverse neural network controller （INNC） and PID controller （PIDC）.
文摘The Stackelberg prediction game(SPG)is a bilevel optimization frame-work for modeling strategic interactions between a learner and a follower.Existing meth-ods for solving this problem with general loss functions are computationally expensive and scarce.We propose a novel hyper-gradient type method with a warm-start strategy to address this challenge.Particularly,we first use a Taylor expansion-based approach to obtain a good initial point.Then we apply a hyper-gradient descent method with an ex-plicit approximate hyper-gradient.We establish the convergence results of our algorithm theoretically.Furthermore,when the follower employs the least squares loss function,our method is shown to reach an e-stationary point by solving quadratic subproblems.Numerical experiments show our algorithms are empirically orders of magnitude faster than the state-of-the-art.
文摘In this paper,we construct a power type functional which is the approximation functional of the Singular Trudinger-Moser functional.Moreover,we obtain the concentration level of the functional and show it converges to the concentration level of singular Trudinger-Moser functional on the unit ball.
基金supported by the PhD Research Startup Foundation of Hubei University of Economics(Grand No.XJ23BS42).
文摘This paper studies the Smoluchowski–Kramers approximation for a discrete-time dynamical system modeled as the motion of a particle in a force field.We show that the approximation holds for the drift-implicit Euler–Maruyama discretization and derive its convergence rate.In particular,the solution of the discretized system converges to the solution of the first-order limit equation in the mean-square sense,and this convergence is independent of the order in which the mass parameterμand the step size h tend to zero.
基金supported by National Key R&D Program of China(Grant No.2022YFA1403201)and National Natural Science Foundation of China(Grant No.12374147,12274205 and 92365203).
文摘The Majorana zero modes in vortex cores are of extensive interest in the context of topological quantum computing.However,a zero-energy bound state may arise accidentally but is not necessarily a Majorana zero mode.Such accidental zero modes should be carefully ruled out in experiment in order to identify the genuine Majorana zero modes.We show that in a spin-orbital coupled multi-band superconductor,such as the iron-selenide superconductor,accidental zero modes indeed arise in the vortex core if the pairing symmetry is the so-called nodeless d-wave(defined in the absence of spin-orbital coupling).Instead,if the pairing sym-metry is s_(++)or s_(+−)with respect to the Fermi pockets split by the spin-orbital coupling,the accidental zero modes do not appear in the limit of weak spin-orbital coupling.Our results are not only important in the experimental identification of Majorana zero modes,but also provide an avenue to pinpoint the pairing symmetry of the iron-selenide superconductor.
基金This work was supported by the Natural Science Foundation of Anhui Province(2008085MA09)the National Natural Science Foundation of China(11671375).
文摘The three common genetic models(or modes of inheritance)in association analysis are the dominant,additive,and recessive models.It is known that the Cochran-Armitage trend test(CATT)which correctly incorporates information from genetic models,is more powerful than the commonly used Pearson’s chi-square test.However,the true genetic model is usually unknown in practice,and the power of the CAT test could be substantially reduced with a wrongly specified genetic model.To achieve a power that is close to that of a correctly specified CAT test,it is natural to apply trend tests under different possible genetic models and to report the most significant test result.This results in a MAX-type testing procedure,and it was found that this test is usually more powerful than the Pearson’s chi-square test.Although the signi-ficance(i.e.,p value)of the MAX-type test can be accessed by either large sample approximation or permutation methods,requirements for sample size or simulation replicates are demanding with respect to accuracy and efficiency.This paper proposes an approach to calculate the exact p values of MAX-type tests based on the combinatorial counting method.The simulation results show that the exact method is more accurate than the large sample approximation methods and more computationally efficient than the permutation method,and our method can be readily applied to genome-wide association studies(GWASs).The proposed methodis built in an R package,MaXact,which is available at the https://github.com/Myuan 2019/MaXact/.
基金Projects(51435009,51575212,61573249,61371200)supported by the National Natural Science Foundation of ChinaProjects(2015T80798,2014M552040,2014M561250,2015M571328)supported by Postdoctoral Science Foundation of ChinaProject(L2015372)supported by Liaoning Province Education Administration,China
文摘A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.
基金Project(2011FZ050) supported by Applied Basic Research Program of Yunnan Provincial Science and Technology Department,ChinaProject(2011J084) supported by Master Program of Yunnan Province Education Department,China
文摘Local inhomogeneity in totally asymmetric simple exclusion processes （TASEPs） with different hopping rates was studied. Many biological and chemical phenomena can be described by these non-equilibrium processes. A simple approximate theory and extensive Monte Carlo computer simulations were used to calculate the steady-state phase diagrams and bulk densities. It is found that the phase diagram for local inhomogeneity in TASEP with different hopping rates p is qualitatively similar to homogeneous models. Interestingly, there is a saturation point pair （a＊, fl＊） for the system, which is decided by parameters p and q. There are three stationary phases in the system, when parameter p is fixed （i.e., p=0.8）, with the increase of the parameter q, the region of LD/LD and HD/HD phase increases and the HD/LD is the only phase which the region shrinks. The analytical results are in good agreement with simulations.
文摘In this study,the approximate and exact solutions for the stationary-state of the solids model with neglecting reactant consumption for both non-uniform and uniform temperature systems were applied on gas ignition under a constant pressure condition.The criticality conditions for a slab,an infinite cylinder,and a sphere are determined and discussed using dimensionless temperatures under constant ambient and surface temperatures for a non-uniform temperature system.Exact solution for a Semenov model with convection heat loss was also presented.The solution of the Semenov problem for constant volume or density as a solid and constant pressure were compared.The critical parameterδis calculated and compared with those of Frank-Kamenetskii solution values.The validation of the calculated ignition temperatures with other exact solution and experimental results were offered.The relation between critical parameters form Semenov and F.K.models solution was introduced.
