首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22篇
  完全免费   6篇
工业技术   28篇
  2019年   1篇
  2017年   1篇
  2016年   3篇
  2015年   2篇
  2014年   7篇
  2013年   4篇
  2012年   2篇
  2011年   1篇
  2010年   1篇
  2009年   2篇
  2008年   3篇
  2004年   1篇
排序方式: 共有28条查询结果,搜索用时 171 毫秒
1.
基于聚类分析的随机微粒群算法   总被引:2,自引:2,他引:0       下载免费PDF全文
在对一种保证全局收敛的微粒群算法——随机PSO算法(SPSO)进行分析的基础上,提出了一种基于聚类分析的随机微粒群算法(CSPSO)。CSPSO算法保证了种群的多样性,使微粒能够有效地进行全局搜索。并证明了它依概率收敛于全局最优解。最后以典型的复杂基准优化问题进行了仿真实验,验证了CSPSO的有效性。  相似文献
2.
In this paper,we propose a balanced multi-label propagation algorithm(BMLPA) for overlapping community detection in social networks.As well as its fast speed,another important advantage of our method is good stability,which other multi-label propagation algorithms,such as COPRA,lack.In BMLPA,we propose a new update strategy,which requires that community identifiers of one vertex should have balanced belonging coefficients.The advantage of this strategy is that it allows vertices to belong to any number of communities without a global limit on the largest number of community memberships,which is needed for COPRA.Also,we propose a fast method to generate "rough cores",which can be used to initialize labels for multi-label propagation algorithms,and are able to improve the quality and stability of results.Experimental results on synthetic and real social networks show that BMLPA is very efficient and effective for uncovering overlapping communities.  相似文献
3.
基于聚类分析的微粒群算法   总被引:1,自引:1,他引:0       下载免费PDF全文
在对基本PSO算法进行分析的基础上,针对PSO算法中的早熟收敛问题,提出了一种基于聚类分析的PSO算法(CPSO)。CPSO算法保证了微粒种群的多样性,使微粒能够有效地进行全局搜索。并证明了它依概率收敛于全局最优解。最后以典型的基准优化问题进行了仿真实验,验证了CPSO的有效性。  相似文献
4.
Discovering Typed Communities in Mobile Social Networks   总被引:1,自引:1,他引:0       下载免费PDF全文
Mobile social networks,which consist of mobile users who communicate with each other using cell phones,are reflections of people’s interactions in social lives.Discovering typed communities(e.g.,family communities or corporate communities) in mobile social networks is a very promising problem.For example,it can help mobile operators to determine the target users for precision marketing.In this paper we propose discovering typed communities in mobile social networks by utilizing the labels of relationships between users.We use the user logs stored by mobile operators,including communication and user movement records,to collectively label all the relationships in a network,by employing an undirected probabilistic graphical model,i.e.,conditional random fields.Then we use two methods to discover typed communities based on the results of relationship labeling:one is simply retaining or cutting relationships according to their labels,and the other is using sophisticated weighted community detection algorithms.The experimental results show that our proposed framework performs well in terms of the accuracy of typed community detection in mobile social networks.  相似文献
5.
基于Chan和Taylor的TDOA协同定位算法研究   总被引:1,自引:1,他引:0  
在无线电定位技术中,Chan算法的计算量小,在噪声服从高斯分布的环境下,定位精度高,但在非视距环境下定位精度下降。Taylor算法的精度高和顽健性强,但它对初始值有很强的依赖性。在此基础上,提出一种协同的定位算法:将Chan算法和Taylor算法有机结合,扬长避短,既继承了Chan算法计算量小的特点,又具备了Taylor算法的精确性和顽健性。仿真结果表明,协同定位算法能有效地抑制非视距传播中恶劣信道环境的影响,且性能稳定。  相似文献
6.
In this paper, we investigate the state estimation problem for a class of Markovian Jump Linear Systems (MJLSs) in the presence of bounded polyhedral disturbances. A set-membership estimation algorithm is first proposed to find the smallest consistent set of all possible states, which is shown to be expressed by a union of multiple polytopes. The posterior probabilities of the system jumping modes are then estimated by introducing the Lebesgue measure, based on which the optimal point estimate is further provided. Moreover, a similarity relationship for polytopes is defined and an approximate method is presented to calculate the Minkowski sum of polytopes, which can help reduce the computational complexity of the overall estimation algorithm.  相似文献
7.
A new impulse detection and filtering algorithm is proposed for restoration of images that are highly corrupted by impulse noise. It is based on the minimum absolute value of four convolutions obtained by one-dimensional Laplacian operators. The proposed algorithm can effectively remove the impulse noise with a wide range of noise density and produce better results in terms of the qualitative and quantitative measures of the images even at noise density as high as 90%. Extensive simulations show that the proposed algorithm provides better performance than many of the existing switching median filters in terms of noise suppression and detail preservation.  相似文献
8.
The problem of academic expert finding is concerned with finding the experts on a named research field. It has many real-world applications and has recently attracted much attention. However, the existing methods are not versatile and suitable for the special needs from academic areas where the co-authorship and the citation relation play important roles in judging researchers’ achievements. In this paper, we propose and develop a flexible data schema and a topic-sensitive co-pagerank algorithmcombined with a topic model for solving this problem. The main idea is to measure the authors’ authorities by considering topic bias based on their social networks and citation networks, and then, recommending expert candidates for the questions. To infer the association between authors and topics, we draw a probability model from the latent Dirichlet allocation (LDA) model. We further propose several techniques such as reasoning the interested topics of the query and integrating ranking metrics to order the practices. Our experiments show that the proposed strategies are all effective to improve the retrieval accuracy.  相似文献
9.
Reversible data hiding has attracted considerable attention in recent years. Being reversible, the decoder can extract hidden data and recover the original image completely, and the difference expansion (DE) scheme can lead to a lossless pixel after secret data exacting. Furthermore, despite achieving pixel reversibility based on the concept of expanded differencing, the difference expansion scheme can cause enormous image distortion because of the size of the difference. The proposed scheme in this paper describes a novel prediction for achieving predictive error based reversible data hiding by considering the relation between a pixel and its neighboring pixel and using the predictor to identify the projected difference in pixel value. Experimental results show that the proposed scheme is capable of providing great embedding capacity without causing noticeable distortion by selecting the minimal predictor based on pixel expansion. In multilevel cases, this proposed method performs better than other existing methods. Moreover, the proposed scheme is able to pass the Chi-square test, a test used to find whether an image utilizes LSB for data hiding.  相似文献
10.
Information hiding is an important method to achieve multi-media security. Recently, many researchers have paid attention to the reversible data hiding scheme, which can completely recover original multi-media files after the embedded data are extracted. In this paper, a side-match approach is proposed to achieve more capacity in histogram-based reversible data hiding for grayscale images. The histogram is created by exploiting the difference in all the values between pixels and their predictedive values. Experimental results show that our method is capable of providing a great embedding capacity without causing noticeable distortion. In one-level hiding, where it has the best capacity, our method conserves image qualities larger than 48 dB. Furthermore, in multilevel hiding, a rotation strategy is proposed to further improve image qualities. Experimental results show that our method performs better than other existing methods in multilevel hiding cases.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号