Results 31 to 40 of about 141,879 (256)

enOn Rational Recursive Sequences

open access: yesProceedings of STACS 2023, 2023
We study the class of rational recursive sequences (ratrec) over the rational numbers. A ratrec sequence is defined via a system of sequences using mutually recursive equations of depth 1, where the next values are computed as rational functions of the previous values.
Clemente, Lorenzo   +3 more
openaire   +2 more sources

The Polynomial Pivots as Initial Values for a New Root-Finding Iterative Method

open access: yesJournal of Applied Mathematics, 2015
A new iterative method for polynomial root-finding based on the development of two novel recursive functions is proposed. In addition, the concept of polynomial pivots associated with these functions is introduced.
Mario Lázaro   +3 more
doaj   +1 more source

On the $ k $-error linear complexity of binary sequences of periods $ p^n $ from new cyclotomy

open access: yesAIMS Mathematics, 2022
In this paper, we study the $ k $-error linear complexity of binary sequences with periods $ p^n $, which are derived from new generalized cyclotomic classes modulo a power of an odd prime $ p $.
Vladimir Edemskiy, Chenhuang Wu
doaj   +1 more source

Affine functions and series with co-inductive real numbers [PDF]

open access: yes, 2006
We extend the work of A. Ciaffaglione and P. Di Gianantonio on mechanical verification of algorithms for exact computation on real numbers, using infinite streams of digits implemented as co-inductive types.
Bertot, Yves
core   +5 more sources

DNA sequences classification and computation scheme based on the symmetry principle [PDF]

open access: yes, 2009
The DNA sequences containing multifarious novel symmetrical structure frequently play crucial role in how genomes work. Here we present a new scheme for understanding the structural features and potential mathematical rules of symmetrical DNA sequences ...
Wen-Yuan Qiu, Xiao-Gang Song
core   +1 more source

Association of CDKN2A/B Homozygous Deletion and Extent of Resection With Survival of Patients With WHO CNS5 Grade 4 Astrocytoma

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objectives WHO grade 4 astrocytomas are associated with poor prognosis, and their prognostic factors remain controversial. This study aimed to identify the prognostic factors and develop a management algorithm for these patients. Methods This study retrospectively included 151 CNS5 adult grade 4 astrocytomas from two medical centers.
Jiawei Cai   +13 more
wiley   +1 more source

Dynamics and Expressions of Solutions of Nonlinear Difference Equations x_(n+1)=(x_(n-3) x_(n-6))/(±x_(n-2)±x_(n-2) x_(n-3) x_(n-6) )

open access: yesSakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi
Nonlinear difference equations provide a framework for modeling natural phenomena in nonlinear sciences. In this paper, we investigate the periodicity, boundedness, oscillation, stability, and exact solutions of such equations.
Burak Oğul, Dağıstan Şimşek
doaj   +1 more source

Patterning the Void: Combining L‐Systems with Archimedean Tessellations as a Perspective for Tissue Engineering Scaffolds

open access: yesAdvanced Functional Materials, EarlyView.
This study introduces a novel multi‐scale scaffold design using L‐fractals arranged in Archimedean tessellations for tissue regeneration. Despite similar porosity, tiles display vastly different tensile responses (1–100 MPa) and deformation modes. In vitro experiments with hMSCs show geometry‐dependent growth and activity. Over 55 000 tile combinations
Maria Kalogeropoulou   +4 more
wiley   +1 more source

Bayesian Inference of Recursive Sequences of Group Activities from Tracks

open access: yes, 2016
We present a probabilistic generative model for inferring a description of coordinated, recursively structured group activities at multiple levels of temporal granularity based on observations of individuals' trajectories.
Brau, Ernesto   +4 more
core   +1 more source

Implicit learning of recursive context-free grammars [PDF]

open access: yes, 2012
Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not ...
Johan J. Bolhuis   +3 more
core   +3 more sources

Home - About - Disclaimer - Privacy