نتایج جستجو برای: higher order tensor
تعداد نتایج: 1809071 فیلتر نتایج به سال:
Logic programs can be synthesized as a by-product of the planning of their verification proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate ...
We propose a physically sensible formulation of initial value problem for black hole perturbations in higher-order scalar-tensor theories. As first application, we study monopole around stealth Schwarzschild solutions shift- and reflection-symmetric subclass degenerate (DHOST) In particular, investigate the time evolution by solving two-dimensional wave equation analyze Vishveshwara's classical...
Dark energy and modified gravity in degenerate higher-order scalar–tensor (DHOST) theories: A review
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper, we explore folds over a form of recursive higher-order function, called hyperfunctions, and show that hyperfunctions allow fold computations to coroutine ac...
We simulate the stochastic Landau-Lifshitz-Gilbert dynamics of a uniaxial nanomagnet out to sub-millisecond timescales using a graphical processing unit based micromagnetic code and determine the effect of geometrical tilts between the spin-current and uniaxial anisotropy axes on the thermally assisted reversal dynamics. The asymptotic behavior of the switching time (I ! 0; hsi / expð"nð1 " IÞÞ...
The scalar version of the pathway model of Mathai (2005) is shown to be associated with a large number of probability models used in physics. Different families of densities are listed here, which are all connected through the pathway parameter α, generating a distributional pathway. The idea is to switch from one functional form to another through this parameter and it is shown that one can pr...
ion X → X ′ 〈λx.X〉(t)→ 〈λx.X ′〉(t) +Lambda ¬X → ¬X ′ ¬〈λx.X〉(t)→ ¬〈λx.X ′〉(t) −Lambda Quantification For new variables x1, . . . , xn, ¬φ(x)→ ¬φ1(x) . . . ¬φ(x)→ ¬φn(x) ¬(∀x)φ(x)→ ¬[φ1(x1) ∧ . . . ∧ φn(xn)] −Quant Binding For x not free in X, X → X ′ X → 〈λx.X ′〉(t) +Bind ¬X → ¬X ′ ¬X → ¬〈λx.X ′〉(t) −Bind Definition 5.2 We say Y is a modal Herbrand expansion of X provided there is a formula X∗ ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید