Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).     

一种简化的三维模糊制器

针对三维模糊控制器规则多,结构复杂,难以实现的问题,提出了一种简化的三维模糊控制器。该方法是把三个输入量分别为偏差、偏差变化、偏差的偏差变化的一维模糊控制器加权融合实现简化的三维模糊控制器。并提出了根据不同类型的被控对象设置三个加权系数。加权系数具有粗调、细调和微调的作用,类似于传统PID调节器的比例、积分和微分,实现对系统静差的消除。     

一种高效挖掘冠心病医案关联规则的仿真研究

研究中医冠心病医案,高效挖掘有益信息规则问题,由于中医医案数据量大、关联性强,针对传统的关联规则挖掘算法处理中医医案数据时存在效率低、收敛速度慢及漏报规则等问题,提出一种小生境技术和基因表达式编程相结合的挖掘关联规则的方法。通过惩罚函数设置支持度阈值,利用小生境技术执行小生境演化、融合算法,结合基因表达式编程算法操作简单、鲁棒性强的优势搜索强关联规则,有效避免了算法早熟,解决了规则冗余。针对治疗冠心病的中医医案进行了验证性实验,实验结果表明,改进算法在提取有效信息的效率上有较大的提高,挖掘结果对冠心病中医临床诊治具有一定的参考价值。     

火炮磁流变后坐系统仿真

将磁流变技术应用于火炮反后坐装置是目前正在发展的一种降低火炮后坐力的新技术,优化火炮反后坐装置控制,达到实时调节阻力。针对某型号火炮,在建立动力学模型和电磁模型的基础上设计了磁流变反后坐系统。为实现理想的后坐控制规律,提出了PID和模糊控制算法。利用ADAMS和MATLAB进行联合仿真,仿真结果表明,在后坐行程范围内,最大后坐阻力分别为3.71×105N,3.53×105N,相比传统火炮减小了13%和17%,并且模糊控制的后坐阻力曲线具有良好的"平台效应",实现了控制目标,表明磁流变阻尼器良好的可控性和应用于火炮后坐系统中的可行性。     

基于改进蚁群算法的模糊控制器优化设计

研究控制器优化问题,由于模糊控制系统参数无法同时优化,使得系统选择参数困难,使系统控制效果存在一定的缺陷,安全性和可靠性降低。为解决上述问题,提出了一种多种群进化蚁群算法对模糊控制器优化设计。采用懒蚂蚁效应的改进蚁群算法进行优化,在传统蚁群算法的基础上,采用多个种群并行,对算法的初始化、路径构建以及信息素更新改进,并引入到模糊控制器的隶属函数、模糊规则的优化搜索中,搜索出适应于不同控制阶段的模糊控制器参数及控制规则,并进行仿真。仿真结果证明了改进算法对模糊控制器的参数具有良好的搜索速度和精度,使系统有很强的鲁棒性。     

基于LQR直升机模糊滑模跟踪控制

研究直升机系统稳定性优化问题,由于直升机系统的强耦合和非线性特性的影响,使飞行的稳定性和实时跟踪性差。为解决上述问题,对直升机原始数学模型进行近似线性化和解耦处理,采用模糊滑模控制方法实现直升机姿态角度的跟踪控制。首先,在滑模面的设计中引入最优线性二次型调节器,构建一种积分型切换面。其次,以切换面及导数的乘积和滑模切换增益的变化量为模糊系统的变量,实时调整变结构控制项的切换增益。仿真结果表明,通过控制器设计能够实现直升机姿态角度跟踪的稳定性,对外界不确定干扰具有强鲁棒性且控制器输出抖振问题得到明显改善。     

图像处理中模糊算法问题的分析

图像处理是计算机常用技术之一,模糊算法的运用有助于提高图像处理的效果。传统图像处理存在诸多弊端,影响了用户获取信息的便捷性。本文分析了图像处理的基本操作内容,并阐述了模糊算法在图像处理流程中的运用,以进一步提升原始图像处理的效果。     

基于关联规则与PLC的同步电机高精度转角自适应控制方法

常规的转角自适应控制方法未能与同步电机的实际运行数据精准结合,导致实际控制中精度不足,因此提出基于关联规则与PLC设计的同步电机高精度转角自适应控制方法。计算同步电机的增益效率,将结果加权处理,得到同步电机转角理想传动比的计算方法。建立关联数据库,基于关联规则优化转角控制增益系数。以适应性系数判断算法终止条件,建立自适应模型结构,得到同步电机中的转角质心偏离距离,设计转角模糊自适应算法。在对比试验中,试验组中适应性系数均值为0.48/0.92 μm,3个对照组的均值分别为0.27/0.82、0.42/0.57、0.26/0.86 μm。通过试验数据可知,基于关联规则与PLC的同步电机高精度转角自适应控制方法比常规算法更适应同步电机的实际运行,具备更高的精度控制效果。     

声发射源定位不确定度的计算

针对声发射检测中的声发射源定位的不确定性问题，就其影响因素，在常用的16MnR钢制板件上进行了检测实验，并开展了实验数据的计算、分析与讨论。