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

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 collaboratively 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

来源：评论

学校读者我要写书评

暂无评论

An Improved Wiener Filtering Algorithm Based On Dynamic Noise Power Spectrum Estimation

An Improved Wiener Filtering Algorithm Based On Dynamic Nois...

引用

The 4th International Conference on Bioinformatics and Biomedical Engineering(第四届IEEE生物信息与生物医学工程国际会议 iCBBE 2010)

作者： Zhao Lv Xiaopei Wu Mi Li The First Aeronautical College of Air-Force Xinyang Henan Province China The Key Laboratory of In The Key Laboratory of Intelligent Computing & Signal Processing Anhui University Hefei Anhui Prov The First Aeronautical College of Air-Force Xinyang Henan Province China

The problem of enhancing speech degraded by uncorrelated additive noise, when only the noisy speech is available, has been widely studied in the past and it is still an active field of research. Wiener filter, which is the most fundamental approach, has been delineated in different forms and adopted in diversified applications. An improved wiener filtering algorithm is proposed in this study, which utilizes band-partitioning spectral entropy to achieve accurate and robust speech endpoint detection and a dynamic noise power spectrum is estimated for updating a priori SNR. Experimental results reveal that the proposed algorithm can extract the embedded speech segments from utterances containing a variety of background noise successfully.

关键词： Wiener filter Heuristic algorithms Filtering algorithms Spectral analysis Speech enhancement Additive noise Degradation Active noise reduction Entropy Noise robustness

来源：评论

学校读者我要写书评

暂无评论

A HSC-based sample selection method for support vector machine

A HSC-based sample selection method for support vector machi...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Qing He Ning Li Zhong-Zhi Shi The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China Key Laboratory of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding Hebei China Chinese Academy and Sciences China

Support Vector Machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high.

关键词： Support vector machines Training Classification algorithms Machine learning Accuracy Testing Machine learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Matrix representation of spiking neural P systems

Matrix representation of spiking neural P systems

引用

11th International Conference on Membrane computing, CMC 2010

作者： Zeng, Xiangxiang Adorna, Henry Martínez-Del-Amor, Miguel Ángel Pan, Linqiang Pérez-Jiménez, Mario J. Image Processing and Intelligent Control Key Laboratory of Education Ministry Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 Hubei China University of the Philippines Diliman 1101 Quezon City Philippines Research Group on Natural Computing Department of Computer Science and Artificial Intelligence University of Sevilla Avda. Reina Mercedes s/n 41012 Sevilla Spain

ISBN: (纸本)3642181228

Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, a discrete structure representation of SN P systems with extended rules and without delay is proposed. Specifically, matrices are used to represent SN P systems. In order to represent the computations of SN P systems by matrices, configuration vectors are defined to monitor the number of spikes in each neuron at any given configuration;transition net gain vectors are also introduced to quantify the total amount of spikes consumed and produced after the chosen rules are applied. Nondeterminism of the systems is assured by a set of spiking transition vectors that could be used at any given time during the computation. With such matrix representation, it is quite convenient to determine the next configuration from a given configuration, since it involves only multiplication and addition of matrices after deciding the spiking transition vector. © 2010 Springer-Verlag.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Single-side-band optical modulation in SCM systems for high-speed optical transmission

引用

Optoelectronics Letters 2009年第1期5卷 48-50页

作者：李忠义廖同庆 Key Laboratory on Intelligent Computing & Signal Processing of Ministry of Education Anhui University

In order to decrease dispersion penalty and increase the optical bandwidth efficiency,an optical single-side-band modulation(SSBM) scheme in sub-carrier multiplexing(SCM) is *** principle of the SSBM is analytically presented,and a configuration for generating optical SSB signal is proposed using a balanced Mach-Zehnder electro-optic modulator.

关键词： Electrooptical devices

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：