Lydia Zeleke

Lydia Zeleke

Auto-generated profile, based on publicly available information

Lydia Zeleke

North Carolina AT State Univ.,Dept. of Electrical Computer Eng.,Greensboro,USA

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
24 February 2022 in IEEE Transactions on Human-Machine Systems
Verified
Journal Article
Open access
BGBiniam Gebru
Biniam Gebru
LZLydia Zeleke
Lydia Zeleke
DBDaniel Blankson
Daniel Blankson
MMMahmoud Nabil Mahmoud
Mahmoud Nabil Mahmoud
SNShamila Nateghi
Shamila Nateghi
ETEdward Tunstel
Edward Tunstel
As complex autonomous systems become increasingly ubiquitous, their deployment and integration into our daily lives will become a significant endeavor. Human–machine trust relationship is now acknowledged as one of the primary aspects that characterize a successful integration. In the context of human–machine interaction (HMI), proper use of machines and autonomous systems depends both on the human and machine counterparts. On one hand, it depends on how well the human relies on the machine regarding the situation or task at hand based on willingness and experience. On the other hand, it depends on how well the machine carries out the task and how well it conveys important information on how the job is done. Furthermore, proper calibration of trust for effective HMI requires the factors affecting trust to be properly accounted for and their relative importance to be rightly quantified. In this article, the functional understanding of human–machine trust is viewed from two perspectives—human-centric and machine- centric. The human aspect of the discussion outlines factors, scales, and approaches, which are available to measure and calibrate human trust. The discussion on the machine aspect spans trustworthy artificial intelligence, built-in machine assurances, and ethical frameworks of trustworthy machines.

9 October 2022
Verified
Conference Paper
Closed access
BLBenjamin Lartey
Benjamin Lartey
LZLydia Zeleke
Lydia Zeleke
XYXuyang Yan
Xuyang Yan
KGKishor Datta Gupta
Kishor Datta Gupta
AHAbdollah Homaifar
Abdollah Homaifar
Ali KarimoddiniAli Karimoddini
Ali Karimoddini
Realtime estimation of travel time is a key traffic parameter for designing and planning for transportation systems, particularly when providing mobility-on-demand (MOD) services. However, the analysis and prediction of travel time can be delayed significantly due to the complexity and huge computational requirements of microsimulation models. Thus, as an alternative solution, we propose a data-driven approach for the efficient and reliable prediction of travel time. Our approach takes advantage of the strengths of SVM and ARIMA for fully capturing the traffic patterns in the traffic data. We introduce a new parameter $\kappa$ into the SVM-ARIMA model to adjust the weight of the ARIMA component, which significantly improves the performance. We validate the performance of the proposed approach using data generated from a microsimulation platform. Our experimental results and comparisons with the existing ML-based methods demonstrates the efficacy of the proposed data-driven approach.

15 July 2025 in Aerospace Science and Technology
Verified
Journal Article
Open access
LZLydia Zeleke
Lydia Zeleke
BLBenjamin Lartey
Benjamin Lartey
AHAbdollah Homaifar
Abdollah Homaifar
MMMahmoud Nabil Mahmoud
Mahmoud Nabil Mahmoud
PKParham Kebria
Parham Kebria
ETEdward Tunstel
Edward Tunstel

3 September 2022 in arXiv
Verified
Preprint
Open access
PDF file
ANAbdul-Rauf Nuhu
Abdul-Rauf Nuhu
KGKishor Datta Gupta
Kishor Datta Gupta
WBWendwosen Bellete Bedada
Wendwosen Bellete Bedada
MMMahmoud Nabil Mahmoud
Mahmoud Nabil Mahmoud
LZLydia Asrat Zeleke
Lydia Asrat Zeleke
ETEdward Tunstel
Edward Tunstel
Generating unsafe sub-requirements from a partitioned input space to support verification-guided test cases for formal verification of black-box models is a challenging problem for researchers. The size of the search space makes exhaustive search computationally impractical. This paper investigates a meta-heuristic approach to search for unsafe candidate sub-requirements in partitioned input space. We present a Negative Selection Algorithm (NSA) for identifying the candidates' unsafe regions within given safety properties. The Meta-heuristic capability of the NSA algorithm made it possible to estimate vast unsafe regions while validating a subset of these regions. We utilize a parallel execution of partitioned input space to produce safe areas. The NSA based on the prior knowledge of the safe regions is used to identify candidate unsafe region areas and the Marabou framework is then used to validate the NSA results. Our preliminary experimentation and evaluation show that the procedure finds candidate unsafe sub-requirements when validated with the Marabou framework with high precision.