1.

Vague集的运算规则 被引次数：5





李凡 卢安 饶勇《计算机科学》,2000年第27卷第9期


Based on reft, rence Ill.first we give some new definitions of vague set ,then some operationrules and examples are presented.

2.

Research on the dynamic andnonsameplane vague region relations without kernel





李松 郝忠孝《哈尔滨工业大学学报(英文版)》,2011年第18卷第6期


To remedy the defects of the existing research achievements,the dynamic vague region relations without kernel and the nonsameplane vague region relations without kernel based on the conception of the vague sets were studied systematically.The formalized definitions of the vague intersection set,the vague cut sets and vague region partition etc were given.Based on the vague sets,the eight vague region relations in the same plane and the ten vague region relations in the different plane were given.Furthermore,the coessential intersection and the heterogeneous intersection were proposed to simplify the representation for the dynamic vague region relations without kernel and the rotationcorresponding relations between the two kinds of the relations were also studied.The production in this paper laid the foundation for the applications and research of the vague region relations without kernel in the spatial database.

3.

Vague集Vague图及其在ITS物流中的应用





张 然 刘 扬 谢砚青 张 江 贺仲雄《中国工程科学》,2004年第6卷第8期


在模糊集（fuzzy set）的基础上讨论了“双模糊集”Vague集的基本概念和运算形式，具体讨论了Vague聚类分析、Vague多准则决策、Vague图等问题及其在现代物流中的应用。最后给出根据正、负两方面效益选择运输方案的Vague集在物流中的应用实例。

4.

Fuzzy DistanceBased Range Queries over Uncertain Moving Objects





陈逸菲 秦小麟 刘亮 李博涵《计算机科学技术学报》,2012年第27卷第2期


Data obtained from real world are imprecise or uncertain due to the accuracy of positioning devices,updating protocols or characteristics of applications.On the other hand,users sometimes prefer to qualitatively express their requests with vague conditions and different parts of search region are inequally important in some applications.We address the problem of efficiently processing the fuzzy range queries for uncertain moving objects whose whereabouts in time are not known exactly,for which the basic syntax is find objects always/sometimes near to the query issuer with the qualifying guarantees no less than a given threshold during a given temporal interval.We model the location uncertainty of moving objects on the utilization of probability density functions and describe the indeterminate boundary of query range with fuzzy set.We present the qualifying guarantee evaluation of objects,and propose pruning techniques based on the αcut of fuzzy set to shrink the search space efficiently.We also design rules to reject nonqualifying objects and validate qualifying objects in order to avoid unnecessary costly numeric integrations in the refinement step.An extensive empirical study has been conducted to demonstrate the efficiency and effectiveness of algorithms under various experimental

5.

一种新的集合理论Vague Rough sets 被引次数：1





张敏 刘三阳《电子科技》,2006年第6期


将不确定理论Vague集合和Rough集合相结合,提出一种新的集合理论Vague Rough sets.并讨论了其不确定性性质,如模糊度粗糙度等.

6.

Describing fuzzy sets using a new concept:fuzzify functor





魏克新 王兆霞 王权《光电子快报》,2009年第5卷第1期


This paper proposed a fuzzify functor as an extension of the concept of fuzzy sets.The fuzzify functor and the firstorder operated fuzzy set are defined.From the theory analysis,it can be observed that when the fuzzify functor acts on a simple crisp set,we get the first order fuzzy set or type1 fuzzy set.By operating the fuzzify functor on fuzzy sets,we get the higher order fuzzy sets or higher type fuzzy sets and their membership functions.Using the fuzzify functor we can exactly describe the type1 fuzz...

7.

模糊T粗集的粗糙性测量





刘华文 史开泉《计算机科学》,2003年第30卷第12期


In this paper, we discuss roughness measure of the fuzzy Trough sets, and introduce an axiom description of the degree of roughness and a characteristic theorem. Furthermore, we give several special expressions of the degree of roughness. The results of this paper will be helpful to the farther study and application of the theory of rough sets and fuzzy sets.

8.

An algorithm to compute maximal contractions for Horn clauses 被引次数：2





LUO Jie & LI Wei State Key Laboratory of Software Development Environment School of Computer Science Technology Beihang University Beijing China《中国科学:信息科学(英文版)》,2011年第2期


In the theory of belief revision, the computation of all maximal subsets (maximal contractions) of a formula set with respect to a set of facts is one of the key problems. In this paper, we try to solve this problem by studying the algorithm to compute all maximal contractions for Horn clauses. First, we point out and prove the conversion relationship between minimal inconsistent subsets of union of the formula set and the set of facts and maximal contractions of the formula set with respect to th...

9.

社长序言（英文）





Zhang Xinsheng《中国通信》,2014年第1期


正Happy New Year!As we step into a new year,we take a look back at the key feature topics covered in China Communications over the past 12 months and set out our expecta

10.

High Performance Interconnect Network for Tianhe System





廖湘科 庞征斌 王克非 卢宇彤 谢旻 夏军 董德尊 所光《计算机科学技术学报》,2015年第2期


In this paper, we present the Tianhe2 interconnect network and message passing services. We describe the architecture of the router and network interface chips, and highlight a set of hardware and sof...

11.

Extension of information entropybased measures in incomplete information systems





李仁璞 黄道 高茂庭《哈尔滨工业大学学报(英文版)》,2005年第12卷第5期


Rough set theory[1, 2], developed by professorPawlak, was conceived as a valid mathematical theoryto deal with inexact, uncertain or vague knowledge inmany applicants such as data mining, machine learningand decision support.Although rough set theory, using the concept of indiscernibility relation as its basic principle, provides aformal theoretical mechanism and a series of tools onknowledge reduction and knowledge acquisition throughset algebra, researchers realize that rough set theory isd…

12.

Call for Papers Journal of Electronic Science and Technology Announcing a Special Issue on Artificial Intelligence with Rough Sets





《中国电子科技》,2010年第1期


Submission Deadline:10 December 2010 Since the introduction of rough sets in 1982 by Professor Zdzislaw Pawlak,we have witnessed great advances in both

13.

Eigenvector Method for Ranking Alternatives with Vague Value Measurements





侯福均 吴祈宗《北京理工大学学报(英文版)》,2009年第18卷第2期


An eigenvector method for ranking alternatives whose measurements are given as vague values is provided. Firstly, a positive matrix is constructed which is defined as evaluation information matrix (EIM). Based on four assumptions for evaluating alternatives, a ranking eigenvector is defined. And then it is proved, based on positive matrix theory, that the EIM’s eigenvector corresponding to the maximal eigenvalue is the ranking vector. For alternatives whose characteristics are presented by vague sets, the proposed techniques can evaluate the degree of suitability to which an alternative satisfies the decisionmaker’s requirement efficiently.

14.

Call for Papers





《中国电子科技》,2010年第3期


Since the introduction of rough sets in 1982 by Professor Zdzislaw Pawlak, we have witnessed great advances in both theory and applications. In order to promote development of rough sets, we are preparing a special issue on ＂Artificial Intelligence with Rough Sets＂ published by JEST （International）, Journal of Electronic Science and Technology, which is a refereed international journal focusing on IT area. The aim of this special issue is to present the current state of the research in this area, oriented towards both theoretical and applications aspects of rough sets.

15.

A general approach to attribute reduction in rough set theory





Zhang WenXiu Qiu GuoFang Wu WeiZhi《中国科学F辑(英文版)》,2007年第50卷第2期


The concept of a consistent approximation representation space is introduced. Many types of information systems can be treated and unified as consistent ap proximation representation spaces. At the same time, under the framework of this space, the judgment theorem for determining consistent attribute set is established, from which we can obtain the approach to attribute reductions in information systems. Also, the characterizations of three important types of attribute sets (the core attribute set, the relative necessary attribute set and the unnecessary attribute set) are examined.

16.

A Programmable Approach to Maintenance of a FiniteKnowledge Base





栾尚敏 戴国忠 李未《计算机科学技术学报》,2003年第18卷第1期


In this paper,we present a programmable method of revising a finite clause set.We first present a procedure whose formal parameters are a consistent clause set Γand a clause A and whose output is a set of minimal subsets of Γwhich are inconsistent with A.The maximal consistent subsets can be generated from all minimal inconsistent subsets.We develop a prototype system based on the above procedure,and discuss the implementation of knowledge base maintenance.At last,we compare the approach presented in this paper with other related approaches,The main characteristic of the approach is that it can be implemented by a computer program.

17.

Enumeration Order Equivalence in Rational Numbers





Saeed Asaeedi Farzad Didehvar Aliakbar Safilian《计算机技术与应用:英文》,2013年第11期


The enumeration of elements of c.e. sets in the theory of computability and computational complexity has already been investigated. However, the order of this enumeration has received less attention. The enumeration orders of elements of c.e. sets by means of Turing machines on natural numbers are investigated. In this paper, we consider the enumeration orders of elements of c.e. sets on rational numbers. We present enumeration order reducibility and enumeration order equivalence on rational numbers and propose some lemmas and theorems on these concepts. Also, we show that the theories here hold for Rc and we could repeat the same theories in this domain, in a same way.

18.

Basis Set Extrapolation for the High Resolution Spectroscopy





Kiran Sankar Maiti Christoph Scheurer《化学与化工:英文版》,2013年第11期


Valence and all electron correlation energies of a large set of atoms and molecules with structural motifs from amino acids and peptides at their equilibrium as well as nonequilibrium geometries are calculated at the levels of MP2, RIMP2, and CCSD （T） with Dunnings sequential correlation consistent basis sets. A two point basis set extrapolation scheme for correlation energies to the complete basis set limit based on only DZ （doublezeta） and TZ （triplezeta） results is presented and analyzed. We show that this basis set extrapolation scheme reduces the computational cost by two to three orders of magnitude to obtain the same accuracy as simpler extrapolations from higher order basis set computations.

19.

Fault Diagnosis of a Turbo—unit Based on Wavelet Packet Theory 被引次数：3





HOURong－tao SUNLi－yuan 等《国际设备工程与管理》,2002年第7卷第4期


In this paper we studied the fault feature of the generator set and the characteristics of wavelet packet theory for signal denoising.The vibration signal of the generator set in different states is analyzed by using the signal reconstruction technique of the wavelet packet theory.The time domain method is given for the generator set fault diagnosis.The experiment results show that the wavelet packet theory can be used to directly identify the state of the generator set and provide a credible new idea for complex machinery fault diagnosis.

20.

Offline Simulation of PFC for Hot Rolling Strip





XiangvceiKONG HezhouYE JianzhongXU GuodongWANG LiyingBA XiaorningHE《材料科学技术学报》,2003年第19卷第5期


In order to improve the quality of the strip for the hot continuous rolling, the high accuracy setup control must be applied to production. In the paper, we analyze the PFC (profile and flatness control) system and simulate the setup process. Calculation results are in agreement to the actual measurements. It is the basis on the developing model.
