@article {
author = {Ghodousian, A. and Elyasimohammadi, Fatemeh},
title = {On the optimization of Dombi non-linear programming},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {1-36},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of the parameter. This family of t-norms covers the whole spectrum of t-norms 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 t-norms. We firstly investigate the resolution of the feasible solutions set when it is defined with max-Dombi 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 non-convex, 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 max-Dombi 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.},
keywords = {Fuzzy relational equations,nonlinear optimization,Genetic Algorithm},
url = {https://jac.ut.ac.ir/article_75292.html},
eprint = {https://jac.ut.ac.ir/article_75292_7b16cbc565259c77827bfe8fe8e80d55.pdf}
}
@article {
author = {Mehmood, Arif and Nadeem, Fawad and Park, Choonkil and Nordo, Giorgio and Kalsoom, Humaira and Rahim Khan, Muhammad and Abbas, Naeem},
title = {Neutrosophic Soft $\alpha-$Open Set in Neutrosophic Soft Topological Spaces},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {37-63},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {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.},
keywords = {neutrosophic soft set,neutrosophic soft point,neutrosophic soft $alpha-$open set,neutrosophic soft $alpha-$separation axioms},
url = {https://jac.ut.ac.ir/article_76040.html},
eprint = {https://jac.ut.ac.ir/article_76040_eb455047c9534ab980203b2fc52d80e4.pdf}
}
@article {
author = {Jafaripour, Saeed and Nilforoushan, Zahra and Borna, Keivan},
title = {What makes a Rhythm to be Bad},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {65-82},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {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.},
keywords = {Symmetry,geometry,Music,Rhythm,Onset,Pulse},
url = {https://jac.ut.ac.ir/article_76204.html},
eprint = {https://jac.ut.ac.ir/article_76204_66952a5fb7632f9e5d210049a91af6e9.pdf}
}
@article {
author = {Kapoor, Anuj},
title = {Efficient Storage and Retrieval of In-Memory Static Data},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {83-96},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {Hash or B-Tree 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 semi-static, 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.},
keywords = {static data,trie,search algorithm,Composite index,combination key},
url = {https://jac.ut.ac.ir/article_76227.html},
eprint = {https://jac.ut.ac.ir/article_76227_f4783d3e9e2ddaf29259318978af6743.pdf}
}
@article {
author = {Nasehpour, Peyman},
title = {A Computational Criterion for the Irrationality of Some Real Numbers},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {97-104},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {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.},
keywords = {Asymptotic average of the decimals,Cesaro summation,Irrational numbers,Simply normal numbers},
url = {https://jac.ut.ac.ir/article_76471.html},
eprint = {https://jac.ut.ac.ir/article_76471_fc6f8c7822d83a00dd1f31cf02977993.pdf}
}
@article {
author = {Boskabadi, Mostafa and Doostparast, Mahdi and Sarmad, Majid},
title = {Survival analyses with dependent covariates: A regression tree-base approach},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {105-129},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {Cox proportional hazards models are the most common modelling framework to prediction and evaluation of covariate effects in time-to-event 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 Monte--Carlo 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.},
keywords = {Survival tree,Cox proportional hazards model,dependence,Copula function},
url = {https://jac.ut.ac.ir/article_76520.html},
eprint = {https://jac.ut.ac.ir/article_76520_449dfda953c8594a1c2c489c0a096071.pdf}
}
@article {
author = {Poureidi, Abolfazl},
title = {On computing total double Roman domination number of trees in linear time},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {131-137},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {Let $G=(V,E)$ be a graph. A doubleRoman dominating function (DRDF) on $G$ is a function$f:V\to\{0,1,2,3\}$ such that for every vertex $v\in 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 $v\in 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_{v\in 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.},
keywords = {Total double Roman dominating function,linear algorithm,Dynamic Programming,Combinatorial optimization,tree},
url = {https://jac.ut.ac.ir/article_76537.html},
eprint = {https://jac.ut.ac.ir/article_76537_69021667b614187aa822b65828743678.pdf}
}
@article {
author = {Mehravaran, Maedeh and Adibnia, Fazlollah and Pajoohan, Mohammad-Reza},
title = {A security aware workflow scheduling in hybrid cloud based on PSO algorithm},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {139-161},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {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.},
keywords = {Cloud Computing,Task scheduling,Security requirements,Resource,PSO},
url = {https://jac.ut.ac.ir/article_76632.html},
eprint = {https://jac.ut.ac.ir/article_76632_9f6916912029aeb28b51c345f1f05273.pdf}
}
@article {
author = {Iranfar, Behnam and Farshi, Mohammad},
title = {On the expected weight of the theta graph on uncertain points},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {163-174},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {Given a point set $S\subset \mathbb{R}^d$, the $\theta$-graph of $S$ is as follows: for each point $s\in 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^2\alpha(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.},
keywords = {uncertain points,expected weight},
url = {https://jac.ut.ac.ir/article_76684.html},
eprint = {https://jac.ut.ac.ir/article_76684_572cf4a88d6207678891b2fb73b9ed89.pdf}
}
@article {
author = {Moazzami, .Dara},
title = {Edge-Tenacity},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {175-182},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {The edge-tenacity $T_e(G)$ of a graph G was defined as\begin{center} $T_e(G)=\displaystyle \min_{F\subset E(G)}\{\frac{\mid F\mid +\tau(G-F)}{\omega(G-F)}\}$\end{center}where the minimum is taken over all edge cutset F of G. We defineG-F to be the graph induced by the edges of $E(G)-F$, $\tau(G-F)$is the number of edges in the largest component of the graphinduced by G-F and $\omega(G-F)$ is the number of components of$G-F$. A set $F\subset E(G)$ is said to be a $T_e$-set of G if\begin{center} $T_e(G)=\frac{\mid F\mid+\tau(G-F)}{\omega(G-F)}$\end{center}Each component has at least one edge. In this paper we introducea new invariant edge-tenacity, for graphs. it is another vulnerability measure.we present several properties and bounds on the edge-tenacity. we alsocompute the edge-tenacity of some classes of graphs.},
keywords = {Edge-tenacity,cutset,Mix-tenacity,Edge-Integrity,Vulnerability},
url = {https://jac.ut.ac.ir/article_76696.html},
eprint = {https://jac.ut.ac.ir/article_76696_1c97ee68f04cbe2dbd1a9f6fde71666b.pdf}
}
@article {
author = {Daadmehr, Elham and Habibi, Reza},
title = {A Note on Early Warning Systems for Monitoring the Inflation of Iran},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {183-195},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {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 two-state Markov switching (MS) states, i.e., \( MS \left( 2 \right) -ARMA \left( 1,1 \right) \) . Based on this model, a logistic-EWS 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 noise-to-signal ratio discrepancy measure.},
keywords = {economic crisis,EWS,MS model,Logistic regression},
url = {https://jac.ut.ac.ir/article_77109.html},
eprint = {https://jac.ut.ac.ir/article_77109_cdcb6d1837eaae2aa6d37e69de5a14d0.pdf}
}
@article {
author = {Imanparast, Mahdi and Kazemi Torbaghan, Mehdi},
title = {On Point-inclusion Test in Convex Polygons and Polyhedrons},
journal = {Journal of Algorithms and Computation},
volume = {52},
number = {1},
pages = {197-207},
year = {2020},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {},
abstract = {A new algorithm for point-inclusion test in convex polygons is introduced. The proposed algorithm answers the point-inclusion 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 point-inclusion test in convex polyhedrons in three dimensional space. This algorithm can solve the point-inclusion test in convex $3D$ polyhedrons in $\mathcal{O}(\log n)$ time with $\mathcal{O}(n)$ preprocessing time and $\mathcal{O}(n)$ space.},
keywords = {Point-in-polygon,Point-inclusion test,Convex polygons,Convex polyhedrons,Preprocessing time},
url = {https://jac.ut.ac.ir/article_77122.html},
eprint = {https://jac.ut.ac.ir/article_77122_472a280448e87d499860383248c46f29.pdf}
}