Search

Your search keyword '"Hussain, Shahid"' showing total 3,256 results
Start Over Author "Hussain, Shahid"
3,256 results on '"Hussain, Shahid"'

1. Fuzzy Logic Weight based Coordination Scheme for Utilizing Electric Vehicle Charging Stations

Author

Hussain, Shahid and Kim, Young-Chon

Subjects
Computer Science - Emerging Technologies
Abstract

The larger battery capacities and the longer waiting and charging time of electric vehicles (EVs) results in low utilization of charging stations (CSs). This paper, proposes fuzzy logic weight based coordination (FLWC) scheme to enhance the utilization of CSs. Each EV has an associated uncertain information including stay time and the current state-of-charge (SoC). The fuzzy logic controller (FLC) analyze these inputs and determines a weight value. The proposed FLWC scheme then allocates CSs to the EVs according to the weight values. The proposed scheme is simulated for 100 EVs and 5 CSs using Matlab. The simulation result shows about 30% improvement in the average utilization of CSs as compared to first-come-first-serve (FCFS) based scheme.

Published
2024

2. On graphs with well-distributed edge density

Author

Hassan, Syed Mujtaba and Hussain, Shahid

Subjects
Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Mathematics - Combinatorics, 05C15, 05C42, 05C07 (Primary) 05C75, 05C69, 05C25 (Secondary)
Abstract

In this paper, we introduce a class of graphs which we call average hereditary graphs. Most graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as regular graphs, trees and other popular classes of graphs. We prove a new upper bound for the chromatic number of a graph in terms of its maximum average degree and show that this bound is an improvement on previous bounds. From this, we show a relationship between the average degree and the chromatic number of an average hereditary graph. This class of graphs is explored further by proving some interesting properties regarding the class of average hereditary graphs. An equivalent condition is provided for a graph to be average hereditary, through which we show that we can decide if a given graph is average hereditary in polynomial time. We then provide a construction for average hereditary graphs, using which an average hereditary graph can be recursively constructed. We also show that this class of graphs is closed under a binary operation, from this another construction is obtained for average hereditary graphs, and we see some interesting algebraic properties this class of graphs has. We then explore the effect on the complexity of graph 3-coloring problem when the input is restricted to average hereditary graphs., Comment: 12 pages, 2 figures

Published
2024

13. Design and CFD Simulation of Heat Transfer in Circular Pipes

Author

Ali, Furman, Abbas, Munawwar Ali, Sun, Bo, Chen, Li, Hussain, Shahid, Chaari, Fakher, Series Editor, Gherardini, Francesco, Series Editor, Ivanov, Vitalii, Series Editor, Haddar, Mohamed, Series Editor, Cavas-Martínez, Francisco, Editorial Board Member, di Mare, Francesca, Editorial Board Member, Kwon, Young W., Editorial Board Member, Tolio, Tullio A. M., Editorial Board Member, Trojanowska, Justyna, Editorial Board Member, Schmitt, Robert, Editorial Board Member, Xu, Jinyang, Editorial Board Member, Halgamuge, Saman K., editor, Zhang, Hao, editor, Zhao, Dingxuan, editor, and Bian, Yongming, editor

Published
2024
Full Text
View/download PDF

14. Exploring Software Quality Through Data-Driven Approaches and Knowledge Graphs

Author

Chand, Raheela, Khan, Saif Ur Rehman, Hussain, Shahid, Wang, Wen-Li, Tang, Mei-Huei, Ibrahim, Naseem, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Rocha, Álvaro, editor, Adeli, Hojjat, editor, Dzemyda, Gintautas, editor, Moreira, Fernando, editor, and Poniszewska-Marańda, Aneta, editor

Published
2024
Full Text
View/download PDF

15. An ML-Based Quality Features Extraction (QFE) Framework for Android Apps

Author

Chand, Raheela, Khan, Saif Ur Rehman, Hussain, Shahid, Wang, Wen-Li, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Rocha, Alvaro, editor, Adeli, Hojjat, editor, Dzemyda, Gintautas, editor, Moreira, Fernando, editor, and Colla, Valentina, editor

Published
2024
Full Text
View/download PDF

16. Empirical Investigation of Quantum Computing on Solving Complex Problems

Author

Hussain, Shahid, Neupane, Yuba, Wang, Wen-Li, Ibrahim, Naseem, Khan, Saif Ur Rehman, Kareem, Asif, van der Aalst, Wil, Series Editor, Ram, Sudha, Series Editor, Rosemann, Michael, Series Editor, Szyperski, Clemens, Series Editor, Guizzardi, Giancarlo, Series Editor, Kruchten, Philippe, editor, and Gregory, Peggy, editor

Published
2024
Full Text
View/download PDF

24. Decision Trees with Hypotheses for Recognition of Monotone Boolean Functions and for Sorting

Author

Azad, Mohammad, Chikalov, Igor, Hussain, Shahid, Moshkov, Mikhail, and Zielosko, Beata

Subjects
Computer Science - Computational Complexity
Abstract

In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. We investigate the problem of recognition of monotone Boolean functions with $n$ variables, $n=2, \ldots, 4$, and the problem of sorting $n$ pairwise different elements from linearly ordered set, $n=3, \ldots, 6$. For each of these problems, we compare the complexity of different types of optimal (relative to the depth or the number of realizable nodes) decision trees with hypotheses. We also study the complexity of decision trees constructed by entropy-based greedy algorithm and analyze the length of decision rules derived from these trees.

Published
2022

25. Greedy Algorithms for Decision Trees with Hypotheses

Author

Azad, Mohammad, Chikalov, Igor, Hussain, Shahid, Moshkov, Mikhail, and Zielosko, Beata

Subjects
Computer Science - Computational Complexity
Abstract

We investigate at decision trees that incorporate both traditional queries based on one attribute and queries based on hypotheses about the values of all attributes. Such decision trees are similar to ones studied in exact learning, where membership and equivalence queries are allowed. We present greedy algorithms based on diverse uncertainty measures for construction of above decision trees and discuss results of computer experiments on various data sets from the UCI ML Repository and randomly generated Boolean functions. We also study the length and coverage of decision rules derived from the decisiontrees constructed by greedy algorithms.

Published
2022

Catalog

Books, media, physical & digital resources
See catalog results