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

An Algorithm Based on Resolution for the Satisfiability Problem

An Algorithm Based on Resolution for the Satisfiability Prob...

The 2nd IEEE International Conference on Advanced Computer Control(第二届先进计算机控制国际会议 ICACC 2010)

作者： Youjun Xu Dantong Ouyang Yuxin Ye College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781424458455;9781424458486;9781424458479;9781424458462

The satisfiability problem is the core problem in artificial intellgence. The algorithm directional resolution(DR) is a well known method based on resolution for satisfiability problem. But the number of clauses has great impact on the efficiency of the method. In this paper, an algorithm SRDR is proposed to solve the problem. SRDR is based on algorithm DR and splitting rule. By using splitting rule, the number of clauses can be reduced obviously. Furthermore, the strategy MO is designed for SRDR. With the strategy, we can get a better order of variables and the efficiency of SRDR is improved. The experimental data shows that SRDR is more efficient that DR.

关键词： satisfiability problem directional resolution splitting rule SRDR strategy MO

来源：评论

学校读者我要写书评

暂无评论

LLA: A New High Precision Mobile Node Localization Algorithm Based on TOA

引用

Journal of Communications 2010年第8期5卷 604-611页

作者： Li, Ruixue Fang, Zhiyi College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Mobile node localization is one of the challenging and crucial issues in wireless sensor networks. The paper proposed a new approach to mobile localization, called LLA (Lee Localization Algorithm), to mitigate TOA measurement errors. The algorithm was divided into three phases: (1) pre-ranging algorithm was proposed to initialize localization by employing TOA method;(2) refinement algorithm was designed to filter out bad nodes;(3) smallest circle covering algorithm was developed to deal with good nodes to complete the localization. Experimental results show that the presented approach efficiently eliminates the effects of the measurement bias and obtains a high accuracy of 2m as well as low complexity, outperforming traditional trilateration. © 2010 ACADEMY PUBLISHER.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

RMADV-Hop: An Improved DV-Hop Localization Algorithm

RMADV-Hop: An Improved DV-Hop Localization Algorithm

引用

International Conference on Information Technology: New Generations (ITNG)

作者： Tingting Yi Zhiyi Fang Ruixue Li Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China

In recent years, with the development of the wireless sensor networks, the localization method receives the attention of many researchers. However, due to the network cost and characteristics of sensor nodes, most of the localization algorithms are not well suitable for the wireless sensor network, positioning error is relatively large. Based on the regular moving anchor node and RSSI ranging technique assisting positioning, in this paper, we proposed the RMADV-Hop (Regular Moving Anchor DV-Hop) localization algorithm to improve the DV-Hop algorithm. In the same network condition, we simulated these two localization algorithms using the omnet++ simulation software. Simulation results show that RMADV-Hop algorithm uses less anchor nodes than the DV-Hop algorithm, reduces the cost of network hardware, approximately achieves the evenly distribution of anchor nodes, and can get higher positioning accuracy than the DV-Hop algorithm in the randomly distributed network.

关键词： Wireless sensor networks Costs Algorithm design and analysis Computer networks Hardware Military computing Information technology educational institutions Computer science educational technology

来源：评论

学校读者我要写书评

暂无评论

Model counting with boolean algebra and extension rule

引用

Journal of Convergence Information Technology 2010年第7期5卷 7-7页

作者： Xu, Youjun Ouyang, Dantong Ye, Yuxin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Model counting is an important problem in artificial intelligence and is applied in several areas of information science. Extension rule is a method which could be used to count models. But it's not appropriate when clause length is short or clause number is huge. After studying extension rule, we found that the satisfiability problem could be solved by hitting set algorithms. And the models could be counted with extension rule after calculating hitting sets of a clause set. Therefore, we proposed an algorithm MCBE in this paper. With Boolean algebra, MCBE could easily calculate hitting sets of a clause set. Then, it gives the number of models with extension rule. The test results show that when clause length is short and clause number is big enough, the algorithm is more efficiency than the algorithm CDP and CER.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

Solving SAT Problem with Boolean Algebra

Solving SAT Problem with Boolean Algebra

引用

Japan-China Joint Workshop on Frontier of Computer Science and Technology (FCST)

作者： Youjun Xu Dantong Ouyang Yuxin Ye Jialiang He Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

The satisfiability (SAT) problem is an important problem of automated reasoning. In the past decades, many methods of SAT are proposed, such as method based on resolution, method based on tableau and method based on extension rule. Based on the study of extension rule, we find that the SAT problem can be solved with hitting set algorithms. If we can find a hitting set of a clause set, and if there is not any pair of complementary literals in the hitting set, the clause set is satisfiable. Algorithm BHS based on Boolean algebra proposed by Jiang is an efficient hitting set algorithm. SSBF proposed in this paper is a revised algorithm of BHS that can be used to judge the satisfiability of a clause set. The test result shows that SSBF is an efficient algorithm.

关键词： Algorithm design and analysis Boolean algebra Cognition Atomic measurements Computers Computer science

来源：评论

学校读者我要写书评

暂无评论

A modal representation of RCC62

A modal representation of RCC62

引用

International Conference on Computer Sciences and Convergence Information Technology (ICCIT)

作者： Qian Fu Ji-hong Ouyang Da-you Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

The major problem in developing a useful formalism for reasoning about spatial information is the trade off between expressive power and computational tractability. Based on Bennett's modal representation of convex-hull and the RCC62 model which describes the topological relation between simple concave regions, the modal representation of RCC62 is presented in this paper, which has a theoretical advantage over 1st-order representations.

关键词： Cognition Calculus Computational modeling Encoding knowledge engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

An Improved Particle Swarm Algorithms for Global Optimization

An Improved Particle Swarm Algorithms for Global Optimizatio...

引用

International Conference on Machine Vision and Human-Machine Interface (MVHI)

作者： Ye Tian Dayou Liu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

Particle swarm optimization (PSO) algorithm is a robust and efficient approach for solving complex real-world problems. In this paper, a modified particle swarm algorithm (IMPSO) is introduced for unconstrained global optimization. The whole swarm is partitioned to three different sub-populations according to their fitness, and different velocity updating strategies are used to different sub-populations. Besides, we take advantage of crossover to maintain the diversity of the swarm and avoid getting into local optimum. IMPSO are extensively compared with other two modified PSO algorithms on three well-known benchmark functions with different dimensions. Experimental results show that IMPSO achieves not only better solutions but also faster convergence.

关键词： Particle swarm optimization Partitioning algorithms educational institutions Marine animals Birds Testing Machine vision Man machine systems Computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach for Modeling Direction Relations Between Uncertain Regions

A Novel Approach for Modeling Direction Relations Between Un...

引用

International Conference on Machine Vision and Human-Machine Interface (MVHI)

作者： Yiqun Dong Dayou Liu Fang Wang Ye Tian Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Jilin University Changchun Jilin CN

Conventional models based on crisp regions can not deal with the Direction Relations between Uncertain Regions (DRUR). Using broad boundary to represent the uncertain boundary, a novel approach is proposed based on model SK for modeling DRUR in this paper. DRUR are described as the combinations of basic cardinal direction relations, then we study the composition of DRUR, and a method is put forward for calculating this composition.

关键词： Uncertainty Tiles Machine vision Man machine systems educational institutions Computer science educational technology Laboratories Computer interfaces Computer vision

来源：评论

学校读者我要写书评

暂无评论

A self-adaptive differential evolution algorithm for binary CSPs

A self-adaptive differential evolution algorithm for binary ...

引用

International Conference on Natural Computation

作者： Fu, Hongjie Ouyang, Dantong Xu, Jiaming Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin Teachers Institute of Engineering and Technology Changchun China College of Software Northeast Normal University Changchun China

ISBN: (纸本)9781424459612

A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CR adaptively, taking account of the different distribution of population. In order to balance of an individual's exploration and exploitation capability for different evolving phase, F and CR equal to two different self-adjusted nonlinear functions. F and CR vary dynamically with each generation evolution. SADE maintains the diversity of population and improves the global convergence ability. It also improves the efficiency and success rate and avoids the premature convergence. Simulation and comparisons based on test-sets of CSPs demonstrate the effectiveness, efficiency and robustness of the proposed algorithm. © 2010 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Solving SAT Problem with a Revised Hitting Set Algorithm

Solving SAT Problem with a Revised Hitting Set Algorithm

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Youjun Xu Dantong Ouyang Yuxin Ye Jialiang He College of Computer Science and Technology Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun China

ISBN: (纸本)9781424458219;9781424458240

The satisfiability(SAT) problem is a core problem of artificial intelligence. Research findings in SAT are widely used in many areas. The main methods solving SAT problem are resolution principle, tableau calculus and extension rule. Besides methods mentioned above, we find that the SAT problem can be solved with hitting set algorithms. If a set of clause is satisfiable, there must be a hitting set of the clause set which containing no complementary pairs of literals. Algorithm NEYVHS-tree is an efficient hitting set algorithm proposed by Ouyang. RNHST proposed in this paper is a revised algorithm in respect of ***-tree. It judges the satisfiability of a clause set by confirming the existence of the set's hitting set without complementary pairs of literals. The test result shows that RNHST is an efficient algorithm.

关键词： satisfiability problem hitting set minimal hitting set extension rule NEWHS-tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：