Several artificial intelligent methods, including Support Vector Regression (SVR), Artificial Neural Networks (ANNs), and Partial Least Square (PLS) are used for the multivariate calibration in the determination of th...
详细信息
The ITO algorithm, which is a new kind of simulation optimization methods and is based on the hypothesis testing and Ito stochastic process, is proposed in this paper. The local strategies and global strategies can be...
详细信息
The ITO algorithm, which is a new kind of simulation optimization methods and is based on the hypothesis testing and Ito stochastic process, is proposed in this paper. The local strategies and global strategies can be utilized to design the ITO algorithm. The experimental results show that the ITO algorithm is suitable for the simulation optimization problems. The methods to improve the evaluation credibility in the simulation optimization are also discussed. Moreover, in this paper, the credibility based on the hypothesis testing is also proposed.
How to simplify a large scale tetrahedral dataset in order to use in the real time rendering is of more importance. A novel technique based on triangle decimation for tetrahedral simplification is described here. A tr...
详细信息
How to simplify a large scale tetrahedral dataset in order to use in the real time rendering is of more importance. A novel technique based on triangle decimation for tetrahedral simplification is described here. A triangle area ratio is defined as cost function for every triangular in the model. Through this ratio, a list of priority sequences is obtained in the per-compute period. The triangle which of high priority will be deleted firstly. Compared to the published paper, this method can be used to delete at least 8 tetrahedral in one triangle decimation cycle. In the test model, we can delete at most 13 tetrahedral one time. The results of this technique are of high practical use especially in the real time compression transformation of tetrahedral, finite element computation and rendering.
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD based symbolic model checking of LTL and ACTL properties in recent years. For general LTL and ACTL properties, BMC has tra...
详细信息
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD based symbolic model checking of LTL and ACTL properties in recent years. For general LTL and ACTL properties, BMC has traditionally aimed mainly at error detection, taking the advantage that error detection may only need to explore a small portion of the whole state space. Recently bounded model checking aiming at verification has also been proposed. The aim of this paper is to exploit the strength of BMC methods by combining different BMC approaches and compare it with the traditional BDD-based symbolic methods. We consider two bounded model checking methods, which are for error detection and verification of ACTL properties, respectively, and then combine them to a BMC algorithm. Based on this algorithm, we have implemented a tool named BMV (bounded model verifier), and carried out a number of experiments, and we have then compared BMV with Cadence SMV. The experimental results show that for certain types of problems, both for verification and error detection, BMV can perform much better than Cadence SMV in both time and memory consumption, and we believe that this is the first attempt to have an implementation of a method that combines practical error detection and verification of ACTL properties by SAT-based model checking.
Regression testing, which plays an important role in software maintenance, usually relies on test adequacy criteria to select and prioritize test cases. However, with the wide use and reuse of black-box components, su...
详细信息
Regression testing, which plays an important role in software maintenance, usually relies on test adequacy criteria to select and prioritize test cases. However, with the wide use and reuse of black-box components, such as reusable class libraries and COTS components, it is challenging to establish test adequacy criteria for testing software systems built on components whose source code is not available. Without source code or detailed documents, the misunderstanding between the system integrators and component providers has become a main factor of causing faults in component-based software. In this paper, we apply mutation on interface contracts, which can describe the rights and obligations between component users and providers, to simulate the faults that may occur in this way of software development. The mutation adequacy score for killing the mutants of interface contracts can serve as a test adequacy criterion. We performed an experimental study on three subject systems to evaluate the proposed approach together with four other existing criteria. The experimental results show that our adequacy criterion is helpful for both selecting good-quality test cases and scheduling test cases in an order of exposing faults quickly in regression testing of component-based software.
作者:
Yanci ZhangHanqiu SunEnhua WuState Key Lab.of Computer Science
Institute of SoftwareChinese Academy of Sciences Department of Computer Science and EngineeringThe Chinese University of Hong Kong Faculty of Science and TechnologyUniversity of Macau
In this paper,we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple s...
详细信息
In this paper,we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple surfaces for the realistic rendering of complex point-set models. Based on this observation,we developed the coarse,normal-mapped B-spline surfaces to approximate the original point datasets with fine surface details. In our algorithm,a genetic clustering algorithm is proposed to automatically segment the point samples into several clusters according to their statistical properties,and a network of B-spline patches with normal maps are constructed according to the clustering results. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities.
Activities of drug molecules can be predicted by QSAR (quantitative structure activity relationship) models, which overcomes the disadvantages of high cost and long cycle by employing the traditional experimental meth...
详细信息
ISBN:
(纸本)9781601320254
Activities of drug molecules can be predicted by QSAR (quantitative structure activity relationship) models, which overcomes the disadvantages of high cost and long cycle by employing the traditional experimental method. With the fact that the number of drug molecules with known activity is less than that of unknown, it is important to predict molecular activities utilizing unlabeled instances. Here, semi-supervised learning (SSL) is introduced and a SSL method, Co-Training is investigated on predicting drug activities utilizing unlabeled instances. At the same time, the numerous features extracted from the structures of drug molecules affect prediction accuracy of QSAR models. Therefore, a novel algorithm named FESCOT is proposed, which applies an embedded feature selection method to remove redundant and irrelevant features for Co-Training. Numerical experimental results on a data set of molecular activities show that Co-Training improves prediction accuracy of molecular activities with unlabeled instances, and feature selection furthermore helps to improve the prediction ability of Co-Training.
Based on El Gamal homomorphic encryption, a protocol of secure multi-party multi-data ranking problem was proposed. The problem extended millionaires' problem. Furthermore, the correctness and security of this pro...
详细信息
Based on El Gamal homomorphic encryption, a protocol of secure multi-party multi-data ranking problem was proposed. The problem extended millionaires' problem. Furthermore, the correctness and security of this protocol were shown in semi-honest model, using the definition of secure multi-party computation. The solution of secure multi-party multi-data ranking problem can form a fundamental basis of new-style electronic transaction, such as private biding and auction, secret online transaction and so on.
In wireless ad hoc networks, the route discovery process or the data forwarding process is vulnerable to attackers. In this paper, we address the data forwarding security problem and propose a light-weight secure data...
详细信息
In wireless ad hoc networks, the route discovery process or the data forwarding process is vulnerable to attackers. In this paper, we address the data forwarding security problem and propose a light-weight secure data forwarding protocol, which utilizes one-way hash chains to achieve the message integrity, where the intermediate nodes can effectively detect the fault link and the source node of the packet can correctly judge whether the peer-to-peer data transfer is
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especiall...
详细信息
Recommendation system is one of the most important technologies applied in e-commerce. Similarity measuring method is fundamental to collaborative filtering algorithm, and traditional methods are inefficient especially when the user rating data are extremely sparse. Based on the outstanding characteristics of Cloud Model on the process of transforming a qualitative concept to a set of quantitative numerical values, a novel similarity measuring method, namely the likeness comparing method based on cloud model (LICM) is proposed in this paper. LICM compares the similarity of two users on knowledge level, which can overcome the drawback of attributes' strictly matching. This work analysis traditional methods throughly and puts forward a novel collaborative filtering algorithm, which is based on the LICM method. Experiments on typical data set show the excellent performance of the present collaborative filtering algorithm based on LICM, even with extremely sparsity of data.
暂无评论