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

Evaluating RISC-V Vector Instruction Set Architecture Extension with computer Vision Workloads

Journal of computer science & technology 2023年第4期38卷 807-820页

作者：李若时彭平邵志远金海郑然 National Engineering Research Center for Big Data Technology and System Huazhong University of Science and Technology Wuhan 430074China Services Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074 China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

computer vision(CV)algorithms have been extensively used for a myriad of applications *** the multimedia data are generally well-formatted and regular,it is beneficial to leverage the massive parallel processing power of the underlying platform to improve the performances of CV *** Instruction Multiple Data(SIMD)instructions,capable of conducting the same operation on multiple data items in a single instruction,are extensively employed to improve the efficiency of CV *** this paper,we evaluate the power and effectiveness of RISC-V vector extension(RV-V)on typical CV algorithms,such as Gray Scale,Mean Filter,and Edge *** our examinations,we show that compared with the baseline OpenCV implementation using scalar instructions,the equivalent implementations using the RV-V(version 0.8)can reduce the instruction count of the same CV algorithm up to 24x,when processing the same input ***,the actual performances improvement measured by the cycle counts is highly related with the specific implementation of the underlying RV-V *** our evaluation,by using the vector co-processor(with eight execution lanes)of Xuantie C906,vector-version CV algorithms averagely exhibit up to 2.98x performances speedups compared with their scalar counterparts.

关键词： RISC-V vector extension single instruction multiple data(SIMD) computer vision OpenCV

来源：评论

学校读者我要写书评

暂无评论

A Distributed Self-Tallying Electronic Voting system Using the Smart Contract

引用

Chinese Journal of Electronics 2024年第4期33卷 1063-1076页

作者： Jingyu YAO Bo YANG Tao WANG Wenzheng ZHANG School of Computer Science Shaanxi Normal University State Key Laboratory of Integrated Services Networks Xidian University Science and Technology on Communication Security Laboratory

For electronic voting(e-voting) with a trusted authority, the ballots may be discarded or tampered, so it is attractive to eliminate the dependence on the trusted party. An e-voting protocol, where the final voting result can be calculated by any entity, is known as self-tallying e-voting protocol. To the best of our knowledge, addressing both abortive issue and adaptive issue simultaneously is still an open problem in self-tallying e-voting *** Ethereum blockchain with cryptographic technologies, we present a decentralized self-tallying e-voting protocol. We solve the above problem efficiently by utilizing optimized Group Encryption Scheme and standard Exponential El Gamal Cryptosystem. We use zero-knowledge proof and homomorphic encryption to protect votes' secrecy and achieve self-tallying. All ballots can be verified by anyone and the final voting result can be calculated by any entity. In addition, using the paradigm of score voting and “1-out-of-k” proof, our e-voting system is suitable for a wide range of application scenarios. Experiments show that our protocol is more competitive and more suitable for large-scale voting.

关键词： Electronic voting systems Smart contracts Blockchains Cryptocurrency Electronic voting Homomorphic encryption Standards

来源：评论

学校读者我要写书评

暂无评论

Method and Practice of Trusted Embedded computing and Data Transmission Protection Architecture Based on Android

引用

Chinese Journal of Electronics 2024年第3期33卷 623-634页

作者： Yichuan WANG Wen GAO Xinhong HEI Yanning DU School of Computer Science and Engineering Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology

In recent years,the rapid development of Internet technology has constantly enriched people's daily life and gradually changed from the traditional computer terminal to the mobile *** with it comes the security problems brought by the mobile *** for Android system,due to its open source nature,malicious applications continue to emerge,which greatly threatens the data security of ***,this paper proposes a method of trusted embedded static measurement and data transmission protection architecture based on Android to reduce the risk of data leakage in the process of terminal storage and *** conducted detailed data and feasibility analysis of the proposed method from the aspects of time consumption,storage overhead and *** experimental results show that this method can detect Android system layer attacks such as self-booting of the malicious module and improve the security of data encryption and transmission process *** with the native system,the additional performance overhead is small.

关键词： Embedded computing Protocols Data security computer architecture Encryption Internet Data communication

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed algorithms for holistic aggregation functions on random regular graphs

引用

science China(Information sciences) 2022年第5期65卷 32-50页

作者： Lin JIA Qiang-Sheng HUA Haoqiang FAN Qiuping WANG Hai JIN 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 TechnologyHuazhong University of Science and Technology Institute for Interdisciplinary Information Science Tsinghua University

In this paper, we propose efficient distributed algorithms for three holistic aggregation functions on random regular graphs that are good candidates for network topology in next-generation data *** three holistic aggregation functions include SELECTION（select the k-th largest or smallest element）,DISTINCT（query the count of distinct elements）, MODE（query the most frequent element）. We design three basic techniques — Pre-order Network Partition, Pairwise-independent Random Walk, and Random Permutation Delivery, and devise the algorithms based on the techniques. The round complexity of the distributed SELECTION is Θ（log N） which meets the lower bound where N is the number of nodes and each node holds a numeric element. The round complexity of the distributed DISTINCT and MODE algorithms are O（log3N/log log N） and O（log2N log log N） respectively. All of our results break the lower bounds obtained on general graphs and our distributed algorithms are all based on the CON GE S T model, which restricts each node to send only O（log N） bits on each edge in one round under synchronous communications.

关键词： distributed algorithms holistic aggregation function random regular graph $\mathcal{CONGEST}$ model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

SAND: semi-automated adaptive network defense via programmable rule generation and deployment

引用

science China(Information sciences) 2022年第7期65卷 121-138页

作者： Haoyu CHEN Deqing ZOU Hai JIN Shouhuai XU Bin YUAN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and Technology Department of Computer Science University of Colorado at Colorado Springs

Cyber security is dynamic as defenders often need to adapt their defense postures. The state-ofthe-art is that the adaptation of network defense is done manually(i.e., tedious and error-prone). The ideal solution is to automate adaptive network defense, which is however a difficult problem. As a first step towards automation, we propose investigating how to attain semi-automated adaptive network defense(SAND). We propose an approach extending the architecture of software-defined networking, which is centered on providing defenders with the capability to program the generation and deployment of dynamic defense rules enforced by network defense tools. We present the design and implementation of SAND, as well as the evaluation of the prototype implementation. Experimental results show that SAND can achieve agile and effective dynamic adaptations of defense rules(less than 15 ms on average for each operation), while only incurring a small performance overhead.

关键词： network defense Network defense adaptive defense automated defense programmable defense security services software-defined networking security management

来源：评论

学校读者我要写书评

暂无评论

Image Enhancement via Associated Perturbation Removal and Texture Reconstruction Learning

引用

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2253-2269页

作者： Kui Jiang Ruoxi Wang Yi Xiao Junjun Jiang Xin Xu Tao Lu IEEE the School of Computer Science and Technology Harbin Institute of Technology Zhengzhou Research Institute Harbin Institute of Technology the School of Artificial Intelligence Jianghan University the School of Geodesy and Geomatics Wuhan University the Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan University of Science and Technology the School of Computer Science and Engineering and also with the Hubei Province Key Laboratory of Intelligent Robot Wuhan Institute of Technology

Degradation under challenging conditions such as rain, haze, and low light not only diminishes content visibility, but also results in additional degradation side effects, including detail occlusion and color distortion. However, current technologies have barely explored the correlation between perturbation removal and background restoration, consequently struggling to generate high-naturalness content in challenging scenarios. In this paper, we rethink the image enhancement task from the perspective of joint optimization: Perturbation removal and texture reconstruction. To this end, we advise an efficient yet effective image enhancement model, termed the perturbation-guided texture reconstruction network(PerTeRNet). It contains two subnetworks designed for the perturbation elimination and texture reconstruction tasks, respectively. To facilitate texture recovery,we develop a novel perturbation-guided texture enhancement module(PerTEM) to connect these two tasks, where informative background features are extracted from the input with the guidance of predicted perturbation priors. To alleviate the learning burden and computational cost, we suggest performing perturbation removal in a sub-space and exploiting super-resolution to infer high-frequency background details. Our PerTeRNet has demonstrated significant superiority over typical methods in both quantitative and qualitative measures, as evidenced by extensive experimental results on popular image enhancement and joint detection tasks. The source code is available at https://***/kuijiang94/PerTeRNet.

关键词： Association learning attention mechanism image enhancement perturbation modeling

来源：评论

学校读者我要写书评

暂无评论

AccelES: Accelerating Top-K SpMV for Embedding Similarity via Low-bit Pruning 31

AccelES: Accelerating Top-K SpMV for Embedding Similarity vi...

引用

31st IEEE International Symposium on High Performance computer Architecture, HPCA 2025

作者： Zhai, Jiaqi Shi, Xuanhua Huang, Kaiyi Ye, Chencheng Hu, Weifang He, Bingsheng 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 Wuhan430074 China National University of Singapore School of Computing 119077 Singapore

ISBN: (纸本)9798331506476

In the realm of recommendation systems, achieving real-time performance in embedding similarity tasks is often hindered by the limitations of traditional Top-K sparse matrix-vector multiplication (SpMV) methods, which suffer from high latency due to inefficient memory access patterns. This paper identifies these critical gaps and introduces AccelES, a novel approach that significantly enhances the efficiency of Top-K SpMV. Our method employs a two-stage calculation scheme: the first stage utilizes a compact, low-bit dataset to quickly identify the most relevant entries, while the second stage performs full-precision calculations solely on this pruned subset, thereby minimizing computational overhead. Furthermore, AccelES incorporates innovative matrix representations, Ultra-CSR and Random-CSR, which optimize memory bandwidth utilization. Experimental results demonstrate that AccelES accelerates performance, surpassing state-of-the-art FPGA, GPU, and CPU solutions by factors of 3.4×, 2.5×, and 153.3×, respectively, under controlled conditions. These advancements not only enhance processing speed but also significantly improve real-time performance in recommendation systems, establishing AccelES as a pivotal contribution to the field of Top-K sparse matrix-vector multiplication. © 2025 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A Review of Intelligent Configuration and Its Security for Complex Networks

引用

Chinese Journal of Electronics 2024年第4期33卷 920-947页

作者： Yue ZHAO Bin YANG Fei TENG Xianhua NIU Ning HU Bo TIAN Science and Technology on Communication Security Laboratory School of Computer and Information Engineering Chuzhou University School of Computing and Artificial Intelligence Southwest Jiaotong University School of Computer and Software Engineering Xihua University Cyberspace Institute of Advanced Technology Guangzhou University

Complex networks are becoming more complex because of the use of many components with diverse technologies. In fact, manual configuration that makes each component interoperable has breed latent danger to system security. There is still no comprehensive review of these studies and prospects for further research. According to the complexity of component configuration and difficulty of security assurance in typical complex networks, this paper systematically reviews the abstract models and formal analysis methods required for intelligent configuration of complex networks, specifically analyzes, and compares the current key technologies such as configuration semantic awareness, automatic generation of security configuration, dynamic deployment, and verification evaluation. These technologies can effectively improve the security of complex networks intelligent configuration and reduce the complexity of operation and maintenance. This paper also summarizes the mainstream construction methods of complex networks configuration and its security test environment and detection index system, which lays a theoretical foundation for the formation of the comprehensive effectiveness verification capability of configuration security. The whole lifecycle management system of configuration security process proposed in this paper provides an important technical reference for reducing the complexity of network operation and maintenance and improving network security.

关键词： Complex networks Intelligent configuration Configuration security Software defined network Lifecycle management

来源：评论

学校读者我要写书评

暂无评论

Enhancement Methods for Chiral Optical Signals by Tailoring Optical Fields and Nanostructures

引用

Engineering 2025年第2期45卷 25-43页

作者： Hanqing Cai Liangliang Gu Haifeng Hu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Zhangjiang Laboratory Shanghai 201204China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

The unique property of chirality is widely used in various *** the past few decades,a great deal of research has been conducted on the interactions between light and matter,resulting in significant technical advancements in the precise manipulation of light field *** this review,which focuses on current chiral optics research,we introduce the fundamental theory of chirality and highlight the latest achievements in enhancing chiral signals through artificial nano-manufacturing technology,with a particular focus on mechanisms such as light scattering and Mie resonance used to amplify chiral *** providing an overview of enhanced chiral signals,this review aims to provide researchers with an indepth understanding of chiral phenomena and its versatile applications in various domains.

关键词： Mie scattering Optical chirality Circular dichroism Orbital angular momentum Bound states in the continuum Nonlinear optics

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Recovery for Transactional Stream Processing on Multicores 40

Fast Parallel Recovery for Transactional Stream Processing o...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Zhao, Jianjun Liu, Haikun Zhang, Shuhao Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Yu School of Computer Science and Technology 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 Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350317152

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches. © 2024 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：