数控机床加工语言的解释程序设计与实现

对数控机床加工程序语言─Ｇ代码采用编译原理的方法来实现解释执行，不但灵活性好，而且执行效率高。本文通过对一般形式Ｇ码用巴科斯范式表示法，归纳出其形式文法规则，并对其规则的词法分析和语法分析给出了实际算法框图。     

概率逻辑学基本定理在多值命题逻辑系统中的推广

通过引入概率测度空间,在n值Lukasiewicz命题逻辑系统中提出了满足Kolmogorov公理的命题公式的概率;证明了概率逻辑学基本定理,并将概率逻辑学基本定理推广到了更一般的形式,改进了对推理结论的不可靠度上界的估计;将概率逻辑学的基本方法引入计量逻辑学,建立了更一般的逻辑度量空间;通过概率逻辑学基本定理,证明了逻辑度量空间中概率MP,HS规则,它是真度MP,HS规则的推广.     

先抽签比后抽签划算吗?

"我猜一班会赢.""我猜二班会赢."咦?同学们都在讨论什么呢?原来,我们六年级即将举行一场拔河比赛,大家正在讨论哪个班会是最终的赢家. 比赛马上就要开始了,各班的班长都被叫去抽签.由于我们六年级有5个班,所以将会有一个班不用参加第1轮比赛,直接晋级第2轮.各班同学都希望自己的班级直接晋级,这样可以保持体力.     

水星近日点进动的建模与摄动解

本文针对水星近日点进动现象 ,结合广义相对论建立了奇摄动微分方程模型 ,并运用多重尺度法 ,求出了一般行星进动问题的摄动解 ,从而很好的解释了水星进动之谜和一般行星的进动问题 .     

投票悖论概率计算的基本定理

多数偏好规则是求解群体最优化问题最重要和应用最广泛的规则之一.但是,在使用这一规则对给定的群体最优化问题寻求最优解中,有时会发生群体偏好循环排序的"投票悖论"现象,从而发生"投票悖论"现象的概率计算,便成为群体最优化中一个基本的研究课题.为此,引进群体在方案集上的"投票悖论排序剖面"和"投票悖论选型剖面"的概念.借助于这两个概念,建立了群体中每一个体对所有方案的偏好排序都可各具不同概率分布的一般情况下,群体对问题进行方案择优时,发生"投票悖论"概率计算的基本定理.于是,解决了求解群体最优化时发生"投票悖论"的概率计算研究中,长期未能得到彻底解决的基本问题.     

基于对象导出三支概念格的决策背景规则获取

规则获取是当前形式概念分析领域的研究热点.首先给出了基于对象导出三支概念格间的细于关系,定义了基于对象导出三支概念格的三支弱协调性,并研究了其与经典概念格下的二支弱协调性之间的关系.然后,研究了基于对象导出三支概念格的规则获取,并与经典概念格的规则获取进行了比较.最后,定义了对象导出三支概念的弱闭标记,研究了基于弱闭标记的三支弱协调决策形式背景的规则获取,剔除了冗余规则,并且得到一些新的更为精简的三支规则.     

一道中考题的探究与思考

<正>中考几何压轴题是发展学生逻辑推理的良好载体,逻辑推理是指从一些事实和命题出发,依据规则推出其他命题的素养.主要包括两类:一类是从特殊到一般的推理,推理形式主要有归纳、类比;一类是从一般到特殊的推理,推理形式主要有演绎.逻辑推理是得到数学结论、构建数学体系的重要方式,是数学严谨性的基本保证,是人们在数学活动中进行交     

基于错误逻辑分解转化联结词的生态文明指标知识表达模型研究

研究错误逻辑的知识表达模型,以错误逻辑理论结合生态文明"五位一体"所构建的生态文明建设指标体系,进行基于对象识别的知识表达.指标体系内的各元素分别被定义为错误逻辑模型中的事物、特征、函数和规则.建模时,首先进行事物分解,第二步进行特定事物下对应的特性及规则分解,最后根据判别规则G对错误函数f形式的影响,对各项指标所适用的错误函数类型进行分类.对象的生成可以为用矩阵这样的数据结构对逻辑知识进行系统化组织做前期准备.     

基于T-S模型的奇异摄动系统的采样鲁棒H_∞控制

基于T-S模型,对基于采样数据的非线性奇异摄动系统的鲁棒H_∞控制问题进行研究.对于T-S模型中规则后件中的各个局部线性模型,利用"输入滞后"(input delay)方法,将基于采样数据的离散形式的控制律转化为带滞后的连续形式的控制律.在此控制律之下,局部闭环系统成为一个变时滞的连续奇异摄动系统.在对此闭环系统的稳定性和L_2增益特征进行分析的基础上,以LMI的形式给出了满足要求的控制律满足的条件.然后将各个局部线性模型的控制律利用模糊推理方法 "合成"为系统总的控制律.     

a+b=c+d型线段证明题的解法

<正>1.原题呈现在△ABC中,∠BAC=60°,∠C=40°,AP平分∠BAC交BC于P,BQ平分∠ABC交AC于Q.求证:AB+BP=AQ+BQ.题目解析这道题目区别于一般的证明a=b+c的形式,要证结论为等号两侧均是线段和,所以无法直接利用"截长补短"进行解决.针对这类题目首先要合理挖掘题目条件,找准转化方向,才能找到题目的突破点.2.解法探究     

无约束最优化线搜索一般模型及BFGS方法的整体收敛性

本文给出了无约束最优化的算法中线性搜索的可接受的步长选择律的一种一般形式，它概括了大多数已有的步长律为其特例，并且研究了它基本性质，最后证明了此线性搜索一般模拟相结合的无约束优化的ＢＦＧＳ算法的整体收敛性。     

随机截尾试验变量抽样接收方案的贝叶斯决策

本运用Bayes决策理论研究指数分布和随机截尾试验的抽样接收方案的一般模型,我们证明了最优Bayes法则具有单调性,并对二个特殊的决策损失函数给出了最优Bayes法则和Bayes风险的具体表达式。     

An interpretability improvement for fuzzy rule bases obtained by the iterative rule learning approach

Interpretability is one of the key concepts in many of the applications using the fuzzy rule-based approach. It is well known that there are many different criteria around this concept, the complexity being one of them. In this paper, we focus our efforts in reducing the complexity of the fuzzy rule sets. One of the most interesting approaches for learning fuzzy rules is the iterative rule learning approach. It is mainly characterized by obtaining rules covering few examples in final stages, being in most cases useless to represent the knowledge. This behavior is due to the specificity of the extracted rules, which eventually creates more complex set of rules. Thus, we propose a modified version of the iterative rule learning algorithm in order to extract simple rules relaxing this natural trend. The main idea is to change the rule extraction process to be able to obtain more general rules, using pruned searching spaces together with a knowledge simplification scheme able to replace learned rules. The experimental results prove that this purpose is achieved. The new proposal reduces the complexity at both, the rule and rule base levels, maintaining the accuracy regarding to previous versions of the algorithm.     

Algorithms from algebra

The rules of algebra are rules about classes of objects. In many cases, algebra can be viewed as algorithmic in nature. By specifically defining the class for which a rule applies and then the general outline of the rule, the guesswork can be removed from the process. Thus the student has a clearer understanding of when and how a particular rule applies. The paper describes this approach to the solution of algebraic expressions and the simplification of rational expressions.     

On the rules of intermediate logics

If the Visser rules are admissible for an intermediate logic, they form a basis for the admissible rules of the logic. How to characterize the admissible rules of intermediate logics for which not all of the Visser rules are admissible is not known. In this paper we give a brief overview of results on admissible rules in the context of intermediate logics. We apply these results to some well-known intermediate logics. We provide natural examples of logics for which the Visser rule are derivable, admissible but nonderivable, or not admissible. Supported by the Austrian Science Fund FWF under projects P16264 and P16539.     

基于粗集的决策分析

粗糙集理论研究的重要内容是约简,目的在于获取优良的规则集合。本文描述了决策规则的多种指标,分析了他们体现的性质,并提出了规则集合的决策度量,从整体上体现了一个规则集合的性能,为多知识库决策奠定了基础。     

Delay-dependent BIBO stability analysis of switched uncertain neutral systems

This paper presents the analysis of delay-dependent bounded input bounded output (BIBO) stability for a class of switched uncertain neutral systems. The uncertainty is assumed to be of structured linear fractional form which includes the norm-bounded uncertainty as a special case. First, by introducing the general variation-of-constants formula of neutral systems with perturbation, the BIBO stability property of general linear switched neutral systems with perturbation is established. Next, combining the general variation-of-constants formula with the state-dependent switching rule, new approaches are presented to design the feedback controller and the switching rules. Furthermore, the BIBO stability criteria are obtained in terms of the so-called Lyapunov–Metzler linear matrix inequalities (LMIs). Finally, simulation examples are given to demonstrate the effectiveness and the potential of the proposed techniques in this paper.     

Overriding subsuming rules

This paper is concerned with intelligent agents that are able to perform nonmonotonic reasoning, not only with, but also about general rules with exceptions. More precisely, the focus is on enriching a knowledge base Γ with a general rule that is subsumed by other rules already there. Such a problem is important because evolving knowledge needs not follow logic as it is well-known from e.g. the belief revision paradigm. However, belief revision is mainly concerned with the case that the extra information logically conflicts with Γ. Otherwise, the extra knowledge is simply doomed to extend Γ with no change altogether. The problem here is different and may require a change in Γ even though no inconsistency arises. The idea is that when a rule is to be added, it might need to override any rule that subsumes it: preemption must take place. A formalism dedicated to reasoning with and about rules with exceptions is introduced. An approach to dealing with preemption over such rules is then developed. Interestingly, it leads us to introduce several implicants concepts for rules that are possibly defeasible.     

Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization

This paper proves local convergence rates of primal-dual interior point methods for general nonlinearly constrained optimization problems. Conditions to be satisfied at a solution are those given by the usual Jacobian uniqueness conditions. Proofs about convergence rates are given for three kinds of step size rules. They are: (i) the step size rule adopted by Zhang et al. in their convergence analysis of a primal-dual interior point method for linear programs, in which they used single step size for primal and dual variables; (ii) the step size rule used in the software package OB1, which uses different step sizes for primal and dual variables; and (iii) the step size rule used by Yamashita for his globally convergent primal-dual interior point method for general constrained optimization problems, which also uses different step sizes for primal and dual variables. Conditions to the barrier parameter and parameters in step size rules are given for each case. For these step size rules, local and quadratic convergence of the Newton method and local and superlinear convergence of the quasi-Newton method are proved. A preliminary version of this paper was presented at the conference “Optimization-Models and Algorithms” held at the Institute of Statistical Mathematics, Tokyo, March 1993.     

Binary games in constitutional form and collective choice

In this paper, we define the notion of binary game in constitutional form. For this game, we define a core and give a necessary and sufficient condition for a game to be stable.We define a representation of a collective choice rule by a binary game in constitutional form and characterize those collective choice rules which are representable.We finally introduce the notion of c-social decision function and characterize, as an application of our theorem on stability of binary constitutional games, the collective choice rules which are c-social decision functions.Our representation of a collective choice rule by a binary game in constitutional form is an obvious improvement of the classical representation by a simple game.