设计模式在Drawcli程序中的应用

本文首先介绍设计模式产生的背景，然后以简单、易懂且具通用性的Drawdi程序为例，详细分析其中采用的三种设计模式：Prototype、Observer及Chain of Responsibility在Drawcli程序中的应用。这些设计模式虽然是针对不同的应用而产生的，但它们也有内在的共同性：降低耦合、利用了面向对象的继承和封装思想。它们本身十分通用，可以作为其他设计的模板。设计模式的采用提高了设计的通用性和自由度，是一种值得推荐的程序设计思想。     

基于离散对数的广义秘密共享方案

根据广义秘密共享的概念,给出了一个基于离散对数的广义秘密共享方案。在该方案中,子秘密由各参与者自己选取,分发者D不知道每个参与者所持有的子秘密。在秘密恢复过程中,每位参与者能够验证其他参与者是否进行了欺骗,每位参与者只需维护一个子秘密,就可以实现对多个秘密的共享。     

概念格属性约简的判定

引入Galois联络,利用Galois联络深入研究了概念格的基本性质。指出概念格同构是格同构。为了寻求更为简洁、合理的约简算法,在更一般的形式背景（即对象集和属性集有限或无限）中,给出协调集的四类判定定理,将已有结果做了推广而且丰富了协调集的判定。举例说明在一般的形式背景中,约简不一定存在。     

“个性成才”理念在《动态网页设计》中的应用

采用先进的教育教学理念,结合自身的教育教学实践,提出在《动态网页设计》课程中运用"个性成才"的理念进行教学,目的是了解每位学生的个性,因势利导,使每位学生都能充分发挥其个性特长。     

Communicating between information systems based on including degrees

Communication between information systems is a basic problem in granular computing. In current research, a homomorphism mapping between information systems is required. In this paper, the concept of the general relation mapping between two universes is proposed in order to construct the equivalence relation on one universe according to the given equivalence relation on the other universe based on the including degrees. The main properties of the mapping are studied, and it is proved that attribute reductions in the original system and image system are equivalent to each other under the given conditions. Finally, we also define the concept of fuzzy general relation mapping between two fuzzy information systems and give some properties.     

Multi-adjoint t-concept lattices

The t-concept lattice is introduced as a set of triples associated to graded tabular information interpreted in a non-commutative fuzzy logic. Following the general techniques of formal concept analysis, and based on the works by Georgescu and Popescu, given a non-commutative conjunctor it is possible to provide generalizations of the mappings for the intension and the extension in two different ways, and this generates a pair of concept lattices. In this paper, we show that the information common to both concept lattices can be seen as a sublattice of the Cartesian product of both concept lattices. The multi-adjoint framework can be applied to this general t-concept lattice, and its usefulness is illustrated by a working example.     

模糊本体之必然:基于人的认知特征的分析

本体是人对客观事物及其相互关系的认知成果,表现形式为概念及概念关系,二者均以语词称之。人只能自如应用有限的语词,致使人的认知有两个必备特征:一个语词指称多个概念,即以变动概念外延的方式减少概念的数量;一个语词指称多个概念关系,即以隶属度的形式归并概念关系的种类。前者对应模糊概念,后者引出模糊概念关系,由两者构成的模糊本体就是符合人的认知规律的客观世界在人脑中的必然反映。作为科学术语的"模糊",是指有效解决语词有限性与客观事物无限性矛盾的认知方式。模糊本体是本体的一般形式,更接近客观世界之真实,其模糊识别与模糊推理的功能更有利于支持人的认知活动。模糊本体内置于机器是信息处理智能化之必然,模糊本体表示的机器形式目前为OWL文档。举例示意了模糊本体的构建过程。     

Identifying modules via concept analysis

Describes a general technique for identifying modules in legacy code. The method is based on concept analysis - a branch of lattice theory that can be used to identify similarities among a set of objects based on their attributes. We discuss how concept analysis can identify potential modules using both “positive” and “negative” information. We present an algorithmic framework to construct a lattice of concepts from a program, where each concept represents a potential module. We define the notion of a concept partition, present an algorithm for discovering all concept partitions of a given concept lattice, and prove the algorithm to be correct     

A Framework for data structurest †

In this paper we outline a framework for data structures in the spirit of the Vienna Definition Language but extended to the most general class of objects, namely arbitrary directed rooted graphs in which the information asociated with each node is either empty or elementrary or an object in the general class. Since many data structures cannot be modelled by tree structures in a natural way, such a generalisation to graphs is desirable. Furthermore, the concept of hierarchy in which a node may serve for a arbitrary complex substructure supports a structured view of complex data objects.     

Estimating incomplete information in group decision making: A framework of granular computing

A general assumption in group decision making scenarios is that of all individuals possess accurate knowledge of the entire problem under study, including the abilities to make a distinction of the degree up to which an alternative is better than other one. However, in many real world scenarios, this may be unrealistic, particularly those involving numerous individuals and options to choose from conflicting and dynamics information sources. To manage such a situation, estimation methods of incomplete information, which use own assessments provided by the individuals and consistency criteria to avoid discrepancy, have been widely employed under fuzzy preference relations. In this study, we introduce the information granularity concept to estimate missing values supporting the objective of obtaining complete fuzzy preference relations with higher consistency levels. We use the concept of granular preference relations to form each missing value as a granule of information in place of a crisp number. This offers the flexibility that is required to estimate the missing information so that the consistency levels related to the complete fuzzy preference relations are as higher as possible.     

Fuzzy system reliability evaluation using time-dependent intuitionistic fuzzy set

In general, fuzzy sets are used to analyse the system reliability. In this article, the concept of fuzzy set is extended by the idea of intuitionistic fuzzy set (IFS) and a new general procedure is proposed to construct the membership and non-membership functions of the fuzzy reliability using time-dependent IFS. Here, failure rate function of the system is represented by a triangular intuitionistic fuzzy number (IFN). Also, using proposed approach, membership and non-membership functions of fuzzy reliability of series and parallel systems are constructed, where the failure rate of each component is taken as a time-dependent triangular IFN. The major advantage of using IFS over fuzzy sets is that IFS separate the positive and negative evidences for membership of an element in the set. Numerical examples are given to illustrate the proposed approach.     

Migration Processes I: The Continuous Case

In this paper the general concept of a migration process (MP) is introduced; it involves iterative displacement of each point in a set as function of a neighborhood of the point, and is applicable to arbitrary sets with arbitrary topologies. After a brief analysis of this relatively general class of iterative processes and of constraints on such processes, we restrict our attention to processes in which each point in a set is iteratively displaced to the average (centroid) of its equigeodesic neighborhood. We show that MPs of this special class can be approximated by reaction-diffusion-type PDEs, which have received extensive attention recently in the contour evolution literature. Although we show that MPs constitute a special class of these evolution models, our analysis of migrating sets does not require the machinery of differential geometry. In Part I of the paper we characterize the migration of closed curves and extend our analysis to arbitrary connected sets in the continuous domain (R^m) using the frequency analysis of closed polygons, which has been rediscovered recently in the literature. We show that migrating sets shrink, and also derive other geometric properties of MPs. In Part II we will reformulate the concept of migration in a discrete representation (Z^m).     

A proposal of bargaining solution for cooperative contract in a supply chain

As a problem in supply chain management, the decision problem of terms and conditions of a contract between a supplier and a retailer is recognized commonly. The concept of cooperative bargaining between a supplier and a retailer is the key concepts to resolve this problem in the supply chain. Then, the bargaining evaluation function by Nash in the game theory exists as a tool to obtain the solution by cooperation bargaining. The Nash bargaining solution is derived under the premise that a power balance between a supplier and a retailer is equal. However, the situation where the power balance between a supplier and a retailer in actual bargaining is not equal is supposed frequently. For the purpose of reflecting the power balance in obtaining the bargaining solution, the concept of a general bargaining solution was proposed and then the general bargaining evaluation function for obtaining the general bargaining solution was devised. However, in the case of adopting the general bargaining evaluation function as a bargaining tool, some problems are included. In this article, we address the problems in the general bargaining solution. Then, we propose a new concept of bargaining process to obtain a solution under considering the existence of power balance between a supplier and a retailer.     

A general finite-difference formulation with application to Navier-Stokes equations

A general finite-difference formulation is presented here for deriving an accurate and stable finite-difference scheme. The method introduces a new concept of “decay function” which is determined analytically at each grid point. An additional concept of “locally one-dimensional” is used in multi-dimensional equations. Two types of decay functions are derived, spatial decay functions and time-wise decay functions. In both cases, the properties of decay functions are discussed and the relation of the method to other difference schemes, such as central difference, upwind difference, explicit difference and implicit difference, are studied. Applications to one-, two- and three-dimensional vorticity equations are illustrated.     

Similarity-based learning and its extensions

This paper synthesizes a number of approaches to concept representation and learning in a multilayered model. The paper emphasizes what has been called similarity-based learning (SBL) from examples, although this review is extended to address wider issues. The paper pays particular attention to requirements for incremental and uncertain environments, and to interrelationships among concept purpose, concept representation, and concept learning.
One goal of the paper is to unite some of the notions underlying recent research, in an attempt to construct a more complete and extensible framework. This framework is designed to capture representations and methods such as those based on hypothesis search and bias selection, and to extend the ideas for greater system capability. This leads to a specific perspective for multilayered learning which has several advantages, such as greater clarity, more uniform learning, and more powerful induction.
The approach clarifies and unifies various aspects of the problem of concept learning. Some results'are (1) Various concept representations (such as logic, prototypes, and decision trees) are subsumed by a standard form which is well suited to learning, particularly in incremental and uncertain environments; (2) Concept learning may be enhanced by exploiting a particular phenomenon in many spaces-this phenomenon is a certain kind of smoothness or regularity, one instance of which underlies the similarity in SBL systems; (3) The paper treats the phenomenon in a general way and applies it hierarchically. This has various advantages of uniformity. For example the model allows layered learning algorithms for concept learning all to be instantiations of one basic algorithm. A single kind of representation (an instantiation of the standard form) is prominent at each level. The combination of representation and algorithm allows fast, accurate, concise, and robust concept learning.     

Multi-adjoint concept lattices with heterogeneous conjunctors and hedges

This paper is related, on the one hand, to the framework of multi-adjoint concept lattices with heterogeneous conjunctors and, on the other hand, to the use of intensifying hedges as truth-stressers. Specifically, we continue on the line of recent works by Belohlavek and Vychodil, which use intensifying hedges as a tool to reduce the size of a concept lattice. In this paper we use hedges as a reduction tool in the general framework of multi-adjoint concept lattices with heterogeneous conjunctors.     

Adaptive fault-tolerant routing in cube-based multicomputers usingsafety vectors

Reliable communication in cube-based multicomputers using the safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer of dimension n is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. The safety vector of each node can be easily calculated through n-1 rounds of information exchange among neighboring nodes. Optimal unicasting between two nodes is guaranteed if the kth bit of the safety vector of the source node is one, where k is the Hamming distance between the source and destination nodes. The concept of dynamic adaptivity is introduced, representing the ability of a routing algorithm to dynamically adjust its routing adaptivity based on fault distribution in the neighborhood. The feasibility of the proposed unicasting can be easily determined at the source node by comparing its safety vector with the Hamming distance between the source and destination nodes. The proposed unicasting can also be used in disconnected hypercubes, where nodes in a hypercube are disjointed (into two or more parts). We then extend the safety vector concept to general cube-based multicomputers