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

Jiandong Meng

dblp:06/10441 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 67% Energy-efficient computing · 33%

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

TopicWeightPapersLastEvidence papers
Energy-efficient computing › datacenter power management
electricity cost minimization
0.112011
Reducing electricity cost through virtual machine placement in high performance computing clouds · SC 2011
Cloud and datacenter computing › datacenter architecture
geo-distributed datacenters
0.112011
Reducing electricity cost through virtual machine placement in high performance computing clouds · SC 2011
Cloud and datacenter computing › virtualization › virtual machine management
virtual machine placement
0.112011
Reducing electricity cost through virtual machine placement in high performance computing clouds · SC 2011

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

dynamic load distribution · 0.1cost-aware policies · 0.1
YearPublicationVenuePosition
2017 Support top irrelevant machine: learning similarity measures to maximize top precision for image retrieval
Jiandong Meng, Irfani Priananda
Neural Comput. Appl.1
2016 Optimizing top precision performance measure of content-based image retrieval by learning similarity function
abstract
In this paper we study the problem of content-based image retrieval. In this problem, the most popular performance measure is the top precision measure, and the most important component of a retrieval system is the similarity function used to compare a query image against a database image. However, up to now, there is no existing similarity learning method proposed to optimize the top precision measure. To fill this gap, in this paper, we propose a novel similarity learning method to maximize the top precision measure. We model this problem as a minimization problem with an objective function as the combination of the losses of the relevant images ranked behind the top-ranked irrelevant image, and the squared Frobenius norm of the similarity function parameter. This minimization problem is solved as a quadratic programming problem. The experiments over two benchmark data sets show the advantages of the proposed method over other similarity learning methods when the top precision is used as the performance measure.
Ru-Ze Liang, Lihui Shi, Haoxiang Wang 0001, Jiandong Meng, Jim Jing-Yan Wang, Qingquan Sun
ICPR4
2011 Reducing electricity cost through virtual machine placement in high performance computing clouds
abstract
In this paper, we first study the impact of load placement policies on cooling and maximum data center temperatures in cloud service providers that operate multiple geographically distributed data centers. Based on this study, we then propose dynamic load distribution policies that consider all electricity-related costs as well as transient cooling effects. Our evaluation studies the ability of different cooling strategies to handle load spikes, compares the behaviors of our dynamic cost-aware policies to cost-unaware and static policies, and explores the effects of many parameter settings. Among other interesting results, we demonstrate that (1) our policies can provide large cost savings, (2) load migration enables savings in many scenarios, and (3) all electricity-related costs must be considered at the same time for higher and consistent cost savings.
Kien Le, Ricardo Bianchini, Yogesh Jaluria, Jiandong Meng, Thu D. Nguyen
SC5