Gharib Gharibi

Gharib Gharibi

Auto-generated profile, based on publicly available information

Gharib Gharibi

School of Computing and Engineering, University of Missouri-Kansas City, Kansas City, USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
19 February 2021 in Empirical Software Engineering
Verified
Journal Article
Closed access
PDF file
GGGharib Gharibi
Gharib Gharibi
VWVijay Walunj
Vijay Walunj
RNRaju Nekadi
Raju Nekadi
RMRaj Marri
Raj Marri
Yugyung LeeYugyung Lee
Yugyung Lee

1 June 2021 in Journal of Systems and Software
Verified
Journal Article
Open access
RARakan N Alanazi
Rakan N Alanazi
GGGharib Gharibi
Gharib Gharibi
YLYugyung Lee
Yugyung Lee

18 October 2014 in arXiv
Verified
Preprint
Open access
PDF file
WGWajeb Gharibi
Wajeb Gharibi
GGGharib Gharibi
Gharib Gharibi
In this paper, we discuss a new contact way for exchanging personal information using mobile phones. The idea of this invention depends on allocating a special code called Gharibi Code (GC) for each personal mobile and creating a personal information file called Gharibi Face Card (GFC), which has all specified personal data of the mobile phone user. When you request someone's GC code, the other party's phone will send you the GFC of that person. We think that this approach will facilitate the process of communication and exchanging the specified personal data easily, especially when acquaintance. Mobile number, phone and e-mail address, for example, will be sent in a few seconds using a simple code that does not exceed six characters long to transfer a huge amount of personal data through mobile devices rather than using traditional business or visiting cards.

8 September 2020 in arXiv
Verified
Preprint
Open access
PDF file
SGSomaieh Goudarzvand
Somaieh Goudarzvand
GGGharib Gharibi
Gharib Gharibi
Yugyung LeeYugyung Lee
Yugyung Lee
We present a k-competitive learning approach for textual autoencoders named Second Chance Autoencoder (SCAT). SCAT selects the $k$ largest and smallest positive activations as the winner neurons, which gain the activation values of the loser neurons during the learning process, and thus focus on retrieving well-representative features for topics. Our experiments show that SCAT achieves outstanding performance in classification, topic modeling, and document visualization compared to LDA, K-Sparse, NVCTM, and KATE.