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

Hongguang Ren

dblp:50/9639 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2023
0000-0002-9151-6090ORCID · reported

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

Systems, architecture and hardware · 2Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Graph learning · 77% Representation and self-supervised learning · 23%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
0.712023
Learning Region Similarities via Graph-Based Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Graph learning › graph neural network › heterogeneous graph neural network
multi-relational graph neural network
0.712023
Learning Region Similarities via Graph-Based Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2023
Information retrieval
similarity learning
0.712023
Learning Region Similarities via Graph-Based Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.212023
Learning Region Similarities via Graph-Based Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.212023
Learning Region Similarities via Graph-Based Deep Metric Learning · IEEE Trans. Knowl. Data Eng. 2023

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

metric learning · 1.3graph edit distance · 1.3contrastive learning · 1.3
YearPublicationVenuePosition
2023 Learning Region Similarities via Graph-Based Deep Metric Learning
abstract
Region similarity learning plays an essential role in applications such as business site selection, region recommendation, and urban planning. Earlier studies mainly represent regions as bags of points of interest (POIs) for region similarity comparisons, which cannot fully exploit the spatial features of the regions. Recently, researchers propose to use deep neural networks to exploit spatial features such as POI geo-coordinates and categories, which have produced more accurate and robust region similarity learning results. However, many useful features such as the height and size of a POI, and the distance and relative importance between the POIs, are still overlooked in these methods. To take advantage of such features, we propose to represent regions as graphs, where nodes are POIs with rich features such as height, size, and hexagonal coordinates, while edges are the relationships between POIs formulated by their road network distances. To capture POIs’ importance, we weigh them by their height and size. Since there is limited availability of ground-truth region similarity data, we propose a contrastive learning-based multi-relational graph neural network (C-MPGCN) for region similarity learning based on the graph representations. To generate data for model training, we propose a soft graph edit distance (SGED) based algorithm to generate triples of similar and dissimilar graphs of a given graph (representing a given region) based on the POI weights. Experimental results show that C-MPGCN outperforms the state-of-the-art methods for region similarity learning consistently with an improvement of at least 8.6% and 9.4% in terms of MRR and HR@1, respectively.
Jianzhong Qi 0001, Bayu Distiawan Trisedya, Yixin Su 0001, Rui Zhang 0003, Hongguang Ren
IEEE Trans. Knowl. Data Eng.6
2011 A novel shared-buffer router for network-on-chip based on Hierarchical Bit-line Buffer
abstract
Buffer resources are key components of the on-chip router, shared-buffer structures are proposed to improve performance and reduce power consumption. This paper presents a novel on-chip network router with a shared-buffer based on Hierarchical Bit-line Buffer (HiBB). HiBB can be configured flexibly according to traffics and its inherent characteristic of low power is also noticeable. Moreover, we propose two schemes to further optimize the router. First, a congestion-aware output-port allocation scheme is used to assign higher priority to packets heading to light-loaded directions, and the congestion situation of the total network will be addressed. Second, an efficient run-time Virtual Channel (VC) regulation scheme is proposed to configure the shared buffer, so that VCs are allocated according to the loads of network. Experimental results show that the proposed HiBB router with about 6.9% area savings outperforms the generic router under different traffic patterns. The power consumption of the HiBB router can also be reduced up to about 70% of the generic router under light traffics, while it may exceed that of the generic one up to about 3.7–5.7% under heavy traffics for the increased flit transmissions.
Weixia Xu 0001, Hongguang Ren, Qiang Dou, Zhiying Wang 0003, Li Shen 0007, Cong Liu 0009
ICCD3
2011 Structure-Based Deadlock Checking of Asynchronous Circuits
Hongguang Ren, Zhiying Wang 0003, Doug Edwards
J. Comput. Sci. Technol.1
2010 DSS: Applying asynchronous techniques to architectures exploiting ILP at compile time
abstract
Embedded application environments require both high performance and low power. Architectures exploiting instruction-level parallelism (ILP) at compile time, such as very long instruction word (VLIW) and transport triggered architecture (TTA), may satisfy the requirements. They can be further enhanced by using asynchronous circuits to significantly reduce power consumption. As such, we are interested in asynchronous processors with architectures exploiting ILP at compile time. However, most of the current asynchronous processors are based on RISC-like architectures. When designing asynchronous VLIW or TTA processors, the distribution of control introduces some serious problems, and errors may occur because of the variable latencies of operations. This paper investigates the asynchronous processor with architecture exploiting ILP at compile time. In order to overcome these problems, we propose a data source selecting (DSS) scheme to guarantee instructions run correctly on asynchronous VLIW and TTA processors. Concretely, an asynchronous pipelined processor based on TTA is designed. The micro-architecture of the proposed asynchronous TTA processor is presented and an asynchronous processor named Tengyue is implemented using 180nm technology. The experimental results, for a range of benchmarks and working modes, show that the implemented asynchronous TTA processor with DSS scheme support runs correctly and power dissipation is reduced to about 43% to 65% of the equivalent synchronous processor.
Zhiying Wang 0003, Hongguang Ren, Wei Chen 0009, Hongyi Lu
ICCD3