Boris Goldengorin | Computer Science | Best Researcher Award

Posted on by ScienceFather

Prof. Boris Goldengorin | Computer Science | Best Researcher Award

Optimal Management of Tools in Computer Science at Ohio University, United States

Prof. Boris Goldengorin is a globally recognized expert in combinatorial optimization, applied mathematics, and operations research, with a career spanning over five decades. Holding multiple PhDs and a Doctor of Science, he pioneered groundbreaking data correcting algorithms that revolutionized the solving of complex optimization problems such as the Quadratic Cost Partition, Max-Cut, and Traveling Salesman Problems. With over 100 publications in leading international journals and numerous books and monographs, his research has significantly advanced quantitative logistics, supply chain management, and industrial engineering. His algorithms have consistently outperformed global benchmarks, holding world records in solving large-scale combinatorial problems. Prof. Goldengorin has also served as an associate editor for several prestigious journals and has mentored generations of top-performing researchers and students. Honored internationally for his scientific contributions, he continues to influence both theoretical research and practical applications across disciplines, making him a leading figure in modern combinatorial optimization and applied mathematics.

Professional Profile

Education

Prof. Boris Goldengorin possesses an extensive and diverse educational background, reflecting his deep expertise across engineering, applied mathematics, and optimization. He earned his first MSc in Electrical Engineering from Ryazan Radio-Engineering Institute, Russia, in 1967, followed by a second MSc in Applied Mathematics from the Moscow Institute of Electronics and Mathematics in 1973. He completed his PhD in Engineering Sciences at the prestigious VNIINMASH, part of the USSR Ministry of Standardization, in 1975. Further demonstrating his commitment to advanced research, he earned a Doctor of Science (ScD) in Engineering Sciences from the Institute for System Analysis at the USSR Academy of Sciences in 1989. His academic journey continued internationally, obtaining a PhD in Combinatorial Optimization from the University of Groningen, The Netherlands, in 200

Professional Experience

Prof. Boris Goldengorin has built a distinguished career as a researcher, professor, and global leader in combinatorial optimization and operations research. He has held prominent academic and research positions at top institutions, including the University of Groningen (Netherlands), Ohio University (USA), and Khmelnitsky National University (Ukraine), contributing extensively to the fields of mathematical programming, quantitative logistics, and industrial engineering. His pioneering work on data correcting algorithms has shaped modern approaches to solving large-scale optimization problems. Prof. Goldengorin also serves as an associate editor for leading journals such as the Journal of Global Optimization, Journal of Combinatorial Optimization, and Journal of Computational and Applied Mathematics, showcasing his influence in global scientific discourse. Alongside his research, he has mentored generations of students, many of whom have become world-class researchers. His career reflects a rare blend of theoretical innovation, practical application, and global academic leadership, making him a pivotal figure in applied mathematics and operations research.

Research Interest

Prof. Boris Goldengorin’s research interests lie at the intersection of combinatorial optimization, operations research, applied mathematics, and quantitative logistics, where he has made pioneering contributions for over five decades. His primary focus is on developing data correcting algorithms (DCA) and tolerance-based approaches, which have significantly advanced the efficient solving of large-scale optimization problems. His work spans supply chain management, industrial engineering, network analysis, and scheduling problems, with a particular emphasis on benchmark instances such as the Quadratic Cost Partition Problem, Max-Cut Problem, Traveling Salesman Problem, and Simple Plant Location Problem. Beyond classical optimization, Prof. Goldengorin explores the mathematical foundations of algorithmic efficiency and robustness, contributing to big data analysis, game theory, and image processing. His research combines theoretical rigor with computational innovation, enabling faster and more accurate solutions to some of the most computationally challenging problems across disciplines, ensuring long-term impact on both academia and industry applications.

Awards and Honors

Prof. Boris Goldengorin has received numerous awards and honors throughout his illustrious career, recognizing his extraordinary contributions to combinatorial optimization, applied mathematics, and operations research. In 2015, he was named C. Paul Stocker Honorary Professor in Industrial and Systems Engineering at Ohio University, USA. In 2013, the United States Citizenship and Immigration Services (USCIS) granted him Honorable Recognition as an Alien with Extraordinary Ability in Science, Technology, and Education. In 2008, he was recognized as the Best Scientist in Applied Mathematics and Informatics by the Municipality of Khmelnitsky Region, Ukraine. His contributions were further acknowledged in 2005 when Khmelnitsky National University awarded him an Honorary Doctorate in Applied Mathematics and Computer Technologies. Earlier, in 2003, he was named a Fellow in Quantitative Logistics by the Royal Netherlands Academy of Arts and Sciences. These prestigious honors reflect Prof. Goldengorin’s global impact and pioneering role in advancing applied mathematics and optimization research.

Research Skills

Prof. Boris Goldengorin possesses exceptional research skills that span theoretical development, algorithm design, computational experimentation, and interdisciplinary application. His ability to formulate complex combinatorial optimization problems, develop innovative algorithms such as Data Correcting Algorithms (DCA), and rigorously validate their performance through extensive computational benchmarking sets him apart as a world-class researcher. His expertise includes algorithmic design for large-scale optimization problems, quantitative logistics modeling, and supply chain optimization, showcasing his ability to translate mathematical theory into practical solutions. Prof. Goldengorin also excels in analyzing computational complexity, ensuring his algorithms not only produce optimal solutions but do so with unmatched speed and efficiency, often outperforming the leading methods globally. His collaborative research style, combining mentorship, teamwork, and interdisciplinary thinking, has produced high-impact publications across applied mathematics, operations research, game theory, and industrial engineering, making him a highly versatile and innovative researcher with profound analytical and computational skills.

Conclusion

Dr. Boris Goldengorin is highly suitable for the Best Researcher Award.

His exceptional track record in combinatorial optimization, algorithmic innovations, world-record computational achievements, and long-term research leadership position him as a top contender for such a prestigious award.

His global impact, cross-disciplinary contributions, and ability to outperform top research teams in algorithmic efficiency make him a standout figure in applied mathematics, optimization, and industrial engineering.

Publications Top Noted

  • Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization
    M. Jünger, V. Kaibel
    Springer-Verlag
    2005 — 233 citations

  • Branch and peg algorithms for the simple plant location problem
    B. Goldengorin, D. Ghosh, G. Sierksma
    Computers & Operations Research 30 (7), 967-981
    2003 — 112 citations

  • The data-correcting algorithm for the minimization of supermodular functions
    B. Goldengorin, G. Sierksma, G.A. Tijssen, M. Tso
    Management Science 45 (11), 1539-1551
    1999 — 76 citations

  • Improvements to MCS algorithm for the maximum clique problem
    M. Batsyn, B. Goldengorin, E. Maslov, P.M. Pardalos
    Journal of Combinatorial Optimization 27, 397-416
    2014 — 65 citations

  • Network approach for the Russian stock market
    A. Vizgunov, B. Goldengorin, V. Kalyagin, A. Koldanov, P. Koldanov, etc.
    Computational Management Science 11, 45-55
    2014 — 65 citations

  • A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem
    E. Ahmadi, B. Goldengorin, G.A. Süer, H. Mosadegh
    Applied Soft Computing 65, 214-229
    2018 — 60 citations

  • Tolerance-based branch and bound algorithms for the ATSP
    M. Turkensteen, D. Ghosh, B. Goldengorin, G. Sierksma
    European Journal of Operational Research 189 (3), 775-788
    2008 — 54 citations

  • Lower tolerance-based branch and bound algorithms for the ATSP
    R. Germs, B. Goldengorin, M. Turkensteen
    Computers & Operations Research 39 (2), 291-298
    2012 — 47 citations

  • Tolerances applied in combinatorial optimization
    B. Goldengorin, G. Jäger, P. Molitor
    Journal of Computational Science 2 (9), 716-734
    2006 — 47 citations

  • Cell formation in industrial engineering: Theory, Algorithms and Experiments
    B. Goldengorin, D. Krushinsky, P.M. Pardalos
    Springer
    2013 — 45 citations

  • Solving the simple plant location problem using a data correcting approach
    B. Goldengorin, G.A. Tijssen, D. Ghosh, G. Sierksma
    Journal of Global Optimization 25, 377-406
    2003 — 38 citations

  • Requirements of standards: optimization models and algorithms
    B. Goldengorin
    (No specific journal listed)
    1995 — 35 citations

  • Worst case analysis of max-regret, greedy, and other heuristics for multidimensional assignment and traveling salesman problems
    G. Gutin, B. Goldengorin, H.J.
    Journal of Heuristics, 169-181
    2008 — 34 citations

  • Complexity evaluation of benchmark instances for the p-median problem
    B. Goldengorin, D. Krushinsky
    Mathematical and Computer Modelling 53 (9-10), 1719-1736
    2011 — 32 citations

  • Flexible PMP approach for large-size cell formation
    B. Goldengorin, D. Krushinsky, J. Slomp
    Operations Research 60 (5), 1157-1166
    2012 — 31 citations

Dengtian Yang | Computer Science | Best Researcher Award

Posted on by ScienceFather

Mr. Dengtian Yang | Computer Science | Best Researcher Award

Student at Institute of Microelectronics of the Chinese Academy of Sciences, China

Yang Dengtian is a promising researcher in the field of Circuit and System, currently pursuing his Ph.D. at the Institute of Microelectronics of the Chinese Academy of Sciences. His research interests focus on hardware-software co-optimization, object detection, and hardware acceleration, with key contributions in developing post-processing accelerators for object detection and improving micro-architecture design for GPGPU. Yang’s project experience spans from UAV object detection to the design of System on Chip (SoC) and the deployment of deep learning models on specialized hardware like NVDLA IP. His dedication to advancing technology is reflected in his published works in renowned journals. Yang is a proactive learner, often sharing his findings on blogs, contributing to the academic community’s growth. His work is poised to have a significant impact in fields such as artificial intelligence, hardware design, and computer vision.

Professional Profile 

Education

Yang Dengtian began his academic journey at Xi’an Jiaotong University, where he earned his Bachelor’s degree in Electronic Science and Technology in 2020. His strong foundational knowledge in electronics laid the groundwork for his current research. In 2020, he began his Ph.D. at the Institute of Microelectronics of the Chinese Academy of Sciences, specializing in Circuit and System. His doctoral research has primarily focused on hardware-software co-optimization and advanced object detection systems, areas that combine his deep understanding of both electronics and cutting-edge computing techniques. Yang’s education has been integral in shaping his research pursuits, allowing him to contribute valuable insights into hardware acceleration and the optimization of machine learning systems. His academic journey is ongoing, with an expected completion of his Ph.D. in 2025.

Professional Experience

Yang has worked on several innovative projects throughout his academic career. His recent project, “Learn and Improve Vortex GPGPU,” focuses on understanding GPGPU micro-architecture design and developing improvements for performance optimization. Another notable project was the “Post-Processing Accelerator for Object Detection,” where he investigated hardware-software co-optimization methods, contributing to the development of a unified accelerator system for object detection. In 2023, Yang worked on the “SoC Building and Yolox-Nano Network Deployment Based on NVDLA IP,” where he built an SoC with NVDLA IP and deployed a Yolox-Nano model on a specialized hardware platform. Yang has also worked on solutions to reduce off-chip memory accesses for CNN inference and deployed deep learning models using Vitis-AI. These experiences, along with his publications in renowned journals, highlight his advanced technical expertise and problem-solving abilities in cutting-edge electronics and AI research.

Research Interest

Yang Dengtian’s primary research interest lies in the intersection of Circuit and System design, hardware-software co-optimization, and artificial intelligence (AI). His work focuses on developing hardware accelerators for deep learning applications, particularly in object detection and micro-architecture optimization. He is passionate about creating more efficient systems for processing large-scale data, especially in environments that require real-time processing, such as unmanned aerial vehicles (UAVs) and embedded systems. Yang’s research includes developing GPGPU micro-architectures, improving System on Chip (SoC) designs, and enhancing the deployment of deep learning models on specialized hardware, such as NVDLA IP. His research aims to bridge the gap between hardware capabilities and software needs, making AI applications more accessible and efficient. He is particularly interested in creating unified frameworks for hardware-software co-design, which could significantly advance machine learning and computer vision technologies.

Awards and Honors

Yang Dengtian’s outstanding contributions to research have been recognized through various accolades. His publication in reputable journals, such as Information and IEICE Transactions on Information and Systems, demonstrates the impact of his work in the field of hardware and software co-optimization. While still early in his career, Yang’s commitment to research excellence has already led to numerous recognitions in his academic community. He has also been acknowledged for his innovative projects in hardware acceleration for AI applications, particularly in the development of post-processing accelerators for object detection. Yang’s work is a testament to his technical expertise and his potential for future awards as his research continues to make significant strides in the fields of electronics, AI, and machine learning. Given his promising trajectory, Yang is likely to receive further honors as his doctoral studies progress and his body of work grows.

Conclusion

Yang Dengtian is undoubtedly a strong contender for the Best Researcher Award due to his innovative approach to research, technical expertise, and significant contributions to the field of hardware-software co-design and optimization. His passion for learning, combined with his publications and project experience, highlights his potential to make substantial advancements in his area of study. However, expanding his collaborations and enhancing the practical impact of his research could further solidify his status as a leading researcher in the field.

Recommendation: Yang Dengtian is highly deserving of the Best Researcher Award, with his strengths outweighing areas for improvement. His future contributions are expected to have a lasting impact in the fields of object detection, hardware acceleration, and micro-architecture design.

Publications Top Noted

  • Title: Nano-carriers of combination tumor physical stimuli-responsive therapies
    Authors: W Jin, C Dong, D Yang, R Zhang, T Jiang, D Wu
    Journal: Current Drug Delivery
    Volume & Issue: 17 (7), 577-587
    Year: 2020
    Cited by: 7
  • Title: Object Detection Post Processing Accelerator Based on Co-Design of Hardware and Software
    Authors: D Yang, L Chen, X Hao, Y Zhang
    Journal: Information
    Volume & Issue: 16 (1), 63
    Year: 2025
    Cited by: Not yet cited (as of 2025)

 

Sayyed Ahmed | Computer Science | Best Scholar Award

Posted on by ScienceFather

Mr. Sayyed Ahmed | Computer Science | Best Scholar Award

Assistant Professor of  Aligarh Muslim University, India

Dr. Sayyed Usman Ahmed is a dedicated academic and researcher in the field of computer engineering, specializing in artificial intelligence and legal reasoning. He has been recognized for his contributions with awards such as the Best Paper Award (2022-23) and the Visvesvaraya Part-Time PhD Fellowship (2018-19). His teaching and research continue to inspire and shape the next generation of engineers and technologists.

Publication profile

Education

Dr. Sayyed Usman Ahmed holds a Ph.D. in Computer Engineering from Aligarh Muslim University (AMU), India, where he conducted research on “Decision Intelligence in Augmentation of Legal Reasoning” under the supervision of Prof. Nesar Ahmad. His thesis was submitted on March 6, 2024. He earned his M.Tech in Computer Engineering from Rajasthan Technical University (2012-2014) with a thesis on evaluating the efficiency and effectiveness of code reading techniques, supervised by Dr. Rajendra Purohit. He completed his B.Tech in Computer Engineering from AMU (2003-2007), with a project on fingerprint detection systems under the guidance of Prof. M. Sarosh Umar and Prof. Syed Atiqur Rahman.

Experience

Dr. Ahmed has extensive experience in academia and industry. He is currently an Assistant Professor at AMU, teaching courses in software engineering, data structures, information security, and programming labs. He has also served as a Deputy Head of the Information Technology department at Jodhpur Institute of Engineering and Technology, where he contributed significantly to teaching, course development, and departmental administration. In the industry, he has worked as an Application Software Engineer at Computer Science Corporation, focusing on software maintenance, bug fixes, and enhancements. Additionally, he has served in various capacities at the Computer Centre of AMU, including roles as a Programmer and Technical Consultant.

Research focus

Dr. Ahmed’s research interests encompass artificial intelligence, machine learning, natural language processing, and decision intelligence. He has published extensively in journals and conferences, focusing on areas such as sentiment analysis, depression detection from social media posts, rumor-free social networks, and news article summarization. His recent research includes a framework for legal case brief generation using natural language processing and smart contract generation through NLP and blockchain.

Publication top notes

1. Ahmad, T., Ahamad, M., Ahmed, S. U., Ahmad, N. (2022) Short question-answers
assessment using lexical and semantic similarity based features, Journal of Discrete
Mathematical Sciences and Cryptography, 25:7, 2057-2067, DOI:
10.1080/09720529.2022.2133245 [ESCI & Scopus]

2. Ahmed, S. U., Ahmad, T., Ahmad, N. (2022). Sentiment Analysis Techniques for
Depression Detection from Micro-Blogging Social Media Post. NueroQuantology
DOI: 10.14704/NQ.2022.20.12.NQ77265 [Scopus]

3. Ahmad, T., Ahmed, S. U., Ali, S. O., & Khan, R. (2020). Beginning with exploring the
way for rumor free social networks. Journal of Statistics and Management Systems, 23(2),
231-238. https://doi.org/10.1080/09720510.2020.1724623 [Web of Science]

4. Ahmad, T., Ahmed, S. U., Ahmad, N., Aziz, A., Mukul, L. (2020). News Article
Summarization: Analysis and Experiments on Basic Extractive Algorithms. International
Journal of Grid and Distributed Computing, 13(2), 2366 – 2379. [Web of Science]

5. Ahmed, S. U. (2018). Monitoring Unscheduled Leaves using IVR. Global Journal of
Computer Science and Technology, 18(1), 7–9. [Peer-reviewed]

6. Ahmed, S. U., & Purohit, R. (2014). Evaluating Efficiency and Effectiveness of Code
Reading Technique with an Emphasis on Enhancing Software Quality. International
Journal of Computer Applications, 2, 32-36. [Peer-reviewed]

7. Ahmed, S. U., Azmi, M. A., Badgujar, C., (2014). How to design and test safety critical
software systems. International Journal of Advances in Computer Science and Technology,
3(1), 19-22. [Peer-reviewed]

8. Ahmed, S. U., Sahare, S. A., & Ahmed, A. (2013). Automatic test case generation using
collaboration UML diagrams. World Journal of Science and Technology. 2, [Peerreviewed]

9. Ahmed, S. U., & Azmi, M. A. (2013). A Novel Model Based Testing (MBT) approach for
Automatic Test Case Generation. International Journal of Advanced Research in
Computer Science, 4(11), 81-83. [Peer-reviewed]

Journal Publications (Under Review)
1. Ahmed, S. U., Ahmed, N., Ahmad, T. (2023) A Rhetorical Role Relatedness (RRR)
framework for Legal Case Brief Generation Natural Language Processing Journal
(Elsevier, Submitted)