University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
A fuzzy-based routing scheme for network-on-chip with honeycomb topology
511
520
EN
Mohammad
Alaei
Computer Engineering Department, Faculty of Engineering,Vali-e-Asr University, Rafsanjan, Iran.
alaeim@vru.ac.ir
Fahimeh
Yazdanpanah
Computer Engineering Department, Faculty of Engineering, Vali-e-Asr University, Rafsanjan, Iran
yazdanpanahf@vru.ac.ir
<br />Network-on-chip (NoC) paradigm, which is based on a modular packet-switched mechanism, effectively addresses many of the on-chip communication challenges such as wiring complexity, communication latency, and bandwidth of many-core systems. In designing an efficient NoC, topology and routing algorithm are the most important challenging issues that have significant impact on area, latency and power consumption. The goal of this paper is designing a fuzzy-based<br />routing algorithm for a NoC architecture with honeycomb topology. The proposed algorithm is a livelock and deadlock free routing algorithm based on fuzzy logic for hexagonal zones with flat triple coordinate system. The analysis of simulation results demonstrates that the proposed algorithm, provides higher performance in terms of latency, power consumption, throughput and area than a traditional fuzzy-based routing algorithm for mesh-based NoC architectures. Comparing to a non-fuzzy routing algorithm for honeycomb NoCs, the proposed scheme performs faster with higher throughput with a<br />negligible area and power consumption overhead.
Network-on-chip,Honeycomb topology,Fuzzy-based controller
https://cmde.tabrizu.ac.ir/article_9200.html
https://cmde.tabrizu.ac.ir/article_9200_760641550516b3967cb6de65ff54fd33.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
A priority-based service placement policy for Fog-Cloud computing systems
521
534
EN
Sadoon
Azizi
Department of Computer Engineering, Faculty of Engineering, University of Kurdistan
s.azizi@uok.ac.ir
Fariba
Khosroabadi
Department of Computer Engineering and IT, University of Qom, Qom, Iran
f.khosroabadi@stu.qom.ac.ir
Mohammad
Shojafar
Department of Computer Science,
Ryerson University, Toronto, Canada.
mohammad.shojafar@ryerson.ca
Recent advances in the context of Internet of Things (IoT) have led to the emergence of many useful IoT applications with different Quality of Service (QoS) requirements. The fog-cloud computing systems offer a promising environment to provision resources for IoT application services. However, providing an efficient solution to service placement problem in such systems is a critical challenge. To address this challenge, in this paper, we propose a QoS-aware service placement policy for fog-cloud computing systems that places the most delay-sensitive application services as closer to the clients as possible. We validate our proposed algorithm in the iFogSim simulator. Results demonstrate that our algorithm achieves significant improvement in terms of service latency and execution cost compared to simulators built-in policies.
Internet of Things (IoT),Fog-Cloud computing system,Quality-of-Service (QoS),Service placement,iFogSim
https://cmde.tabrizu.ac.ir/article_9201.html
https://cmde.tabrizu.ac.ir/article_9201_bbb4ca267d341679b0743632f7c45f50.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Mapping a new system for outdoor GSM signal strength
535
544
EN
Lway
Faisal
Abdulrazak
University Research Center, Computer Science Department,
Cihan University Sulaimaniya, Iraq
lway.faisal@sulicihan.edu.krd
Kusay
Faisal
Al-Tabatabaie
University Research Center, Computer Science Department, Cihan University Sulaimaniya, Iraq
kusay.faisal@sulicihan.edu.krd
<br />The Analysis of radio wave propagation is a crucial part in designing an efficient wireless communication system. The Geographic information system (GIS) can be incorporated into this procedure because most of the factors in radio wave propagation are geographic features. For reliable cellular mobile communication received signal level must be above the receiver sensitivity. Determining of network zone in which this requirement is satisfied is done in the phase of planning of the mobile network by using various methods of field strength prediction. In this Paper, a system for automatic measurement of signal level in Global System for Mobile Communication (GSM) 900/1800 MHz channel with Global Position System (GPS) localization is tested in a field driving test carried out in Suaimania City, Kurdistan Region, Iraq. The result indicates that through the use of GSM, GPS and GIS (G3) technologies a map could be developed and used to study the signal strength of a particular location. In addition, the multipath fading phenomena effect of the mobile radio coverage could be also analyzed based on the wireless communication principles.
GSM,Mobile networks,GIS,Signal strength
https://cmde.tabrizu.ac.ir/article_9202.html
https://cmde.tabrizu.ac.ir/article_9202_bf57c6472206abe5e47c7897534eb091.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Short message service remotely mobile device control
545
565
EN
Mustafa
Gh.
Saeed
University Research Center, Computer Science Department,
Cihan University Sulaimaniya, Iraq
mustafa.saeed@sulicihan.edu.krd
Kamaran
HamaAli. A.
Faraj
University Research Center, Computer Science Department, Cihan University Sulaimaniya and Lebanese French University, Iraq
kamaran.faraj@sulicihan.edu.krd
Amin
S.
Mohammed
Information Technology Dept,
Lebanese French University, Erbil, Iraq
kakshar@lfu.edu.krd
Azhee
W.
Muhamad
Computer Science Dept, Sulaimani University, Sulaimani, Iraq
azhee.muhamad@univsul.edu.iq
Chiai
Al-Atroshi
Information Technology Dept, Lebanese French University, Erbil, Iraq
chiai@lfu.edu.krd
Sherko
H.
Abdulrahman
Computer Science Dept, Sulaimani University, Sulaimani, Iraq
sherko.abdulrahman@univsul.edu.iq
<br />Nowadays; the use of mobile technology becomes part of the daily activity in our life. It’s impossible the advantage of any mobile instruments without disadvantage. The disadvantage of unprotected mobile is creating various problems. The most popular problem is that on mobile. Once the mobile owner has stored any personal data into own mobile phone device. It might be the personal data needed at a time such as (Forgetting, lost) anywhere. Furthermore, this makes the phone owner worry about all personal data and data face real danger from someone else because of stored personal data. The mobile device might be forgotten at home, work or anywhere, and the owner of the device unable to control the phone and very hard to reach stored data such as (Photos, Videos, Document files, Contact numbers, etc.). Our proposed application solves the subject matter that mentioned the remote control of Mobile using short messaging service (SMS) instead of the use of the Internet just in case the internet facility is not always available but the SMS availability of SMS is higher than the internet facility to change some of the mobile features. The suggested mobile application was modeling to designed and implemented to control mobile through using SMS only. The application can change ringing mode or send SMS containing mobile last location or also can search for a specific name in the contact names and send it to another mobile by analysing the incoming messages if the message contains specific message format (pin code, Action, reply). The suggested application was build and tested in the android operating system and in the real mobile device.
Mobile device control,Short message service,Broadcast receiver,Android permissions
https://cmde.tabrizu.ac.ir/article_9203.html
https://cmde.tabrizu.ac.ir/article_9203_5aa4185fe09dc8bce1d80f9e12b91dea.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Kurdish speaker identification based on one dimensional convolutional neural network
566
572
EN
Zrar
Khalid
Abdul
Department of applied computer,
Charmo University, Sulaymaniyah, Iraq
eng.zrar1394@gmail.com
Voice is one of the vital biometrics in human identification and/or verification area. In this paper, two different models are proposed for speaker identification which are a 1D convolutional neural network (CNN) and feature based model. In the feature based model, three global spectral based features including Mel Frequency Cepstral Coefficient (MFCC), Linear Prediction Code (LPC) and Local Binary pattern (LBP) are fed to an SVM and k-NN classifiers. Results show that MFCC is the best feature among the others. Consequently, local MFCC features is extracted from the framed signal and used to both the proposed models. The result shows that the local based MFCC improved the accuracy of the CNN based model.
Convolutional neural network,identification,Machine learing
https://cmde.tabrizu.ac.ir/article_9205.html
https://cmde.tabrizu.ac.ir/article_9205_6dc50eff64f11d5ab7cb9106194a91f1.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Some notions of $(\sigma, \tau)-$amenability for unitization of Banach algebras
573
579
EN
Eghbal
Ghaderi
Department of Mathematics, University of Kurdistan, Pasdaran Str., P. O. Box 416, Sanandaj, Iran
eg.ghaderi@uok.ac.ir
Saber
Naseri
Department of Mathematics, University of Kurdistan, Pasdaran Str., P. O. Box 416, Sanandaj, Iran
s.naseri@uok.ac.ir
Let $\mathcal A$ be a Banach algebra and $\sigma$ and $\tau$ be continuous endomorphisms on $\mathcal A$. In this paper, we investigate $(\sigma, \tau)-$amenability and<br />$(\sigma, \tau)-$weak amenability for unitization of Banach algebras, and also the relation between of them.<br />We introduce and study the concepts $(\sigma, \tau)-$trace extention property, $(\sigma, \tau)-I-$weak amenability and $(\sigma, \tau)-$ideal amenability for $\mathcal A$ and its unitization, where $I$ is a closed two-sided ideal in $\mathcal A$.
Convolutional neural network,identification,Machine learing
https://cmde.tabrizu.ac.ir/article_9206.html
https://cmde.tabrizu.ac.ir/article_9206_be620afb824433d40b99035ff0d2affb.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Using Legendre spectral element method with Quasi-linearization method for solving Bratu's problem
580
588
EN
Mahmoud
Lotfi
Department of Applied Mathematics, University of Kurdistan, Sanandaj, Iran
m.lotfi@sci.uok.ac.ir
Amjad
AliPanah
0000-0003-0503-3963
Department of Applied Mathematics, University of Kurdisatn
a.alipanah@uok.ac.ir
This work presented here is the solution of the one-dimensional Bratu’s problem. The nonlinear Bratu’s problem is first linearised using the quasi-linearization method and then solved by the spectral element method. We use the Legendre polynomials for interpolation. Finally we show the results with a numerical example.
Bratu's problem,Quasi-linearization,Spectral element method,Legendre polynomials
https://cmde.tabrizu.ac.ir/article_9207.html
https://cmde.tabrizu.ac.ir/article_9207_6ca3643e72007453764061ff4e553f35.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Stability and numerical approximation for a spacial class of semilinear parabolic equations on the Lipschitz bounded regions: Sivashinsky equation
589
600
EN
Mehdi
Mesrizadeh
Department of Mathematics, Imam Khomeini International University,Qazvin, IRAN.
mehdi.mesrizadeh@yahoo.com
Kamal
Shanazari
Department of mathematics,
University of Kurdistan, Sanandaj, Iran
k.shanazari@uok.ac.ir
This paper aims to investigate the stability and numerical approximation of the Sivashinsky equations. We apply the Galerkin meshfree method based on the radial basis functions (RBFs) to discretize the spatial variables and use a group presenting scheme for the time discretization. Because the RBFs do not generally vanish on the boundary, they can not directly approximate a Dirichlet boundary problem by Galerkin method. To avoid this difficulty, an auxiliary parametrized technique is used to convert a Dirichlet boundary condition to a Robin one. In addition, we extend a stability theorem on the higher order elliptic equations such as the biharmonic equation by the eigenfunction expansion.<br />Some experimental results will be presented to show the performance of the proposed method.<br /><br />
eigenvalue,Eigenfunction,Galerkin meshless method,Sivashinsky equation,Stability
https://cmde.tabrizu.ac.ir/article_9208.html
https://cmde.tabrizu.ac.ir/article_9208_7402408cf46500e9f5e2f568e39b4c66.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Automatic continuity of almost conjugate Jordan homomorphism on Fr$\acute{\text{e}}$chet $Q$-algebras
601
607
EN
Mohammad Reza
Omidi
Department of Basic Sciences,Kermanshah University of Technology, Kermanshah, Iran
m.omidi@kut.ac.ir
In this paper, the notation of almost conjugate Jordan homomorphism between Fr$\acute{\mathbf{\text{e}}}$chet algebras is introduced. It is proven that, under special hypotheses, every almost conjugate Jordan homomorphism on Fr$\acute{\mathbf{\text{e}}}$chet algebras is an (weakly) almost homomorphism. Also, the automatic continuity of them is generalized.
Almost conjugate Jordan homomorphism,Almost Jordan homomorphism,Almost homomorphism,Fr$\acute{\text{e}}$chet $Q$-algebras
https://cmde.tabrizu.ac.ir/article_9209.html
https://cmde.tabrizu.ac.ir/article_9209_676e9e1f9e15110f01d4db867bb74a8b.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Statistical inference for Functional data: two sample Behrens-Fisher problem
608
615
EN
Hassan
Sharghi Ghale-Joogh
Department of Statistics,
Shahid Beheshti University, Tehran, Iran
sharghi@sbu.ac.ir
<br />With modern technology development, functional data analysis (FDA) has received considerable recent attention in many scientific fields. The estimation of mean in FDA is of interest, because it is not only important by itself but it is a prelude to other issues such as dimension reduction and modeling of functional data<br />In this paper we construct a two-sample Behrens-Fisher problem when data are functions and obtain the asymptotic properties of the test statistic as data dimension increases with the sample size. The power of the proposed test is also investigated.<br />The proposed test used for inference about the differences in the mean temperature functions of the Western and the South-western weather stations of Iran.
Behrens-Fisher problem,Weather stations of Iran,Functional data,Increasing dimension
https://cmde.tabrizu.ac.ir/article_9210.html
https://cmde.tabrizu.ac.ir/article_9210_75a2626342f30f3b77ced65388581dd6.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
On eigenvalues of generalized shift linear vector isomorphisms
616
620
EN
Fatemeh
Ayatollah Zadeh Shirazi
Faculty of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
fatemah@khayam.ut.ac.ir
Elham
Soleimani
Faculty of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
elhamsolaimani73@gmail.com
Our main aim is to compute eigenvalues<br />of generalized shift isomorphism $\sigma_\varphi:V^\Gamma\to<br />V^\Gamma$ with $\sigma_\varphi((x_\alpha)_{\alpha\in\Gamma})=<br />(x_{\varphi(\alpha)})_{\alpha\in\Gamma}$ ($<br />(x_\alpha)_{\alpha\in\Gamma}\in V^\Gamma$) where $V$ is a<br />vector space (over field $F$), $\Gamma$ is a nonempty arbitrary set and $\varphi:\Gamma\to\Gamma$ is an arbitrary bijection.
eigenvalue,Generalized shift,Isomorphism
https://cmde.tabrizu.ac.ir/article_9211.html
https://cmde.tabrizu.ac.ir/article_9211_15fb7066f87b0974ea7b22610c2acf94.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Comparing present and accumulated value of annuities with different interest rates
621
625
EN
Sirous
Fathi Manesh
Department of Statistics, Faculty of Science,
University of Kurdistan, Sanandaj, Iran
Assume we have $k$ immediate (due)-annuities with different interest rates. Let ${\bf i}=(i_1,i_2,...,i_k)$ and ${\bf i^*}=(i^*_1,i^*_2,...,i^*_k)$ be two vectors of interest rates such that ${\bf i^*}$ is majorized by ${\bf i}$. It's shown that sum of present and accumulated value of annuities-immediate with interest rate ${\bf i}$ is grater than sum of present value of annuities-immediate with interest rate ${\bf i^*}$. We also prove the similar results for annuities-due.
Arithmetic mean,Majorization,Schur-convex function
https://cmde.tabrizu.ac.ir/article_9212.html
https://cmde.tabrizu.ac.ir/article_9212_2084fca9938317ba53a836d46dab28d0.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Using synthetic data and dimensionality reduction in high-dimensional classification via logistic regression
626
634
EN
Shaho
Zarei
Department of Statistics, Faculty of Science, University of Kurdistan, Sanandaj, Iran
sh.zarei@uok.ac.ir
Adel
Mohammadpour
Department of Statistics, Faculty of Mathematics and Computer
Science, Amirkabir University of Technology (Tehran Polytechnic),
Tehran, Iran
adel@aut.ac.ir
Traditional logistic regression is plugged with degenerates and violent behavior in high-dimensional classification, because of the problem of non-invertible matrices in estimating model parameters. In this paper, to overcome the high-dimensionality of data, we introduce two new algorithms. First, we improve the efficiency of finite population Bayesian bootstrapping logistic regression classifier by using the rule of majority vote. Second, using simple random sampling without replacement to select a smaller number of covariates rather than the sample size and applying traditional logistic regression, we introduce the other new algorithm for high-dimensional binary classification. We compare the proposed algorithms with the regularized logistic regression models and two other classification algorithms, i.e., naive Bayes and K-nearest neighbors using both simulated and real data.
High-dimensional classification,Logistic regression classifier,Dimensionality reduction,Random forest,Finite population Bayesian bootstrapping
https://cmde.tabrizu.ac.ir/article_9213.html
https://cmde.tabrizu.ac.ir/article_9213_abde6d1cb0a4f1719805ae9b433cfa97.pdf
University of Tabriz
Computational Methods for Differential Equations
2345-3982
2383-2533
7
Issue 4 (Special Issue)
2019
08
01
Using AHP to complex network analysis tools selection
635
645
EN
Rojiar
Pir Mohammadiani
Department of Computer Engineering, Faculty of Engineering, University of Kurdistan, Sanandaj, Iran
rojiar.py@gmail.com
The analysis of complex networks become more popular through the easily access of huge network data resources in the last years. Researchers have developed techniques and models to help understanding and predicting the behaviour of complex network systems. This advanced analysis is not possible without proper softwares and tools. A large number of tools are available with specific features for analysing and visualizing network systems and we can use a software or a set of suitable tools based on these features and capabilities for the project. Understanding the features of tools and softwares help to achieve better results from network analysis. In this paper, first we review the structure of different types of networks. Based on Wenjun paper, the complex networks are divided into four categories: information networks; social networks; Biological networks and Technological networks [23]. Then we define some functional indicators including: Basic Functionalities, Graph type Support, File Formats Support, Indicator Supports, Visualization Layouts Support, and Community Detection Support. In the next step, by using analytic hierarchical processing (AHP) and truly definable criteria try to evaluate main complex network analysis (CNA) softwares. Eventually, an opportunity is provided using AHP to identify, understand, and evaluate completely four main CNA softwares objectively before identifying and selecting the most efficient CNA software.
Complex network analysis,Analysis hierarchical processing,Complex network tools
https://cmde.tabrizu.ac.ir/article_9221.html
https://cmde.tabrizu.ac.ir/article_9221_33b515328b33462027ee25fb1c0123a7.pdf