Results 171 to 180 of about 47,472 (286)

Connexive Exclusion. [PDF]

Erkenntnis
Shramko Y, Wansing H.
europepmc   +1 more source

Advection‐Pressure Splitting Schemes Applied to a Non‐Conservative 1D Blood Flow Model With Transport for Arteries and Veins

International Journal for Numerical Methods in Fluids, EarlyView.
We introduce new efficient and accurate first order finite volume‐type numerical schemes, for the non‐conservative one‐dimensional blood flow equations with transport, taking into account different velocity profiles. The framework is the flux‐vector splitting approach of Toro and Vázquez‐Cendón (2012), that splits the system in two subsystems of PDEs ...
Alessandra Spilimbergo, Eleuterio F. Toro, Annunziato Siviglia, Lucas O. Müller   +3 more
wiley   +1 more source

Solving the coupled Gerdjikov-Ivanov equation via Riemann-Hilbert approach on the half line. [PDF]

Sci Rep
Hu J, Dong H, Zhang N.
europepmc   +1 more source

Approximating propositional knowledge with affine formulas

, 2002
We consider the use of affine formulas, i.e., conjonctions of linear equations modulo 2, for approximating propositional knowledge. These formulas are very close to CNF formulas, and allow for efficient reasoning ; moreover, they can be minimized efficiently.
openaire   +1 more source

Impact of Uncertain Parameters on Navier–Stokes Equations With Heat Transfer via Polynomial Chaos Expansion

International Journal for Numerical Methods in Fluids, EarlyView.
This study investigates the impact of uncertain parameters on Navier–Stokes equations coupled with heat transfer using the Intrusive Polynomial Chaos Method (IPCM). Sensitivity equations are formulated for key input parameters, such as viscosity and thermal diffusivity, and solved numerically using the Finite Element‐Volume method.
N. Nouaime, B. Després, M. A. Puscas, C. Fiorini   +3 more
wiley   +1 more source

On Logical and Scientific Strength. [PDF]

Erkenntnis
Incurvati L, Nicolai C.
europepmc   +1 more source

On the complexity of solving propositional formulas

Beweiskomplexität ist ein Forschungsgebiet an der Schnittstelle von Logik und Komplexitätstheorie, welches die Ressourcen untersucht, die benötigt werden, um Aussagen zu beweisen. Konkret werden nicht-deterministische Berechnungsmodelle, sogenannte Beweissysteme, untersucht, die verschiedene Schlussfolgerungsmethoden erfassen. Die Hauptfrage dreht sich
openaire   +2 more sources

Optimal Variance Forecasting in a Trading Context

Journal of Forecasting, EarlyView.
ABSTRACT In financial trading, the economic value of return and variance forecasts arises from three key components: an investor's risk preference, the quality of return predictions, and the accuracy of risk estimates. This study isolates the third component—risk knowledge—and demonstrates that its contribution is a non‐linear function of realized and ...
Nick Taylor
wiley   +1 more source

Ability and knowledge: from epistemic transition systems to labelled stit models. [PDF]

Auton Agent Multi Agent Syst
Kuncová A, Broersen J, Duijf H, Ramírez Abarca AI.   +3 more
europepmc   +1 more source

Expertise and information: an epistemic logic perspective. [PDF]

Synthese, 2023
Singleton J, Booth R.
europepmc   +1 more source