Results 61 to 70 of about 16,304 (189)

On Irregularity Measures in Trees with Fibonacci Degree Sequences

open access: yesVestnik KRAUNC: Fiziko-Matematičeskie Nauki
In this paper, degree-based topological indices are fundamental graph invariants used to quantify structural irregularity. Let G=(V,E) be a simple tree with vertex degrees dv for  v∈V(G).
Hamoud, J.   +3 more
doaj   +1 more source

On the sequences of $(q,k)$-generalized Fibonacci numbers [PDF]

open access: yesMathematica Bohemica
We consider a new family of recurrence sequences, the $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell numbers.
Jean Lelis   +3 more
doaj   +1 more source

FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm

open access: yesIET Computers &Digital Techniques, Volume 2026, Issue 1, 2026.
With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance ...
Wassim Alexan   +6 more
wiley   +1 more source

Optimal Control and the Fibonacci Sequence [PDF]

open access: yesJournal of Optimization Theory and Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
von Brasch, Thomas   +2 more
openaire   +7 more sources

Encrypt Anything: A Content‐Aware Hierarchical Privacy Protection Method for Image Data

open access: yesIET Computer Vision, Volume 20, Issue 1, January/December 2026.
This paper proposes the Encrypt Anything Model (EAM), a content‐aware hierarchical privacy protection method that integrates the Segment Anything Model (SAM) and Grounding‐DINO to automatically detect and segment privacy entities in images. EAM dynamically adjusts the encryption granularity according to the sensitivity level of privacy and introduces a
Jiawei Han   +5 more
wiley   +1 more source

Non-Abelian Sequenceable Groups Involving ?-Covers [PDF]

open access: yesJournal of Sciences, Islamic Republic of Iran, 2009
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , .
H. Doostie
doaj  

Device‐Independent Quantum Key Distribution: Protocols, Quantum Games and Security

open access: yesIET Quantum Communication, Volume 7, Issue 1, January/December 2026.
Device‐independent quantum key distribution (DIQKD) removes the need to trust internal device behaviour by certifying security through Bell‐inequality violations, thereby closing practical loopholes in conventional QKD. This paper systematically reviews DIQKD foundations (Bell tests and security definitions), protocol frameworks (CHSH‐based and ...
Syed M. Arslan   +3 more
wiley   +1 more source

On Doubled and Quadrupled Fibonacci Type Sequences

open access: yesAnnales Mathematicae Silesianae
In this paper we study a family of doubled and quadrupled Fibonacci type sequences obtained by distance generalization of Fibonacci sequence. In particular we obtain doubled Fibonacci sequence, doubled and quadrupled Padovan sequence and quadrupled ...
Yilmaz Nur Şeyma   +3 more
doaj   +1 more source

Properties of Generalized Bronze Fibonacci Sequences and Their Hyperbolic Quaternions

open access: yesAxioms
In this study, we establish some properties of Bronze Fibonacci and Bronze Lucas sequences. Then we find the relationships between the roots of the characteristic equation of these sequences with these sequences.
Engin Özkan, Hakan Akkuş, Alkan Özkan
doaj   +1 more source

Two Fibonacci-like sequences [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
In the present paper we will discuss the two Fibonacci-like sequences s₂ₖ₊₁=s₂ₖ-s₂ₖ₋₁+...-s₁+s₀ with s₀=a₀,...,s₂ₖ=a₂ₖ and s₂ₖ₊₂=s₂ₖ₊₁-s₂ₖ+...+s₁-s₀ with s₀=a₀,...,s₂ₖ=a₂ₖ₊₁, where a₀,...,a₂ₖ₊₁ are arbitrary numbers.
Krassimir T. Atanassov   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy