Results 21 to 30 of about 2,926,234 (312)
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
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
A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers
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
We consider the following Hénon-type problem with critical growth:
Guo Yuxia, Liu Ting
doaj +1 more source
Model Order Reduction of Non-Linear Magnetostatic Problems Based on POD and DEI Methods [PDF]
In the domain of numerical computation, Model Order Reduction approaches are more and more frequently applied in mechanics and have shown their efficiency in terms of reduction of computation time and memory storage requirements. One of these approaches,
CLENET, Stephane, HENNERON, Thomas
core +1 more source
Variance reduction methods [PDF]
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
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
Survey on attribute and concept reduction methods in formal concept analysis
Formal concept analysis (FCA) is now widely recognized as a useful approach for extracting, representing, and analyzing knowledge in various domains. The high computational cost of knowledge processing and the difficulty of visualizing the lattice are ...
Kovács, László +3 more
core +1 more source
Curious Generalized Fibonacci Numbers
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]
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

