Xiang Li | Computer Science | Best Researcher Award

Published on by Global Scholar Awards

Ms. Xiang Li | Computer Science | Best Researcher Award

PHD candidate at University of Chinese Academy of Sciences, China

Xiang Li, a Ph.D. candidate at the University of Chinese Academy of Sciences, demonstrates exceptional potential for the Best Researcher Award. With a solid academic foundation—ranking in the top 5–7% throughout his studies—he has excelled in areas such as deep learning, stochastic processes, and pattern recognition. His research focuses on cross-domain few-shot learning, addressing real-world challenges like medical lesion detection and remote sensing scene classification. He has published in the prestigious Knowledge-Based Systems journal and submitted another to IEEE Transactions on Geoscience and Remote Sensing. Xiang has also earned accolades, including the Second Prize in the National Mathematical Modeling Competition and a top-tier finish in the Huawei Software Elite Challenge. His future interests in class-incremental learning and prompt tuning highlight a clear vision for impactful research. Overall, Xiang Li’s innovative contributions, academic excellence, and commitment to advancing AI technologies make him a strong and deserving candidate for this recognition.

Professional Profile 

Education

Xiang Li has demonstrated outstanding academic performance throughout his educational journey. He earned his Bachelor’s degree in Information and Computer Science from Shandong University, graduating in July 2021 with an impressive GPA of 91.73/100, placing him in the top 7.46% of his class. His coursework included high-level subjects such as Mathematical Statistics, Operations Research, and Advanced Algebra, in which he consistently achieved top scores. Following this, he was admitted to the University of Chinese Academy of Sciences, where he completed foundational Ph.D. training from September 2021 to July 2022, ranking in the top 5% with a GPA of 87.13/100. His advanced studies covered critical areas like Matrix Analysis, Deep Learning, and Pattern Recognition. Currently, he is conducting doctoral research at the Institute of Optics and Electronics, Chinese Academy of Sciences, focusing on cross-domain few-shot learning. His educational background reflects strong technical competence and a solid foundation for innovative research.

Professional Experience

Xiang Li has accumulated valuable professional research experience during his Ph.D. studies at the Institute of Optics and Electronics, Chinese Academy of Sciences. His primary research focuses on cross-domain few-shot learning, a vital area in artificial intelligence that addresses challenges in data-scarce environments. He has led and contributed to key projects, including the development of a dynamic representation enhancement framework to improve model generalization across different domains, and the fine-tuning of general pre-trained models for few-shot remote sensing scene classification. In addition to research, Xiang has actively participated in national competitions, winning third prize in the Huawei Software Elite Challenge for designing a traffic scheduling plan and contributing to infrared small target detection strategies in another competition. These experiences highlight his strong technical problem-solving skills, teamwork, and ability to apply theoretical knowledge to real-world challenges. His professional work reflects both depth and versatility, positioning him as a highly capable and innovative young researcher.

Research Interest

Xiang Li’s research interests lie at the forefront of artificial intelligence, with a strong focus on cross-domain few-shot learning, computer vision, and representation learning. He is particularly interested in developing algorithms that enable models to perform effectively in data-scarce scenarios, addressing the challenges posed by domain shifts and limited labeled data. His current work involves enhancing the representational capacity of models to learn diverse and meaningful features across domains, with applications in medical image analysis and remote sensing. Xiang is also exploring techniques for fine-tuning general pre-trained models to adapt to new tasks without extensive retraining. Looking ahead, he is keen on advancing research in few-shot class-incremental learning, where models continuously adapt to new classes with minimal data, and in prompt tuning for vision-language pre-trained models, which integrates natural language processing with visual recognition. His interests reflect a forward-thinking approach to building intelligent systems capable of learning efficiently and generalizing across tasks.

Award and Honor

Xiang Li has received several prestigious awards and honors in recognition of his academic excellence and research capabilities. During his undergraduate and doctoral studies, he was consistently awarded scholarships from both Shandong University and the University of Chinese Academy of Sciences, reflecting his outstanding academic performance and dedication. In June 2022, he was named a Merit Student at the University of Chinese Academy of Sciences, an honor reserved for top-performing students. His strong analytical and problem-solving skills were further recognized in national competitions, where he earned the Second Prize in the National College Students’ Mathematical Modeling Competition in 2019. Additionally, he played a key role in a team that won third prize in the Huawei Software Elite Challenge, a highly competitive event involving over 300 teams. These honors highlight his ability to excel both academically and practically, reinforcing his position as a promising and accomplished young researcher in the field of computer science.

Research skill

Xiang Li possesses a strong set of research skills that make him a capable and innovative scholar in the field of artificial intelligence and computer vision. His expertise spans advanced areas such as cross-domain few-shot learning, deep learning, and representation learning. He demonstrates exceptional analytical abilities, evident in his design and implementation of dynamic representation frameworks to enhance model generalization across diverse domains. Xiang is proficient in applying theoretical concepts to practical problems, as seen in his work on fine-tuning pre-trained models for remote sensing scene classification. His skill set includes programming, algorithm development, statistical analysis, and critical thinking, which he has effectively applied in both solo research and collaborative projects. Furthermore, his ability to publish in top-tier journals, such as Knowledge-Based Systems, reflects his competence in scientific writing, experimental design, and result interpretation. These research skills enable him to tackle complex challenges and contribute meaningfully to the advancement of intelligent systems.

Conclusion

Xiang Li is a highly promising young researcher with a solid academic foundation, well-defined research focus, and impactful contributions in the field of computer vision and machine learning. His achievements in cross-domain few-shot learning, publication in a top-tier journal, and award-winning competition experience clearly demonstrate excellence in research and innovation.

Publications Top Noted

  • Title: RSGPT: A remote sensing vision language model and benchmark
    Authors: Y. Hu, Yuan; J. Yuan, Jianlong; C. Wen, Congcong; Y. Liu, Yu; X. Li, Xiang
    Year: 2025

  • Title: Uni3DL: A Unified Model for 3D Vision-Language Understanding
    Authors: X. Li, Xiang; J. Ding, Jian; Z. Chen, Zhaoyang; M. Elhoseiny, Mohamed
    Year: 2025 (Conference Paper)

  • Title: 3D Shape Contrastive Representation Learning With Adversarial Examples
    Authors: C. Wen, Congcong; X. Li, Xiang; H. Huang, Hao; Y.S. Liu, Yu Shen; Y. Fang, Yi
    Year: 2025
    Journal: IEEE Transactions on Multimedia
    Citations: 4

  • Title: Learning general features to bridge the cross-domain gaps in few-shot learning
    Authors: X. Li, Xiang; H. Luo, Hui; G. Zhou, Gaofan; M. Li, Meihui; Y. Liu, Yunfeng
    Year: 2024
    Journal: Knowledge-Based Systems
    Citations: 1

Boris Goldengorin | Computer Science | Best Researcher Award

Published on by Global Scholar Awards

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