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.     

从ASP的工作原理分析其安全性问题

该文通过分析ASP的工作原理,来阐述目前针对ASP的网络安全性问题。通过一个具体的实例,讲解了如何利用ASP的漏洞攻击服务器的过程,并对常见的安全性问题进行了介绍和归纳。希望通过实例的方式,让广大读者了解其攻击原理,并引起注意。在运用ASP编写程序时,避免安全性问题的发生,保证网站的运行和用户数据的安全性,为营造一个安全和谐的网络世界贡一点力量。     

连续不确定模糊系统的静态输出反馈控制

对于一类状态矩阵、输入矩阵和扰动输入矩阵中均含有不确定项的连续T-S模糊系统,研究其静态输出反馈控制问题.用矩阵不等式的形式给出了该模糊系统可通过静态输出反馈控制稳定的充分条件,并将矩阵不等式的条件转化为迭代线性矩阵不等式,同时给出了相应的迭代算法.最后用数值仿真例子说明了该算法的有效性和收敛性.     

一种三维刚架—桁架静力分析有限元程序

介绍了三维刚架计算原理以及作者所编制的一种应用于ＰＣ微机的有限元程序．本程序用＂ＦＯＲＴＲＡＮ＂语言编写,采用半动态一维存储．引入了单元整体形函数矩阵,简化了单元非结点载荷与结点载荷的转换过程．可用于计算三维及二维刚架或桁架在多种载荷条件下的位移及杆端内力并可绘出结构的有限元模型、支承、受载及变形状况．通过一系列算例验证了程序的正确性．     

丁苯橡胶/炭黑湿法预混胶的塑炼特性

基于胶乳/炭黑湿法混合的丁苯橡胶/炭黑湿法预混胶(P(SBR/CB))是一种在低剪切力环境下制备得到的炭黑在丁苯橡胶基体中分散优良的橡胶/炭黑预混胶,与采用传统机械混炼得到的充炭黑母胶相比,未经塑炼加工的P(SBR/CB)中的橡胶-炭黑相互作用较弱,故其加工行为表现出诸多新的特点。本文在分析P(SBR/CB)结构的基础上,采用实验室开炼机和Brabender转矩流变仪研究了其塑炼特性,探讨了开炼机薄通次数和密炼机塑炼工艺参数(循环油温、转速、塑炼时间等)对其塑炼特性(表观黏度、门尼黏度、排胶温度和结合胶含量)的影响规律,发现P(SBR/CB)的塑炼过程主要包括2个同时进行的进程,即炭黑网络的破坏和橡胶-炭黑相互作用的增强,且可通过调节密炼机塑炼参数,调控P(SBR/CB)混炼胶的门尼黏度和结合胶含量。     

基于角色的数据仓库分级安全模型的形式化研究

数据仓库安全模型及访问控制技术随数据仓库应用的推广而变得重要。首先通过对RBAC模型(Role-Based Access Controlmodel)进行分级安全的扩展,并将模型应用到数据仓库的访问控制机制中;通过数据仓库结构模型的形式化描述,建立基于角色的数据仓库分级安全基础模型、分级安全配置模型,以及数据仓库分级安全模型的一致性检测算法。指出下一步的研究工作是分级安全策略与OLAP操作,扩展MDX查询语言,真正实现数据仓库分级安全应用体系。     

Quantizer design for interconnected feedback control systems

In this paper, we consider the design of interconnected H-infinity feedback control systems with quantized signals. We assume that a decentralized static output feedback has been designed for an interconnected continuous-time LTI system so that the closed-loop system is stable and a desired H-infinity disturbance attenuation level is achieved, and that the subsystems’ measurement outputs are quantized before they are passed to the local controller. We propose a localoutput- dependent strategy for updating the quantizers’ parameters, so that the overall closed-loop system is asymptotically stable and achieves the same H-infinity disturbance attenuation level. Both the pre-designed controllers and the quantizers’ parameters are constructed in a decentralized manner, depending on local information.     

The influence of text modality on learning with static and dynamic visualizations

In this study we investigated the influence of text modality on learning with static and dynamic visualizations in a dynamic domain, namely the physical principles underlying fish locomotion. A 2 × 2-design with type of visualization (static vs. dynamic) and text modality (spoken vs. written) as independent variables was used. Concerning learning outcomes, it was hypothesized that (1) learners presented with dynamic visualizations would outperform learners presented with static visualizations, (2) learners presented with spoken text would outperform learners presented with written text, and (3) an interaction between type of visualization and modality would occur: the superiority of dynamic over static visualizations was expected to be more pronounced for spoken compared to written text. Subjective cognitive load measures were assessed and expected to mirror the aforementioned pattern of learning outcomes in accordance with Cognitive Load Theory (i.e., higher extraneous cognitive load (ECL) related to lower learning outcomes). For transfer tasks, the first two hypotheses could be confirmed. However, there was no interaction. Moreover, ECL was rated higher by subjects when learning with static compared to dynamic visualizations, but there were no differences for ECL with respect to the text modality. The results are discussed within the framework of Cognitive Load Theory.     

A two-asset stochastic model for long-term portfolio selection

In mean–variance (M–V) analysis, an investor with a holding period [0,T] operates in a two-dimensional space—one is the mean and the other is the variance. At time 0, he/she evaluates alternative portfolios based on their means and variances, and holds a combination of the market portfolio (e.g., an index fund) and the risk-free asset to maximize his/her expected utility at time T. In our continuous-time model, we operate in a three-dimensional space—the first is the spot rate, the second is the expected return on the risky asset (e.g., an index fund), and the third is time. At various times over [0,T], we determine, for each combination of the spot rate and expected return, the optimum fractions invested in the risky and risk-free assets to maximize our expected utility at time T. Hence, unlike those static M–V models, our dynamic model allows investors to trade at any time in response to changes in the market conditions and the length of their holding period. Our results show that (1) the optimum fraction y*(t) in the risky asset increases as the expected return increases but decreases as the spot rate increases; (2) y*(t) decreases as the holding period shortens; and (3) y*(t) decreases as the risk aversion parameter-γ is larger.     

Word level bitwidth reduction for unbounded hardware model checking

In this paper we present a word-level model checking method that attempts to speed up safety property checking of industrial netlists. Our aim is to construct an algorithm that allows us to check both bounded and unbounded properties using standard bit-level model checking methods as back-end decision procedures, while incurring minimum runtime penalties for designs that are unsuited to our analysis. We do this by combining modifications of several previously known techniques into a static abstraction algorithm which is guaranteed to produce bit-level netlists that are as small or smaller than the original bitblasted designs. We evaluate our algorithm on several challenging hardware components.