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

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Learning Pareto Set for Multi-Objective Continuous Robot Control

arXiv

引用

arXiv 2024年

作者： Shu, Tianye Shang, Ke Gong, Cheng Nan, Yang Ishibuchi, Hisao Department of Computer Science and Engineering Southern University of Science and Technology China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science City University of Hong Kong Hong Kong

For a control problem with multiple conflicting objectives, there exists a set of Pareto-optimal policies called the Pareto set instead of a single optimal policy. When a multi-objective control problem is continuous and complex, traditional multiobjective reinforcement learning (MORL) algorithms search for many Pareto-optimal deep policies to approximate the Pareto set, which is quite resource-consuming. In this paper, we propose a simple and resource-efficient MORL algorithm that learns a continuous representation of the Pareto set in a high-dimensional policy parameter space using a single hypernet. The learned hypernet can directly generate various well-trained policy networks for different user preferences. We compare our method with two state-of-the-art MORL algorithms on seven multi-objective continuous robot control problems. Experimental results show that our method achieves the best overall performance with the least training parameters. An interesting observation is that the Pareto set is well approximated by a curved line or surface in a highdimensional parameter space. This observation will provide insight for researchers to design new MORL algorithms. © 2024, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

MBTDiff: Multi-segmentation Brain Tumor Model with Diffusion Probabilistic Model 9

MBTDiff: Multi-segmentation Brain Tumor Model with Diffusion...

引用

9th International Conference on Image, Vision and Computing, ICIVC 2024

作者： Zeng, Shuqi Liu, Jun Xu, Ji Luo, Yuan School of Computer Science and Engineering Wuhan Institute of Technology Wuhan China Key Laboratory of Biomarkers and In Vitro Diagnosis Translation Zhejiang province Hangzhou China Hubei Engineering Research Center for Intelligent Digital Technology in New Power System Hubei Central China Technology Development of Electric Power Co. Ltd Wuhan China

ISBN: (纸本)9798350385991

The diffusion probability model has recently garnered remarkable achievements in image generation, emerging as a prominent research focus within computer vision. It has been observed through numerous studies that the diffusion probability model holds potential for application across various domains within computer vision. Drawing inspiration from these models, we present a novel approach to extend their utility to the realm of brain tumor medical image segmentation. Our method entails training the model utilizing a diffusion framework, followed by iterative refinement of segmentation outcomes by incorporating additional encoding layers and decoders. This method employs an end-to-end training approach without relying on pre-trained backbone networks. Given the probabilistic nature of the results generated by the diffusion model and to simulate the actual decision-making process of doctors, we will generate multiple segmentation results and apply denoising techniques to obtain a stable output. These results will then be integrated into the final segmentation map to achieve more precise segmentation. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and systems 2025年

作者： Huang, Yunqi Gao, Dingchao Ying, Shenggang Li, Sanjiang Faculty of Engineering and Information Technology SydneyNSW2007 Australia Institute of Software Chinese Academy of Sciences Key Laboratory of System Software Chinese Academy of Sciences State Key Laboratory of Computer Science China

Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation, offering superior or competitive qubit count and gate fidelity compared to superconducting circuits and ion traps. However, the unique features of NA devices, such as long-range interactions, long qubit coherence time, and the ability to physically move qubits, present distinct challenges for quantum circuit compilation. In this paper, we introduce DasAtom, a novel divide-and-shuttle atom approach designed to optimise quantum circuit transformation for NA devices by leveraging these capabilities. DasAtom partitions circuits into subcircuits, each associated with a qubit mapping that allows all gates within the subcircuit to be directly executed. The algorithm then shuttles atoms to transition seamlessly from one mapping to the next, enhancing both execution efficiency and overall fidelity. For a 30-qubit Quantum Fourier Transform (QFT), DasAtom achieves a 415.8x improvement in fidelity over the move-based algorithm Enola and a 10.6x improvement over the SWAP-based algorithm Tetris. Notably, this improvement is expected to increase exponentially with the number of qubits, positioning DasAtom as a highly promising solution for scaling quantum computation on NA platforms. © 1982-2012 IEEE.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Stackelberg Game-Driven Computational Offloading in Edge Computing Scenarios

Stackelberg Game-Driven Computational Offloading in Edge Com...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Lan Zhang Chao Bu Key Laboratory of Computer Vision and System of Ministry of Education School of Computer Science and Engineering Tianjin University of Technology Tianjin China

With the number of users that use mobile devices for frequent transactions increasing rapidly, it is a great challenge to guarantee the credibility of transactions. Blockchain is regarded as a practical technology for such demand, however, the limited computing capacity of each user's device becomes a bottleneck. In this paper, the edge computing pattern is introduced to support complex computing for mobile devices of users by renting computing resource from computing service providers. By considering demands of both the user and the service provider, we propose a two-level game approach based on the Stackelberg Game for multiple users and multiple service providers on computing resources renting and pricing. The simulation results show that the proposed mechanism is feasible and effective.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic Services Migration Based on Dueling Deep Q-Network in MEC

Dynamic Services Migration Based on Dueling Deep Q-Network i...

引用

International Conference on Communication Software and Networks, ICCSN

作者： Xinyang Zhang Chao Bu Key Laboratory of Computer Vision and System of Ministry of Education School of Computer Science and Engineering Tianjin University of Technology Tianjin China

As an extended computing paradigm of cloud computing, Mobile Edge Computing (MEC) facilitates real-time service responses by deploying resources near network edges. However, services should frequently move among multiple edge computing servers because of the mobility of most users, which accordingly leads to increased network operation costs and influences service quality. In this paper, we formulate the service migration problem as a Markov Decision Process (MDP) and introduce the dueling Deep Q-Network (DQN) to solve the problem, so as to reduce the network operating cost without lowering the service quality. We also propose a trajectory prediction approach to further optimize the service migration. Simulation experimental results demonstrate that the proposed mechanism can achieve a lower network operation cost without reducing the service quality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Smart Contract Vulnerability Detection Based on Mixed Channel Attention 36

Smart Contract Vulnerability Detection Based on Mixed Channe...

引用

36th International Conference on Software engineering and Knowledge engineering, SEKE 2024

作者： Wang, Jiao Ran Zeng, Cheng Ba, Kai Yang Quan, Qing Yu Wang, Yi Feng School of Computer Science and Information Engineering Hubei University Wuhan China School of Artificial Intelligence Hubei University Wuhan China School of Cyberspace Security Hubei University Wuhan China Key Laboratory of Intelligence Sensing System and Security Hubei University Ministry of Education Wuhan China

ISBN: (纸本)1891706594

As blockchain technology progresses, the deployment of smart contracts has become increasingly prevalent. Despite their growing popularity, smart contracts introduce substantial security risks and vulnerabilities. Present detection methodologies predominantly analyze the entirety of a contract’s source code, a process that tends to indiscriminately extract uniform features, leading to inadequate detection capabilities. Addressing these concerns, we propose a novel vulnerability detection method for smart contracts, predicated on a mixed channel attention mechanism. This approach focuses on extracting multifaceted features from pivotal code segments of smart contracts, utilizing a combination of spatial and frequency domain channel attention mechanisms. These mechanisms dynamically modulate the weights of feature channels during visualization, allowing the model to allocate greater emphasis to features of higher significance and enhance feature differentiation. This strategy is instrumental in capturing salient information within the data, thereby augmenting the model’s performance and accuracy. Empirical results substantiate that our proposed method substantially surpasses the baseline model, evidencing improvements of 5.55%, 5.42%, and 5.49% in the detection of timestamp vulnerabilities, and 4.12%, 4.29%, and 4.20% in the identification of reentrancy vulnerabilities, respectively. Our method offers a significant advancement in the efficacy of smart contract vulnerability detection and presents valuable implications for future research. © 2024 Knowledge systems Institute Graduate School. All rights reserved.

关键词： channel attention key code slicing multiple features smart contracts vulnerability detection

来源：评论

学校读者我要写书评

暂无评论

Beam shaping based on a silicon optical phased array chip

Beam shaping based on a silicon optical phased array chip

引用

IEEE International Conference on Group IV Photonics

作者： Wenbo Ren Haipeng Liu Wei Jiang Xincheng Xia Zejun Yan Jijun Feng Shanghai Key Laboratory of Modern Optical System Engineering Research Center of Optical Instrument and System (Ministry of Education) School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai China

ISBN: (数字)9798350394047

ISBN: (纸本)9798350394054

In this study, we present a method for free-space beam shaping and steering based on a silicon optical phased array, which addresses the theoretical limitation of traditional bulk optics. We theoretically analyze the beam propagation properties with changes in the applied phase. Different beam profiles can be shaped by varying the phase combination, while a high-order quasi-Bessel beam can be generated with a cubic change to the phase modulation. The simulated results are validated further experimentally, and they match one another well. The presented method is expected to have broad application prospects for optical communications, free-space optical interconnects, and light detection and ranging.

关键词： Phased arrays Optical interconnections Free-space optical communication Phase modulation Optical propagation Silicon photonics Optics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：