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

Weibin Zhao

dblp:21/335 · DBLP profile ↗
← Back
11ranked-venue papers
10as first author
2since 2021 · last 2023
0000-0003-4825-589XORCID · corroborated

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

Computer networks · 4 · 4 first-authorArtificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Distributed systems · 50% Cloud and datacenter computing · 48% Parallel and multicore computing · 2%

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

TopicWeightPapersLastEvidence papers
Distributed systems
dynamic content web site
0.122006
DotSlash: Handling Web Hotspots at Dynamic Content Web Sites · INFOCOM 2006
DotSlash: handling Web hotspots at dynamic content Web sites · INFOCOM 2005
Cloud and datacenter computing › datacenter operations
hotspot handling
0.122006
DotSlash: Handling Web Hotspots at Dynamic Content Web Sites · INFOCOM 2006
DotSlash: handling Web hotspots at dynamic content Web sites · INFOCOM 2005
Distributed systems › distributed scheduling › load sharing
load migration
0.122006
DotSlash: Handling Web Hotspots at Dynamic Content Web Sites · INFOCOM 2006
DotSlash: handling Web hotspots at dynamic content Web sites · INFOCOM 2005
Cloud and datacenter computing › datacenter services › online service systems › internet services
web server
0.122006
DotSlash: Handling Web Hotspots at Dynamic Content Web Sites · INFOCOM 2006
DotSlash: handling Web hotspots at dynamic content Web sites · INFOCOM 2005
Cloud and datacenter computing › datacenter services › online service systems › internet services
distributed web server
0.012004
Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots · PODC 2004
Distributed systems
distributed coordination and fault tolerance
0.012002
Selective anti-entropy · PODC 2002
Distributed systems
replication
0.012002
Selective anti-entropy · PODC 2002
Cloud and datacenter computing
cluster resource management and scheduling
0.012004
Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots · PODC 2004
Parallel and multicore computing
load balancing
0.012004
Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots · PODC 2004

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

self-configuration · 0.1load migration · 0.1
YearPublicationVenuePosition
2023 Personalized tag recommendation via denoising auto-encoder
Weibin Zhao, Lin Shang 0001, Yonghong Yu, Li Zhang 0013, Can Wang 0004, Jiajun Chen 0001
World Wide Web (WWW)1
2022 Hyperbolic Personalized Tag Recommendation
Weibin Zhao, Aoran Zhang 0001, Lin Shang 0001, Yonghong Yu, Li Zhang 0013, Can Wang 0004, Jiajun Chen 0001, Hongzhi Yin
DASFAA (2)1
2019 Fuzzy Pruning for Compression of Convolutional Neural Networks
abstract
Pruning can be used in Convolutional Neural Networks(CNNs) to reduce the consumption of computations. In the iteration of pruning, a fixed ratio of filters or weights are pruned after evaluating their importance according to a certain criterion, which has the risk of leading to mis-pruning when the distribution of the importance is imbalanced. We propose a strategy to assist pruning for CNNs at filter level. Firstly, in order to evaluate importance and non-importance about filters in the network, we design two fuzzy membership functions respectively, then we evaluate all filters by their membership function value, finally, α-cut set is employed to determine the ones to be pruned . Experimental results demonstrate the effectiveness of our strategy, since it can obtain more compression than the popular pruning algorithms at similar accuracy level.
Weibin Zhao, Lin Shang 0001
FUZZ-IEEE1
2019 A Novel Thought of Pruning Algorithms: Pruning Based on Less Training
Weibin Zhao, Lin Shang 0001
PRICAI (2)2
2006 DotSlash: Handling Web Hotspots at Dynamic Content Web Sites
Weibin Zhao, Henning Schulzrinne
INFOCOM1
2005 DotSlash: handling Web hotspots at dynamic content Web sites
abstract
We propose DotSlash, a self-configuring and scalable rescue system, for handling web hotspots at dynamic content Web sites. To support load migration for dynamic content, an origin Web server sets up needed rescue servers drafted from other Web sites on the fly, and those rescue servers retrieve the scripts dynamically from the origin Web server, cache the scripts locally, and access the corresponding database server directly. We have implemented a prototype of DotSlash for the LAMP configuration, and tested our implementation using the RUBBoS bulletin board benchmark. Experiments show that by using DotSlash a dynamic content web site can completely remove its web server bottleneck, and can support a request rate constrained only by the capacity of its database server.
Weibin Zhao, Henning Schulzrinne
INFOCOM1
2005 Enhancing Service Location Protocol for efficiency, scalability and advanced discovery
Weibin Zhao, Henning Schulzrinne
J. Syst. Softw.1
2004 Brief announcement: building an adaptive distributed web server system on the fly for handling web hotspots
abstract
No abstract available.
Weibin Zhao, Henning Schulzrinne
PODC1
2002 Improving SLP efficiency and extendability by using global attributes and preference filters
abstract
The paper presents two new mechanisms, global attributes and preference filters, that improve the efficiency and extendability of the service location protocol (SLP). Global attributes describe common service properties, which can be used to perform queries across different service types, and can be standardized for service management. Preference filters facilitate processing of search results, such as finding the best match, in SLP servers. They can reduce the amount of data transferred to the client, and better support thin clients with limited resources and capabilities.
Weibin Zhao, Henning Schulzrinne
ICCCN1
2002 Selective anti-entropy
abstract
No abstract available.
Weibin Zhao, Henning Schulzrinne
PODC1
2000 mSLP-mesh-enhanced service location protocol
abstract
The service location protocol (SLP), a proposed IETF standard, provides a flexible and scalable service discovery framework for IP networks. It can be deployed with or without a directory service. This paper presents mSLP, the mesh-enhanced service location protocol. mSLP enhances SLP with a fully-meshed peer directory agent (DA) architecture. Peer DAs exchange service registration information, and maintain the same consistent data for shared scopes. mSLP improves the reliability and consistency of SLP directory services. It also greatly simplifies service agent (SA) registrations in systems with multiple DAs. mSLP is backward compatible with SLPv2 and can be deployed incrementally.
Weibin Zhao, Henning Schulzrinne, Erik Guttman
ICCCN1