Emotional agent based on rough set

To improve the ability of agent for handling emotions, a new architecture for emotion agent is presented, based on the traditional BDI agent model and the rough set theory. By a new emotional reasoning algorithm based on rough set, the architecture performs emotion reasoning and implements the emotion treatment. An emotional agent grid based on this architecture has been realized, experiment results show that it is efficient to transact simple emotions by emotional agents.     

Measuring observability by generalized information theoretic quantities

A normalized measure is established to provide the quantitative information about the degree of observability for the discrete-time, stochastically autonomous system. This measure is based on the generalized information theoretic quantities （generalized entropy, mutual information） of the system state and the observations, where the system state can be a discrete or a continuous random vector. Some important properties are presented. For the linear case, the explicit formula for the degree of observability is derived, and the equivalence between the proposed measure and the traditional rank condition is proved. The curves for the degree of observability are depicted in a simple example.     

基于OpenGL的三维牙颌模型可视化研究

为了实现牙颌模型的三维数据可视化,通过计算机逼真的显示牙列形态,并进行交互测量及变形等操作.在口腔修复体计算机辅助设计中,以OpenGL为渲染工具,结合自主设计的牙颌模型三维激光扫描仪获取的点云数据,采用基于B样条曲面的三维重建技术,以Visual C 为开发工具实现数字化牙颌模型的三维可视化.以Visual C 和OpenGL为工具,减少了程序设计难度,提高了执行效率,图形显示更加逼真流畅.本系统的设计满足了口腔医生的需求,给患者带来了便利,并促进了口腔修复体的开发制作.     

An overview of quantum computation models: quantum automata

Quantum automata, as theoretical models of quantum computers, include quantum finite automata (QFA), quantum sequential machines (QSM), quantum pushdown automata (QPDA), quantum Turing machines (QTM), quantum cellular automata (QCA), and the others, for example, automata theory based on quantum logic (orthomodular lattice-valued automata). In this paper, we try to outline a basic progress in the research on these models, focusing on QFA, QSM, QPDA, QTM, and orthomodular lattice-valued automata. Also, other models closely relative to them are mentioned. In particular, based on the existing results in the literature, we finally address a number of problems to be studied in future.     

A Pedagogy of Play: Integrating Computer Games into the Writing Classroom

Traditional distinctions between work/play and classroom/gamespace create barriers to computer games’ integration into academic settings and the writing classroom in particular. For a writing class, the work/play distinction often relegates games to an object of analysis in which students critique the games but have little invested in the gameplay itself. After examining briefly how historical changes in education created these distinctions, we offer an alternative position that places play and gamespace within the realm of the classroom. In so doing, we open up a gap for computer game theory to inform the pedagogy that can be practiced in a writing classroom. We show one such example of game theory informing writing pedagogy—the theory of emergent gaming. We then offer an example of an enacted emergent pedagogy in which students play the massively multiplayer online role-playing game World of Warcraft throughout the term, composing self-determined, rhetorically focused writing projects informed by play and written for other game players.     

Non-Linear Scale-Spaces Isomorphic to the Linear Case with Applications to Scalar,Vector and Multispectral Images

A basic requirement of scale-space representations in general is that of scale causality, which states that local extrema in the image should not be enhanced when resolution is diminished. We consider a special class of nonlinear scale-spaces consistent with this constraint, which can be linearised by a suitable isomorphism in the grey-scale domain so as to reproduce the familiar Gaussian scale-space. We consider instances in which nonlinear representations may be the preferred choice, as well as instances in which they enter by necessity. We also establish their relation to morphological scale-space representations based on a quadratic structuring function.     

Modeling Instrumental Rationality, Land Tenure and Conflict Resolution

Full instrumental rationality and perfect institutions are two cornerstoneassumptions underlying neoclassical models. However, in the real world, thesetwo assumptions never hold, especially not in developing countries. In thispaper, we develop a game theoretical model to investigate if relaxations inthe full instrumental rationality and perfect institutions premise can explainthe conflicts that have been occurring between the various principals in theNarok district in Kenya with regard to land tenure and use.     

发现含有第一类项目约束的频繁集的快速算法

与Apriori-like类型的算法相比,Zaki提出的基于垂直数据库结构及基于网络理论的算法将关联规则挖掘的运行速度提高了一个数量级,并且这些算法非常适合挖掘低支持度、长模式的关联规则。以Ecalt算法为原型,讨论了如何将项目约束引入关联规则挖掘过程的问题,从理论上证明了引入约束后的Eclat＋算法可以大大提高算法的效率和速度,并对相关的算法进行了比较。     

基于RS理论的过程企业生产工艺数据挖掘

在简要回顾了模糊控制、人工神经网络控制和粗糙控制的基本原理与特点之后,提出了运用RS理论对过程企业生产工艺数据进行挖掘以得到有关生产工艺过程控制规则的方法,用以辅助操作人员不断总结经验,提高操作水平,是上述智能控制方法的极好补充。     

Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5

We begin by showing how to faithfully encode the Classical ModalDisplay Logic (CMDL) of Wansing into the Calculus of Structures(CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination,we obtain a cut-elimination theorem for all corresponding CoScalculi. We then show how our result leads to a minimal cut-freeCoS calculus for modal logic S5. No other existing CoS calculifor S5 enjoy both these properties simultaneously.