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

International Conference on Natural Computation (ICNC)

作者： Ziqiang Li Yanfang Xie Zuijun Tian Zhou Lichao School of Information and Engineering Xiangtan University China 411105 Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan 411105 China Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan China

The weighted circles layout problem belongs to the layout optimization problem with performance constraints. Due to its NP-hard property, it is difficult to solve in polynomial time. In this paper, a heuristic particle swarm optimization approach with quasi-human strategy (HQHPSA) is presented for this problem. Its layout scheme is constructed through the proposed heuristic method: that both circular radius and the norm of row vector of the matrix and sub-vector are taken as the probability factors of the roulette selection and the circles are located by arranging round existing circles in peripheral with counterclockwise. The complexity of the proposed heuristic method is only O(n) for one layout scheme. The better layout solution obtained through the proposed heuristic method is taken as the elite particle individual. The PSO with quasi-human strategy is used to optimize the elite particle into the optimal solution. The numerical experiments show that the performance of proposed algorithm is superior to the existing algorithms.

关键词： Layout Algorithm design and analysis Particle swarm optimization Optimization Computers Genetic algorithms Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Clustering based on fuzzy tolerance quotient spaces

引用

Journal of Computational Information Systems 2012年第24期8卷 10105-10112页

作者： Zhao, Shu Zhang, Ling Liu, Qianqian Zhang, Yanping School of Computer Science and Technology Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China

The quotient space theory based on fuzzy tolerance relation is put forward to solve the problem of clustering in this paper. The similarity matrix does not always satisfy ultrametric inequality, theoretically and practically. We give the method to construct the hierarchical quotient space chain if the similarity matrix is only reflexive and symmetric. We consider not only the subset of data (cluster) but also the structure of the different granular clusters. The main contributions in this paper include four parts. (1) We introduce sufficient and necessary condition that normalized distance d(x;y) is an equicrural distance;(2) The relation between equicrural distance and ultrametric inequality is discussed;(3) We propose a method to get the proximate partition of a covering from a tolerance relation;(4) An example for using fuzzy tolerance quotient spaces to clustering is given. © 2011 by Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Rate-embedded differential space-frequency codes based on cyclic delay diversity

引用

Journal of Computational Information Systems 2012年第1期8卷 151-158页

作者： Zhang, Hongwei Xu, Lei Li, Xiaohui Lu, Lu Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 China Anhui Public Security Department Hefei 230061 China

The conventional differential space-frequency codes (DSFC) based on cyclic delay diversity (CDD) only could achieve the same transmission rate with that of a single transmit antenna system, the spectral efficiency was low. To improve the spectral efficiency in a non-coherent multiple antenna system, the advantage of CDD is considered fully in this paper and then a rate-embedded differential space-frequency coding scheme based on grouped CDD is proposed. In the proposed scheme, all transmit antennas are partitioned into several groups firstly, the conventional cyclic delays are adopted to achieve spatial diversity in each group, those symbols among different groups are transmitted differentially with low rate and high rate message matrices alternately, consequently high rate transmission is obtained. Simulation results verify that, compared with the conventional DSFC based on CDD, the proposed coding scheme can achieve obviously higher transmission rates and better error performances. © 2012 Binary Information Press January 2012.

关键词： Spectrum efficiency

来源：评论

学校读者我要写书评

暂无评论

A Cellular-Assisted Efficient Handover Algorithm for Wireless Sensor Networks

引用

International Journal of Communications, Network and System Sciences 2012年第10期5卷 708-713页

作者： Jun Zhu Hui Gao Yuling Ouyang Key Laboratory of Intelligent Computing & Singnal Processing Ministry of Education Anhui University Hefei China Shanghai Research Center for Wireless Communications Shanghai China

Heterogeneous network convergence and handover have become very hot in recent years. This paper proposed an efficient handover scheme in Multi-PAN Wireless Sensor Networks (WSNs). A number of edge nodes are set at the edge of each Personal Area Networks (PANs). A user equipment (UE), which has WSN and cellular network interface, acts as sensor node or mobile cluster head in WSN area. Thus, edge early warning can be acquired from edge nodes and neighbor channel information can be acquired with BS-assistance. Simulation results show that low transmission interrupted delay and low energy consumption can be achieved compared with conventional scheme in WSN.

关键词： Efficient Handover Edge Early Warning Special Beacon Wireless Sensor Networks

来源：评论

学校读者我要写书评

暂无评论

Optic disc localization by projection with vessel distribution and appearance characteristics

Optic disc localization by projection with vessel distributi...

引用

International Conference on Pattern Recognition

作者： Dongbo Zhang Yao Yi Xingyu Shang Yinghui Peng Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education The College of Information Engineering Xiangtan University China

ISBN: (纸本)9781467322164

Considering the vessel distribution and optic disc (OD) appearance characteristics comprehensively, a novel OD localization method based on 1-D projection is proposed. The horizontal location is determined by vascular scatter degree, an evaluation index of vessel distribution. And the vertical location is found by brightness and edge gradient around OD. The proposed method was tested on four publicly-available databases and a self-selection database. The OD was successfully located in 357 images out of 380 images (94%). And the proposed method shows good robustness in both normal and diseased images.

关键词： Databases Retina Optical imaging Biomedical optical imaging Optical filters Optical scattering Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Numerical Methods For Fractional Variational Problems Depending On Indefinite Integrals

Numerical Methods For Fractional Variational Problems Depend...

引用

第五届国际自动控制联合会分数阶导数及其应用会议

作者： Dongling Wang Aiguo Xiao Hunan Key Laboratory for Computation and Simulation in Scienceand Engineering Key Laboratory of Intelligent Computing &Information Processing of Ministry of Education University XiangtanHunan P.R.China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education University Xiangtan Hunan P.R.China

In this paper,the fractional variational integrators for fractional variational problems depending on indefinite integrals in terms of Caputo derivative are *** corresponding fractional discrete Euler-Lagrange equatio... 详细信息

关键词： Numerical Methods For Fractional Variational Problems Depending On Indefinite Integrals

来源：评论

学校读者我要写书评

暂无评论

An application of circumscribed circle filter in the multi-stencils fast marching method 12

An application of circumscribed circle filter in the multi-s...

引用

27th Annual ACM Symposium on Applied computing, SAC 2012

作者： Liu, Hong Hung, Chih-Cheng Hu, Huaifei Yu, Mali Song, Enmin School of Computer Science Huazhong University of Science and Technology Wuhan China Key Laboratory of Education Ministry for Image Processing and Intelligent Control Wuhan Hubei 430074 China School of Computing and Software Engineering Southern Polytechnic State University Marietta GA 30060 United States

ISBN: (纸本)9781450308571

We develop an effective method for improving the segmentation result based on the Multi-Stencils Fast Marching method (MSFM). In MSFM, the gradient information of the image plays a vital role for calculating edges. It is straightforward to obtain the edge of good quality images;however, MSFM may not have robust edge maps available for images with spurious edges. Thus, a special multi-direction circumscribed circle filter is proposed to calculate the image gradient information which is then used in the MSFM. Using the new gradient information, better image contours can be obtained with MSFM. The size of the radius used in our circle filter is constant even the standard deviation of zero-mean Gaussian noise changes while the parameters of mean filter and Canny filter for gradient computation have to be correctly selected according to different noisy images. Our proposed method shows that it is effective through the experiments of image segmentation. © 2012 ACM.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Overlapping area computation between irregular polygons for its evolutionary layout based on convex decomposition

Journal of Software

引用

Journal of Software 2012年第2期7卷 485-492页

作者： Li, Zi-Qiang He, Yan Tian, Zhuo-Jun School of Information and Engineering of Xiangtan Xiangtan University Hunan 411105 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan 411105 China

Low efficiency of interference calculation has become the bottleneck that restricts further development of the performance of evolutionary algorithm for the polygon layout. To solve the problem, in this paper, we propose an algorithm of calculating overlapping area between two irregular polygons. For this algorithm, at first, two irregular polygons are respectively decomposed into the minimum number of convex polygons;afterwards, each pair of the overlapping convex polygons from two resulting partitions is clipped and their overlapping area is calculated. Because through a fast non-overlapping test to all pairs of convex polygons to be clipped, invalid computation is decreased;by making use of simple internal vertex judgment and sheartransformation based on intersecting test and intersection calculation between a line segment and any convex broken line segment, its speed of clipping overlapping convex polygons is improved. The time complexity analysis and numerical experiments indicate that the performance of our presented algorithm superiors to the existing algorithms. © 2012 ACADEMY PUBLISHER.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Weakening interaction suppresses spontaneous symmetry breaking in two-channel asymmetric exclusion processes

引用

Physical Review E 2012年第4期85卷 041132-041132页

作者： Kai-Xuan Zhu Nian Wang Qing-Yi Hao Qi-Yi Liu Rui Jiang Key Laboratory of Intelligent Computing and Signal Processing of Education Ministry Anhui University Hefei 230039 China School of Engineering Science University of Science and Technology of China Hefei 230026 China School of Mathematics and Computational Science Anqing Teachers College Anqing 246133 China

This paper has studied spontaneous symmetry breaking (SSB) phenomenon in two types of two-channel asymmetric simple exclusion processes (ASEPs). One common feature of the two systems is that interactions for each species of particle happen at only one site, and the system reduces to two independent ASEPs when interaction vanishes. It is shown that with the weakening of interaction, the SSB is suppressed. More interestingly, the SSB disappears before the interaction is eliminated. Our work thus indicates that local interaction has to be strong enough to produce SSB. The mean-field analysis has been carried out, and the results are consistent with the simulation ones.

关键词： BROKEN symmetry (Physics) MEAN field theory STOCHASTIC processes SIMULATION methods & models STATISTICAL mechanics SYSTEMS theory

来源：评论

学校读者我要写书评

暂无评论

Point Pattern Matching Based on Spectra of Directed Graphs

引用

电子学报(英文版) 2011年第4期20卷 662-666页

作者： LIANG Dong ZHU Ming FAN Yizheng YAN Pu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

We present a novel algorithm for point pattern matching by means of spectra of directed graphs. Given a feature point-set, we construct a weighted directed graph and skew-symmetric matrix associated with the graph. By using spectral decomposition of the matrix, we give a spectral representation of the feature points with half of the eigenvectors. We theoretically analyze that our method can well deal with the matching problem under affine transformation. The expreiments applied to synthetic data and real-world images show the effectiveness of our method.

关键词：点模式匹配图的谱反对称矩阵特征向量匹配问题仿射变换显示方法谱分解

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：