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

International Symposium on Information Science and Engineering, ISISE

作者： Wei Li Yichao Zhang Zhengyi Liu Jianguo Wu Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei China Anhui University Hefei Anhui CN

Controller synthesis uses hardware description language and synthesis optimization tools from a higher abstract level. State transition graph of completely specified finite state machine is adopted to describe the behavior of controller. State transition graph STG_org was generated before synthesized and state transition graph STG_ext was reversely extracted from structure realization of controller synthesis. If STG_org and STG_ext were equivalent then corresponding process of controller synthesis was correct. The paper gives a formal verification algorithm of controller synthesis with time complexity O(B 2 /Aldrt 1 (n)+A ldr t 2 (m,n)) .In order to further improve time complexity of algorithm, a verifying algorithm with synthetic information guidance was proposed. The algorithm is proved efficient in theory for its time complexity is decreased to O(Bldrt 1 (n) + Aldrt 2 (m,n)).

关键词： Automata Circuit synthesis signal processing algorithms Sequential circuits signal synthesis Hardware design languages Process control Formal verification Control system synthesis Combinational circuits

来源：评论

学校读者我要写书评

暂无评论

Comparisons of Protein Structure Alignment Methods: Rigid and Flexible, Sequential and Non-Sequential

Comparisons of Protein Structure Alignment Methods: Rigid an...

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Junping Xiang Maolin Hu Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education School of Mathematics and Computational Science Anhui University Hefei Anhui China

We try to evaluate the sequential and non-sequential and flexible structural alignment methods on SCOP 1.71. Firstly, we compare the flexible method with rigid methods and compare the sequence order dependent methods with sequence order independent methods by two typical cases. Secondly, the performances of the above methods are evaluated using ten protein pairs which are considered as "hard to detect" similarities. Thirdly, we evaluate the methods by comparing the ROC curves based on their native score and geometric measure Qscore. Then we compare the methods directly using geometric match measure Qscore, which also allows the creation of a 'Best- of-All' method. The main conclusions are: (1) we find that the best alignments found by sequential methods are more consistent with the SCOP classification; (2) we show that ROC curves are of limited value and that their ranking of the methods is not consistent with the ranking implied by the quality of the alignments the methods find; (3) we also find that the alignments of flexible method and non-sequential methods are better than the corresponding alignments of rigid sequential method from the viewpoint of geometric superposition, and flexible method and non-sequential methods can find more cross-fold similarities.

关键词： Proteins Gold Performance evaluation Amino acids Fasteners Laboratories Computational intelligence Intelligent structures Biomedical signal processing Educational programs

来源：评论

学校读者我要写书评

暂无评论

Measurement of granules

Measurement of granules

引用

IEEE International Conference on Cognitive Informatics

作者： Liquan Zhao Ling Zhang Province Key Laboratory of Electronic Business Nanjing University of Finance and Economics Nanjing China Artificial Intelligence Institute Anhui University Hefei China Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei 230039 China

ISBN: (纸本)9781424425389

The measurement of granules is the most foundational problem in granular computing. The paper is intended to study the measurement of granules on a finite or infinite set. For a finite set we discuss the measurement of granules corresponding to an equivalence relation on a finite set and introduce a definition of conditional granularity in order to distinguish those granules with the same granularity. For an infinite set we can define different granularity in different questions, but we give the basic idea of granularity, that is, the granularity of a granule is the sum of the relative information contents of its atomic granules.

关键词： Micro hierarchical tree Macro hierarchical figure Granularity Conditional granularity grain size Equivalence relation infinite set Finite Infinite

来源：评论

学校读者我要写书评

暂无评论

Application of the lifting wavelet-like transform to fast multipole methods

Application of the lifting wavelet-like transform to fast mu...

引用

2008 Asia Pacific Microwave Conference, APMC 2008

作者： Chen, Ming-Sheng Wu, Xian-Liang Wei, Sha Huang, Zhi-Xiang Department of Physics and Electronic Engineering Hefei Teachers College HefeiAnhui 230601 China Key Laboratory of Intelligent Computing and Signal Processing Anhui University HefeiAnhui 230039 China Department of Electrical and Electronic Engineering University of Hong Kong Pokfulam Road Hong Kong Hong Kong

来源：评论

学校读者我要写书评

暂无评论

High-order conformal symplectic FDTD scheme

High-order conformal symplectic FDTD scheme

引用

Asia-Pacific Conference on Microwave

作者： Wei Sha Xianliang Wu Department of Electrical and Electronic Engineering University of Hong Kong Hong Kong China Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei China

Using the locally conformal technique and the high-order symplectic integrators, the high- order conformal symplectic FDTD scheme is accurate and efficient for modeling the scattering from three-dimensional curved perfectly conducting objects. In addition, the decreased time step caused by the conformal model can be offset by using coarse grids.

关键词： Finite difference methods Time domain analysis Equations Computational modeling Interpolation Magnetic fields Laboratories signal processing Anisotropic magnetoresistance Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

AN INCREMENTAL UPDATING TECHNIQUE FOR MINING INDIRECT ASSOCIATION RULES

AN INCREMENTAL UPDATING TECHNIQUE FOR MINING INDIRECT ASSOCI...

引用

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

作者： CHENG ZHENG Educational Department Key Laboratory of Intelligent Computing & Signal Processing Anhui University School of Computer Science and Technology Anhui University Hefei230039 China

While direct association rules are dedicated to describe the direct correlations among the items in a frequent itemset, indirect association rules are dedicated to describe the indirect correlations between the two items in a infrequent itemset. All the existing research works about indirect association rules are focused on improving the efficiency of mining algorithm for indirect association rules. Like incremental updating algorithm is important for mining association rules, incremental updating algorithm is also important for mining indirect association rules. In this paper, we put forward an incremental updating algorithm for mining indirect association rules to deal with the maintenance of discovered indirect association rules resulted from the change of the minimum support. The main idea is to re-utilize the results acquired in process with the old minimum support.

关键词： Indirect Association Rules Incremental Updating

来源：评论

学校读者我要写书评

暂无评论

Novel DCT-based real-valued discrete Gabor transform

Novel DCT-based real-valued discrete Gabor transform

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Liang Tao Hon Keung Kwan MOE Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei Anhui China Department of Electrical and Computer Engineering University of Windsor Windsor ONT Canada

The traditional DCT-based real-valued discrete Gabor transform (RGDT) was limited to the critical sampling case. The biorthogonality relationship between the analysis window and the synthesis window for the transform has not been unveiled. To overcome those drawbacks, this paper proposes a novel DCT-based real-valued discrete Gabor transform, which can be applied under both the critical sampling condition and the over-sampling condition. And the biorthogonality relationship between the analysis window and the synthesis window for the transform is also proved in this paper. Because it only involves real operations and can utilize fast DCT and DDCT algorithms for fast computation, it facilitates computation and implementation by hardware and/or software compared to the traditional complex-valued discrete Gabor transform.

关键词： Discrete transforms Sampling methods Hardware Discrete cosine transforms Software algorithms Biomedical signal processing signal sampling signal synthesis signal processing algorithms Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

processing framework and the fast volume rendering algorithms for out-of-core medical data

引用

Ruan Jian Xue Bao/Journal of Software 2008年第12期19卷 3237-3248页

作者： Xue, Jian Tian, Jie Dai, Ya-Kang Chen, Jian College of Computing and Communication Engineering Graduate University The Chinese Academy of Sciences Beijing 100049 China Medical Image Processing Group Institute of Automation The Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Complex Systems and Intelligence Science Beijing 100190 China

This paper designs and implements an algorithm framework for the out-of-core medical data processing and analyzing and integrates it into MITK (medical imaging toolkit), an algorithm toolkit for medical image processing and analyzing accomplished by the group. With the help of this, a processing platform for the out-of-core medical data is set up and fast out-of-core volume rendering algorithms based on volume ray casting and 3D texture are studied in this paper. A semi-adaptive partitioning method is proposed to divide original data sets into sub-blocks and get a better partitioning result without influencing the partitioning speed. Furthermore, the graphics hardware is also used to accelerate the rendering process. The experimental results indicate that the new framework and algorithms are effective and efficient for the processing and visualization of the out-of-core medical data sets. © 2008 by Journal of Software.

关键词： Volume rendering

来源：评论

学校读者我要写书评

暂无评论

The Symplectiness of Maxwell's Equations

The Symplectiness of Maxwell's Equations

引用

2008 International Conference on Microwave and Millimeter Wave Technology(2008国际微波毫米波技术会议)

作者： Wei Sha Xianliang Wu Zhixiang Huang Mingsheng Chen Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei China

The connections between Maxwell's equations and symplectic matrix are ***,we analyze the continuoustime Maxwell's difierentia I equationsInfree space and verify its time evolution matrix(TEMA)is symplectic-unitary matrix for complex space or symplectic-orthogonal matrix for real *** spatial differential operators are discrefized by pseudo-spectral(PS)approach with collocated grid and by finitedifrerenee(FD)method with staggered *** the PS approach,the TEMA conserves *** *** the FD method，the TEMA conserves symplectic-orthogonal *** integration scheme is usedInthe time *** particular,we find the symplectiness of the TEMA also can be *** mathematicaI proofs presented are helpful for deep researching the symplectic PSTD approach and the symplectic FDTD method.

关键词： Maxwell equations Differential equations Time domain analysis Jacobian matrices Finite difference methods Algebra Chemicals Transforms Computational modeling Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

An algorithm for estimating number of components of Gaussian mixture model based on penalized distance

An algorithm for estimating number of components of Gaussian...

引用

International Conference on Neural Networks and signal processing

作者： Daming Zhang Hui Guo Bin Luo Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University of Science and Technology Hefei China Department of Mathematics & Physics Beijing University of Posts and Telecommunications Hefei China University of New South Wales Sydney NSW Australia

ISBN: (纸本)9781424423101

The expectation-maximization (EM) algorithm is a popular approach for parameter estimation of finite mixture model (FMM). A drawback of this approach is that the number of components of the finite mixture model is not known in advance, nevertheless, it is a key issue for EM algorithms. In this paper, a penalized minimum matching distance-guided EM algorithm is discussed. Under the framework of Greedy EM, a fast and accurate algorithm for estimating the number of components of the Gaussian mixture model (GMM) is proposed. The performance of this algorithm is validated via simulative experiments of univariate and bivariate Gaussian mixture models.

关键词： Finite mixture model Number of components Penalized minimum matching distance Greedy EM Parzen window expectation-maximisation algorithm Mixture models Parameter estimation Gauss algorithms Univariate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：