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).     

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

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

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

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

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

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

Pharmacological Evidence on Augmented Antiallodynia Following Systemic Co-Treatment with GlyT-1 and GlyT-2 Inhibitors in Rat Neuropathic Pain Model

The limited effect of current medications on neuropathic pain (NP) has initiated large efforts to develop effective treatments. Animal studies showed that glycine transporter (GlyT) inhibitors are promising analgesics in NP, though concerns regarding adverse effects were raised. We aimed to study NFPS and Org-25543, GlyT-1 and GlyT-2 inhibitors, respectively and their combination in rat mononeuropathic pain evoked by partial sciatic nerve ligation. Cerebrospinal fluid (CSF) glycine content was also determined by capillary electrophoresis. Subcutaneous (s.c.) 4 mg/kg NFPS or Org-25543 showed analgesia following acute administration (30–60 min). Small doses of each compound failed to produce antiallodynia up to 180 min after the acute administration. However, NFPS (1 mg/kg) produced antiallodynia after four days of treatment. Co-treatment with subanalgesic doses of NFPS (1 mg/kg) and Org-25543 (2 mg/kg) produced analgesia at 60 min and thereafter meanwhile increased significantly the CSF glycine content. This combination alleviated NP without affecting motor function. Test compounds failed to activate G-proteins in spinal cord. To the best of our knowledge for the first time we demonstrated augmented analgesia by combining GlyT-1 and 2 inhibitors. Increased CSF glycine content supports involvement of glycinergic system. Combining selective GlyT inhibitors or developing non-selective GlyT inhibitors might have therapeutic value in NP.     

地下圆形粮仓钢板-混凝土组合仓壁弹性应力计算公式推导与验证

地下粮仓因其周围地层的低温或准低温环境对保障粮食品质安全具有显著优势,它是构建绿色生态储粮体系的重要技术支撑。结合工程实际提出一种圆形钢板-混凝土组合地下粮仓,该新型地下粮仓的圆筒形仓壁是由钢板和混凝土两种异材组成的钢板-混凝土组合仓壁(薄柱壳),其强度计算决定着组合仓壁的安全性,是首要应该解决的问题。弹性力学经典的受压圆筒应力计算公式对其不适用,为了研究该组合仓壁的弹性应力求解问题,采用地下结构常用的荷载-结构法,将外侧水土作用简化为沿圆筒外侧均布径向压力,引入了3个假设,建立了受均匀外压作用下的双层异材圆筒计算模型。根据弹性力学理论,计算模型的应力边界条件、界面条件和位移单值条件,推导了受均匀外压双层异材圆筒的应力计算公式。以圆形地下粮仓实际工程的结构参数,建立了钢板-混凝土组合仓壁工程算例,利用推导的双层异材圆筒应力计算公式求得工程算例的解析解,采用有限元法得到工程算例的数值解,二者吻合良好,验证了该双层异材圆筒应力计算公式的正确性。推导的受均匀外压双层异材圆筒弹性应力计算公式解决了地下圆形粮仓钢板-混凝土组合仓壁的应力求解问题,为地下圆形粮仓钢板-混凝土组合仓壁工程应用提供理论参考。     

阶梯形零件的冷挤压工艺研究

详细介绍了阶梯形零件冷挤压工艺的制订过程，根据实践经验总结了其冷挤压模具设计的结构特点。     

基于图论的最大频繁项集挖掘*

利用有向项集图来存储事务数据库中有关频繁项集的信息,提出了有向项集图的三叉链表式存储结构和基于有向项集图的最大频繁项集挖掘算法.它不仅实现了事务数据库的一次扫描,减少了I/O代价,而且可以同时解决好稀疏数据库和稠密数据库的最大频繁项集挖掘问题.     

基于量化规则格的关联规则渐进更新*

提出一种基于量化规则格的规则更新算法,重点讨论了在新增格节点的过程中规则更新的思想,实现在格的渐增生成过程中,相应的关联规则也得到渐进更新.最后给出简单实例说明规则更新算法的正确性.