Jump to content

Dara Moazzami: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Cewbot (talk | contribs)
m Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Cleanup
Line 1: Line 1:
{{Multiple issues|
{{Orphan|date=April 2019}}
{{Orphan|date=April 2019}}
{{cleanup|reason=Some grammar and sentence structure errors.|date=March 2019}}
{{cleanup|reason=Some grammar and sentence structure errors.|date=March 2019}}
}}


{{Infobox scientist
{{Infobox scientist

Revision as of 05:50, 1 June 2020

Dara Moazzami
دارا معظمی
File:DaraMoazzami.jpg
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

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

Early life

Dara Moazzami was born from a famous and well-educated family. He was born on December 10, 1949 in Tehran, Iran. He attended the highly prestigious Alborz High School located in the heart of Tehran, Iran.

His parents were originally from Golpayegan, Isfahan province. His father, the late Amir Gholi Moazzami had always been a big proponent of education and sciences. He attended the French School and High School “Saint Louis” which had been established by the French Government in Tehran. After graduating High School, he received a BA degree in Law from University of Tehran and practiced as a Judge. Meanwhile, he continued his education in “Danesh Sara Ali” in two very different disciplines and received a BSc in Mathematics, a BA in Persian literature, as well as a BA in French Literature. He also enjoyed journalism and established the “Nakhoda newspaper” maintained it for several years thereafter. He also was a poet and the author of a textbook on “Ashg Ashegh” meaning “The Lover’s Tears”.

Dara's uncle, Dr. Abdollah Moazzami was a famous professor of law at the University of Tehran who received his Ph.D. in law under the supervision of Professor Gilbert Gidel.[1][2] He was also a member of Iranian Parliament for four consecutive terms from 1944 to 1953.[3] In 1953 he was elected as the Chairman of the Parliament. Dara's other uncle, the late Seyfollah Moazzami was an electrical engineer and a minister of post and telegraph in the second cabinet of the Prime Minister Dr. Mohammad Mosaddegh.[4] Growing up in such a family influenced Dara Moazzami and he eventually moved to Canada to study mathematics. He received a B.Sc in Pure Mathematics in 1976, and an M.Sc in Applied Mathematics in 1978,[5] from the University of Quebec-Montreal in Canada.

Career

After graduating from the University of Quebec-Montreal, he returned to Iran and started working at Bu-Ali Sina University in the city of Hamedan. In 1986, while he was in Hamedan, Dr. Moazzami translated a book on Differential and Integral Calculus by Piskunov[6] into Farsi. He got married there and later moved to the United States with his family to obtain a doctorate in applied mathematics. In 1992, he received his Ph.D. in applied mathematics (Graph Theory) from the University of Northeastern-Boston MA, under the supervision of Professor Margaret Cozzens and Professor Samuel Keith Stueckle.[7] He worked as an Assistant Professor for the 1991-1993 academic years in the Department of Mathematics and Computer Science at the University of Barry-Miami, in Florida. After that, he returned to Iran and started his teaching and research career in the College of Engineering at the University of Tehran in 1993. He was 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 the Chairman of the Department of Engineering Science (2007-2017). He also founded the Journal of Algorithms and Computation and has remained as its Editor-in-Chief till present.

Between the years of 1993 and 2003, he worked as a research scientist at the Center for Theoretical Physics and Mathematics as well as 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).

He was a Visiting Professor in the Department of Mathematics at the University of California Los Angeles (UCLA), USA (2010-2012).

His main research interests include Graph Theory, Advanced Algorithms, Complexity Theory, and Approximation Algorithm, in particular, Vulnerability in Networks and Tenacity parameter. The concept of graph tenacity was introduced by Dara Moazzami and his professors Cozzens and Stueckle as a measure of network vulnerability and reliability.[8][9]

Dara Moazzami is the translator of 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 is the translator of textbook on "Abstract Algebra: Theory and Application" by Thomas W. Judson, (2017). 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 works.

The Tenacity of a Graph

Professor Moazzami's research interests lie on the field of Graph Theory, Advanced Algorithms, Complexity Theory, and Approximation Algorithm. Particularly, he is interested in vulnerability in networks and tenacity parameter. 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. The motivation for studying vulnerability measures is derived from the design and analysis of networks in a hostile environment. 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 a 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 a largest component of and s the number of components of . Both parameters of T (G) and Tm (G) have 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]

Department of Engineering Science

After the establishment of the University of Tehran in 1934, the College of Engineering, as one of the first six faculties of the University was founded through the efforts made by the late Professor Mahmoud Hesabi. It began its activities by admitting 40 students in the fields of Civil, Electromechanical, and Mining Engineering in the same year.

One of the oldest departments in the College of Engineering at the University of Tehran was the Department of Engineering Basic Sciences which was established to provide general courses such as mathematics, physics, chemistry, literature and so on for the engineering students.[18] Later, in 2007, under supervision of Prof. Dara Moazzami this department became the Department of Engineering Science, which he became a Chairman of. Since Dr. Moazzami was the leader of the team to establish the first Department of Engineering Science (University of Tehran) in Iran, he has been entitled as the Father of Engineering Science in Iran.

The Engineering Science Program is a multi-departmental and interdisciplinary program. This undergraduate program encompasses a variety of closely related areas of physics, mathematical sciences, and engineering. It is intended to provide a means whereby students can acquire knowledge of engineering methods, while pursuing their interests in areas of natural science. The options offered within the curriculum prepare students for advanced studies in engineering and science. There are three fully structured majors in the curriculum including:* Computational Engineering Science

  • Engineering Mathematics
  • Engineering Physics

Department of Algorithms and Computation

With efforts of Prof. Dara Moazzami, the Department of Algorithms and Computation was established in 2005 when he became the Chairman of the Faculty of Engineering Science.

In 2016 the first group of PhD. Students were accepted into this Department.

Master of Science and PhD in Algorithms and Computation cover very broad areas of algorithms and computation. The scope of this program includes both theoretical and applied research from these fields. The main aim of this program is to promote the exchange of ideas in this active research community. The specific themes targeted for Master of science in Algorithms and Computation are Computational Geometry, Algorithms and Data Structures, Approximation Algorithms, Randomized Algorithms, Graph Drawing and Graph Algorithms, Combinatorial Algorithms, Graphs in Bioinformatics, String Algorithms, Combinatorial Optimization, Computational Biology, Computational Finance, Cryptography, and Parallel and Distributed Algorithms.

The Journal of Algorithms and Computation

The Journal of Algorithms and Computation, currently, published in English, is a continuation of the Journal of the Faculty of Engineering "Fani" at the University of Tehran. This Journal has been publishing in Farsi from 1980 till 2012. The Journal of "Fani" published 43 volumes during this period. Following 2012, the Faculty of Engineering has concluded to have several journals in English.

The aim of the Journal of Algorithms and Computation is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of the brief outlines of recent research results, the detailed presentation of which might be submitted for possible publication in the Journal of Algorithms and Computation or elsewhere. The journal also publishes a limited number of book announcements as well as proceedings of conferences. These proceedings are fully reviewed and adhere to the general standards of the journal. The founder (and also the Editor-in-Chief) of the journal is Dara Moazzami. The members of the editorial board are Kambiz Badie, Eiichi Bannai, Helene Barcelo, Richard A. Brualdi, Hassan Emamirad, Hans-Dietrich Gronau, Gyula O. H. Katona, Daniel Kleitman, Jacobus H. Koolen, Charles C. Lindner, Spyros Magliveras, Mirka Miller, Ali Moeini, Ali Movaghar, Talmage James Reid, Akira Saito, Richard P. Stanley, Walter Denis Wallis, and Qiang (Steven) Wang.

Publications

Moazzami's research area includes vulnerability in Networks and tenacity parameter. He is the author of more than 175 scientific papers.

Honors/Awards

- Member of Editorial Board of Engineering Journal "Fani" University of Tehran.

- Editor - in Chief Journal of Algorithms and Computation.

- Member of Board of Center of Excellence in Geomatic Engineering and Disaster Management.

- Elite Professor of Tehran University.

References

  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.
  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.
  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).
  6. ^ "Piskunov, N.: Differential and Integral Calculus, Mir Publishers, Moscow, 1969.7" (PDF).
  7. ^ "Moazzami, D.: Tenacity and its Properties in Stability Calculation, Ph.D. Dissertation, Northeastern University, Boston, 1992" (PDF).
  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).
  14. ^ "Moazzami, D.: Tenacity and its Properties in Stability Calculation, Ph.D. Dissertation, Northeastern University, Boston, 1992" (PDF).
  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).
  18. ^ "Alumni Association of The Faculty of Engineering at University of Tehran, Daneshkadeh Fanni dar Hal e Hazer, 2018. [ONLINE] ".

Further reading