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

International Conference on Natural Computation (ICNC)

作者： Shoubao Su Jiwen Wang Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University Hefei China Department of Computer Science & Technology West Anhui University Luan China

The mechanism of the classical particle swarm optimization and the comparison criterion of different natural computing methods is investigated by introducing the discrepancy and good lattice points in number theory and proposes a novel optimization method, called good lattice points-based particle swarm optimization algorithm, which intends to produce faster and more accurate convergence because it has a solid theoretical basis and better global search ability, meanwhile the global convergence of the presented algorithm with asymptotic probability one is proved by the property of the optimal lattice. Finally experiment results are very promising to illustrate the outstanding feature of the presented algorithm.

关键词： Lattices Particle swarm optimization signal processing algorithms Convergence Optimization methods Ant colony optimization Algorithm design and analysis signal processing Computer science education Computer science

来源：评论

学校读者我要写书评

暂无评论

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Based on ECDLP

A (t, n)-Threshold Verified Multi-secret Sharing Scheme Base...

引用

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Ruanhua Shi Hong Zhong Liusheng Huang Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Department of Computer Science and Technology University of Science and Technology Hefei China

In this article, we propose a (t,n) threshold verifiable multi-secret sharing scheme, in which to reconstruct t secrets needs to solve t simultaneous equations. The analysis results show that our scheme is as easy as Yang's scheme [8] in the secret reconstruction and requires less public values than Chien's [7] and Yang's schemes. Furthermore, the shares in our scheme can be verified their validity with t public values based on ECDLP, and there are two verified forms: one is computationally secure as Feldman 's scheme [12] and other is unconditionally secure as Pedersen's scheme [13]. In addition, for the main computation: a i,1 P 1 + a i,2 P 2 + hellip + a i,t P t in our scheme, we present a new method based on the signed factorial expansion and implement it, the results show that it is more efficient than the current public methods. Thus our scheme is a secure and efficient (t,n) threshold verified multi-secret sharing scheme.

关键词： Elliptic curve cryptography Equations Artificial intelligence Distributed computing Elliptic curves Public key cryptography Software engineering Laboratories intelligent networks Computer networks

来源：评论

学校读者我要写书评

暂无评论

A New Multi-objective Fully-Informed Particle Swarm Algorithm for Flexible Job-Shop Scheduling Problems

A New Multi-objective Fully-Informed Particle Swarm Algorith...

引用

International Conference on Computational Intelligence and Security Workshops (CISW)

作者： Zhao-hong Jia Hua-ping Chen Jun Tang Department of Information Management and Decision Science University of Science and Technology Hefei China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

A novel Pareto-based multi-objective fully-informed particle swarm algorithm (FIPS) is proposed to solve flexible job-shop problems in this paper. Firstly, the population is ranked based on Pareto optimal concept. And the neighborhood topology used in FIPS is based on the Pareto rank. Secondly, the crowding distance of individuals is computed in the same Pareto level for the secondary rank. Thirdly, addressing the problem of trapping into the local optimal, the mutation operators based on the coding mechanism are introduced into our algorithm. Finally, the performance of the proposed algorithm is demonstrated by applying it to several benchmark instances and comparing the experimental results.

关键词： Particle swarm optimization Scheduling algorithm Computational intelligence Topology Genetic mutations Ground penetrating radar Information security Processor scheduling Information management Competitive intelligence

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Clustering Ensemble Based on Dual Boosting

Fuzzy Clustering Ensemble Based on Dual Boosting

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Su-lan Zhai Bin Luo Yu-tang Guo School of Mathematics and Computing Anhui University of Science and Technology Hefei China Key Laboratory of Intelligent Computing Signal Processing of Anhui University Hefei China

It is widely recognized that clustering ensemble is fit for any shape and any distribution dataset and that the boosting method provides superior results for classification problems. In the paper, a dual boosting is proposed for fuzzy clustering ensemble . At each boosting iteration, a new training set is created based on the original datasets' probability which is associated with the previous clustering. According to the dual boosting method, the new training subset contains not only the instances which is hard to cluster in previous stages , but also the instances which is easy to cluster. The final clustering solution is produced by using the clustering based on the co-association matrix. Experiments on both artificial and realworld datasets demonstrate the efficiency of the fuzzy clustering ensemble based on dual boosting in stability and accuracy.

关键词： Boosting Clustering algorithms signal processing algorithms Partitioning algorithms Laboratories Mathematics signal processing Shape measurement Robustness Bagging

来源：评论

学校读者我要写书评

暂无评论

A Novel Representation of Concept Hierarchy Based on Quotient Space Model

A Novel Representation of Concept Hierarchy Based on Quotien...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Xue-jun Li Long-shu Li Ling Zhang Yi Xu Key Laboratory of Intelligent Computing & Signal Processing of Ministry of Education Anhui University of Science and Technology Hefei China School of Computer Science and Technology Anhui University of Science and Technology Hefei China

Concept hierarchies are important in many generalized data mining applications, such as multiple-level fuzzy association rule mining. Usually concept hierarchies are given by domain experts. However, it is extremely difficult and time-consuming for human experts to discover concepts and construct concept hierarchies from the domain. In literature, several representations of concept hierarchy are possible, for example tree, lattice, table, linked list, arbitrary graph etc. In this paper, we apply quotient space model to representing concept hierarchies. In contrast to others, the representation model is much more extensible and compatible. The results indicate that this technique can improve the efficiency of performing the generalization and specialization operation in concept hierarchies.

关键词： Databases Data mining Tree graphs Cities and towns Space technology Lattices Laboratories Competitive intelligence signal processing Educational technology

来源：评论

学校读者我要写书评

暂无评论

A novel image content authentication algorithm based on Laplace spectra feature

A novel image content authentication algorithm based on Lapl...

引用

26th Chinese Control Conference, CCC 2007

作者： Wanli, Lv Yutang, Guo LuoBin Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China Computer Department Anhui Institute of Education Hefei 230061 China

ISBN: (纸本)7900719229

A novel image content authentication algorithm based on Laplace spectra was proposed. Outstanding feature points are extracted from the original image and a cipher point is inserted. A relational graph is then built, and the Laplace spectra of the graph are calculated to serve as image features. The Laplace spectra are quantized then embedded into the original image as a watermark. In the authentication step, the Laplace spectra of the authenticating image are calculated and compared with that of the watermark embedded in the authenticating image. If both of the spectra are identical, the image passes the authentication test. Otherwise, the tamper is found. The experimental results show that the proposed authentication algorithm can effectively detect the event and the location when the original image content is tampered viciously.

关键词： Laplace equation

来源：评论

学校读者我要写书评

暂无评论

Protein Structure Class Analysis Based on Multifractal and Quotient Space

Protein Structure Class Analysis Based on Multifractal and Q...

引用

Chinese Control Conference (CCC)

作者： Zheng Tingting Mao Junjun Wu Tao Song Jie Anhui University Hefei Anhui CN School of mathematics and computational science Anhui University Hefei Anhui China Key Laboratory of intelligent computing & Signal processing Anhui University Hefei Anhui China

The multifractal spectrum of protein feature sequences was computed and analyzed with the multifractal. The parameters of multifractal spectra were used to describe hierarchically refined structure of protein feature sequences and pop out the singularity of local sequences. And with using quotient space granularity computing theory power gene α of multifractal was chosen wilder. Constructing 2D space , and it presented good efficiency in structure classing, which is favor of predicting protein structure class.

关键词： Proteins Fractals Computational intelligence signal processing Mathematics Tellurium

来源：评论

学校读者我要写书评

暂无评论

Total Field and Scattered Field Technique for Fourth-Order Symplectic Finite Difference Time Domain Method

引用

Chinese Physics Letters 2006年第1期23卷 103-105页

作者：沙威黄志祥吴先良陈明生 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039

Using symplectic integrator propagator, a three-dimensional fourth-order symplectic finite difference time domain （SFDTD） method is studied, which is of the fourth order in both the time and space domains. The method is nondissipative and can save more memory compared with the traditional FDTD method. The total field and scattered field （TF-SF） technique is derived for the SFDTD method to provide the incident wave source conditions. The bistatic radar cross section （RCS） of a dielectric sphere is computed by using the SFDTD method for the first time. Numerical results suggest that the SFDTD algorithm acquires better stability and accuracy compared with the traditional FDTD method.

关键词： INTEGRATOR SIMULATION STABILITY SCHEME

来源：评论

学校读者我要写书评

暂无评论

Complex-wave retrieval based on blind signal separation

引用

Chinese Optics Letters 2006年第1期4卷 11-14页

作者：柴晓冬周成鹏冯兆艳王银花左言胜 Department of Electronic Science and Technology University of Science and Technology of ChinaHefei 230026 Key Laboratory of Intelligent Computing and Signal ProcessingMinistry of EducationAnhui UniversityHefei 230039 Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationAnhui UniversityHefei 230039

In tile process of the reconstruction of digital holography. the traditional methods of diffraction and filtration are commonly adopted to recover the original complex-wave signal. Influenced by twin-image and zero-order terms, the above-mentioned methods, however, either limit tile field of vision or result in the loss of the amplitude and phase. A new method for complex-wave retrieval is presented, which is based on blind signal separation. Three frames of holograms are captured by a charge coupled device （CCD） camera to form an observation signal. The term containing only amplitude and phase of complex-wave is separated, by means of independent component analysis, from the observation signal, which effectively eliminates the zero-order term. Finally. the complex-wave retrieval of pure phase wavefront is achieved. Experimental results show that this method can better recover the amplitude and phase of the original complex-wave even when there is a frequency spectrum mixture in the hologram.

关键词： Charge coupled devices Image reconstruction Independent component analysis signal interference signal processing Spectrum analysis

来源：评论

学校读者我要写书评

暂无评论

Chebyshev Approximation for Fast Frequency- Sweep Analysis of Electromagnetic Scattering Problem

引用

电子学报(英文版) 2006年第4期15卷 736-738页

作者： CHEN Mingsheng WU Xianliang HUANG Zhixiang SHA Wei Key Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China

To complete the scattering analysis of an arbitrary shaped perfectly electric conductor over a wide frequency band, the Chebyshev polynomial of first kind is applied. The Chebyshev nodes within a given frequency range are found, and then the surface electric currents at these nodes are computed by the method of moments. The surface current is expanded in a polynomial function via the Chebyshev approximation. Using this function, the electric current distribution can be obtained at any frequency within the given frequency range. The numerical results are compared with the results obtained by the method of moments, and the complexity of computation is reduced obviously.

关键词： Chebyshev逼近快速频率扫描电磁散射电导体

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：