Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hassan Iqbal

dblp:146/7150 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
4since 2021 · last 2022
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 39% Trustworthy machine learning · 22% Multi-agent systems · 19%
Computer networks
3 papers
Internet of things and sensor networks · 44% Wireless networking · 24% Physical-layer communications · 20%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 50% Computational social science and digital humanities · 50%
Network and information security
1 paper
Network security · 77% Privacy and data protection · 23%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 85% Embedded and real-time systems · 15%

Topics — the 10 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness
algorithmic bias
0.612022
Left or Right: A Peek into the Political Biases in Email Spam Filtering Algorithms During US Election 2020 · WWW 2022
Network security › content filtering
spam filtering
0.612022
Left or Right: A Peek into the Political Biases in Email Spam Filtering Algorithms During US Election 2020 · WWW 2022
Machine learning › Reinforcement learning
multi-armed bandit
0.512021
Multi-Robot Dynamical Source Seeking in Unknown Environments · ICRA 2021
Knowledge, reasoning and agents › Multi-agent systems
multi-robot systems
0.512021
Multi-Robot Dynamical Source Seeking in Unknown Environments · ICRA 2021
Robotics › Motion planning and robot control › mobile robot control
source seeking
0.512021
Multi-Robot Dynamical Source Seeking in Unknown Environments · ICRA 2021
Machine learning › Reinforcement learning › bandit
upper confidence bound
0.512021
Multi-Robot Dynamical Source Seeking in Unknown Environments · ICRA 2021
Internet of things and sensor networks
cross-technology communication
0.312018
Scylla: interleaving multiple IoT stacks on a single radio · CoNEXT 2018
Wireless networking › cognitive radio › spectrum sharing › coexistence
heterogeneous wireless coexistence
0.312018
Scylla: interleaving multiple IoT stacks on a single radio · CoNEXT 2018
Physical-layer communications
reconfigurable radio
0.312017
Taming Link-layer Heterogeneity in IoT through Interleaving Multiple Link-Layers over a Single Radio · SenSys 2017
Machine learning and data management
data collection
0.212022
RMS: Removing Barriers to Analyze the Availability and Surge Pricing of Ridesharing Services · CHI 2022

Methods — techniques the papers use, named apart from their topics

spatiotemporal analysis · 1.1network measurement · 1.1large-scale measurement study · 1.1data collection · 1.1software-defined radio control layer · 0.7dummy confidence upper bound · 0.5distributed online planning · 0.5dynamic radio reconfiguration · 0.3
YearPublicationVenuePosition
2022 RMS: Removing Barriers to Analyze the Availability and Surge Pricing of Ridesharing Services
abstract
Ridesharing services do not make data of their availability (supply, utilization, idle time, and idle distance) and surge pricing publicly available. It limits the opportunities to study the spatiotemporal trends of the availability and surge pricing of these services. Only a few research studies conducted in North America analyzed these features for only Uber and Lyft. Despite the interesting observations, the results of prior works are not generalizable or reproducible because: i) the datasets collected in previous publications are spatiotemporally sensitive, i.e., previous works do not represent the current availability and surge pricing of ridesharing services in different parts of the world; and ii) the analyses presented in previous works are limited in scope (in terms of countries and ridesharing services they studied). Hence, prior works are not generally applicable to ridesharing services operating in different countries.
Hassan Ali Khan, Hassan Iqbal, Muhammad Shahzad 0001, Guoliang Jin
CHI2
2022 Left or Right: A Peek into the Political Biases in Email Spam Filtering Algorithms During US Election 2020
abstract
Email services use spam filtering algorithms (SFAs) to filter emails that are unwanted by the user. However, at times, the emails perceived by an SFA as unwanted may be important to the user. Such incorrect decisions can have significant implications if SFAs treat emails of user interest as spam on a large scale. This is particularly important during national elections. To study whether the SFAs of popular email services have any biases in treating the campaign emails, we conducted a large-scale study of the campaign emails of the US elections 2020 by subscribing to a large number of Presidential, Senate, and House candidates using over a hundred email accounts on Gmail, Outlook, and Yahoo. We analyzed the biases in the SFAs towards the left and the right candidates and further studied the impact of the interactions (such as reading or marking emails as spam) of email recipients on these biases. We observed that the SFAs of different email services indeed exhibit biases towards different political affiliations.
Hassan Iqbal, Usman M. Khan, Hassan Ali Khan, Muhammad Shahzad 0001
WWW1
2022 Characterizing the Availability and Latency in AWS Network From the Perspective of Tenants
abstract
Scalability and performance requirements are driving tenants to increasingly move their applications to public clouds. Unfortunately, cloud providers do not provide a view of their networking infrastructure to the tenants, rather only provide some generic service level agreements (SLAs). Tenants are, therefore, forced to plan the deployments of their applications based on these SLAs. This limits the performance that the tenants can achieve. Keeping this in view, we present a detailed network measurement study of the largest public cloud, Amazon Web Services (AWS). We collected network data to characterize the availability and latency of AWS over a period of 100 days and studied various temporal trends across several geographical locations of AWS throughout the world. We performed our study at all three levels of cloud hierarchy: inside availability zones (AZs), across AZs, and across regions. Our results show that network behavior varies significantly over time at different geographical locations, levels of hierarchy, and temporal granularities. For example, while we observed high availability at monthly granularity, it deteriorates at daily and hourly granularities. This and many other such observations that we present have significant implications for cloud tenants. We further implemented our measurement approach on Google Cloud Platform (GCP) to demonstrate that it can be deployed on any cloud platform and present some preliminary comparative observations from this implementation. Based on our observations, we present several recommendations that tenants can use to better deploy their applications.
Hassan Iqbal, Muhammad Shahzad 0001
IEEE/ACM Trans. Netw.1
2021 Multi-Robot Dynamical Source Seeking in Unknown Environments
abstract
This paper presents an algorithmic framework for the distributed on-line source seeking, termed as DoSS, with a multi-robot system in an unknown dynamical environment. Our algorithm, building on a novel concept called dummy confidence upper bound (D-UCB), integrates both estimation of the unknown environment and task planning for the multiple robots simultaneously, and as a result, drives the team of robots to a steady state in which multiple sources of interest are located. Unlike the standard UCB algorithm in the context of multi-armed bandits, the introduction of D-UCB significantly reduces the computational complexity in solving subproblems of the multi-robot task planning. This also enables our DoSS algorithm to be implementable in a distributed on-line manner. The performance of the algorithm is theoretically guaranteed by showing a sub-linear upper bound of the cumulative regret. Numerical results on a real-world methane emission seeking problem are also provided to demonstrate the effectiveness of the proposed algorithm.
Bin Du 0002, Kun Qian 0018, Hassan Iqbal, Christian G. Claudel, Dengfeng Sun
ICRA3
2018 Scylla: interleaving multiple IoT stacks on a single radio
abstract
IoT deployments often require communication between devices that employ heterogeneous wireless technologies. Traditionally, expensive gateways are used to relay packets between heterogeneous nodes. Recent cross-technology communication offers a low bandwidth alternative, which is only feasible when communication between such nodes is limited to simple binary commands. In contrast, our work capitalizes on the increasing presence of multi-standard radio chips in mainstream IoT devices, to provide a new perspective on how to enable direct communication between heterogeneous nodes. We design Scylla---a software control layer---that allows multiple wireless stacks to coexist on top of a single radio chip, thereby simultaneously offering multiple communication interfaces. Uniquely, Scylla achieves near stack-native performance and requires no changes to the standards.
Hassan Iqbal, Muhammad Hamad Alizai, Ihsan Ayyub Qazi, Olaf Landsiedel, Zartash Afzal Uzmi
CoNEXT1
2017 Taming Link-layer Heterogeneity in IoT through Interleaving Multiple Link-Layers over a Single Radio
abstract
We propose dynamic reconfiguration of the radio interface in IoT platforms to support multiple link layers simultaneously. This allows us to tackle the increasing link layer heterogeneity in IoT devices, thus bringing a multitude of benefits: extensible and vender agnostic multihop deployments, rapid integration of the new “things” into an existing network, as well as seamless integration of the IoT with the traditional wireless Internet.
Hassan Iqbal, Muhammad Hamad Alizai, Zartash Afzal Uzmi, Olaf Landsiedel
SenSys1
2014 Introducing CAD/CAM and CNC machining by using a feature based methodology in a manufacturing lab course, a conceptual frame work
abstract
In a continuous effort to develop and incorporate innovative teaching styles in the Mechanical Engineering curriculum at King Fahd University of Petroleum and Minerals (KFUPM), a new lab course titled Advanced Manufacturing Lab (ME-407) has been introduced, wherein the senior students are exposed to Computer Aided Drafting (CAD) and computer aided manufacturing (CAM). The main objective of this course is to inculcate the knowledge in the area of CAM software, its application in computerized numerical controlled (CNC) machining, metrological study and data generation for statistical analysis. For doing so, a comprehensive project is being developed which integrates all the above elements. This paper outlines a proposed strategy to accomplish these targets and a set of carefully selected activities to follow when this new course starts.
Hassan Iqbal, Anwar K. Sheikh, M. Abdul Samad
EDUCON1