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

A novel hierarchical clustering method in signed social network

Journal of Computational Information systems 2015年第21期11卷 7865-7872页

作者： Guo, Jingfeng Chen, Xiao Fan, Chaozhi Hu, Xinzhuan College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China Qian'an College North China University of Science and Technology Qian'an China

Based on a new feature that macro network structure and micro game have mutual inuence on the formation of the community, to mining communities in signed network, a novel algorithm SNCGHC is proposed. Firstly, according to the signed attributes and the node degree, the Shapley Value is improved, to avoid ignoring the effect of external environment on the Shapley Value and reduce the calculation complexity. Secondly, considering the inuence of network density on the formation of the coalition (community), we find the calculation method of average coalition payoff and create the signed network coalitional game model. Thirdly, SNCGHC depends on average payoff maximization of coalition to achieve hierarchical clustering of signed network. Finally, experiments show that our method can detect better community structures as compared to other existing methods. Copyright © 2015 Binary Information Press.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Inuence maximization algorithm based on genetic algorithm

引用

Journal of Computational Information systems 2014年第21期10卷 9255-9262页

作者： Guo, Jingfeng Liu, Yuanying Shen, Jiali Wei, Zhenzhen Lv, Jiaguo College of Information Science and Engineering Yanshan University Qinhuangda China College of Information Technology Hebei University of Economics and Business Shijiazhuang China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The inuence maximization problem is defined as providing a given initial integer k, mining top-k inuential nodes from a social network such that the spread of inuence in the network is maximized. Some existing studies are based on Greedy algorithm, but their time complexity is very high. In this paper, a different method based on Genetic Algorithms, denoted as MAGA is proposed. In the MAGA algorithm, the set of k nodes is seen as a candidate solution, and the expected inuence value as fitness. Use the genetic algorithm to get the optimal solution. Experiments show that the algorithm achieved a balance in inuence spread and running time.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

3-SPS+RRS+PS mechanism analysis and hessian matrix solution

3-SPS+RRS+PS mechanism analysis and hessian matrix solution

引用

2014 International Conference on Logistics Engineering, Management and computer Science, LEMCS 2014

作者： Zhang-Yuan Wangzhen Guoansong Guoi-Juan Xi, Feng-Feng Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao066004 China Hebei Normal University of Science and Technology Qinhuangdao Hebei066004 China Force Equipment Research Institute Airlines Beijing100076 China China National Heavy Machinery Research Institute Xian710032 China Department of Aerospace Engineering Ryerson University Toronto Canada

ISBN: (纸本)9789462520103

3-SPS+RRS+PS is a new type of mechanism. There is good application prospect in the field of aerospace. Especially some key kinetic characteristic calculation algorithms are implemented, which makes its calculation mechanized, thus it will contribute to make the dynamics performance of this mechanism optimized and ascended. In the paper, firstly, the degree of freedom is calculated and freedom nature is analyzed. Then the reverse solution is calculated, started with the nature of degree of freedom. And the mechanism velocity and acceleration inverse solutions are calculated in the direct derivation method. Although there are shortcomings that calculation process is complicated in direct derivation method, its calculation process is easy to realize mechanization. Then a kind of fast numerical calculation algorithm is given and MATlab program is implemented. The algorithm has universal applicability to the mechanism of continuous differentiable inverse equation, and can be applied to general parallel mechanism. © 2014. The authors - Published by Atlantis Press.

关键词： Mechanisms

来源：评论

学校读者我要写书评

暂无评论

Influence maximization in MicroBlog based on a new user influence ranking method

引用

Journal of Information and Computational Science 2015年第9期12卷 3729-3737页

作者： Liu, Yuanying Guo, Jingfeng Hu, Xinzhuan Liu, Miaomiao Zhang, Jilong College of Information Science and Engineering Yanshan University Qinhuangdao China College of Information Technology Hebei University of Economics and Business Shijiazhuang China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The characteristics of the MicroBlog data are analyzed firstly. Then WeiBo graph is constructed through tweets forwarded path and user influence ranking calculation method which according to the classic PageRank is given;the initial value of user influence ranking concludes three attributes, such as followers' number, tweets' number and recent tweets' quality. Maximization algorithm in MicroBlog based on user influence ranking is put forward finally. Experiments show that this maximization algorithm is superior to the others in spread scope. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Improving Vision Transformers with Nested Multi-head Attentions

Improving Vision Transformers with Nested Multi-head Attenti...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Jiquan Peng Chaozhuo Li Yi Zhao Yuting Lin Xiaohan Fang Jibing Gong School of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Microsoft Research Asia Beijing China

Vision transformers have significantly advanced the field of computer vision in recent years. The cornerstone of these transformers is the multi-head attention mechanism, which models interactions between visual elements within a feature map. However, the vanilla multi-head attention paradigm independently learns parameters for each head, which ignores crucial interactions across different attention heads and may result in redundancy and under-utilization of the model’s capacity. To enhance model expressiveness, we propose a novel nested attention mechanism, Ne-Att, that explicitly models cross-head interactions via a hierarchical variational distribution. We conducted extensive experiments on image classification, and the results demonstrate the superiority of Ne-Att.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ICRA: An improved community detection algorithm on signed social networks

引用

Journal of Computational Information systems 2015年第11期11卷 4091-4099页

作者： Hu, Xinzhuan Guo, Jingfeng Zhao, Yue Liu, Yuanying School of Economics and Management Yanshan University Qinhuangdao China College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

The study on signed social networks community detection has been paid more and more attention. Research shows that two-phase signed social networks community detection algorithm can not correctly divide the network. To solve the problem, we propose a new algorithm: ICRA (Improved Clustering Re-clustering Algorithm). In the process of community division, the assignment of vertices with negative edges shall be determined by comparing the value of network positive density with community positive density. Our algorithm solves the problems existing in CRA, including network division failure and wrong division starting from different vertices. ©, 2015, Binary Information Press. All right reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

On-site determination of heavy metal in soil using electrochemical stripping analysis

On-site determination of heavy metal in soil using electroch...

引用

American Society of Agricultural and Biological Engineers Annual International Meeting 2012

作者： Wang, Zhiqiang Gang, Liu Yang, Xiaojing Key Lab. of Modern Precision Agriculture System Integration Research China Agricultural University 17 Qinghua Donglu Beijing China China Agricultural University 17 Qinghua Donglu Beijing China College of Computer Science and Technology Shandong University of Technology 12 Zhangzhou Road Zibo China

ISBN: (纸本)9781622762088

Heavy metals are considered to be hazardous pollutants with toxic effects on plant and/or human health. Different techniques and methods (e.g., AAS, ICP-MS, ICP-OES) have been utilized for trace metals determination in the laboratory, but they are characterized by high costs, complex operation and long time consuming. The demand of rapid on-site screening and assessment of agricultural land contaminate induced by heavy metal is highly desirable. This paper reported a fast, inexpensive electrochemical analysis method for the simultaneous determination of cadmium (Cd) and lead (Pb) in soil samples. A simplified soil extraction procedure, using 0.11 molL-1 acetic acid and a 1 h ultrasonic agitation, had been used to fulfill the requirements of field-based screening usage. A disposable sensor, incorporating a three-electrode configuration (working electrode, reference electrode and counter electrode), had been fabricated by low cost screen-printing technology. The surface of graphite carbon working electrode was judiciously modified by multiwalled carbon nanotubes(MWCNTs)/Nafion/bismuth coating. Coupled with the portable electrochemical instrument, trace detection of heavy metal ions had been carried out by square wave anodic stripping voltammetry (SWASV) technique. The electrode exhibited good sensibility and stability in the electrochemical measurement. Linear responses were obtained in the range from 1 to 80 μgL-1 for both the metal ions at a preconcentration time of 180s, with detection limits of 0.5 μgL-1 for Cd(II) and 0.8 μgL -1 for Pb(II), respectively. The relative standard deviation is 1.9% and 2.3% for 20 μgL-1 each of Cd(II) and Pb(II). Soil samples were assayed by the proposed process and compared against standard ICP-MS analysis, the results showed good agreement between methods.

关键词： Soils

来源：评论

学校读者我要写书评

暂无评论

A load balancing algorithm for multi-root ONS

引用

Journal of Computational Information systems 2014年第7期10卷 2735-2742页

作者： Hao, Fengzhai Liu, Yongshan Chen, Wei College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China Data Industry Research Lab. Qinhuangdao 066004 China

In order to solve the overload problem of root ONS in the EPC network, a load balancing algorithm based on multi-root ONS is proposed. Based on the proposed load balancing ONS (LB ONS) architecture, the ONS Root is defined to have two states, idle or busy. According to CPU utilization and memory utilization of the ONS Root and in combination with threshold controlling to periodically update the ONS Root states, which makes the requests coming from client applications be transferred to an ONS Root which is idle. Experiment results show that the algorithm can reduce query hops and query delays effectively and offer lookup service efficiently. © 2014 Binary Information Press.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Research on a denoising smoothing algorithm for 3D scattered point cloud

引用

ICIC Express Letters 2014年第9期8卷 2403-2409页

作者： Gu, Xiaoying Liu, Yongshan Wu, Qiong Department of Information Science and Engineering China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

In order to effectively eliminate outliers and noise points in 3D scattered point cloud, a denoising smoothing algorithm which is the combination of removing outliers algorithm and trilateral filter is proposed. This is accomplished by rejecting outliers, correcting the normal direction and moving noise points along the modified normal direction within local adaptive neighborhoods. First, the outliers are removed by the method of mathematical statistics, on this basis, estimating normal direction and curvature of point cloud by covariance analysis method. Then, correct the normal direction by combining trilateral filter weighting factor with adaptive optimal neighborhood function. Finally, calculate position offset of data points in the direction of normal amendment by trilateral filter weighting factor in order to smooth the point cloud. Experimental results show that the proposed method is simple and effective, successfully removing noise from point cloud while preserving inherent geometric features. © 2014 ISSN 1881-803X.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Multi-Update Patterns and Validity Verification for Robust Visual Tracking

引用

Journal of computers (Taiwan) 2020年第4期31卷 77-90页

作者： Wen, Jia Wang, Hong-Jun Li, Yan-Nan Zhao, Ji-Wei Yang, Yu-Ying School of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province China Key Laboratory of Software Engineering of Hebei Province China

The Object tracking is a challenging problem in computer vision field. Now, deep learning has made outstanding achievements in feature extraction. There are already some examples of deep learning applications in visual tracking. But, they almost paid attention to precision and sacrificed efficiency. So we propose a tracker named adaptive combination tracker(ACT), based on neural network model, which gives consideration to both precision and efficiency. Our ACT tracker gets rich features offline through Stacked Denoising Autoencoders (SDAE) and transfers them to online tracking. In tracking, a dynamic particle filter algorithm is proposed to speed up tracking. We update our tracker with different patterns according to the change in appearance. In order to ensure efficiency, our tracker regulates speed adaptively. Our tracker regulates speed precisely to avoid drift caused by fast motion as much as possible, and confirm and optimize the effectiveness of the results by comparison with previous target. We evaluate our tracker on OTB2013 datasets. Extensive experiments on OTB2013 datasets demonstrate that the proposed tracker performs favorably in relation to the state-of-the-art methods. © 2020 computer Society of the Republic of China. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：