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

Frank Wang

dblp:23/1556 · also Frank Z. Wang, Frank Zhigang Wang · DBLP profile ↗
← Back
27ranked-venue papers
14as first author
4since 2021 · last 2026
0000-0003-4378-2172ORCID · conflict

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

Systems, architecture and hardware · 8 · 2 first-authorArtificial intelligence and machine learning · 5 · 2 first-author · 3 since 2021Computer networks · 5 · 4 first-authorSecurity and privacy · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 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.

Artificial intelligence
3 papers
Vision and language · 41% Trustworthy machine learning · 20% Video understanding and tracking · 14%
Network and information security
5 papers
Privacy and data protection · 49% Cryptographic protocols and secure computation · 21% Authentication and access control · 18%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Distributed systems · 63% Storage systems · 34% Electronic design automation · 4%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking › multimodal video understanding › audio-visual video understanding › audio-visual video parsing
audio-visual event parsing
0.712023
Modality-Independent Teachers Meet Weakly-Supervised Audio-Visual Event Parser · NeurIPS 2023
Computer vision › Vision and language
audio-visual learning
0.712023
Modality-Independent Teachers Meet Weakly-Supervised Audio-Visual Event Parser · NeurIPS 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Modality-Independent Teachers Meet Weakly-Supervised Audio-Visual Event Parser · NeurIPS 2023
Computer vision › Vision and language
image captioning
0.612022
Paraphrasing Is All You Need for Novel Object Captioning · NeurIPS 2022
Computer vision › Vision and language › image captioning › low-shot image captioning
novel object captioning
0.612022
Paraphrasing Is All You Need for Novel Object Captioning · NeurIPS 2022
Natural language and speech › Language models and text generation › text generation
paraphrase generation
0.612022
Paraphrasing Is All You Need for Novel Object Captioning · NeurIPS 2022
Machine learning › Trustworthy machine learning › robustness
distribution shift
0.512021
The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization · ICCV 2021
Machine learning › Trustworthy machine learning › robustness › distribution shift
robustness to distribution shift
0.512021
The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization · ICCV 2021
Privacy and data protection › web privacy › browser privacy
private browsing mode
0.312018
Veil: Private Browsing Semantics Without Browser-side Assistance · NDSS 2018
Cryptographic protocols and secure computation
private information retrieval
0.312017
Splinter: Practical Private Queries on Public Data · NSDI 2017
Cryptographic protocols and secure computation
private query
0.312017
Splinter: Practical Private Queries on Public Data · NSDI 2017
Authentication and access control
access control
0.212016
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds · NSDI 2016
Authentication and access control › access control
cryptographic access control
0.212016
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds · NSDI 2016
Network security
anonymity networks
0.112012
StegoTorus: a camouflage proxy for the Tor anonymity system · CCS 2012
Network security › anonymity networks
tor
0.112012
StegoTorus: a camouflage proxy for the Tor anonymity system · CCS 2012
Privacy and data protection
web privacy
0.112018
Veil: Private Browsing Semantics Without Browser-side Assistance · NDSS 2018
Storage systems › file systems
distributed file system
0.112007
Grid-Oriented Storage: A Single-Image, Cross-Domain, High-Bandwidth Architecture · IEEE Trans. Computers 2007
Storage systems
file systems
0.112007
Grid-Oriented Storage: A Single-Image, Cross-Domain, High-Bandwidth Architecture · IEEE Trans. Computers 2007
Storage systems
network-attached storage
0.112007
Grid-Oriented Storage: A Single-Image, Cross-Domain, High-Bandwidth Architecture · IEEE Trans. Computers 2007
Network security
censorship resistance
0.012012
StegoTorus: a camouflage proxy for the Tor anonymity system · CCS 2012
Electronic design automation
circuit simulation
0.011999
An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect · DAC 1999
Distributed systems
grid computing
0.012007
Grid-Oriented Storage: A Single-Image, Cross-Domain, High-Bandwidth Architecture · IEEE Trans. Computers 2007

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

label elaboration · 0.7contrastive pre-training · 0.7attention-based baseline · 0.7self-paraphrasing · 0.6paraphrasing · 0.6CIDEr optimization · 0.6larger models · 0.5data augmentation · 0.5traffic obfuscation · 0.1multistreaming · 0.1grid security infrastructure · 0.1vector ADI · 0.0lyapunov equation solver · 0.0krylov subspace moment matching · 0.0
YearPublicationVenuePosition
2026 Near-Heisenberg-limit Quantum Computing
abstract
Quantum computing is fundamentally limited by the Planck constant ( \(h = 6.63\ \times {{10}^{ - 34}}\ J \cdot s\) ) through the Heisenberg Limit. The energy consumption over a given time, or the speed of processing information with a specific energy budget, is a core research focus in quantum computing. To date, the smallest action (the energy-time cost) achieved is approximately \({{10}^{ - 29}}J \cdot s\) , using a giant spin qubit composed of 20 spins. In our study, we achieved an action of \(1.66\ \times {{10}^{ - 34}}\ J \cdot s\) to reversibly manipulate a single spin qubit through a spin-spin magnetic interaction experiment. By adhering to the principle of least action, our theoretical and experimental results establish the minimal action required. Our findings highlight the potential of spin-qubit quantum computers as accelerators for computation-intensive applications, such as AI and Post-Quantum Cryptography, since they exhibit several unique advantages: 1. High energy efficiency (by approaching the Heisenberg limit as well as the Landauer bound); 2. High-density integration (with just an atom/ion per qubit); 3. Long coherence times (tens of seconds); 4. High-fidelity (98%); and 5. Fault tolerance (through decoherence-free subspaces).
Frank Wang
ACM Trans. Quantum Comput.1
2023 Modality-Independent Teachers Meet Weakly-Supervised Audio-Visual Event Parser
abstract
Audio-visual learning has been a major pillar of multi-modal machine learning, where the community mostly focused on its $\textit{modality-aligned}$ setting, $\textit{i.e.}$, the audio and visual modality are $\textit{both}$ assumed to signal the prediction target. With the Look, Listen, and Parse dataset (LLP), we investigate the under-explored $\textit{unaligned}$ setting, where the goal is to recognize audio and visual events in a video with only weak labels observed. Such weak video-level labels only tell what events happen without knowing the modality they are perceived (audio, visual, or both). To enhance learning in this challenging setting, we incorporate large-scale contrastively pre-trained models as the modality teachers. A simple, effective, and generic method, termed $\textbf{V}$isual-$\textbf{A}$udio $\textbf{L}$abel Elab$\textbf{or}$ation (VALOR), is innovated to harvest modality labels for the training events. Empirical studies show that the harvested labels significantly improve an attentional baseline by $\textbf{8.0}$ in average F-score (Type@AV). Surprisingly, we found that modality-independent teachers outperform their modality-fused counterparts since they are noise-proof from the other potentially unaligned modality. Moreover, our best model achieves the new state-of-the-art on all metrics of LLP by a substantial margin ($\textbf{+5.4}$ F-score for Type@AV). VALOR is further generalized to Audio-Visual Event Localization and achieves the new state-of-the-art as well.
Yung-Hsuan Lai, Yen-Chun Chen 0001, Frank Wang
NeurIPS3
2022 Paraphrasing Is All You Need for Novel Object Captioning
abstract
Novel object captioning (NOC) aims to describe images containing objects without observing their ground truth captions during training. Due to the absence of caption annotation, captioning models cannot be directly optimized via sequence-to-sequence training or CIDEr optimization. As a result, we present Paraphrasing-to-Captioning (P2C), a two-stage learning framework for NOC, which would heuristically optimize the output captions via paraphrasing. With P2C, the captioning model first learns paraphrasing from a language model pre-trained on text-only corpus, allowing expansion of the word bank for improving linguistic fluency. To further enforce the output caption sufficiently describing the visual content of the input image, we perform self-paraphrasing for the captioning model with fidelity and adequacy objectives introduced. Since no ground truth captions are available for novel object images during training, our P2C leverages cross-modality (image-text) association modules to ensure the above caption characteristics can be properly preserved. In the experiments, we not only show that our P2C achieves state-of-the-art performances on nocaps and COCO Caption datasets, we also verify the effectiveness and flexibility of our learning framework by replacing language and cross-modality association models for NOC. Implementation details and code are available in the supplementary materials.
Cheng-Fu Yang, Yao-Hung Tsai, Wan-Cyuan Fan, Ruslan Salakhutdinov, Louis-Philippe Morency, Frank Wang
NeurIPS6
2021 The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalization
abstract
We introduce four new real-world distribution shift datasets consisting of changes in image style, image blurriness, geographic location, camera operation, and more. With our new datasets, we take stock of previously proposed methods for improving out-of-distribution robustness and put them to the test. We find that using larger models and artificial data augmentations can improve robustness on real-world distribution shifts, contrary to claims in prior work. We find improvements in artificial robustness benchmarks can transfer to real-world distribution shifts, contrary to claims in prior work. Motivated by our observation that data augmentations can help with real-world distribution shifts, we also introduce a new data augmentation method which advances the state-of-the-art and outperforms models pre-trained with 1000× more labeled data. Overall we find that some methods consistently help with distribution shifts in texture and local image statistics, but these methods do not help with some other distribution shifts like geographic changes. Our results show that future research must study multiple distribution shifts simultaneously, as we demonstrate that no evaluated method consistently improves robustness.
Dan Hendrycks, Steven Basart, Norman Mu, Saurav Kadavath, Frank Wang, Evan Dorundo, Rahul Desai, Tyler Zhu, Samyak Parajuli, Mike Guo, Dawn Song, Jacob Steinhardt, Justin Gilmer
ICCV5
2019 Riverbed: Enforcing User-defined Privacy Constraints in Distributed Web Services
Frank Wang, Ronny Ko, James W. Mickens
NSDI1
2018 Veil: Private Browsing Semantics Without Browser-side Assistance
Frank Wang, James W. Mickens, Nickolai Zeldovich
NDSS1
2017 Splinter: Practical Private Queries on Public Data
Frank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, Matei Zaharia
NSDI1
2016 Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds
Frank Wang, James W. Mickens, Nickolai Zeldovich, Vinod Vaikuntanathan
NSDI1
2015 Skewly replicating hot data to construct a power-efficient storage cluster
Yuhui Deng 0001, Weiheng Zhu, Jipeng Zhou, Frank Wang
J. Netw. Comput. Appl.5
2014 Data Interface All-iN-A-Place (DIANA) for Big Data
abstract
Variety in Big Data means we have a wide range of data types and sources: e.g. File systems and database systems co-exist for decades as two popular data-accessing interfaces. This work is to unify these two interfaces by presenting a Data Interface All-iN-A-place (DIANA). The first challenge lies in distinguishing structured and un-structured data and diverting them to different underlying platforms. It is demonstrated that a speedup of 5000 in indexing has been achieved at the expense of a slowdown of 100 in extracting attributes. A DIANA-based cloud storage system is constructed for versatile, long distance and large volume big data accessing operations to address "Volume" and "Velocity" in Big Data. It encapsulates a dynamic multi-stream/multi-path engine at the socket level, which conforms to Portable Operating System Interface (POSIX).
Frank Wang, Theodosis Dimitrakos, Na Helian, Sining Wu, Yuhui Deng 0001, Rodric Yates
TrustCom1
2013 Private Database Queries Using Somewhat Homomorphic Encryption
Dan Boneh, Craig Gentry, Shai Halevi, Frank Wang, David J. Wu 0001
ACNS4
2013 Adaptive Neuromorphic Architecture (ANA)
Frank Wang, Leon O. Chua, Xiao Yang 0006, Na Helian, Ronald Tetzlaff, Torsten Schmidt, Caroline Li, José M. García 0001, Wanlong Chen, Dominique F. Chu
Neural Networks1
2012 StegoTorus: a camouflage proxy for the Tor anonymity system
abstract
Internet censorship by governments is an increasingly common practice worldwide. Internet users and censors are locked in an arms race: as users find ways to evade censorship schemes, the censors develop countermeasures for the evasion tactics. One of the most popular and effective circumvention tools, Tor, must regularly adjust its network traffic signature to remain usable.
Zachary Weinberg, Jeffrey Wang, Vinod Yegneswaran, Linda Briesemeister, Steven Cheung, Frank Wang, Dan Boneh
CCS6
2011 LAG: Achieving transparent access to legacy data by leveraging grid environment
Yuhui Deng 0001, Frank Wang
Future Gener. Comput. Syst.2
2009 Eight Times Acceleration of Geospatial Data Archiving and Distribution on the Grids
abstract
A grid-powered Web Geographical Information Science (GIS)/Web Processing Service (WPS) system has been developed for archiving and distributing large volumes of geospatial data. However, users, WPS servers, and data resources are always distributed across different locations, attempting to access and archive geospatial data from a GIS survey via conventional Hypertext Transport Protocol, Network File System Protocol, and File Transfer Protocol, which often encounters long waits and frustration in wide area network (WAN) environments. To provide a “local-like” performance, a WAN/grid-optimized protocol known as “GridJet” developed at our lab was used as the underlying engine between WPS servers and clients, which utilizes a wide range of technologies including the one of paralleling the remote file access. No change in the way of using software is required since the multistreamed GridJet protocol remains fully compatible with the existing IP infrastructures. Our recent progress includes a real-world test that PyWPS and Google Earth over the GridJet protocol beat those over the classic ones by a factor of two to eight, where the distribution/archiving distance is over 10 000 km.
Frank Wang, Na Helian, Sining Wu, Yike Guo, Yuhui Deng 0001, Lingkui Meng, Wen Zhang 0011, Jon Crowcroft, Jean Bacon, Michael Andrew Parker
IEEE Trans. Geosci. Remote. Sens.1
2009 Correction to "Eight Times Acceleration of Geospatial Data Archiving and Distribution on the Grids"
abstract
In the above-named work the name of one of the authors is incorrectly given. Included here also is the biography with the missing IEEE membership information.
Frank Wang, Na Helian, Sining Wu, Yike Guo, Yuhui Deng 0001, Lingkui Meng, Wen Zhang 0011, Jon Crowcroft, Jean Bacon, Michael Andrew Parker
IEEE Trans. Geosci. Remote. Sens.1
2009 Ant colony optimization inspired resource discovery in P2P Grid systems
Yuhui Deng 0001, Frank Wang, Adrian Ciura
J. Supercomput.2
2008 EED: Energy Efficient Disk drive architecture
Yuhui Deng 0001, Frank Wang, Na Helian
Inf. Sci.2
2008 Exploring the performance impact of stripe size on network attached storage systems
Yuhui Deng 0001, Frank Wang
J. Syst. Archit.2
2008 Dynamic and scalable storage management architecture for Grid Oriented Storage devices
Yuhui Deng 0001, Frank Wang, Na Helian, Sining Wu, Chenhan Liao
Parallel Comput.2
2007 Implementing and Evaluating Security Controls for an Object-Based Storage System
Zhongying Niu, Ke Zhou 0001, Dan Feng 0001, Hong Jiang 0001, Frank Wang, Chun-hua Li
MSST5
2007 GridJet: An underlying data-transporting protocol for accelerating Web communications
Frank Wang, Na Helian, Sining Wu, Yuhui Deng 0001, Vineet R. Khare, Michael Parker
Comput. Networks1
2007 Grid-Oriented Storage: A Single-Image, Cross-Domain, High-Bandwidth Architecture
abstract
This paper describes the grid-oriented storage (GOS) architecture and its implementations. A GOS-specific file system (GOS-FS), the single-purpose intent of a GOS OS, and secure interfaces via grid security infrastructure (GSI) motivate and enable this new architecture. As an FTP server, GOS with a slimmed OS, with a total volume of around 150 MB, outperforms the standard GridFTP by 20-40 percent. As a file server, GOS-FS acts as a network/grid interface, enabling a user to perform searches and access resources without downloading them locally. In the real-world tests between Cambridge and Beijing, where the transfer distance is 10,000 km, the multistreamed GOS-FS file opening/saving resulted in a remarkable performance increase of about 2-25 times, compared to the single-streamed network file system (NFSv4). GOS is expected to be a variant of or successor to the well-used network-attached storage (NAS) and/or storage area network (SAN) products in the grid era
Frank Wang, Sining Wu, Na Helian, Michael Andrew Parker, Yike Guo, Yuhui Deng 0001, Vineet R. Khare
IEEE Trans. Computers1
2005 Mining Global Association Rules on an Oracle Grid by Scanning Once Distributed Databases
Frank Wang, Na Helian
Euro-Par1
2004 Web Intelligence Research Activities in the UK
abstract
The Web Intelligence Consortium (WIC) UK Centre has been founded in 2003 as an affiliated Centre of the WIC international organization. Since its foundation, the WIC UK Centre has devoted itself to developing and disseminating Web Intelligence (WI) technologies with a focus on Web Services powered by Grid Computing. The Centre has become a well organized and active group of strong academics and industrial practitioners, playing an important role in the international WI research. A number of activities have been carried out and planned by the WIC UK Centre.
Frank Wang, Yau Jim Yip
Web Intelligence1
2003 List Representation Applied to Sparse Datacubes for Data Warehousing and Data Mining
Frank Wang, Farhi Marir, John Gordon, Na Helian
IDEAL1
1999 An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect
abstract
In this paper we present a new algorithm for computing reduced-order models of interconnect which utilizes the dominant controllable subspace of the system.The dominant controllable modes are computed via a new iterative Lyapunov equation solver, Vector ADI.This new algorithm is as inexpensive as Krylov subspace-based moment matching methods, and often produces a better approximation over a wide frequency range.A spiral inductor and a transmission line example show this new method can be much more accurate than moment matching via Arnoldi.
Jing-Rebecca Li, Frank Wang, Jacob K. White 0001
DAC2