With the rapid development of vehicle electronic systems, the vehicle software failure rate has also been rising over time. Providing the convenient and effective maintenance on the vehicle software has become a funda...
详细信息
ISBN:
(纸本)9787894631046
With the rapid development of vehicle electronic systems, the vehicle software failure rate has also been rising over time. Providing the convenient and effective maintenance on the vehicle software has become a fundamental block constraining the progress of vehicle electronic industry. A trusted remote remediation framework for vehicle software is presented and realized to enable drivers to online upgrade version or fix bug without needing for driving the vehicles back to the factories or using the specific devices. In this framework, the trusted remediation server takes responsibility for managing and providing the patch programs and the trusted remediation client can download directly from the remediation server to upgrade programs or fix software errors, achieving the self-repair in complex vehicular networks.
This article has been retracted: please see Elsevier Policy on Article Withdrawal ( http://***/locate/withdrawalpolicy ). This article has been retracted at the request of the Infringed Author. The authors have plagia...
This article has been retracted: please see Elsevier Policy on Article Withdrawal ( http://***/locate/withdrawalpolicy ). This article has been retracted at the request of the Infringed Author. The authors have plagiarized part of a paper that had already appeared in ACM MULTIMEDIA '07, (2007) 97 – 106. 10.1145/1291233.1291255. One of the conditions of submission of a paper for publication is that authors declare explicitly that their work is original and has not appeared in a publication elsewhere. Re-use of any data should be appropriately cited. As such this article represents a severe abuse of the scientific publishing system. The scientific community takes a very strong view on this matter and apologies are offered to readers of the journal that this was not detected during the submission process.
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 populatio...
详细信息
To solve the problem of searching for an optimal elimination ordering of Bayesian networks, a novel effective heuristic, MinSumWeight, and an ACS approach incorporated with multi-heuristic mechanism are proposed. The ...
详细信息
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 conve...
详细信息
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.
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...
详细信息
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.
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 e...
详细信息
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.
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 mo...
详细信息
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.
We propose a fast and simple application system of 3D model reconstruction. We acquire range images by using a combination of a regular camera and two types of depth sensors. The reconstruction of a 3D model consists ...
详细信息
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.
暂无评论