模糊逻辑在机器人逆运动学求解中的应用

冗余机器人逆运动学求解的方法很多，多数都不能很好的满足实时控制的要求，本文运用模糊逻辑的思想，构造了一种逆运动学求解方法，其计算量较其它方法大大减小，且满足实时控制的要求，仿真结果也证明了该方法的可行性。     

Decidability of Some Classes of Modal Logic

We describe a modal sequential calculus some modal rules of which do not contain duplications of the main formula. We also prove its equivalence to the modal calculus S4 and the decidability of some classes of formulas containing only oneplace predicate variables.     

Glivenko Classes of Sequents for Temporal Logic with Time Gaps

Let LB be a sequent calculus of the first-order classical temporal logic TB with time gaps. Let, further, LBJ be the intuitionistic counterpart of LB. In this paper, we consider conditions under which a sequent is derivable in the calculus LBJ if and only if it is derivable in the calculus LB. Such conditions are defined for sequents with one formula in the succedent (purely Glivenko -classes) and for sequents with the empty succedent (Glivenko -classes).     

A Graded Quadrivalent Logic for Ordinal Preference Modelling: Loyola–Like Approach

We extend a quadrivalent logic of Belnap to graded truth values in order to handle graded relevance of positive and negative arguments provided in preferential information concerning ranking of a finite set of alternatives. This logic is used to design the preference modelling and exploitation phases of decision aiding with respect to the ranking problem. The graded arguments are presented on an ordinal scale and their aggregation leads to preference model in form of four graded outranking relations (true, false, unknown and contradictory). The exploitation procedure combines the min-scoring procedure with the leximin rule. Aggregation of positive and negative arguments as well as exploitation of the resulting outranking relations is concordant with an advice given by St. Ignatius of Loyola (1548) how to make a good choice.     

MOSFET调制器的实验研究

 介绍了MOSFET调制器的基本原理，并对其并联分流和感应叠加两种开关结构进行了实验研究。基于可编辑逻辑器件设计了其触发电路，驱动电路采用高速MOSFET对管组成的推挽输出形式，加快了MOSFET的开关速度。利用Pspice软件对开关上有无剩余电流电路(RCD)两种情况进行仿真，结果表明，加装RCD电路可以有效吸收MOSFET在关断瞬间产生的反峰电压。实验中，电流波形用Pearson线圈测量，用3个MOSFET并联作开关，当电容充电电压为450 V，负载为30 Ω时，脉冲电流13 A，前沿20 ns，平顶约80 ns；用3个单元调制器感应叠加，当电容充电电压为450 A，负载为30 Ω时，脉冲电流强度为40 A，前沿25 ns，平顶约70 ns。     

基于时序逻辑和SCR方法的需求分析方法

以定义事件驱动型系统需求的ＳＣＲ（Ｓｏｆｔｗａｒｅ ＣｏｓｔＲｅｄｕｃｅ）方法和时序逻辑为基础,提出了一种能够根据ＳＣＲ方法与时序逻辑之间的语义联系和时序逻辑的推理能力有效地检查用ＳＣＲ方法定义的事件驱动型系统的需求分析方法．为便于理解,还给出了一个简单的例子来介绍如何分析和检查用ＳＣＲ方法定义的需求的有效性．     

Inductive Construction of Repletion

The aim of this paper is to give a purely logical construction of repletion, i.e. the reflection of an arbitrary set to a replete one. Replete sets within constructive logic were introduced independently by M. Hyland and P. Taylor as the most restrictive but sufficiently general notion of predomain suitable for the purposes of denotational semantics à la Scott.For any set A its repletion R(A) appears as an inductively defined subset of S²(A) (A S) S which can be expressed within the internal language of a model of type theory. More explicitly, R(A) is the least subset of S²(A) containing all point filters and closed under a class of generalised limit processes. Improvements of our construction arise from several results saying that it suffices for the purpose of repletion to consider more restrictive classes of generalised limit processes.     

Soft Constraint Logic Programming and Generalized Shortest Path Problems

In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.     

Parallelizing Tabu Search on a Cluster of Heterogeneous Workstations

In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The goal of parallelization is to speedup the search in finding better quality solutions. Observations support that both parallelization strategies are beneficial, with functional decomposition producing slightly better results. Experiments were conducted for the VLSI cell placement, an NP-hard problem, and the objective was to achieve the best possible solution in terms of interconnection length, timing performance (circuit speed), and area. The multiobjective nature of this problem is addressed using a fuzzy goal-based cost computation.     

Intuitionistic ϵ- and τ-calculi

There are several open problems in the study of the calculi which result from adding either of Hilbert's ?- or τ-operators to the first order intuitionistic predicate calculus. This paper provides answers to several of them. In particular, the first complete and sound semantics for these calculi are presented, in both a “quasi-extensional” version which uses choice functions in a straightforward way to interpret the ?- or τ-terms, and in a form which does not require extensionality assumptions. Unlike the classical case, the addition of either operator to intuitionistic logic is non-conservative. Several interesting consequences of the addition of each operator are proved. Finally, the independence of several other schemes in either calculus are also proved, making use of the semantics supplied earlier in the paper.