A novel fast tag number estimation algorithm by Yinghua CUI

“…Tag number estimation is one of the key technologies in radio frequency identification (RFID) system.The conventional estimation algorithms usually interrogate all time slots before estimating the tag quantity,which lead to large payload and time consumption.A rapid estimation algorithm was proposed.By judging the collision of the first 4 slots in each frame,the Q parameter values could be adjusted quickly,and then the number of tag estimates could be obtained by querying a small number of slots.Simulation results show that compared with the traditional tag estimation algorithm,the proposed algorithm has the advantages of fast estimation speed and small estimation error,and is very suitable for fast estimation.…”
Get full text

On the number of residues of certain second-order linear recurrences by Accossato, Federico, Sanna, Carlo

Subjects: Get full text

On Vertex Covering Transversal Domination Number of Regular Graphs by R. Vasanthi, K. Subramanian

“…The vertex covering transversal domination number γvct(G) is the minimum cardinality among all vertex covering transversal dominating sets of G. …”
Get full text

Units in families of totally complex algebraic number fields by L. Ya. Vulakh

“…Multidimensional continued fraction algorithms associated with GLn(ℤk), where ℤk is the ring of integers of an imaginary quadratic field K, are introduced and applied to find systems of fundamental units in families of totally complex algebraic number fields of degrees four, six, and eight.…”
Get full text

Asymptotic Estimates for Second Kind Generalized Stirling Numbers by Cristina B. Corcino, Roberto B. Corcino

“…Asymptotic formulas for the generalized Stirling numbers of the second kind with integer and real parameters are obtained and ranges of validity of the formulas are established. …”
Get full text

A Newton Interpolation Approach to Generalized Stirling Numbers by Aimin Xu

“…We employ the generalized factorials to define a Stirling-type pair {s(n,k;α,β,r),S(n,k;α,β,r)} which unifies various Stirling-type numbers investigated by previous authors. We make use of the Newton interpolation and divided differences to obtain some basic properties of the generalized Stirling numbers including the recurrence relation, explicit expression, and generating function. …”
Get full text

From numbers to forms. The digital turn in morphogenic processes by Michela Barosio, Rossella Gugliotta

Get full text

Irreversible k-Threshold Conversion Number of Circulant Graphs by Ramy Shaheen, Suhail Mahfud, Ali Kassem

“…The k-threshold conversion number of G (denoted by (CkG) is the minimum cardinality of all the IkCSs of G. …”
Get full text

Success Run Waiting Times and Fuss-Catalan Numbers by S. J. Dilworth, S. R. Mane

“…We show that the series coefficients are Fuss-Catalan numbers and write the roots in terms of the generating function of the Fuss-Catalan numbers. …”
Get full text

Editorial - Special Edition: Volume 12, Number 2 by Paul Prinsloo

Get full text

ON ℐ^𝒦-CONVERGENCE OF SEQUENCES OF BI-COMPLEX NUMBERS by J. Hossain, S. Debnath

Subjects: Get full text

Frequency of Chromosome Disorders In Patients with Sperm Number Anomaly by Mehmet Niyaz, Egzon Abdullahı, Zerrin Yılmaz Çelik

Get full text

New Bounds on the Triple Roman Domination Number of Graphs by M. Hajjari, H. Abdollahzadeh Ahangar, R. Khoeilar, Z. Shao, S. M. Sheikholeslami

“…We also show that for each tree T of order n≥2, γ3RT≤3n+sT/2 and γ3RT≥⌈4nT+2−ℓT/3⌉, where sT and ℓT are the number of support vertices and leaves of T.…”
Get full text

The Number of Blocks of a Graph with Given Minimum Degree by Lei Li, Baoyindureng Wu

“…A block of a graph is a nonseparable maximal subgraph of the graph. We denote by bG the number of block of a graph G. We show that, for a connected graph G of order n with minimum degree k≥1, bG<2k−3/k2−k−1n. …”
Get full text

Failed Zero Forcing Numbers of Trees and Circulant Graphs by Luis Gomez, Karla Rubi, Jorden Terrazas, Rigoberto Florez, Darren A. Narayan

“…Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$. …”
Get full text

New Similarity of Triangular Fuzzy Number and Its Application by Xixiang Zhang, Weimin Ma, Liping Chen

“…The similarity of triangular fuzzy numbers is an important metric for application of it. …”
Get full text

Asymptotic Distribution of the Number for Error in the Time of Random Observation by Lu Chuanlai

Get full text

Series and Connections Among Central Factorial Numbers, Stirling Numbers, Inverse of Vandermonde Matrix, and Normalized Remainders of Maclaurin Series Expansions ^† by Feng Qi

Subjects: Get full text

Time Course of Brain Activity Changes Related to Number (Quantity) Processing Triggered by Digits Versus Number Words: An Event-Related Potential (ERP) Study by Peter Walla, Philipp Klimovic

Subjects: Get full text

Weighted Moving Averages for a Series of Fuzzy Numbers Based on Nonadditive Measures with σ − λ Rules and Choquet Integral of Fuzzy-Number-Valued Function by Zengtai Gong, Wenjing Lei, Kun Liu, Na Qin

“…Meanwhile, the Choquet integral of fuzzy number and Choquet integral of fuzzy number vector are defined. …”
Get full text