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 mea...
详细信息
In this paper, a novel method is proposed for judging whether a component set is a consistency-based diagnostic set, using SAT solv- ers. Firstly, the model of the system to be diagnosed and all the observations are d...
详细信息
In this paper, a novel method is proposed for judging whether a component set is a consistency-based diagnostic set, using SAT solv- ers. Firstly, the model of the system to be diagnosed and all the observations are described with conjunctive normal forms (CNF). Then, all the related clauses in the CNF files to the components other than the considered ones are extracted, to be used for satisfiability checking by SAT solvers. Next, all the minimal consistency-based diagnostic sets are derived by the CSSE-tree or by other similar algorithms. We have implemented four related algorithms, by calling the gold medal SAT solver in SAT07 competition – RSAT. Experimental results show that all the minimal consistency-based diagnostic sets can be quickly computed. Especially our CSSE-tree has the best effciency for the singleor double-fault diagnosis.
Node classification is an essential problem in graph learning. However, many models typically obtain unsatisfactory performance when applied to few-shot scenarios. Some studies have attempted to combine meta-learning ...
详细信息
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 wh...
详细信息
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.
This paper proposes a novel registration algorithm based on Pseudo-Polar Fast Fourier Transform (FFT) and Analytical Fourier-Mellin Transform (AFMT) for the alignment of images differing in translation, rotation angle...
详细信息
Large scale terrain visualization with high-resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method b...
详细信息
1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],ind...
详细信息
1Introduction and main contributions In the field of social networks and knowledge graphs,semi-supervised learning models based on graph convolutional networks have achieved great success in node classification[1],inductive node embedding[2],link prediction[3],and *** semi-supervised models based on graph convolutional network(GCN)[4]expect to obtain more feature information of a graph or accelerate the training.
A novel hybrid algorithm based on the AFTER (Aggregated forecast through exponential re-weighting) and the modified particle swarm optimization (PSO) is proposed. The combining weights in the hybrid algorithm are trai...
详细信息
Link analysis is an important way to discover potential web communities. This paper analyzes the characteristics of the Web link structure, and studies the traditional maximum flow algorithm and the maximum flow algor...
详细信息
1 Introduction Local search method is a rising star for solving combinatorial optimization problems in recent years,and the state-of-the-art local search-based incomplete Maximum Satisfiability(MaxSAT)solversshowpromi...
详细信息
1 Introduction Local search method is a rising star for solving combinatorial optimization problems in recent years,and the state-of-the-art local search-based incomplete Maximum Satisfiability(MaxSAT)solversshowpromisingperformance even competitive to many complete solvers in recent MaxSAT Evaluations.
暂无评论