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

arXiv 2022年

作者： Zhao, Bowen Chen, Wei-Neng Wei, Feng-Feng Liu, Ximeng Pei, Qingqi Zhang, Jun Guangzhou Institute of Technology Xidian University Guangzhou China The School of Computer Science and Engineering South China University of Technology Guangzhou China The College of Computer and Data Science Fuzhou University Fujian China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen China The Department of Electrical and Electronic Engineering Hanyang University Ansan15588 Korea Republic of

Evolutionary algorithms (EAs), such as the genetic algorithm (GA), offer an elegant way to handle combinatorial optimization problems (COPs). However, limited by expertise and resources, most users do not have enough capability to implement EAs to solve COPs. An intuitive and promising solution is to outsource evolutionary operations to a cloud server, whilst it suffers from privacy concerns. To this end, this paper proposes a novel computing paradigm, evolution as a service (EaaS), where a cloud server renders evolutionary computation services for users without sacrificing users' privacy. Inspired by the idea of EaaS, this paper designs PEGA, a novel privacy-preserving GA for COPs. Specifically, PEGA enables users outsourcing COPs to the cloud server holding a competitive GA and approximating the optimal solution in a privacy-preserving manner. PEGA features the following characteristics. First, any user without expertise and enough resources can solve her COPs. Second, PEGA does not leak contents of optimization problems, i.e., users' privacy. Third, PEGA has the same capability as the conventional GA to approximate the optimal solution. We implements PEGA falling in a twin-server architecture and evaluates it in the traveling salesman problem (TSP, a widely known COP). Particularly, we utilize encryption cryptography to protect users' privacy and carefully design a suit of secure computing protocols to support evolutionary operators of GA on encrypted data. Privacy analysis demonstrates that PEGA does not disclose the contents of the COP to the cloud server. Experimental evaluation results on four TSP datasets show that PEGA is as effective as the conventional GA in approximating the optimal solution. Copyright © 2022, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Survey on Graph Processing Accelerators:Challenges and Opportunities

引用

Journal of Computer science & technology 2019年第2期34卷 339-371页

作者： Chuang-Yi Gui Long Zheng Bingsheng He Cheng Liu Xin-Yu Chen Xiao-Fei Liao Hai Jin National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China School of Computing National University of Singapore Singapore 117418 Singapore Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Graph is a well known data structure to represent the associated relationships in a variety of applications,e.g.,data science and machine *** a wealth of existing efforts on developing graph processing systems for improving the performance and/or energy efficiency on traditional architectures,dedicated hardware solutions,also referred to as graph processing accelerators,are essential and emerging to provide the benefits significantly beyond what those pure software solutions can *** this paper,we conduct a systematical survey regarding the design and implementation of graph processing ***,we review the relevant techniques in three core components toward a graph processing accelerator:preprocessing,parallel graph computation,and runtime *** also examine the benchmarks and results in existing studies for evaluating a graph processing ***,we find that there is not an absolute winner for all three aspects in graph acceleration due to the diverse characteristics of graph processing and the complexity of hardware *** finally present and discuss several challenges in details,and further explore the opportunities for the future research.

关键词： graph processing accelerator domain-specific architecture performance energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Robust capturing chromosome conformation using the DLO Hi-C 2.0 method

引用

Journal of Genetics and Genomics 2020年第10期47卷 655-658页

作者： Zhihui Zhang Chengchao Wu Khaista Rahman Weize Xu Guoliang Li Da Lin Gang Cao State Key Laboratory of Agricultural Microbiology Huazhong Agricultural UniversityWuhan430070China College of Veterinary Medicine Huazhong Agricultural UniversityWuhan430070China National Key Laboratory of Crop Genetic Improvement Huazhong Agricultural UniversityWuhan430070China Agricultural Bioinformatics Key Laboratory of Hubei Province Hubei Engineering Technology Research Center of Agricultural Big Data3D Genomics Research CenterHuazhong Agricultural UniversityWuhan430070China College of Informatics Huazhong Agricultural UniversityWuhan430070China College of Bio-Medicine and Health Huazhong Agricultural UniversityWuhan430070China

The human genome contains around 20,000 protein-coding genes and a vast of transcriptional regulatory elements(ENCODE Project Consortium,2012;Roadmap Epigenomics Consortium et al.,2015;Stunnenberg and Hirst,2016).It still remains elusive how these regulatory elements regulate their target genes across genomic distances of millions of bases.

关键词： transcriptional ). bases

来源：评论

学校读者我要写书评

暂无评论

SynFacePAD 2023: Competition on Face Presentation Attack Detection Based on Privacy-aware Synthetic Training data

SynFacePAD 2023: Competition on Face Presentation Attack Det...

引用

IEEE International Joint Conference on Biometrics (IJCB)

作者： Meiling Fang Marco Huber Julian Fierrez Raghavendra Ramachandra Naser Damer Alhasan Alkhaddour Maksim Kasantcev Vasiliy Pryadchenko Ziyuan Yang Huijie Huangfu Yingyu Chen Yi Zhang Yuchen Pan Junjun Jiang Xianming Liu Xianyun Sun Caiyong Wang Xingyu Liu Zhaohua Chang Guangzhe Zhao Juan Tapia Lazaro Gonzalez-Soler Carlos Aravena Daniel Schulz Fraunhofer Institute for Computer Graphics Research IGD Darmstadt Germany Department of Computer Science TU Darmstadt Darmstadt Germany Biometrics and Data Pattern Analytics Lab Universidad Autonoma de Madrid Spain Norwegian University of Science and Technology (NTNU) Norway ID R&D Inc New York US School of Cyber Science and Engineering Sichuan University Chengdu China School of Computer Science and Technology Harbin Institute of Technology Harbin China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture China Biometrics and Security Research Group Hochschule Darmstadt Darmstadt Germany I+D Vision Center Santiago Chile

This paper presents a summary of the Competition on Face Presentation Attack Detection Based on Privacy-aware Synthetic Training data (SynFacePAD 2023) held at the 2023 International Joint Conference on Biometrics (IJCB 2023). The competition attracted a total of 8 participating teams with valid submissions from academia and industry. The competition aimed to motivate and attract solutions that target detecting face presentation attacks while considering synthetic-based training data motivated by privacy, legal and ethical concerns associated with personal data. To achieve that, the training data used by the participants was limited to synthetic data provided by the organizers. The submitted solutions presented innovations and novel approaches that led to outperforming the considered baseline in the investigated benchmarks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Real-time chaotic video encryption based on multithreaded parallel confusion and diffusion

arXiv

引用

arXiv 2023年

作者： Jiang, Dong Yuan, Zhen Li, Wen-Xin Lu, Liang-Liang School of Internet Anhui University Hefei230039 China National Engineering Research Center of Agro-Ecological Big Data Analysis and Application Anhui University Hefei230601 China Key Laboratory of Optoelectronic Technology of Jiangsu Province Nanjing Normal University Nanjing210023 China School of Physical Science and Technology Nanjing Normal University Nanjing210023 China National Laboratory of Solid State Microstructures Nanjing University Nanjing210093 China

MSC Codes 68P25 (Primary) 68W10 (Secondary)Due to the strong correlation between adjacent pixels, most image encryption schemes perform multiple rounds of confusion and diffusion to protect the image against attacks. Such operations, however, are time-consuming, cannot meet the real-time requirements of video encryption. Existing works, therefore, realize video encryption by simplifying the encryption process or encrypting specific parts of video frames, which results in lower security compared to image encryption. To solve the problem, this paper proposes a real-time chaotic video encryption strategy based on multithreaded parallel confusion and diffusion. It takes a video as the input, splits the frame into subframes, creates a set of threads to simultaneously perform five rounds of confusion and diffusion operations on corresponding subframes, and efficiently outputs the encrypted frames. The encryption speed evaluation shows that our method significantly improves the confusion and diffusion speed, realizes real-time 480 × 480, 576 × 576, and 768 × 768 24FPS video encryption using Intel Core i5-1135G7, Intel Core i7-8700, and Intel Xeon Gold 6226R, respectively. The statistical and security analysis prove that the deployed cryptosystems have outstanding statistical properties, can resist attacks, channel noise, and data loss. Compared with previous works, to the best of our knowledge, the proposed strategy achieves the fastest encryption speed, and realizes the first real-time chaotic video encryption based on multi-round confusion-diffusion architecture, thus, providing a more secure and feasible solution for practical applications and related research. © 2023, CC BY.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

VSRQ: Quantitative Assessment Method for Safety Risk of Vehicle Intelligent Connected System

arXiv

引用

arXiv 2023年

作者： Zhang, Tian Guan, Wenshan Miao, Hao Huang, Xiujie Liu, Zhiquan Wang, Chaonan Guan, Quanlong Fang, Liangda Duan, Zhifei Department of Cyberspace Security College of Information Science and Technology Jinan University Guangzhou511486 China Department of Computer Science College of Information Science and Technology Jinan University Guangzhou510632 China College of Information Science and Technology Jinan University Guangdong Institution of Smart Education Jinan University Guangzhou510632 China College of Cyber Security Jinan University Guangzhou510632 China Guangdong Gene Data Processing and Analysis Engineering Research Center China Pazhou Laboratory Guangzhou510330 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangzhou XPeng Motors Technology Co. Ltd No.8 Songgang Road Changxing Street Cencun Tianhe District Guangzhou China

The field of intelligent connected in modern vehicles continues to expand, and the functions of vehicles become more and more complex with the development of the times. This has also led to an increasing number of vehicle vulnerabilities and many safety issues. Therefore, it is particularly important to identify high-risk vehicle intelligent connected systems, because it can inform security personnel which systems are most vulnerable to attacks, allowing them to conduct more thorough inspections and tests. In this paper, we develop a new model for vehicle risk assessment by combining I-FAHP with FCA clustering: VSRQ model. We extract important indicators related to vehicle safety, use fuzzy cluster analys (FCA) combined with fuzzy analytic hierarchy process (FAHP) to mine the vulnerable components of the vehicle intelligent connected system, and conduct priority testing on vulnerable components to reduce risks and ensure vehicle safety. We evaluate the model on OpenPilot and experimentally demonstrate the effectiveness of the VSRQ model in identifying the safety of vehicle intelligent connected systems. The experiment fully complies with ISO 26262 and ISO/SAE 21434 standards, and our model has a higher accuracy rate than other models. These results provide a promising new research direction for predicting the security risks of vehicle intelligent connected systems and provide typical application tasks for VSRQ. The experimental results show that the accuracy rate is 94.36%, and the recall rate is 73.43%, which is at least 14.63% higher than all other known indicators. Copyright © 2023, The Authors. All rights reserved.

关键词： Vehicle safety

来源：评论

学校读者我要写书评

暂无评论

Dual Prototypes Contrastive Learning for Semi-Supervised Medical Image Segmentation

SSRN

引用

SSRN 2024年

作者： Yue, Tianai Xu, Rongtao Wu, Jingqian Yang, Wenjie Du, Shide Wang, Changwei Johns Hopkins University Baltimore21218 United States State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The University of Hong Kong Hong Kong999077 Hong Kong College of Computer and Big Data Fuzhou University Fuzhou350108 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan250014 China

Semi-supervised techniques for medical image segmentation have demonstrated potential, effectively training models using scarce labeled data alongside a wealth of unlabeled data. Therefore, semi-supervised medical image segmentation is one of the key issues in engineering applications of medical artificial intelligence. Consistency constraints based on prototype alignment provide an intuitively sensible way to discover valuable insights from unlabeled data that can motivate segmentation performance. In this work, we propose a dual prototypes contrastive network (DPC-Net) to motivate semi-supervised medical segmentation accuracy by imposing image-level global prototype constraints and pixel-level local prototype constraints. First, we introduce a Background-Separation Global Prototype Contrastive Learning technique that utilizes the natural mutual exclusivity of foreground and background to separate the inter-class distances and encourage the segmentation network to obtain segmentation results that are more complete and do not contain background regions. Second, we design a Cross-Consistent Local Prototype Contrastive Learning techniques to extend the perturbation consistency of the two networks to the prototype's localized response to the feature map, thereby shaping a more stable intra-class prototype space and producing accurate and robust pixel-level predictions. Finally, we comprehensively evaluate our method on mainstream semi-supervised medical image segmentation benchmarks and settings, and experimental results show that our DPC-Net outperforms current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Rapid Maize Seedling Detection Based on Receptive-Field and Cross-Dimensional Information Interaction

Rapid Maize Seedling Detection Based on Receptive-Field and ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Fengqi Hao Shulei Zhu Dexin Ma Xiangjun Dong Hoiio Kong Xia Liu Chunhua Mu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Data Science City University of Macau Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Communication College Qingdao Agricultural University Qingdao China National Engineering Laboratory of Wheat and Maize/Key Laboratory of Biology and Genetic Improvement of Maize in Northern Yellow-huai River Plain Ministry of Agriculture Maize Research Institute Shandong Academy of Agricultural Sciences Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The seedling stage is important in the growth and development of maize, and it is also a critical period that affects maize yield and quality. Accurately recognizing this stage of maize is challenging, as current maize seedling detection methods struggle with small sizes and complex environments. This paper proposes a rapid maize seedling detection method that emphasizes spatial feature extraction in the receptive field and cross-dimensional interaction—receptive field triplet attention YOLO (RFT-YOLO). First, we design a convolutional module for cross-dimensional information interaction within the receptive field. Second, we introduce an advanced selective fusion network, which boosts the multi-scale fusion capability of small object features while reducing the GFLOPs of the model. Additionally, we employ Inner-IoU to diminish sensitivity to positional biases of small objects and expedite the convergence of the loss function. Finally, we create a dataset of maize seedlings to conduct our experiments. Experimental results demonstrate that the RFT-YOLO significantly enhances performance, reducing the number of parameters by 35.3% and GFLOPs by 14.24%, compared to the baseline model. Moreover, the mean average precision (mAP) improves from 89.6% to 91.5%. These improvements confirm the model's effectiveness in detecting maize seedlings.

关键词： YOLO Sensitivity Accuracy Semantics Feature extraction Complexity theory data mining Cybernetics Convergence

来源：评论

学校读者我要写书评

暂无评论

TSU: A Two-stage update approach for persistent skiplist 13th

TSU: A Two-stage update approach for persistent skiplist

引用

13th Conference on Advanced Computer Architecture, ACA 2020

作者： Wang, Shucheng Cao, Qiang Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology School of Computer Science and Technology Huazhong University of Science and Technology Ministry of Education of China Wuhan China

ISBN: (纸本)9789811581342

Skiplist, a widely used in-memory index structure, could incur crash inconsistency when running on emerging NVRAM (Non-Volatile Random Access Memory). Logging or strict serialization can ensure crash consistency at the cost of severe performance degradation. In this paper, we propose TSU, a Two-stage update approach to improve the performance of persistent skiplist while preserve crash consistency. TSU exploits space locality of skiplist and atomic write of NVRAM, thus effectively reducing expensive cache line flush (clflush) operations. To this end, we category all four crash inconsistent states into two types: recoverable and unrecoverable. TSU could guarantee the crash state is recoverable by constraining the memory access order for insertion and deletion. We further design a persistency algorithm to reduce clflush by preserving the memory persistent order of skiplist update. In addition, we develop a concurrent search for TSU. The evaluation result shows that TSU can reduce cache line flush with up to 47.6%, and decrease the average request latency by up to 36% for insertions compared to the strict serialization. © Springer Nature Singapore Pte Ltd 2020.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Tailor: Inter-Feature Distinction Filter Fusion Pruningtailor: Inter-Feature Distinction Filter Fusion Pruning

SSRN

引用

SSRN 2023年

作者： Han, Xuming Chu, Yali Wang, Ke Wang, Limin Yue, Lin Ding, Weiping Gu, Tianlong Weng, Jian College of Information and Science Jinan University Guangzhou510632 China School of Mathematics and Statistics Changchun University of Technology Jilin130000 China Trusted AI Engineering Research Center Ministry of Education Jinan University Guangzhou510632 China School of Artificial Intelligence and Digital Economy Industry Guangdong University of Finance and Economics Guangzhou510320 China University of Newcastle Australia School of Information and Science Nantong University Nantong China Engineering Research Center of Trustworthy AI Ministry of Education Jinan University China Guangdong Key Laboratory of Data Security and Privacy Preserving Jinan University Guangzhou510632 China

Filter pruning is an effective compression method for slimming deep convolutional neural networks by removing the partial structure of the network without sacrificing performance. The pruning criteria directly affect the performance of the network model after compression. Currently, pruning criteria mainly measure the norm of a filter weight matrix (L1 norm and L2 norm)and the matrix rank of a feature map. These criteria are based on the amount of filtered information. We found that inter-feature distinction among filters is also a significant factor in directing filter pruning, in contrast to previous methods. We propose a pruning method that fuses distinction between the output feature maps of filters, namely inTer-feAture distinctIon fiLter fusiOn pRuning (TAILOR). The TAILOR method was implemented by randomly selecting multiple filter combinations in the convolutional layer through the pruning rate and calculating the output feature maps of the next convolutional layer of these combinations. An intelligent distinction optimization scheme was proposed. The approximate optimal solution yields a filter combination, which then supplants the original convolutional layer to facilitate filter pruning. The results indicate that the inter-feature distinctions among filters significantly affect filter pruning. In addition, TAILOR outperforms state-of-the-art filter-pruning methods in terms of model prediction accuracy, floating-point operations, and parameter scale. For example, with VGG-16, we achieve a 70.93% FLOPs reduction by removing 90.05% of the parameters, with a loss of 0.44% in accuracy on CIFAR-10. © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：