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

International Conference on Parallel and Distributed systems (ICPADS)

作者： Junwei Wan Yaojie Chen XueCong Zheng Department of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan China

In addressing the challenges of limited semantic labeling data and imprecise segmentation regions prevalent in the semantic segmentation of ship flame images, this study introduces a semi-supervised semantic segmentation method tailored for ship flame images. This approach is grounded in the principles of pairwise similarity with strong-weak perturbations. Adopting a pseudo-label self-learning strategy, the method employs weak-strong perturbation pairwise similarity, ensuring the propagation of high-confidence predictions during label generation, and thereby enhancing performance. Additionally, to tackle the inherent difficulties presented by smoke enveloping and obscuring flame regions in ship images, we have conceived a Vertical Continuity Feature Enhancement module. This module empowers the model to discern more explicit inter-class boundaries. Empirical evaluations on our proprietary dataset substantiate the superiority of our method, registering an improvement of 4.12 percentage points in mIoU over other semi-supervised approaches. Such results attest to the efficacy of the proposed pairwise similarity approach and the Vertical Continuity Feature Enhancement module in flame semantic segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

OmniMark: Efficient and Scalable Latent Diffusion Model Fingerprinting 39

OmniMark: Efficient and Scalable Latent Diffusion Model Fing...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Fei, Jianwei Dai, Yunshu Xia, Zhihua Huang, Fangjun Zhou, Jiantao State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Cyber Science and Technology Sun Yat-Sen University China College of Cyberspace Security Jinan University China

ISBN: (纸本)157735897X

We introduce OmniMark, a novel and efficient fingerprinting method for Latent Diffusion Models (LDM). OmniMark can encode user-specific fingerprints across diverse dimensions of the weights of the LDM, including kernels, filters, channels, and spatial domains. The LDM is fine-tuned to encode the invisible fingerprint into generated images, which can be decoded by a decoder. By altering fingerprints and re-encoding the weights, OmniMark supports efficient and scalable adhoc generation ( Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ethereum smart contract security research:survey and future research opportunities

引用

Frontiers of computer science 2021年第2期15卷 143-160页

作者： Zeli WANG Hai JIN Weiqi DAI Kim-Kwang Raymond CHOO Deqing ZOU National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabHubei Engineering Research Center on Big Data SecurityWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057China Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249-0631USA

Blockchain has recently emerged as a research trend,with potential applications in a broad range of industries and *** particular successful Blockchain technology is smart contract,which is widely used in commercial settings(e.g.,high value financial transactions).This,however,has security implications due to the potential to financially benefit from a security incident(e.g.,identification and exploitation of a vulnerability in the smart contract or its implementation).Among,Ethereum is the most active and ***,in this paper,we systematically review existing research efforts on Ethereum smart contract security,published between 2015 and ***,we focus on how smart contracts can be maliciously exploited and targeted,such as security issues of contract program model,vulnerabilities in the program and safety consideration introduced by program execution *** also identify potential research opportunities and future research agenda.

关键词： smart contract security blockchain vulnerability unreliable data

来源：评论

学校读者我要写书评

暂无评论

Efficient Routing Protection Algorithm Based on Optimized Network Topology

引用

computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need

arXiv

引用

arXiv 2024年

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Discrete Jaya algorithm to solve the police resource deployment problem in emergency traffic accident 10

Discrete Jaya algorithm to solve the police resource deploym...

引用

10th IEEE Joint International information technology and Artificial Intelligence Conference, ITAIC 2022

作者： Jing, Zhang Weijie, Ding Zhejiang Police College Department of Computer and Information Security Hangzhou310053 China Big-data and Network Security Research Institute Zhejiang Police College Hangzhou310053 China College of Information Engineering Zhejiang University of Technology Hangzhou310023 China Key Laboratory of Public Security Information Application Based on Big-data Architecture Ministry of Public Security Hangzhou310053 China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

Aiming at the high frequency of urban traffic accidents and the relative shortage of police resources, a multi-objective discrete Jaya algorithm is proposed to solve the problem of police resource deployment in emergency traffic accident handling. The purpose is to make timely response and handling of traffic accidents through the rational allocation of police deployment points in the jurisdiction. Taking the coverage of accident points and the average response time of accidents as the optimization objectives, the discrete Jaya algorithm is used as the global search strategy to approach the Pareto front by constantly approaching the optimal solution and far away from the worst solution, and then the neighborhood search strategy is used to improve the local search ability of the algorithm. Finally, a practical example is given to verify the effectiveness of the proposed method. © 2022 IEEE.

关键词： Law enforcement

来源：评论

学校读者我要写书评

暂无评论

Using Lock-Free Design for Throughput-Optimized Cache Eviction 25

Using Lock-Free Design for Throughput-Optimized Cache Evicti...

引用

Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of computer systems

作者： Chao Dong Fang Wang Hong Jiang Dan Feng Key Laboratory of Information Storage System (Wuhan National Laboratory for Optoelectronics) Engineering Research Center of data storage systems and Technology (School of Computer Science and Technology) Ministry of Education of China Huazhong University of Science and Techonolgy Wuhan Hubei China Department of Computer Science and Engineering University of Texas at Arlington Arlington Texas USA

ISBN: (纸本)9798400715938

This paper presents a practical approach to cache eviction algorithm design, called Mobius, that optimizes the concurrent throughput of caches and reduces cache operation latency by utilizing lock-free data structures, while maintaining high cache hit ratios. Mobius includes two key designs. First, Mobius employs two lock-free FIFO queues to manage cache items, ensuring that all cache operations are executed efficiently in concurrency. Second, Mobius integrates a consecutive detection mechanism that merges multiple modifications during eviction into a single operation, thereby reducing data races. The implementation of Mobius in CacheLib and RocksDB highlights its high concurrency in both synthetic and real-world workloads.

关键词： cache eviction policy

来源：评论

学校读者我要写书评

暂无评论

Multi-Server Verifiable Aggregation for Federated Learning in Securing Industrial IoT

Multi-Server Verifiable Aggregation for Federated Learning i...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Liutao Zhao Haoran Xie Lin Zhong Yujue Wang Beijing Academy of Science and Technology Beijing Computing Center Co. Ltd Beijing China School of Computer Science and Information Security Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin China Hangzhou Innovation Institute of Beihang University Hangzhou China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

The paper introduces a novel approach to address secure aggregation in federated learning, utilizing a multi-server model. This demonstrably secure system effectively mitigates the issues of server loss and single point of failure. The protocol established for secure aggregation operates under the common reference string model. It employs an additive homomorphic secret-sharing scheme alongside a homomorphic Chameleon hash function. This combination results in substantial enhancements in performance, particularly in reducing communication and computational expenses. These improvements have been empirically validated through rigorous testing, showcasing the protocol’s efficacy compared to existing alternatives.

关键词： Hash functions Protocols Additives Federated learning Computational modeling Servers Cryptography

来源：评论

学校读者我要写书评

暂无评论

LIAS: A Lightweight Incentive Authentication Scheme for Forensic Services in IoV

LIAS: A Lightweight Incentive Authentication Scheme for Fore...

引用

作者： Zhang, Mingyue Zhou, Junlong Cong, Peijin Zhang, Gongxuan Zhuo, Cheng Hu, Shiyan Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Institute of Computing Technology Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100190 China Zhejiang University Department of Information Science and Electronic Engineering Hangzhou310027 China University of Southampton School of Electronics and Computer Science SouthamptonSO17 1BJ United Kingdom

Internet of Vehicles (IoV) has become an indispensable data sensing and processing platform in Internet of Things (IoT) for intelligent transportation. The mounted cameras on the vehicles along with the fixed roadside cameras are utilized to provide pictorial services for IoV users and law enforcement agencies. For such forensic services, ensuring the security and privacy of vehicles while guaranteeing the efficiency of data transmission among vehicles is important. In this paper, we propose a lightweight incentive authentication scheme (LIAS) for forensic services in IoV. LIAS is developed on a three-tier architecture containing cloud layer, fog layer, and user layer. LIAS uses pairing-free certificateless signcryption, pseudonym update mechanism, and incentive mechanism to realize a secure anonymous authentication efficiently. We conduct correctness and security analysis, as well as performance analysis and evaluation to validate the high security and efficiency of LIAS. Experimental results reveal that, the communication and computation overheads as well as the message delay and packet loss of LIAS are much lower than those of state-of-the-art techniques. Note to Practitioners - This paper is motivated by the security and privacy issues of forensic services in IoV for intelligent transportation. Our goal is to improve the security and privacy of vehicles while guaranteeing the lightweight and incentive of data transmission among the vehicles. Fog-assisted IoV is introduced to fully utilize the capacities of near-user edge devices as well as the connections between fog nodes and devices. However, it still faces the difficulties in ensuring vehicles' security and privacy. Moreover, vehicles' information dissemination could be easily monitored because of the unavoidable defect of wireless communication. Thereby, it is essential to guarantee the security and privacy of vehicles while enhancing the efficiency of vehicles' data transmission during the forensic service.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Differential Cryptanalysis of Round-Reduced SPEEDY Family 18th

Differential Cryptanalysis of Round-Reduced SPEEDY Family

引用

18th International Conference on information security and Cryptology, Inscrypt 2022

作者： Yu, Qingyuan Jia, Keting Zou, Guangnan Zhang, Guoyan School of Cyber Science and Technology Shandong University Shandong Qingdao266237 China Institute for Network Sciences and Cyberspace BNRist Tsinghua University Beijing10084 China Department of Computer Sciences and Technology Tsinghua University Beijing10084 China Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Shandong Qingdao266237 China Zhongguancun Laboratory Beijing China Shandong Institute of Blockchain Shandong Jinan China

ISBN: (纸本)9783031265525

SPEEDY is a family of ultra low latency block ciphers proposed at TCHES 2021 by Leander et al. The standard version, SPEEDY-6-192 offers 128-bit security with high encryption speed in hardware. Differential cryptanalysis proposed in 1990 by Biham and Shamir is one of the most popular methods of cryptanalysis of block ciphers. It is usually the first choice to evaluate the security for designers when designing a new block cipher. The automatic search for various distinguishers based on SAT and MILP models etc. boosts the cryptanalysis of block ciphers. However, the performance of the automatic search is not always satisfactory, especially for searching long differential trails of block ciphers with large state sizes. Hence, we endeavor to accelerate the SAT-based automatic search model for differentials of SPEEDY. In this paper, we give a 3.5-round differential characteristic with the probability of $$2^{-104.83}$$ and a 4.5-round differential characteristic with the probability of $$2^{-150.15}$$. Furthermore, by balancing the key recovery and the differential distinguisher, we adjust the distinguisher to speed up filtering wrong pairs with some tricks. Finally we launch a valid 6-round attack for SPEEDY-7-192 with a complexity of $$2^{158.06}$$. We also propose a 5-round attack utilizing a 3.5-round differential distinguisher with the time complexity of $$2^{108.95}$$. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：