Browsing Department of Electronics, Computing & Maths by Title
Now showing items 465484 of 703

OCR based feature extraction and template matching algorithms for Qatari number plateThere are several algorithms and methods that could be applied to perform the character recognition stage of an automatic number plate recognition system; however, the constraints of having a high recognition rate and realtime processing should be taken into consideration. In this paper four algorithms applied to Qatari number plates are presented and compared. The proposed algorithms are based on feature extraction (vector crossing, zoning, combined zoning and vector crossing) and template matching techniques. All four proposed algorithms have been implemented and tested using MATLAB. A total of 2790 Qatari binary character images were used to test the algorithms. Template matching based algorithm showed the highest recognition rate of 99.5% with an average time of 1.95 ms per character.

On a result of Bunder involving horadam sequences: A new proofThis note offers a new proof of a 1975 result due to M. W. Bunder which has recently been proven (inductively), extended empirically and generalized in this journal. The proof methodology, while interesting, cannot be applied realistically beyond the original order two case of Bunder dealt with here.

On a result of Bunder involving Horadam sequences: A proof and generalizationThis note introduces, proves, extends empirically and generalizes a short 1975 offering of M.W. Bunder who, in this journal, gave an isolated observation involving Horadam sequences on which work has been conducted for nearly half a century.

On a scaled balancedpower product recurrenceA power product recurrence (due to M. W. Bunder) is extended here by the introduction of a scaling factor, and delivers a sequence whose general term closed form is derived for both degenerate and nondegenerate characteristic root cases. It is shown how recurrence parameter conditions dictate the nature of each solution type, and a fundamental link between them is highlighted together with some other observations and results.

On an arithmetic triangle of numbers arising from inverses of analytic functions.The Lagrange inversion formula is a fundamental tool in combinatorics. In this work, we investigate an inversion formula for analytic functions, which does not require taking limits. By applying this formula to certain functions we have found an interesting arithmetic triangle for which we give a recurrence formula. We then explore the links between these numbers, Pascal’s triangle, and Bernoulli’s numbers, for which we obtain a new explicit formula. Furthermore, we present power series and asymptotic expansions of some elementary and special functions, and some links to the Online Encyclopedia of Integer Sequences (OEIS).

On certain series expansions of the sine function: Catalan numbers and convergenceThe appearance of Catalan numbers in certain infinite series expansions of the sine function was first reported well over a decade ago. A combination of computation and analysis is employed as we return to this topic and examine the outstanding issue of convergence for this suite of results and also for the general case expansion.

On cyclicity and density of some Catalan polynomial sequencesWe give proofs of cyclic and density properties of some sequences generated by Catalan polynomials, and other observations.

On generalised multiindex nonlinear recursion identities for terms of the Horadam sequence.We state and prove a nonlinear recurrence identity for terms of the so called Horadamsequence,andthenofferitsgeneralisationwhichisavailablefromthesamemethodology. We illustrate how the overarching idea may be used to sequentially produce extended versions, each in turn with an extra level of nonlinearity and term index complexity. These identities can all be captured in matrix determinant form.

On Generalized Lucas Pseudoprimality of Level kWe investigate the Fibonacci pseudoprimes of level k, and we disprove a statement concerning the relationship between the sets of different levels, and also discuss a counterpart of this result for the Lucas pseudoprimes of level k. We then use some recent arithmetic properties of the generalized Lucas, and generalized Pell–Lucas sequences, to define some new types of pseudoprimes of levels k+ and k− and parameter a. For these novel pseudoprime sequences we investigate some basic properties and calculate numerous associated integer sequences which we have added to the Online Encyclopedia of Integer Sequences.

On horadam sequence periodicity: A new approachA so called Horadam sequence is one delivered by a general second order recurrence formula with arbitrary initial conditions. We examine aspects of selfrepeating Horadam sequences by applying matrix based methods in new ways, and derive some conditions governing their cyclic behaviour. The analysis allows for both real and complex sequence periodicity.

On kpartitions of multisets with equal sumsWe study the number of ordered kpartitions of a multiset with equal sums, having elements α1,…,αn and multiplicities m1,…,mn. Denoting this number by Sk(α1,…,αn;m1,…,mn), we find the generating function, derive an integral formula, and illustrate the results by numerical examples. The special case involving the set {1,…,n} presents particular interest and leads to the new integer sequences Sk(n), Qk(n), and Rk(n), for which we provide explicit formulae and combinatorial interpretations. Conjectures in connection to some superelliptic Diophantine equations and an asymptotic formula are also discussed. The results extend previous work concerning 2 and 3partitions of multisets.

On Locky ransomware, Al Capone and BrexitThe highly crafted lines of code which constitute the Locky cryptolocker ransomware are there to see in plain text in an infected machine. Yet, this forensic evidence does not lead investigators to the identity of the extortionists nor to the destination of the ransom payments. Perpetrators of this ransomware remain unknown and unchallenged and so the ransomware cyber crimewave gathers pace. This paper examines what Locky is, how it works, and the mechanics of this malware to understand how ransom payments are made. The financial impact of Locky is found to be substantial. The paper describes methods for “following the money” to assess how effectively such a digital forensic trail can assist ransomware investigators. The legal instruments that are being established by the authorities as they attempt to shut down ransomware attacks and secure prosecutions are evaluated. The technical difficulty of following the money coupled with a lack of registration and disclosure legislation mean that investigators of this cybercrime are struggling to secure prosecutions and halt Locky.

On sequencebased closed form entries for an exponentiated general $2 \times 2$ matrix: A reformulation and an application.Closed form entries for an exponentiated (and arbitrary) 2 ⇥ 2 matrix are established here, and expressed in terms of a specialized Horadam sequence; two proofs of the result are given accordingly, along with examples and observations derived therefrom. The result o↵ers a new formulation of a general class of polynomial families associated with sequences whose ordinary generating functions are governed by quadratic equations.

On some functions involving the lcm and gcd of integer tuplesIn this paper an explicit formula for the number of tuples of positive integers having the same lowest common multiple n is derived, and some of the properties of the resulting arithmetic function are analyzed. The tuples having also the same greatest common divisor are investigated, while some novel or existing integer sequences are recovered as particular cases. A formula linking the gcd and lcm for tuples of integers is also presented.

On some new arithmetic functions involving prime divisors and perfect powers.Integer division and perfect powers play a central role in numerous mathematical results, especially in number theory. Classical examples involve perfect squares like in Pythagora’s theorem, or higher perfect powers as the conjectures of Fermat (solved in 1994 by A. Wiles [8]) or Catalan (solved in 2002 by P. Mih˘ailescu [4]). The purpose of this paper is twofold. First, we present some new integer sequences a(n), counting the positive integers smaller than n, having a maximal prime factor. We introduce an arithmetic function counting the number of perfect powers i j obtained for 1 ≤ i, j ≤ n. Along with some properties of this function, we present the sequence A303748, which was recently added to the Online Encyclopedia of Integer Sequences (OEIS) [5]. Finally, we discuss some other novel integer sequences.

On some new arithmetic properties of the generalized Lucas sequencesSome arithmetic properties of the generalized Lucas sequences are studied, extending a number of recent results obtained for Fibonacci, Lucas, Pell, and Pell–Lucas sequences. These properties are then applied to investigate certain notions of Fibonacci, Lucas, Pell, and Pell–Lucas pseudoprimality, for which we formulate some conjectures.

On some results concerning generalized arithmetic triangles.In this paper we present theoretical and computational results regarding generalized arithmetic mtriangles. The numerical values recover wellknown number sequences, indexed in the OEIS including binomial coefficients and their extensions. Some combinatorial interpretations, generating functions and also asymptotic formulae for these triangles are provided.

On some results concerning the polygonal polynomials.In this paper we define the $n$th polygonal polynomial $P_n(z) = (z1)(z^21)\cdots(z^n1)$ and we investigate recurrence relations and exact integral formulae for the coefficients of $P_n(z)$ and for those of the Mahonian polynomials $Q_n(z)=(z+1)(z^2+z+1)\cdots(z^{n1}+\cdots+z+1)$. We also explore numerical properties of these coefficients, unraveling new meanings for old sequences and generating novel entries to the Online Encyclopedia of Integer Sequences (OEIS). Some open questions are also formulated.

On the characterization of periodic complex Horadam sequencesHoradam sequences are secondorder linear recurrence sequences which depend on a family of four parameters (two in the defining recursion itself, and two initial values). In this article we find necessary and sufficient conditions for the periodicity of complex Horadam sequences, under general initial values, characterizing sequence behavior for degenerate and nondegenerate characteristic solution types. Inner and outer boundaries for regions containing periodic orbits are also determined.

On the characterization of periodic generalized Horadam sequencesThe Horadam sequence is a direct generalization of the Fibonacci numbers in the complex plane, which depends on a family of four complex parameters: two recurrence coefficients and two initial conditions. In this article a computational matrixbased method is developed to formulate necessary and sufficient conditions for the periodicity of generalized complex Horadam sequences, which are generated by higher order recurrences for arbitrary initial conditions. The asymptotic behaviour of generalized Horadam sequences generated by roots of unity is also examined, along with upper boundaries for the disc containing periodic orbits. Some applications are suggested, along with a number of future research directions.