Results 61 to 70 of about 23,253 (274)
A highly accurate numerical method is given for the solution of boundary value problem of generalized Bagley‐Torvik (BgT) equation with Caputo derivative of order 0<β<2$$ 0<\beta <2 $$ by using the collocation‐shooting method (C‐SM). The collocation solution is constructed in the space Sm+1(1)$$ {S}_{m+1}^{(1)} $$ as piecewise polynomials of degree at ...
Suzan Cival Buranay +2 more
wiley +1 more source
The bi-adjoint scalar ℓ-loop planar integrand recursion and graded inverse variables
Previously in [1], we constructed the ℓ-loop planar integrands using loop components and loop kernels by some recursion rules. In this paper, we propose a new formalism to express the loop kernel recursion.
Yi-Xiao Tao
doaj +1 more source
La articulación de le expresión escrita. The articulation of written expression [PDF]
En este trabajo se aportan argumentos lingüísticos a favor de la autonomía funcional de la expresión escrita. Esta presentaría una estructuración independiente de la oralidad que, sin embargo, descansaría sobre los mismos principios básicos, estando ...
Jose Henrique Pérez-Rodríguez
doaj
Pointers in Recursion: Exploring the Tropics [PDF]
We translate the usual class of partial/primitive recursive functions to a pointer recursion framework, accessing actual input values via a pointer reading unit-cost function.
Paulin Jacobé de Naurois
doaj +1 more source
The need for recursive queries in the Semantic Web setting is becoming more and more apparent with the emergence of datasets where different pieces of information are connected by complicated patterns. This was acknowledged by the W3C committee by the inclusion of property paths in the SPARQL standard.
Juan L. Reutter +2 more
openaire +2 more sources
Non-Recursively Constructible Recursive Families of Graphs [PDF]
In a publication by Noy and Ribó, it was shown that recursively constructible families of graphs are recursive. The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible. In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of ...
Colleen Bouey +3 more
openaire +2 more sources
A DIRECT PROOF OF SCHWICHTENBERG'S BAR RECURSION CLOSURE THEOREM [PDF]
In [12], Schwichtenberg showed that the System T definable functionals are closed under a rule-like version Spector’s bar recursion of lowest type levels 0 and 1.
Oliva, Paulo +5 more
core +1 more source
Computing Bonds Between Formal Contexts
ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón +2 more
wiley +1 more source
The Language Faculty that Wasn't: A Usage-Based Account of Natural Language Recursion
In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive.
Morten H Christiansen +3 more
doaj +1 more source
Quantum off-shell recursion relation
We construct off-shell recursion relations for arbitrary loop-level scattering amplitudes beyond the conventional tree-level recursion relations for ϕ 4-theory and the Yang-Mills theory.
Kanghoon Lee
doaj +1 more source

