检索结果-内蒙古大学图书馆

2nd IEEE International Conference on Computer Science and Information Technology

作者： Yu, Jiang Bin, Du Chengdu Univ Informat Technol Coll Software Engn Chengdu Peoples R China

ISBN: (纸本)9781424445189

A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and algorithm2. algorithm1 is to select those important condition attributes based on attribute frequency function in every iteration. algorithm2 removes redundancy and incompatibility attributes in R found out by algorithm1. The time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.

关键词： rough set discernibility matrix optimal reduction attribute significance complete algorithm

来源：评论

学校读者我要写书评

暂无评论

A Efficiency complete algorithm for Attribute Reduction

A Efficiency Complete Algorithm for Attribute Reduction

引用

2009 2nd IEEE International Conference on Computer Science and Information Technology(第二届计算机科学与信息技术国际会议 ICCSIT2009)

作者： Jiang Yu Du Bin College of Software Engineering Chengdu University of Information Technology Chengdu China

A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was introduced. This algorithm was composed of algorithm1 and ***1 is to select those important condition attributes based on attribute frequency function in every iteration. algorithm2 removes redundancy and incompatibility attributes in R found out by *** time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given. algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.

关键词： rough set discernibility matriz optimal reduction attribute significance complete algorithm

来源：评论

学校读者我要写书评

暂无评论

A Efficiency complete algorithm for Attribute Reduction

A Efficiency Complete Algorithm for Attribute Reduction

引用

2009 2nd IEEE International Conference on Computer Science and Information Technology（ICCSIT 2009）

作者： Jiang Yu College of Software Engineering Chengdu University of Information Technology Chengdu,China Du Bin College of Software Engineering Chengdu University of Information Technology Chengdu,China

A complete algorithm for attribute reduction in rough set theory based on discernibility matrix was *** algorithm was composed of algorithm1 and ***1 is to select those important condition attributes based on attribute frequency function in every ***2 removes redundancy and incompatibility attributes in R found out by *** time complexity of the algorithms in the worst case was analyzed and the proof of its completeness was given,algorithm1 and algorithm2 guarantee that the reduction is probable a smallest or smaller one.

关键词： rough set discernibility matrix optimal reduction attribute significance complete algorithm

来源：评论

学校读者我要写书评

暂无评论

Heuristic complete algorithm for SAT problem by approximation solution

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2007年第9期19卷 1184-1189页

作者： Jing, Ming'e Zhou, Dian Tang, Pushan Zhou, Xiaofang ASIC and System State Key Laboratory Fudan University Shanghai 201203 China Electronic Engineering Department University of Texas at Dallas TX 75083 United States

The advantages of complete algorithm and incomplete algorithm of the SAT problem are integrated into an algorithm. First, an approximation solution is obtained by an incomplete algorithm, as an initial input of the complete algorithm, which is used to phase decision of branched variable. The algorithm guides the complete algorithm first search the subspace that the approximation solutions lie in, which accelerates the process that the solver find the satisfied solution and provides a new approach for SAT problem. Experimental results show that proposed algorithm improves the decision precision and the efficiency of solver and performs well in many instances.

关键词： complete algorithm Decision making Local search SAT problems

来源：评论

学校读者我要写书评

暂无评论

Research on complete algorithms for Minimal Attribute Reduction

Research on Complete Algorithms for Minimal Attribute Reduct...

引用

4th International Conference on Rough Sets and Knowledge Technology (RSKT)

作者： Zhou, Jie Miao, Duoqian Feng, Qinrong Sun, Lijun Tongji Univ Dept Comp Sci & Technol Shanghai 201804 Peoples R China

ISBN: (纸本)9783642029615

Minimal attribute reduction plays all important role in both theory and practice, but it has been proved that finding a minimal reduct of a given decision table is a. NP-hard problem. Some scholars have also pointed out that current heuristic algorithms are incomplete for minimal attribute reduction. Based oil the decomposition principles of a discernibility function, a complete algorithm CAMARDF for finding a minimal reduct is put forward in this paper. Since it depends oil logical reasoning, it can be applied for all decision tables after their discernibility functions constructed reasonably. The efficiency of CAMARDF is illustrated by experiments with UCI data sets further.

关键词： decision table discernibility function minimal reduct complete algorithm

来源：评论

学校读者我要写书评

暂无评论

complete path planning for closed kinematic chains with spherical joints

引用

INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH 2002年第9期21卷 773-789页

作者： Trinkle, JC Milgram, RJ Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Stanford Univ Dept Math Stanford CA 94305 USA

We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configuration space of such systems is a real algebraic variety whose structure is fully determined using techniques from algebraic geometry and differential topology. This structure is then exploited to design a complete path planning algorithm that produces a sequence of compliant moves, each of which monotonically increases the number of links in their goal configurations. The average running time of this algorithm is proportional to n(3). While less efficient than the O(n) algorithm of Lenhart and Whitesides, our algorithm produces paths that are considerably smoother More importantly, our analysis serves as a demonstration of how to apply advanced mathematical techniques to path planning problems. Theoretically, our results can be extended to produce collision-free paths, paths avoiding both link-obstacle and link-link collisions. An approach to such an extension is sketched in Section 4.5, but the details are beyond the scope of this paper Practically, link-obstacle collision avoidance will impact the complexity of our algorithm, forcing us to allow only small numbers of obstacles with "nice" geometry, such as spheres. Link-link collision avoidance appears to be considerably more complex. Despite these concerns, the global structural information obtained in this paper is fundamental to closed kinematic chains with spherical joints and can easily be incorporated into probabilistic planning algorithms that plan collision-free motions. This is also described in Section 4.5.

关键词： exact path planning complete algorithm critical points differential topology algebraic geometry gradient flow

来源：评论

学校读者我要写书评

暂无评论

Expected consistency-based emergency decision making with incomplete probabilistic linguistic preference relations

引用

KNOWLEDGE-BASED SYSTEMS 2019年 176卷 15-28页

作者： Gao, Jie Xu, Zeshui Liang, Zhilei Liao, Huchang Sichuan Univ Inst Disaster Management & Reconstruct Chengdu 610207 Sichuan Peoples R China Southwestern Univ Finance & Econ Sch Econ Math Chengdu 611130 Sichuan Peoples R China Sichuan Univ Business Sch Chengdu 610064 Sichuan Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China

In emergency decision making, it can be difficult for decision-makers (DMs) to identify all possible scenarios due to a lack of information and the evolution of emergency situations. Therefore, this paper presents an incomplete probabilistic linguistic term set (InPLTS), which is a generalized hesitant fuzzy linguistic term set (HFLTS). The InPLTS can more appropriately describe a case in which a DM considers several possible linguistic terms with uncertain probabilities. Furthermore, this work extends the InPLTS to an incomplete probabilistic linguistic preference relation (InPLPR) and proposes a complete algorithm based on an emergency fault tree analysis (EFTA) to estimate missing entries of the InPLPR. The work also investigates the expected consistency, acceptable expected consistency, and consistency-improving methods for the reasonable application of the InPLPR. Then, a consistency-based emergency decision-making method using the InPLPR is proposed to address issues related to a lack of information, uncertainties and dynamic trends. In using this method, DMs can evaluate emergency alternatives of different possible scenarios with the InPLPR, and the impacts of different emergency responses on the evolution of emergencies can also be considered. Finally, the InPLPRs and the abovementioned method are applied to a public health emergency decision-making process to illustrate the advantages of the proposed method. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Incomplete probabilistic linguistic term set (inPLTS) Incomplete probabilistic linguistic preference relation (inPLPR) complete algorithm Expected consistency measure Emergency decision making

来源：评论

学校读者我要写书评

暂无评论

An algorithm for determining copositive matrices

引用

LINEAR ALGEBRA AND ITS APPLICATIONS 2011年第11期435卷 2784-2792页

作者： Xu, Jia Yao, Yong SW Univ Nationalities Coll Comp Sci & Technol Chengdu 610041 Sichuan Peoples R China Chinese Acad Sci Chengdu Inst Comp Applicat Chengdu 610041 Sichuan Peoples R China

In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of (T) over cap (-) = {y is an element of Delta(m)vertical bar beta(T)(y) <= 0} on the standard simplex Delta(m), where each component of the vector beta is -1, 0 or 1. (C) 2011 Elsevier Inc. All rights reserved.

关键词： Copositive matrices Copositive quadratic forms Simplicial subdivision of convex polytope complete algorithm

来源：评论

学校读者我要写书评

暂无评论

Automated software clustering: An insight using cluster labels

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2006年第11期79卷 1632-1648页

作者： Maqbool, O. Babri, H. A. Lahore Univ Management Sci Lahore Pakistan Univ Management & Technol Lahore Pakistan

Clustering techniques have shown promising results for the architecture recovery and re-modularization of legacy software systems. Clusters that are obtained as a result of the clustering process may not be easy to interpret until they are assigned appropriate labels. Automatic labeling of clusters reduces the time required to understand them and can also be used to evaluate the effectiveness of the clustering process, if the assigned labels are meaningful and convey the purpose of each cluster effectively. In this paper, we present a labeling scheme based on identifiers of an entity. As the clustering process proceeds, keywords within identifiers are ranked using two ranking schemes: frequency and inverse frequency. We present experimental results to demonstrate the effectiveness of our labeling approach. A comparison between the ranking schemes reveals the inverse frequency scheme to form more meaningful labels, especially for small clusters. A comparison of clustering results of the complete and weighted combined algorithms based on labels of the clusters produced by them during clustering shows that the latter produces a more understandable cluster hierarchy with easily identifiable software sub-systems. (c) 2006 Elsevier Inc. All rights reserved.

关键词： software clustering cluster labeling weighted combined algorithm complete algorithm

来源：评论

学校读者我要写书评

暂无评论

Solving SAT problem by heuristic polarity decision-making algorithm

引用

Science in China(Series F) 2007年第6期50卷 915-925页

作者： JING MingE ZHOU Dian TANG PuShan ZHOU XiaoFang ZHANG Hua State Key Laboratory of ASIC & System Microelectronics Department Fudan University Shanghai201203 China E. E. Department the University of Texas at Dallas TX 75083 USA

This paper presents a heuristic polarity decision-making algorithm for solving Boolean satisfiability （SAT）. The algorithm inherits many features of the current state-of-the-art SAT solvers, such as fast BCP, clause recording, restarts, etc. In addition, a preconditioning step that calculates the polarities of variables according to the cover distribution of Karnaugh map is introduced into DPLL procedure, which greatly reduces the number of conflicts in the search process. The proposed approach is implemented as a SAT solver named DiffSat. Experiments show that DiffSat can solve many ＂real-life＂ instances in a reasonable time while the best existing SAT solvers, such as Zchaff and MiniSat, cannot. In particular, DiffSat can solve every instance of Bart benchmark suite in less than 0.03 s while Zchaff and MiniSat fail under a 900 s time limit. Furthermore, DiffSat even outperforms the outstanding incomplete algorithm DLM in some instances.

关键词： SAT problem DPLL complete algorithm decision-making

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：