Dara Moazzami

Add links
From Wikipedia, the free encyclopedia
Dara Moazzami
دارا معظمی
Born10 December 1949
Tehran, Iran
NationalityIranian
Alma materAlborz High School , University of Quebec-Montreal in Canada, University of Northeastern, Boston, Massachusetts, University of Tehran, College of Engineering, Faculty of Engineering Science, Golpayegan University of Technology
Known forApplied Mathematics, Graph Theory, Discrete Mathematics, Advanced Algorithms, Approximation Algorithms, Vulnerability in Networks, Tenacity Parameter
Scientific career
InstitutionsFaculty of Engineering Science, College of Engineering, University of Tehran; President of Golpayegan University of Technology, Kennesaw State University

Dara Moazzami (b. 10 December 1949) is an Iranian engineering scientist.

Early life[edit]

Dara Moazzami was born on December 10, 1949, in Tehran, Iran. Dara Moazzami's parents were natives of Golpayegan, Isfahan province. His father, the late Amir Gholi Moazzami, was a strong advocate of education. He attended the Saint Louis High School, established by the French government in Tehran. After high school, Amir Gholi earned a BA in Law from the University of Tehran and worked as a judge while continuing his education in different fields at Danesh Sara Ali, where he received a BSc in Mathematics, a BA in Persian Literature, and a BA in French Literature. He also pursued his passion for journalism by establishing the Nakhoda newspaper, which he maintained for several years, and was a poet and the author of a textbook entitled "The Lover's Tears."

Dara's uncle, Dr. Abdollah Moazzami, was a renowned professor of law at the University of Tehran who obtained his Ph.D. in law under the guidance of Professor Gilbert Gidel.[1][2] He also served as a member of the Iranian Parliament for four consecutive terms from 1944 to 1953 and was elected as its Chairman in 1953.[3] Another of Dara's uncles, the late Seyfollah Moazzami, was a renowned electrical engineer and served as the Minister of Post and Telegraph in the second cabinet of Prime Minister Dr. Mohammad Mosaddegh.[4] Growing up in such a highly accomplished family greatly influenced Dara Moazzami and ultimately led him to pursue higher education in mathematics. He earned a BSc in Pure Mathematics in 1976 and an MSc in Applied Mathematics in 1978 from the University of Quebec-Montreal in Canada.[5]

Career[edit]

After completing his studies at the University of Quebec-Montreal, Dara Moazzami returned to Iran and began working at Bu-Ali Sina University in Hamedan. In 1986, while in Hamedan, he translated a book on Differential and Integral Calculus by Piskunov into Persian.[6] He married and later moved to the United States with his family to pursue a doctorate in applied mathematics. In 1992, he received his Ph.D. in applied mathematics, specializing in Graph Theory, from the University of Northeastern-Boston MA, under the supervision of Professors Margaret Cozzens and Samuel Keith Stueckle.[7] During the 1991-1993 academic years, Dara Moazzami served as an Assistant Professor in the Department of Mathematics and Computer Science at the University of Barry-Miami in Florida. Following his time at the University of Barry-Miami, Dara Moazzami returned to Iran and began his teaching and research career at the College of Engineering at the University of Tehran in 1993. He served as the Head of Engineering Library (2000-2003), Associate Dean of the College of Engineering (2003-2006), Deputy of Undergraduate and Graduate Studies at the Department of Engineering Basic Science (2006-2008), and finally as the Chairman of the Department of Engineering Science (2007-2017). He also founded the Journal of Algorithms and Computation and has continued to serve as its Editor-in-Chief to this day.

From 1993 to 2003, Dara Moazzami was employed as a research scientist at both the Center for Theoretical Physics and Mathematics and the Atomic Energy Organization of Iran. He is a research staff member at Engineering Optimization Research Group (2002–present) and a member of the Board of "Center of Excellence of Geomatic Engineering" (2005–present). During the 2010-2012 academic years, Dara Moazzami served as a Visiting Professor in the Department of Mathematics at the University of California Los Angeles (UCLA) in the United States.

Dara Moazzami's primary research interests lie in the fields of Graph Theory, Advanced Algorithms, Complexity Theory, and Approximation Algorithm, with a specific focus on Vulnerability in Networks and Tenacity parameters. He is credited with introducing the concept of graph tenacity, which measures network vulnerability and reliability, alongside his professors Cozzens and Stueckle.[8][9]

Dara Moazzami has translated the widely used and popular textbook on "Graph Theory" by J. A. Bondy and U.S.R. Murty[10] and "Combinatorics" by Bela Bollobas.[11] He is also the author of a textbook on "Differential Equations", which is widely used by Iranian students all over the world. He also translated the textbook "Abstract Algebra: Theory and Application" by Thomas W. Judson, (2017). Dara Moazzami is also the author of three textbooks on topics related to graph theory and network analysis, including "Tenacity Parameter and Their Application in Designing Stable Networks," "Stability and Vulnerability in Networks," and "Graph Drawing." He is also working on two additional books, "Advanced Algorithm: A Guide to the Theory of NP-Completeness" and "Approximation Algorithms." He is also the author of three textbooks on "Tenacity Parameter and Their Application in Designing Stable Networks" and "Stability and Vulnerability in Networks" and "Graph Drawing". Two more books "Advanced Algorithm: A Guide to the Theory of NP-Completeness" and "Approximation Algorithms" are currently in the works. His contributions to the field of mathematics, particularly graph theory and algorithm design, have earned him recognition and respect among the international academic community.

The Tenacity of a Graph[edit]

Professor Moazzami's research interests lie in the field of Graph Theory, Advanced Algorithms, Complexity Theory, and Approximation Algorithm. Particularly, he is interested in vulnerability in networks and tenacity parameters. The concept of graph tenacity was introduced by Cozzens, Moazzami, and Stueckle in their landmark studies[12] [13][14] as a measure of network vulnerability and reliability.

Conceptually, graph vulnerability relates to the study of graph intactness when parts of its elements are removed. Dara Moazzami's research in the area of vulnerability measures in networks is motivated by the need for a better understanding of how to design and analyze networks in hostile environments. The concept of network tenacity, which he helped introduce, serves as a measure of a network's reliability and resilience in the face of various threats and disruptions. His work in this area seeks to address the challenges posed by network security and reliability in real-world scenarios, and to provide practical solutions for improving the stability and robustness of network systems. Graph tenacity has been an active area of research since the concept was introduced in 1992.[15][16] Dr. Moazzami introduced two measures of network vulnerability termed the tenacity, T (G), and the Mix-tenacity, Tm (G), of a graph. The tenacity T (G) of a graph G is defined as

T (G) =

where denotes the order (the number of vertices) of the largest component of and is the number of components of . The Mix-tenacity Tm (G) of a graph G is defined as

T(G) =

where denotes the order (the number of vertices) of the largest component of and s the number of components of . Both parameters of T (G) and Tm (G) have been shown to have important implications. Following the pioneering work of Cozzens, Moazzami, and Stueckle, several groups of researchers have started investigating the tenacity and related problems.[17]

References[edit]

  1. ^ Brinton, J. Y.; Moazzami, Abdollah; Gidel, M. Gilbert (1938). "Brinton, J.Y. (1938): Essai sur la Condition des Etrangers en Iran. Avec une annexe comportant la traduction des lois concernant les _etrangers, et quelques Trait_es types, by Abdollah Moazzami, Pr_eface de M. Gilbert Gidel, Paris: Recueil Sirey, 1937. pp. x, 269. Fr. 65. American Journal of International Law, 32(4), 879{881. doi:10.2307/2190618". The American Journal of International Law. 32 (4): 879. doi:10.2307/2190618. JSTOR 2190618. S2CID 147463009.
  2. ^ Brinton, J. Y.; Moazzami, Abdollah; Gidel, M. Gilbert (1938). "Moazzami, A.: Essai sur la condition des _etrangers en Iran : avec une annexe comportant la traduction des lois concernant les _etrangers, et quelques trait_es types, Th. Univ. de Paris, Libr. du Recueil Sirey, Paris, 275 p., 1937". The American Journal of International Law. 32 (4): 879. doi:10.2307/2190618. JSTOR 2190618. S2CID 147463009.
  3. ^ Painter, David S. (2013). "Abrahamian, E.: The Coup: 1953, the CIA, and the Roots of Modern U.S.-Iranian Relations, The New Press, New York, 2013". The American Historical Review. 118 (5): 1494–1495. doi:10.1093/ahr/118.5.1494.
  4. ^ Painter, David S. (2013). "Abrahamian, E.: The Coup: 1953, the CIA, and the Roots of Modern U.S.-Iranian Relations, The New Press, New York, 2013". The American Historical Review. 118 (5): 1494–1495. doi:10.1093/ahr/118.5.1494.
  5. ^ "Moazzami, D.: Application de la theorie de l'hyperstabilit_e _a quelques modeles _economiques (in English: Application of Hyperstability Theory in some Economics Systems), M.Sc. Universite du Quebec a Montreal 1979, National Library of Canada Publication, Ottawa, 1981" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
  6. ^ "Piskunov, N.: Differential and Integral Calculus, Mir Publishers, Moscow, 1969.7" (PDF). Archived from the original (PDF) on 2019-03-08. Retrieved 2019-03-07.
  7. ^ "Moazzami, D.: Tenacity and its Properties in Stability Calculation, Ph.D. Dissertation, Northeastern University, Boston, 1992" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
  8. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of the Harary graphs, J. Combin. Math. Combin.Comput., 16 (1994), 33{56" (PDF).
  9. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of a graph, Graph Theory, Combinatorics, and Algorithms (Yousef Alavi and Allen Schwenk eds.), Wiley, New York, (1995), 1111{1112" (PDF).
  10. ^ "Bondy, J.A., Murty, and U.S.R.: Graph Theory with Applications, North-Holland, New York, 1976.5" (PDF).
  11. ^ "Bollobas, B.: Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability, Cambridge University Press, Cambridge, 1986.4" (PDF).
  12. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of the Harary graphs, J. Combin. Math. Combin.Comput., 16 (1994), 33{56" (PDF).
  13. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of a graph, Graph Theory, Combinatorics, and Algorithms (Yousef Alavi and Allen Schwenk eds.), Wiley, New York, (1995" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
  14. ^ "Moazzami, D.: Tenacity and its Properties in Stability Calculation, Ph.D. Dissertation, Northeastern University, Boston, 1992" (PDF). Archived from the original (PDF) on 2017-02-04. Retrieved 2019-03-07.
  15. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of the Harary graphs, J. Combin. Math. Combin.Comput., 16 (1994), 33{56" (PDF).
  16. ^ "Cozzens, M.B., Moazzami, D., Stueckle, S.: The tenacity of a graph, Graph Theory, Combinatorics, and Algorithms (Yousef Alavi and Allen Schwenk eds.), Wiley, New York, (1995), 1111{1112" (PDF).
  17. ^ "Moazzami, D.: Tenacity and some related results, Journal of Algorithms and Computation, 49(1) (2017), 83{91. [19] Pardis D_aneshkadeh ha ye Fanni: Tarikhcheh, 2018. [ONLINE] " (PDF).
Retrieved from "https://en.wikipedia.org/w/index.php?title=Dara_Moazzami&oldid=1221718840"