Results 41 to 50 of about 12,719 (235)
On Matrix‐Based Cryptography Using Matrix Norm and Special Integer Sequences
ABSTRACT In this paper, a novel matrix‐based encryption approach based on the Affine Hill cipher is presented. The key matrix is constructed using the Narayana integer sequence, and the Frobenius norm of the key matrix is used as a scaling factor in the key construction.
Melih Göcen +1 more
wiley +1 more source
A class of Fibonacci ideal lattices in Z[zeta(12)]
Politecn Torino, Dipartimento Elettron, I-10129 Turin, ItalyUNESP, Dept Matemat, BR-15054000 Sao Jose do Rio Preto, SP, BrazilUNESP, Dept Matemat, BR-15054000 Sao Jose do Rio Preto, SP ...
Interlando, J. C., Elia, M.
core +2 more sources
Biolinguistics or Physicolinguistics? Is the Third Factor Helpful or Harmful in Explaining Language?
Noam Chomsky (2005) proposed that a ‘third factor’, consisting of general principles and natural laws, may explain core properties of language in a principled manner, minimizing the need for either genetic endowment or experience.
Sverker Johansson
doaj +1 more source
Algorithms for representing positive odd integers as the sum of arithmetic progressions [PDF]
This paper delves into the historical and recent developments in this area of mathematical inquiry, tracing the evolution from Wheatstone's representation of powers of an integer as sums of arithmetic progressions to extensions of Sylvester's Theorem ...
Peter J.-S. Shiue +4 more
doaj +1 more source
ICT learning media mostly emphasize students content and motivation. The emphasis on protecting the environment as a form of development of sustainable living awareness is often considered not significant.
Anita Fibonacci +2 more
doaj +1 more source
The Fibonacci sequence \(\{F_ n\}\) is defined as follows: \(F_ 0=0\), \(F_ 1=1\), \(F_ k=F_{k-1}+F_{k-2}\) for \(k\geq 2\). A well-known theorem, due to Zeckendorf, states that every natural number has a unique representation as a sum of distinct Fibonacci numbers, if we stipulate that \(F_ 0\) and \(F_ 1\) are not used in the representation and that ...
openaire +2 more sources
The 99th Fibonacci Identity [PDF]
We provide elementary combinatorial proofs of several Fibonacci and Lucas number identities left open in the book Proofs That Really Count [1], and generalize these to Gibonacci sequences $G_n$ that satisfy the Fibonacci recurrence, but with arbitrary real initial conditions. We offer several new identities as well. Among these, we prove $\sum_{k\geq 0}
Arthur T. Benjamin +2 more
openaire +3 more sources
Dynamic sampling for SAXSTT: towards real‐time measurement adaptation
A dynamic sampling strategy is presented to reduce the measurement time required for SAXS tensor tomography while maintaining reconstruction quality.Small‐angle X‐ray scattering tensor tomography (SAXSTT) is a powerful technique for non‐destructive 3D characterization of nanoscale structures by reconstructing q‐resolved reciprocal space maps.
Sici Wang +2 more
wiley +1 more source
We present the strict Fibonacci heap , the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. Strict Fibonacci heaps support make-heap, insert, find-min, meld and decrease-key in worst-case \(O(1)\) time ...
Gerth Stølting Brodal +2 more
openaire +4 more sources
Style Brush: Guided Style Transfer for 3D Objects
We introduce Style Brush, a guided 3D style‐transfer method for textured meshes that provides precise creative control. It supports the use of multiple style images, smooth transitions and intuitive guidance, producing visually appealing textures that follow user intent as we demonstrate in our user study and results. Abstract We introduce Style Brush,
Áron Samuel Kovács +2 more
wiley +1 more source

