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

Yilang Wu

dblp:157/6867 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1 · 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.

Databases, data mining, and information retrieval
1 paper
Spatial and temporal data management · 50% Data mining · 50%
Computer networks
1 paper
Edge and fog computing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Spatial and temporal data management
big spatial data
0.412019
Maximum Data-Resolution Efficiency for Fog-Computing Supported Spatial Big Data Processing in Disaster Scenarios · IEEE Trans. Parallel Distributed Syst. 2019
Data mining › clustering
spatial clustering
0.412019
Maximum Data-Resolution Efficiency for Fog-Computing Supported Spatial Big Data Processing in Disaster Scenarios · IEEE Trans. Parallel Distributed Syst. 2019
Edge and fog computing › mobile edge computing
computation offloading
0.412019
Maximum Data-Resolution Efficiency for Fog-Computing Supported Spatial Big Data Processing in Disaster Scenarios · IEEE Trans. Parallel Distributed Syst. 2019

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

simulation · 1.1optimization · 1.1
YearPublicationVenuePosition
2023 Social Media Driven Big Data Analysis for Disaster Situation Awareness: A Tutorial
abstract
Situational awareness tries to grasp the important events and circumstances in the physical world through sensing, communication, and reasoning. Tracking the evolution of changing situations is an essential part of this awareness and is crucial for providing appropriate resources and help during disasters. Social media, particularly Twitter, is playing an increasing role in this process in recent years. However, extracting intelligence from the available data involves several challenges, including (a) filtering out large amounts of irrelevant data, (b) fusion of heterogeneous data generated by the social media and other sources, and (c) working with partially geo-tagged social media data in order to deduce the needs of the affected people. Spatio-temporal analysis of the data plays a key role in understanding the situation, but is available only sparsely because only a small fraction of people post relevant text and of those very few enable location tracking. In this paper, we provide a comprehensive survey on data analytics to assess situational awareness from social media big data.
Amitangshu Pal, Junbo Wang 0001, Yilang Wu, Krishna Kant 0001, Zhi Liu 0002, Kento Sato
IEEE Trans. Big Data3
2019 Incremental Spatial Clustering for Spatial Big Crowd Data in Evolving Disaster Scenario
abstract
Spatial clustering of the events scattered over a geographical region has many important applications, including the assessment of needs of the people affected by a disaster. In this paper we consider spatial clustering of social media data (e.g., tweets) generated by smart phones in the disaster region. Our goal in this context is to find high density areas within the affected area with abundance of messages concerning specific needs that we call simply as “situations”. Unfortunately, a direct spatial clustering is not only unstable or unreliable in the presence of mobility or changing conditions but also fails to recognize the fact that the “situation” expressed by a tweet remains valid for some time beyond the time of its emission. We address this by associating a decay function with each information content and define an incremental spatial clustering algorithm (ISCA) based on the decay model. We study the performance of incremental clustering as a function of decay rate to provide insights into how it can be chosen appropriately for different situations.
Yilang Wu, Amitangshu Pal, Junbo Wang 0001, Krishna Kant 0001
CCNC1
2019 Maximum Data-Resolution Efficiency for Fog-Computing Supported Spatial Big Data Processing in Disaster Scenarios
abstract
Spatial big data analysis is very important in disaster scenarios to understand distribution patterns of situations, e.g., people's movements, people's requirements, resource shortage situations, and so on. In a general case, spatial big data is generated from distributed sensing devices and analyzed in a centralized way, e.g., a cloud center with high-performance computing resources. However, data transmission from sensing devices to cloud centers always takes a long time, especially in disaster scenarios with an unstable network. Fog computing is a promising technique to solve the above problem by offloading data processing tasks from the cloud to nearby computation devices. But data resolution also decreases after local processing in the fog nodes. It is necessary to investigate the optimal task distribution solutions to efficiently use computation resources in the fog layer. In this paper, we take the above research problem, and study fog-computing supported spatial big data processing. We analyze the process for spatial clustering, which is a typical category for spatial data analysis, and propose an architecture to integrate data processing into fog computing. We formalize a problem to maximize the data-resolution efficiency by considering data resolution and delay. We further propose core algorithms to enable spatial clustering in a fog-computing environment and implement the above algorithms in a real system. We have performed both simulations and experiments on a real Twitter dataset collected when Kumamoto-city suffered an earthquake. Through the simulations and the experiments, we have determined that the proposed solution significantly outperforms the other solutions.
Junbo Wang 0001, Michael Conrad Meyer, Yilang Wu, Yu Wang 0064
IEEE Trans. Parallel Distributed Syst.3
2017 Workflow Based Query Management System for Astronomical Data Repository
abstract
Astronomy is a data-intensive science. The large amount of data available in the astronomical domain needs query languages to gain valuable astronomical information. The paper has two goals. First, it presents the challenges for domain-specific query language for managing astronomical data. Second, it proposes a solution of managing such large amount of data through incorporating a multi-stage query language with Workflow Management technique. The paper demonstrates a web based query management system able to handle user queries in single or multi-stage.
Shashank Shrestha, Wanming Chu, Yilang Wu, Ruth Cortez, Alexander Vazhenin, Absalom Shu, Subhash Bhalla
SoMeT3