Zongming Fei

Zongming Fei

Auto-generated profile, based on publicly available information

Zongming Fei

Computer Science, University of Kentucky, Lexington, KY, USA

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 January 2014 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
HLHui Lu
Hui Lu
XWXiaoteng Wang
Xiaoteng Wang
ZFZongming Fei
Zongming Fei
MQMeikang QIU
Meikang QIU
Chaotic maps play an important role in improving evolutionary algorithms (EAs) for avoiding the local optima and speeding up the convergence. However, different chaotic maps in different phases have different effects on EAs. This paper focuses on exploring the effects of chaotic maps and giving comprehensive guidance for improving multiobjective evolutionary algorithms (MOEAs) by series of experiments. NSGA‐II algorithm, a representative of MOEAs using the nondominated sorting and elitist strategy, is taken as the framework to study the effect of chaotic maps. Ten chaotic maps are applied in MOEAs in three phases, that is, initial population, crossover, and mutation operator. Multiobjective problems (MOPs) adopted are ZDT series problems to show the generality. Since the scale of some sequences generated by chaotic maps is changed to fit for MOPs, the correctness of scaling transformation of chaotic sequences is proved by measuring the largest Lyapunov exponent. The convergence metric γ and diversity metric Δ are chosen to evaluate the performance of new algorithms with chaos. The results of experiments demonstrate that chaotic maps can improve the performance of MOEAs, especially in solving problems with convex and piecewise Pareto front. In addition, cat map has the best performance in solving problems with local optima.

1 August 2010
Verified
Conference Paper
Closed access
JYJianjun Yang
Jianjun Yang
ZFZongming Fei
Zongming Fei
Geographic routing is an effective approach for finding a path to forward packets from a source to a destination in wireless ad hoc networks when nodes have location information. The basic strategy is to let each node select one of its neighbors that is closest to the destination as the next hop to forward the packet greedily. However, when there are void areas (holes), greedy routing does not work due to the local minimum problem. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. In this paper, we propose a new approach called Intermediate Target Based Geographic Routing (ITGR) to avoid such long detour paths. The source determines destination areas which are shaded by the holes based on previous forwarding experience. The novelty of the approach is that a single forwarding path can be used to determine a shaded area that may cover many destination nodes. We design an efficient method for the source to find out whether a destination node belongs to a shaded area. The source then selects an intermediate node as the tentative target and greedily forwards packets to it, which in turn forwards the packet to the final destination by greedy routing. ITGR can be recursively called, if necessary, to generate a detour-free path with multiple tentative targets. Simulation results show that ITGR significantly reduces the routing path length, compared with existing geographic routing protocols.

1 April 2017
Verified
Conference Paper
Closed access
JAJayanti Andhale
Jayanti Andhale
CDChandrima Dadi
Chandrima Dadi
ZFZongming Fei
Zongming Fei
The use of video chat and video conference applications is ubiquitous, especially in this era of wireless and mobility. However, a video chat system that allows communicating parties to speak/type indifferent languages has not been widely used. In this paper, we propose a service-oriented architecture to developa multilingual video chat system that supports people speaking/texting in different languages. It uses the Web Real Time Communication (WebRTC) technology andtakes advantage of the services available on the Internet, includingGoogle Web Speech API, Google Transliterate API, and Microsoft Translator. It is a browser based solution that allows users to connect from various platforms, such as Windows, Linux, or Mac. Since the application uses WebRTC, the user does not have to download and install any plugins. The service-oriented architecture design based on WebRTC allows us todevelop and implement the whole system in a short period of time.

18 July 2025
Verified
Conference Paper
Open access
CCCharles Carpenter
Charles Carpenter
YSYongwook Song
Yongwook Song
PSPinyi Shi
Pinyi Shi
MHMami Hayashida
Mami Hayashida
ZFZongming Fei
Zongming Fei
JGJames Griffioen
James Griffioen

1 May 2017
Verified
Conference Paper
Closed access
SRSergio Rivera
Sergio Rivera
JCJacob Chappell
Jacob Chappell
MHMami Hayashida
Mami Hayashida
AGAndrew Groenewold
Andrew Groenewold
POPeter Oostema
Peter Oostema
JGJames Griffioen
James Griffioen
Big Data transfers are increasingly plagued by middlebox bottlenecks such as NAT boxes, firewalls, and intrusion detection systems that prevent large data transfers from achieving maximal throughput across the campus network. Science DMZs have historically been used to solve this problem. We are developing a Software Defined Networking (SDN) campus network that achieves the same benefits - by allowing privileged flows to bypass middleboxes - without the limitations and downsides of Science DMZs. To evaluate our approach and develop a prototype implementation, we created a campus-like lab-based physical network using Aruba switches that support running multiple OpenFlow (virtual) instances per physical chassis. We will demonstrate the control software used to drive the testbed and the performance improvement for big data transfers under our approach.