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

SSRN 2024年

作者： Jin, Shi Liu, Nana Yu, Yue School of Mathematical Sciences Institute of Natural Sciences MOE-LSC Shanghai Jiao Tong University Shanghai200240 China University of Michigan Shanghai Jiao Tong University Joint Institute Shanghai200240 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan Xiangtan University Hunan Xiangtan411105 China

This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. These equations and/or their discretized forms usually do not evolve via unitary dynamics, thus are not suitable for quantum simulation. Boundary conditions (either time-dependent or independent) make the problem more difficult. To tackle this challenge, the Schrödingerisation method can be employed, which converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into one higher dimension. Despite advancements in Schrödingerisation techniques, the explicit implementation of quantum circuits for solving general PDEs, especially with physical boundary conditions, remains underdeveloped. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. One approach utilizes Duhamel's principle to express the solution in integral form and employs linear combination of unitaries (LCU) for coherent state preparation. Another method applies an augmentation to transform the inhomogeneous problem into a homogeneous one. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension. We provide detailed implementations of these two methods and conduct a comprehensive complexity analysis in terms of queries to the time evolution input oracle. © 2024, The Authors. All rights reserved.

关键词： Boundary conditions

来源：评论

学校读者我要写书评

暂无评论

Quantum Circuits for the heat equation with physical boundary conditions via Schrödingerisation

arXiv

引用

arXiv 2024年

This paper explores the explicit design of quantum circuits for quantum simulation of partial differential equations (PDEs) with physical boundary conditions. These equations and/or their discretized forms usually do not evolve via unitary dynamics, thus are not suitable for quantum simulation. Boundary conditions (either time-dependent or independent) make the problem more difficult. To tackle this challenge, the Schrödingerisation method can be employed, which converts linear partial and ordinary differential equations with non-unitary dynamics into systems of Schrödinger-type equations, via the so-called warped phase transformation that maps the equation into one higher dimension. Despite advancements in Schrödingerisation techniques, the explicit implementation of quantum circuits for solving general PDEs, especially with physical boundary conditions, remains underdeveloped. We present two methods for handling the inhomogeneous terms arising from time-dependent physical boundary conditions. One approach utilizes Duhamel’s principle to express the solution in integral form and employs linear combination of unitaries (LCU) for coherent state preparation. Another method applies an augmentation to transform the inhomogeneous problem into a homogeneous one. We then apply the quantum simulation technique from [CJL23] to transform the resulting non-autonomous system to an autonomous system in one higher dimension. We provide detailed implementations of these two methods and conduct a comprehensive complexity analysis in terms of queries to the time evolution input oracle. © 2024, CC BY-NC-ND.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

A2J-Transformer: Anchor-to-Joint Transformer Network for 3D Interacting Hand Pose Estimation from a Single RGB Image

A2J-Transformer: Anchor-to-Joint Transformer Network for 3D ...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Changlong Jiang Yang Xiao Cunlin Wu Mingyang Zhang Jinghong Zheng Zhiguo Cao Joey Tianyi Zhou Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Alibaba Group Centre for Frontier AI Research Agency for Science Technology and Research (A*STAR) Singapore Institute of High Performance Computing Agency for Science Technology and Research (A*STAR) Singapore

3D interacting hand pose estimation from a single RGB image is a challenging task, due to serious self-occlusion and inter-occlusion towards hands, confusing similar appearance patterns between 2 hands, ill-posed joint position mapping from 2D to 3D, etc.. To address these, we propose to extend A2J-the state-of-the-art depth-based 3D single hand pose estimation method-to RGB domain under interacting hand condition. Our key idea is to equip A2J with strong local-global aware ability to well capture interacting hands' local fine details and global articulated clues among joints jointly. To this end, A2J is evolved under Transformer's non-local encoding-decoding framework to build A2J- Transformer. It holds 3 main advantages over A2J. First, self-attention across local anchor points is built to make them global spatial context aware to better capture joints' articulation clues for resisting occlusion. Secondly, each anchor point is regarded as learnable query with adaptive feature learning for facilitating pattern fitting capacity, instead of having the same local representation with the others. Last but not least, anchor point locates in 3D space instead of 2D as in A2J, to leverage 3D pose prediction. Experiments on challenging InterHand 2.6M demonstrate that, A2J-Transformer can achieve state-of-the-art model-free performance (3.38mm MPJPE advancement in 2-hand case) and can also be applied to depth domain with strong generalization. The code is avaliable at https://***/ChanglongJiangGit/A2J-Transformer.

关键词：

来源：评论

学校读者我要写书评

暂无评论

3D Human Pose Estimation with Grouping Regression 1

引用

14th Conference on Image and Graphics Technologies and Applications, IGTA 2019

作者： He, Xuesheng Wang, Huabin Qin, Yuan Tao, Liang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230031 China

ISBN: (数字)9789811399176

ISBN: (纸本)9789811399169

Most of the methods for predicting the 3D human pose from single picture are to first extract the 2d joint position in the image, and then use the 2d joint coordinates to get the 3d joint position. This type of method focuses on learning the mapping from 2d to 3d, and neglects the kinematic properties of the joints. Combined with the independent characteristics of human limb joint motion, we adopt the structure of grouping regression. The limbs and trunk were divided into different joint groups, and the 3d position of the joints in each group was predicted separately. In order to make the prediction results are closer to the real human posture, we use BiLSTM to design a human joint self-constrained network to adjust prediction results and improve accuracy. Experiments show that the method of grouping regression combined with self-constrained network is superior to the current advanced method. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A New User Grouping and Power Allocation Scheme for Downlink Non-orthogonal Multiple Access Systems 3

A New User Grouping and Power Allocation Scheme for Downlink...

引用

2019 3rd International Conference on Data Mining, Communications and Information Technology, DMCIT 2019

作者： Wang, Yin Li, Xiaohui Wang, Wenwu Zhang, Gongquan Zhang, Hongwei Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230039 China

In this paper, we propose a new user grouping and power allocation scheme based on beamforming for downlink non-orthogonal multiple access systems. The proposed user grouping scheme can effectively reduce the interference from the other user and other beams as well, and can effectively improve the weak user rate especially when the SNR is not large. In addition, a power allocation scheme that can maximize the sum capacity while satisfying a certain fairness index is proposed. From the simulation results, the user grouping and power allocation method proposed in this paper can not only improve the overall system throughput performance, but also improve the fairness of weak users. © 2019 Published under licence by IOP Publishing Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-Attention Network for 2D Face Alignment in the Wild 14th

Multi-Attention Network for 2D Face Alignment in the Wild

引用

14th Conference on Image and Graphics Technologies and Applications, IGTA 2019

作者： Liu, Xin Wang, Huabin Cheng, Rui Yan, Xiang Tao, Liang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei230031 China

ISBN: (纸本)9789811399169

Most existing algorithms based on Convolutional Neural Networks (CNNs) for face alignment ignore the significance of attention mechanism. In this paper, we propose a Multi-Attention Network (MANet) for robust face alignment. Our attention mechanism includes multi-level feature attention and multi-scale attention. Multi-level feature attention is introduced for the purpose of paying attention to features of different levels, specifically, high-level feature attentions are essential for correlations among neighboring regions whereas low-level feature attentions focus on detailed description for local parts. While multi-scale attention is designed to obtain better representation the features of different scales. The attentions mentioned above are utilized for better feature presentation and information flow, thus our network is guided to emphasize the key information and suppress the less significant information. The experimental results on 300 W and WFLW datasets demonstrate the superiority of the proposed method over the state-of-the-art approaches. © 2019, Springer Nature Singapore Pte Ltd.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

RCS Simulation and ISAR Imaging of Coated Targets 5

RCS Simulation and ISAR Imaging of Coated Targets

引用

5th IEEE International Conference on Computational Electromagnetics, ICCEM 2019

作者： Tan, Xiaolong Fang, Ming Huang, Zhixiang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China

ISBN: (纸本)9781538671115

The application of radar absorbing materials on the surface of metal aircraft can effectively reduce the radar cross section (RCS). In this paper, the physical optics (PO) method is used to calculate the RCS of electrically large coated targets. First, we calculate the RCS of the original X29 aircraft and the X29 aircraft coated with a broadband two-layer radar absorbing coating. In addition, the backscattered electric field data of coated and uncoated X29 aircraft are obtained by using the PO method, respectively. Finally, the two-dimensional Inverse Fourier Transform (IFT) of the collected data is taken to form the Inverse Synthetic Aperture Radar (ISAR) image. © 2019 IEEE.

关键词： Radar cross section

来源：评论

学校读者我要写书评

暂无评论

An efficient software faults localization method based on program spectrum

An efficient software faults localization method based on pr...

引用

2020 IEEE International Conference on Information Technology, Big Data and Artificial Intelligence, ICIBA 2020

作者： Yu, Xiaoran Tang, Huanrong Zou, Juan Yu, Fan College of Computer Science and College of Cyberspace Security Xiangtan University Xiangtan China Key Laboratory of Intelligent Computing and Information Processing Xiangtan University Ministry of Education Xiangtan China

ISBN: (纸本)9781728152240

The Spectrum-based Software Fault Localization (SBFL) method has been proved to be effective. The SBFL mainly analyzes the execution information of the test case set on each program entity and counts the suspiciousness value of each program entity through the suspiciousness formula. Different measurement methods of program entities have a significant influence on the accuracy of software faults localization because the effectiveness of the SBFL method depends on the suspiciousness calculation formula used. This paper proposes a new suspiciousness formula, fully considered the coverage information of different dimensions of the program spectrum. The suspiciousness formula can be widely used in a variety of faults localization methods extended on the SBFL method. The experimental results show that this method has advantages in effectiveness and efficiency of faults localization. © 2020 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

An intelligent self-sustained RAN slicing framework for diverse service provisioning in 5G-beyond and 6G networks

引用

intelligent and Converged Networks 2020年第3期1卷 281-294页

作者： Jie Mei Xianbin Wang Kan Zheng Electrical and Computer Engineering Western UniversityLondonON N6A 5B9Canada Intelligent Computing and Communication(IC2)Lab Wireless Signal Processing and Network(WSPN)LabKey Laboratory of Universal Wireless CommunicationMinistry of EducationBeijing University of Posts and Telecommunications(BUPT)Beijing 100876China

Network slicing is a key technology to support the concurrent provisioning of heterogeneous Quality of Service(QoS)in the 5th Generation(5G)-beyond and the 6th Generation(6G)***,effective slicing of Radio Access Network(RAN)is very challenging due to the diverse QoS requirements and dynamic conditions in the 6G *** this paper,we propose a self-sustained RAN slicing framework,which integrates the self-management of network resources with multiple granularities,the self-optimization of slicing control performance,and self-learning together to achieve an adaptive control strategy under unforeseen network *** proposed RAN slicing framework is hierarchically structured,which decomposes the RAN slicing control into three levels,i.e.,network-level slicing,next generation NodeB(gNodeB)-level slicing,and packet scheduling level *** the network level,network resources are assigned to each gNodeB at a large timescale with coarse resource *** the gNodeB-level,each gNodeB adjusts the configuration of each slice in the cell at the large *** the packet scheduling level,each gNodeB allocates radio resource allocation among users in each network slice at a small ***,we utilize the transfer learning approach to enable the transition from a model-based control to an autonomic and self-learning RAN slicing *** the proposed RAN slicing framework,the QoS performance of emerging services is expected to be dramatically enhanced.

关键词： Radio Access Network(RAN) network slicing network resource management intelligent network

来源：评论

学校读者我要写书评

暂无评论

A Novel Preference-Driven Dynamic Multi-Objective Evolutionary Algorithm for Solving Dynamic Multi-Objective Problems

SSRN

引用

SSRN 2024年

作者： Wang, Xueqing Zheng, Jinhua Hou, Zhanglu Liu, Yuan Zou, Juan Xia, Yizhang Yang, Shengxiang Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Computer Science School of Cyberspace Science of Xiangtan University Hunan Province Xiangtan China Faculty of School of Computer Science School of Cyberspace Science of Xiangtan University Xiangtan411105 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Most studies in dynamic multi-objective optimization have predominantly focused on rapidly and accurately tracking changes in the Pareto optimal front (POF) and Pareto optimal set (POS) when the environment undergoes changes. However, there are real-world scenarios where it is necessary to simultaneously solve changing objective functions and satisfy the preference of Decision Makers (DMs). In particular, the DMs may be only interested in a partial region of the POF, known as the region of interest (ROI), rather than requiring the entire POF. To meet the challenge of simultaneously predicting a changing POF and/or POS and dynamic ROI, this paper proposes a new dynamic multi-objective evolutionary algorithm (DMOEAs) based on the preference. The proposed algorithm consists of three key components: an evolutionary direction adjustment strategy based on changing reference points to accommodate shifts in preferences, an angle-based search strategy for tracking the varying ROI, and a hybrid prediction strategy that combines linear prediction models and population manifold estimation within the ROI to ensure convergence and distribution in scenarios where preferences remain unchanged. Experimental studies conducted on 16 widely used benchmark problems and empirical results demonstrate the significant advantages of the proposed algorithm over existing state-of-the-art DMOEAs. © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：