Results 41 to 50 of about 3,909 (206)
Abstract Graph neural networks (GNNs) have revolutionised the processing of information by facilitating the transmission of messages between graph nodes. Graph neural networks operate on graph‐structured data, which makes them suitable for a wide variety of computer vision problems, such as link prediction, node classification, and graph classification.
Amit Sharma +4 more
wiley +1 more source
Rician Likelihood Loss for Quantitative MRI With Self-Supervised Deep Learning. [PDF]
We introduce a numerically accurate and stable negative log Rician (NLR) likelihood loss for quantitative MR imaging with self‐supervised deep learning. Self‐supervised neural networks trained with the NLR loss have reduced bias in intra‐voxel incoherent motion diffusion coefficient at low signal‐to‐noise ratio (SNR) compared to the traditional mean ...
Parker CS +5 more
europepmc +2 more sources
DNA Encoding Optimisation Based on Thermodynamics
ABSTRACT Due to their exceptional programmability, DNA molecules are widely employed in the design of molecular circuits for applications such as DNA computing, DNA storage and cancer diagnosis and treatment. The quality of DNA sequences directly determines the reliability of these molecular circuits.
Xianhang Luo +3 more
wiley +1 more source
Chebyshev iteration methods for integral equations of the second kind. [PDF]
In this paper the numerical solution of Fredholm integral equations of the second kind using an iterative method in which the solution is represented by a Chebyshev series is discussed. A description of a technique of Chebyshev reduction of the norm of the kernel for use in cases when the iterations converge slowly or not at all is also given. Finally,
openaire +2 more sources
We describe an efficient algorithm to compute the bridge length estimating the size of a complete isoset invariant, which classifies all periodic point sets under Euclidean motion.The fundamental model of any periodic crystal is a periodic set of points at all atomic centres.
Jonathan McManus, Vitaliy Kurlin
wiley +1 more source
Unconditional Variance Estimation Under Complex Surveys
Summary The unconditional framework treats the samples and the variables of interest as random variables. This is particularly suitable with analytic inference, when modelling survey data. We show that variance estimation does not involve finite population corrections and joint‐inclusion probabilities, even with large sampling fractions and under ...
Yves G. Berger
wiley +1 more source
Abstract This paper presents a two‐stage model for planning a renewable energy portfolio by balancing economic, social and environmental sustainability goals. The first stage addresses a multi‐objective problem where conflictive impacts generated by the energy portfolios should be optimised according to the corresponding economic, social or ...
Amelia Bilbao‐Terol +2 more
wiley +1 more source
Collocation with Chebyshev polynomials for a hypersingular integral equation on an interval
The hypersingular integral operator \(D\) defined by \(Dv(x)=- (1/\pi)\text{p.f.} \int_{-1}^ 1 v(y)(x-y)^{-2}dy\), \(x\in[-1,1]\), has the property \(D(\omega U_ j)=(j+1)U_ j\), \(j=0,1,2,\dots,\) where \(\omega(x)=(1-x^ 2)^{1/2}\) and \(U_ j\) is the Chebyshev polynomial of the second kind.
Ernst P. Stephan, Vincent J. Ervin
openaire +2 more sources
Monetary Policy When Preferences Are Quasi‐Hyperbolic
Abstract We study discretionary monetary policy in an economy where economic agents have quasi‐hyperbolic discounting. We demonstrate that a benevolent central bank is able to keep inflation under control for a wide range of discount factors. If the central bank, however, does not adopt the household's time preferences and tries to discourage early ...
RICHARD DENNIS, OLEG KIRSANOV
wiley +1 more source
An accurate solution of the Poisson equation by the Chebyshev-Tau method
This paper presents a new tau method for the two-dimensional Poisson equation. Comparison of the results for a test problem with those computed by \textit{D. B. Haidvogel} and \textit{T. Zang} [J. Comput. Phys. 30, 167-180 (1979; Zbl 0397.65077)] is discussed. It is also indicated that the developed method is more accurate than the existing one.
Muhammed I. Syam, Hani I. Siyyam
openaire +3 more sources

