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

China in the eyes of news media:a case study under COVID-19 epidemic

Frontiers of Information technology & Electronic Engineering 2021年第11期22卷 1443-1457页

作者： Hong HUANG Zhexue CHEN Xuanhua SHI Chenxu WANG Zepeng HE Hai JIN Mingxin ZHANG Zongya LI National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan430074China Services Computing Technology and System Lab Huazhong University of Science and TechnologyWuhan430074China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Journalism and Information Communication Huazhong University of Science and TechnologyWuhan430074China

As one of the early COVID-19 epidemic outbreak areas,China attracted the global news media’s attention at the beginning of *** the epidemic period,Chinese people united and actively fought against the ***,in the eyes of the international public,the situation reported about China is not *** better understand how the international public portrays China,especially during the epidemic,we present a case study with big data *** aim to answer three questions:(1)What has the international media focused on during the COVID-19 epidemic period?(2)What is the media’s tone when they report China?(3)What is the media’s attitude when talking about China?In detail,we crawled more than 280000 pieces of news from 57 mainstream media agencies in 22 countries and made some interesting *** example,international media paid more attention to Chinese livelihood during the COVID-19 epidemic *** March and April,“progress of Chinese vaccines,”“specific drugs and treatments,”and“virus outbreak in U.S.”became the media’s most common *** terms of news attitude,Cuba,Malaysia,and Venezuela had a positive attitude toward China,while France,Canada,and the United Kingdom had a negative *** study can help understand China’s image in the eyes of the international media and provide a sound basis for image analysis.

关键词： Country image COVID-19 epidemic Topic mining Entity Tone of news Emotion

来源：评论

学校读者我要写书评

暂无评论

Shielding Federated Learning: Robust Aggregation with Adaptive Client Selection

arXiv

引用

arXiv 2022年

作者： Wan, Wei Hu, Shengshan Lu, Jianrong Yu Zhang, Leo Jin, Hai He, Yuanyuan School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab School of Information Technology Deakin University Australia

Federated learning (FL) enables multiple clients to collaboratively train an accurate global model while protecting clients’ data privacy. However, FL is susceptible to Byzantine attacks from malicious participants. Although the problem has gained significant attention, existing defenses have several flaws: the server irrationally chooses malicious clients for aggregation even after they have been detected in previous rounds;the defenses perform ineffectively against sybil attacks or in the heterogeneous data setting. To overcome these issues, we propose MAB-RFL, a new method for robust aggregation in FL. By modelling the client selection as an extended multi-armed bandit (MAB) problem, we propose an adaptive client selection strategy to choose honest clients that are more likely to contribute high-quality updates. We then propose two approaches to identify malicious updates from sybil and non-sybil attacks, based on which rewards for each client selection decision can be accurately evaluated to discourage malicious behaviors. MAB-RFL achieves a satisfying balance between exploration and exploitation on the potential benign clients. Extensive experimental results show that MAB-RFL outperforms existing defenses in three attack scenarios under different percentages of attackers. Copyright © 2022, The Authors. All rights reserved.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Optimal margin distribution machine for multi-instance learning 29

Optimal margin distribution machine for multi-instance learn...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Zhang, Teng Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9780999241165

Multi-instance learning (MIL) is a celebrated learning framework where each example is represented as a bag of instances. An example is negative if it has no positive instances, and vice versa if at least one positive instance is contained. During the past decades, various MIL algorithms have been proposed, among which the large margin based methods is a very popular class. Recently, the studies on margin theory disclose that the margin distribution is of more importance to generalization ability than the minimal margin. Inspired by this observation, we propose the multi-instance optimal margin distribution machine, which can identify the key instances via explicitly optimizing the margin distribution. We also extend a stochastic accelerated mirror prox method to solve the formulated minimax problem. Extensive experiments show the superiority of the proposed method. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic cluster strategy for hierarchical rollback-recovery protocols in MPI HPC applications

Dynamic cluster strategy for hierarchical rollback-recovery ...

引用

作者： Liao, Xiaofei Zheng, Long Zhang, Binsheng Zhang, Yu Jin, Hai Shi, Xuanhua Lin, Yi Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China College of Computer Science and Technology Civil Aviation University of China Tianjin300300 China

Fault tolerance in parallel computing becomes increasingly important with a significant rise in high-performance computing systems. Coordinated checkpointing and message logging protocols are commonly used fault tolerance mechanisms for message-passing applications. However, these mechanisms are insufficient because of their severe drawbacks. Hierarchical rollback-recovery protocols, combining coordinated checkpointing with message logging, are a better solution. However, such protocols may not obtain the appropriate efficiency because the communication pattern in different stages of applications may vary at runtime. In an effort to improve the efficiency of hierarchical rollback-recovery protocols, we propose a dynamic cluster strategy to adapt to the runtime variation of communication pattern by using a prediction scheme. Finally, the efficiency and scalability of the dynamic cluster strategy are evaluated using 2 static process partition algorithms on the High-Performance Linpack benchmark. © 2017 John Wiley & Sons, Ltd.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Vflh: A Following-the-Leader-History Based Algorithm for Adaptive Online Convex Optimization with Stochastic Constraints

SSRN

引用

SSRN 2022年

作者： Yang, Yifan Chen, Lin Zhou, Pan Ding, Xiaofeng Department of Computer Science University of California Santa BarbaraCA93106 United States National Engineering Research Center for Big Data Technology and System Lab Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430072 China

This paper considers online convex optimization (OCO) with generated i.i.d. stochastic constraints, where the distribution of environment is changing and the performance is measured by \textit{adaptive regret}. The stochastic constraints are disclosed at each round to the learner after the decision is made. Different from the previous non-adaptive constrained OCO algorithm which is generalized based on the traditional online gradient descent algorithm, we propose a novel \textit{Virtual queue based Following-the-Leader-History} (VFLH) strategy to make the constrained OCO algorithm adaptive and design the VFLH algorithm. In this setting, the algorithm firstly generalizes all the experts in the specified time interval, then decides the optimal decision with each expert and gives out the final choice by combining the predictions of active experts. In terms of the algorithm performance, there are two performance metrics to be evaluated, i.e., the bounds of constraint violation and regret. For the constraint violation, we bring in the multi-objective drift analysis approach to deal with the constraints via a virtual queue which provides a new method to bound the constraints violations. For the regret, we give out its upper bound and then achieve a corresponding lower bound that proves the upper bound is sufficiently tight. Finally, we provide some numerical experiments to validate the feasibility of our algorithm. © 2022, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Shared Incentive System for Clinical Pathway Experience

Shared Incentive System for Clinical Pathway Experience

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Weiqi Dai Wenhao Zhao Xia Xie Song Wu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

The phenomenon of unbalanced regional medical resources has led to large differences in the implementation experience of clinical pathways in hospitals with different medical levels. However, due to the fear of privacy leakage and the lack of sharing motivation, there is a lack of effective collaborative communication channels for clinical pathways among medical institutions. In response to these problems, we propose a blockchain-based sharing incentive scheme for clinical pathway experience, which uses the clinical pathway implementation effect evaluation system to evaluate the quality of clinical pathway experience data. Specifically, we designe a two-phase cross-domain shared transaction model for the transaction of clinical pathway experience data. Moreover, we introduce the shared transaction alliance committee to verify and review the transaction, and solve the problems in the transaction in the arbitration phase. Finally, the functional test results show that the system meets the experience sharing incentive requirements, and the performance test results show that the TPS of sharing clinical pathway experience read and writed can reach around 600 and 1000, and the transaction latency of each phase is within 3 s.

关键词： Privacy Hospitals Collaboration Communication channels Data models Security Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

Diabetes Mellitus Type 2 Data Sharing System Based on Blockchain and Attribute-Encryption

Diabetes Mellitus Type 2 Data Sharing System Based on Blockc...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Weiqi Dai Zhenhui Lu Xia Xie Duoqiang Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

Medical data sharing can improve the quality of medical care and promote progress in the field of public health. However, medical data has high confidentiality and complexity. Taking the clinical diagnosis and treatment data of Diabetes Mellitus Type 2 (T2DM) in medical treatment as an example, T2DM data often has the phenomenon of "multi-disease coexistence" and is insecure and inaccurate in the process of sharing. Based on Blockchain and Attribute- Encryption (ABE), we propose a T2DM data sharing system to solve the above problems. An Attribute-Encryption algorithm T2DM-CP-ABE is proposed to solve the problem of excessive sharing granularity. T2DM-CP-ABE, combined with the medical data contribution module, takes the contribution factor as an important consideration, to stimulate the power of T2DM data sharing and promote the development of national diabetes prevention. Based on the Blockchain, a medical data attribute authorization model is proposed, which provides a credible solution for multiple hospitals to realize medical data attribute authorization, and realizes the clinical diagnosis and treatment data sharing of T2DM among doctors. Based on Blockchain and ABE technology, a data sharing system for T2DM has been implemented on the Fabric platform. The result shows that the average time for the system to complete a single sharing is less than 1 second.

关键词： Authorization Hospitals Fabrics Blockchains Diabetes Encryption Security

来源：评论

学校读者我要写书评

暂无评论

ReSQM: Accelerating Database Operations Using ReRAM-Based Content Addressable Memory

ReSQM: Accelerating Database Operations Using ReRAM-Based Co...

引用

作者： Li, Huize Jin, Hai Zheng, Long Liao, Xiaofei National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

The huge amount of data enforces great pressure on the processing efficiency of database systems. By leveraging the in-situ computing ability of emerging nonvolatile memory, processing-in-memory (PIM) technology shows great potential in accelerating database operations against traditional architectures without data movement overheads. In this article, we introduce ReSQM, a novel ReCAM-based accelerator, which can dramatically reduce the response time of database systems. The key novelty of ReSQM is that some commonly used database queries that would be otherwise processed inefficiently in previous studies can be in-situ accomplished with massively high parallelism by exploiting the PIM-enabled ReCAM array. ReSQM supports some typical database queries (such as SELECTION, SORT, and JOIN) effectively based on the limited computational mode of the ReCAM array. ReSQM is also equipped with a series of hardware-algorithm co-designs to maximize efficiency. We present a new data mapping mechanism that allows enjoying in-situ in-memory computations for SELECTION operating upon intermediate results. We also develop a count-based ReCAM-specific algorithm to enable the in-memory sorting without any row swapping. The relational comparisons are integrated for accelerating inequality join by making a few modifications to the ReCAM cells with negligible hardware overhead. The experimental results show that ReSQM can improve the (energy) efficiency by $611\times $ ( $193\times $ ), $19\times $ ( $17\times $ ), $59\times $ ( $43\times $ ), and $307\times $ ( $181\times $ ) in comparison to a 10-core Intel Xeon E5-2630v4 processor for SELECTION, SORT, equi-join, and inequality join, respectively. In contrast to state-of-the-art CMOS-based CAM, GPU, FPGA, NDP, and PIM solutions, ReSQM can also offer $2.2\times 39\times $ speedups. © 1982-2012 IEEE.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Fine-grained Scheduling in FPGA-Based Convolutional Neural Networks 5

Fine-grained Scheduling in FPGA-Based Convolutional Neural N...

引用

5th IEEE International Conference on Cloud computing and Big Data Analytics, ICCCBDA 2020

作者： Zhang, Wei Liao, Xiaofei Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China

ISBN: (纸本)9781728160245

FPGA has been considered as a promising solution to accelerate Convolutional Neural Networks (CNNs) for its excellent performance in energy efficiency and programmability. However, prior designs are usually designed for inference only as designers can map pre-trained models to the hardware in a very efficient way. However, those approaches may not be suitable for training CNN models. In this paper, we propose FConv, in which the CPU and FPGA work together in a fine-grained manner. The FPGA accelerator in FConv uses one Winograd-based convolver, which reduces the design complexity and improves performance. We apply double-buffer for output routine to effectively overlap computation and data transfer. We also integrate multiple PEs to improve data parallelism. We propose our analytical model for prediction and use it as a guide in task scheduling. We find the upper limit of performance under the current design based on the analytical model. We evaluate our design on VGG-16 and Densnet-40 on ImageNet and CIFAR-10. We achieve 262.43 GOP/s on the VGG-16 model, which is 2.13 times of the performance compared to FFT-based implementation on the same platform. We also achieve at most 4 times+ performance improvement compared MKL with 20 threads running on 10 core Intel processors. © 2020 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An Efficient Data Prefetch Strategy for Deep Learning Based on Non-volatile Memory 15th

An Efficient Data Prefetch Strategy for Deep Learning Based ...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Jiang, Wenbin Liu, Pai Jin, Hai Peng, Jing National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783030642426

Deep learning (DL) systems usually utilize asynchronous prefetch to improve data reading performance. However, the efficiency of the data transfer path from hard disk to DRAM is still limited by disk performance. The emerging non-volatile memory (NVRAM) provides a novel solution for this problem, while few existing researches have considered it. We propose a novel efficient data prefetch strategy for DL based on a heterogeneous memory system combining NVRAM with DRAM. Benefitting from the large capacity and fast reading speed of NVRAM, the strategy uses an asynchronous reading method named sliding NVRAM cache (SNC) to improve the performance of the data transfer paths. A sliding window is applied to map the data from disk to NVRAM and continuously update the data, while non-ideal writing performance of NVRAM can be remitted to a large extent in this strategy. Experiments show that SNC can improve the time performance of diverse deep neural networks training by more than 30%. © 2020, Springer Nature Switzerland AG.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：