期刊：
2009 3RD INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING, VOLS 1-11,2009年:2128-+
通讯作者：
Hu, Jiwen
作者机构：
[Hu, Jiwen] Nanhua Univ, Coll Math & Phys, Hengyang 421001, Peoples R China.;[Qian, Shengyou; Hu, Jiwen] Hunan Normal Univ, Coll Phys & Informat Sci, Changsha 410081, Peoples R China.
通讯机构：
[Hu, Jiwen] N;Nanhua Univ, Coll Math & Phys, Hengyang 421001, Peoples R China.
会议名称：
The 3rd International Conference on Bioinformatics and Biomedical Engineering(iCBBE 2009)(第三届生物信息与生物医学工程国际会议)
会议时间：
2009-06-11
会议地点：
北京
会议论文集名称：
The 3rd International Conference on Bioinformatics and Biomedical Engineering(iCBBE 2009)(第三届生物信息与生物医学工程国际会议)论文集
关键词：
Subharmonic;dual-driving driving;HIFU therapy;signal-to-noise ratio
摘要：
Cavitation bubbles have aroused mush attention for their significant promise in ultrasonic contrast imaging, targeted therapy and monitoring of high-intensity focused ultrasound (HIFU) therapy. In this paper, a model using a dual-frequency driving pressure for subharmonics generation from cavitation bubbles is constructed. By calculation of the Fourier transformation to the Keller-Milksis equation, we show that bubbles with appropriate radii produce significant subharmonic components within backscatter spectrum. In contrast to the case of single-frequency driving pressure, subharmonics at dual-frequency driving pressure can be generated for higher value of mechanical index (MI) and wider range of initial radii of bubbles. The subharmonic wave is not easy to be absorbed by soft tissues during its propagation compared with higher harmonic wave, and thus subharmonic mode-imaging method for monitoring HIFU therapy maybe has a potential application in providing proper signal-to-noise ratio.
期刊：
SCIENCE IN CHINA SERIES A-MATHEMATICS,2008年51(8):1537-1548 ISSN：1006-9283
通讯作者：
Shu Shi
作者机构：
[Shu Shi; Zhong LiuQiang] Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Peoples R China.;[Shu Shi; Zhong LiuQiang] Hunan Key Lab Computat & Simulat Sci & Engn, Xiangtan 411105, Peoples R China.;[Sun Dudu] Chinese Acad Sci, Grad Univ, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, Beijing 100190, Peoples R China.;[Tan Lin] Nanhua Univ, Dept Math Phys, Hengyang 421001, Peoples R China.
通讯机构：
[Shu Shi] X;Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Peoples R China.
会议名称：
8th National Conference on Computational Mathematics
会议时间：
OCT 25-29, 2007
会议地点：
Sichuan Univ, Sichuan, PEOPLES R CHINA
会议主办单位：
[Zhong LiuQiang;Shu Shi] Xiangtan Univ, Sch Math & Computat Sci, Xiangtan 411105, Peoples R China.^[Zhong LiuQiang;Shu Shi] Hunan Key Lab Computat & Simulat Sci & Engn, Xiangtan 411105, Peoples R China.^[Sun Dudu] Chinese Acad Sci, Grad Univ, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, Beijing 100190, Peoples R China.^[Tan Lin] Nanhua Univ, Dept Math Phys, Hengyang 421001, Peoples R China.
关键词：
preconditioner;higher order edge finite element;stable decomposition
摘要：
In this paper, we are concerned with the fast solvers for higher order edge finite element discretizations of Maxwell’s equations. We present the preconditioners for the first family and second family of higher order Nédélec element equations, respectively. By combining the stable decompositions of two kinds of edge finite element spaces with the abstract theory of auxiliary space preconditioning, we prove that the corresponding condition numbers of our preconditioners are uniformly bounded on quasi-uniform grids. We also present some numerical experiments to demonstrate the theoretical results.
摘要：
In this paper, the basic definitions of inner-product and outer-product of Vague set are introduced. Based on that, some characters of them are brought forward and the particular proof are presented afterward.
作者机构：
[Pan, LQ] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.;Nahua Univ, Inst Engn & Technol, Dept Math & Phys, Hengyang 421001, Peoples R China.
通讯机构：
[Pan, LQ] H;Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430074, Peoples R China.
关键词：
DNA computing;Maximal clique problem;NP-complete problem
摘要：
The maximal clique problem is an NP (nondeterministic polynomial time)-complete problem. We present an algorithm that solves maximal clique problem within the framework of a surface-based model of computation. The time complexity of our algorithm is O(n2), and the number of kinds of short oligonucleotides needed to encode maximal clique problem is n + 3, where n is the size of the graph. In our algorithm, immobilizing DNA (deoxyribonucleic acid) strands to a solid surface reduces the possibility of error resulting from the loss of DNA strands in solution. A solution-based algorithm solving maximal clique problem has previously been proposed by Qi Ouyang et al.. In their algorithm, the number of enzyme is equal to the number of vertices of the graph, which causes the difficulty of encoding and scaling up, because the DNA sequences of restriction enzyme sites should not be present in otherwhere. Using surface-based model, we designed an algorithm for maximal clique problem, which needs only one enzyme.
