2020
52
1
1
0
1

On the optimization of Dombi nonlinear programming
https://jac.ut.ac.ir/article_75292.html
1
Dombi family of tnorms includes a parametric family of continuous strict tnorms, whose members are increasing functions of the parameter. This family of tnorms covers the whole spectrum of tnorms when the parameter is changed from zero to infinity. In this paper, we study a nonlinear optimization problem in which the constraints are defined as fuzzy relational equations (FRE) with the Dombi family of tnorms. We firstly investigate the resolution of the feasible solutions set when it is defined with maxDombi composition and present some necessary and sufficient conditions for determining the feasibility. Also, some procedures are presented for simplifying the problem. Since the feasible solutions set of FREs is nonconvex, conventional nonlinear programming methods may not be directly employed to solve the problem. Based on some theoretical properties of the problem, a genetic algorithm is presented, which preserves the feasibility of new generated solutions. Moreover, a method is presented to generate feasible maxDombi FREs as test problems for evaluating the performance of our algorithm. The proposed method has been compared with some related works. The obtained results confirm the high performance of the proposed method in solving such nonlinear problems.
0

1
36


A.
Ghodousian
University of Tehran, College of Engineering, Faculty of Engineering Science
Iran
a.ghodousian@ut.ac.ir


Fatemeh
Elyasimohammadi
University of Tehran, College of Engineering, Faculty of Engineering Science
Iran
fatemeelyasi49@gmail.com
Fuzzy relational equations
nonlinear optimization
Genetic Algorithm
1

Neutrosophic Soft $alpha$Open Set in Neutrosophic Soft Topological Spaces
https://jac.ut.ac.ir/article_76040.html
1
In this paper, the notion of generalized neutrosophic soft open set (GNSOS) in neutrosophic soft open set (GNSOS) in neutrosophic soft topological structures relative to neutrosophic soft points is introduced.The concept of generalized neutrosophic soft separation axioms in neutrosophic soft topological spaces with respect to soft points. Several related properties, structural characteristics have been investigated. Then the convergence of sequence in neutrosophic soft topological space is defined and its uniqueness in generalized neutrosophic soft Hausdorff space (GNSHS) relative to soft points is examined. Neutrosophic monotonous soft function and its characteristics are switched over to different results. Lastly, generalized neutrosophic soft product spaces with respect to crisp points have been addressed.
0

37
63


Arif
Mehmood
Riphah International University, Sector I14, Islamabad, Pakistan
Iran
mehdaniyal@gmail.com


Fawad
Nadeem
Department of Mathematics, University of Science and Technology, Bannu, Khyber Pakhtunkhwa, Pakistan
Iran
fawadnadeem2@gmail.com


Choonkil
Park
Department of Mathematics, Research institute for Natural Sciences, Hanyang University,
Seoul 133791, Republic of Korea
Iran
baak@hanyang.ac.kr


Giorgio
Nordo
MIFTDipartimento di Dcienze Matematiche e Informatiche, Scienze Fisiche e scienze
DellaTerra, Messina University, Messina, Italy
Iran
giorgio.nordo@unime.it


Humaira
Kalsoom
School of Mathematical Sciences, Zhejiang University, Hangzhou,
310027, P. R. China
Iran
humaira87@zju.edu.cn


Muhammad
Rahim Khan
Iran


Naeem
Abbas
Iran
neutrosophic soft set
neutrosophic soft point
neutrosophic soft $alpha$open set
neutrosophic soft $alpha$separation axioms
1

What makes a Rhythm to be Bad
https://jac.ut.ac.ir/article_76204.html
1
Deciding whether a musical rhythm is good or not, depends on many factors like geographical conditions of a region, culture, the mood of society, the view of rhythm over years, and so on. In this paper, we want to make a decision from the scientific point of view, using geometric features of rhythms, about bad ones. The researchers who are investigating the relationship between geometry and music, certainly realize that there is a big vacuum in this regard, not using computers to detect a good or bad rhythm. Here, using computer programming and applying geometric features to more than four thousand rhythms, we decide on the bad musical rhythms. Then we present algorithms for deciding about bad rhythms using geometrical features.
0

65
82


Saeed
Jafaripour
Faculty of
Engineering, Kharazmi University, Tehran,
Iran
Iran
jafarisaeid41@gmail.com


Zahra
Nilforoushan
Department of Computer Science,
Kharazmi University,
Tehran
Iran
nilforoushan@khu.ac.ir


Keivan
Borna
Faculty of
Mathematics and Computer Science, Kharazmi University, Tehran,
Iran
Iran
borna@khu.ac.ir
Symmetry
geometry
Music
Rhythm
Onset
Pulse
1

Efficient Storage and Retrieval of InMemory Static Data
https://jac.ut.ac.ir/article_76227.html
1
Hash or BTree based composite indexes, are the two most commonly used techniques for searching and retrieving data from memory. Although these techniques have a serious memory limitation, that restricts textit{freedom} to search by any combination of single key/data attribute, that comprises the composite search key, the techniques are still accepted considering the trade offs with better performance on insert and update operations. But when the data is semistatic, which does not change often, there is a need and scope for a better technique that provides the flexibility and freedom to efficiently search by any possible key, without creating any composite index. This paper explains such algorithmic technique along with its data structures.
0

83
96


Anuj
Kapoor
Senior Software Engineer, Department of Technology, Priceline LLC, 800 Connecticut Ave, Norwalk, CT 06854,
USA
Iran
anuj.kapoor@kapoorlabs.com
static data
trie
search algorithm
Composite index
combination key
1

A Computational Criterion for the Irrationality of Some Real Numbers
https://jac.ut.ac.ir/article_76471.html
1
In this paper, we compute the asymptotic average of the decimals of some real numbers. With the help of this computation, we prove that if a real number cannot be represented as a finite decimal and the asymptotic average of its decimals is zero, then it is irrational. We also show that the asymptotic average of the decimals of simply normal numbers is 9/2.
0

97
104


Peyman
Nasehpour
Department of Engineering Science, Golpayegan University of Technology, Golpayegan, Iran
Iran
nasehpour@gmail.com
Asymptotic average of the decimals
Cesaro summation
Irrational numbers
Simply normal numbers
1

Survival analyses with dependent covariates: A regression treebase approach
https://jac.ut.ac.ir/article_76520.html
1
Cox proportional hazards models are the most common modelling framework to prediction and evaluation of covariate effects in timetoevent analyses.These models usually do not account the relationship among covariates which may have impacts on survival times.In this article, we introduce regression tree models for survival analyses by incorporating dependencies among covariates. Various properties of the proposed model are studied in details. To assess the accuracy of the proposed model, a MonteCarlo simulation study is conducted.A real data set from assay of serum free light chain is also analysed to illustrate advantages of the proposed method in medical investigations.
0

105
129


Mostafa
Boskabadi
Department of Statistics‎, ‎Ferdowsi University of Mashhad‎, ‎P.O‎. ‎Box 917751159‎, ‎Khorasan Razavi‎, ‎Iran
Iran
bmostafa77@yahoo.com


Mahdi
Doostparast
Department of Statistics, School of Mathematical Sciences, Ferdowsi University of Mashhad
Iran
doustparast@um.ac.ir


Majid
Sarmad
Department of Statistics‎, ‎Ferdowsi University of Mashhad‎, ‎P.O‎. ‎Box 917751159‎, ‎Khorasan Razavi‎, ‎Iran
Iran
sarmad@um.ac.ir
Survival tree
Cox proportional hazards model
dependence
Copula function
1

On computing total double Roman domination number of trees in linear time
https://jac.ut.ac.ir/article_76537.html
1
Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:Vto{0,1,2,3}$ such that for every vertex $vin V$if $f(v)=0$, then either there is a vertex $u$ adjacent to $v$ with $f(u)=3$ orthere are vertices $x$ and $y$ adjacent to $v$ with $f(x)=f(y)=2$ and if $f(v)=1$, then there is a vertex $u$ adjacent to $v$ with$f(u)geq2$.A DRDF $f$ on $G$ is a total DRDF (TDRDF) if for any $vin V$ with $f(v)>0$ there is a vertex $u$ adjacent to $v$ with $f(u)>0$.The weight of $f$ is the sum $f(V)=sum_{vin V}f(v)$. The minimum weight of a TDRDF on $G$ is the total double Romandomination number of $G$. In this paper, we give a linear algorithm to compute thetotal double Roman domination number of agiven tree.
0

131
137


Abolfazl
Poureidi
Department of Mathematics, Shahrood University of Technology Shahrood, Iran
Iran
a.poureidi@shahroodut.ac.ir
Total double Roman dominating function
linear algorithm
Dynamic Programming
Combinatorial optimization
tree
1

A security aware workflow scheduling in hybrid cloud based on PSO algorithm
https://jac.ut.ac.ir/article_76632.html
1
In real world, organization's requirements for high performance resources and high capacity storage devices encourage them to use resources in public clouds. While private cloud provides security and low cost for scheduling workflow, public clouds provide a higher scale, potentially exposed to the risk of data and computation breach, and need to pay the costs. Task scheduling, therefore, is one of the most important problems in cloud computing. In this paper, a new scheduling method is proposed for workflow applications in hybrid cloud considering security. Sensitivity of tasks has been considered in recent works; we, however, consider security requirement for data and security strength for resources. The proposed scheduling method is implemented in Particle Swarm linebreak Optimization (PSO) algorithm. Our proposed algorithm considers minimizing security distance, that is maximizing similarity of security between data and resources. It, meanwhile, follows time and budget constraints. Through analysis of experimental results,it is shown that the proposed algorithm has selected resources with the most security similarity while user constraints are satisfied.
0

139
161


Maedeh
Mehravaran
Department of Computer Engineering, Yazd University, Yazd, Iran
Iran
m.mehravaran@stu.yazd.ac.ir


Fazlollah
Adibnia
Faculty of Computer Engineering,
Yazd University
Iran
fadib@yazd.ac.ir


MohammadReza
Pajoohan
Faculty of Computer Engineering, Yazd University
Iran
pajoohan@yazd.ac.ir
Cloud Computing
Task scheduling
Security requirements
Resource
PSO
1

On the expected weight of the theta graph on uncertain points
https://jac.ut.ac.ir/article_76684.html
1
Given a point set $Ssubset mathbb{R}^d$, the $theta$graph of $S$ is as follows: for each point $sin S$, draw cones with apex at $s$ and angle $theta$ %fix a line through $p$ at each cone and connect $s$ to the point in each cone such that the projection of the point on the bisector of the cone is the closest to~$s$. One can define the $theta$ graph on an uncertain point set, i.e. a point set where each point $s_i$ exists with an independent probability $pi_i in (0,1]$. In this paper, we propose an algorithm that computes the expected weight of the $theta$graph on a given uncertain point set. The proposed algorithm takes $O(n^2alpha(n^2,n)^{2d})$ time and $O(n^2)$ space, where $n$ is the number of points, $d$ and $theta$ are constants, and $alpha$ is the inverse of the Ackermann's function.
0

163
174


Behnam
Iranfar
Department of Computer
Science, Yazd University, Yazd, Iran
Iran
biranfar@gmail.com


Mohammad
Farshi
Department of Mathematical Sciences, Yazd University, Yazd, Iran
Iran
mfarshi@yazd.ac.ir
uncertain points
expected weight
1

EdgeTenacity
https://jac.ut.ac.ir/article_76696.html
1
The edgetenacity $T_e(G)$ of a graph G was defined asbegin{center} $T_e(G)=displaystyle min_{Fsubset E(G)}{frac{mid Fmid +tau(GF)}{omega(GF)}}$end{center}where the minimum is taken over all edge cutset F of G. We defineGF to be the graph induced by the edges of $E(G)F$, $tau(GF)$is the number of edges in the largest component of the graphinduced by GF and $omega(GF)$ is the number of components of$GF$. A set $Fsubset E(G)$ is said to be a $T_e$set of G ifbegin{center} $T_e(G)=frac{mid Fmid+tau(GF)}{omega(GF)}$end{center}Each component has at least one edge. In this paper we introducea new invariant edgetenacity, for graphs. it is another vulnerability measure.we present several properties and bounds on the edgetenacity. we alsocompute the edgetenacity of some classes of graphs.
0

175
182


.Dara
Moazzami
Department of Algorithms and Computation, Faculty of Engineering Science, College of Engineering, University of Tehran, Iran,
Iran
dmoazzami@ut.ac.ir
Edgetenacity
cutset
Mixtenacity
EdgeIntegrity
Vulnerability
1

A Note on Early Warning Systems for Monitoring the Inflation of Iran
https://jac.ut.ac.ir/article_77109.html
1
To check the financial stability, it is important to alarm the possibility of future potential financial crisis. In the literature, the early warning system (EWS) is designed to warn the occurrence of a financial crisis before it happens. This tool gives strengthens to managers to make efficient policy in real economic activities. Hyperinflation, as a financial crisis, is an uncommon bad phenomenon in every economy. It quickly erodes the real value of the local currency, as the prices of all goods increase. This causes people to minimize their holdings in that currency as they usually switch to more stable foreign currencies, often the US Dollar. Hence, designing a EWS for detecting hyperinflation is valuable task. In the current paper, Iran monthly inflation is modeled by a first
orders autoregressive and moving average model (ARMA) with twostate Markov switching (MS) states, i.e., ( MS left( 2 right) ARMA left( 1,1 right) ) . Based on this model, a logisticEWS is proposed. From the empirical results, it is seen that, in Iran, the low inflation state is more probable than state of high inflation. Beside this, the time of remaining in the low inflation position is almost 9 times more than of high inflation position. To check validity of the results and control prediction errors,it is seen that at least 89 percentages of future states of inflation are correctly predicted with a low noisetosignal ratio discrepancy measure.
0

183
195


Elham
Daadmehr
Department of Statistics, Central Bank of Iran
Iran
e.daadmehr@cbi.ir


Reza
Habibi
Iran Banking Institute, Central Bank of Iran
Iran
r_habibi@ibi.ac.ir
economic crisis
EWS
MS model
Logistic regression
1

On Pointinclusion Test in Convex Polygons and Polyhedrons
https://jac.ut.ac.ir/article_77122.html
1
A new algorithm for pointinclusion test in convex polygons is introduced. The proposed algorithm answers the pointinclusion test in convex polygons in $mathcal{O}(log n)$ time without any preprocessing and with $mathcal{O}(n)$ space. The proposed algorithm is extended to do the pointinclusion test in convex polyhedrons in three dimensional space. This algorithm can solve the pointinclusion test in convex $3D$ polyhedrons in $mathcal{O}(log n)$ time with $mathcal{O}(n)$ preprocessing time and $mathcal{O}(n)$ space.
0

197
207


Mahdi
Imanparast
Department of Computer Science, University of Bojnord, Bojnord, Iran
Iran
m.imanparast@ub.ac.ir


Mehdi
Kazemi Torbaghan
Department of Mathematics, University of Bojnord
Iran
m.kazemi@ub.ac.ir
Pointinpolygon
Pointinclusion test
Convex polygons
Convex polyhedrons
Preprocessing time