1
1735-4463
ACECR at Tarbiat Modares University
546
General
On Prime and Semiprime Ideals in Ordered AG-Groupoids
Yiarayong
P.
^{
b
}
^{
b
}University Phitsanuloke 65000
1
4
2017
12
1
1
11
12
02
2014
06
11
2016
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.
467
General
Modeling Dynamic Production Systems with Network Structure
Koushki
F.
^{
c
}
^{
c
}Qazvin Branch, Islamic Azad University
1
4
2017
12
1
13
26
24
08
2013
13
11
2016
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.
593
Special
A Note on Twists of (y^2=x^3+1)
Izadi
F.
^{
d
}
Shamsi Zargar
A.
^{
e
}
^{
d
}Urmia University
^{
e
}Shahid Madani University, Tabriz
1
4
2017
12
1
27
34
23
06
2014
06
05
2015
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}.
669
General
Graph Convergence for H(.,.)-co-Accretive Mapping with over-Relaxed Proximal Point Method for Solving a Generalized Variational Inclusion Problem
Rahaman
M.
^{
f
}
Ahmad
R.
^{
g
}
Rizvi
H. A.
^{
h
}
^{
f
}Aligarh Muslim University
^{
g
}Aligarh Muslim University
^{
h
}Aligarh Muslim University
1
4
2017
12
1
35
46
29
12
2014
08
10
2015
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.
595
Special
Integrating Differential Evolution Algorithm with Modified Hybrid GA for Solving Nonlinear Optimal Control Problems
Nezhadhosein
S.
^{
i
}
Heydari
A.
^{
j
}
Ghanbari
R.
^{
k
}
^{
i
}Payame Noor University, Tehran
^{
j
}Payame Noor University, Tehran
^{
k
}Ferdowsi University of Mashhad
1
4
2017
12
1
47
67
26
06
2014
24
05
2015
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.
617
General
Some Families of Graphs whose Domination Polynomials are Unimodal
Alikhani
S.
^{
l
}
Jahari
S.
^{
m
}
^{
l
}Yazd University
^{
m
}Yazd University
1
4
2017
12
1
69
80
16
09
2014
02
01
2017
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.
626
General
On Lorentzian two-Symmetric Manifolds of Dimension-four
Zaeim
A.
^{
n
}
Chaichi
M.
^{
o
}
Aryanejad
Y.
^{
p
}
^{
n
}Payame noor University
^{
o
}Payame noor University
^{
p
}Payame noor University
1
4
2017
12
1
81
94
28
09
2014
10
05
2015
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.
632
Special
On the Zero-divisor Cayley Graph of a Finite Commutative Ring
Naghipour
A. R.
^{
}
^{
}Shahrekord University
1
4
2017
12
1
95
106
11
10
2014
10
10
2015
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.
743
General
On Open Packing Number of Graphs
Sahul Hamid
I.
^{
}
Saravanakumar
S.
^{
}
^{
}The Madura College(Autonomous) Madurai
^{
}The Madura College(Autonomous) Madurai
1
4
2017
12
1
107
117
26
06
2015
02
05
2016
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.
638
Special
On Twin--Good Rings
Ashrafi
N.
^{
}
Pouyan
N.
^{
}
^{
}Semnan University
^{
}Semnan University
1
4
2017
12
1
119
129
26
10
2014
28
04
2015
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 $Z_2$ or $Z_3$. 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 $Z_2$ or $Z_3$. Also we illustrate conditions under which extending modules, continuous modules and some classes of vector space are twin-good.
671
Special
An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
Peyghami
M. R.
^{
}
Fathi Hafshejani
S.
^{
}
^{
}K.N. Toosi Univ. of Tech.
^{
}Shiraz Univ. of Tech.
1
4
2017
12
1
131
152
30
12
2014
11
07
2016
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.
918
Special
On Graded Weakly Classical Prime Submodules
Abu-Dawwas
R.
^{
}
Al-Zoubi
Kh.
^{
}
^{
}Yarmouk University
^{
}Jordan University of Science and Technology
1
4
2017
12
1
153
161
17
06
2016
01
03
2017
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.
1114
Special
ABSTRACTS IN PERSIAN Vol.12, No.1
Name of Authors In This Volume
^{
}
^{
}All the author's Affilliations
1
4
2017
12
1
163
175
12
07
2017
12
07
2017
Please see the full text contains the Pesian abstracts for this volume.