]>
2014
9
3
91
Equilibrium Problems and Minimax Inequalities for Mappings with Noncompact Domain
Equilibrium Problems and Minimax Inequalities for Mappings with Noncompact Domain
en
en
In this paper we consider equilibrium problem and introduce minimization problem such as equilibrium problem. We also investigated minimax inequalitiy of Ky Fan and we proved a minimax inequality of mapping with non-compact domain by using the coincidence theorem, then given a minimax inequality for mappings with noncompact domain. As its direct consequences some minimax inequalities and minimax theorems are obtained.
157
164
Mahdiyeh
Farshidzad
Equilibrium problem
Minimax theorem
Ky Fan’s inequality
Noncompact domain.
Article.1.pdf
[
[1]
F. E. Browder, Coincidence theorems, minimax theorems and variational inequalities, Contemp. Math., Amer Math. Soc., Providence, 26 (1984), 67-80
##[2]
O. Chadil, Z. chbaniz, H. Riahi, Equilibium problems with Generalized MonotonBifunctions and Applications to Variational Inequalities, Journal of Optimization Theory and Applications, 105 (2000), 299-323
##[3]
C. W. Ha, Minimax and fixed point theorems, Math. Ann., 248 (1980), 73-77
##[4]
H. Komiya, coincidence theorem and saddle point theorem, proc. Amer. Math. soc. , 96 (1986), 599-602
##[5]
E. Tarafdar, X. Z. Yuan, A remark on coincidence theorems , proc. Amer .soc., 122 (3) (1994), 957-959
##[6]
E. Tarafdar, P. J. Watson, A coincidence point theorem and related results, Appl. Math .let., 11 (1) (1998), 37-40
##[7]
H. J. Zhang, Minimax Inequalities of Key Fan, Apple math. soc , 99 (1987), 980-682
]
Fuzzy Mathematical Modeling of Distribution Network Through Location Allocation Model in a Three-level Supply Chain Design
Fuzzy Mathematical Modeling of Distribution Network Through Location Allocation Model in a Three-level Supply Chain Design
en
en
Economic roles in all areas particularly in the steel industry have been grown dramatically. In this article, a new look to the field of mathematical modeling of distributed systems in terms of fuzzy location model and the theory of fuzzy has been allocated and an integer linear programming is used. The distribution system generally includes three levels so that the first level suppliers of iron ore, mining, steel and so on are placed. The second level involves locating distribution centers consider so that a limited number of distribution centers can serve as stations and the third level of local warehouses or factories in steel production are using the integer programming technique, a fuzzy mathematical model for distributed systems is presented. The second level of distribution center location selection techniques based on Fuzzy Analytical Hierarchy Process (FAHP) is proposed and its output as input in integer programming model is used. It's worth mentioning presented model is analyzed by software of maple 12.
165
174
Mohsen Momeni
Tabar
Navid
Akar
Danial
Zaghi
Hamid Reza
Feili
Mitra
Ghaderi
Mathematical Modeling
Integer Linear Programming
Distribution System
Fuzzy Analytical Hierarchy Process (FAHP).
Article.2.pdf
[
[1]
V. Marianov, C. ReVelle, , European Journal of Operational Research , 93 (1996), 110-120
##[2]
H. Shavandi, H. Mahlouji, , International Journal of Industrial Engineering , 11 (2004), 364-376
##[3]
J. A. Morenoperez, J. M. Moreno Vega, J. L. Verdegay, , J. Fuzzy Sets and Systems , 142 (2004), 393-405
##[4]
H. J. Zimmermann, Fuzzy Set Theory and its Applications, Kluwer Academic Publisher, Boston (1996)
##[5]
V. Marianov, D. Serra , , J. Regional Science, 38 (1998), 401-424
##[6]
F. Moghadasi, H. Taghizadehkakhki, Advances in Decision Sciences, doi:10.1155/2011/605629, (2011)
##[7]
H. Shavandi, H. Mahloujietal, , Iranian Journal of Operations Research , 13 (2006), 14-24
##[8]
S. S. Syam , , J. Computers & Operations Research , 35 (2008), 2248-2265
##[9]
F. Amir , , J. Economics and Behavioral Studies , 3 (2011), 287-295
##[10]
M. T. Melo, S. Nickel, F. Saldanha-da-Gama, , European Journal of Operational Research , 196 (2009), 401-12
##[11]
W. Dullaert, O. Braysy, M. Goetschalckx, B. Raa, , European Journal of Transport and Infrastructure Research , 7 (2007), 73-91
##[12]
L. V. Snyder, , J. Transactions , 38 (2006), 547-564
##[13]
R. ZanjiraniFarahani, M. SteadieSeifi, N. Asgari, , J. Applied Mathematical Modelling , 34 (2010), 1689-1709
##[14]
H. Rajabalipour Cheshmehgaz, M. IshakDesa, A. Wibowo, , J. Intelligent Manufacturing DOI 10.1007/s10845-011-0584-7 , (2011)
##[15]
A. Amiri, , European Journal of Operational Research, 171 (2006), 567-576
##[16]
F. Altiparmak, M. Gen, L. Lin, T. Paksoy, , J. Computers and Industrial Engineering , 51 (2006), 197-216
##[17]
P. N. Thanh, N. Bostel, O. Péton, , International Journal of Production Economics , 113 (2008), 678-693
##[18]
F. Pan, R. Nagi, , J. Computers and Operations Research , 37 (2010), 668-683
##[19]
T. L. Saaty, , the Analytic Hierarchy Process, McGraw-Hill, New York (1980)
##[20]
T. C. Wang, Y. H. Chen, , International Journal of Management Science , 35 (2007), 384-388
##[21]
N. Y. Secme, A. Bayrakdaroglu, C. Kahraman, , J. Experts Systems and Applications, 36 (2009), 11699-11709
##[22]
C. Kahraman, U. Cebeci, Z. Ulukan, , J. Logistics Information Management , 16 (2003), 382-394
##[23]
P. M. J. Laarhoven, W. Pedrycz, , J. Fuzzy Sets and Systems, 11 (1983), 229-241
##[24]
J. J. Buckley, , J. Fuzzy Sets and Systems , 17 (1985), 233-247
##[25]
D. Y. Chang, , European Journal of Operational Research , 95 (1996), 649-655
##[26]
C. Kahraman, Z. Ulukan, E. Tolga, a Fuzzy Weighted Evaluation Method Using Objective and Subjective Measures, Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems, (1998)
##[27]
O. Kulak, C. Kahraman, , J. Information Sciences , 170 (2005), 191-210
]
Numerical Solution for Nonlinear-quadratic Switching Control Systems with Time Delay
Numerical Solution for Nonlinear-quadratic Switching Control Systems with Time Delay
en
en
This paper contributes an efficient numerical approach for optimal control of switched system with time delay via Bezier curves. A simple transformation is first used to map the optimal control problem with varying switching times into a new optimal control problem with fixed switching times. Then, the Bezier curves is used to approximate the optimal control problem a NLP. The NLP could be solved by using known algorithms.
175
187
Fateme
Ghomanjani
Mohammad Hadi
Farahi
Ali Vahidian
Kamyad
switched systems
Bezier control points
time delay systems
dynamical system.
Article.3.pdf
[
[1]
J. V. Beltran, J. Monterde, Bezier solutions of the wave equation, Lecture notes in Computational Sciences, Computational Science and its Applications-ICCSA (A. Laganà, M. L. Gavrilova, V. Kumar, Y. Mun, C. J. K.Tan & O. Gervasi eds). Lecture Notes in Computer Science, Berlin: Springer, 3044 (2004), 631-640
##[2]
A. Bemporad, A. Giua, C. Seatzu, Synthesis of state-feedback optimal controllers for continuous-time switched linear systems, In Proc. 41st IEEE conference on decision and control, Las Vegas, Nevada USA (2002)
##[3]
R. Cholewa, A. J. Nowak, R. A. Bialecki, L. C. Wrobel, Cubic Bezier splines for BEM heat transfer analysis of the 2-D continuous casting problems, Computational Mechanics, 28 (2002), 282-290
##[4]
C. H. Chu, C. C. L. Wang, C. R. Tsai, Computer aided geometric design of strip using developable Bezier patches, Computers in Industry, 59 (2008), 601-611
##[5]
M. Egerstedt, Y. Wardi, F. Delmotte, Optimal control of switching times in switched dynamical systems, In Proc. IEEE conference on decision and control, 3 (2003), 2138-2143
##[6]
M. Evrenosoglu, S. Somali, Least squares methods for solving singularly perturbed two-point boundary value problems using Bézier control points, Applied Mathematics Letters, 21 (2008), 1029-1032
##[7]
G. E. Farin, Curve and surfaces for computer aided geometric design, First ed, Academic Press, New York (1988)
##[8]
B. Farhadinia, K. L. Teo, R. C. Loxton, A computational method for a class of non-standard time optimal control problems involving multiple time horizons, Mathematical Computer Modelling, 49 (2009), 1682-1691
##[9]
M. Gachpazan, Solving of time varying quadratic optimal control problems by using Bezier control points, Computational and Applied Mathematics, 30 (2011), 367-379
##[10]
J. Geromela, P. Colaneri, P. Bolzern, Passivity of switched linear systems: Analysis and control design, Systems and Control Letters, 61 (2012), 549-554
##[11]
F. Ghomanjani, M. H. Farahi, The Bezier control points method for solving delay differential equation, Intelligent Control and Automation, 3 (2012), 188-196
##[12]
F. Ghomanjani, M. H. Farahi, M. Gachpazan, Bezier control points method to solve constrained quadratic optimal control of time varying linear systems, Computational and Applied Mathematics, 31 (2012), 1-24
##[13]
A. Giua, C. Seatzu, C. Van Der Me, Optimal conrol of switched autonomous linear systems, In Proc. IEEE conference on decision and control, (2001), 2472-2477
##[14]
K. Harada, E. Nakamae, Application of the Bezier curve to data interpolation, Computer-Aided Design, International Journal of Computer Mathematics, 14 (1982), 55-59
##[15]
M. Heinkenschloss, A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems, Applied Mathematics and Computation, 173 (2005), 169-198
##[16]
I. Hwang, J. Li, D. Du, A numerical algorithm for optimal control of a class of hybrid systems: differential transformation based approach, International Journal of Control, 81 (2008), 277-293
##[17]
H. Juddu, Spectral method for constrained linear-quadratic optimal control, Mathematics Computers In simulation, 58 (2002), 159-169
##[18]
B. Lang, The synthesis of wave forms using Bezier curves with control point modulation, In: The Second CEMS Research Student Conference, 1st edn. Morgan kaufamann, San Francisco (2004)
##[19]
A. T. Layton, M. Van de Panne, A numerically evident and stable algorithm for animating water waves, The visual Computer, 18 (2002), 41-53
##[20]
M. Kamgarpour, C. Tomlin, On optimal control of non-autonomous switched systems with a fixed mode sequence, Automatica, 48 (2012), 1177-1181
##[21]
M. Margaliot, Stability analysis of switched systems using variational principles: An introduction, Automatica, 42 (2006), 2059-2077
##[22]
B. Niua, J. Zhaoa, Stabilization and \(L_2\)-gain analysis for a class of cascade switched nonlinear systems: An average dwell-time method, Nonlinear Analysis: Hybrid Systems, 5 (2001), 671-680
##[23]
G. Nürnberger, F. Zeilfelder, Developments in bivariate spline interpolation, Journal of Computational and Applied Mathematics, Computers and Mathematics with Applications, 121 (2000), 125-152
##[24]
H. Prautzsch, W. Boehm, M. Paluszny, Bezier and B-Spline Techniques, Springer, (2001)
##[25]
Y. Q. Shi, H. Sun, Image and video compression for multimedia engineering, CRC Press LLc, (2000)
##[26]
R. Winkel, Generalized Bernstein Polynomials and Bezier Curves: An Application of Umbral Calculus to Computer Aided Geometric Design, Advances in Applied Mathematics, 27 (2001), 51-81
##[27]
C. Wu, K. L. Teo, R. Li, Y. Zhao, Optimal control of switched systems with time delay, Appl, Math. Letters, 19 (2006), 1062-1067
##[28]
X. Xu, G. Zhai, S. He, Some results on practical stabilizability of discrete-time switched affine systems, Nonlinear Analysis: Hybrid Systems, 4 (2010), 113-121
##[29]
X. Xu, P. J. Antsakalis, Optimal control of switched systems based on parameterization of the switching instants, IEEE Transactions on Automatic Control, 49 (2004), 2-16
##[30]
J. Zheng, T. W. Sederberg, R. W. Johnson, Least squares methods for solving differential equations using Bezier control points, Applied Numerical Mathematics, 48 (2004), 237-252
]
Model Reduction by Hermite Polynomials and Genetic Algorithm
Model Reduction by Hermite Polynomials and Genetic Algorithm
en
en
The present paper attempts to develop order reduction methods where the suggested reduction model consists of two phases. First, full order system is expanded by Hermite polynomials, then a set of parameters in a fixed structure are determined, whose values define the reduced order system. The values are obtained using Genetic Algorithm (GA) by minimizing the errors between the l first coefficients of Hermite polynomials expansion of full and reduced systems. To satisfy the stability, Routh criterion is used as constraints in optimization problem. To present the ability of the proposed method, three test systems are reduced. The results obtained are compared with other existing techniques. The results obtained show the accuracy and efficiency of the proposed method.
188
202
Hasan Nasiri
Soloklo
Omid
Nail
Malihe M.
Farsangi
Hermite polynomials
genetic algorithm
Routh array
order reduction
stability constraints.
Article.4.pdf
[
[1]
E. J. Davison, A Method for Simplifying Linear Dynamic Systems, IEEE Transactions on Automatic Control, 11 (1966), 93-101
##[2]
M. R. Chidambara, Further Comments by M.R. Chidambara, IEEE Transactions on Automatic Control, 1 (1967), 799-800
##[3]
E. J. Davison, Further Reply by E.J. Davison, IEEE Transactions on Automatic Control, 12 (1967), 1-800
##[4]
M. R. Chidambara, Two simple techniques for the simplification of large dynamic systems, Proc. Joint Automatic Control Conf, (1969), 669-674
##[5]
Z. Elrazaz, N. K. Sinha, On the Selection of Dominant Poles of a System to be Retained in a Low-Order Model, IEEE Transactions on Automatic Control, 24 (1979), 792-793
##[6]
M. Hutton, B. Friedland, Routh Approximations for Reducing Order of Linear, Time-Invariant Systems, IEEE Transactions on Automatic Control, 20 (3) (1975), 329-337
##[7]
R. K. Appiah, Linear Model Reduction Using Hurwitz Polynomial Approximation, International Journal of Control, 28 (1978), 477-488
##[8]
R. K. Appiah, Pade Methods of Hurwitz Polynomial with Application to Linear System Reduction, International Journal of Control, 29 (1979), 39-48
##[9]
T. C. Chen, C. Y. Chang, K. W. Han, Reduction of Transfer Functions by the Stability Equation Method, Journal of the Franklin Institute, 308 (1979), 389-404
##[10]
T. C. Chen, C. Y. Chang, K. W. Han, Model Reduction Using the Stability Equation Method and the Continued Fraction Method, International Journal of Control, 21 (1980), 81-94
##[11]
L. G. Gibilaro, F. P. Lees, The Reduction of Complex Transfer Function Models to Simple Models Using the Method of Moments , Chemical Engineering Science, 24 (1969), 85-93
##[12]
F. P. Lees, The Derivation of Simple Transfer Function Models of Oscillating and Inverting Process from the Basic Transformed Equation Using the Method of Moments, Chemical Engineering Science, 26 (1971), 1179-1186
##[13]
Y. P. Shih, C. S. Shieh, Model Reduction of Continuous and Discrete Multivariable Systems by Moments Matching, Computer & System. Engineering, 2 (1978), 127-132
##[14]
V. Zakian, Simplification of Linear Time-Invariant System by Moment Approximation, International Journal of Control, 18 (1973), 455-460
##[15]
C. F. Chen, L. S. Shieh, A Novel Approach to Linear Model Simplification, International Journal of Control, 8 (1968), 561-570
##[16]
C. F. Chen , Model Reduction of Multivariable Control Systems by Means Matrix Continued Fractions, International Journal of Control, 20 (1974), 225-238
##[17]
D. J. Wright, The Continued Fraction Representation of Transfer Functions and Model Simplification, International Journal of Control, 18 (1973), 449-454
##[18]
Y. Shamash, Stable Reduced-Order Models Using Pade Type Approximation, IEEE Transactions on Automatic Control, 19 (1974), 615-616
##[19]
D. A. Wilson, Optimal Solution of Model Reduction Problem, Proc. IEEE. , 117 (6) (1970), 1161-1165
##[20]
D. A. Wilson, Model Reduction for Multivariable Systems, International Journal of Control, 20 (1978), 57-64
##[21]
G. Obinata, H. Inooka, A Method of Modeling Linear Time-Invariant Systems by Linear Systems of Low Order, IEEE Transactions on Automatic Control, 21 (1976), 602-603
##[22]
G. Obinata, H. Inooka, Authors Reply to Comments on Model Reduction by Minimizing the Equation Error, IEEE Transactions on Automatic Control, 28 (1983), 124-125
##[23]
E. Eitelberg, Model Reduction by Minimizing the Weighted Equation Error, International Journal of Control, 34 (6) (1981), 1113-1123
##[24]
R. A. El-Attar, M. Vidyasagar, Order Reduction by \(L_1\) and \(L_{\infty}\) Norm Minimization, IEEE Transactions on Automatic Control, 23 (4) (1978), 731-734
##[25]
B. C. Moore, Principal Component Analysis in Linear Systems: Controllability, Observability and Model Reduction, IEEE Transactions on Automatic Control, 26 (1981), 17-32
##[26]
L. Pernebo, L. M. Silverman, Model Reduction via Balanced State Space Representation, IEEE Transactions on Automatic Control, 27 (2) (1982), 382-387
##[27]
D. Kavranoglu, M. Bettayeb, Characterization of the Solution to the Optimal \(H_{\infty}\) Model Reduction Problem, Systems and Control Letters, 20 (1993), 99-107
##[28]
L. Zhang, J. Lam, On \(H_2\) Model Reduction of Bilinear System, Automatica, 38 (2002), 205-216
##[29]
W. Krajewski, A. Lepschy, G. A. Mian, U. Viaro, Optimality Conditions in Multivariable \(L_2\) Model Reduction, Journal of the Franklin Institute, 330 (3) (1993), 431-439
##[30]
D. Kavranoglu, M. Bettayeb, Characterization and Computation of the Solution to the Optimal \(L_{\infty}\) Approximation Problem, IEEE Transactions on Automatic Control, 39 (1994), 1899-1904
##[31]
G. Parmar, S. Mukherjee, R. Prasad , Reduced Order Modeling of Linear Dynamic Systems using Particle Swarm Optimized Eigen Spectrum Analysis, International Journal of Computer and Mathematic Science, 1 (1) (2007), 45-52
##[32]
G. Parmer, R. Prasad, S. Mukherjee, Order Reduction of Linear Dynamic Systems using Stability Equation Method and GA, World Academy of Science, Engineering and Technology, 26 (2007), 72-78
##[33]
Hasan Nasiri Soloklo, M. Maghfoori Farsangi , Multi-Objective Weighted Sum Approach Model Reduction by Routh-Pade Approximation Using Harmony Search, Turkish journal of Electrical Engineering and Computer Science, 21 (2013), 2283-2293
##[34]
S. Panda, J. S. Yadav, N. P. Padidar, C. Ardil, Evolutionary Techniques for Model Order Reduction of Large Scale Linear Systems, International Journal of Applied Science Engineering Technology, 5 (2009), 22-28
##[35]
G. Parmar, M. K. Pandey, V. Kumar, System Order Reduction Using GA for Unit Impulse Input and a Comparative Study Using ISE and IRE, International Conf. Advance in computing, communications and control, Mumbai, India (2009)
##[36]
R. Salim, M. Bettayeb, \(H_2\) and \(H_{\infty}\) Optimal Reduction Using Genetic Algorithm, Journal of the Franklin Institute, 348 (2011), 1177-1191
##[37]
H. Nasiri Soloklo, M. Maghfoori Farsangi, Chebyshev Rational Functions Approximation for Model Order Reduction Using Harmony Search, Scientia Iranica, 30 (3) (2013), 771-777
##[38]
E. Kreyszig, Advanced Engineering Mathematics, John Wiley, New York (1999)
##[39]
M. Vatani, M. Asghari, Gh. Vakili-Nezhaad, Application of Genetic Algorithm to Parameter Estimation in Liquid-Liquid Phase Equilibrium Modeling, The Journal of Mathematics and Computer Science, 5 (1) (2012), 60-66
##[40]
V. Singh , Obtaining Routh-Pade Approximants using the Luus-Jaakola Algorithm, IEE Proceeding, Control Theory and Applications, 152 (2) (2005), 129-132
##[41]
S. Mukherjee, Satakhshi, R. C. Mittal, Model Order Reduction Using Response- Matching Technique, Journal of the Franklin Institute, 342 (2005), 503-519
##[42]
S. Skogestad, I. Postethwaite , Multivariable Feedback Control, Analysis and Design, John Wiley (1996)
]
Convergence Analysisof Gradient Based Iterative Algorithm for Solving Pde Constrained Optimization Problems
Convergence Analysisof Gradient Based Iterative Algorithm for Solving Pde Constrained Optimization Problems
en
en
In this paper, by considering distributed optimal control over a PDE, a gradient based iterative Algorithm is proposed for solving is proposed and analyzed. Galerkin finite element method is used for solving underlying PDE, then the adjoint base technique for derivative computation to implementation of the optimal control issue in preconditioned Newton's conjugate gradient method isused. The interface and connection between quadratic programming extracted from discretizing the problem and Newton's type method, as well as the convergence rate of the algorithm in each iteration is established. Updating control values at discretization points in each iteration yields optimal control of the problem, where the corresponding state values at these points approximate the desired function. Numerical experiments are presented for illustrating the theoretical results.
203
215
R.
Naseri
A.
Malek
Diffusion equation
optimal control problem
finite element method
Newton's conjugate gradient method.
Article.5.pdf
[
[1]
S. R. Arridge , Optical tomography in medical imaging, Inverse Problems, 15 (1999), 1-41
##[2]
I. Bouchouev, V. Isakov, Uniqueness, stability and numerical methods for the inverse problem that arises in financial markets, Inverse Problems, 15 (1999), 1-95
##[3]
B. Dupire, Pricing with a smile, Risk, 7 (1994), 32-39
##[4]
H. Egger, H. W. Engl, Tikhonov regularization applied to the inverse problem of option pricing: convergence analysis and rates, Inverse Problems, 21 (2005), 1027-1045
##[5]
A. Fakharzadeh, S. Hashem, Solving a Class of Nonlinear Optimal Control Problems by Differential Transformation Method, Journal of mathematics and computer science, 5 (2012), 146-152
##[6]
M. Gunzburger, Perspectives in Flow Control and Optimization, SIAM, (1987. )
##[7]
Howard Elman, David Silvester, Andy Wathen, Finite Elements and Fast Iterative Solvers with Applications in incompressible fluid dynamics, Numerical Mathematics and Scientific Computation, Oxford University Press, Oxford (2005)
##[8]
Heinkenschloss, H. Nguyen, Neumann-Neumann domain decomposition preconditioners for linearquadratic elliptic optimal control problems, SIAM Journal on Scientific Computing, 28 (2006), 1001-1028
##[9]
C. T. Kelley, Iterative Methods for Optimization, SIAM, Philadelphia (1999)
##[10]
M. V. Klibanov, T. R. Lucas, Numerical solution of a parabolic inverse problem in optical tomography using experimental data, SIAM J. Appl. Math., 59 (1999), 1763-1789
##[11]
C. D. Laird, L. T. Biegler, B. Waanders, R. A. Bartlett, Time dependent Contaminant source determination for municipal water networks using large scale optimization, ASCE J. Water Res. Mgt. Plan., 131 (2005), 125-134
##[12]
J. Nocedal, S. J. Wright, Numerical Optimization , Springer Verlag, Berlin, Heidelberg, second edition, New York (2006)
##[13]
C. Orozco, O. Ghattas, Massively parallel aerodynamic shape optimization, Comp. Syst. Eng., 1 (1992), 311-320
##[14]
T. Rees, H. S. Dollar, A. J. Wathen, Optimal solvers for PDE-constrained optimization, SIAM J. Sci. Comput., 32 (2010), 271-298
##[15]
A. Shenoy, M. Heinkenschloss, E. M. Cliff, Airfoil design by an all-at-once method, Int. J. Comput. Fluid Dyn., 11 (1998), 3-25
##[16]
A. J. Wathen, Realistic eigenvalue bounds for the Galerkin mass matrix, IMA J Numer Anal, 7(4) (1987), 449-457
##[17]
A. Zakeri, M. Masjed-Jamei, A. H. Salehi Shayegan, A Numerical Method for Optimal Control-State Problem with Bivariate B-Spline Basis, Journal of mathematics and computer science, 8 (2014), 335-342
##[18]
E. Zeidler, Nonlinear Functional Analysis and Its Applications. I, Fixed-Point Theorems. Springer, Berlin (1986)
]
Presenting a Hybrid Feature Selection Method Using Ig and Svm Wrapper for E-mail Spam Filtering
Presenting a Hybrid Feature Selection Method Using Ig and Svm Wrapper for E-mail Spam Filtering
en
en
The growing volume of spam emails has resulted in the necessity for more accurate and efficient email classification system. The purpose of this research is presenting an machine learning approach for enhancing the accuracy of automatic spam detecting and filtering and separating them from legitimate messages. In this regard, for reducing the error rate and increasing the efficiency, the hybrid architecture on feature selection has been used. Features used in these systems, are the body of text messages. Proposed system of this research has used the combination of two filtering models, Filter and Wrapper, with Information Gain (IG) filter and Support Vector Machine (SVM) wrapper as feature selectors. In addition, MNB classifier, DMNB classifier, SVM classifier and Random Forest classifier are used for classification. Finally, the output results of this classifiers and feature selection methods are examined and the best design is selected and it is compared with another similar works by considering different parameters. The optimal accuracy of the proposed system is evaluated equal to 99%.
216
227
Seyed Mostafa
Pourhashemi
Alireza
Osareh
Bita
Shadgar
Feature Selection
Classification
Spam Filtering
Machine Learning.
Article.6.pdf
[
[1]
I. Androutsopoulos, J. Koutsias, K. V. Chandrinos, C. D. Spyropoulos, An experimental comparison of naive bayesian and keyword-based anti-spam filtering with personal e-mail messages, Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval, New York, NY, USA, (2000), 160-167
##[2]
, Spam Abuse Corporation, <http://spam.abuse.net/overview/whatisspam.shtml>, Visited in 2013. , (2013)
##[3]
K. Tretyakov, Machine Learning Techniques in Spam Filtering, Data Mining Problem-Oriented Seminar, (2004), 62-79
##[4]
T. S. Guzella, W. M. Cominhas, A Review of Machine Learning Approaches to Spam Filtering, Published in Elsevier Journal: Expert System with Application, 36 (2009), 10206-10222
##[5]
E. Blanzieri, A. Bryl, A Survay of Learning-Based Techniques of Email Spam Filtering, Published in Elsevier Journal: Artificial Intelligence Review, (2008), 63-92
##[6]
Y. Zhu, Y. Tan, A Local-Concentration-Based Feature Extraction Approach for Spam Filtering, IEEE Transactions on Information Forencics and Security, 6 (2011), 486-497
##[7]
M. Besavaraju, R. Prabhakar, A Novel Method of Spam Mail Detection Using Text Based Clustering Approach, Published in International Journal of Computer Applications (IJCA), 5 (2010), 15-25
##[8]
E. Michelakis, I. Androutsopoulos, G. Paliouras, G. Sakkis, P. Stamatopoulos, A Learning-Based Anti-Spam Filter, Proceedings on First Conference on Email and Anti-Spam (CEAS), , California, USA (2004)
##[9]
A. Beiranvand, A. Osareh, B. Shadgar, Spam Filtering By Using a Compound Method of Feature Selection, Published in Journal of Academic and Applied Studies (JAAS), 2 (2012), 25-31
##[10]
M. Chang, C. K. Poon, Using Phrases as Features in Email Classification, Published in Elsevier: The Journal of Systems and Softwares, 82 (2009), 1036-1045
##[11]
X. Geng, T. Y. Liu, T. Qin, H. Li, Feature Selection for Ranking, Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, New York, NY, USA, (2007), 407-414
##[12]
Y. Yang, J. O. Pederson, A Comparative Study on Feature Selection in Text Categorization, Proceedings of the 14th International Conference on Machine Learning (ICML), San Francisco, CA, USA, (1997), 412-420
##[13]
M. Hall, Discriminative Multinomial Naive Bayes for Text Classification, Community Contribution: Pentaho Data Mining-Weka/DATAMINING-125, (2008)
##[14]
, LingSpam Public Corpus, <http://www.aueb.gr/users/ion/publications.html>, Visited on 2013. , (2013)
##[15]
A. M. Kibriya, E. Frank, B. Pfahringer, G. Holmes, Multinomial Naive Bayes for Text Categorization Revisited, Proceedings of 17th Australian Joint Conference on Artificial Intelligence, Cairns, Australia, 3339 (2004), 488-499
##[16]
E. Alpaydin, Introduction to Machine Learning, Second Edition. The MIT Press, (2010), 350-380
##[17]
L. Breiman, Random Forests, Published in Journal of Machine Learning, MA, USA, 45 (2001), 5-32
]
A Multi-objective Resource-constrained Project-scheduling Problem Using Mean Field Annealing Neural Networks
A Multi-objective Resource-constrained Project-scheduling Problem Using Mean Field Annealing Neural Networks
en
en
The planning and scheduling activities are viewed profoundly important to generate successful plans and to maximize the utilization of scarce resources. Moreover, real life planning problems often involve several objectives that should be simultaneously optimized and real world environment is usually characterized by uncertain and incontrollable information. Thus, finding feasible and efficient plans is a considerable challenge. In this respect, the Multi-Objective Resource-Constrained Project-Scheduling problem (MRCPSP) tries to schedule activities and allocate resources in order to find an efficient course of actions to help the project manager and to optimize several optimization criteria. In this research, A Potts mean field feedback artificial neural network algorithm is developed and explored for the multi-objective resource constrained project scheduling problem. A convenient encoding of inequality constraints is achieved by means of multi-linear penalty function. An approximate energy minimum is obtained by iterating a set of Potts means field equation, is combination with annealing. Priority rule-based heuristics are the most widely used scheduling methods though their performance depends on the characteristics of the projects. To overcome this deficiency, a Potts mean field feedback artificial neural network is designed and integrated into the scheduling scheme so as to automatically select the suitable activity for each stage of project scheduling. Testing on Paterson’s classic test problems and comparison with other exact method how that the proposed Potts mean field annealing neural network based heuristic is able to improve the performance of project scheduling.
228
239
Mojahed
Jaberi
Mohammad
Jaberi
Mean Field Theory
Potts Mean Field Theory
Multi-objective optimization
Resource-constrained Project scheduling
Priority Rule-Based Heuristic
Article.7.pdf
[
[1]
M. A. Al-Fawzan, M. Haouari, A bi-objective model for robust resourceconstrained project scheduling, International Journal of production economics , 96 (2005), 175-187
##[2]
T. Baar, P. Brucker, S. Knust, Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem, in: S. Voss, S. Martello, I. Osman, C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic, (1998), 1-18
##[3]
A. Bahreininejad, B. H.V. Topping , Neural Computation for structural Mechanics, Saxe-Coburg Publication, U.K. , (1997), 90-137
##[4]
C. E. Bell, J. Han, A new heuristic solution method in resource-constrained project scheduling, Naval Research Logistics, 38 (1991), 315-331
##[5]
L. Belfares, W. Klibi, L. Nassirou, A. Guitouni, Multi-objectives Tabu Searchbased Algorithm for Progressive Resource Allocation, European Journal of Operational Research, 177 (2007), 1779-1799
##[6]
, , , (), -
##[7]
F. F. Boctor, Some efficient multi-heuristic procedures for resource-constrained project scheduling, European Journal of Operational Research, 49 (1990), 3-13
##[8]
K. Bouleimen, H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem, in: G. Barbarosoglu, S. Karabati, L. Özdamar, G.Ulusoy (Eds.), Proceedings of the Sixth International Workshop on Project Management and Scheduling, Bogazici University, (1998), 19-22
##[9]
W. T. Chan, D. K. H. Chua, G. Kannan, Construction resource scheduling with genetic algorithms, Journal of Construction Engineering and Management, ASCE , 122 (2) (1996), 125-132
##[10]
E. W. Davis, J. H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling, Management Science, 21 (1975), 944-955
##[11]
B. Gavish, H. Pirkul, Algorithms for multi-resource generalized assignment problem, Management Science, 37 (6) (1991), 695-713
##[12]
L. Gislen, C. Peterson, B. Soderberg, Complex Scheduling with Neural Networks, Neural Computation, 4 (1992), 805-831
##[13]
Habibeh Nazif, A Genetic Algorithm for Solving Scheduling Problem, The Journal of Mathematics and Computer Science , 5 (2012), 91-96
##[14]
J. J. Hopfield, D. W. Tank, Neural Computation of Decision in Optimization Problems, Biological cybernetics , 52 (1985), 141-156
##[15]
S. Kirkpatrik, C. D. Gelatt, M. P. Vecchi , Optimization by simulated Annealing, Science, 220 (1983), 671-680
##[16]
R. Kolisch, Serial and Parallel Resource-Constrained Project Scheduling Methods Revisited: Theory and Computation, European Journal of Operational Research , 90 (1996), 320-333
##[17]
J. K. Lee, Y. D. Kim , Search heuristics for resource constrained project scheduling, Journal of the Operational Research Society, 47 (5) (1996), 678-689
##[18]
S. S. Leu, C. H. Yang, GA based multicriteria optimal model for construction scheduling, Journal of Construction Engineering and Management, ASCE , 125 (6) (1999), 420-427
##[19]
E. M. Padilla, R. I. Carr, Resource strategies for dynamic project management, Journal of Construction Engineering and Management, ASCE , 111 (2) (1991), 279-293
##[20]
J. H. Patterson, A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem. Management Science, 30 (1984), 854-867
##[21]
C. Peterson, B. Soderberg, A new method for mapping optimization problems onto neural networks, International Journal of Neural Systems, (1989), -
##[22]
E. Pinson, C. Prins, F. Rullier, Using tabu search for solving the resource-constrained project scheduling problem, in: G.Barbarosoglu, S. Karabati, L. O¨ zdamar, G. Ulusoy (Eds.), Proceedings of the Fourth International Workshop on Project Management and Scheduling, Katholieke Universities Leuven, (1994), 102-106
##[23]
S. E. Sampson, E. N. Weiss, Local search techniques for the generalized resource constrained project scheduling problem, Naval Research Logistics, 40 (1993), 665-675
##[24]
F. B. Talbot, Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case, Management Science, 28 (10) (1982), 1197-1210
]
Estimating of Eigenvalue with Monte Carlo Method and its Application in the Principal Components (pca)
Estimating of Eigenvalue with Monte Carlo Method and its Application in the Principal Components (pca)
en
en
One of discussions in multivariable analysis is defining the factor and main vectors by calculating eigenvalue. In this paper we deal with an unbiased estimator of eigenvector and as a result we define eigenvalues. The purpose was introducing a new statistical method that is different from other numerical methods, which it defines the eigenvalue matrix. On the other hand, the efficiency of this method is up when the mass and dimension of matrix are high. Therefore, this is a low cast and efficient method in calculation. This paper covers some background of data compression and how Markov chain Monte Carlo (MCMC) and principal component analysis (PCA) has been and can be used for calculating eigenvalue.
240
248
Kianoush Fathi
Vajargah
Fatemeh
Kamalzadeh
principal component analysis (PCA)
Markov chain Monte Carlo (MCMC)
eigenvalue matrix
Article.8.pdf
[
[1]
V. N. Alexandrov, A. Rau-Chaplin, F. Dehne, K. Taft , Efficient Coarse Grained Monte Carlo Algorithms for Matrix Computations using PVM, LNCS 1497, Springer, (1998), 323-330
##[2]
I. T. Dimov, V. N. Alexandrov , A new highly convergent Monte Carlo method for matrix computations, Mathematics and Computers in Simulation , Bulgaria Academy of science. , 47 (1998), 165-81
##[3]
B . Fathi Vajargah, K. Fathi Vajargah , Parallel Monte Carlo computation for solving SLAE with minimum communication, Applied Mathematics and Computation , (2006), 1-9
##[4]
S. Orsythe, Liebler, Matrix Inversion by a Monte Carlo method , Math. Tables other Aids Compul., 4 (1950), 127-129
##[5]
D. C. Montgomery, E. A. Peck , Introduction to linear regression analysis, , (1991)
##[6]
B. Fathi Vajargah, A. Heidary- Harzavily , Random Numbers and Monte Carlo Approximation In Fuzzy Riemann Integral, , 4 (2012), 93-101
##[7]
F. Mehrdoust , Monte Carlo Simulation for Numerical Integration Based on Antithetic Variance Reduction and Haltons Sequences, , 4 (2012), 48-52
]