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

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Wang, An Qi Zhang, Xue Huang, Zhi Xiang Anhui University School of Electronics and Information Engineering Key Laboratory of Intelligent Computing Signal Processing Hefei China

ISBN: (纸本)9781538671115

In this paper, the Maehly approximation, which is based on Chebyshev series, is proposed to fast simulate the EM scattering from a three-dimensional (3D) rough surface over a frequency band. Comparing with the exact results obtained by the method of moments (MoM), results of the Maehly approximation have achieved an excellent agreement both in co-polarization and cross-polarization. Moreover, the Maehly approximation is superior to the MoM in terms of the CPU time required. © 2019 IEEE.

关键词： Method of moments

来源：评论

学校读者我要写书评

暂无评论

Prediction of protein-protein interaction sites using granularity computing of quotient space theory

Prediction of protein-protein interaction sites using granul...

引用

International Conference on Computer Science and Software Engineering, CSSE 2008

作者： Du, Xiuquan Cheng, Jiaxing Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui province China

ISBN: (纸本)9780769533360

Proteins function through interactions with other proteins, compounds, RNA and DNA. Prediction of protein interface sites is the key process for providing clues to the function of a protein, and is becoming increasing relevant to drug discovery. In this paper, combining the protein features with the theory of granular computing of quotient space based on protein-protein interaction sites classification algorithm is proposed, (i.e. PPI-GS Model). Such algorithm uses the support vector machine (SVM) with better generalization ability to get different classification results, and construct different quotient space by using these results. The final result is got by granularity synthesis method to organize these quotient spaces. The experiment suggests that this new method is in effect. Also, the potency of the granular computing of quotient space in the application of protein-protein interaction sites prediction and processing is demonstrated © 2008 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks

引用

CAAI Transactions on Intelligence Technology 2023年第3期8卷 893-913页

作者： Lei Zhang Yutong Liu Haipeng Yang Fan Cheng Qi Liu Xingyi Zhang Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing and Signal Processing of Ministry of EducationSchool of Computer Science and TechnologyAnhui UniversityHefeiChina School of Computer Science and Technology University of Science and Technology of ChinaHefeiChina

Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *** the existing influence maximization methods,the community‐based ones can achieve a good balance between effectiveness and ***,this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping *** fact,many nodes in social networks are overlapping ones,which play more important role in influence *** this end,an overlapping community‐based particle swarm opti-mization algorithm named OCPSO for influence maximization in social networks,which can make full use of overlapping nodes,non‐overlapping nodes,and their interactive information is ***,an overlapping community detection algorithm is used to obtain the information of overlapping community structures,based on which three novel evolutionary strategies,such as initialisation,mutation,and local search are designed in OCPSO for better finding influential *** results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts(***,CMA‐IM,CIM,CDH‐SHRINK,CNCG,and CFIN).

关键词： computational intelligence data mining social network

来源：评论

学校读者我要写书评

暂无评论

Viewpoint selection for taking a good photograph of architecture 24

Viewpoint selection for taking a good photograph of architec...

引用

24th Pacific Conference on Computer Graphics and Applications, Pacific Graphics 2016

作者： He, Jingwu Zhou, Wenzhe Wang, Linbo Zhang, Hongjie Guo, Yanwen National Key Lab for Novel Software Technology Nanjing University NanJing210023 China MOE Key Laboratory of Intelligent Computing and Signal Processing Institute of Media Computing Anhui University HeFei230039 China

ISBN: (纸本)9783038680246

This paper studies the problem of how to choose the viewpoint for taking good photographs for architecture. We achieve this by learning from professional photographs of world famous landmarks that are available in the Internet. Unlike the previous efforts devoted to photo quality assessment which mainly rely on visual features, we show in this paper combining visual features with geometric features computed on the 3D models can result in a more reliable evaluation of viewpoint quality. Specifically, we collect a set of photographs for each of 6 world famous architectures as well as their 3D models from Internet. Viewpoint recovery for images is carried out by an image-model registration process, after which a newly proposed viewpoint clustering strategy is exploited to validate users' viewpoint preference when photographing landmarks. Finally, we extract a number of 2D and 3D features for each image based on multiple visual and geometric cues, and perform viewpoint recommendation by learning from both 2D and 3D features, achieving superior performance over using solely 2D or 3D features. We show the effectiveness of the proposed approach through extensive experiments. © 2016 The Author(s) Eurographics Proceedings © 2016 The Eurographics Association.

关键词： Architecture

来源：评论

学校读者我要写书评

暂无评论

Motor imagery classification based on the optimized SVM and BPNN by GA

Motor imagery classification based on the optimized SVM and ...

引用

2010 International Conference on intelligent Control and Information processing, ICICIP 2010

作者： Jiao, Yingying Wu, Xiaopei Guo, Xiaojing Key Laboratory of Intelligent Computing and Signal Processing of MOE Anhui University Hefei 230039 Anhui Province China School of Computer Science and Technology Anhui University China

ISBN: (纸本)9781424470488

Brain-computer interface (BCI) is a specific Human-Computer interface in which the brain wave is employed as the carrier of control information. The ultimate goal of BCI is to build a direct communication pathway between human brain and external environment that does not depend on the limb mobility and language. In this paper, we carry out the experiment about the left or right hand motor imagery, and support vector machine with genetic algorithm(GA-SVM) and back propagation neural network with genetic algorithm (GA-BP) are employed to classify the μ. rhythm evoked by movement imagination. The experiment results prove that GA-SVM can easily find out the appropriate parameters of SVM and GA-BP can avoid getting into local minimization to great extend. So higher accuracy of classification is achieved. © 2010 IEEE.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

Locating human eyes in face images based on illumination normalization and progressive thresholding

Locating human eyes in face images based on illumination nor...

引用

International Conference on Computer Science and Education

作者： Wang, Hua-Bin Tao, Liang Hu, Xue-You Wang, Shi-Yi Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9781424460052

Based on illumination normalization and progressive thresholding, this paper presents a novel algorithm for automatic localization of human eyes in still images with complex background. First of all, Retinex method is used to realize normalizing of the face image. Secondly, a determination criterion of eye location is established by the priori knowledge of geometrical facial features. Thirdly, a range of threshold values that would separate eye blocks from others in a segmented face image is estimated. With the progressive increase of the threshold by an appropriate step in that range, once two eye blocks appear from the segmented image, they will be detected by the determination criterion of eye location. Finally, the 2-D correlation coefficient is used as a symmetry similarity measure to check the factuality of the two detected eyes. The experimental results demonstrate the high efficiency of the algorithm in runtime and correct localization rate. ©2010 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A low-complexity resource allocation algorithm based on proportional fairness for multiuser OFDM systems

A low-complexity resource allocation algorithm based on prop...

引用

2008 International Conference on Wireless Communications, Networking and Mobile computing, WiCOM 2008

作者： Yanjun, Hu Li, Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9781424421084

In this paper, we propose a novel resource allocation algorithm based on proportional fairness in multiuser OFDM systems. Because the utility function is always used for the optimization and achieving the tradeoff between the efficiency and fairness, the proportional fairness optimization problem can be formulated as maximizing the utility function, which is the sum of logarithmic user data rate. However, the optimal proportional fairness problem is NP-hard which requires high complexity. To reduce the complexity of power allocation, we propose a novel power allocation algorithm which achieves good tradeoff between complexity and performance. We discuss our resource allocation algorithm and report on its performance using a set of simulation experiments. © 2008 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with cell separation: attacking the partition problem

引用

Science China(Information Sciences) 2011年第2期54卷 293-304页

作者： ZHANG XingYi1, WANG Shuo2, NIU YunYun2 & PAN LinQiang2 1key Lab of intelligent computing and signal processing of Ministry of Education, School of Computer Science and Technology, Anhui University, Hefei 230039, China 2Image processing and intelligent Control key laboratory of Education Ministry of China, Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China 1. Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China2. Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem.

关键词： membrane computing tissue P system cell separation partition problem

来源：评论

学校读者我要写书评

暂无评论

Comparisons of protein structure alignment methods: Rigid and flexible, sequential and non-sequential

Comparisons of protein structure alignment methods: Rigid an...

引用

2nd International Conference on Bioinformatics and Biomedical Engineering, iCBBE 2008

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

ISBN: (纸本)9781424417483

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. © 2008 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Solving Electromagnetic Scattering from Microstrip Arrays with Multiple-Traces Surface Integral Equations

Solving Electromagnetic Scattering from Microstrip Arrays wi...

引用

2018 IEEE International Conference on Computational Electromagnetics, ICCEM 2018

作者： Zhao, Ran Feng, Jian Song, Kaihong Huang, Zhixiang Hu, Jun Anhui University Ministry of Education Key Laboratory of Intelligent Computing and Signal Processing China School of Electronic Engineering China

ISBN: (纸本)9781538612415

In this paper, a new multiple-traces Poggio-Miller-Chang-Harrington-Wu-Tsai (MT-PMCHWT) equation is proposed to simulate the electromagnetic scattering from microstrip structures. Different from traditional EFIE-PMCHWT method, in this new multiple-traces method, the original object can be decomposed into two independent domains i.e., the exterior region (free space) and interior region (microstrip), and Robin transmission conditions (TCs) is enforced on the interface between exterior and interior regions to ensure the continuity of fields. In comparison to the traditional EFIE-PMCHWT, this new MT-PMCHWT has a better convergence property. Because the continuity of fields is ensured by TCs, the exterior and interior regions can be discretized by non-conformal meshes, which improves the flexibility and efficiency of the proposed methods substantially. © 2018 IEEE.

关键词： Surface scattering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：