Abstract: This paper aims to establish a delayed dynamical relationship between payoffs of players in a zero-sum game. By introducing Markovian chain and time delay in the network model, a delayed game network model with sector bounds and slope bounds restriction nonlinear function is first proposed. As a result, a direct dynamical relationship between payoffs of players in a zero-sum game can be illustrated through a delayed singular system. Combined with Finsler-s Lemma and Lyapunov stable theory, a sufficient condition guaranteeing the unique existence and stability of zero-sum game-s Nash equilibrium is derived. One numerical example is presented to illustrate the validity of the main result.
Abstract: Recently, some convergent results of the generalized AOR iterative (GAOR) method for solving linear systems with strictly diagonally dominant matrices are presented in [Darvishi, M.T., Hessari, P.: On convergence of the generalized AOR method for linear systems with diagonally dominant cofficient matrices. Appl. Math. Comput. 176, 128-133 (2006)] and [Tian, G.X., Huang, T.Z., Cui, S.Y.: Convergence of generalized AOR iterative method for linear systems with strictly diagonally dominant cofficient matrices. J. Comp. Appl. Math. 213, 240-247 (2008)]. In this paper, we give the convergence of the GAOR method for linear systems with strictly doubly diagonally dominant matrix, which improves these corresponding results.
Abstract: Considering a reservoir with periodic states and
different cost functions with penalty, its release rules can be
modeled as a periodic Markov decision process (PMDP). First,
we prove that policy- iteration algorithm also works for the
PMDP. Then, with policy- iteration algorithm, we obtain the
optimal policies for a special aperiodic reservoir model with
two cost functions under large penalty and give a discussion
when the penalty is small.
Abstract: A steady two-dimensional magnetohydrodynamics
flow and heat transfer over a stretching vertical sheet influenced by
radiation and porosity is studied. The governing boundary layer
equations of partial differential equations are reduced to a system of
ordinary differential equations using similarity transformation. The
system is solved numerically by using a finite difference scheme
known as the Keller-box method for some values of parameters,
namely the radiation parameter N, magnetic parameter M, buoyancy
parameter l , Prandtl number Pr and permeability parameter K. The
effects of the parameters on the heat transfer characteristics are
analyzed and discussed. It is found that both the skin friction
coefficient and the local Nusselt number decrease as the magnetic
parameter M and permeability parameter K increase. Heat transfer
rate at the surface decreases as the radiation parameter increases.
Abstract: In this paper, we first introduce the model of games on augmenting systems with a coalition structure, which can be seen as an extension of games on augmenting systems. The core of games on augmenting systems with a coalition structure is defined, and an equivalent form is discussed. Meantime, the Shapley function for this type of games is given, and two axiomatic systems of the given Shapley function are researched. When the given games are quasi convex, the relationship between the core and the Shapley function is discussed, which does coincide as in classical case. Finally, a numerical example is given.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: There have been different approaches to compute the
analytic instantaneous frequency with a variety of background reasoning
and applicability in practice, as well as restrictions. This paper presents an adaptive Fourier decomposition and (α-counting) based
instantaneous frequency computation approach. The adaptive Fourier
decomposition is a recently proposed new signal decomposition
approach. The instantaneous frequency can be computed through the so called mono-components decomposed by it. Due to the fast energy
convergency, the highest frequency of the signal will be discarded by the adaptive Fourier decomposition, which represents the noise of
the signal in most of the situation. A new instantaneous frequency
definition for a large class of so-called simple waves is also proposed
in this paper. Simple wave contains a wide range of signals for which
the concept instantaneous frequency has a perfect physical sense.
The α-counting instantaneous frequency can be used to compute the highest frequency for a signal. Combination of these two approaches one can obtain the IFs of the whole signal. An experiment is demonstrated the computation procedure with promising results.
Abstract: This paper examines the concept of simulation from
a modelling viewpoint. How can one Mealy machine simulate the other one? We create formalism for simulation of Mealy machines.
The injective s–morphism of the machine semigroups induces the simulation of machines [1]. We present the example of s–morphism
such that it is not a homomorphism of semigroups. The story for the
surjective s–morphisms is quite different. These are homomorphisms
of semigroups but there exists the surjective s–morphism such that it does not induce the simulation.
Abstract: In this paper, using a model transformation approach a system of linear delay differential equations (DDEs) with multiple delays is converted to a non-delayed initial value problem. The variational iteration method (VIM) is then applied to obtain the approximate analytical solutions. Numerical results are given for several examples involving scalar and second order systems. Comparisons with the classical fourth-order Runge-Kutta method (RK4) verify that this method is very effective and convenient.
Abstract: In this paper, an H1-Galerkin mixed finite element method is discussed for the coupled Burgers equations. The optimal error estimates of the semi-discrete and fully discrete schemes of the coupled Burgers equation are derived.
Abstract: In this paper, some brief sufficient conditions for the stability of FO-LTI systems dαx(t) dtα = Ax(t) with the fractional order are investigated when the matrix A and the fractional order α are uncertain or both α and A are uncertain, respectively. In addition, we also relate the stability of a fractional-order system with order 0 < α ≤ 1 to the stability of its equivalent fractional-order system with order 1 ≤ β < 2, the relationship between α and β is presented. Finally, a numeric experiment is given to demonstrate the effectiveness of our results.
Abstract: In this paper, a delayed prototype model is studied. Regarding the delay as a bifurcation parameter, we prove that a sequence of Hopf bifurcations will occur at the positive equilibrium when the delay increases. Using the normal form method and center manifold theory, some explicit formulae are worked out for determining the stability and the direction of the bifurcated periodic solutions. Finally, Computer simulations are carried out to explain some mathematical conclusions.
Abstract: In this paper, stability and Hopf bifurcation analysis of
a novel hyperchaotic system are investigated. Four feedback control
strategies, the linear feedback control method, enhancing feedback
control method, speed feedback control method and delayed feedback
control method, are used to control the hyperchaotic attractor to
unstable equilibrium. Moreover numerical simulations are given to
verify the theoretical results.
Abstract: We examine the maximum theorem by Berge from the
point of view of Bishop style constructive mathematics. We will show
an approximate version of the maximum theorem and the maximum
theorem for functions with sequentially locally at most one maximum.
Abstract: In the present paper, we present a modification of the
New Iterative Method (NIM) proposed by Daftardar-Gejji and Jafari
[J. Math. Anal. Appl. 2006;316:753–763] and use it for solving
systems of nonlinear functional equations. This modification yields
a series with faster convergence. Illustrative examples are presented
to demonstrate the method.
Abstract: In this paper, we consider the problem for identifying the unknown source in the Poisson equation. A modified Tikhonov regularization method is presented to deal with illposedness of the problem and error estimates are obtained with an a priori strategy and an a posteriori choice rule to find the regularization parameter. Numerical examples show that the proposed method is effective and stable.
Abstract: This paper proposes the concept of aerocapture with
aerodynamic-environment-adaptive variable geometry flexible
aeroshell that vehicle deploys. The flexible membrane is composed
of thin-layer film or textile as its aeroshell in order to solve some
problems obstructing realization of aerocapture technique.
Multi-objective optimization study is conducted to investigate
solutions and derive design guidelines. As a result, solutions which
can avoid aerodynamic heating and enlarge the corridor width up
to 10% are obtained successfully, so that the effectiveness of this
concept can be demonstrated. The deformation-use optimum
solution changes its drag coefficient from 1.6 to 1.1, along with the
change in dynamic pressure. Moreover, optimization results show
that deformation-use solution requires the membrane for which
upper temperature limit and strain limit are more than 700 K and
120%, respectively, and elasticity (Young-s modulus) is of order of
106 Pa.
Abstract: The mechanical quadrature methods for solving the boundary integral equations of the anisotropic Darcy-s equations with Dirichlet conditions in smooth domains are presented. By applying the collectively compact theory, we prove the convergence and stability of approximate solutions. The asymptotic expansions for the error show that the methods converge with the order O (h3), where h is the mesh size. Based on these analysis, extrapolation methods can be introduced to achieve a higher convergence rate O (h5). An a posterior asymptotic error representation is derived in order to construct self-adaptive algorithms. Finally, the numerical experiments show the efficiency of our methods.
Abstract: In this paper, a nonlinear delay population model is investigated. Choosing the delay as a bifurcation parameter, we demonstrate that Hopf bifurcation will occur when the delay exceeds a critical value. Global existence of bifurcating periodic solutions is established. Numerical simulations supporting the theoretical findings are included.
Abstract: Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on factoring (FAC) problem and elliptic curve discrete logarithms (ECDL) problem. As the proposed scheme is focused on factoring and ECDLP hard problems, it has a solid structure and will totally leave the intruder bemused because it is very unlikely to solve the two hard problems simultaneously. In order to assess the security level of the proposed scheme a performance analysis has been conducted. Results have proved that the proposed scheme effectively deals with the partial blindness, randomization, unlinkability and unforgeability properties. Apart from this we have also investigated the computation cost of the proposed scheme. The new proposed scheme is robust and it is difficult for the malevolent attacks to break our scheme.