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

Publisher Correction: Image Registration Using the Arithmetic Optimization Algorithm for Robotic Visual Servoing

International Journal of computational Intelligence Systems 2025年第1期18卷 1-2页

作者： Kmich, Mohamed Harrade, Inssaf Karmouni, Hicham Sayyouri, Mhamed Askar, S. S. Abouhawwash, Mohamed Engineering Systems and Applications Laboratory National School of Applied Sciences Sidi Mohamed Ben Abdellah University Fez Morocco National School of Applied Sciences Cadi Ayyad University Marrakech Morocco Department of Statistics and Operations Research College of Science King Saud University Riyadh Saudi Arabia Department of Computational Mathematics Science and Engineering (CMSE) Michigan State University East Lansing USA Department of Mathematics Faculty of Science Mansoura University Mansoura Egypt

来源：评论

学校读者我要写书评

暂无评论

A One Dimensional (1D) computational Fluid Dynamics Study of Fontan-Associated Liver Disease (FALD)

arXiv

引用

arXiv 2025年

作者： Li, Yaqi Puelz, Charles Olufsen, Mette S. Taylor-Lapole, Alyssa Department of Brain and Cognitive Sciences Massachusetts Institute of Technology CambridgeMA02139 United States Mathematics University of Houston HoustonTX77204 United States Department of Mathematics North Carolina State University RaleighNC27695 United States Computational Applied Mathematics and Operations Research Rice University HoustonTX77251 United States

Fontan-Associated Liver Disease (FALD) is a disorder arising from hemodynamic changes and venous congestion in the liver. This disease is prominent in patients with hypoplastic left heart syndrome (HLHS). Although HLHS patients typically survive into adulthood, they have reduced cardiac output due to their univentricular physiology (i.e., a Fontan circuit). As a result, they have insufficient blood delivery to the liver. In comparison, patients with double outlet right ventricle (DORV), also having a univentricular circuit, have lower incidence of FALD. In this study, we use a patient-specific, one-dimensional computational fluid dynamics (1D-CFD) model to predict hemodynamics in the liver of an HLHS patient and compare predictions with an age- and size-matched DORV control patient. Additionally, we simulate FALD conditions in the HLHS patient to predict hemodynamic changes across various stages of disease progression. Our results show that the HLHS patient has a higher portal venous pressure compared to the DORV patient. This difference is exacerbated as FALD conditions progress. The wall shear stress (WSS) is also higher than normal for the HLHS patient, suggesting vascular remodeling. WSS decreases slightly under FALD conditions, consistent with the development of portal hypertension. Perfusion analysis gives insight into regions of liver tissue at risk for fibrosis development, showing increasing pressures and reduced flow throughout the liver tissue fed by the portal vein under FALD conditions. Our results provide insight into the specific hemodynamic changes in Fontan circulation that can cause FALD. © 2025, CC BY.

关键词： Shear stress

来源：评论

学校读者我要写书评

暂无评论

Quasiprobabilistic Readout Correction of Midcircuit Measurements for Adaptive Feedback via Measurement Randomized Compiling

引用

PRX Quantum 2025年第1期6卷 010307-010307页

作者： Akel Hashim Arnaud Carignan-Dugas Larry Chen Christian Jünger Neelay Fruitwala Yilun Xu Gang Huang Joel J. Wallman Irfan Siddiqi Quantum Nanoelectronics Laboratory Department of Physics University of California at Berkeley Berkeley California 94720 USA Applied Math and Computational Research Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Keysight Technologies Canada Kanata Ontario K2K 2W5 Canada Accelerator Technology and Applied Physics Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Materials Sciences Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA

Quantum measurements are a fundamental component of quantum computing. However, on present-day quantum computers, measurements can be more error prone than quantum gates and are susceptible to nonunital errors as well as nonlocal correlations due to measurement crosstalk. While readout errors can be mitigated in postprocessing, this is inefficient in the number of qubits due to a combinatorially large number of possible states that need to be characterized. In this work, we show that measurement errors can be tailored into a simple stochastic error model using randomized compiling, enabling the efficient mitigation of readout errors via quasiprobability distributions reconstructed from the measurement of a single preparation state in an exponentially large confusion matrix. We demonstrate the scalability and power of this approach by correcting readout errors without matrix inversion on a large number of different preparation states applied to a register of eight superconducting transmon qubits. Moreover, we show that this method can be extended to midcircuit measurements used for active feedback via quasiprobabilistic error cancellation, and we demonstrate the correction of measurement errors on an ancilla qubit used to detect and actively correct bit-flip errors on an entangled memory qubit. Our approach enables the correction of readout errors on large numbers of qubits and offers a strategy for correcting readout errors in adaptive circuits in which the results of midcircuit measurements are used to perform conditional operations on nonlocal qubits in real time.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Qudit Dynamical Decoupling on a Superconducting Quantum Processor

引用

Physical Review Letters 2025年第5期134卷 050601-050601页

作者： Vinay Tripathi Noah Goss Arian Vezvaee Long B. Nguyen Irfan Siddiqi Daniel A. Lidar Department of Physics and Astronomy University of Southern California Los Angeles California 90089 USA Center for Quantum Information Science and Technology University of Southern California Los Angeles California 90089 USA Quantum Nanoelectronics Laboratory Department of Physics University of California at Berkeley Berkeley California 94720 USA Applied Math and Computational Research Division Lawrence Berkeley National Lab Berkeley California 94720 USA Department of Electrical and Computer Engineering University of Southern California Los Angeles California 90089 USA Department of Chemistry University of Southern California Los Angeles California 90089 USA

Multilevel qudit systems are increasingly being explored as alternatives to traditional qubit systems due to their denser information storage and processing potential. However, qudits are more susceptible to decoherence than qubits due to increased loss channels, noise sensitivity, and crosstalk. To address these challenges, we develop protocols for dynamical decoupling (DD) of qudit systems based on the Heisenberg-Weyl group. We implement and experimentally verify these DD protocols on a superconducting transmon processor that supports qudit operation based on qutrits (d=3) and ququarts (d=4). Specifically, we demonstrate single-qudit DD sequences to decouple qutrits and ququarts from system-bath-induced decoherence. We also introduce two-qudit DD sequences designed to suppress the detrimental cross-Kerr couplings between coupled qudits. This allows us to demonstrate a significant improvement in the fidelity of time-evolved qutrit Bell states. Our results highlight the utility of leveraging DD to enable scalable qudit-based quantum computing.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Well-posed Questions for Ill-posed Inverse Problems: A Note in Memory of Pierre Sabatier

arXiv

引用

arXiv 2025年

作者： Chen, Gaoming Santosa, Fadil Symes, William W. Department of Applied Mathematics and Statistics Johns Hopkins University BaltimoreMD21218 United States Department of Computational Applied Mathematics and Operations Research Rice University HoustonTX77251 United States

Professor Pierre Sabatier contributed much to the study of inverse problems in theory and practice. Two of these contributions were a focus on theory that actually supports practice, and the identification of well-posed aspects of inverse problems that may quite ill-posed. This paper illustrates these two themes in the context of Electrical Impedance Tomography (EIT), which is both very ill-posed and very practical. We show that for a highly constrained version of this inverse problem, in which a small elliptical inclusion in a homogeneous background is to be identified, optimization of the experimental design (that is, electrode locations) vastly improves the stability of the solution. Copyright © 2025, The Authors. All rights reserved.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Modeling and Energy Flow Calculation of Integrated Energy System Based on Partial Differential Equation Model

引用

Strategic Planning for Energy and the Environment 2024年第4期43卷 979-1006页

作者： Xu, Xiaofeng Department of Computational Applied Mathematics and Operations Research Rice University Houston77005 United States

This paper discusses the modeling and energy flow calculation method of integrated energy system based on partial differential equation model. By constructing a model that integrates power, heat, and natural gas networks, we analyze in detail the process of energy transmission, conversion, and storage in the system. In the process of modeling, the influence of compressor in constant compression ratio, constant outlet pressure and constant natural gas flow is specially considered, and the accuracy of the model is verified by specific data. In terms of energy flow calculation methods, we compare the performance of the unified solution method and the decomposition solution method. Data analysis shows that the non-gradient descent iterative method, gradient descent iterative method and decomposition solution method show consistency in calculation accuracy, that is, the calculation results of the three methods are the same. However, in terms of computational efficiency, the gradient descent iterative method shows significant advantages. Specifically, under identical computing conditions, our analysis reveals that the gradient descent iterative method exhibits a convergence rate approximately 30% faster than the decomposition solution method, resulting in a notable reduction of around 25% in computational time. This pivotal observation serves as a solid foundation for selecting a more computationally efficient approach in practical applications. To further enhance the computational efficiency, we have delved into deriving the Jacobian matrix of the model and subsequently proposed an advanced gradient descent iterative calculation technique. Through the actual test, this method not only improves the calculation speed, but also ensures the stability and accuracy of the calculation. The research in this paper not only provides a strong theoretical support for the optimal operation of the integrated energy system, but also provides a valuable reference for future research in

关键词： Jacobian matrices

来源：评论

学校读者我要写书评

暂无评论

Domain Analytics for Project Portfolio Risk Management. A Scientometric Approach of Bibliometry and Collaboration Networks

SSRN

引用

SSRN 2022年

作者： Ovalle, Oscar Rubiano Micán Rincón, Camilo Andrés Delgado Hurtado, Carolina Andrade Eraso, Carlos Augusto Universidad del Valle Colombia Department of Computational Applied Mathematics and Operations Research

This research contributes with a scientometric study of bibliometry and collaboration networks of ‘'Project Portfolio Risk Management (PPRM)'' as a formal domain linking: Projects, Risk Management and Portfolio. The study includes the phases: Identification or domain structuring and proposal, as well as the work of keywording accuracy;Screening, where the search string is refined and the outputs are reviewed;Eligibility, where criteria are applied in a content analysis, and Inclusion, which consolidates the domain analytics through indicators of bibliometry and collaboration networks. This assessment of Project Portfolio Risk Management is novel, contributing with a synthesis of its trends and evolution. © 2022, The Authors. All rights reserved.

关键词： Risk management

来源：评论

学校读者我要写书评

暂无评论

Finding Biclique Partitions of Co-Chordal Graphs

arXiv

引用

arXiv 2022年

作者： Lyu, Bochuan Hicks, Illya V. Rice University Department of Computational Applied Mathematics and Operations Research United States

The biclique partition number (bp) of a graph G is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the graph exactly once. In this paper, we show that the biclique partition number (bp) of a co-chordal (complementary graph of chordal) graph G = (V, E) is less than the number of maximal cliques (mc) of its complementary graph: a chordal graph Gc = (V, Ec). We first provide a general framework of the "divide and conquer" heuristic of finding minimum biclique partitions of co-chordal graphs based on clique trees. Furthermore, a heuristic of complexity O[|V |(|V | + |Ec|)] is proposed by applying lexicographic breadth-first search to find structures called moplexes. Either heuristic gives us a biclique partition of G with size mc(Gc) − 1. In addition, we prove that both of our heuristics can solve the minimum biclique partition problem on G exactly if its complement Gc is chordal and clique vertex irreducible. We also show that mc(Gc) − 2 ≤ bp(G) ≤ mc(Gc) − 1 if G is a split graph. Copyright © 2022, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number

arXiv

引用

arXiv 2023年

作者： Lyu, Bochuan Hicks, Illya V. Rice University Department of Computational Applied Mathematics and Operations Research United States

The biclique cover number (bc) of a graph G denotes the minimum number of complete bipartite (biclique) subgraphs to cover all the edges of the graph. In this paper, we show that bc(G) ≥ ⌈log2(mc(Gc))⌉ ≥ ⌈log2(χ(G))⌉ for an arbitrary graph G, where χ(G) is the chromatic number of G and mc(Gc) is the number of maximal cliques of the complementary graph Gc, i.e., the number of maximal independent sets of G. We also show that ⌈log2(mc(Gc))⌉ could be a strictly tighter lower bound of the biclique cover number than other existing lower bounds. We can also provide a bound of bc(G) with respect to the biclique partition number (bp) of G: bc(G) ≥ ⌈log2(bp(G) + 1)⌉ or bp(G) ≤ 2bc(G) − 1 if G is co-chordal. Furthermore, we show that bc(G) ≤ χ′r(TKc), where G is a co-chordal graph such that each vertex is in at most two maximal independent sets and χ′r(TKc) is the optimal edge-ranking number of a clique tree of GcMSC Codes 05C70 Copyright © 2023, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Disjunctive Constraints for Obstacle Avoidance in Path Planning

Combinatorial Disjunctive Constraints for Obstacle Avoidance...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Raul Garcia Illya V. Hicks Joey Huchette Department of Computational Applied Mathematics & Operations Research Rice University Houston TX USA Faculty of Computational Applied Mathematics & Operations Research Rice University Houston TX USA Google Research Cambridge MA USA

We present a new approach for modeling avoidance constraints in 2D environments, in which waypoints are assigned to obstacle-free polyhedral regions. Constraints of this form are often formulated as mixed-integer programming (MIP) problems employing big-M techniques-however, these are generally not the strongest formulations possible with respect to the MIP's convex relaxation (so called ideal formulations), potentially resulting in larger computational burden. We instead model obstacle avoidance as combinatorial disjunctive constraints and leverage the independent branching scheme to construct small, ideal formulations. As our approach requires a biclique cover for an associated graph, we exploit the structure of this class of graphs to develop a fast subroutine for obtaining biclique covers in polynomial time. We also contribute an open-source Julia library named ClutteredEnvPathOpt to facilitate computational experiments of MIP formulations for obstacle avoidance. Experiments have shown our formulation is more compact and remains competitive on a number of instances compared with standard big-M techniques, for which solvers possess highly optimized procedures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：