Mohammad Ghodsi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mohammad Ghodsi has a total of 68 co-authors. Here are the top co-authors by number of shared publications:
- Sepideh Aghamolaei
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
8 shared publications - Masoud Seddighin
Sharif University of Technology
5 shared publications - MohammadTaghi Hajiaghayi
University of Maryland, College Park, USA
4 shared publications - Ali Mohades
Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran
3 shared publications - Arash Vaezi
Sharif University of Technology
3 shared publications - Hamid Mahini
Sharif University of Technology, Computer Engineering Department, P.O. Box 11155-9517, Tehran, Iran
3 shared publications
Latest Publications
- 14 February 2026
- Published by Springer Nature
- p. 499-511
Trajectory Visibility at First Sight
- 7 June 2024
- Published by Elsevier in Information Sciences
- Vol. 677
Explainable graph clustering via expanders in the massively parallel computation model
- 7 June 2024
- Published by Elsevier in Information Sciences
- Vol. 677
Explainable graph clustering via expanders in the massively parallel computation model
- Open Access
Massively-Parallel Heat Map Sorting and Applications To Explainable Clustering
Given a set of points labeled with $k$ labels, we introduce the heat map sorting problem as reordering and merging the points and dimensions while preserving the clusters (labels). A cluster is preserved if it remains connected, i.e., if it is not split into several clusters and no two clusters are merged. We prove the problem is NP-hard and we give a fixed-parameter algorithm with a constant number of rounds in the massively parallel computation model, where each machine has a sublinear memory and the total memory of the machines is linear. We give an approximation algorithm for a NP-hard special case of the problem. We empirically compare our algorithm with k-means and density-based clustering (DBSCAN) using a dimensionality reduction via locality-sensitive hashing on several directed and undirected graphs of email and computer networks.Open AccessMassively-Parallel Heat Map Sorting and Applications To Explainable Clustering
Given a set of points labeled with $k$ labels, we introduce the heat map sorting problem as reordering and merging the points and dimensions while preserving the clusters (labels). A cluster is preserved if it remains connected, i.e., if it is not split into several clusters and no two clusters are merged. We prove the problem is NP-hard and we give a fixed-parameter algorithm with a constant number of rounds in the massively parallel computation model, where each machine has a sublinear memory and the total memory of the machines is linear. We give an approximation algorithm for a NP-hard special case of the problem. We empirically compare our algorithm with k-means and density-based clustering (DBSCAN) using a dimensionality reduction via locality-sensitive hashing on several directed and undirected graphs of email and computer networks. - Open Access
A Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem (REP) is defined as follows: For $n$ axis-aligned rectangles inside an axis-aligned bounding box $B$, extend each rectangle in only one of the four directions: up, down, left, or right until it reaches $B$ and the density $k$ is minimized, where $k$ is the maximum number of extensions of rectangles to the boundary that pass through a point inside bounding box $B$. REP is NP-hard for $k>1$. If the rectangles are points of a grid (or unit squares of a grid), the problem is called the square escape problem (SEP) and it is still NP-hard. We give a $2$-approximation algorithm for SEP with $k\geq2$ with time complexity $O(n^{3/2}k^2)$. This improves the time complexity of existing algorithms which are at least quadratic. Also, the approximation ratio of our algorithm for $k\geq 3$ is $3/2$ which is tight. We also give a $8$-approximation algorithm for REP with time complexity $O(n\log n+nk)$ and give a MPC version of this algorithm for $k=O(1)$ which is the first parallel algorithm for this problem.Open AccessA Massively Parallel Dynamic Programming for Approximate Rectangle Escape Problem
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem (REP) is defined as follows: For $n$ axis-aligned rectangles inside an axis-aligned bounding box $B$, extend each rectangle in only one of the four directions: up, down, left, or right until it reaches $B$ and the density $k$ is minimized, where $k$ is the maximum number of extensions of rectangles to the boundary that pass through a point inside bounding box $B$. REP is NP-hard for $k>1$. If the rectangles are points of a grid (or unit squares of a grid), the problem is called the square escape problem (SEP) and it is still NP-hard. We give a $2$-approximation algorithm for SEP with $k\geq2$ with time complexity $O(n^{3/2}k^2)$. This improves the time complexity of existing algorithms which are at least quadratic. Also, the approximation ratio of our algorithm for $k\geq 3$ is $3/2$ which is tight. We also give a $8$-approximation algorithm for REP with time complexity $O(n\log n+nk)$ and give a MPC version of this algorithm for $k=O(1)$ which is the first parallel algorithm for this problem. - Open Access
An Efficient Construction of Yao-Graph in Data-Distributed Settings
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we design an algorithm in massively parallel computation (MPC) model for constructing a geometric spanner known as Yao-graph. This improves the total time and the total memory of existing algorithms for geometric spanners from subquadratic to near-linear.
Open AccessAn Efficient Construction of Yao-Graph in Data-Distributed Settings
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we design an algorithm in massively parallel computation (MPC) model for constructing a geometric spanner known as Yao-graph. This improves the total time and the total memory of existing algorithms for geometric spanners from subquadratic to near-linear.
- Open Access
Visibility Extension via Reflection
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first, we consider one guard as a point viewer, and we intend to use reflection to add a certain amount of area to the visibility polygon of the guard. We study visibility with specular and diffuse reflections where the specular type of reflection is the mirror-like reflection, and in the diffuse type of reflection, the angle between the incident and reflected ray may assume all possible values between $0$ and $\pi$. Lee and Aggarwal already proved that several versions of the general Art Gallery problem are $NP$-hard. We show that several cases of adding an area to the visible area of a given point guard are $NP$-hard, too. Second, we assume all edges are reflectors, and we intend to decrease the minimum number of guards required to cover the whole gallery. Chao Xu proved that even considering $r$ specular reflections, one may need $\lfloor \frac{n}{3} \rfloor$ guards to cover the polygon. Let $r$ be the maximum number of reflections of a guard's visibility ray. In this work, we prove that considering $r$ \emph{diffuse} reflections, the minimum number of \emph{vertex or boundary} guards required to cover a given simple polygon $\cal P$ decreases to { $\bf \lceil \frac{\alpha}{1+ \lfloor \frac{r}{8} \rfloor} \rceil$}, where $\alpha$ indicates the minimum number of guards required to cover the polygon without reflection. We also generalize the $\mathcal{O}(\log n)$-approximation ratio algorithm of the vertex guarding problem to work in the presence of reflection.Open AccessVisibility Extension via Reflection
This paper studies a variant of the Art Gallery problem in which the ``walls" can be replaced by \emph{reflecting edges}, which allows the guards to see further and thereby see a larger portion of the gallery. Given a simple polygon $\cal P$, first, we consider one guard as a point viewer, and we intend to use reflection to add a certain amount of area to the visibility polygon of the guard. We study visibility with specular and diffuse reflections where the specular type of reflection is the mirror-like reflection, and in the diffuse type of reflection, the angle between the incident and reflected ray may assume all possible values between $0$ and $\pi$. Lee and Aggarwal already proved that several versions of the general Art Gallery problem are $NP$-hard. We show that several cases of adding an area to the visible area of a given point guard are $NP$-hard, too. Second, we assume all edges are reflectors, and we intend to decrease the minimum number of guards required to cover the whole gallery. Chao Xu proved that even considering $r$ specular reflections, one may need $\lfloor \frac{n}{3} \rfloor$ guards to cover the polygon. Let $r$ be the maximum number of reflections of a guard's visibility ray. In this work, we prove that considering $r$ \emph{diffuse} reflections, the minimum number of \emph{vertex or boundary} guards required to cover a given simple polygon $\cal P$ decreases to { $\bf \lceil \frac{\alpha}{1+ \lfloor \frac{r}{8} \rfloor} \rceil$}, where $\alpha$ indicates the minimum number of guards required to cover the polygon without reflection. We also generalize the $\mathcal{O}(\log n)$-approximation ratio algorithm of the vertex guarding problem to work in the presence of reflection. - 13 March 2023
- Published by Springer Nature
- p. 78-89
Reflective Guarding a Gallery
- Open Access
- 31 August 2022
- Published by Wiley in International Transactions on Electrical Energy Systems
- Vol. 2022, 1-17
Microgrid Stability Improvement Using a Deep Neural Network Controller Based VSG
In order to support the inertia of a microgrid, virtual synchronous generator control is a suitable control method. However, the use of the virtual synchronous generator control leads to unacceptable transient active power sharing, active power oscillations, and the inverter output power oscillation in the event of a disturbance. This study aims to propose a deep neural network controller which combines the features of a restricted Boltzmann machine and a multilayer neural network. To initialize a multilayer neural network in the unsupervised pretraining method, the restricted Boltzmann machine is applied as a very important part of the deep learning controller. The Lyapunov stability method is used to update the weight of the deep neural network controller. The proposed method performs power oscillation damping and frequency stabilization. The experimental and simulation results are presented to assess the usefulness of the suggested method in damping oscillations and frequency stabilization.
- 31 August 2022
- Published by Wiley in International Transactions on Electrical Energy Systems
- Vol. 2022, 1-17
Open AccessMicrogrid Stability Improvement Using a Deep Neural Network Controller Based VSG
In order to support the inertia of a microgrid, virtual synchronous generator control is a suitable control method. However, the use of the virtual synchronous generator control leads to unacceptable transient active power sharing, active power oscillations, and the inverter output power oscillation in the event of a disturbance. This study aims to propose a deep neural network controller which combines the features of a restricted Boltzmann machine and a multilayer neural network. To initialize a multilayer neural network in the unsupervised pretraining method, the restricted Boltzmann machine is applied as a very important part of the deep learning controller. The Lyapunov stability method is used to update the weight of the deep neural network controller. The proposed method performs power oscillation damping and frequency stabilization. The experimental and simulation results are presented to assess the usefulness of the suggested method in damping oscillations and frequency stabilization.
- Open Access
- 16 August 2022
- Published by Hindawi Limited in International Transactions on Electrical Energy Systems
- Vol. 2022, 1-12
A Robust Controller Design for Load Frequency Control in Islanded Microgrid Clusters
In this paper, virtual inertia control (VIC) is suggested to increase the frequency stability in islanded microgrid (MG) clusters. The aim of the suggested control method is to improve damping characteristic of MG clusters including different distributed generations (DGs). The optimal/robust values of the VIC parameters are tuned by a μ-synthesis robust control method. The proposed robust/optimal VIC-based control method is confirmed by various scenarios. Computer simulation and hardware-in-the-loop (HIL) tests are used to show the effectiveness of the suggested method in increasing the damping of the power system. Clearly, different characteristics of the dynamic responses and the results show the practicality of the suggested robust VIC.
- 16 August 2022
- Published by Hindawi Limited in International Transactions on Electrical Energy Systems
- Vol. 2022, 1-12
Open AccessA Robust Controller Design for Load Frequency Control in Islanded Microgrid Clusters
In this paper, virtual inertia control (VIC) is suggested to increase the frequency stability in islanded microgrid (MG) clusters. The aim of the suggested control method is to improve damping characteristic of MG clusters including different distributed generations (DGs). The optimal/robust values of the VIC parameters are tuned by a μ-synthesis robust control method. The proposed robust/optimal VIC-based control method is confirmed by various scenarios. Computer simulation and hardware-in-the-loop (HIL) tests are used to show the effectiveness of the suggested method in increasing the damping of the power system. Clearly, different characteristics of the dynamic responses and the results show the practicality of the suggested robust VIC.
- 29 January 2022
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 15 (2) , 201-216
Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings
- 29 January 2022
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 15 (2) , 201-216
Sampling and sparsification for approximating the packedness of trajectories and detecting gatherings