In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The pro...In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.展开更多
After Wenchuan earthquake,Code for verification of Seismic Protection of Building is revised and the seismic verification for the buildings of primary and secondary schools is upgraded from Class C to Class B. With th...After Wenchuan earthquake,Code for verification of Seismic Protection of Building is revised and the seismic verification for the buildings of primary and secondary schools is upgraded from Class C to Class B. With this background,nearly one hundred buildings of primary and secondary schools in Jilin Province have been reevaluated by the earthquake-resistant standards and a set of simplified earthquake-resistant evaluation methods based on relevant technical standards and regulations were summarized and presented here. These methods can serve as an important reference for future earthquake-resistant evaluation for primary and secondary school buildings as well as a convenient guide for the relevant construction and modification works.展开更多
DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve ...DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.展开更多
基金Supported by the Fundamental Research Funds for the Central Universities (No. NS2012093)
文摘In this paper, we propose a new method that combines collage error in fractal domain and Hu moment invariants for image retrieval with a statistical method - variable bandwidth Kernel Density Estimation (KDE). The proposed method is called CHK (KDE of Collage error and Hu moment) and it is tested on the Vistex texture database with 640 natural images. Experimental results show that the Average Retrieval Rate (ARR) can reach into 78.18%, which demonstrates that the proposed method performs better than the one with parameters respectively as well as the commonly used histogram method both on retrieval rate and retrieval time.
文摘After Wenchuan earthquake,Code for verification of Seismic Protection of Building is revised and the seismic verification for the buildings of primary and secondary schools is upgraded from Class C to Class B. With this background,nearly one hundred buildings of primary and secondary schools in Jilin Province have been reevaluated by the earthquake-resistant standards and a set of simplified earthquake-resistant evaluation methods based on relevant technical standards and regulations were summarized and presented here. These methods can serve as an important reference for future earthquake-resistant evaluation for primary and secondary school buildings as well as a convenient guide for the relevant construction and modification works.
基金Supported by the CNSF(60274026 60174047+1 种基金 30370356) Supported by the Anhui Provinc'e Educational Committee Foundation(2003Kj098)
文摘DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the 'operations' of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
