11 July 2023 in Case Studies in Thermal Engineering
28 September 2023 in Case Studies in Thermal Engineering
1 October 2023 in Case Studies in Thermal Engineering
9 April 2024 in Case Studies in Thermal Engineering
1 January 2023 in Open Physics
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
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).