eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
1
8
10.22060/miscj.2015.542
542
SFLA Based Gene Selection Approach for Improving Cancer Classification Accuracy
Jamshid Pirgazi
j.pirgazi@znu.ac.ir
1
Ali Reza Khanteymoori
khanteymoori@gmail.com
2
University of Zanjan Department of Computer Engineering Zanjan, Iran
University of Zanjan Department of Computer Engineering Zanjan, Iran
In this paper, we propose a new gene selection algorithm based on Shuffled Frog Leaping Algorithm that is called SFLA-FS. The proposed algorithm is used for improving cancer classification accuracy. Most of the biological datasets such as cancer datasets have a large number of genes and few samples. However, most of these genes are not usable in some tasks for example in cancer classification. Therefore, selection of the appropriate genes is important in bioinformatics and machine learning. The proposed method combines the advantage of wrapper and filter methods for gene subset selection. SFLA-FS consists of two phases. In the first phase a filter method is used for gene ranking from high dimensional microarray data and in the second phase, SFLA is applied to gene selection. The performance of SFLA-FS evaluated for cancer classification using seven standard microarray cancer datasets. Experimental results are compared with those of obtained from several existing well-known gene selection algorithm. The experimental results show that SFLA-FS has a remarkable ability to generate reduced size of genes while yielding significant classification accuracy in cancer classification.
http://miscj.aut.ac.ir/article_542_4e2a9aa10e1406551bb9b2b4154a1053.pdf
Bioinformatics
Cancer Classification
gene Selection
SFLA
Microarray Data
eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
9
20
10.22060/miscj.2015.543
543
A New Near Optimal High Gain Controller For The Non-Minimum Phase Affine Nonlinear Systems
Hoda N. Foghahaayee
1
Mohammad B. Menhaj
2
Heidar A. Talebi
3
Assistant Professor, Department of Electrical Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran
Professor, Department of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran
Professor, Department of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran
In this paper, a new analytical method to find a near-optimal high gain controller for the non-minimum phase affine nonlinear systems is introduced. This controller is derived based on the closed form solution of the Hamilton-Jacobi-Bellman (HJB) equation associated with the cheap control problem. This methodology employs an algebraic equation with parametric coefficients for the systems with scalar internal dynamics and a differential equation for those systems with the internal dynamics of order higher than one. It is shown that 1) if the system starts from different initial conditions located in the close proximity of the origin the regulation error of the closed-loop system with the proposed controller is less than that of the closed-loop system with the high gain LQR, which is surely designed for the linearized system around the origin, 2). for the initial conditions located in a region far from the origin, the proposed controller significantly outperforms the LQR controller.
http://miscj.aut.ac.ir/article_543_9fcceb3e1d8a7a3118f720fdd22e1b0f.pdf
Non-Minimum Phase
Nonlinear Systems
Cheap Control
Optimal Controller
Hamilton-Jacobi-Bellman Equation (HJB)
eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
21
32
10.22060/miscj.2015.544
544
Developing Robust Project Scheduling Methods for Uncertain Parameters
I. Bossaghzadeh
1
S. R. Hejazi
2
Z. Pirmoradi
3
MSc of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran
Professor of Industrial Engineering, Isfahan University of Technology, Isfahan, Iran
PhD of Product Design and Optimization Lab, Simon Fraser University, Surrey, Canada
A common problem arising in project management is the fact that the baseline schedule is often disrupted during the project execution because of uncertain parameters. As a result, project managers are often unable to meet the deadline time of the milestones. Robust project scheduling is an effective approach in case of uncertainty. Upon adopting this approach, schedules are protected against possible disruptions that may occur during project execution. In order to apply robust scheduling principles to real projects, one should make assumptions close to the actual conditions of the project as much as possible. In this paper, in terms of uncertainty in both activities duration and resources availability, some methods are proposed to construct the robust schedules. In addition, various numerical experiments are applied to different problem types with the aid of simulation. The main purpose of those is to assess the performance of robust scheduling methods under different conditions. Finally, we formulate recommendations regarding the best method of robust scheduling based on the results of these experiments.
http://miscj.aut.ac.ir/article_544_334238d446a312022c05d16a9787cc0c.pdf
Project Scheduling
Uncertainty Modeling
Robustness
Simulation
eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
33
40
10.22060/miscj.2015.545
545
Peaking Attenuation in High-Gain Observers Using Adaptive Saturation: Application to a Ball and Wheel System
S. D. Yazdi Mirmokhalesouni
1
M. J. Yazdanpanah Yazdanpanah
2
Advanced Control Systems Lab, Control and Intelligent Processing Center of Excellence (CIPCE) at School of Electrical and
Computer Engineering, College of Engineering, University of Tehran, Tehran, Iran.
Despite providing robustness, high-gain observers impose a peaking phenomenon, which may cause instability, on the system states. In this paper, an adaptive saturation is proposed to attenuate the undesirable mentioned phenomenon in high-gain observers. A real-valued and differentiable sigmoid function is considered as the saturating element whose parameters (height and slope) are adaptively tuned. The corresponding feedback and adaptation laws are derived based on the Lyapunov and LaSalle theorems to guarantee the asymptotic stability property for the closed-loop system’s equilibrium point. Compared to the conventional high-gain observers which suffer from states’ peaking, it is possible to increase the observer’s gain, up to a higher level, under which not only all system states and the adaptive saturation elements remain stable, but also robustness is reinforced in the presence of uncertainties and/or non-similarities in the system and observer’s dynamics, respectively. Both theoretical analysis and simulation results confirm the efficiency of the proposed scheme.
http://miscj.aut.ac.ir/article_545_cd44e0048aae526d2f448d9de254f0ff.pdf
High-gain Observer
Adaptive Saturation
Lyapunov Stability
eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
41
53
10.22060/miscj.2015.546
546
A New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Najme Mansouri
1
Department of Computer Science, Shahid Bahonar University of Kerman, Kerman, Iran
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data-intensive or computation-intensive. However, only considering one kind of jobs in scheduling does not result in suitable scheduling in the viewpoint of all systems, and sometimes causes wasting of resources on the other side. To address the challenge of simultaneously considering both kinds of jobs, a new Integrated Job Scheduling Strategy (IJSS) is proposed in this paper. At one hand, the IJSS algorithm considers both data and computational resource availability of the network, and on the other hand, considering the corresponding requirements of each job, it determines a value called W to the job. Using the W value, the importance of two aspects (being data or computation intensive) for each job is determined, and then the job is assigned to the available resources. The simulation results with OptorSim show that IJSS outperforms comparing to the existing algorithms mentioned in literature as number of jobs increases.
http://miscj.aut.ac.ir/article_546_64c3d087030b308d78beceedd2210185.pdf
Data Grid
Scheduling
Access Pattern
Simulation
eng
Amirkabir University of Technology
AUT Journal of Modeling and Simulation
2588-2953
2588-2961
2015-05-22
47
1
55
65
10.22060/miscj.2015.547
547
Magnetic Calibration of Three-Axis Strapdown Magnetometers for Applications in Mems Attitude-Heading Reference Systems
Hamed Milanchian
hamed.milanchian@gmail.com
1
Jafar Keighobadi
jkeighobadi@tabrizu.ac.ir
2
Hossein Nourmohammadi
hnourmohammadi@tabrizu.ac.ir
3
Department of Mechanical Engineering, University of Tabriz, Tabriz, Iran
Department of Mechanical Engineering, University of Tabriz, Tabriz, Iran
Department of Mechanical Engineering, University of Tabriz, Tabriz, Iran
In a strapdown magnetic compass, heading angle is estimated using the Earth's magnetic field measured by Three-Axis Magnetometers (TAM). However, due to several inevitable errors in the magnetic system, such as sensitivity errors, non-orthogonal and misalignment errors, hard iron and soft iron errors, measurement noises and local magnetic fields, there are large error between the magnetometers' outputs and actual geomagnetic field vector. This is the necessity of magnetic calibration of TAM, especially in navigation application to achieve the true heading angle. In this paper, two methodologies, including clustering swinging method and clustering velocity vector method are presented for magnetic compass calibration. Several factors for clustering process have been introduced and analyzed. The algorithms can be applied in both low-cost MEMS magnetometer and high-accuracy magnetic sensors. The proposed calibration algorithms have been evaluated using in-ground and in-flight tests. It can be concluded from the experimental results that, applying the clustering calibration algorithms bring about a considerable enhancement in the accuracy of magnetic heading angle
http://miscj.aut.ac.ir/article_547_f9dbfe47f53936796d67b88c4d2a02ad.pdf
Magnetic Calibration
Magnetic heading angle
clustering calibration method
Swinging method
Velocity vector method