Author name cluster

Wenli Zhou

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers

2 author rows

IJCAI Conference 2022 Conference Paper

VMAgent: A Practical Virtual Machine Scheduling Platform

Junjie Sheng
Shengliang Cai
Haochuan Cui
Wenhao Li
Yun Hua
Bo Jin
Wenli Zhou
Yiqiu Hu

Virtual machine (VM) scheduling is one of the critical tasks in cloud computing. Many works have attempted to incorporate machine learning, especially reinforcement learning, to empower VM scheduling procedures. Although improved results are shown in several demo simulators, the performances in real-world scenarios are still underexploited. In this paper, we design a practical VM scheduling platform, i. e. , VMAgent, to assist researchers in developing their methods on the VM scheduling problem. VMAgent consists of three components: simulator, scheduler, and visualizer. The simulator abstracts three general realistic scheduling scenarios (fading, recovering, and expansion) based on Huawei Cloud’s scheduling data, which is the core of our platform. Flexible configurations are further provided to make the simulator compatible with practical cloud computing architecture (i. e. , Multi Non-Uniform Memory Access) and scenarios. Researchers then need to instantiate the scheduler to interact with the simulator, which is also pre-built in various types (e. g. , heuristic, machine learning, and operations research) of scheduling algorithms to speed up the algorithm design. The visualizer, as an auxiliary component of the simulator and scheduler, facilitates researchers to conduct an in-depth analysis of the scheduling procedure and comprehensively compare different scheduling algorithms. We believe that VMAgent would shed light on the AI for the VM scheduling community, and the demo video is presented in https: //bit. ly/vmagent-demo-video.

PDF Details DOI

TCS Journal 2011 Journal Article

A primal–dual approximation algorithm for the vertex cover P 3 problem

Jianhua Tu
Wenli Zhou

We introduce the vertex cover P n ( V C P n ) problem, that is, the problem of finding a minimum weight set F ⊂ V such that the graph G [ V − F ] has no P n, where P n is a path with n vertices. The problem also has its application background. In this paper, we first show that the V C P n problem is NP-hard for any integer n ≥ 2. Then we restrict our attention to the V C P 3 problem and give a 2-approximation algorithm using the primal–dual method.

Details DOI

TCS Journal 2008 Journal Article

The 2nd-order conditional 3-coloring of claw-free graphs

Xueliang Li
Wenli Zhou

A 2nd-order conditional k -coloring of a graph G is a proper k -coloring of the vertices of G such that every vertex of degree at least 2 in G will be adjacent to vertices with at least 2 different colors. The smallest number k for which a graph G can have a 2nd-order conditional k -coloring is the 2nd-order conditional chromatic number, denoted by χ d ( G ). In this paper, we investigate the 2nd-order conditional 3-colorings of claw-free graphs. First, we prove that it is N P -complete to determine if a claw-free graph with maximum degree 3 is 2nd-order conditionally 3-colorable. Second, by forbidding a kind of subgraphs, we find a reasonable subclass of claw-free graphs with maximum degree 3, for which the 2nd-order conditionally 3-colorable problem can be solved in linear time. Third, we give a linear time algorithm to recognize this subclass of graphs, and a linear time algorithm to determine whether it is 2nd-order conditionally 3-colorable. We also give a linear time algorithm to color the graphs in the subclass by 3 colors.

Details DOI

IROS Conference 2001 Conference Paper

Development of a force-reflection controlled micro underwater actuator

Wenli Zhou
Allan P. Hui
Wen J. Li
Ning Xi 0001

The ability to manipulate and control biological cells with reflective-force information is a key technology necessary for many new applications in bio-MEMS, but is currently lacking in all cellular manipulators. We report our preliminary experimental work in using an ionic conducting polymer film (ICPF) to develop a biological cellular robotic gripper with force sensing capability. ICPF actuators are able to give large deflection with small input voltage (/spl sim/5V) in aqueous environments, and also able to give relatively large output voltage due to deflection by mechanical forces. Thus, ICPF actuators are investigated as possible cellular force-reflection controlled manipulators in our work. Individual multi-finger grippers with dimensions of 200/spl mu/m /spl times/ 200/spl mu/m /spl times/ 3000/spl mu/m for each finger were realized. We report on the design, fabrication procedures, and operating performance of our ICPF actuators. Further development in the reduction of size of these actuators will enable effective force-feedback control of underwater micro objects and lead to new frontiers in cellular manipulation.

Details