Bing Bing Zhou

Bing Bing Zhou

Auto-generated profile, based on publicly available information

Bing Bing Zhou

University of Sydney

Research Focus & Metrics

Academic Career Length

39Years (1988-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2010 in Current Bioinformatics
Verified
Journal Article
Closed access
PDF file
PYPengyi Yang
Pengyi Yang
YYYee Hwa Yang
Yee Hwa Yang
BZBing B. Zhou
Bing B. Zhou
Albert ZomayaAlbert Zomaya
Albert Zomaya
Ensemble learning is an intensively studied technique in machine learning and pattern recognition. Recent work in computational biology has seen an increasing use of ensemble learning methods due to their unique advantages in dealing with small sample size, high-dimensionality, and complex data structures. The aim of this article is two-fold. Firstly, it is to provide a review of the most widely used ensemble learning methods and their application in various bioinformatics problems, including the main topics of gene expression, mass spectrometry-based proteomics, gene-gene interaction identification from genome-wide association studies, and prediction of regulatory elements from DNA and protein sequences. Secondly, we try to identify and summarize future trends of ensemble methods in bioinformatics. Promising directions such as ensemble of support vector machines, meta-ensembles, and ensemble based feature selection are discussed.

17 November 2017 in IEEE Communications Magazine
Verified
Journal Article
Closed access
WBWei Bao
Wei Bao
DYDong Yuan
Dong Yuan
Zhengjie YangZhengjie Yang
Zhengjie Yang
SWShen Wang
Shen Wang
WLWei Li
Wei Li
Albert ZomayaAlbert Zomaya
Albert Zomaya
Equipped with easy-to-access micro computation access points, the fog computing architecture provides low-latency and ubiquitously available computation offloading services to many simple and cheap Internet of Things devices with limited computing and energy resources. One obstacle, however, is how to seamlessly hand over mobile IoT devices among different computation access points when computation offloading is in action so that the offloading service is not interrupted - especially for time-sensitive applications. In this article, we propose Follow Me Fog (FMF), a framework supporting a new seamless handover timing scheme among different computation access points. Intrinsically, FMF supports a job pre-migration mechanism, which pre-migrates computation jobs when the handover is expected to happen. Such expectations can be indicated by constantly monitoring received signal strengths. Then we present the design and a prototype implementation of FMF. Our evaluation results demonstrate that FMF can achieve a substantial latency reduction (36.5 percent in our experiment). In conclusion, the FMF design clears a core obstacle, allowing fog computing to provide interruption-resistant services to mobile IoT devices.

8 June 2011
Verified
Conference Paper
Open access
PDF file
JCJunliang Chen
Junliang Chen
CWChen Wang
Chen Wang
BZBing Bing Zhou
Bing Bing Zhou
LSLei Sun
Lei Sun
YLYoung Choon Lee
Young Choon Lee
Albert ZomayaAlbert Zomaya
Albert Zomaya
The recent cloud computing paradigm represents a trend of moving business applications to platforms run by parties located in different administrative domains. A cloud platform is often highly scalable and cost-effective through its pay-as-you-go pricing model. However, being shared by a large number of users, the running of applications in the platform faces higher performance uncertainty compared to a dedicated platform. Existing Service Level Agreements (SLAs) cannot sufficiently address the performance variation issue. In this paper, we use utility theory leveraged from economics and develop a new utility model for measuring customer satisfaction in the cloud. Based on the utility model, we design a mechanism to support utility-based SLAs in order to balance the performance of applications and the cost of running them. We consider an infrastructure-as-a-service type cloud platform (e.g., Amazon EC2), where a business service provider leases virtual machine (VM) instances with spot prices from the cloud and gains revenue by serving its customers. Particularly, we investigate the interaction of service profit and customer satisfaction. In addition, we present two scheduling algorithms that can effectively bid for different types of VM instances to make tradeoffs between profit and customer satisfaction. We conduct extensive simulations based on the performance data of different types of Amazon EC2 instances and their price history. Our experimental results demonstrate that the algorithms perform well across the metrics of profit, customer satisfaction and instance utilization.

1 March 2015 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
KYKejiang Ye
Kejiang Ye
ZWZhaohui Wu
Zhaohui Wu
CWChen Wang
Chen Wang
BZBing Bing Zhou
Bing Bing Zhou
WSWeisheng Si
Weisheng Si
Albert ZomayaAlbert Zomaya
Albert Zomaya
Improving energy efficiency of data centers has become increasingly important nowadays due to the significant amounts of power needed to operate these centers. An important method for achieving energy efficiency is server consolidation supported by virtualization. However, server consolidation may incur significant degradation to workload performance due to virtual machine (VM) co-location and migration. How to reduce such performance degradation becomes a critical issue to address. In this paper, we propose a profiling-based server consolidation framework which minimizes the number of physical machines (PMs) used in data centers while maintaining satisfactory performance of various workloads. Inside this framework, we first profile the performance losses of various workloads under two situations: running in co-location and experiencing migrations. We then design two modules: (1) consolidation planning module which, given a set of workloads, minimizes the number of PMs by an integer programming model, and (2) migration planning module which, given a source VM placement scenario and a target VM placement scenario, minimizes the number of VM migrations by a polynomial time algorithm. Also, based on the workload performance profiles, both modules can guarantee the performance losses of various workloads below configurable thresholds. Our experiments for workload profiling are conducted with real data center workloads and our experiments on our two modules validate the integer programming model and the polynomial time algorithm.

1 April 2012 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
YLYoung Choon Lee
Young Choon Lee
CWChen Wang
Chen Wang
Albert ZomayaAlbert Zomaya
Albert Zomaya
BZBing Bing Zhou
Bing Bing Zhou

1 January 2010
Verified
Conference Paper
Closed access
YLYoung Choon Lee
Young Choon Lee
CWChen Wang
Chen Wang
Albert ZomayaAlbert Zomaya
Albert Zomaya
BZBing Bing Zhou
Bing Bing Zhou
A primary driving force of the recent cloud computing paradigm is its inherent cost effectiveness. As in many basic utilities, such as electricity and water, consumers/clients in cloud computing environments are charged based on their service usage, hence the term `pay-per-use'. While this pricing model is very appealing for both service providers and consumers, fluctuating service request volume and conflicting objectives (e.g., profit vs. response time) between providers and consumers hinder its effective application to cloud computing environments. In this paper, we address the problem of service request scheduling in cloud computing systems. We consider a three-tier cloud structure, which consists of infrastructure vendors, service providers and consumers, the latter two parties are particular interest to us. Clearly, scheduling strategies in this scenario should satisfy the objectives of both parties. Our contributions include the development of a pricing model-using processor-sharing-for clouds, the application of this pricing model to composite services with dependency consideration (to the best of our knowledge, the work in this study is the first attempt), and the development of two sets of profit-driven scheduling algorithms.