On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

关于真值维护系统TMS的研究

本文系统地论述了几类典型的ＴＭＳ系统，对它们进行分析和比较，量后简要地叙述近年来在该领域中的一些重要研究动向。     

Reformulation of the support set selection problem in the logical analysis of data

The paper is concerned with the problem of binary classification of data records, given an already classified training set of records. Among the various approaches to the problem, the methodology of the logical analysis of data (LAD) is considered. Such approach is based on discrete mathematics, with special emphasis on Boolean functions. With respect to the standard LAD procedure, enhancements based on probability considerations are presented. In particular, the problem of the selection of the optimal support set is formulated as a weighted set covering problem. Testable statistical hypothesis are used. Accuracy of the modified LAD procedure is compared to that of the standard LAD procedure on datasets of the UCI repository. Encouraging results are obtained and discussed.     

On routing in large WDM networks

An important problem in WDM network design is to construct a logical topology and determine an optimal routing over that topology. Mixed Integer Linear Program (MILP) formulations to generate optimal solutions for this problem have been presented. Such formulations are computationally intractable, even for moderate sized networks. A standard approach is to decouple the problem of logical topology design and the problem of routing the traffic on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation can be used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally infeasible for large networks. In this paper, we present a new formulation, based on the arc-chain representation, for optimally routing the specified traffic over a given logical topology to minimize the congestion of the network. We have used the revised simplex method incorporating an implicit column generation technique, and exploited the special Generalized Upper Bounding structure as well as the possibility of eta-factorization for efficiently updating the dual variables and finding the solution. Experimental results on a number of networks demonstrate the suitability of this approach.     

作用模糊子集推理方法的研究与应用

针对实用模糊控制过程,提出作用模糊子集和作用模糊控制规则的概念;根据模糊逻辑推理中真值的产生、传递和接收机理,提出作用模糊子集推理方法;比较分析了作用模糊子集推理方法与CRI法的推理结果;利用该推理方法实现了试验室温度模糊控制试验。     

基于公式真度的公式集约简

基于经典命题逻辑的真度理论,讨论了经典命题逻辑系统当中公式集的约简问题。提出了真度约简及α-真度约简的概念,为公式集的约简提供了一种可行的操作方法。     

Consumer behaviour in the mobile telecommunications’ market: The individual’s adoption decision of innovative services

Research in the adoption of innovative services in mobile communications markets has not offered a comprehensive explanation of how the individual makes a choice. This article proposes a theoretical framework for the analysis of the adoption decision of innovative mobile services such as mobile TV. The decision to adopt the service can be viewed as a choice based on two cognitive processes of reasoning and referencing, as postulated in behavioural decision making. The framework has both theoretical and practical value. From a theoretical perspective, it illustrates the manner in which referencing and reasoning influence the individual’s decision to adopt innovative services in the mobile telecommunications market. From a practical perspective the framework offers a market analysis tool which can generate useful insights for the vendors.     

基于ForCES协议的软件集群路由器模型研究

文章提出了软件集群路由器的参考模型。且对软件集群路由器模型的物理结构、逻辑结构和流量场景进行了深入的分析。通过一个简单的模型实例，提出了总体设计的方案。