Azade Nazi
University of Texas at Arlington
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Azade Nazi.
ieee international conference on cloud computing technology and science | 2012
Rasool Fakoor; Mayank Raj; Azade Nazi; Mario Di Francesco; Sajal K. Das
Nowadays mobile phones are not only communication devices, but also a source of rich sensory data that can be collected and exploited by distributed people-centric sensing applications. Among them, environmental monitoring and emergency response systems can particularly benefit from people-based sensing. Due to the limited resources of mobile devices, sensed data are usually offloaded to the cloud. However, state-of-the art solutions lack a unified approach suitable to support diverse applications, while reducing the energy consumption of the mobile device. In this paper, we specifically address mobile devices as rich sources of multi-modal data collected by users. In this context, we propose an integrated framework for storing, processing and delivering sensed data to people-centric applications deployed in the cloud. Our integrated platform is the foundation of a new delivery model, namely, Mobile Application as a Service (MAaaS), which allows the creation of people-centric applications across different domains, including participatory sensing and mobile social networks. We specifically address a case study represented by an emergency response system for fire detection and alerting. Through a prototype testbed implementation, we show that the proposed framework can reduce the energy consumption of mobile devices, while satisfying the application requirements.
Pervasive and Mobile Computing | 2014
Azade Nazi; Mayank Raj; Mario Di Francesco; Preetam Ghosh; Sajal K. Das
The communication between nodes in a Wireless Sensor Network (WSN) may fail due to different factors, such as hardware malfunctions, energy depletion, temporal variations of the wireless channel and interference. To maximize efficiency, the sensor network deployment must be robust and resilient to such failures. One effective solution to this problem is to exploit a bio-inspired approach based on Gene Regulatory Networks (GRNs). Owing to million years of evolution, GRNs display intrinsic properties of adaptation and robustness, thus making them suitable for dynamic network environments. In this article, we exploit the genetic structure of real organisms to deploy bio-inspired WSNs that are isomorphic to certain GRN sub-networks. Exhaustive structural analysis, simulations and experimental results on a WSN testbed demonstrate that bio-inspired WSNs are resilient to node and link failures and offer better performance than existing solutions for robust WSNs.
very large data bases | 2015
Azade Nazi; Zhuojie Zhou; Saravanan Thirumuruganathan; Nan Zhang; Gautam Das
In this paper, we introduce a novel, general purpose, technique for faster sampling of nodes over an online social network. Specifically, unlike traditional random walks which wait for the convergence of sampling distribution to a predetermined target distribution - a waiting process that incurs a high query cost - we develop WALK-ESTIMATE, which starts with a much shorter random walk, and then proactively estimate the sampling probability for the node taken before using acceptance-rejection sampling to adjust the sampling probability to the predetermined target distribution. We present a novel backward random walk technique which provides provably unbiased estimations for the sampling probability, and demonstrate the superiority of WALK-ESTIMATE over traditional random walks through theoretical analysis and extensive experiments over real world online social networks.
international conference of distributed computing and networking | 2013
Azade Nazi; Mayank Raj; Mario Di Francesco; Preetam Ghosh; Sajal K. Das
Sensor nodes in a Wireless Sensor Network (WSN) are responsible for sensing the environment and propagating the collected data in the network. The communication between sensor nodes may fail due to different factors, such as hardware failures, energy depletion, temporal variations of the wireless channel and interference. To maximize efficiency, the sensor network deployment must be robust and resilient to such failures. One effective solution to this problem has been inspired by Gene Regulatory Networks (GRNs). Owing to millions of years of evolution, GRNs display intrinsic properties of adaptation and robustness, thus making them suitable for dynamic network environments. In this paper, we exploit real biological gene structures to deploy wireless sensor networks, called bio-inspired WSNs. Exhaustive structural analysis of the network and experimental results demonstrate that the topology of bio-inspired WSNs is robust, energy-efficient, and resilient to node and link failures.
distributed computing in sensor systems | 2016
Azade Nazi; Mayank Raj; Mario Di Francesco; Preetam Ghosh; Sajal K. Das
Robustness in wireless sensor networks (WSNs) is a critical factor that largely depends on their network topology and on how devices can react to disruptions, including node and link failures. This article presents a novel solution to obtain robust WSNs by exploiting principles of biological robustness at nanoscale. Specifically, we consider Gene Regulatory Networks (GRNs) as a model for the interaction between genes in living organisms. GRNs have evolved over millions of years to provide robustness against adverse factors in cells and their environment. Based on this observation, we apply a method to build robust WSNs, called bio-inspired WSNs, by establishing a correspondence between the topology of GRNs and that of already-deployed WSNs. Through simulation in realistic conditions, we demonstrate that bio-inspired WSNs are more reliable than existing solutions for the design of robust WSNs. We also show that communications in bio-inspired WSNs have lower latency as well as lower energy consumption than the state of the art.
international conference on management of data | 2017
Abolfazl Asudeh; Azade Nazi; Nan Zhang; Gautam Das
Finding the maxima of a database based on a user preference, especially when the ranking function is a linear combination of the attributes, has been the subject of recent research. A critical observation is that the em convex hull is the subset of tuples that can be used to find the maxima of any linear function. However, in real world applications the convex hull can be a significant portion of the database, and thus its performance is greatly reduced. Thus, computing a subset limited to
international conference on management of data | 2015
Azade Nazi; Mahashweta Das; Gautam Das
r
international conference on control and automation | 2017
Azade Nazi; Abolfazl Asudeh; Gautam Das; Nan Zhang; Ali Jaoua
tuples that minimizes the regret ratio (a measure of the users dissatisfaction with the result from the limited set versus the one from the entire database) is of interest. In this paper, we make several fundamental theoretical as well as practical advances in developing such a compact set. In the case of two dimensional databases, we develop an optimal linearithmic time algorithm by leveraging the ordering of skyline tuples. In the case of higher dimensions, the problem is known to be NPcomplete. As one of our main results of this paper, we develop an approximation algorithm that runs in linearithmic time and guarantees a regret ratio, within any arbitrarily small user-controllable distance from the optimal regret ratio. The comprehensive set of experiments on both synthetic and publicly available real datasets confirm the efficiency, quality of output, and scalability of our proposed algorithms.
global communications conference | 2014
Azade Nazi; Mayank Raj; Mario Di Francesco; Preetam Ghosh; Sajal K. Das
The increasing popularity and widespread use of online review sites over the past decade has motivated businesses of all types to possess an expansive arsenal of user feedback (preferably positive) in order to mark their reputation and presence in the Web. Though a significant proportion of purchasing decisions today are driven by average numeric scores (e.g., movie rating in IMDB), detailed reviews are critical for activities such as buying an expensive digital SLR camera, reserving a vacation package, etc. Since writing a detailed review for a product (or, a service) is usually time-consuming and may not offer any incentive, the number of useful reviews available in the Web is far from many. The corpus of reviews available at our disposal for making informed decisions also suffers from spam and misleading content, typographical and grammatical errors, etc. In this paper, we address the problem of how to engage the lurkers (i.e., people who read reviews but never take time and effort to write one) to participate and write online reviews by systematically simplifying the reviewing task. Given a user and an item that she wants to review, the task is to identify the top-
very large data bases | 2018
Abolfazl Asudeh; Azade Nazi; Jees Augustine; Saravanan Thirumuruganathan; Nan Zhang; Gautam Das; Divesh Srivastava
k