检索结果-内蒙古大学图书馆

Gray cerebrovascular image skeleton extraction algorithm using level set model

Journal of Multimedia 2010年第3期5卷 208-215页

作者： Wu, Jian Zhang, Guang-ming Xia, Jie Cui, Zhi-ming Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China The Institute of Intelligent Information Processing and Application Soochow University Suzhou 215006 China

The ambiguity and complexity of medical cerebrovascular image makes the skeleton gained by conventional skeleton algorithm discontinuous, which is sensitive at the weak edges, with poor robustness and too many burrs. This paper proposes a cerebrovascular image skeleton extraction algorithm based on Level Set model, using Euclidean distance field and improved gradient vector flow to obtain two different energy functions. The first energy function controls the obtain of topological nodes for the beginning of skeleton curve. The second energy function controls the extraction of skeleton surface. This algorithm avoids the locating and classifying of the skeleton connection points which guide the skeleton extraction. Because all its parameters are gotten by the analysis and reasoning, no artificial interference is needed. © 2010 ACADEMY PUBLISHER.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Construction of a Sequence- and Backbone-Dependent Rotamer Library by Hidden-Markov Model

Construction of a Sequence- and Backbone-Dependent Rotamer L...

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Wei Wen Qiang Qiang Lü Peng Yang Lingyun Yang Jinzhen Wu Xu Huang School of Computer Science and Technology Soochow University Suzhou China Information Processing Technology Jiangsu Provincial Key Lab for Computer Suzhou China

Sidechain prediction is an important subproblem of protein design and structure prediction. Construction of rotamer library is the basis for protein sidechain prediction because it provides the basic searching space for prediction. However, the state-of-the-art rotamer libraries focus on the statistical information of individual amino acids, ignoring the direct affection of its adjacent amino acids. This article presents a sequence- and backbone-dependent rotamer library. Both the conformation information of adjacent amino acids and torsion angle of the current residue are taken into account to construct a sequence- and backbone-dependent library by HMM. Evaluation on all 13 free modeling targets of CASP8 based on our rotamer library is conducted. Comparing with side-chain prediction based on the state-of-the-art rotamer library, our library outperforms the sidechain prediction accuracy on all the test targets to a certain extent.

关键词： Libraries Proteins Spine Amino acids Bayesian methods Hidden Markov models Predictive models Space technology Accuracy Statistical analysis

来源：评论

学校读者我要写书评

暂无评论

The application of flash into M-learning in 3G initial stage

The application of flash into M-learning in 3G initial stage

引用

International Symposium on Knowledge Acquisition and Modeling, KAM

作者： Yue-ming Tang Quan Liu Ling-ling Wang Department of Educational Technology Henan Normal University Xinxiang Henan China Institute of Computer Science and Technology Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou Jiangsu China

With the development of the 3G technology, M-learning enters a period of rapid development. But meanwhile 3G also restrains the development of M-learning due to several drawbacks in its early days. According to the application analysis, it comes out Flash has its unique features: small capacity, easy to develop high-quality and etc, which can make up for 3G initial stage's disadvantages. Through case design, this paper proves that Flash can be a new effective approach and way for M-learning in the 3G network. In the end, from the aspects of technical and artistic, this paper makes a further research on how to improve the flash animation to serve the M-learning better.

关键词： Multimedia communication Education Animation

来源：评论

学校读者我要写书评

暂无评论

Bisimulations for Open Processes in Higher Order p-Calculus

Bisimulations for Open Processes in Higher Order p-Calculus

引用

Theoretical Aspects of Software Engineering (TASE)

作者： Zining Cao Department of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou China

In this paper, we propose open bisimulations for open processes in higher order π-calculus. The equivalence of open bisimulations and other bisimulations for open processes is proved. Furthermore, we present a symbolic operational semantics of higher order open processes, and give some symbolic bisimulations for higher order processes. The relation between symbolic bisimulations and other bisimulations is also studied. At last, we introduce a higher order π-calculus with sum and conditional operators, then we study open bisimulations and symbolic bisimulations for this calculus.

关键词： Context Semantics Manganese Calculus Syntactics Tin Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A novel hybrid approach for incomplete knowledge system mining based on approximate rough entropy lattice

引用

Journal of Computational information Systems 2010年第5期6卷 1651-1659页

作者： Ding, Weiping Wang, Jiandong Zhu, Hao Guan, Zhijing Shi, Quan College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China School of Computer Science and Technology Nantong University Nantong 226019 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

Based on some special advantages of both rough set analysis in knowledge reduction and formal concept analysis in formal concept representation, a novel hybrid approach for incomplete knowledge system mining based on approximate rough entropy concept is presented in this paper. First of all, the incomplete information system is transformed into the complete knowledge one by the attribute reduction of condition entropy. Secondly, the approximate condition entropy lattice mining model is constructed and all approximate knowledge rules are extracted from superconcept-subconcept relations implied in the formal context. Experiments on the UCI data sets show this approach is better on the knowledge reduction and mining capability. Copyright © 2010 Binary information Press May, 2010.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Research and application of extension rough formal concept mining algorithm based on dynamic co-evolution

引用

Journal of information and Computational Science 2010年第12期7卷 2377-2384页

作者： Ding, Weiping Wang, Jiandong Duan, Weihua Guan, Zhijing College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China School of Computer Science and Technology Nantong University Nantong 226019 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

A quick and effective extension rough formal concept mining algorithm named DCO-ERFC based on dynamic co-evolution is put forward in this paper. Firstly, some electronic patient records are converted into different records in order to further be classified, reduced and pre-processed according to special features of medical records. Secondly, the rough concept lattice and extension transformation knowledge are related, and a dynamic cooperative extension decision rule lattice is constructed. It can well reduce the mutative knowledge attributions in the database and mine all no redundancy disease diagnosis rules by avoiding finding frequency items. Finally DCO-ERFC algorithm is applied in some experiments of UCI data sets and real medical database. The results show that DCO-ERFC algorithm can well extract helpful medical diagnosis rules, and it is better than other algorithms on the collaborative mining capability. © 2010 Binary information Press.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

A novel ant colony genetic hybrid algorithm

Journal of Software

引用

Journal of Software 2010年第11期5卷 1179-1186页

作者： Gao, Shang Zhang, Zaiyue Cao, Cungen School of Computer Science and Technology Jiangsu University of Science and Technology Zhenjiang 212003 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

By use of the properties of ant colony algorithm and genetic algorithm, a novel ant colony genetic hybrid algorithm, whose framework of hybrid algorithm is genetic algorithm, is proposed to solve the traveling salesman problems. The selection operator is an artificial version of natural selection, and chromosomes with better length of tour have higher probabilities of being selected in the next generation. Based on the properties of pheromone in ant colony algorithm the ant colony crossover operation is given. Four mutation strategies are put forward using the characteristic of traveling salesman problems. The hybrid algorithm with 2-opt local search can effectively find better minimum beyond premature convergence. Ants choose several tours based on trail, and these tours will replace the worse solution. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, all the 4 hybrid algorithms are proved effective. Especially the hybrid algorithm with strategy D is a simple and effective better algorithm than others. © 2010 ACADEMY PUBLISHER.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Rough Knowledge Mining Algorithm Based on Extension Decision Rule Lattice for Electronic Patient Record

Rough Knowledge Mining Algorithm Based on Extension Decision...

引用

International Conference on Artificial Intelligence and Computational Intelligence (AICI)

作者： Weiping Ding Jiandong Wang Zhijing Guan Hao Zhu Quan Shi College of Information Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China School of Computer Science and Technology Nantong University Nantong China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou China

Electronic patient record mining deals with the implicit and useful medical information stored in the electronic patient record database. By this technology the useful knowledge is extracted and the scientific and auxiliary decision-making is proved for the diagnosis and treatment of disease. In this paper, a rough knowledge mining algorithm (named RKMA) based on extension decision rule lattice is presented. Firstly the electronic patient records are converted into different recordings in order to be further reduced and classified in the medical database. Secondly both variable rough thresholding and concept lattice are related. A novel extension decision rule lattice is constructed. This extension lattice can rough reduce the mutative knowledge attributions and well mine all disease diagnosis rules without more redundancy by avoiding finding frequent item sets. The experimental results show this RKMA algorithm well can mine consistent decision rules, and it is better robustness than other algorithms on the capability of attribution reduction and rule mining for electronic patient records.

关键词： Lattices Data mining Databases Medical diagnostic imaging Diseases Algorithm design and analysis Set theory

来源：评论

学校读者我要写书评

暂无评论

Image segmentation based on fuzzy entropy and Bee Colony Algorithm

Image segmentation based on fuzzy entropy and Bee Colony Alg...

引用

International Conference on Natural Computation (ICNC)

作者： Yonghao Xiao Weiyu Yu Jing Tian Foshan University Foshan China School of Electronic and Information Engineering South China University of Technology Guangzhou China Provincial Key Laboratory of Computer Information Processing Technology Soochow University China Singapore

Image segmentation based on Bee Colony Algorithm (BCA) and fuzzy entropy is presented in this paper. The fuzzy entropy function is simplified with single parameter. The BCA is applied to search the minimum value of fuzzy entropy function. According to the minimum function value, the optimal image threshold is obtained. Experimental results are provided to demonstrate the superior performance of the proposed approach.

关键词： Entropy Image segmentation Lead Noise Optimization Mathematical model Equations

来源：评论

学校读者我要写书评

暂无评论

Leakage-resilient identity-based encryption scheme

Leakage-resilient identity-based encryption scheme

引用

International Conference on Networked Computing and Advanced information Management (NCM)

作者： Xizhao Luo Peide Qian Yanqin Zhu Shangping Wang School of Computer Science and Technology Soochow University Suzhou China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou China School of Science Xi'an University of Technology Xi'an Shaanxi China

ISBN: (纸本)9781424476718

We present an identity-based encryption in the relative-leakage model. In our construction, we firstly make use of a notion of new cryptographic primitive, identity-based hash proof system(IB-HPS), to construct a leakage-resilient IB-HPS based on a simple assumption and also prove its security by the variant of dual system encryption. Then, based on our IB-HPS scheme, we construct directly an efficient leakage-resilient identity-based encryption(IBE) scheme in the model.

关键词： Zinc Erbium Cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：