Amihood Amir
YOU?
Author Swipe
View article: Sophisticated Ensemble Deep Learning Approaches for Multilabel Retinal Disease Classification in Medical Imaging
Sophisticated Ensemble Deep Learning Approaches for Multilabel Retinal Disease Classification in Medical Imaging Open
This paper introduces a novel ensemble Deep learning (DL)‐based Multi‐Label Retinal Disease Classification (MLRDC) system, known for its high accuracy and efficiency. Utilising a stacking ensemble approach, and integrating DenseNet201, Eff…
View article: Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs Open
The palindromic fingerprint of a string $S[1\ldots n]$ is the set $PF(S) = \{(i,j)~|~ S[i\ldots j] \textit{ is a maximal }\\ \textit{palindrome substring of } S\}$. In this work, we consider the problem of string reconstruction from a pali…
View article: Various generalizations of uncertainty principles related to the linear canonical ambiguity function
Various generalizations of uncertainty principles related to the linear canonical ambiguity function Open
The uncertainty principle is a fundamental result of the Fourier transform and is currently one of the most rapidly developing areas of mathematics due to its application in various transformations.This paper deals with the linear canonica…
View article: On the Practical Power of Automata in Pattern Matching
On the Practical Power of Automata in Pattern Matching Open
Many papers in the intersection of theoretical and applied algorithms show that the simple, asymptotically less efficient algorithm, performs better than the bestcomplex theoretical algorithms on random data or in specialized “real world” …
View article: On the Practical Power of Automata in Pattern Matching
On the Practical Power of Automata in Pattern Matching Open
The classical pattern matching paradigm is that of seeking occurrences of one string - the pattern, in another - the text, where both strings are drawn from an alphabet set $Σ$. Assuming the text length is $n$ and the pattern length is $m$…
View article: Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time Open
The Suffix Array $SA_S[1\ldots n]$ of an $n$-length string $S$ is a lexicographically sorted array of the suffixes of $S$. The suffix array is one of the most well known and widely used data structures in string algorithms. We present a da…
View article: A Black-Box Attack Model for Visually-Aware Recommender Systems
A Black-Box Attack Model for Visually-Aware Recommender Systems Open
Due to the advances in deep learning, visually-aware recommender systems (RS) have recently attracted increased research interest. Such systems combine collaborative signals with images, usually represented as feature vectors outputted by …
View article: The k-Mappability Problem Revisited
The k-Mappability Problem Revisited Open
The k-mappability problem has two integers parameters m and k. For every subword of size m in a text S, we wish to report the number of indices in S in which the word occurs with at most k mismatches. The problem was lately tackled by Alza…
View article: Update Query Time Trade-off for dynamic Suffix Arrays
Update Query Time Trade-off for dynamic Suffix Arrays Open
The Suffix Array SA(S) of a string S[1 ... n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many strin…
View article: Analysis of the Period Recovery Error Bound
Analysis of the Period Recovery Error Bound Open
The recovery problem is the problem whose input is a corrupted text T that was originally periodic, and where one wishes to recover its original period. The algorithm’s input is T without any information about either the period’s length or…
View article: Settlement development based on land suitability
Settlement development based on land suitability Open
The needs of settlements land are higher due to the increasing population, but the lands-availability in urban areas is getting narrower. Land use continues to grow as the initial process for the expansion of the city, its movement will ou…
View article: Update Query Time Trade-Off for Dynamic Suffix Arrays
Update Query Time Trade-Off for Dynamic Suffix Arrays Open
The Suffix Array SA(S) of a string S[1 … n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string …
View article: Update Query Time Trade-Off for Dynamic Suffix Arrays
Update Query Time Trade-Off for Dynamic Suffix Arrays Open
The Suffix Array SA(S) of a string S[1 … n] is an array containing all the suffixes of S sorted by lexicographic order. The suffix array is one of the most well known indexing data structures, and it functions as a key tool in many string …
View article: Double String Tandem Repeats
Double String Tandem Repeats Open
A tandem repeat is an occurrence of two adjacent identical substrings. In this paper, we introduce the notion of a double string, which consists of two parallel strings, and we study the problem of locating all tandem repeats in a double s…
View article: Isomorphism From Quaternion To Matrix Ring Over Field ℤ<sub>p</sub>
Isomorphism From Quaternion To Matrix Ring Over Field ℤ<sub>p</sub> Open
The quaternion ring and matrixs ring 2 by 2 over ℤ p are non-commutative rings. It seams, the two rings are not identical. However, the result of the study show that the two rings area identical or isomorphic. This paper, presents several …
View article: A class of variable coefficient elliptic equations solved using BEM
A class of variable coefficient elliptic equations solved using BEM Open
In this paper a BEM is used to solve a class of variable coefficient elliptic equations numerically. Some examples are considered to show the convergence, consistency, and accuracy of the numerical solutions.
View article: Stability Analysis for Routh-Hurwitz Conditions Using Partial Pivot
Stability Analysis for Routh-Hurwitz Conditions Using Partial Pivot Open
Stability analysis of the polynomial characteristic equation is not easy to applied to a high-order system, in this case, it relates to search the roots of the degree n polynomial equation. It is difficult to find the roots of the equation…
View article: Around Zero-Divisor Graph of Skew Polynomial Rings over Real Matrix 2 by 2
Around Zero-Divisor Graph of Skew Polynomial Rings over Real Matrix 2 by 2 Open
Let R be an associative ring with non-zero two-sided multiplicative identity. The zero-divisor of R , denoted by Z ( R ). The directed graph Γ( R ) is a graph with vertices Z ( R ) − {0}, where x → y is an edge between distinct vertices x …
View article: k-Coterie and Coterie Join Operation
k-Coterie and Coterie Join Operation Open
In distributed systems, quorum-based algorithms are used to access shared resources in a mutually exclusive way because these algorithms are more resilient to process and communication failures. Based on resource allocation, the quorum sys…
View article: Numerical solutions to anisotropic BVPs for quadratically graded media governed by a Helmholtz equation
Numerical solutions to anisotropic BVPs for quadratically graded media governed by a Helmholtz equation Open
A Boundary Element Method (BEM) is used for obtaining solutions to anisotropic quadratically graded media boundary value problems (BVPs) governed by a Helmholtz type equation. A technique of transforming the variable coefficient governing …
View article: Commutative part of skew polynomial ring over split-octonion
Commutative part of skew polynomial ring over split-octonion Open
Let R be a ring. The set of polynomials R[x: σ] forms a ring with multiplication rule σ(a)x for all a ∈ R where σ is an endomorphism on R. In this paper R is the ring split octonion. Split octonion is an anti-commutative 8-dimensional alte…
View article: Construction of (h,k)-Coterie Quorum System Based on Majority Coterie
Construction of (h,k)-Coterie Quorum System Based on Majority Coterie Open
Quorum system of ( h, k )-majority coterie is a set system which elements are a collection of sets k -coterie provided that each element satisfies bicoterie and disjoint properties. Some of related studies have tried to make the constructi…
View article: A method for calculating the sum of diagonal and anti diagonal of power matrices without explicitly calculating its matrices
A method for calculating the sum of diagonal and anti diagonal of power matrices without explicitly calculating its matrices Open
In fact, matrix power can be done simply by explicitly calculating it using the rule of matrix multiplication. However, matrix power is time consuming if it had high power, because the multiplication is done by many times. Fixing this, the…
View article: Dynamic Palindrome Detection
Dynamic Palindrome Detection Open
Lately, there is a growing interest in dynamic string matching problems. Specifically, the dynamic Longest Common Factor problem has been researched and some interesting results has been reached. In this paper we examine another classic st…