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.

Hailang Wang

dblp:33/11344 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
1since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 7 · 5 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Computer networks
2 papers
Content delivery and video streaming · 100%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 100%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › video-on-demand
peer-assisted video-on-demand
0.112012
SocialTube: P2P-assisted video sharing in online social networks · INFOCOM 2012
Content delivery and video streaming › peer-to-peer streaming
peer-to-peer live streaming
0.112012
Leveraging social network concepts for efficient peer-to-peer live streaming systems · ACM Multimedia 2012
Web and social media mining › social network analysis
online social network measurement
0.012012
SocialTube: P2P-assisted video sharing in online social networks · INFOCOM 2012
Collaborative and social computing
social networks
0.012012
Leveraging social network concepts for efficient peer-to-peer live streaming systems · ACM Multimedia 2012

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

trace-driven simulation · 0.3p2p overlay construction · 0.3overlay construction · 0.3bridge construction · 0.3
YearPublicationVenuePosition
2026 LSBE-Net: Semantic segmentation of large-scale point cloud scenes via local boundary feature and spatial attention aggregation
Hailang Wang, Keke Duan, Mingzi Zhang
Image Vis. Comput.1
2017 Open source cell library Mono3D to develop large-scale monolithic 3D integrated circuits
abstract
Monolithic three-dimensional (3D) integrated circuits (ICs) achieve ultra-high density device integration through fine-grained connectivity enabled by monolithic inter-tier vias (MIVs). In this paper, an open source standard cell library for design automation of large-scale transistor-level monolithic 3D ICs is proposed. A 128-point, highly parallelized FFT core with 330K cells is implemented with the proposed library. Power and timing characteristics of monolithic 3D ICs are quantified. The effect of signal integrity and routing congestion on timing characteristics is investigated. The primary clock tree characteristics of monolithic 3D ICs are also discussed. The proposed open source cell library facilitates future research on multiple aspects of monolithic 3D technology.
Scott Kontak, Hailang Wang, Emre Salman
ISCAS3
2017 Closed-Form Expressions for I/O Simultaneous Switching Noise Revisited
abstract
Closed-form expressions to estimate power supply noise due to the simultaneous switching of I/O drivers are revisited in this brief. It is shown that existing closed-form expressions share a common limitation and underestimate noise with up to 83% error in advanced nanoscale technologies with fast signal rise/fall times. This characteristic is investigated, both quantitatively and qualitatively. New closed-form expressions are developed for the signals with fast transition times. Results demonstrate that the proposed closed-form expressions exhibit an average error of 3.3% as compared with SPICE simulations, and enhance the accuracy of the existing expressions by up to 79.4%.
Hailang Wang, Emre Salman
IEEE Trans. Very Large Scale Integr. Syst.1
2016 Hardware Security Threats and Potential Countermeasures in Emerging 3D ICs
abstract
New hardware security threats are identified in emerging three-dimensional (3D) integrated circuits (ICs) and potential countermeasures are introduced. Trigger and payload mechanisms for future 3D hardware Trojans are predicted. Furthermore, a novel, network-on-chip based 3D obfuscation method is proposed to block the direct communication between two commercial dies in a 3D structure, thus thwarting reverse engineering attacks on the vertical dimension. Simulation results demonstrate that the proposed method effectively obfuscates the cross-plane communication by increasing the reverse engineering time by approximately 5x as compared to using direct through silicon via (TSV) connections. The proposed method consumes approximately one fifth the area and power of a typical network-on-chip designed in a 65 nm technology, exhibiting limited overhead.
Jaya Dofe, Qiaoyan Yu, Hailang Wang, Emre Salman
ACM Great Lakes Symposium on VLSI3
2015 Decoupling Capacitor Topologies for TSV-Based 3-D ICs With Power Gating
abstract
In traditional decoupling capacitor topologies, power gating can significantly degrade the system-wide power integrity of a 3-D integrated circuit since the decoupling capacitance associated with the power-gated block/plane becomes ineffective for the neighboring, active planes. Two topologies are investigated to alleviate this issue by exploiting: 1) relatively low-resistance through silicon vias (TSVs) and 2) ability of TSVs to bypass plane-level power networks when delivering the power supply voltage. In the proposed topologies, decoupling capacitors placed within a plane can provide charge to neighboring planes even when the plane is power gated, achieving up to 50% and 87% reduction in, respectively, rms power supply and power gating (in-rush current) noise at the expense of a moderate increase in physical area and peak power consumption.
Hailang Wang, Emre Salman
IEEE Trans. Very Large Scale Integr. Syst.1
2014 Compact model to efficiently characterize TSV-to-transistor noise coupling in 3D ICs
Hailang Wang, Mohammad H. Asgari, Emre Salman
Integr.1
2013 Efficient characterization of TSV-to-transistor noise coupling in 3D ICs
abstract
A methodology is proposed to characterize TSV induced noise coupling in three-dimensional (3D) integrated circuits. Different substrate biasing schemes (such as a single substrate contact versus regularly placed substrate contacts) and TSV fabrication methods (such as via-first and via-last) are considered. A compact π model is proposed to efficiently estimate the coupling noise at a victim transistor. Each admittance within the compact model is approximated with a closed-form expression consisting of logarithmic functions. The methodology is validated using a 3D transmission line matrix (3D-TLM) method, demonstrating, on average, 4.8% error. The compact model and the closed-form expressions are utilized to better understand TSV induced noise as a function of multiple parameters such as TSV type and placement of substrate contacts.
Hailang Wang, Mohammad H. Asgari, Emre Salman
ACM Great Lakes Symposium on VLSI1
2013 Power gating topologies in TSV based 3D integrated circuits
abstract
Two topologies are proposed at the physical level to achieve reliable power gating in through silicon via (TSV) based three-dimensional (3D) integrated circuits (ICs). The proposed lumped and distributed power gating topologies address the unique differences among distinct TSV fabrication methods such as via-first, via-middle, and via-last, while achieving, on average, 85% reduction in the leakage power. Related tradeoffs among power supply noise, power gating noise, physical area, and turn-on time are also investigated.
Hailang Wang, Emre Salman
ACM Great Lakes Symposium on VLSI1
2012 SocialTube: P2P-assisted video sharing in online social networks
abstract
Video sharing has been an increasingly popular application in online social networks (OSNs). However, its sustainable development is severely hindered by the intrinsic limit of the client/server architecture deployed in current OSN video systems, which is not only costly in terms of server bandwidth and storage but also not scalable. The peer-assisted Video-on-Demand (VOD) technique, in which participating peers assist the server in delivering video content has been proposed recently. Unfortunately, videos can only be disseminated through friends in OSNs. Therefore, current VOD works that explore clustering nodes with similar interests or close location for high performance are suboptimal, if not entirely inapplicable, in OSNs. Based on our long-term real-world measurement of over 1,000,000 users and 2,500 videos in Facebook, we propose SocialTube, a novel peer-assisted video sharing system that explores social relationship, interest similarity, and physical location between peers in OSNs. Specifically, SocialTube incorporates three algorithms: a social network (SN)-based P2P overlay construction algorithm, a SN-based chunk prefetch algorithm, and a buffer management algorithm. The trace driven based simulation results show that SocialTube can improve the quality of user experience and system scalability over current P2P VOD techniques.
Ze Li 0001, Haiying Shen, Hailang Wang, Guoxin Liu, Jin Li 0001
INFOCOM3
2012 Leveraging social network concepts for efficient peer-to-peer live streaming systems
abstract
In current peer-to-peer (P2P) live streaming systems, nodes in a channel form a P2P overlay for video sharing. To watch a new channel, a node depends on the centralized server to join in the overlay of the channel. The increase in the number of channels in today's live streaming applications triggers users' desire of watching multiple channels successively or simultaneously. However, the support of such watching modes in current applications is no better than joining in different channel overlays successively or simultaneously, which if widely used, poses heavy burden on the centralized server. In order to achieve higher efficiency and scalability, we propose a Social network-Aided efficient liVe strEaming system (SAVE). SAVE regards users' channel switching or multi-channel watching as interactions between channels. By collecting the information of channel interactions and nodes' interests and watching times, SAVE forms nodes in multiple channels with frequent interactions into an overlay, constructs bridges between overlays of channels with less frequent interactions, and enables nodes to identify friends sharing similar interests and watching times. Thus, a node can connect to a new channel while staying in its current overlay, using bridges or relying on its friends, reducing the need to contact the centralized server. Extensive experimental results from the PeerSim simulator and PlanetLab verify that SAVE outperforms other popular protocols in system efficiency and server load reduction.
Haiying Shen, Ze Li 0001, Hailang Wang, Jin Li 0001
ACM Multimedia3