Kubra Sarac

Kubra Sarac

Auto-generated profile, based on publicly available information

Kubra Sarac

Institute of Biomedical Engineering, Bogazici University, Istanbul, Turkey

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
12 September 2008 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
MBMehmet Baysan
Mehmet Baysan
KSKamil Sarac
Kamil Sarac
RCRamaswamy Chandrasekaran
Ramaswamy Chandrasekaran
SBSergey Bereg
Sergey Bereg
Network-wide broadcast (simply broadcast) is a frequently used operation in wireless ad hoc networks (WANETs). One promising practical approach for energy-efficient broadcast is to use localized algorithms to minimize the number of nodes involved in the propagation of the broadcast messages. In this context, the minimum forwarding set problem (MFSP) (also known as multipoint relay (MPR) problem) has received a considerable attention in the research community. Even though the general form of the problem is shown to be NP-complete, the complexity of the problem has not been known under the practical application context of ad hoc networks. In this paper, we present a polynomial time algorithm to solve the MFSP for wireless network under unit disk coverage model. We prove the existence of some geometrical properties for the problem and then propose a polynomial time algorithm to build an optimal solution based on these properties. To the best of our knowledge, our algorithm is the first polynomial time solution to the MFSP under the unit disk coverage model. We believe that the work presented in this paper will have an impact on the design and development of new algorithms for several wireless network applications including energy-efficient multicast, broadcast, and topology control protocols for WANETs and sensor networks.

4 January 2024 in Journal of Engineering and Applied Science
Verified
Journal Article
Open access
PDF file
KSKubra Sarac
Kubra Sarac
AGAlbert Guvenis
Albert Guvenis
Knowing human papillomavirus (HPV) status has important consequences for treatment selection in oropharyngeal cancer. The gold standard is to perform a biopsy. The objective of this paper is to develop a new computed tomography (CT) radiomics-based non-invasive solution to HPV status determination and investigate if and how it can be a viable and accurate complementary technique. Two hundred thirty-eight patients’ CT scans were normalized and resampled. One thousand one hundred forty-two radiomics features were obtained from the segmented CT scans. The number of radiomic attributes was decreased by applying correlation coefficient analysis, backward elimination, and random forest feature importance analysis. Random over-sampling (ROSE) resampling algorithm was performed on the training set for data balancing, and as a result, 161 samples were obtained for each of the HPV classes of the training set. A random forest (RF) classification algorithm was used as a prediction model using five-fold cross-validation (CV). Model effectiveness was evaluated on the unused 20% of the imbalanced data. The applicability of the model was investigated based on previous research and error rates reported for biopsy procedures. The HPV status was determined with an accuracy of 91% (95% CI 83–99) and an area under the curve (AUC) of 0.77 (95% CI 65–89) on the test data. The error rates were comparable to those encountered in biopsy. As a conclusion, radiomics has the potential to predict HPV status with accuracy levels that are comparable to biopsy. Future work is needed to improve standardization, interpretability, robustness, and reproducibility before clinical translation.


3 June 2004
Verified
Conference Paper
Closed access
KSK. Sarac
K. Sarac
PNP. Namburi
P. Namburi
KAK.C. Almeroth
K.C. Almeroth