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

9th CCF International Conference on Natural Language Processing and Chinese Computing, NLPCC 2020

作者： Zhang, Lizhi Ban, Zhijie Inner Mongilia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China

ISBN: (纸本)9783030604493

Author name disambiguation has long been viewed as a challenging problem in scientific literature management, and with the substantial growth of the scientific literature, the solution to this problem has become increasingly difficult and urgency. In this paper, we conduct research on the author name disambiguation problem in large-scale academic papers. In our method, we combine the paper feature information and the relation information between the papers for disambiguation. Based on the Aminers disambiguation framework, we present a novel method to constructing the paper relation graph based on atomic cluster and propose an efficient post processing algorithm, aiming to improve the disambiguation performance by rule-based clustering, this algorithm utilizes similarity features based on metadata information and implement two types of disambiguation rules. We carefully evaluate the proposed disambiguation method on real-world large data and experimental result shows that our method achieves clearly better performance than the state-of-the-art methods. © 2020, Springer Nature Switzerland AG.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

P-TECS: An Energy Balance Algorithm for Opportunistic Networks Integrating Multiple Node Attributes 5th

P-TECS: An Energy Balance Algorithm for Opportunistic Netwo...

引用

5th International Conference on Security and Privacy in New Computing Environments, SPNCE 2022

作者： Xu, Gang Yang, Xiaoying Chen, Jingjian Huang, Baoqi College of Computer Science Inner Mongolia University Hohhot010021 China Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia University Hohhot010021 China

ISBN: (纸本)9783031306228

This paper proposes an energy balance opportunistic networks routing algorithm P-TECS. The P-TECS solves the problems of energy consumption of key nodes in existing opportunistic routing algorithms. This paper defines the relay degree of communication between nodes, and designs a P-TECS opportunistic routing algorithm integrating dynamic attributes of multiple nodes. Simulation results show that in resource-constrained opportunistic networks, P-TECS significantly improves the message delivery rate and average remaining energy of nodes, and significantly reduces the routing overhead rate. © 2023, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable process modeling based on net synthesis under cloud computing environment

Scalable process modeling based on net synthesis under cloud...

引用

2011 IEEE International Conference on Granular Computing, GrC 2011

作者： Zhou, Jiantao Liang, Rong Wang, Yan College of Computer Science Inner Mongolia University Hohhot China Key Laboratory of Data Mining and Knowledge Engineering Hohhot China

ISBN: (纸本)9781457703713

Recently research on modeling methods of complicated processes under complex network environments has become a focus in workflow field. Now cloud computing environment provides a specific application background for the interaction and collaboration of workflows. In this paper, workflow processes were modeled as Semantics Constrained Net (SCN), which is one kind of extended Petri net. Then net synthesis mechanism constrained by semantics was researched, including synthesis rules and liveness proven. And a scalable solution of complex workflow process modeling in cloud was proposed. An instance of e-business was given to describe cooperative workflow under cloud computing environment. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Automatic extraction of foreground objects from Mars images

引用

Geo-Spatial Information Science 2012年第1期15卷 17-25页

作者： WANG Shuliang LIU Chang WU Shangru NIE Qianqian WANG Yongtao ZENG Shi ZHU Haifeng International School of Software Wuhan University129 Luoyu RoadWuhan 430079China Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia Autonomous RegionInner Mongolia UniversityHohhot 010021China Department of Geography East Michigan UniversityYpsilantiMI 48197USA

A novel method is proposed to automatically extract foreground objects from Martian surface *** characteristics of Mars images are distinct,*** illumination,low contrast between foreground and background,much noise in the background,and foreground objects with irregular *** the context of these characteristics,an image is divided into foreground objects and background *** filtering is first applied to rectify ***,wavelet transformation enhances contrast and denoises the ***,edge detection and active contour are combined to extract contours regardless of the shape of the *** results show that the method can extract foreground objects from Mars images automatically and accurately,and has many potential applications.

关键词： automatic object extraction Mars images homomorphic filtering wavelet transformation active contour edge detection

来源：评论

学校读者我要写书评

暂无评论

Link Prediction for Opportunistic Networks Based on Hybrid Similarity Metrics and E-LSTM-D Models 24th

Link Prediction for Opportunistic Networks Based on Hybrid...

引用

24th International Conference on Web Information Systems engineering, WISE 2023

作者： Yang, Xiaoying Li, Lijie Xu, Gang Song, Ming Zhang, Feng College of Computer Science Inner Mongolia University Hohhot010021 China Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering Inner Mongolia University Hohhot010021 China School of Computer and Information Technology Shanxi University Taiyuan030000 China

ISBN: (纸本)9789819972531

Link prediction is a crucial issue in opportunistic networks routing research. Static link prediction methods ignore the historical information of network evolution, which affects the prediction accuracy. In this paper, we propose a link prediction method (HS-LSTM) that combines hybrid similarity metrics and the E-LSTM-D model. The approach extracts structural features using hybrid similarity metrics, constructs a structural feature matrix, and applies the E-LSTM-D model to extract temporal features and predict the links that have not yet appeared in the network. Our experiments on three real datasets of opportunistic networks (Infocom5, MIT, and Haggle) shows that our proposed method outperforms the baseline method in terms of prediction accuracy. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Sampling topic representative users by integrating node degree and edge weight 5

Sampling topic representative users by integrating node degr...

引用

5th IEEE International Conference on data Science in Cyberspace, DSC 2020

作者： Wang, Jiangwen Ban, Zhijie Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China China Banking and Insurance Information Technology Management Co. Ltd Beijing China

ISBN: (纸本)9781728195582

Finding a subset of users to statistically represent the original social network in terms of attributes has received a lot of attention recently. The existing literature had proved that the problem is NP-Hard and proposed some sampling models, but representative degrees aren't systematically studied. Taking node degree and edge weight into account, we present a topic sampling model for the whole social network in this paper. Firstly, by statistically calculating node degrees for one real dataset, we find that one node is more likely to be a representative user if its degree is high. We then give some definitions about representative degrees. Based on statistical stratified sample, we finally give a sampling model of topic representative users who are from most or all attribute groups in the network. Experimental results show that our algorithm significantly outperforms other six baseline methods and is also effective in terms of time complexity. © 2020 IEEE.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Sampling Topic Representative Users by Integrating Node Degree and Edge Weight

Sampling Topic Representative Users by Integrating Node Degr...

引用

IEEE International Conference on data Science in Cyberspace (DSC)

作者： Jiangwen Wang Zhijie Ban Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195599

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel distance matric: Generalized relative entropy

arXiv

引用

arXiv 2017年

作者： Liu, Shuai Lu, Mengye Liu, Gaocheng Pan, Zheng College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Key Laboratory of Data Mining and Knowledge Engineering Hohhot China

Information entropy and its extension, which are important generalization of entropy, have been applied in many research domains today. In this paper, a novel generalized relative entropy is constructed to avoid some defects of traditional relative entropy. We presented the structure of generalized relative entropy after the discussion of defects in relative entropy. Moreover, some properties of the provided generalized relative entropy is presented and proved. The provided generalized relative entropy is proved to have a finite range and is a finite distance metric. Copyright © 2017, The Authors. All rights reserved.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

Parallel generated method of transcriptional regulatory networks

Parallel generated method of transcriptional regulatory netw...

引用

作者： Liu, Shuai Ta, Na Lu, Mengye Liu, Gaocheng Bai, Weiling Li, Wenhui College of Computer Science Inner Mongolia University Hohhot010012 China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot010012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Generated method of transcriptional regulatory networks remains an important research in biology. Many approaches have been proposed to construct transcriptional regulatory networks. However, with the increase of ChIP-seq and RNA-seq data, the speed of constructing transcriptional regulation networks is still a challenge. Moreover, parallel computing lacks application in constructing gene regulatory networks through the analysis of the relationships between transcription factors (TFs) and target genes (TGs). Therefore, in this paper, a parallel generated method of transcriptional regulatory networks was proposed. First, two datasets, Michigan Cancer Foundation – 7 (MCF-7) and Cardiomyocytes (CM) were applied. Then, a parallel method was used to generate transcriptional regulatory network with their transcription factors (TFs) and target genes (TGs). Finally, experimental results showed that 61% regulatory relations in MCF-7 were validated in the Gene Expression Omnibus (GEO), while 29% results needed further experimental verification. Besides, 56% regulatory relations in CM were consistent with GEO, while 33% results were not yet verified. Furthermore, speed of parallel algorithm was faster than traditional serial algorithm in generating transcriptional regulatory networks. © 2018 John Wiley & Sons, Ltd.

关键词： Transcription factors

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Non-Dominated Sorting Genetic Algorithm Based Multi-Objective Optimization Energy-Balanced Opportunistic Network Routing Strategy

SSRN

引用

SSRN 2023年

作者： Song, Ming Tang, Qi Xu, Gang Zhang, Feng Hao, Xinyu Huang, Baoqi College of Computer Science Inner Mongolia University Inner Mongolia Hohhot China Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering China Computer Science and Information Technology Shanxi University Shanxi Province Taiyuan China

In opportunistic networks, the uneven energy consumption of nodes and the polarization of cache utilization are important factors that impact network sustainability and overall performance. To address these issues, this paper proposes a multi-objective optimization energy-balanced routing strategy for opportunistic networks based on adaptive non-dominated sorting algorithm (ANMOR). The strategy aims to maximize the forwarding capability of nodes while achieving energy balance. The algorithm can find all Pareto-optimal solutions in the entire search space, which represent the trade-off relationships between different objectives and can provide a range of feasible solutions for routing. Experimental results show that this strategy can significantly improve the energy balance and cache utilization of opportunistic networks, enhance network performance, and prolong network lifetime. © 2023, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：