Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
If you haven’t received the email, please:
|
|
There are 952 papers published in subject: since this site started. |
Select Subject |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
1. Design and Implementation of the Spatial Index Structure QER+-tree | |||
Xiaoli Qi,Chen Xiaoyun ,Ma Jun | |||
Computer Science and Technology 18 August 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:QER+-tree, a new spatial index structure based on quad-tree, R-tree and R+-tree, is proposed. Its data structure, operation algorithms and experimental results are also stated. The main thought of QER+-tree is partitioning the whole index space to multi-levels using quad-tree. Then R-tree or R+-tree is used for indexing the subspaces. This way not only restrains the query space, but also decreases the overlap of index space. In addition, QER+-tree uses the reinserting mechanism while splitting nodes. It can better the trees’ structure. So QER+-tree has more superiority than R-tree and R+-tree. | |||
TO cite this article:Xiaoli Qi,Chen Xiaoyun ,Ma Jun . Design and Implementation of the Spatial Index Structure QER+-tree[OL].[18 August 2008] http://en.paper.edu.cn/en_releasepaper/content/23410 |
2. An Adaptive Watermarking Algorithm in DWT Domain Based on Multi-scale Morphological Gradient | |||
Chen Wenyong,Fan Yanbin | |||
Computer Science and Technology 30 June 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:An adaptive watermarking algorithm in the wavelet domain based on multi-scale morphological gradient is proposed in this paper. Using multi-scale morphological gradient, the distribution and the strength of the sub-block texture after the wavelet package decomposition are analyzed, and the textures of sub-blocks are sorted. According to the texture feature of the sub-block, the sub-block threshold is determined adaptively and the position which is bigger than its threshold is selected as the important coefficient position where the watermarking is embedded. Then, the strength of the position is modulated adaptively through Noise Visibility Function (NVF), which is the best strength to ensure good visual effect of masking to achieve the best effect between robustness and imperceptibility. A large amount of experiments show that the proposed algorithm is effective and robust to common image processing operations. | |||
TO cite this article:Chen Wenyong,Fan Yanbin. An Adaptive Watermarking Algorithm in DWT Domain Based on Multi-scale Morphological Gradient[OL].[30 June 2008] http://en.paper.edu.cn/en_releasepaper/content/22550 |
3. Research of the shortest length of confidence interval for the ratio of variance of two independent normal distribution . | |||
EL KHOUMRANI Abdelali,WANG Zhijian,TRAWRI Aboubakar | |||
Computer Science and Technology 25 June 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In general, for a given confidence level, there are seemingly infinite confidence intervals that may have such a confidence level, thus the question is which one to choose? Evaluation of the shortest length method provides a robust approach in this regard as it localizes the best, or rather true value of the parameter. To this end, in this study, a systematic comparison of the length of confidence interval (c.i) is conducted. The approach adopted involves the equal-tail method based on splitting equally and the shortest confidence method which involves a problem minimization concept. Results obtained from the analysis show the ratio of variance if the sample size not large (n <30) , the length computed by equal-tail method and the shortest method are different. But as the sample size increases, it was found that the lengths approximate each other. But it’s noticeable to add that for the ratio of two variance, if the two degrees of freedom r1 and r2 are different there exist always difference between the two length computed by the two methods. If r1 is less than r2, the difference between the both length is small than if r1 is great than r2. | |||
TO cite this article:EL KHOUMRANI Abdelali,WANG Zhijian,TRAWRI Aboubakar. Research of the shortest length of confidence interval for the ratio of variance of two independent normal distribution . [OL].[25 June 2008] http://en.paper.edu.cn/en_releasepaper/content/22483 |
4. Modeling Multi-agent Systems with Hierarchical Colored Petri Nets | |||
Li Jun,Lan Shunguo | |||
Computer Science and Technology 24 June 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A new approach to model multi-agent systems with hierarchical colored Petri nets is introduced. Every agent has its colored Petri net model, when agents are composed into a MAS, we can.get hierarchical colored Petri net model of the multi-agent system and analysis the multi-agent system at system level and material agent level, properties of the hierarchical colored Petri net model, such as reachability, deadlock detection and avoidance, fairness, will help us analyzing dynamic properties of the multi-agent system. PNAE, Petri nets based multi-agent environment, is briefly introduced | |||
TO cite this article:Li Jun,Lan Shunguo. Modeling Multi-agent Systems with Hierarchical Colored Petri Nets[OL].[24 June 2008] http://en.paper.edu.cn/en_releasepaper/content/22456 |
5. A New Nonrigid Registration Algorithm of Medical Image Based on Random Field Model and B-spline wavelet | |||
Wang Bo ,He Liu ,Li Hua ,Wang Anna ,Wang Haihong | |||
Computer Science and Technology 11 June 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:A new nonrigid registration algorithm is proposed in this paper, which applies Markov-Gibbs random fields model (MGRF) to the nonrigid registration field of medical images. The algorithm is constructed by integrating the nonrigid registration algorithm based on B-spline wavelet and the priori knowledge of the maximum likelihood (ML) and maximum a posteriori (MAP) estimation into a MGRF model. In the MGRF model, the reference and test images are the known conditions and B-spline wavelet is the basis function constructing the nonrigid deformation function. The coefficients of B-spline wavelet in the deformation function are the parameters to be evaluated. The algorithm leads to a better result of registration because the use of the priori knowledge. Various medical images are selected to verify the algorithm, which show that the algorithm proposed in this paper is superior to the nonrigid registration algorithm without the priori knowledge. | |||
TO cite this article:Wang Bo ,He Liu ,Li Hua , et al. A New Nonrigid Registration Algorithm of Medical Image Based on Random Field Model and B-spline wavelet[OL].[11 June 2008] http://en.paper.edu.cn/en_releasepaper/content/22105 |
6. Strategies of Modeling from VDM-SL to JML | |||
Jin Dan ,Yang Zongyuan | |||
Computer Science and Technology 03 June 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:VDM-SL is one of the most popular formal language used in software development, its mathematical approach allows unambiguous specification and development of high integrity software. JML is a behavioral interface specification language tailored to Java(TM). And the existing JML-based tools of debugging, verifying and testing are mature. This paper discusses the two kinds of specification language and provides a novel design mapping VDM-SL to JML of constant values, variables and constraints. The strategies are illustrated with an example. | |||
TO cite this article:Jin Dan ,Yang Zongyuan . Strategies of Modeling from VDM-SL to JML[OL].[ 3 June 2008] http://en.paper.edu.cn/en_releasepaper/content/21947 |
7. The Visualizing of 3-Dimension Images with Visualization Toolkit | |||
Zhao Zheng | |||
Computer Science and Technology 21 May 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Visualization Toolkit (VTK) is an object oriented visualization class library for 3-Dimension graphics, visualization, and image processing. It provides technological support for those who work at visualization. The Visualization Toolkit have so strong ability that it can not only provide powerful visualization, but also support formidable image processing and finite element analysis as well as for scalar, vector, tensor rebuilding. VTK have extremely significance for the researchers who devoted to the application visualization and system development. In this paper the mechanism and visualization structure are introduced, and how to deal with mass data is analyzed. Finally several visualization examples are given. | |||
TO cite this article:Zhao Zheng. The Visualizing of 3-Dimension Images with Visualization Toolkit[OL].[21 May 2008] http://en.paper.edu.cn/en_releasepaper/content/21630 |
8. The Explore On System QoS Metric In Grid | |||
Zhiyong Song | |||
Computer Science and Technology 05 May 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:Nowadays, Service Grid based on OGSA becomes the mainstream. System QoS is an important indicator reflecting system performance and status, as well as a reference of some Grid scheduling system. Due to its complexity of grid environment, the metric method of grid QoS is then a challenging study. In the main body of this paper, we proposed an efficient metric method which classifies QoS parameters according to different categories of resources, calculations and operations, and further make data acquisition and archiving through system performance sensors, then finally value of QoS is able to be calculated according to the calculation method of QoS metric and the requirements of scheduling and optimizing system. | |||
TO cite this article:Zhiyong Song. The Explore On System QoS Metric In Grid[OL].[ 5 May 2008] http://en.paper.edu.cn/en_releasepaper/content/21081 |
9. A Powerful Relevance Feedback Mechanism for Content-based 3D Model Retrieval | |||
Biao Leng,Zheng Qin | |||
Computer Science and Technology 17 April 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:The technique of relevance feedback has been introduced to content-based 3D model retrieval; however, two essential issues which affect the retrieval performance have not been addressed. In this paper, a novel relevance feedback mechanism is presented, which effectively makes use of strengths of different feature vectors and perfectly solves the problem of small sample and asymmetry. During the retrieval process, the proposed method takes the user\\\\\\\ | |||
TO cite this article:Biao Leng,Zheng Qin. A Powerful Relevance Feedback Mechanism for Content-based 3D Model Retrieval[OL].[17 April 2008] http://en.paper.edu.cn/en_releasepaper/content/20625 |
10. A study on computer that assist judge to trial based on SVM | |||
Qiu ZhenYu,Peng Lijuan | |||
Computer Science and Technology 17 April 2008 | |||
Show/Hide Abstract | Cite this paper︱Full-text: PDF (0 B) | |||
Abstract:In this paper, we investigate an approach based on support vector machines (SVM) for analyzing and distinguishing plots of crime with computer, and propose a combination of database and learning scheme to improve the performance and efficiency. The support vector machine (SVM) is a machine-learning method which has been successfully applied to the forecasting area. To prove the feasibility of our assumption, we collect large amount of information concerning with laws、regulations、and judicial cases and take them as the training parameters of SVM to assist judge with crime. Due to the greatness of data, the processing speed is slow. We use data mining technology to search the best optimal data according to SVM algorithm. With the powerful learning and judging capacity of SVM, it can judge an approximate term of imprisonment to suspect which is a useful reference to judge. The ability of SVM to outperform several well-known methods developed for the intelligent search that SVM is a promising technique in the application of assisting judge to trial. | |||
TO cite this article:Qiu ZhenYu,Peng Lijuan. A study on computer that assist judge to trial based on SVM [OL].[17 April 2008] http://en.paper.edu.cn/en_releasepaper/content/20611 |
Select/Unselect all | For Selected Papers |
Saved Papers
Please enter a name for this paper to be shown in your personalized Saved Papers list
|
|
About Sciencepaper Online | Privacy Policy | Terms & Conditions | Contact Us
© 2003-2012 Sciencepaper Online. unless otherwise stated