Static Bayesian games with finite fuzzy types and the existence of equilibrium

This paper studies a special game with incomplete information, in which the payoffs of the players are both random and fuzzy. Such a game is considered in the context of a Bayesian game with the uncertain types characterized as fuzzy variables. A static fuzzy Bayesian game is then introduced and the decision rules for players are given based on credibility theory. We further prove the existence of the equilibrium of the game. Finally, a Cournot competition model with fuzzy efficiency under asymmetric information is investigated as an application and some results are presented.     

Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation

   Abstract. This paper presents a new algorithm for computing the maximum degree δ _k (A) of a minor of order k in a matrix pencil A(s) . The problem is of practical significance in the field of numerical analysis and systems control. The algorithm adopts a general framework of ``combinatorial relaxation' due to Murota. It first solves the weighted bipartite matching problem to obtain an estimate

Matrix Interpretations for Proving Termination of Term Rewriting

We present a new method for automatically proving termination of term rewriting. It is based on the well-known idea of interpretation of terms where every rewrite step causes a decrease, but instead of the usual natural numbers we use vectors of natural numbers, ordered by a particular nontotal well-founded ordering. Function symbols are interpreted by linear mappings represented by matrices. This method allows us to prove termination and relative termination. A modification of the latter, in which strict steps are only allowed at the top, turns out to be helpful in combination with the dependency pair transformation. By bounding the dimension and the matrix coefficients, the search problem becomes finite. Our implementation transforms it to a Boolean satisfiability problem (SAT), to be solved by a state-of-the-art SAT solver.     

Web-based quiz-game-like formative assessment: Development and evaluation

This research aims to develop a multiple-choice Web-based quiz-game-like formative assessment system, named GAM-WATA. The unique design of ‘Ask-Hint Strategy’ turns the Web-based formative assessment into an online quiz game. ‘Ask-Hint Strategy’ is composed of ‘Prune Strategy’ and ‘Call-in Strategy’. ‘Prune Strategy’ removes one incorrect option and turns the original 4-option item into a 3-option one. ‘Call-in Strategy’ provides the rate at which other test takers choose each option when answering a question. This research also compares the effectiveness of three different types of formative assessment in an e-Learning environment: paper-and-pencil test (PPT), normal Web-based test (N-WBT) and GAM-WATA. In total, 165 fifth grade elementary students (from six classes) in central Taiwan participated in this research. The six classes of students were then divided into three groups and each group was randomly assigned one type of formative assessment. Overall results indicate that different types of formative assessment have significant impacts on e-Learning effectiveness and that the e-Learning effectiveness of the students in the GAM-WATA group appears to be better. Students in the GAM-WATA group more actively participate in Web-based formative assessment to do self-assessment than students in the N-WBT group. The effectiveness of formative assessment will not be significantly improved only by replacing the paper-and-pencil test with Web-based test. The strategies included in GAM-WATA are recommended to be taken into consideration when researchers design Web-based formative assessment systems in the future.     

A NEW AGENT MATCHING SCHEME USING AN ORDERED FUZZY SIMILARITY MEASURE AND GAME THEORY

In this paper, an agent matching method for bilateral contracts in a multi-agent market is proposed. Each agent has a hierarchical representation of its trading commodity attributes by a tree structure of fuzzy attributes. Using this structure, the similarity between the trees of each pair of buyer and seller is computed using a new ordered fuzzy similarity algorithm. Then, using the concept of Stackelberg equilibrium in a leader–follower game, matchmaking is performed among the sellers and buyers. The fuzzy similarities of each agent with others in its personal viewpoint have been used as its payoffs in a bimatrix game. Through a case study for bilateral contracts of energy, the capabilities of the proposed agent-based system are illustrated.     

P2P MMOG中计算任务的分配问题研究

P2P平台上的MMOG设计与C/S结构相比具有更好的可靠性和扩展性,但是需要新的数据存储和事件计算分配方法.本文提出小区的概念,并以小区为计算对象的基本分配单位,设计了节点可以自组织地寻找自己地计算和通信对象的方法.小区模型的方法通过确定节点的职能,对系统中的计算任务进行划分;而合理的计算分配保证了节点计算结果的正确性,以及进行安全的通信和数据发布;每个小区内部建立多个计算节点相互监督的多层计算模式,以确保系统的安全性.最后通过实验分析了该模型的计算和通信代价,指出在提高系统可靠性的同时,降低网络负载.     

一种适合P2P MMOG的防止及检测欺骗机制

提出一种适合基于P2P的MMOG的防止及检测欺骗机制.该机制采用防止和检测两种方法解决欺骗问题,分别为改进的NEO协议和RMbCD算法.在NEO协议中使用双边假设检验动态调整帧长度;在RMbCD算法中待检测游戏参数阈值随玩家信誉动态改变.实验结果表明,动态调整帧长度可以有效降低网络状况对游戏响应性的影响,待检测参数阈值动态改变可以有效降低原欺骗检测算法的误判率,游戏参数动态改变使算法具有较好的自适应性.此外本文提出的防止及检测欺骗方案还可以同时解决多种类型的欺骗,具有很好的安全性.     

基于NMF图像重构的人脸识别

由传统的人脸识别方法产生的人脸特征子空间通常是由人脸库中所有训练样本产生的一个通用子空间,该空间更多地包含了所有人脸样本的共性特征,而忽略了个性特征。该文提出一种基于NMF图像重构的方法,以单个人的训练样本集获取其人脸特征子空间,将识别图像向每一个特征子空间中进行映射及重构,并以重构图像的误差作为判据实现人脸识别。在ORL标准人脸库进行的计算机仿真证实了该方法的有效性。     

基于HLA／RTI的无人机作战仿真系统框架设计

无人机系统与其他武器系统的联合训练是一项重要课题。在对无人机系统的进行深入分析的基础上,设计了基于HLA／RTI的无人机作战仿真系统的基本框架,实现了与炮兵C^3I系统的联合仿真,建立了无人机作战仿真系统的概念模型,为下一步仿真系统的开发实现奠定了基础。     

游戏程序设计中若干问题的探讨

游戏编程是当今程序设计的一个热点,开发过程会遇到各种各样的问题。通过限制构造函数和拷贝函数,设计一个单体全局管理类,可以避免不合适的调用。采用分块技术加栽地图,可以在时空性能上优化游戏。阐述了D3D的空间坐标变换。分析了万向节死锁问题发生的原因,并提出了解决办法。