Rakesh Koppunur

Rakesh Koppunur

Auto-generated profile, based on publicly available information

Rakesh Koppunur

Department of ME, Koneru Lakshamaih Education Foundation, Vaddeswaram Andhra Pradesh, India

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
28 August 2022 in Advances in Materials Science and Engineering
Verified
Journal Article
Open access
PDF file
RKRakesh Koppunur
Rakesh Koppunur
KDKiran Kumar Dama
Kiran Kumar Dama
URUzwal Kiran Rokkala
Uzwal Kiran Rokkala
BTBalaji Thirupathi
Balaji Thirupathi
SSSagar N V S S
Sagar N V S S
Bhiksha GugulothuBhiksha Gugulothu
Bhiksha Gugulothu
Patient-specific implants are well known for fixing the fracture for bone repairs. However, the exact fixation of the fabricated implant to the patients is a challenging task. To overcome this problem, in the present study two kinds of designs are developed and fabricated. Based on the exact fitting to the patient’s oral system, the best design is selected to fabricate. Computed tomography (CT) scan data of the patient oral anatomy is converted into a 3D model using the DICOM Software “Slicer 3D.” The patient-specific maxillofacial implant is fabricated using fused filament fabrication (FFF) and direct metal laser sintering (DMLS) techniques. Before fabricating real time product, a prototype is fabricated at the initial stage using FFF. Later, stress distribution and displacement of the implant was investigated using a FEM simulation. The conclusion of the present work results are potential for FFF of patient-specific implants out of Ti-6Al-4V.

30 April 2023 in Journal of Maxillofacial and Oral Surgery
Verified
Journal Article
Closed access
PDF file
CCChitra Chakravarthy
Chitra Chakravarthy
RPRavi S. Patil
Ravi S. Patil
SWShivraj Wagdargi
Shivraj Wagdargi
SMSantosh Kumar Malyala
Santosh Kumar Malyala
DSDaisy Arahna Sofhia
Daisy Arahna Sofhia
AMAishwarya Mundodi
Aishwarya Mundodi

1 January 2023 in AIP Conference Proceedings
Verified
Conference Paper
Open access
PDF file
APA. V. R. Surya Prasad
A. V. R. Surya Prasad
NMNageswara Rao Medikondu
Nageswara Rao Medikondu
MRM. B. S. Sreekara Reddy
M. B. S. Sreekara Reddy
KRK. Rakesh
K. Rakesh
ASA. Shanthi Swaroopini
A. Shanthi Swaroopini
PSPreetam Kumar Sahu
Preetam Kumar Sahu
In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move. Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.

1 January 2023 in AIP Conference Proceedings
Verified
Conference Paper
Open access
PDF file
APA. V. R. Surya Prasad
A. V. R. Surya Prasad
NMNageswara Rao Medikondu
Nageswara Rao Medikondu
MRM. B. S. Sreekara Reddy
M. B. S. Sreekara Reddy
RKRakesh K.
Rakesh K.
KRK. S. Raghuram
K. S. Raghuram
TMTribhuwan Kishor Mishra
Tribhuwan Kishor Mishra
Informed search algorithms in Artificial intelligence are applied to execute the arrangement in cloud. The Best First Search (BFS) is used to allocate the job to Practical Machine (PM) and Virtual Vehicle (VV). In the BFS the best one as first priority assortment of job is used which may relegate the concert of cloud for minimization of Operational Completion Time (OCT). In the cloud computing environment most noteworthy problem is task scheduling to augment the concert and effectiveness of cloud it is an important move The best job selection is enhanced with job assortment, PM selection and VV algorithms. The performance of BFS compared with other task scheduling algorithms.