en
jalali
1396
1
1
gregorian
2017
4
1
12
1
online
1
fulltext
en
On Prime and Semiprime Ideals in Ordered AG-Groupoids
The aim of this short note is to introduce the concepts of prime and semiprime ideals in ordered AG-groupoids with left identity. These concepts are related to the concepts of quasi-prime and quasi-semiprime ideals, play an important role in studying the structure of ordered AG-groupoids, so it seems to be interesting to study them.
Ordered AG-Groupoids, Prime, Semiprime, quasi-prime, quasi-semiprime.
1
11
http://ijmsi.ir/browse.php?a_code=A-10-528-2&slc_lang=en&sid=1
P.
Yiarayong
University Phitsanuloke 65000
pairote0027@hotmail.com
`0031947532846003911`

0031947532846003911
Yes
University Phitsanuloke 65000
en
Modeling Dynamic Production Systems with Network Structure
This paper deals with the problem of optimizing two-stage structure decision making units (DMUs) where the activity and the performance of two-stage DMU in one period effect on its efficiency in the next period. To evaluate such systems the effect of activities in one period on ones in the next term must be considered. To do so, we propose a dynamic DEA approach to measure the performance of such network units. According to the results of proposed dynamic model the inefficiencies of DMUs improve considerably. Additionally, in models which measure efficiency score, undesirable outputs are mostly treated as inputs, which do not reflect the true production process. We propose an alternative method in dealing with bad outputs. Statistical analysis of sub-efficiencies, i.e. efficiency score of each stage, during all periods represents useful information about the total performance of the stage over all periods.
Data envelopment analysis (DEA), Network DEA, Bad outputs, Dynamic DEA, Sub-efficiency.
13
26
http://ijmsi.ir/browse.php?a_code=A-10-519-1&slc_lang=en&sid=1
F.
Koushki
Qazvin Branch, Islamic Azad University
fkoushki@gmail.com
`0031947532846003912`

0031947532846003912
Yes
en
A Note on Twists of (y^2=x^3+1)
In the category of Mordell curves (E_D:y^2=x^3+D) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (E_1), and of the generic rank at least two and at least three as cubic twists of (E_1). Previous work, in the category of Mordell curves with trivial torsion groups, has found infinitely many elliptic curves with rank at least seven as sextic twists of (E_1) cite{Kih}.
Elliptic curve, Mordell curve, (Mordell-Weil) rank, Twist.
27
34
http://ijmsi.ir/browse.php?a_code=A-10-885-1&slc_lang=en&sid=1
F.
Izadi
Urmia University
farzali.izadi@azaruniv.edu
`0031947532846003913`

0031947532846003913
No
A.
Shamsi Zargar
Shahid Madani University, Tabriz
shzargar.arman@azaruniv.edu
`0031947532846003914`

0031947532846003914
Yes
en
Graph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
In this paper, we use the concept of graph convergence of H(.,.)-co-accretive mapping introduced by [R. Ahmad, M. Akram, M. Dilshad, Graph convergence for the H(.,.)-co-accretive mapping with an application, Bull. Malays. Math. Sci. Soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem in Banach spaces. Our results can be viewed as an extension of some previously known results in this direction.
Graph convergence, Over-relaxed, Accretive, Variational inclusion, Convergence.
35
46
http://ijmsi.ir/browse.php?a_code=A-10-1163-1&slc_lang=en&sid=1
M.
Rahaman
Aligarh Muslim University
mrahman96@yahoo.com
`0031947532846003915`

0031947532846003915
No
R.
Ahmad
Aligarh Muslim University
raisain_123@rediffmail.com
`0031947532846003916`

0031947532846003916
Yes
H. A.
Rizvi
Aligarh Muslim University
haider.alig.abbas@gmail.com
`0031947532846003917`

0031947532846003917
No
en
Integrating Differential Evolution Algorithm with Modified Hybrid GA for Solving Nonlinear Optimal Control Problems
Here, we give a two phases algorithm based on integrating differential evolution (DE) algorithm with modified hybrid genetic algorithm (MHGA) for solving the associated nonlinear programming problem of a nonlinear optimal control problem. In the first phase, DE starts with a completely random initial population where each individual, or solution, is a random matrix of control input values in time nodes. After phase 1, to achieve more accurate solutions, we increase the number of time nodes. The values of the associated new control inputs are estimated by linear or spline interpolations using the curves computed in the phase 1. In addition, to maintain the diversity in the population, some additional individuals are added randomly. Next, in the second phase, MHGA starts by the new population constructed by the above procedure and tries to improve the obtained solutions at the end of phase 1. We implement our proposed algorithm on some well-known nonlinear optimal control problems. The numerical results show the proposed algorithm can find almost better solution than other proposed algorithms.
Nonlinear optimal control problem, Differential evolution, Modified hybrid genetic algorithm, Successive quadratic programming, Spline interpolation.
47
67
http://ijmsi.ir/browse.php?a_code=A-10-689-2&slc_lang=en&sid=1
S.
Nezhadhosein
Payame Noor University, Tehran
s_nezhadhossin@yahoo.com
`0031947532846003931`

0031947532846003931
Yes
A.
Heydari
Payame Noor University, Tehran
`0031947532846003932`

0031947532846003932
No
R.
Ghanbari
Ferdowsi University of Mashhad
`0031947532846003933`

0031947532846003933
No
en
Some Families of Graphs whose Domination Polynomials are Unimodal
Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.
Domination polynomial, unimodal, family.
69
80
http://ijmsi.ir/browse.php?a_code=A-10-541-1&slc_lang=en&sid=1
S.
Alikhani
Yazd University
alikhani@yazd.ac.ir
`0031947532846003934`

0031947532846003934
Yes
S.
Jahari
Yazd University
s.jahari@gmail.com
`0031947532846003935`

0031947532846003935
No
en
On Lorentzian two-Symmetric Manifolds of Dimension-four
We study curvature properties of four-dimensional Lorentzian manifolds with two-symmetry property. We then consider Einstein-like metrics, Ricci solitons and homogeneity over these spaces.
Pseudo-Riemannian metric, Einstein-like metrics, Ricci soliton, Homogeneous space.
81
94
http://ijmsi.ir/browse.php?a_code=A-10-935-2&slc_lang=en&sid=1
A.
Zaeim
Payame noor University
zaeim@pnu.ac.ir
`0031947532846003936`

0031947532846003936
Yes
M.
Chaichi
Payame noor University
chaichi@pnu.ac.ir
`0031947532846003937`

0031947532846003937
No
Y.
Aryanejad
Payame noor University
y.aryanejad@pnu.ac.ir
`0031947532846003938`

0031947532846003938
No
en
On the Zero-divisor Cayley Graph of a Finite Commutative Ring
Let R be a fnite commutative ring and N(R) be the set of non unit elements of R. The non unit graph of R, denoted by Gamma(R), is the graph obtained by setting all the elements of N(R) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin N(R). In this paper, the basic properties of Gamma(R) are investigated and some characterization results regarding connectedness, girth and planarity of Gamma(R) are given.
Connectivity, diameter, girth, planar graph, clique.
95
106
http://ijmsi.ir/browse.php?a_code=A-10-1023-1&slc_lang=en&sid=1
A. R.
Naghipour
Shahrekord University
`0031947532846003939`

0031947532846003939
Yes
en
On Open Packing Number of Graphs
In a graph G = (V,E), a subset $S⊂V$ is said to be an open packing set if no two vertices of S have a common neighbour in G. The maximum cardinality of an open packing set is called the open packing number and is denoted by $ρ^{o}$. This paper further studies on this parameter by obtaining some new bounds.
Open packing, Maximum degree, Clique, Split graphs.
107
117
http://ijmsi.ir/browse.php?a_code=A-10-1467-1&slc_lang=en&sid=1
I.
Sahul Hamid
The Madura College(Autonomous) Madurai
`0031947532846003940`

0031947532846003940
No
S.
Saravanakumar
The Madura College(Autonomous) Madurai
`0031947532846003941`

0031947532846003941
Yes
en
On Twin--Good Rings
In this paper, we investigate various kinds of extensions of twin-good rings. Moreover, we prove that every element of an abelian neat ring R is twin-good if and only if R has no factor ring isomorphic to Z2 or Z3. The main result of [24] states some conditions that any right self-injective ring R is twin-good. We extend this result to any regular Baer ring R by proving that every element of a regular Baer ring is twin-good if and only if R has no factor ring isomorphic to Z2 or Z3. Also we illustrate conditions under which extending modules, continuous modules and some classes of vector space are twin-good.
Twin-good ring, Neat ring, Regular Baer ring, π-regular.
119
129
http://ijmsi.ir/browse.php?a_code=A-10-239-2&slc_lang=en&sid=1
N.
Ashrafi
Semnan University
nashrafi@semnan.ac.ir
`0031947532846003942`

0031947532846003942
Yes
N.
Pouyan
Semnan University
neda.pouyan@gmail.com
`0031947532846003943`

0031947532846003943
No
en
An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) function nor logarithmic barrier function, the primal-dual IPMs based on this kernel function enjoy the worst case iteration bound $Oleft(sqrt{n}log nlog frac{n}{epsilon}right)$ for the large-update methods with the special choice of its parameters. This bound coincides to the so far best known complexity results obtained from SR kernel functions for linear and semidefinite optimization problems. Finally some numerical issues regarding the practical performance of the new proposed kernel function is reported.
Convex quadratic semidefinite optimization problem, Primal-dual interior-point methods, Kernel function, Iteration complexity.
131
152
http://ijmsi.ir/browse.php?a_code=A-10-1111-1&slc_lang=en&sid=1
M. R.
Peyghami
K.N. Toosi Univ. of Tech.
peyghami@kntu.ac.ir
`0031947532846003944`

0031947532846003944
Yes
S.
Fathi Hafshejani
Shiraz Univ. of Tech.
sajadfathi85@gmail.com
`0031947532846003945`

0031947532846003945
No
en
On Graded Weakly Classical Prime Submodules
Let R be a G-graded ring and M be a G-graded R-module. In this article, we introduce the concept of graded weakly classical prime submodules and give some properties of such submodules.
Graded prime submodules, Graded weakly classical prime submodules, Graded classical prime submodules .
153
161
http://ijmsi.ir/browse.php?a_code=A-10-2079-1&slc_lang=en&sid=1
R.
Abu-Dawwas
Yarmouk University
rrashid@yu.edu.jo
`0031947532846003946`

0031947532846003946
Yes
Kh.
Al-Zoubi
Jordan University of Science and Technology
kfzoubi@ust.edu.jo
`0031947532846003947`

0031947532846003947
No
en
ABSTRACTS IN PERSIAN Vol.12, No.1
Please see the full text contains the Pesian abstracts for this volume.
ABSTRACTS, PERSIAN, Vol. 12, No. 1
163
175
http://ijmsi.ir/browse.php?a_code=A-10-1873-8&slc_lang=en&sid=1
Name of Authors In This Volume
All the author's Affilliations
fatemeh.bardestani@gmail.com
`0031947532846003948`

0031947532846003948
Yes