Results 11 to 20 of about 2,591,994 (263)
Metals, 2020 Hot dipping Zn-Al-Mg coatings were prepared by rapid induction heating combined with gas protection. The influence of oxide scale on the structure and surface quality of a hot-dip Zn-6Al-3Mg alloy coating was studied in this paper.
Yijie Zhang +6 more
doaj +1 more source
Advanced Engineering Research, 2022 Introduction. The paper considers an axisymmetric problem of elasticity theory for a radially inhomogeneous transversally isotopic nonclosed sphere containing none of the 0 and 𝜋 poles.
N. K. Akhmedov, S. M. Yusubova
doaj +1 more source
A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers
Mathematics, 2020 The sequence of the k-generalized Fibonacci numbers ( F n ( k ) ) n is defined by the recurrence F n ( k ) = ∑ j = 1 k F n − j ( k ) beginning with the k terms 0 , … , 0 , 1 .
Ana Paula Chaves, Pavel Trojovský
doaj +1 more source
Construction of Solutions for Hénon-Type Equation with Critical Growth
Advanced Nonlinear Studies, 2021 We consider the following Hénon-type problem with critical growth:
Guo Yuxia, Liu Ting
doaj +1 more source
Variance reduction methods [PDF]
Proceedings of the 18th conference on Winter simulation - WSC '86, 1986 A computer simulation model is unusual in that the random error is under the total control of the experimenter. Variance reduction methods aim to take advantage of this to improve experimental accuracy. The fundamental ideas behind the most important of these methods will be described and illustrated with simple examples.
openaire +1 more source
Mulatu Numbers Which Are Concatenation of Two Fibonacci Numbers
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2023 Let (M_k) be the sequence of Mulatu numbers defined by M_0=4, M_1=1, M_k=M_(k-1)+M_(k-2) and (F_k) be the Fibonacci sequence given by the recurrence F_k=F_(k-1)+F_(k-2) with the initial conditions F_0=0, F_1=1 for k≥2.
Fatih Erduvan, Merve Güney Duman
doaj +1 more source
Curious Generalized Fibonacci Numbers
Mathematics, 2021 A generalization of the well-known Fibonacci sequence is the k−Fibonacci sequence whose first k terms are 0,…,0,1 and each term afterwards is the sum of the preceding k terms. In this paper, we find all k-Fibonacci numbers that are curious numbers (i.e.,
Jose L. Herrera +2 more
doaj +1 more source
Shard Load Balancing Method Using State Reduction [PDF]
Jisuanji kexue, 2022 Sharding technology is one of the core technologies to solve the scalability problem of blockchain.When transactions in the P2P network are aggregated into established shards according to the rules,and the verification nodes are randomly and evenly ...
CHEN Jing, LI Zhi-huai, GAO Dong-xue, LI Min
doaj +1 more source
New symmetry reduction method for (1+1)-dimensional differential-difference equations
Frontiers in Physics, 2023 We propose a new symmetry reduction method for (1+1)-dimensional differential-difference equations (DDEs), namely, the λ-symmetry reduction method of solving ordinary differential equations is generalized to DDEs.
Jielin Lyu +3 more
doaj +1 more source
On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers
Karpatsʹkì Matematičnì Publìkacìï, 2021 The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is
S.E. Rihane
doaj +1 more source