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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

78 篇 会议
59 篇 期刊文献
1 册 图书

馆藏范围

138 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

95 篇 工学
- 79 篇 计算机科学与技术...
- 66 篇 软件工程
- 23 篇 信息与通信工程
- 14 篇 光学工程
- 12 篇 电气工程
- 12 篇 生物工程
- 10 篇 生物医学工程（可授...
- 7 篇 动力工程及工程热...
- 6 篇 交通运输工程
- 5 篇 机械工程
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 控制科学与工程
- 5 篇 建筑学
- 5 篇 化学工程与技术
- 4 篇 土木工程
- 4 篇 环境科学与工程（可...
- 4 篇 安全科学与工程
63 篇 理学
- 39 篇 数学
- 18 篇 统计学（可授理学、...
- 14 篇 生物学
- 11 篇 物理学
- 6 篇 化学
- 5 篇 系统科学
24 篇 管理学
- 16 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
8 篇 法学
- 8 篇 社会学
7 篇 医学
- 6 篇 临床医学
- 4 篇 基础医学(可授医学...
5 篇 教育学
- 5 篇 教育学
3 篇 经济学
2 篇 农学

主题

6 篇 feature extracti...
6 篇 training
5 篇 reinforcement le...
4 篇 big data
4 篇 data mining
4 篇 semantics
3 篇 complex networks
3 篇 object detection
3 篇 three-dimensiona...
3 篇 learning algorit...
3 篇 convolution
3 篇 optimization
3 篇 population dynam...
3 篇 accuracy
2 篇 next generation ...
2 篇 support vector m...
2 篇 semantic segment...
2 篇 distillation
2 篇 data centers
2 篇 task analysis

机构

31 篇 fujian provincia...
26 篇 college of compu...
15 篇 key laboratory o...
12 篇 college of mathe...
10 篇 key laboratory o...
8 篇 fujian provincia...
7 篇 fujian provincia...
6 篇 key laboratory o...
6 篇 fujian provincia...
5 篇 engineering rese...
5 篇 college of mathe...
4 篇 fuzhou universit...
4 篇 college of mathe...
4 篇 fujian provincia...
4 篇 fujian provincia...
4 篇 faculty of mathe...
4 篇 the key laborato...
3 篇 quanzhou normal ...
3 篇 department of ra...
3 篇 national institu...

作者

18 篇 guo wenzhong
11 篇 wang shiping
11 篇 guo kun
8 篇 xiaodong wu
7 篇 yu zhiyong
7 篇 ke xiao
6 篇 chen zhaoliang
5 篇 huang fangwan
5 篇 wang tao
5 篇 wu zhihao
5 篇 chen yuzhong
4 篇 zhong luying
4 篇 luo huan
4 篇 kun guo
4 篇 plant claudia
3 篇 zhu daxin
3 篇 yuzhu zeng
3 篇 wang fanwen
3 篇 li li
3 篇 qin jing

语言

131 篇 英文
6 篇 其他
1 篇 中文

检索条件"机构=Fujian Provincial Key Laboratory of Data Intensive Computing"

共 138 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Globally Consistent Vertical Federated Graph Autoencoder for Privacy-Preserving Community Detection 17th

Globally Consistent Vertical Federated Graph Autoencoder for...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Fang, Yutong Huang, Qingqing Ye, Enjie Guo, Wenzhong Guo, Kun Chen, Xiaoqi Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science/College of Software Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923557

Community detection is a trendy area in research on complex network analysis and has a wide range of real-world applications, like advertising. As people become increasingly concerned about privacy, protecting participants’ privacy in distributed community detection has become a new challenge. When applied to not identically and independently distributed (Non-IID) data, most federated graph algorithms suffer from the weight divergence problem caused by diversified training of local and global models, resulting in accuracy degradation. Furthermore, the privacy protection approaches based on anonymization, such as differential privacy (DP), and cryptography, such as homomorphic encryption (HE), incur accuracy loss and high time consumption, respectively. In this paper, we propose a globally consistent vertical federated graph autoencoder (GCVFGAE) algorithm, which builds a globally consistent model among the coordinator and all participants to solve the Non-IID graph data problem. As well, an attribute blinding strategy based on security aggregation is developed to protect the network privacy of each participant without losing accuracy. Both real-world and artificial networks’ experiments show that our algorithm reaches higher accuracy than the existing vertical federated graph neural networks (GNNs) and the simple distributed graph autoencoder without federated learning and detects communities identical to those found by the standard graph autoencoder (GAE). © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

ABCD-HN: An Artificial Network Benchmark for Community Detection on Heterogeneous Networks 18th

ABCD-HN: An Artificial Network Benchmark for Community Dete...

引用

18th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2023

作者： Liu, Junjie Guo, Kun Wu, Ling Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science/College of Software Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819996360

Community detection is essential for identifying cohesive groups in complex networks. Artificial benchmarks are critical for evaluating community detection algorithms, offering controlled environments with known community structures. However, existing benchmarks mainly focus on homogeneous networks and overlook the unique characteristics of heterogeneous networks. This paper proposes a novel artificial benchmark, called ABCD-HN (Artificial Network Benchmark for Community Detection on Heterogeneous Networks), for community detection in heterogeneous networks. This benchmark enables the generation of artificial heterogeneous networks with controllable community quantity, node quantity, and community complexity. Additionally, an evaluation framework for artificial heterogeneous networks is proposed to assess their effectiveness. Experimental results demonstrate the effectiveness and usability of ABCD-HN as a benchmark for artificial heterogeneous networks. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Heterogeneous networks

来源：评论

学校读者我要写书评

暂无评论

An Overlapping Local Community Detection Algorithm Based on Node Transitivity and Modularity Density 15th

An Overlapping Local Community Detection Algorithm Based on ...

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Huang, Xintong Wu, Ling Guo, Kun College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350116 China

ISBN: (纸本)9789811625398

The local community detection (LCD) method can discover the local community structure in which the seed node is located. Compared with global community detection, local community detection is characterized by its low cost and high efficiency. However, most existing LCD methods only return a non-overlapping community. Individuals in the real world may participate in multiple communities, which can only be discovered by using overlapping local community detection methods. In this study, an overlapping local community detection algorithm based on modularity and node transitivity. First, the scope and structure information of the overlapping communities are obtained according to the node transitivity. Second, NMF is used to obtain the number of overlapping communities. Finally, the local modularity density based on edge weights is used to refine the detected local communities. The experimental results validate the high performance of our method to the other method in comparison. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A Distributed Storage Middleware Based on HBase and Redis 15th

A Distributed Storage Middleware Based on HBase and Redis

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Xu, Lingling Chen, Yuzhong Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789811625398

In the era of big data, traditional relational databases face challenges in massive data storage. HBase is a non-relational database based on column storage which is used widely for big data storage. The writing performance of HBase is high, but the unbalanced load caused by its uneven data storage strategy is the bottleneck of its reading performance. HBase needs to access disks to get query results. Therefore, the efficiency of disk access has a great impact on the query performance of HBase. In view of the above problems, this paper proposes a storage middleware which utilizes HBase for load balancing and Redis for memory caching. Specifically, we improve HBase’s original load balancing algorithm for Regions and RegionServers and customize a Redis cache eviction algorithm according to the data’s query and update frequency. Furthermore, the coprocessor of HBase is used to synchronize data between HBase and Redis. Experiments on synthetic datasets show that the proposed storage middleware achieves better writing and reading performance than HBase. The load balancing algorithm employed in the middleware is better than HBase's original algorithm. The hit rate of the customized cache eviction algorithm is also higher than that of the LRU algorithm. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Horizontal Federated Traffic Speed Prediction Base on Secure Node Attribute Aggregation 17th

Horizontal Federated Traffic Speed Prediction Base on Secur...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Ye, Enjie Guo, Kun Guo, Wenzhong Chen, Dangrun Zhang, Zihan Li, Fuan Zheng, JiaChen Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science/College of Software Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923847

Federated graph learning has been widely used in distributed graph machine learning tasks. The data distribution of existing graph-based federated Spatio-temporal prediction methods is mainly segmented by graph topology. However, in the real-world Spatio-temporal traffic speed prediction task, a location will have data from different devices belonging to different companies. A node may have multi-party information in the real-world distributed traffic speed prediction scenario. The difference in multi-party information leads to the information not being fully utilized. Moreover, the direct transmission of node embedding in the federated learning process may also risk privacy leaks. Using homomorphic encryption and other encryption methods will bring a high computational overhead. Therefore we propose a new distributed privacy-preserving traffic speed prediction algorithm, which uses secure node attribute aggregation strategy(SNAAS) to apply to the multi-party collaborative traffic speed prediction scenario when the graph topology structure is public. At the same time, secret sharing technology is used in SNAAS to protect the attribute matrix and reduce the overhead of secret computing. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Two-Stage Graph Computation Model with Communication Equilibrium 15th

A Two-Stage Graph Computation Model with Communication Equil...

引用

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Dong, Yanmei Chen, Rongwang Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China College of Mathematics and Computer Science Wuyi University Wuyishan Fujian354300 China Digital Fujian Tourism Big Data Institute Wuyishan Fujian354300 China

ISBN: (纸本)9789811625398

Distributed graph computing aims at performing in-depth analysis on large networks in a parallel manner. Iterative communication computation is an important model to perform graph analysis. Moreover, high-efficiency iterative communication computation is necessary for assuring the quality of graph partitioning. Many strategies to improve graph computing are usually based on the hypothesis of single communication iteration which focuses on the optimization of load balance in a single graph partitioning and the improvement of parallel granularity or communication manners. However, a graph in the real-world usually requires complex communication iterations to achieve good analysis results, which often have the problems of data and communication tilting and low analysis efficiency. In this paper, we propose a two-stage graph computing model with communication equilibrium (TSMCE). The model employs a communication-equilibrated graph partitioning strategy (CEGP) for load balancing and a two-stage graph computing mode (TS) to reduce the crossing-partition communication. With the change of graph density, various factors such as load balancing, communication balancing, cross-partition transmission traffic, communication delay, and convergence speed can always maintain an efficient balance. The experiments conducted on the real-world datasets show that the communication-equilibrated graph partitioning strategy can divide a graph with high quality compared with Hash and Metis. Besides, the overall performance of our two-stage graph computing model with communication equilibrium is higher than that of the BSP model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Real-time Information Service System for the Meteorological Screen Base on CDMA

Real-time Information Service System for the Meteorological ...

引用

2016 International Conference on Wireless Communication and Network Engineering (WCNE2016)

作者： Tai-sheng ZENG Ji-chang WEN College of Mathematics and Computer Science Quanzhu Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University College of Engineering Quanzhou Meteorological Bureau

Real-time Information Service System for the Meteorological Screen Base on CDMA is designed, a complete set of information gathering, processing, aggregating and publishing system for weather prediction products, disaster warning information, Typhoon real-time position information, weather information every ten minutes. Real-time weather information to the grouping of the LED display live information and notice is automatically released. The system contains user classification and display management module, disaster warning information into the module, all kinds Notice entry module, real-time weather information collected the summary module as well as real-time weather information automatically release the module.

关键词： LED CDMA Information service system

来源：评论

学校读者我要写书评

暂无评论

A personalized privacy protection data uploading scheme for mobile crowdsensing 2

A personalized privacy protection data uploading scheme for ...

引用

2nd IEEE International Conference on Industrial Internet Cloud, ICII 2019

作者： Ma, Rong Chen, Lei Xiong, Jinbo Tian, Youliang Li, Qi Liu, Ximeng Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou350117 China College of Engineering and Computing Georgia Southern University GA30458 United States Guizhou Provincial Key Laboratory of Public Big Data Guizhou University Guiyang550025 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Fujian Provincial Key Laboratory of Information Security of Network Systems College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China

ISBN: (纸本)9781728129778

Mobile crowdsensing is a typical application of the Industrial Internet of hings and brings a promising opportunity to construct powerful industrial systems and services. The existing privacy protection schemes usually adopt a unified privacy protection policy for all sensing data due to lack of effective privacy metrics, thereby resulting in excessive or insufficient protection of privacy information and low accuracy of sensing data. To tackle these issues, in this paper, we propose a personalized privacy protection data uploading (PPDU) scheme based on game theory and sensing user's historical spatio-temporal data. In PPDU, a personalized privacy measurement algorithm is designed to obtain the personalized privacy degree of user sensing data. Based on the privacy degree, a user uploading behavior game is designed by employing an incomplete information game, and a game-based spatio-temporal sensing data uploading method is proposed for user privacy protection. Simulation experiments with real trajectory data show that the PPDU scheme makes a reasonable balance between retaining high quality of crowdsensing service and protecting user's privacy. © 2019 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

A Three-party Repeated Game Model for data Privacy in Mobile Edge Crowdsensing of IoT 13

A Three-party Repeated Game Model for Data Privacy in Mobile...

引用

13th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2020

作者： Zhao, Mingfeng Chen, Lei Xiong, Jinbo Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Mathematics and Informatics Fujian Normal University Fuzhou350117 China College of Engineering and Computing Georgia Southern University GA30458 United States State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9781631902710

The low request response delay of mobile edge crowdsensing (MECS) paradigm allows quick interactions among entities in practical scenarios. However, there often exist dishonest behaviors in such interactions, and the personal information leakage involved seriously threatens the privacy and security of sensing users. To tackle this problem, previously we had proposed a non-repeated three-party game model, without the consideration of multiple interactions in the actual scenario. Based on game theory, this research therefore proposes a three-party repeated game model. Specifically, we propose the corresponding social norms for different phases of sensing data. It analyzes all possible behaviors deviating from rationality, calculates the change of corresponding payoff function, and explores the influencing factors and constraints of players' honest behaviors based on the premise of maximizing interests. Finally, a significant number of simulations and numerical analyse indicate that the proposed model is feasible and effective in maximizing the benefits of game participants. Copyright © 2020 EAI.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation 4

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-...

引用

4th International Conference on Information Science, Parallel and Distributed Systems, ISPDS 2023

作者： Jiang, Chengjia Wang, Tao Li, Sien Wang, Jinyang Wang, Shirui Antoniou, Antonios Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Fujian Education Institutions Wuyi University The Key Laboratory of Cognitive Computing and Intelligent Information Processing Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China European University Cyprus Department of Computer Science and Engineering Nicosia Cyprus

ISBN: (纸本)9798350337181

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS. © 2023 IEEE.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共14页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：