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

Laplace transform based quantum eigenvalue transformation via linear combination of Hamiltonian simulation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： An, Dong Childs, Andrew M. Lin, Lin Ying, Lexing Beijing International Center for Mathematical Research Peking University China Joint Center for Quantum Information and Computer Science University of Maryland College Park United States Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park United States Department of Mathematics University of California Berkeley United States Applied Mathematics and Computational Research Division Lawrence Berkeley National Laboratory Berkeley United States Challenge Institute for Quantum Computation University of California Berkeley United States Department of Mathematics Stanford University United States Institute for Computational and Mathematical Engineering Stanford University United States

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for non-normal matrices. We propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation (LCHS) method [An, Liu, Lin, Phys. Rev. Lett. 131, 150603, 2023;An, Childs, Lin, arXiv:2312.03916] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, A-k, and the exponential of the matrix inverse, e-A-1. The latter can be interpreted as the solution of a mass-matrix differential equation of the form Au′(t) = -u(t). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting A, reducing the computational complexity. Copyright © 2024, The Authors. All rights reserved.

关键词： Hamiltonians

DSTFormer: 3D Human Pose Estimation with a Dual-scale Spatial and Temporal Transformer Network

学校读者我要写书评

暂无评论

DSTFormer: 3D Human Pose Estimation with a Dual-scale Spatia...

International Conference on Advanced Robotics and Mechatronics (ICARM)

作者： Shaokun Zhang Xinde Li Chuanfei Hu Jianping Xu Huaping Liu School of Automation Southeast University Nanjing China Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education Nanjing China Nanjing Center for Applied Mathematics Nanjing China Southeast University Shenzhen Research Institute Shenzhen China Science and Technology on Information Systems Engineering Laboratory Nanjing China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (数字)9798350385724

ISBN: (纸本)9798350385731

Recent transformer-based methods for estimating 3D human pose have gained widespread attention, achieving state-of-the-art results. Previous methods have primarily focused on capturing motion patterns of the human body at a single scale or cascading multiple scales, such as joints, bones, and body-parts. However, they are difficult to simultaneously capture spatial-temporal motion patterns of the human body at different scales due to the complex motion patterns. To address this issue, we propose Dual-scale Spatial and Temporal transFormer (DSTFormer), which can concurrently explore the spatial dependencies and temporal motion patterns of human joints and bones. Additionally, we introduce a Gcn-Spatial Transformer Block (GSTB), which introduces Graph Convolutional Networks (GCN) into transformer to enhance the exploitation of local relationships and global information between adjacent joints or bones. Extensive experiments are conducted on the Human3.6M benchmark dataset, and superior results are reported when comparing to other state-of-the-art methods. More remarkably, our model achieves to-date the best published performance, with P1 errors of 37.9 mm and 15.6 mm, respectively.

关键词： Solid modeling Three-dimensional displays Mechatronics Graph convolutional networks Computational modeling Pose estimation Transformers Bones Joints Robots

How Deep is Love in LLMs’ Hearts? Exploring Semantic Size in Human-like Cognition

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yao, Yao Yang, Yifei Ma, Xinbei Yang, Dongjie Zhang, Zhuosheng Li, Zuchao Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan University Wuhan430072 China

How human cognitive abilities are formed has long captivated researchers. However, a significant challenge lies in developing meaningful methods to measure these complex processes. With the advent of large language models (LLMs), which now rival human capabilities in various domains, we are presented with a unique testbed to investigate human cognition through a new lens. Among the many facets of cognition, one particularly crucial aspect is the concept of semantic size—the perceived magnitude of both abstract and concrete words or concepts. This study seeks to investigate whether LLMs exhibit similar tendencies in understanding semantic size, thereby providing insights into the underlying mechanisms of human cognition. We begin by exploring metaphorical reasoning, comparing how LLMs and humans associate abstract words with concrete objects of varying sizes. Next, we examine LLMs’ internal representations to evaluate their alignment with human cognitive processes. Our findings reveal that multi-modal training is crucial for LLMs to achieve more human-like understanding, suggesting that real-world, multi-modal experiences are similarly vital for human cognitive development. Lastly, we examine whether LLMs are influenced by attention-grabbing headlines with larger semantic sizes in a real-world web shopping scenario. The results show that multi-modal LLMs are more emotionally engaged in decision-making, but this also introduces potential biases, such as the risk of manipulation through clickbait headlines. Ultimately, this study offers a novel perspective on how LLMs interpret and internalize language, from the smallest concrete objects to the most profound abstract concepts like ‘love’. The insights gained not only improve our understanding of LLMs but also provide new avenues for exploring the cognitive abilities that define human intelligence. Our code and dataset is publicly available at https://***/Zoeyyao27/LLM-Semantic-Size-Understanding. © 2025, CC BY.

关键词： Semantics

Low-altitude Friendly-Jamming for Satellite-Maritime Communications via Generative AI-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Low Earth Orbit (LEO) satellites can be used to assist maritime wireless communications for data transmission across wide-ranging areas. However, extensive coverage of LEO satellites, combined with openness of channels, can cause the communication process to suffer from security risks. This paper presents a low-altitude friendly-jamming LEO satellite-maritime communication system enabled by a unmanned aerial vehicle (UAV) to ensure data security at the physical layer. Since such a system requires trade-off policies that balance the secrecy rate and energy consumption of the UAV to meet evolving scenario demands, we formulate a secure satellite-maritime communication multi-objective optimization problem (SSMCMOP). In order to solve the dynamic and long-term optimization problem, we reformulate it into a Markov decision process. We then propose a transformer-enhanced soft actor critic (TransSAC) algorithm, which is a generative artificial intelligence-enable deep reinforcement learning approach to solve the reformulated problem, so that capturing global dependencies and diversely exploring weights. Simulation results demonstrate that the TransSAC outperforms various baselines, and achieves an optimal secrecy rate while effectively minimizing the energy consumption of the UAV. Moreover, the results find more suitable constraint values for the system. Copyright © 2025, The Authors. All rights reserved.

关键词： Multiobjective optimization

Learning-rate-free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Xiaoyin Xiao, Nachuan Liu, Xin Toh, Kim-Chuan School of Computer and Computing Science Hangzhou City University Hangzhou310015 China Institute of Operational Research and Analytics National University of Singapore Singapore State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences China Department of Mathematics Institute of Operations Research and Analytics National University of Singapore Singapore119076 Singapore

In this paper, we propose a generalized framework for developing learning-rate-free momentum stochastic gradient descent (SGD) methods in the minimization of nonsmooth nonconvex functions, especially in training nonsmooth neural networks. Our framework adaptively generates learning rates based on the historical data of stochastic subgradients and iterates. Under mild conditions, we prove that our proposed framework enjoys global convergence to the stationary points of the objective function in the sense of the conservative field, hence providing convergence guarantees for training nonsmooth neural networks. Based on our proposed framework, we propose a novel learning-rate-free momentum SGD method (LFM). Preliminary numerical experiments reveal that LFM performs comparably to the state-of-the-art learning-rate-free methods (which have not been shown theoretically to be convergence) across well-known neural network training benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Momentum

On the Privacy of Mental Health Apps: An Empirical Investigation and its Implications for Apps Development

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Iwaya, Leonardo Horn Ali Babar, M. Rashid, Awais Wijayarathna, Chamila Centre for Research on Engineering Software Technologies The University of Adelaide AdelaideSA5005 Australia Australia Department of Mathematics and Computer Science Karlstad University Karlstad Sweden Bristol Cyber Security Group Department of Computer Science University of Bristol United Kingdom

An increasing number of mental health services are offered through mobile systems, a paradigm called mHealth. Although there is an unprecedented growth in the adoption of mHealth systems, partly due to the COVID-19 pandemic, concerns about data privacy risks due to security breaches are also increasing. Whilst some studies have analyzed mHealth apps from different angles, including security, there is relatively little evidence for data privacy issues that may exist in mHealth apps used for mental health services, whose recipients can be particularly vulnerable. This paper reports an empirical study aimed at systematically identifying and understanding data privacy incorporated in mental health apps. We analyzed 27 top-ranked mental health apps from Google Play Store. Our methodology enabled us to perform an in-depth privacy analysis of the apps, covering static and dynamic analysis, data sharing behaviour, server-side tests, privacy impact assessment requests, and privacy policy evaluation. Furthermore, we mapped the findings to the LINDDUN threat taxonomy, describing how threats manifest on the studied apps. The findings reveal important data privacy issues such as unnecessary permissions, insecure cryptography implementations, and leaks of personal data and credentials in logs and web requests. There is also a high risk of user profiling as the apps' development do not provide foolproof mechanisms against linkability, detectability and identifiability. Data sharing among third parties and advertisers in the current apps' ecosystem aggravates this situation. Based on the empirical findings of this study, we provide recommendations to be considered by different stakeholders of mHealth apps in general and apps developers in particular. We conclude that while developers ought to be more knowledgeable in considering and addressing privacy issues, users and health professionals can also play a role by demanding privacy-friendly apps. Copyright © 2022, The Authors. All r

关键词： Data privacy

Movable Antenna-Aided Hybrid Beamforming for Multi-User Communications

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Yichi Zhang, Yuchen Zhu, Lipeng Xiao, Sa Tang, Wanbin Eldar, Yonina C. Zhang, Rui National Key Laboratory of Wireless Communications University of Electronic Science and Technology of China Chengdu611731 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot7610001 Israel The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data Shenzhen518172 China

In this correspondence, we propose a movable antenna (MA)-aided multi-user hybrid beamforming scheme with a sub-connected structure, where multiple movable sub-arrays can independently change their positions within different local regions. To maximize the system sum rate, we jointly optimize the digital beamformer, analog beamformer, and positions of subarrays, under the constraints of unit modulus, finite movable regions, and power budget. Due to the non-concave/non-convex objective function/constraints, as well as the highly coupled variables, the formulated problem is challenging to solve. By employing fractional programming, we develop an alternating optimization framework to solve the problem via a combination of Lagrange multipliers, penalty method, and gradient descent. Numerical results reveal that the proposed MA-aided hybrid beamforming scheme significantly improves the sum rate compared to its fixed-position antenna (FPA) counterpart. Moreover, with sufficiently large movable regions, the proposed scheme with sub-connected MA arrays even outperforms the fully-connected FPA array. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

Ranking matters: Does the new format select the best teams for the knockout phase in the UEFA Champions League?

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Csató, László Devriesere, Karel Goossens, Dries Gyimesi, András Lambers, Roel Spieksma, Frits Laboratory on Engineering and Management Intelligence Research Group of Operations Research and Decision Systems Budapest Hungary Institute of Operations and Decision Sciences Department of Operations Research and Actuarial Sciences Hungary Ghent University Department of Business Informatics and Operations Management Belgium FlandersMake@UGent – core lab CVAMO Ghent Belgium University of Pécs Hungary Eindhoven University of Technology Department of Mathematics and Computer Science Netherlands

Starting in the 2024/25 season, the Union of European Football Associations (UEFA) has fundamentally changed the format of its club competitions: the group stage has been replaced by a league phase played by 36 teams in an incomplete round robin format. This makes ranking the teams based on their results challenging because teams play against different sets of opponents, whose strengths vary. In this research note, we apply several well-known ranking methods for incomplete round robin tournaments to the 2024/25 UEFA Champions League league phase. Our results show that it is doubtful whether the currently used point-based system provides the best ranking of the *** Codes 15A06, 91B14 Copyright © 2025, The Authors. All rights reserved.

关键词：

Resource Optimization for LEO Constellation Networks: A Multi-satellite Cooperative Coverage Design

学校读者我要写书评

暂无评论

IEEE Transactions on Communications 2025年

作者： Ma, Xu Zhang, Haijun Song, Wei Lu, Yang Wu, Yuan Leung, Victor C.M University of Science and Technology Beijing Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services Beijing100083 China China Electric Power Research Institute Co. Ltd Beijing102209 China University of Macau State Key Laboratory of Internet of Things for Smart City Macau China University of Macau Department of Computer and Information Science Macau China Shenzhen University Department of Computer Science and Software Engineering Shenzhen518061 China

With its low latency, high throughput, good deployment flexibility, and cost-effectiveness, the low earth orbit (LEO) constellation is regarded as a promising technology for seamless coverage. Unlike geosynchronous orbiting (GSO) satellites, the highly dynamic evolution of LEO constellation topology poses a significant challenge to the traditional scheme of allocating wireless resources. This paper proposes a multisatellite cooperative coverage resource allocation for the LEO constellation. A multi-objective optimization problem focusing on throughput and coverage time is proposed for the overall service quality of the LEO constellation. To solve the complex coupling between multi-domain resources, the optimization problem is decomposed into three key subproblems, which are the beam placement problem, the joint beam association with power allocation problem, and the beam hopping time slot allocation problem. For each subproblem, an adaptive algorithm is proposed that effectively exploits the payload of LEO satellites to ensure the coverage performance of the constellation network. Simulation results demonstrate that the proposed coverage scheme enables fast convergence, enhances network throughput utility, and guarantees the stability and fairness of the communication services. © 1972-2012 IEEE.

关键词： Multiobjective optimization