Anand Padmanabhan

Anand Padmanabhan

Auto-generated profile, based on publicly available information

Anand Padmanabhan

University of Illinois at Urbana Champaign

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
22 April 2013 in First Monday
Verified
Journal Article
Closed access
KLKalev Leetaru
Kalev Leetaru
SWShaowen Wang
Shaowen Wang
GCGuofeng Cao
Guofeng Cao
APAnand Padmanabhan
Anand Padmanabhan
ESEric Shook
Eric Shook
In just under seven years, Twitter has grown to count nearly 3% of the entire global population among its active users who have sent more than 170 billion 140-character messages. Today the service plays such a significant role in American culture that the Library of Congress has assembled a permanent archive of the site back to its first tweet, updated daily. With its open API, Twitter has become one of the most popular data sources for social research, yet the majority of the literature has focused on it as a text or network graph source, with only limited efforts to date focusing exclusively on the geography of Twitter, assessing the various sources of geographic information on the service and their accuracy. More than 3% of all tweets are found to have native location information available, while a naive geocoder based on a simple major cities gazetteer and relying on the user-provided Location and Profile fields is able to geolocate more than a third of all tweets with high accuracy when measured against the GPS-based baseline. Geographic proximity is found to play a minimal role both in who users communicate with and what they communicate about, providing evidence that social media is shifting the communicative landscape.

1 February 2013 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
YZYanli Zhao
Yanli Zhao
APAnand Padmanabhan
Anand Padmanabhan
Shaowen WangShaowen Wang
Shaowen Wang
Viewshed analysis, often supported by geographic information system, is widely used in many application domains. However, as terrain data continue to become increasingly large and available at high resolutions, data-intensive viewshed analysis poses significant computational challenges. General-purpose computation on graphics processing units (GPUs) provides a promising means to address such challenges. This article describes a parallel computing approach to data-intensive viewshed analysis of large terrain data using GPUs. Our approach exploits the high-bandwidth memory of GPUs and the parallelism of massive spatial data to enable memory-intensive and computation-intensive tasks while central processing units are used to achieve efficient input/output (I/O) management. Furthermore, a two-level spatial domain decomposition strategy has been developed to mitigate a performance bottleneck caused by data transfer in the memory hierarchy of GPU-based architecture. Computational experiments were designed to evaluate computational performance of the approach. The experiments demonstrate significant performance improvement over a well-known sequential computing method, and an enhanced ability of analyzing sizable datasets that the sequential computing method cannot handle.

16 May 2014 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
APAnand Padmanabhan
Anand Padmanabhan
Shaowen WangShaowen Wang
Shaowen Wang
GCGuofeng Cao
Guofeng Cao
MHMyunghwa Hwang
Myunghwa Hwang
ZZZhenhua Zhang
Zhenhua Zhang
YLYan Liu
Yan Liu

20 March 2014 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
YLYan Liu
Yan Liu
APAnand Padmanabhan
Anand Padmanabhan
SWShaowen Wang
Shaowen Wang

23 May 2005 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
AWA.B. Williams
A.B. Williams
APA. Padmanabhan
A. Padmanabhan
MBM.B. Blake
M.B. Blake
Agent technologies represent a promising approach for the integration of interorganizational capabilities across distributed, networked environments. However, knowledge sharing interoperability problems can arise when agents incorporating differing ontologies try to synchronize their internal information. Moreover, in practice, agents may not have a common or global consensus ontology that will facilitate knowledge sharing and integration of functional capabilities. We propose a method to enable agents to develop a local consensus ontology during operation time as needed. By identifying similarities in the ontologies of their peer agents, a set of agents can discover new concepts/relations and integrate them into a local consensus ontology on demand. We evaluate this method, both syntactically and semantically, when forming local consensus ontologies with and without the use of a lexical database. We also report on the effects when several factors, such as the similarity measure, the relation search level depth, and the merge order, are varied. Finally, experimenting in the domain of agent-supported Web service composition, we demonstrate how our method allows us to successfully autonomously form service-oriented local consensus ontologies.

1 January 2005
Verified
Conference Paper
Closed access
APA. Padmanabhan
A. Padmanabhan
SWShaowen Wang
Shaowen Wang
SGS. Ghosh
S. Ghosh
RBR. Briggs
R. Briggs
This paper presents a self-organized grouping (SOG) method that achieves efficient Grid resource discovery by forming and maintaining autonomous resource groups. Each group dynamically aggregates a set of resources that are similar to each other in some pre-specified resource characteristic. The SOG method takes advantage of the strengths of both centralized and decentralized approaches that were previously developed for Grid/P2P resource discovery. The design of the SOG method minimizes the overhead incurred in forming and maintaining groups and maximizes resource discovery performance. The way SOG method handles resource discovery queries is metaphorically similar to searching for a word in an English dictionary by identifying its alphabetical groups at the first place. It is shown from a series of computational experiments that SOG method achieves more stable (i.e., independent of the factors such as resource densities, and Grid sizes) and efficient lookup performance than other existing approaches.