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

Quantum-Informed Recursive Optimization Algorithms

PRX Quantum 2024年第2期5卷 020327-020327页

作者： Jernej Rudi Finžgar Aron Kerschbaumer Martin J.A. Schuetz Christian B. Mendl Helmut G. Katzgraber BMW AG Munich Germany Department of Computer Science Technical University Munich School of CIT Garching Germany Amazon Quantum Solutions Lab Seattle Washington USA AWS Center for Quantum Computing Pasadena California USA Technical University of Munich Institute for Advanced Study Garching Germany

We propose and implement a family of quantum-informed recursive optimization (QIRO) algorithms for combinatorial optimization problems. Our approach leverages quantum resources to obtain information that is used in problem-specific classical reduction steps that recursively simplify the problem. These reduction steps address the limitations of the quantum component (e.g., locality) and ensure solution feasibility in constrained optimization problems. Additionally, we use backtracking techniques to further improve the performance of the algorithm without increasing the requirements on the quantum hardware. We showcase the capabilities of our approach by informing QIRO with correlations from classical simulations of shallow circuits of the quantum approximate optimization algorithm, solving instances of maximum independent set and maximum satisfiability problems with hundreds of variables. We also demonstrate how QIRO can be deployed on a neutral atom quantum processor to find large independent sets of graphs. In summary, our scheme achieves results comparable to classical heuristics even with relatively weak quantum resources. Furthermore, enhancing the quality of these quantum resources improves the performance of the algorithms. Notably, the modular nature of QIRO offers various avenues for modifications, positioning our work as a template for a broader class of hybrid quantum-classical algorithms for combinatorial optimization.

关键词： Adiabatic quantum optimization Optimization problems Quantum algorithms Quantum information with atoms & light

来源：评论

学校读者我要写书评

暂无评论

Memory-Augmented Transformer for Efficient End-to-End Video Grounding

Memory-Augmented Transformer for Efficient End-to-End Video ...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yuanwu Xu Mohan Chen Yuejie Zhang Rui Feng Tao Zhang Shang Gao School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University School of Information Management and Engineering Shanghai Key Laboratory of Financial Information Technology Shanghai University of Finance and Economics School of Information Technology Deakin University

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Video grounding aims to localize a specific segment corresponding to a text query in an untrimmed video. Due to the tremendous computational cost required to process the video frames, the de facto paradigm of video grounding is to extract video features using pretrained video encoders. The parameters of the video encoders are fixed during training, which limits the performance of the localization model. To solve this problem, we propose a Memory-Augmented Transformer (MAT) model. Specifically, each video is split into non-overlapping clips, and our MAT processes videos in a clip-by-clip manner while caching video features into FIFO cached memory queues. By enabling early return, our MAT outperforms previous methods with only less than 60% frames seen. Extensive experimental results on three public benchmark datasets demonstrate that our MAT can achieve competitive performance while being much more efficient than currently prevailing two-stage methods. Code is available at https://***/xuyw1997/MAT.

关键词： Training Location awareness Codes Grounding Computational modeling Streaming media Predictive models

来源：评论

学校读者我要写书评

暂无评论

Estimation of Hamiltonian Parameters from Thermal States

引用

Physical Review Letters 2024年第4期133卷 040802-040802页

作者： Luis Pedro García-Pintos Kishor Bharti Jacob Bringewatt Hossein Dehghani Adam Ehrenberg Nicole Yunger Halpern Alexey V. Gorshkov Theoretical Division (T4) Joint Center for Quantum Information and Computer Science and Joint Quantum Institute Institute of High Performance Computing (IHPC) Agency for Science Technology and Research (A*STAR) 1 Fusionopolis Way # 16-16 Connexis Singapore 138632 Republic of Singapore Department of Physics Institute for Physical Science and Technology

We upper bound and lower bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term that contains the parameter and on the term’s degree of noncommutativity with the full Hamiltonian: higher uncertainty and commuting operators lead to better precision. We apply the bounds to show that there exist entangled thermal states such that the parameter can be estimated with an error that decreases faster than 1/n, beating the standard quantum limit. This result governs Hamiltonians where an unknown scalar parameter (e.g., a component of a magnetic field) is coupled locally and identically to n qubit sensors. In the high-temperature regime, our bounds allow for pinpointing the optimal estimation error, up to a constant prefactor. Our bounds generalize to joint estimations of multiple parameters. In this setting, we recover the high-temperature sample scaling derived previously via techniques based on quantum state discrimination and coding theory. In an application, we show that noncommuting conserved quantities hinder the estimation of chemical potentials.

关键词： Quantum metrology Quantum parameter estimation Quantum sensing

来源：评论

学校读者我要写书评

暂无评论

Towards Context-aware Support for Color Vision Deficiency: An Approach Integrating LLM and AR

Towards Context-aware Support for Color Vision Deficiency: A...

引用

IEEE Global Conference on Consumer Electronics (GCCE)

作者： Shogo Morita Yan Zhang Takuto Yamauchi Sinan Chen Jialong Li Kenji Tei School of Computing Tokyo Institute of Technology Tokyo Japan International Research Center for Neurointelligence University of Tokyo Tokyo Japan Department of Computer Science and Engineering Waseda University Tokyo Japan Center of Mathematical and Data Sciences Kobe University Kobe Japan

ISBN: (数字)9798350355079

ISBN: (纸本)9798350355086

People with color vision deficiency often face challenges in distinguishing colors such as red and green, which can complicate daily tasks and require the use of assistive tools or environmental adjustments. Current support tools mainly focus on presentation-based aids, like the color vision modes found in iPhone accessibility settings. However, offering context-aware support, like indicating the doneness of meat, remains a challenge since task-specific solutions are not cost-effective for all possible scenarios. To address this, our paper proposes an application that provides contextual and autonomous assistance. This application is mainly composed of: (i) an augmented reality interface that efficiently captures context; and (ii) a multi-modal large language model-based reasoner that serves to cognitize the context and then reason about the appropriate support contents. Preliminary user experiments with two color vision deficient users across five different scenarios have demonstrated the effectiveness and universality of our application.

关键词： Green products Color Faces Consumer electronics Augmented reality Context modeling

来源：评论

学校读者我要写书评

暂无评论

Towards Context-aware Support for Color Vision Deficiency: An Approach Integrating LLM and AR

arXiv

引用

arXiv 2024年

作者： Morita, Shogo Zhang, Yan Yamauchi, Takuto Chen, Sinan Li, Jialong Tei, Kenji School of Computing Tokyo Institute of Technology Tokyo Japan International Research Center for Neurointelligence the University of Tokyo Tokyo Japan Department of Computer Science and Engineering Waseda University Tokyo Japan Center of Mathematical and Data Sciences Kobe University Kobe Japan

People with color vision deficiency often face challenges in distinguishing colors such as red and green, which can complicate daily tasks and require the use of assistive tools or environmental adjustments. Current support tools mainly focus on presentation-based aids, like the color vision modes found in iPhone accessibility settings. However, offering context-aware support, like indicating the doneness of meat, remains a challenge since task-specific solutions are not cost-effective for all possible scenarios. To address this, our paper proposes an application that provides contextual and autonomous assistance. This application is mainly composed of: (i) an augmented reality interface that efficiently captures context;and (ii) a multi-modal large language model-based reasoner that serves to cognitize the context and then reason about the appropriate support contents. Preliminary user experiments with two color vision deficient users across five different scenarios have demonstrated the effectiveness and universality of our application. © 2024, CC BY.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Characterizing the Evolution of Size and Inheritance in Object-Oriented Software 20

Characterizing the Evolution of Size and Inheritance in Obje...

引用

20th Brazilian Symposium on Software Quality, SBQS 2021

作者： Sousa, Bruno Luan De Bigonha, Mariza Andrade Da Silva Ferreira, Kecia Aline Marques Franco, Glaura Da Conceição Department of Computer Science Universidade Federal de Minas Gerais Belo Horizonte Minas Gerais Brazil Department of Computing Federal Center for Technological Education of Minas Gerais Belo Horizonte Minas Gerais Brazil Department of Statistics Universidade Federal de Minas Gerais Belo Horizonte Minas Gerais Brazil

ISBN: (纸本)9781450395533

Software evolution consists of adapting, correcting, and updating a system. It is widely known that the systems became increasingly complex and challenging to be maintained over their evolution. However, the way the systems' internal structure evolves is not known in detail. Understanding how the internal software structure evolves is essential to help developers better plan, manage, and perform software maintenance tasks. In this work, we present an empirical analysis to investigate how the internal structure of object-oriented systems evolves from the perspective of inheritance hierarchy and size. Besides, we analyzed the set of classes within the systems that affect these dimensions' evolution and how such classes evolve. We used a methodology based on time series, linear regression techniques, and trend tests to analyze the evolution of object-oriented systems. Using this methodology, we identified the function that better explains how the size and the inheritance tree evolve. This study revealed eight software evolution properties, among them: inheritance hierarchy tends to increase in depth and decrease in breadth;inheritance hierarchy depth and the size of classes grow according to a linear model. The empirical evidence found in this work provides a fine-grained knowledge of how object-oriented software systems' internal structure evolves from internal dimensions. © 2021 ACM.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

Robin: A Novel Method to Produce Robust Interpreters for Dee...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zhen Li Ruqian Zhang Deqing Zou Ning Wang Yating Li Shouhuai Xu Chen Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Hubei Engineering Research Center on Big Data Security Department of Computer Science University of Colorado Colorado Springs USA Center for Research in Computer Vision University of Central Florida USA School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier; the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Obstacles Uncovering System for Slender Pathways Using Unmanned Aerial Vehicles with Automatic Image Localization Technique

引用

International Journal of Computational Intelligence Systems 2023年第1期16卷 1-14页

作者： Selvarajan, Shitharth Manoharan, Hariprasath Khadidos, Alaa O. Shankar, Achyut Khadidos, Adil O. Onyema, Edeh Michael Department of Computer Science Kebri Dehar University Kebri Dehar Ethiopia School of Built Environment Engineering and Computing Leeds Beckett University Leeds UK Department of Electronics and Communication Engineering Panimalar Engineering College Chennai India Department of Information Systems Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Center of Research Excellence in Artificial Intelligence and Data Science King Abdulaziz University Jeddah Saudi Arabia Secure Cyber Systems Research Group (SCSRG) WMG University of Warwick Coventry UK School of Computer Science Engineering Lovely Professional University Phagwara India Department of Information Technology Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia Mathematics and Computer Science Coal City University Enugu Nigeria

In this study, unidentified flying machines are built with real-time monitoring in mid-course settings for obstacle avoidance in mind. The majority of the currently available methods are implemented as comprehensive monitoring systems, with significant success in monitored applications like bridges, railways, etc. So, the predicted model is developed exclusively for specific monitoring settings, as opposed to the broad conditions that are used by the current approaches. Also, in the design model, the first steps are taken by limiting the procedure to specific heights, and the input thrust that is provided for take up operation is kept to a minimum. Due to the improved altitudes, the velocity and acceleration units have been cranked up on purpose, making it possible to sidestep intact objects. In addition, Advanced Image Mapping Localization (AIML) is used to carry out the implementation process, which identifies stable sites at the correct rotation angle. Besides, Cyphal protocol integration improves the security of the data-gathering process by transmitting information gathered from sensing devices. The suggested system is put to the test across five different case studies, where the designed Unmanned aerial vehicle can able to detect 25 obstacles in the narrow paths in considered routs but existing approach can able to identify only 14 obstacle in the same routes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Neural Cellular Potts Models

arXiv

引用

arXiv 2025年

作者： Minartz, Koen d’Hondt, Tim Hillmann, Leon Starruß, Jörn Brusch, Lutz Menkovski, Vlado Department of Mathematics and Computer Science Eindhoven University of Technology Eindhoven Netherlands Department of Applied Physics and Science Education Eindhoven University of Technology Eindhoven Netherlands Department of Biomedical Engineering Eindhoven University of Technology Eindhoven Netherlands Center for Information Services and High Performance Computing TUD Dresden University of Technology Dresden Germany

The cellular Potts model (CPM) is a powerful computational method for simulating collective spatiotemporal dynamics of biological cells. To drive the dynamics, CPMs rely on physics-inspired Hamiltonians. However, as first principles remain elusive in biology, these Hamiltonians only approximate the full complexity of real multicellular systems. To address this limitation, we propose NeuralCPM, a more expressive cellular Potts model that can be trained directly on observational data. At the core of NeuralCPM lies the Neural Hamiltonian, a neural network architecture that respects universal symmetries in collective cellular dynamics. Moreover, this approach enables seamless integration of domain knowledge by combining known biological mechanisms and the expressive Neural Hamiltonian into a hybrid model. Our evaluation with synthetic and real-world multicellular systems demonstrates that NeuralCPM is able to model cellular dynamics that cannot be accounted for by traditional analytical Hamiltonians. Copyright © 2025, The Authors. All rights reserved.

关键词： Potts model

来源：评论

学校读者我要写书评

暂无评论

An Efficient Non-standard Finite Difference Scheme for Solving Distributed Order Time Fractional Reaction–Diffusion Equation

引用

International Journal of Applied and Computational Mathematics 2022年第2期8卷 1-17页

作者： Taghipour, M. Aminikhah, H. Department of Applied Mathematics and Computer Science Faculty of Mathematical Sciences University of Guilan P.O. Box 1914 Rasht 41938 Iran Center of Excellence for Mathematical Modelling Optimization and Combinational Computing (MMOCC) University of Guilan P.O. Box 1914 Rasht 41938 Iran

In this article, a nonstandard finite difference scheme is proposed for solving the distributed order time-fractional reaction–diffusion equation. In this equation, the time-fractional derivative is defined in the Caputo sense. We decompose the equation into two sub-equations and use the exact finite difference scheme with the Clenshaw–Curtis quadrature for sub-equations, then combine them to obtain the numerical method. The term involving the time distributed-order derivative is discretized using the Clenshaw–Curtis quadrature, and the Caputo fractional derivative is approximated by the Grünwald difference operator. We show that the presented scheme is uniquely solvable, unconditionally stable, and convergent. Numerical experiments are carried out to inspect the effectiveness of the presented scheme. © 2022, The Author(s), under exclusive licence to Springer Nature India Private Limited.

关键词： Caputo derivative Clenshaw–Curtis quadrature Distributed order fractional differential equation Non-standard finite difference scheme Reaction–diffusion equation Stability and convergence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：