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

2010 International Conference on Computer Design and Applications, ICCDA 2010

作者： Xu, Peida Xu, Jianling Deng, Yong Su, Xiaoyan Key Laboratory of Digital Agricultural Early-warning Technology Ministry of Agriculture of China Beijing China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University China School of Electronics and Information Technology Shanghai Jiao Tong University Shanghai China Grain Economics Institute Nanjing University of Finance and Economics Nanjing China Hangzhou Key Lab. of E-Business and Information Security Hangzhou Normal University Hanzhou Zhejiang China Hangzhou Key Lab. of E-Business and Information Security Hangzhou Normal University Shanghai China

ISBN: (纸本)9781424471638

Risk evaluation is very important to the design and improvement of physical protection systems. In this paper, an evaluation method of multi-source information fusion is proposed based on the D-S evidence theory. In the proposed method, each individual component of the protection system in the simulated plane is modeled. Then, the threat report of each component according to the specific tactics is determined based on its real environment. Finally, the comprehensive threat distribution is obtained based on through the D-S evidence theory to combine multi-sources information. The proposed method can easily applied to the evaluation of the effectiveness of the protection system. We make the total threat of the protection system lowest through changes of the protection resources allocation. A numerical example is used to illustrate the efficiency of the proposed method. © 2010 IEEE.

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

Subspace selection using semi-supervised harmonic mean of Kullback-Leibler divergences

Subspace selection using semi-supervised harmonic mean of Ku...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Si-Bao Chen Hai-Xian Wang Bin Luo Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui China Key Lab of Child Development and Learning Science of Ministry of Education Research Center of Learning Sciences South-East University Nanjing Jiangsu China

In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. However, LDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), can significantly reduce the class separation problem. Furthermore, maximizing the harmonic mean of Kullback-Leibler (KL) divergences of class pairs (MHMD) emphasizes smaller divergences more than MGMD, and deals with the class separation problem more effectively. However, in many applications, lab.led data are very limited while unlab.led data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate lab.led data. To take advantage of unlab.led data for subspace selection, semi-supervised MHMD (SSMHMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMHMD.

关键词： Harmonic analysis Training Laplace equations Manifolds Covariance matrix Machine learning Symmetric matrices

来源：评论

学校读者我要写书评

暂无评论

Study of high-resolution range profile for monostatic MIMO radar based on SIAR

引用

Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics 2010年第4期32卷 734-739+763页

作者： Zhao, Guang-Hui Chen, Bai-Xiao Gao, Zhao-Zhao Intelligent Perception and Image Understanding Key Lab of Ministry of Education of China Xidian Univ. Xi'an 710071 China National Key Lab for Radar Signal Processing Xidian Univ. Xi'an 710071 China National Information Control Laboratory Chengdu 610036 China

Conventional pulse compression use a periodical echo of single receive antenna, which is modulated by a certain carrier-frequency, in other words, single spectrum is exploited. But for MIMO radar, as the multi-carrier-frequency signals are transmitted simultaneously, if the spectrum of the target echo after channel separation can be combined to form the whole band spectrum echo, the corresponding range resolution can improve several times as compared with the conventional method, and it will be more convenient for follow-up detection and tracking. Considering the difference between the frequency modulation band and the interval between the adjacent frequencies, the spectrum joint after channel separation will be overlapped or spaced. The methods of spectrum moving of each echo and the spectrum extrapolation with Root-MUSIC algorithm are proposed, by which high-resolution range profile of the target is obtained. Simulation results verify the validity of these methods.

关键词： Multiple signal classification

来源：评论

学校读者我要写书评

暂无评论

A Distributed Group Signature Scheme with Traceable Signers for Mobile Ad Hoc Networks

A Distributed Group Signature Scheme with Traceable Signers ...

引用

The 2010 International Conference on Computer Application and System Modeling(2010计算机应用与系统建模国际会议 ICCASM 2010)

作者： Hong Zhong Runhua Shi Key Laboratory of Intelligent Computing & Signal Processing Anhui University Ministry of Education Hefei China 230039 School of Computer Science and Technology Anhui University Hefei China 230039

ISBN: (纸本)9781424472352

In this paper, we propose a distributed group signature scheme with traceable signers for mobile Ad hoc networks. In such scheme, there isn't a trusted center, and all members of Ad hoc group cooperate to generate all system parameters and all private/public keys. Any ' members in Ad hoc group can collab.ratively generate the group signature with the help of a designated clerk, where the signer respectively generates the partial signature by using his private key and the clerk can check the correctness of the partial signature. Furthermore, anyone can verify the validity of the group signature by the group public key and trace back to find the identities of signers from the warrant created by the clerk. What's more, it can dynamically increase the parameter values of ~t and ~n, according to the actual security needs of mobile Ad hoc networks, but the private and public keys of the whole Ad hoc group still are not changed for relatively long-term stability.

关键词： group signature shamir's secret sharing mobile ad hoc networks traceable distributed

来源：评论

学校读者我要写书评

暂无评论

Improved particle swarm algorithm for portfolio optimization problem

Improved particle swarm algorithm for portfolio optimization...

引用

International Conference on Industrial Mechatronics and Automation, ICIMA

作者： Jianguo Cao Liang Tao Department of Computer Science Anhui Vocational and Technical College of Industry and Trade Huainan China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781424476534

Particle swarm optimization (PSO) is a recently proposed population-based random search algorithm, which performs well in some optimization problems. In this paper, we proposed an improved PSO algorithm to solve portfolio selection problems. The proposed approach IPSO employs an opposite mutation operator to enhance the performance of the standard PSO. In order to verify the performance of IPSO, we test it on five well-known benchmark function optimization problems. At last, we use IPSO to solve a classical portfolio selection problem. The results show that the proposed approach is effective and achieves better results than standard PSO.

关键词： Particle swarm optimization Portfolios signal processing algorithms Benchmark testing Artificial neural networks Computer industry educational institutions Genetic mutations Optimization methods Support vector machines

来源：评论

学校读者我要写书评

暂无评论

On Dynamic Weighting of Data in Clustering with K-Alpha Means

On Dynamic Weighting of Data in Clustering with K-Alpha Mean...

引用

International Conference on Pattern Recognition

作者： Si-Bao Chen Hai-Xian Wang Bin Luo Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui China Key Laboratory of Child Development and Learning Science of Ministry of Education Research Center of Learning Science South-East University Nanjing Jiangsu China

ISBN: (纸本)9781424475421

Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-Alpha Means (KAM), which is insensitive to the initial centers. With K-Harmonic Means as a special case, KAM dynamically weights data points during iteratively updating centers, which deemphasizes data points that are close to centers while emphasizes data points that are not close to any centers. Through replacing minimum operator in K-Means by alpha-mean operator, KAM significantly improves the clustering performances.

关键词： Clustering algorithms Heuristic algorithms Indexes Partitioning algorithms signal processing algorithms Euclidean distance Iris

来源：评论

学校读者我要写书评

暂无评论

The structural analysis of protein sequences based on the quasi-amino acids code

引用

Chinese Physics B 2009年第1期18卷 363-369页

作者：朱平唐旭清徐振源 School of Science Jiangnan University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

Proteomics is the study of proteins and their interactions in a cell. With the successful completion of the Human Cenome Project, it comes the postgenome era when the proteomics technology is emerging. This paper studies protein molecule from the algebraic point of view. The algebraic system （∑, ＋, ＊） is introduced, where ∑ is the set of 64 codons. According to the characteristics of （∑, ＋, ＊）, a novel quasi-amino acids code classification method is introduced and the corresponding algebraic operation table over the set ZU of the 16 kinds of quasi-amino acids is established. The internal relation is revealed about quasi-amino acids. The results show that there exist some very close correlations between the properties of the quasi-amino acids and the codon. All these correlation relationships may play an important part in establishing the logic relationship between codons and the quasi-amino acids during the course of life origination. According to Ma F et al （2003 J. Anhui Agricultural University 30 439）, the corresponding relation and the excellent properties about amino acids code are very difficult to observe. The present paper shows that （ZU, ＋,×） is a field. Furthermore, the operational results display that the eodon tga has different property from other stop codons. In fact, in the mitochondrion from human and ox genomic codon, tga is just tryptophane, is not the stop codon like in other genetic code, it is the case of the Chen W C et al （2002 Acta Biophysiea Siniea 18（1） 87）. The present theory avoids some inexplicable events of the 20 kinds of amino acids code, in other words it solves the problem of ＇the 64 codon assignments of mRNA to amino acids is probably completely wrong＇ proposed by Yang （2006 Progress in Modern Biomedicine 6 3）.

关键词： algebraic operation quasi-amino acids code protein sequences structural analysis

来源：评论

学校读者我要写书评

暂无评论

Shape Recognition and Retrieval Based on Edit Distance and Dynamic Programming

引用

Tsinghua Science and Technology 2009年第6期14卷 739-745页

作者：潘鸿飞梁栋唐俊王年李薇 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

An important aim in pattern recognition is to cluster the given shapes. This paper presents a shape recognition and retrieval algorithm. The algorithm first extracts the skeletal features using the medial axis transform. Then, the features are transformed into a string of symbols with the similarity among those symbols computed based on the edit distance. Finally, the shapes are identified using dynamic programming. Two public datasets are analyzed to demonstrate that the present approach is better than previous approaches.

关键词： skeletal features medial axis transform edit distance dynamic programming

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Bio-Inspired computing: Theories and Applications, BICTA

作者： Zhujin Zhang Shuo Wang Xingyi Zhang Zheng Zhang School of Computer and Information Science University of South Australia Adelaide SA Australia Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China

Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n 2 ), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species.

关键词： Rabbits educational institutions Bovine Humans Sun DNA Mice

来源：评论

学校读者我要写书评

暂无评论

Shot Transition Detection Based on Locally Linear Embedding

Shot Transition Detection Based on Locally Linear Embedding

引用

2010 International Conference on Measuring Technology and Mechatronics Automation(ICMTMA 2010)(2010年检测技术与机电自动化国际会议)

作者： MaoSheng Fu DaMing Zhang Min Kong Bin Luo Key Lab of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei230039. P. R. China Department of Computer Science and Technology in West Anhui University Anhui Lu'an 237012. P. R. China

ISBN: (纸本)9781424450015

Detection of shot transitions servers as the preliminary step to video indexing and retrieval. Locally linear embedding (LLE) algorithm fails when it is applied to video with multi-shot. In this paper, we present a novel framework of shot transitions detection. The method involves two processes: First we extract the manifold feature of shot transition using LLE through addition of virtual frames on an enriched set, and then they are classified by *** show that the recognition rate of shot transition is reached over 90％.

关键词： shot transition detection locally linear embedding feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：