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

1st International Conference on Artificial Intelligence Security and Privacy, AIS and P 2023

作者： Xu, Peiming Zheng, Meiling Xu, Lingling Guangdong Provincial Key Laboratory of Power System Network Security Electric Power Research Institute CSG Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9789819997848

Federated learning is a new machine learning paradigm used for collaborative training models among multiple devices. In federated learning, multiple clients participate in model training locally and use decentralized learning methods to ensure the privacy of client data. However, although federated learning protects the privacy of client data, the update gradients uploaded by clients may still contain sensitive information. To solve this problem, this paper proposes a secure aggregation protocol which can verify the aggregation results under federated learning and protect gradient privacy. The core idea of this aggregation protocol is to use encryption technology to achieve secure computation between clients, ensuring the privacy of gradients during the aggregation process. At the same time, bilinear pairing technology is used to achieve the verifiability of aggregation results, ensuring the correctness and usability of the model after aggregation. In order to evaluate the security of the protocol, this paper conducts a detailed security analysis. The results show that this protocol has higher security properties compared to the existing related protocols. In addition, the computation and communication costs of the protocol are analyzed, which show that the protocol has good credibility and applicability in practical federated learning scenarios. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

When Does Sora Show:The Beginning of TAO to Imaginative Intelligence and Scenarios Engineering

引用

IEEE/CAA Journal of Automatica Sinica 2024年第4期11卷 809-815页

作者： Fei-Yue Wang Qinghai Miao Lingxi Li Qinghua Ni Xuan Li Juanjuan Li Lili Fan Yonglin Tian Qing-Long Han School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China State Key Laboratory for Management and Control of Complex Systems Chinese Academy of SciencesBeijing 100190China Faculty of Innovation Engineering Macao University of Science and TechnologyMacao 999078China Department of Electrical and Computer Engineering Indiana University-Purdue University IndianapolisIndianapolisIN 46202USA Faculty of Innovation Engineering Macao University of Science and TechnologyMacao 999078China Virtual Reality Fundamental Research Laboratory Department of Mathematics and TheoriesPeng Cheng LaboratoryShenzhen 518000China State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia

DURING our discussion at workshops for writing“What Does ChatGPT Say:The DAO from Algorithmic Intelligence to Linguistic Intelligence”[1],we had expected the next milestone for Artificial Intelligence(AI)would be in the direction of Imaginative Intelligence(II),i.e.,something similar to automatic wordsto-videos generation or intelligent digital movies/theater technology that could be used for conducting new“Artificiofactual Experiments”[2]to replace conventional“Counterfactual Experiments”in scientific research and technical development for both natural and social studies[2]-[6].Now we have OpenAI’s Sora,so soon,but this is not the final,actually far away,and it is just the beginning.

关键词： something Intelligence replace

来源：评论

学校读者我要写书评

暂无评论

Variable-order fractional derivative rutting depth prediction of asphalt pavement based on the RIOHTrack full-scale track

引用

Science China(Information Sciences) 2023年第5期66卷 196-214页

作者： Yu WANG Jiaojiao YAN Wei HUANG Leszek RUTKOWSKI Jinde CAO School of Mathematics Southeast University Jiangsu Provincial Key Laboratory of Networked Collective Intelligence Southeast University Intelligent Transportation System Research Center Southeast University Systems Research Institute of the Polish Academy of Sciences Institute of Computer Science AGH University of Science and Technology Information Technology Institute University of Social Sciences Yonsei Frontier Lab Yonsei University

Rutting deformation is typical damage to asphalt pavement and can be quantitatively described as the time-varying mechanical deformation feature of the asphalt mixture during the creep process. First,a nonlinear viscoelastic creep model is established based on the Caputo variable-order fractional *** fractional order in this model is not fixed and is defined as a time-varying function. The time-dependent mechanical properties of asphalt mixtures are efectively reflected. Based on the modified Burgers model, the variable-order function is revised to a linear form. Second, the variable-order fractional Burgers rutting model is obtained by fitting the test data of the RIOHTrack full-scale track. The Levenberg-Marquardt optimization algorithm is used to analyze the test data and the corresponding parameters to obtain more accurate and applicable variable-order fractional rutting mechanics and empirical models for diferent asphalt pavement structures. Finally, according to the classification of the pavement structure, structures III and VI are taken as examples. The rutting prediction and comparison results of several representative pavement structures are obtained to verify that the proposed rutting prediction model can also accurately predict all road sections of RIOHTrack. The new model is also compared with the rutting model of the mechanistic-empirical pavement design guide, the fractional-order Burgers rutting model, and the modified Burgers rutting model. The fitting results are evaluated using the determination coefficient R2. The results show that the variable-order fractional Burgers rutting model proposed in this study exhibits a better fit and is more applicable to describe the rutting deformation of asphalt pavement.

关键词： RIOHTrack full-scale track Caputo fractional derivative variable-order fractional modified Burgers model rutting prediction

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Latency and Energy Consumption for Mobile Edge Computing Based Proximity Detection in Road Networks

引用

China Communications 2022年第4期19卷 274-290页

作者： Tongyu Zhao Yaqiong Liu Guochu Shou Xinwei Yao School of Information and Communication Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China Beijing Laboratory of Advanced Information Networks Beijing Key Laboratory of Network System Architecture and ConvergenceBeijing 100876China School of Computer Science and Technology Zhejiang University of TechnologyChina

In recent years, artificial intelligence and automotive industry have developed rapidly, and autonomous driving has gradually become the focus of the industry. In road networks, the problem of proximity detection refers to detecting whether two moving objects are close to each other or not in real time. However, the battery life and computing capability of mobile devices are limited in the actual scene,which results in high latency and energy consumption. Therefore, it is a tough problem to determine the proximity relationship between mobile users with low latency and energy consumption. In this article, we aim at finding a tradeoff between latency and energy consumption. We formalize the computation offloading problem base on mobile edge computing(MEC)into a constrained multiobjective optimization problem(CMOP) and utilize NSGA-II to solve it. The simulation results demonstrate that NSGA-II can find the Pareto set, which reduces the latency and energy consumption effectively. In addition, a large number of solutions provided by the Pareto set give us more choices of the offloading decision according to the actual situation.

关键词： proximity detection mobile edge computing road networks constrained multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Scavenger: Better Space-Time Trade-Offs for key-Value Separated LSM-trees 40

Scavenger: Better Space-Time Trade-Offs for Key-Value Separa...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Zhang, Jianshun Wang, Fang Qiu, Sheng Wang, Yi Ou, Jiaxin Huang, Junxun Li, Baoquan Fang, Peng Feng, Dan School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China China Shenzhen Huazhong University of Science and Technology Research Institute China Bytefrance Inc.

ISBN: (纸本)9798350317152

key-Value Stores (KVS) implemented with log-structured merge-tree (LSM-tree) have gained widespread ac-ceptance in storage systems. Nonetheless, a significant challenge arises in the form of high write amplification due to the compaction process. While KV-separated LSM-trees successfully tackle this issue, they also bring about substantial space am-plification problems, a concern that cannot be overlooked in cost-sensitive scenarios. Garbage collection (GC) holds significant promise for space amplification reduction, yet existing GC strategies often fall short in optimization performance, lacking thorough consideration of workload characteristics. Additionally, current KV-separated LSM-trees also ignore the adverse effect of the space amplification in the index LSM-tree. In this paper, we systematically analyze the sources of space amplification of KV-separated LSM-trees and introduce Scavenger, which achieves a better trade-off between performance and space amplification. Scavenger initially proposes an I/O-efficient garbage collection scheme to reduce I/O overhead and incorporates a space-aware compaction strategy based on compensated size to minimize the space amplification of index LSM-trees. Extensive experiments show that Scavenger significantly improves write performance and achieves lower space amplification than other KV-separated LSM-trees (including BlobDB, Titan, and TerarkDB). © 2024 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Code Vulnerability Detection via Nearest Neighbor Mechanism

Code Vulnerability Detection via Nearest Neighbor Mechanism

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Du, Qianjin Kuang, Xiaohui Zhao, Gang Department of Computer Science and Technology Tsinghua University China National Key Laboratory of Science and Technology on Information System Security China

Code vulnerability detection is a fundamental and challenging task in the software security field. Existing research works aim to learn semantic information from the source code by utilizing NLP technologies. However, in vulnerability detection tasks, some vulnerable samples are very similar to non-vulnerable samples, which are difficult to identify. To address this issue and improve detection performance, we introduce the k-nearest neighbor mechanism which retrieves multiple neighbor samples and utilizes label information of retrieved neighbor samples to provide help for model predictions. Besides, we use supervised contrastive learning to make the model learn the discriminative representation and ensure that label information of retrieved neighbor samples is as consistent as possible with the label information of testing samples. Extensive experiments show that our method can achieve obvious performance improvements compared to baseline models. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Frequency-Guided Network for Low-contrast Staining-free Dental Plaque Segmentation

Frequency-Guided Network for Low-contrast Staining-free Dent...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Jiang, Yiming Song, Wenfeng Li, Shuai Yang, Yuming Xia, Bin Hao, Aimin Qin, Hong Beihang University State Key Laboratory of Virtual Reality Technology and Systems Beijing China Beijing Information Science and Technology University School of Computer Science Beijing China Peking University School and Hospital of Stomatology Department of Pediatric Dentistry Beijing China Stony Brook University Department of Computer Science New York United States

ISBN: (纸本)9798350386226

Traditional dental plaque detection relies on medical staining reagents and professional intervention. Deep learning-based automatic staining-free dental plaque segmentation provides an alternative for patients to perform plaque detection at home without staining reagents. However, existing methods still struggle with low-contrast visual features between unstained plaque and healthy teeth. To address this, we propose a Frequency-Guided Network (FGN) for low-contrast staining-free dental plaque segmentation. We observe that dental plaque tends to concentrate specifically near the junction between the teeth and the gingiva. This junction demonstrates abrupt changes in pixel values, indicating high-frequency regions in the image. In other words, dental plaque tends to appear near the high-frequency regions of oral endoscope images. Exploiting this characteristic, we employ a frequency-guided decoupling module to separate the image into high-frequency and low-frequency regions automatically and expand the high-frequency region to encompass nearby potential dental plaque. Then we supervise two regions individually to specifically focus on the expended high-frequency region for localizing nearby dental plaque. Additionally, we propose a high-to-low frequency multiple tasks framework. In the first phase, the network segments the teeth region, and then we input the teeth mask into the second phase. In the second stage, the teeth mask allows us to have a higher frequency at the junction between the teeth and gums, thereby enhancing the effectiveness of frequency-guided decoupling. Furthermore, FGN integrates a frequency-driven refinement module to enhance the guidance quality of the teeth mask for the second phase. Extensive evaluations of the oral endoscope dataset demonstrate that our method outperforms existing high-performance segmentation methods. User studies also confirm that our approach achieves superior results to experienced dentists. https://frequency-guided-netw

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Research on Image Captioning Based on Vision-language Pre-trained Models 9

Research on Image Captioning Based on Vision-language Pre-tr...

引用

9th International Conference on Big Data and Information Analytics, BigDIA 2023

作者： Zou, Shiwei Xie, Yuxiang Yan, Jie Wei, Yingmei Luan, Xidao National University of Defense Technology Department of System Engineering Hunan China National University of Defense Technology Key Laboratory of Big Data Department of System Engineering Changsha Hunan China Changsha University Department of Computer Science Hunan China

ISBN: (纸本)9798350330076

Image captioning is a vision-language task that targets at describing an image by generating a coherent sentence automatically. This technology allows computers to understand and describe images like humans, enabling further processing of images. It combines computer vision and natural language processing, which has broad applications. This paper investigates the use of vision-language pre-trained models for image captioning. In this article, an encoder-decoder hybrid model based on PVT and BERT is pre-trained on a large number of image-text pairs, possessing both understanding and generation capabilities. It consists of three components: 1) an image encoder and a text encoder to extract image and text features respectively;2) a multi-modal encoder to align the two modalities;and 3) a text decoder to generate text descriptions. This paper focuses on enhancing the image encoder of the model, which is crucial for image captioning models as it extracts high-resolution image features. Reducing training time and computational costs can also improve the applicability of pre-trained models. Improvements are made to the original model by modifying the ViT model architecture of the image encoding module. A feature pyramid structure and a spatial reduction attention mechanism is introduced to extract high-resolution image features while reducing computational complexity and memory usage, thereby enhancing the universality of the model. The model adopts a pure Transformer architecture, discarding the convolutional structure, and achieves excellent performance. © 2023 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

A Node Confidence Determination Based Moving Target Defense Strategy for SDN 15

A Node Confidence Determination Based Moving Target Defense ...

引用

15th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2023

作者： Sun, Shimin Xu, Guowei Han, Li Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Software Tiangong Tianjin China Tianjin Univ. of Technol. Natl. Eng. Laboratory for Computer Virus Prevention and Control Technology School of Computer Science and Engineering Tianjin China

ISBN: (纸本)9798350308693

With the rapid development of Internet technology, network assets have become an indispensable part of modern society. Especially in the face of high-value network assets, the attacker is faced with paying a greater cost to study the network structure. Due to the unknown attacker and attack means, the attacker has an advantage in the attack and defense situation. The moving target defense technique can flexibly change the static characteristics of the network attack surface and increase the difficulty for the attacker to detect the network, thus achieving the purpose of enhancing network security. Based on this technique, this paper proposes a defense strategy based on node confidence. It puts forward stricter constraints on the differential selection of address/port hopping paths, dynamically selects the hopping objects according to the node's confidence, and implements the defense strategy of differential complexity. This further increases the network's uncertainty and the difficulty for the attacker to detect the network structure. The experimental results show that in the path differentiation comparison, the maximum improvement is about 18% compared to the Dynamic Random Route Hopping strategy. In the CPU load experiment, the CPU load rate is reduced by about 4.625% on average compared to the Double Address Hopping strategy. Moreover, for larger hopping period, the proposed strategy also performs well in terms of CPU load rate. The proposed strategy also exhibits good performance in terms of CPU load ratio for large hopping cycles. © 2023 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Fractional Order Differential Evolution

引用

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Wang, Kaiyu Gao, Shangce Zhou, MengChu Zhan, Zhi-Hui Cheng, Jiujun Faculty of Engineering University of Toyama Toyama-shi Japan Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA College of Artificial Intelligence Nankai University Tianjin China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Differential evolution (DE) is a widely recognized method to solve complex optimization problems as shown by many researchers. Yet, non-adaptive versions of DE suffer from insufficient exploration ability and uses no historical information for its performance enhancement. This work proposes Fractional Order Differential Evolution (FODE) to enhance DE performance from two aspects. Firstly, a bi-strategy co-deployment framework is proposed. The population-based and parameter-based strategies are combined to leverage their respective advantages. Secondly, the fractional order calculus is first applied to the differential vector to enhance DE’s exploration ability by using the historical information of populations, and ensures the diversity of population in an evolutionary process. We use the 2017 IEEE Congress on Evolutionary Computation (CEC) test functions, and CEC2011 real-world problems to evaluate FODE’s performance. Its sensitivity to parameter changes is discussed and an ablation study of multi-strategies is systematically performed. Furthermore, the variations of exploration and exploitation in FODE are visualized and analyzed. Experimental results show that FODE is superior to other state-of-the-art DE variants, the winners of CEC competitions, other fractional order calculus-based algorithms, and some powerful variants of classic algorithms. IEEE

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：