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

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Ming Chen Peichang Shi Xiang Fu Feng Jiang Fei Gao Penghui Ma Jinzhu Kong National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Kylin Software Co.LTD Changsha China Zhejiang Lab Hangzhou China

In JointCloud Computing, multi-party participation introduces complexity and uncertainty. For all participants in JointCloud Computing, both continuous supervision and necessary privacy protection are required. Traditional supervision methods usually adopt the centralized information interaction mode, which has such defects as collusion of interests, single point of failure, privacy disclosure, etc. Building a decentralized supervision mechanism has become a new research direction. In this paper, we propose PPSS, a privacy-preserving supervision scheme based on blockchain, which decentralizes the supervision of the participants in JointCloud Computing, and combines the “double encryptions” and “threshold encryption” technologies to provide privacy protection. While making full use of the decentralization of the blockchain, a committee is established to carry out the analysis and decision-making tasks in terms of supervision and privacy protection. Experimental results indicate that PPSS can balance performance and security by reasonably configuring the committee.

关键词： Privacy Uncertainty Decision making Buildings Reliability engineering Blockchains Complexity theory

来源：评论

学校读者我要写书评

暂无评论

NUMA-aware FFT-based convolution on ARMv8 many-core CPUs

arXiv

引用

arXiv 2021年

作者： Huang, Xiandong Wang, Qinglin Lu, Shuyu Hao, Ruochen Mei, Songzhu Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China School of Computer Science National University of Defense Technology Changsha410073 China Department of Biomedical Informatics University of Pittsburgh Pittsburgh United States

Convolutional Neural Networks (CNNs), one of the most representative algorithms of deep learning, are widely used in various artificial intelligence applications. Convolution operations often take most of the computational overhead of CNNs. The FFT-based algorithm can improve the efficiency of convolution by reducing its algorithm complexity, there are a lot of works about the high-performance implementation of FFT-based convolution on many-core CPUs. However, there is no optimization for the non-uniform memory access (NUMA) characteristics in manycore CPUs. In this paper, we present a NUMA-aware FFT-based convolution implementation on ARMv8 many-core CPUs with NUMA architectures. The implementation can reduce a number of remote memory access through the data reordering of FFT transformations and the three-level parallelization of the complex matrix multiplication. The experiment results on a ARMv8 many-core CPU with NUMA architectures demonstrate that our NUMA-aware implementation has much better performance than the state-of-the-art work in most cases. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Modeling Full Information with Graph Network for Joint Entity-Relation Extraction

Modeling Full Information with Graph Network for Joint Entit...

引用

2021年第四届算法、计算和人工智能国际会议

作者： Qian Wan Luona Wei Xinhai Chen Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Systems Engineering National University of Defense Technology Laboratory of Software Engineering for Complex Systems National University of Defense Technology

Fully capturing contextual information and analyzing the association between entity semantics and type is helpful for joint extraction task: 1) The context can reflect the part of speech and semantics of entity. 2) The entity type is closely related to the relation between entities. Previous research used to simply embed the contextual information into shallow layer of the model, ignoring the association between entity semantics and type. In this paper, we propose a graph network with full-information modeling to explicitly model different-level information in the text. The contextual information of entity is dynamically embedded in each span representation to improve the reasoning ability. To capture the fine-grained association between the semantics and type of entity, the graph network uses the feature of entity types to generate edge information between different nodes. Experimental results show that our model outperforms previous models on the Co NLL04 dataset and obtains competitive results on the SciERC dataset in both entity recognition and relation extraction. Extensive additional experiments further verify the effectiveness of the model.

关键词： Named Entity Recognition Relation Extraction Natural Language processing Graph Network Deep Learning

来源：评论

学校读者我要写书评

暂无评论

Research on Pin-by-Pin Calculation Method of Rectangular Mesh Based on Quasi-Diffusion Theory

SSRN

引用

SSRN 2024年

作者： Zhuang, Kun Yongzhan, Wang Yan, Jiangtao Zou, Hang Deng, Lina Wang, Yingzhen Wang, Sipeng Zhang, Qian Department of Nuclear Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu Nanjing211106 China China Nuclear Power Operation Technology Corporation LTD. Research Institute of Nuclear Power Operation Hubei Wuhan430223 China Science and Technology on Parallel and Distribution Processing Laboratory National University of Defense Technology Hunan Changsha410073 China Laboratory for Advanced Nuclear Energy Theory and Applications Zhejiang Institute of Modern Physics Department of Physics Zhejiang University Zhejiang Hangzhou310027 China

With the development of nuclear energy techniques, pin-by-pin calculation using the SP3 method based on pin cell homogenization attracts researchers. This study proposed a pin-by-pin calculation method of rectangular mesh based on quasi-diffusion (QD) theory. The QD equation and boundary condition were derived from a transport equation similar to the P1 equation derivation. The Eddington factor was treated as a few-group homogenized parameter and calculated based on a deterministic code ALPHA. The numerical method of QD equation was developed based on nodal expansion method of nonlinear iteration. Some benchmarks were used to verify the Eddington factor and the numerical method of QD. 4 colorset models with different neutron anisotropy levels were analyzed by pin-by-pin-QD method. Pin-by-pin-QD can reduce keff error by about 600 pcm and agree better with reference results. Additionally, it has better accuracy and similar efficiency as diffusion calculation and is suitable for problems with strong anisotropy. © 2024, The Authors. All rights reserved.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

LTKT: Knowledge Tracing Based on Positive and Negative Learning Transfers

SSRN

引用

SSRN 2023年

作者： Xu, Jia Tang, Rongrong Lv, Pin Yu, Minghe Yu, Ge Chen, Enhong School of Computer Electronics and Information Guangxi University GuangXi Nanning530004 China Key Laboratory of Parallel Distributed and Intelligent Computing Education Department of Guangxi Zhuang Autonomous Region Guangxi530004 China Northeastern University Shenyang110819 China University of Science and Technology of China Hefei230088 China

Knowledge Tracing (KT) is a critical but challenging problem for many educational applications. As an essential part of educational psychology, the propagated influence among pedagogical concepts (i.e., learning transfer) is important for optimizing KT tasks. However, existing KT methods only consider the positive learning transfer and neglect the negative learning transfer. To this end, in this paper, we propose a novel deep knowledge tracing model, called positive and negative Learning Transfers based Knowledge Tracing (LTKT). To the best of our knowledge, LTKT makes the first attempt to concurrently utilize the positive and negative learning transfer relations among concepts to improve KT results. First, LTKT employs a statistical-based approach to construct a learning transfer graph (LTG). Then, LTKT quantifies the impact of an exercise's practice result on the knowledge state of the concept via a direct learning effect component, after which a learning transfer effect component is carefully designed to quantify the impact of the practice result on the knowledge states of neighboring concepts based on the positive and negative learning transfer relations modeled by LTG. We conduct extensive experiments on public real-world datasets, and the experimental results show that LTKT outperforms all state-of-the-art KT methods and has good interpretability. © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing Winograd-Based Fast Convolution Algorithm on Phytium Multi-Core CPUs

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2020年第6期57卷 1140-1151页

作者： Wang, Qinglin Li, Dongsheng Mei, Songzhu Lai, Zhiquan Dou, Yong Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha410073 China

Convolutional neural networks (CNNs) have been extensively used in artificial intelligence fields such as computer vision and natural language processing. Winograd-based fast convolution algorithms can effectively reduce the computational complexity of convolution operations in CNNs so that they have attracted great attention. With the application of Phytium multi-core CPUs independently developed by the National University of Defense technology in artificial intelligence fields, there is strong demand of high-performance convolution primitives for Phytium multi-core CPUs. This paper proposes a new high-performance parallel Winograd-based fast convolution algorithm after studying architecture characteristics of Phytium multi-core CPUs and computing characteristics of Winograd-based fast convolution algorithms. The new parallel algorithm does not rely on general matrix multiplication routines, and consists of four stages: kernels transformation, input feature maps transformation, element-wise multiplication, and output feature maps inverse transformation. The data movements in all four stages have been collaboratively optimized to improve memory access performance of the algorithm. The custom data layouts, multi-level parallel data transformation algorithms and multi-level parallel matrix multiplication algorithm have also been proposed to support the optimization above efficiently. The algorithm is tested on two Phytium multi-core CPUs. Compared with Winograd-based fast convolution implementations in ARM Computer Library (ACL) and NNPACK, the algorithm can achieve speedup of 1.05~16.11 times and 1.66~16.90 times, respectively. The application of the algorithm in the open source framework Mxnet improves the forward-propagation performance of the VGG16 network by 3.01~6.79 times. © 2020, science Press. All right reserved.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Quantization improvements for LU Decomposition to Solve Linear Equations *

Quantization improvements for LU Decomposition to Solve Line...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Lin Chen Kang He Hao Jiang Roberto Barrio Jie Liu Tiejun Li Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China College of Computer Science and Technology National University of Defense Technology Changsha China University of Zaragoza Zaragoza Spain

Quantization is an effective method for compressing Deep Neural Networks. Now, it is considered to accelerate the traditional HPC applications. In this article, we present a quantization method (q8gemm) using integer 8-bits(INT8) for matrix multiplication, which is implemented by block techniques to overcome the overflow problem. We choose different scales for one matrix’s each row and those for the other matrix’s each column to keep the numbers in range. With the intel advanced matrix extension cblas_gemm_s8u8s32, our q8gemm can accelerate panel-matrix multiplication in LU factorization. Furthermore, we propose a new mixed-precision solver (q8gesv 1 ) for the linear equations. Using q8gemm in INT8, q8gesv modifies LU factorization in FP32 and then utilizes GMRES iterative refinement in FP64 to bring the solution back to 64 bits accuracy. Numerical tests show that on two Intel CPU platforms with avx2 and avx512, q8gemm achieves a speedup of 1.313-1.621 over cblas_sgemm of MKL. The execution time of cblas_gemm_s8u8s32 makes up 86.78%-90.85% of the q8gemm. By means of q8gemm, our q8gesv can achieve a speedup of 1.176-1.493 over the optimized Higham’s mixed-precision algorithm utilized in the HPL-AI benchmark and a speedup of 1.1-1.459 over the LAPACKE_dsgesv function from MKL LAPACK. Meanwhile, q8gesv runs up to 2.859X faster on Intel(R) Core(TM) i5-10600KF and to 2.224X faster on Intel(R) Xeon(R) Gold 6130 than the LAPACKE_dgesv function from MKL LAPACK.

关键词： Deep learning Gold Quantization (signal) Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2024 Challenge on Short-form UGC Video Quality Assessment: Methods and Results

arXiv

引用

arXiv 2024年

作者： Li, Xin Yuan, Kun Pei, Yajing Lu, Yiting Sun, Ming Zhou, Chao Chen, Zhibo Timofte, Radu Sun, Wei Wu, Haoning Zhang, Zicheng Jia, Jun Zhang, Zhichao Cao, Linhan Chen, Qiubo Min, Xiongkuo Lin, Weisi Zhai, Guangtao Sun, JianHui Wang, Tianyi Li, Lei Kong, Han Wang, Wenxuan Li, Bing Luo, Cheng Wang, Haiqiang Chen, Xiangguang Meng, Wenhui Pan, Xiang Shi, Huiying Zhu, Han Xu, Xiaozhong Sun, Lei Chen, Zhenzhong Liu, Shan Kong, Fangyuan Fan, Haotian Xu, Yifang Xu, Haoran Yang, Mengduo Zhou, Jie Li, Jiaze Wen, Shijie Xu, Mai Li, Da Yao, Shunyu Du, Jiazhi Zuo, Wangmeng Li, Zhibo He, Shuai Ming, Anlong Fu, Huiyuan Ma, Huadong Wu, Yong Xue, Fie Zhao, Guozhi Du, Lina Guo, Jie Zhang, Yu Zheng, Huimin Chen, Junhao Liu, Yue Zhou, Dulan Xu, Kele Xu, Qisheng Sun, Tao Ding, Zhixiang Hu, Yuhang University of Science and Technology of China China Kuaishou Technology China University of Würzburg Germany Shanghai Jiao Tong University China Nanyang Technological University Singapore Xiaohongshu China WeChat China Tencent China Wuhan University China ByteDance Shenzhen China Zhejiang University China Department of Electronic and Information Engineering Beihang University Beijing China Southern University of Science and Technology China Harbin Institute of Technology China Beijing University of Posts and Telecommunications China China Merchants Bank China Shandong Jianzhu University China Key Laboratory for Parallel and Distributed Processing Changsha China Institute of Automation CAS China University of Chinese Academy of Sciences China

This paper reviews the NTIRE 2024 Challenge on Short-form UGC Video Quality Assessment (S-UGC VQA), where various excellent solutions are submitted and evaluated on the collected dataset KVQ from popular short-form video platform, i.e., Kuaishou/Kwai Platform. The KVQ database is divided into three parts, including 2926 videos for training, 420 videos for validation, and 854 videos for testing. The purpose is to build new benchmarks and advance the development of S-UGC VQA. The competition had 200 participants and 13 teams submitted valid solutions for the final testing phase. The proposed solutions achieved state-of-the-art performances for S-UGC VQA. The project can be found at https://***/lixinustc/KVQ-Challenge-CVPR-NTIRE2024. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Vision-Language Navigation: A Survey and Taxonomy

arXiv

引用

arXiv 2021年

作者： Wu, Wansen Chang, Tao Li, Xinmeng Yin, Quanjun Zhu, Jiancheng The College of Systems Engineering National University of Defense Technology Hunan Changsha410073 China National Key Laboratory of Parallel and Distributed Processing College of Computer Science and Technology National University of Defence Technology Changsha410073 China

Vision-Language Navigation (VLN) tasks require an agent to follow human language instructions to navigate in previously unseen environments. This challenging field involving problems in natural language processing, computer vision, robotics, etc., has spawn many excellent works focusing on various VLN tasks. This paper provides a comprehensive survey and an insightful taxonomy of these tasks based on the different characteristics of language instructions in these tasks. Depending on whether the navigation instructions are given for once or multiple times, this paper divides the tasks into two categories, i.e., single-turn and multi-turn tasks. For single-turn tasks, we further subdivide them into goal-oriented and route-oriented based on whether the instructions designate a single goal location or specify a sequence of multiple locations. For multi-turn tasks, we subdivide them into passive and interactive tasks based on whether the agent is allowed to question the instruction or not. These tasks require different capabilities of the agent and entail various model designs. We identify progress made on the tasks and look into the limitations of existing VLN models and task settings. Finally, we discuss several open issues of VLN and point out some opportunities in the future, i.e., incorporating knowledge with VLN models and implementing them in the real physical world. © 2021, CC BY.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：