Yijie Li

Yijie Li

Auto-generated profile, based on publicly available information

Yijie Li

School of Computer Science, University of St Andrews, St Andrews, Scotland, UK

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 July 2023 in Case Studies in Thermal Engineering
Verified
Journal Article
Open access
YLYijie Li
Yijie Li
AMAaqib Majeed
Aaqib Majeed
NINouman Ijaz
Nouman Ijaz
KBKamal Barghout
Kamal Barghout
MAMohamed R. Ali
Mohamed R. Ali
TMTaseer Muhammad
Taseer Muhammad

28 September 2023 in Case Studies in Thermal Engineering
Verified
Journal Article
Open access
YLYijie Li
Yijie Li
YLYuchi Leng
Yuchi Leng
NBNarjes Baazaoui
Narjes Baazaoui
Muhammad Bilal ArainMuhammad Bilal Arain
Muhammad Bilal Arain
NINouman Ijaz
Nouman Ijaz
AHAhmed M Hassan
Ahmed M Hassan

1 October 2023 in Case Studies in Thermal Engineering
Verified
Journal Article
Open access
YLYijie Li
Yijie Li
YLYuchi Leng
Yuchi Leng
MSMahnoor Sarfraz
Mahnoor Sarfraz
NGNevine M. Gunaime
Nevine M. Gunaime
JAJawad Ahmed
Jawad Ahmed
MEMohamed Abdelghany Elkotb
Mohamed Abdelghany Elkotb

9 April 2024 in Case Studies in Thermal Engineering
Verified
Journal Article
Open access
YLYuchi Leng
Yuchi Leng
YLYijie Li
Yijie Li
HAHaris Anwaar
Haris Anwaar
SSSidra Shaheen
Sidra Shaheen
MAMuhammad Bilal Arain
Muhammad Bilal Arain
AZAhmed M. Zidan
Ahmed M. Zidan

1 January 2023 in Open Physics
Verified
Journal Article
Open access
PDF file
LYLiping Yu
Liping Yu
SSS. Berlin Shaheema
S. Berlin Shaheema
JSJ. Sunil
J. Sunil
VGVediyappan Govindan
Vediyappan Govindan
PMP. Mahimiraj
P. Mahimiraj
AHAhmed M. Hassan
Ahmed M. Hassan
Breast cancer diagnosis relies on breast ultrasound (BUS) and the early breast cancer screening saves lives. Computer-aided design (CAD) tools diagnose tumours via BUS tumour segmentation. Thus, breast cancer analysis automation may aid radiologists. Early detection of breast cancer might help the patients to survive and in context with this many approaches have been demonstrated by different researches, however, some of the works are weak in the segmentation of breast cancer images. to tackle these issues, this study propose a novel Hybrid Attendseg based gravitational clustering optimization (HA-GC) method which is utilized to segment breast cancer as normal malignant, and benign. For this we have taken the dataset known as breast ultrasound (BUS) images. This method constructively segments the breast cancer images. Prior to the segmentation, pre-processing is carried out which can be used to normalize the images incorporated with the removal of unwanted noises and format the images Optimization selects the best qualities. An experiment is conducted and compared the results with the parameters such as Dice coefficient, Jacquard, Precision, and Recall and attained over 90% and ensures the usage of present work in the segmentation of breast cancer images.

12 March 2024 in RAIRO - Operations Research
Verified
Journal Article
Open access
YLYijie Li
Yijie Li
This paper studies the multi-objective problem of scheduling n two-component jobs on a fabrication machine with bounded batch capacity in terms of the number of jobs. Each job consists of two components, one is common among all jobs (called standard component) and the other is unique to itself (called specific component). The machine processes all components so that it might become a capacitated bottleneck machine. Standard components have equal processing times. They are fabricated in batches sequentially on the machine, and a setup time is required to fabricate a batch. Each batch contains the standard components of at most b(b < n) jobs. Specific components are manufactured individually, therefore their associated setup times could be absorbed into their processing times. Standard components in a batch are not available until all these components are completed (meaning that the processing time of a batch is equal to the total processing time of the standard components in it), whereas a specific component is available on completion of its processing. A job is completed when both its two components are completed and available. For simultaneous optimization of makespan and maximum lateness, an O(n3)-time algorithm is obtained. Through a careful use of the heap data structure, the time bound can be improved to O(n2 log n). For hierarchical optimization of two maximum lateness objectives and makespan, an O(n5)-time algorithm is obtained, which can be improved to run in time O(n4).