Results 91 to 100 of about 2,420 (204)

A Cascaded Strategy With Embodied Artificial Intelligence: Forward Kinematics Solutions for CCRobot‐S

Journal of Field Robotics, EarlyView.
ABSTRACT This paper presents a novel cable‐climbing mechanism: the Collaborative Climbing Robot Squad (CCRobot‐S), a variant of Reconfigurable Cable‐Driven Parallel Robots (R‐CDPR), specifically designed for the inspection and maintenance of stay cables.
Zhenliang Zheng, Yongyuan Xu, Xuchun He, Tin Lun Lam, Ning Ding   +4 more
wiley   +1 more source

Better on Average? Average Inflation Targeting With an Unclear Averaging Window

Southern Economic Journal, EarlyView.
ABSTRACT Average inflation targeting (AIT) aims to stabilize inflation expectations by offsetting past deviations from target. However, ambiguity about the averaging window can complicate expectations formation and reduce policy effectiveness. This paper integrates AIT into a benchmark DSGE model, incorporating adaptive learning and a signal extraction
James Dean
wiley   +1 more source

A Formation Inversion Algorithm Based on Collaborative Fuzzy Gradient Neural Dynamics for Natural Gamma Logging While Drilling

CAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT A formation inversion algorithm with real‐time performance and accuracy is crucial for natural gamma logging while drilling (LWD). However, traditional inversion algorithms are often limited by high computational resource consumption and insufficient accuracy.
Juntao Liu, Ruoxiao Liu, Wenxin Li, Zhenming Su, Long Jin   +4 more
wiley   +1 more source

Data‐driven discovery of mechanistic ecosystem models with LLMs

Methods in Ecology and Evolution, EarlyView.
Abstract Ecosystem models are essential for ecosystem management, but their development traditionally requires significant time and expertise, creating bottlenecks in addressing urgent environmental challenges. We present LEMMA (LLM Enabled Mechanistic Modelling for ecosystem Assessment), a framework that programmatically generates and iteratively ...
Scott Spillias, Jacob G. D. Rogers, Fabio Boschetti, Elizabeth A. Fulton, Magda Guglielmo, Suk Yee Yong, Rowan Trebilco   +6 more
wiley   +1 more source

Computing Skinning Weights via Convex Duality

Computer Graphics Forum, EarlyView.
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

International Transactions in Operational Research, EarlyView.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source

Improved New Two-Spectral Conjugate Gradient Iterative Technique for Large Scale Optimization

Mağallaẗ Al-kūfaẗ Al-handasiyyaẗ
Numerous strategies have been proposed in the field of unconstrained optimization to address various optimization challenges, particularly those associated with large-scale systems. Among the classical methods, Newton and Quasi-Newton approaches are well-
Radhwan Basem Thanoon, Ghada Moayid Al-Naemi   +1 more
doaj   +1 more source

Financial Fragility and the Fiscal Multiplier

Journal of Money, Credit and Banking, EarlyView.
Abstract We show that undercapitalized banks with large holdings of government bonds subject to sovereign default risk lead to a new crowding‐out channel: deficit‐financed fiscal stimuli lead to higher bond yields, triggering capital losses for the banks. Banks then cut back loans, which reduces fiscal multipliers.
CHRISTIAAN VAN DER KWAAK, SWEDER VAN WIJNBERGEN   +1 more
wiley   +1 more source

A Polynomial-Time Algorithm for Unconstrained Binary Quadratic Optimization

, 2020
In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove that this minimization problem is in the complexity class $P$.
openaire   +2 more sources

Quantum annealing and its variants: application to quadratic unconstrained binary optimization

, 2023
Published by RWTH Aachen University ...
openaire   +3 more sources