抵制网络信息霸权的博弈分析与对策研究

分析了网络信息霸权格局。运用博弈理论建立了网络信息霸权的动态对策博弈模型,并利用微分对策理论中的极值原理分析了博弈对策模型,阐释了动态对策博弈模型最优解的主要蕴意。在此基础上,提出了抵制网络信息霸权,网络崛起国应该采取的博弈对策。     

常见微分中值问题求解探究

总结归纳了一些常见微分中值问题的基本形式,研究探讨了解这些微分中值问题的基本思路与方法。     

高等数学微分概念教学初探

本文主要提出笔者对微分概念的一个教学设计,由一个简单问题贯穿始终,让学生在提出问题解决问题的过程中,自然自主地构建微分概念,推导出微分运算法则,从而加深对微分概念的理解,提高教学效果。     

高等数学微分概念教学初探

本文主要提出笔者对微分概念的一个教学设计,由一个简单问题贯穿始终,让学生在提出问题解决问题的过程中,自然自主地构建微分概念,推导出微分运算法则,从而加深对微分概念的理解,提高教学效果。     

度量空间上的Lipschitz函数

在经典的欧氏空间的条件下构造微分结构,运用Rademacher定理是一个很好的方法。如何在一般的度量空间建立微分结构,是人们关注的问题。本文研究了对度量空间的Lipschitz函数进行微分,研究这个函数类在局部的微分结构,自然的定义了一个Sobolev空间。对在度量空间上建立微分结构有一定的帮助。     

分布控制偏微分方程约束下微分代数方程组多目标优化

运用微分代数方程表示涉及代数约束的系统时间域的物理行为是一种表述物理系统行为规律的重要方式。文中复杂物理系统中微分代数方程组的解析方法,选择了分布控制偏微分方程约束下微分代数方程组作为研究对象,利用以局部参数化微分变换法实现方程组多目标优化。首先要将偏微分约束优化问题转变成具有鞍点形式的稀疏线性方程组,为此需要将分布控制微分方程约束化问题进行Galerkin有限元离散,利用先离散后优化的方法获取具备约束优化问题的有限维离散模拟形式;第二,根据一维微分变换法应用在非线性微分代数方程的特性,针对约束系统建立以微分变换法为基础的局部参数化算法,同时将约束系统作为流形上的微分方程组对其完成局部参数化,此操作可有效降低约束流形和方程组的求解难度。仿真实验证明,本文中提出的基于局部参数化微分变换法可以有效地解决微分代数方程组多目标优化问题。     

例谈用微分理解边际问题

从微分与边际问题的实质出发,以变化率为沟通方法,探寻微分与边际问题的共性。     

功能梯度夹层板弯曲问题的微分求积法

本文基于一阶剪切变性板理论,运用能量交分得到问题的控制方程以及自然边界条件,并运用二维问题的微分求积法对其进行了求解.可以看出对于线性弯曲问题,微分求积法的收敛性很好.     

求解数值微分公式及其余项的一种新方法

提出了数值微分公式的代数精度的概念，给出了利用待定系数法确定数值微分公式，并求出其余项的一种新方法，此外，利用该方法，可以证明某些含微分中值的等式问题。     

关于微分概念的教学

微分是微积分中的一个重要概念。根据多年的教学经验及学生的反应,笔者给出一节"微分"的教学设计:问题——来源——定义——应用。从而使学生能理解微分的真正含义,又能应用它解决实际问题。     

Finite-time fuzzy game-based attitude control for on-orbit cooperative transporting

Substructure transporting is an important phase for on-orbit assembly. This paper investigates a problem of designing a control approach for multiple transporting agents attached to one substructure, so as to complete the task of attitude tracking and stabilization of the substructure in the transportation process. A finite-time fuzzy game control method is developed to solve this problem. Using the framework of differential game, a finite-time nonlinear game is formulated based on the individual performance index functions of agents and attitude dynamics of the combination consisting of transporting agents and the substructure, which can reflect the cooperation and coordination between agents. In order to realize finite-time convergence which is more suitable for engineering requirement, a speed function is introduced to transfer finite-time game into infinite-time game. Considering the limited computational ability of agents, Takagi-Sugeno (T-S) fuzzy is incorporated to divide the nonlinear game problem into weighted average of multiple linear games which are easy to get the Nash equilibrium. Numerical simulations validate the efficiency of the proposed method for attitude control and the advantage in less calculation and better performance in dynamics and steady state than the existing methods.     

Linear quadratic open-loop Stackelberg game for stochastic systems with Poisson jumps

This paper is concerned with the finite horizon linear quadratic (LQ) Stackelberg game for stochastic systems with Poisson jumps under the open-loop information structure. First, the follower solves a LQ stochastic optimal control problem with Poisson jumps. With the aid of an introduced generalized differential Riccati equation with Poisson jumps (GDREP), the sufficient conditions for the optimization of the follower are put forward. Then, the leader faces an optimal control problem for a forward-backward stochastic differential equation with Poisson jumps (FBSDEP). By introducing new state and costate variables, a sufficient condition for the existence and uniqueness of the open-loop Stackelberg strategies is presented in terms of the solvability of two differential Riccati equations and a convexity condition. In addition, the state feedback representation of the open-loop Stackelberg strategies is obtained via the related differential Riccati equation. Finally, two examples shed light on the effectiveness of the obtained results.     

Open-loop Nash equilibria in the non-cooperative infinite-planning horizon LQ game

In this paper we reconsider Nash equilibria for the affine linear quadratic differential game for an infinite planning horizon. We consider an open-loop information structure. In the standard literature this problem is solved under the assumption that every player can stabilize the system on his own. In this note we relax this assumption and provide both necessary and sufficient conditions for the existence of Nash equilibria for this game under the assumption that the system as a whole is stabilizable. Basically, it is shown that to see whether equilibria exist for all initial states one has to restrict the analysis to the controllable modes of the different players.     

Robust output Nash strategies based on sliding mode observation in a two-player differential game

This paper tackles the problem of a two-player differential game affected by matched uncertainties with only the output measurement available for each player. We suggest a state estimation based on the so-called algebraic hierarchical observer for each player in order to design the Nash equilibrium strategies based on such estimation. At the same time, the use of an output integral sliding mode term (also based on the estimation processes) for the Nash strategies robustification for both players ensures the compensation of the matched uncertainties. A simulation example shows the feasibility of this approach in a magnetic levitator problem.     

基于随机微分博弈的协同创新知识共享策略

在考虑随机因素干扰的情形下,通过建立一个随机微分博弈模型研究了产学研协同创新主体间的知识共享问题。运用动态规划方法分别求得了Stackelberg主从博弈和协同合作博弈两种下均衡的知识共享策略和创新补贴比例,并对两种博弈模式下的均衡结果进行了比较。比较结果显示:(1)在Stackelberg主从博弈和协同合作博弈两种模式下,知识共享的成本及其创新能力、知识共享的边际收益及其折旧率对创新主体共享的知识量产生重要影响,当知识共享的成本及其折旧率提高时,共享的知识量将减少;当知识创新能力及其共享的边际收益提升时,共享的知识量将提高。(2)在协同合作博弈下,创新主体共享的知识量、知识创新系统的总收益、知识创新量的期望值和方差均高于Stackelberg主从博弈下的值。     

Nash Bargaining Solution based rendezvous guidance of unmanned aerial vehicles

This paper addresses a finite-time rendezvous problem for a group of unmanned aerial vehicles (UAVs), in the absence of a leader or a reference trajectory. When the UAVs do not cooperate, they are assumed to use Nash equilibrium strategies (NES). However, when the UAVs can communicate among themselves, they can implement cooperative game theoretic strategies for mutual benefit. In a convex linear quadratic differential game (LQDG), a Pareto-optimal solution (POS) is obtained when the UAVs jointly minimize a team cost functional, which is constructed through a convex combination of individual cost functionals. This paper proposes an algorithm to determine the convex combination of weights corresponding to the Pareto-optimal Nash Bargaining Solution (NBS), which offers each UAV a lower cost than that incurred from the NES. Conditions on the cost functions that make the proposed algorithm converge to the NBS are presented. A UAV, programmed to choose its strategies at a given time based upon cost-to-go estimates for the rest of the game duration, may switch to NES finding it to be more beneficial than continuing with a cooperative strategy it previously agreed upon with the other UAVs. For such scenarios, a renegotiation method, that makes use of the proposed algorithm to obtain the NBS corresponding to the state of the game at an intermediate time, is proposed. This renegotiation method helps to establish cooperation between UAVs and prevents non-cooperative behaviour. In this context, the conditions of time consistency of a cooperative solution have been derived in connection to LQDG. The efficacy of the guidance law derived from the proposed algorithm is illustrated through simulations.     

Model-Free distributed optimal consensus control of nonlinear multi-agent systems: A graphical game approach

In this paper, the optimal consensus control problem of nonlinear multi-agent systems(MASs) with completely unknown dynamics is considered. The problem is formulated in a differential graphical game approach which can be solved by Hamilton-Jacobi (HJ) equations. The main difficulty in solving the HJ equations lies in the nonlinear coupling between equations. Based on the Adaptive Dynamic Programming (ADP) technique, an VI-PI mixed HDP algorithm is proposed to solve the HJ equations distributedly. With the PI step, a suitable iterative initial value can be obtained according to the initial policies. Then, VI steps are run to get the optimal solution with exponential convergence rate. Neural networks (NNs) are applied to approximate the value functions, which makes the data-driven end-to-end learning possible. A numerical simulation is conducted to show the effectiveness of the proposed algorithm.     

History-dependent modified sliding mode interception strategies with maximal capture zone

In order to construct the guidance strategy in a realistic nonlinear noise-corrupted interception endgame against a maneuverable target, a linearized zero-sum differential game is considered. Assuming perfect information in this game, sufficient conditions are established, which guarantee that a continuous interception strategy with memory (history-dependent) has the maximal capture zone. Two examples of such a strategy are analyzed: a modified super-twisting second-order sliding mode control and a modified integral sliding mode control. Simulation results of the original nonlinear interception endgame demonstrate that these strategies considerably reduce the chattering created by the classical game optimal bang-bang strategy without deteriorating the homing performance.     

网络游戏服务器端研究与设计

研究了网络游戏服务器端程序设计与实现,主要实现客户端/服务器端模式(C/S)中的服务器端程序。分析了在实现程序设计中所需要解决的关键问题和通信协议,从而解决了服务器端程序的实现。     

游戏衍生品使用意愿影响因素实证研究

摘要：游戏衍生品发展异常缓慢是业界非常困惑的问题,理论研究滞后是一个重要原因。首先,在文献研究、大规模开放式访谈的基础上,通过对消费者使用游戏衍生品的内在机理进行深入分析,提出了影响消费者游戏衍生品使用意愿的多因素创新性概念模型,并采用自编问卷予以了验证。然后,根据影响因素之间的关系以及影响强度,根据各个指标变量对相应因素的影响强度,提出了若干企业开发与经营游戏衍生品的指导性建议。