Demo Data from VLDB 2026 / reviewers in the wild / expert
Hong Yan 0002
dblp:68/974-2
· DBLP profile ↗
10ranked-venue papers
4as first author
0since 2021 · last 2011
0000-0002-0699-5470ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4 · 1 first-authorArtificial intelligence and machine learning · 3 · 1 first-authorComputer networks · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 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.
| Software engineering, system software, and programming languages
3 papers |
Requirements engineering and software design · 70% Program analysis · 23% Software maintenance and evolution · 8% | |
| Computer networks
2 papers |
Network management and operations · 74% Software-defined and programmable networks · 18% Internet architecture and protocols · 8% |
Topics — the 11 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design
software architecture |
0.2 | 3 | 2006 | Discovering Architectures from Running Systems · IEEE Trans. Software Eng. 2006 Dynamically discovering architectures with DiscoTect · ESEC/SIGSOFT FSE 2005 DiscoTect: A System for Discovering Architectures from Running Systems · ICSE 2004 |
Requirements engineering and software design › software architecture › software architecture analysis
software architecture recovery |
0.2 | 3 | 2006 | Discovering Architectures from Running Systems · IEEE Trans. Software Eng. 2006 Dynamically discovering architectures with DiscoTect · ESEC/SIGSOFT FSE 2005 DiscoTect: A System for Discovering Architectures from Running Systems · ICSE 2004 |
Network management and operations › network automation
autonomic network management |
0.1 | 1 | 2010 | MMS: An autonomic network-layer foundation for network management · IEEE J. Sel. Areas Commun. 2010 |
Software-defined and programmable networks
control plane |
0.1 | 1 | 2007 | Tesseract: A 4D Network Control Plane · NSDI 2007 |
Network management and operations
network configuration |
0.1 | 1 | 2007 | Tesseract: A 4D Network Control Plane · NSDI 2007 |
Program analysis
dynamic analysis |
0.1 | 2 | 2005 | Dynamically discovering architectures with DiscoTect · ESEC/SIGSOFT FSE 2005 DiscoTect: A System for Discovering Architectures from Running Systems · ICSE 2004 |
Requirements engineering and software design › software architecture
architecture-implementation conformance |
0.1 | 1 | 2006 | Discovering Architectures from Running Systems · IEEE Trans. Software Eng. 2006 |
Program analysis › dynamic analysis
runtime monitoring |
0.1 | 1 | 2005 | Dynamically discovering architectures with DiscoTect · ESEC/SIGSOFT FSE 2005 |
Requirements engineering and software design › software architecture › software architecture analysis
architecture consistency |
0.0 | 1 | 2004 | DiscoTect: A System for Discovering Architectures from Running Systems · ICSE 2004 |
Software maintenance and evolution
software evolution |
0.0 | 1 | 2004 | DiscoTect: A System for Discovering Architectures from Running Systems · ICSE 2004 |
Internet architecture and protocols › network architecture design › layered architecture › protocol layering
network layer |
0.0 | 1 | 2010 | MMS: An autonomic network-layer foundation for network management · IEEE J. Sel. Areas Commun. 2010 |
Methods — techniques the papers use, named apart from their topics
colored petri nets · 0.1system implementation · 0.1mapping language · 0.1runtime observation · 0.0mapping · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Data envelopment analysis classification machine
Hong Yan 0002, Quanling Wei |
Inf. Sci. | 1 |
| 2010 | MMS: An autonomic network-layer foundation for network managementabstractNetworks cannot be managed without management plane communications among geographically distributed network devices and control agents. Unfortunately, the mechanisms used in commercial networks to support management plane communications are often hard to configure, insufficiently secured, and/or suboptimal in performance. This paper presents the design and implementation of the Meta-Management System (MMS), a network-layer subsystem that provides robust autonomic support for management plane communications. We demonstrate the practicality of the MMS via a fully functional implementation that runs on commodity hardware, and experimentally show that the MMS is efficient and scalable. The MMS software is freely available. Hemant Gogineni, Albert G. Greenberg, David A. Maltz, T. S. Eugene Ng, Hong Yan 0002, Hui Zhang 0001 |
IEEE J. Sel. Areas Commun. | 5 |
| 2009 | Bargaining game model in the evaluation of decision making units
Jie Wu 0004, Liang Liang 0001, Feng Yang 0005, Hong Yan 0002 |
Expert Syst. Appl. | 4 |
| 2007 | Tesseract: A 4D Network Control Plane
Hong Yan 0002, David A. Maltz, T. S. Eugene Ng, Hemant Gogineni, Hui Zhang 0001, Zheng Cai |
NSDI | 1 |
| 2006 | Discovering Architectures from Running SystemsabstractOne of the challenging problems for software developers is guaranteeing that a system as built is consistent with its architectural design. In this paper, we describe a technique that uses runtime observations about an executing system to construct an architectural view of the system. In this technique, we develop mappings that exploit regularities in system implementation and architectural style. These mappings describe how low-level system events can be interpreted as more abstract architectural operations and are formally defined using Colored Petri Nets. In this paper, we describe a system, called DiscoTect, that uses these mappings and we introduce the DiscoSTEP mapping language and its formal definition. Two case studies showing the application of DiscoTect suggest that the tool is practical to apply to legacy systems and can dynamically verify conformance to a preexisting architectural specification. Bradley R. Schmerl, Jonathan Aldrich, David Garlan, Rick Kazman, Hong Yan 0002 |
IEEE Trans. Software Eng. | 5 |
| 2005 | Dynamically discovering architectures with DiscoTectabstractOne of the challenges for software architects is ensuring that an implemented system faithfully represents its architecture. We describe and demonstrate a tool, called DiscoTect, that addresses this challenge by dynamically monitoring a running system and deriving the software architecture as that system runs. The derivation process is based on mappings that relate low level system-level events to higher-level architectural events. The resulting architecture is then fed into existing architectural design tools so that comparisons can be conducted with the design time architecture and architectural analyses can be re-run to ensure that they are still valid. In addition to the demonstration, we briefly describe the mapping language and formal definition of the language in terms of Colored Petri Nets. Bradley R. Schmerl, David Garlan, Hong Yan 0002 |
ESEC/SIGSOFT FSE | 3 |
| 2004 | DiscoTect: A System for Discovering Architectures from Running SystemsabstractOne of the challenging problems for software developers is guaranteeing that a system as built is consistent with its architectural design. In this paper, we describe a technique that uses run time observations about an executing system to construct an architectural view of the system. With this technique, we develop mappings that exploit regularities in system implementation and architectural style. These mappings describe how low-level system events can be interpreted as more abstract architectural operations. We describe the current implementation of a tool that uses these mappings, and show that it can highlight inconsistencies between implementation and architecture. Hong Yan 0002, David Garlan, Bradley R. Schmerl, Jonathan Aldrich, Rick Kazman |
ICSE | 1 |
| 2002 | A Relaxation of the Cumulative Constraint
John N. Hooker, Hong Yan 0002 |
CP | 2 |
| 2002 | A class of convex fuzzy mappings
Hong Yan 0002, Jiuping Xu |
Fuzzy Sets Syst. | 1 |
| 2001 | Representations of the all_different Predicate of Constraint Satisfaction in Integer ProgrammingabstractThe use of predicates to state constraints in Constraint Satisfaction is explained. If, as an alternative, the traditional approach of Integer Programming (IP) is used, it is desirable to model these constraints so as to give as tight a linear programming relaxation as possible. One of the most commonly used predicates is the “all_different” predicate. Different applications of this are described together with different IP formulations. The facet defining constraints for the convex hull are then described and proved to be facet defining. H. Paul Williams, Hong Yan 0002 |
INFORMS J. Comput. | 2 |