Benxiong Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Benxiong Huang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Bin Dai
School of Electronic Information and Communications, Huazhong University of Science and Technology, Wuhan, China
3 shared publications Zhengguang Xu
Huazhong Univ. of Science and Technology (China)
3 shared publications- Guan Xu
Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan China
2 shared publications - Peng Qin
Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan China
2 shared publications Shu Chen
School of EIC, Huazhong University of Science and Technology, China
2 shared publicationsBin Li
Huazhong Univ. of Science and Technology (China)
1 shared publication
Latest Publications
- 1 November 2016
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 31 (5) , 2565-2572
Inferring popular locations in urban for professional education
With the rapid development of urbane-centered economy, urban area has gone through strong but heterogeneous sprawl. In such complex urban systems, it is impossible to established teaching centers of night school in every district of city for continuing education programs. Part-time students tend to be educated in popular locations of city due to convenience. Since call logs and geographical nature of mobile phone data can provide an opportunity to measure human behavior and social dynamics, we investigate how to infer urban popular locations with large-scale quasi-social network for avoiding the limitation of data collection and even privacy problems. A large-scale quasi-social network model is developed via measuring the number of shared-user between zones, which is different from previous models for social network. We first verify whether or not this model also can show the social structure of given data, the ranking of places in the model have been calculated based on eigvalue metric. To understand the connections between popular locations of human activity and spatial structure, we present a method to infer the core zones in given region, and then we use a simple metric to evaluate the most popular locations of human activity.
- 1 November 2016
- Published by SAGE Publications in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
- Vol. 31 (5) , 2565-2572
Inferring popular locations in urban for professional education
With the rapid development of urbane-centered economy, urban area has gone through strong but heterogeneous sprawl. In such complex urban systems, it is impossible to established teaching centers of night school in every district of city for continuing education programs. Part-time students tend to be educated in popular locations of city due to convenience. Since call logs and geographical nature of mobile phone data can provide an opportunity to measure human behavior and social dynamics, we investigate how to infer urban popular locations with large-scale quasi-social network for avoiding the limitation of data collection and even privacy problems. A large-scale quasi-social network model is developed via measuring the number of shared-user between zones, which is different from previous models for social network. We first verify whether or not this model also can show the social structure of given data, the ranking of places in the model have been calculated based on eigvalue metric. To understand the connections between popular locations of human activity and spatial structure, we present a method to infer the core zones in given region, and then we use a simple metric to evaluate the most popular locations of human activity.
- 7 October 2016
- Published by SPIE-Intl Soc Optical Eng
- p. 990202-990202-7
Performance of DP-QDQ compared with DP-16QAM, DP-64QAM and DP-256QAM
- 7 October 2016
- Published by SPIE-Intl Soc Optical Eng
- p. 990202-990202-7
Performance of DP-QDQ compared with DP-16QAM, DP-64QAM and DP-256QAM
- 20 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 11 (4) , 2337-2344
Bandwidth-Aware Scheduling With SDN in Hadoop: A New Trend for Big Data
Software-defined networking (SDN) is a revolutionary network architecture that separates out network control functions from the underlying equipment and is an increasing trend to help enterprises build more manageable data centers where big data processing emerges as an important part of applications. To concurrently process large-scale data, MapReduce with an open-source implementation named Hadoop is proposed. In practical Hadoop systems, one kind of issue that vitally impacts the overall performance is known as the NP-complete minimum make span11Make span means the time between job’s start time and job’s finish time. problem. One main solution is to assign tasks on data local nodes to avoid link occupation since network bandwidth is a scarce resource. Many methodologies for enhancing data locality are proposed such as the Hadoop default scheduler (HDS) and state-of-the-art scheduler balance-reduce scheduler (BAR). However, all of them either ignore allocating tasks in a global view or disregard available bandwidth as the basis for scheduling. In this paper, we propose a heuristic bandwidth-aware task scheduler bandwidth-aware scheduling with SDN in Hadoop (BASS) to combine Hadoop with SDN. It is not only able to guarantee data locality in a global view but also can efficiently assign tasks in an optimized way. Both examples and experiments demonstrate that BASS has the best performance in terms of job completion time. To our knowledge, BASS is the first to exploit talent of SDN for job scheduling of big data processing and we believe that it points out a new trend for large-scale data processing.
- 20 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 11 (4) , 2337-2344
Bandwidth-Aware Scheduling With SDN in Hadoop: A New Trend for Big Data
Software-defined networking (SDN) is a revolutionary network architecture that separates out network control functions from the underlying equipment and is an increasing trend to help enterprises build more manageable data centers where big data processing emerges as an important part of applications. To concurrently process large-scale data, MapReduce with an open-source implementation named Hadoop is proposed. In practical Hadoop systems, one kind of issue that vitally impacts the overall performance is known as the NP-complete minimum make span11Make span means the time between job’s start time and job’s finish time. problem. One main solution is to assign tasks on data local nodes to avoid link occupation since network bandwidth is a scarce resource. Many methodologies for enhancing data locality are proposed such as the Hadoop default scheduler (HDS) and state-of-the-art scheduler balance-reduce scheduler (BAR). However, all of them either ignore allocating tasks in a global view or disregard available bandwidth as the basis for scheduling. In this paper, we propose a heuristic bandwidth-aware task scheduler bandwidth-aware scheduling with SDN in Hadoop (BASS) to combine Hadoop with SDN. It is not only able to guarantee data locality in a global view but also can efficiently assign tasks in an optimized way. Both examples and experiments demonstrate that BASS has the best performance in terms of job completion time. To our knowledge, BASS is the first to exploit talent of SDN for job scheduling of big data processing and we believe that it points out a new trend for large-scale data processing.
- Open Access
- 22 June 2015
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 10 (4) , 539-550
Understanding Social Characteristic from Spatial Proximity in Mobile Social Network
Over the past decades, cities as gathering places of millions of people rapidly evolved in all aspects of population, society, and environments. As one recent trend, location-based social networking applications on mobile devices are becoming increasingly popular. Such mobile devices also become data repositories of massive human activities. Compared with sensing applications in traditional sensor network, Social sensing application in mobile social network, as in which all individuals are regarded as numerous sensors, would result in the fusion of mobile, social and sensor data. In particular, it has been observed that the fusion of these data can be a very powerful tool for series mining purposes. A clear knowledge about the interaction between individual mobility and social networks is essential for improving the existing individual activity model in this paper. We first propose a new measurement called geographic community for clustering spatial proximity in mobile social networks. A novel approach for detecting these geographic communities in mobile social networks has been proposed. Through developing a spatial proximity matrix, an improved symmetric nonnegative matrix factorization method (SNMF) is used to detect geographic communities in mobile social networks. By a real dataset containing thousands of mobile phone users in a provincial capital of China, the correlation between geographic community and common social properties of users have been tested. While exploring shared individual movement patterns, we propose a hybrid approach that utilizes spatial proximity and social proximity of individuals for mining network structure in mobile social networks. Several experimental results have been shown to verify the feasibility of this proposed hybrid approach based on the MIT dataset.
- 22 June 2015
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 10 (4) , 539-550
Open AccessUnderstanding Social Characteristic from Spatial Proximity in Mobile Social Network
Over the past decades, cities as gathering places of millions of people rapidly evolved in all aspects of population, society, and environments. As one recent trend, location-based social networking applications on mobile devices are becoming increasingly popular. Such mobile devices also become data repositories of massive human activities. Compared with sensing applications in traditional sensor network, Social sensing application in mobile social network, as in which all individuals are regarded as numerous sensors, would result in the fusion of mobile, social and sensor data. In particular, it has been observed that the fusion of these data can be a very powerful tool for series mining purposes. A clear knowledge about the interaction between individual mobility and social networks is essential for improving the existing individual activity model in this paper. We first propose a new measurement called geographic community for clustering spatial proximity in mobile social networks. A novel approach for detecting these geographic communities in mobile social networks has been proposed. Through developing a spatial proximity matrix, an improved symmetric nonnegative matrix factorization method (SNMF) is used to detect geographic communities in mobile social networks. By a real dataset containing thousands of mobile phone users in a provincial capital of China, the correlation between geographic community and common social properties of users have been tested. While exploring shared individual movement patterns, we propose a hybrid approach that utilizes spatial proximity and social proximity of individuals for mining network structure in mobile social networks. Several experimental results have been shown to verify the feasibility of this proposed hybrid approach based on the MIT dataset.
- 17 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 22 (5) , 519-523
Channel Capacity Analysis of the Generalized Spread Spectrum Watermarking in Audio Signals
Spread spectrum is the modulation technique which is recently used to embed the watermark in audio signals. However, the channel capacity of the spread spectrum watermarking has not been investigated in detail. In this paper the channel capacity analysis of the generalized spread spectrum watermarking (GSSW) scheme is presented, the theoretical capacity expression of the binary watermark is derived, and an approximate expression for the demand of engineering application is also presented. The optimum parameter values for channel capacity are obtained, and it is concluded that the maximum capacity of the GSSW scheme is larger than that of the traditional spread spectrum scheme because the host signal information is used in the embedded procedures.
- 17 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 22 (5) , 519-523
Channel Capacity Analysis of the Generalized Spread Spectrum Watermarking in Audio Signals
Spread spectrum is the modulation technique which is recently used to embed the watermark in audio signals. However, the channel capacity of the spread spectrum watermarking has not been investigated in detail. In this paper the channel capacity analysis of the generalized spread spectrum watermarking (GSSW) scheme is presented, the theoretical capacity expression of the binary watermark is derived, and an approximate expression for the demand of engineering application is also presented. The optimum parameter values for channel capacity are obtained, and it is concluded that the maximum capacity of the GSSW scheme is larger than that of the traditional spread spectrum scheme because the host signal information is used in the embedded procedures.
- Open Access
A Survey on Network Tomography with Network Coding
The overhead of internal network monitoring motivates techniques of network tomography. Network coding (NC) presents a new opportunity for network tomography as NC introduces topology-dependent correlation that can be further exploited in topology estimation. Compared with traditional methods, network tomography with NC has many advantages such as the improvement of tomography accuracy and the reduction of complexity in choosing monitoring paths. In this paper we first introduce the problem of tomography with NC and then propose the taxonomy criteria to classify various methods. We also present existing solutions and future trend. We expect that our comprehensive review on network tomography with NC can serve as a good reference for researchers and practitioners working in the area.
Open AccessA Survey on Network Tomography with Network Coding
The overhead of internal network monitoring motivates techniques of network tomography. Network coding (NC) presents a new opportunity for network tomography as NC introduces topology-dependent correlation that can be further exploited in topology estimation. Compared with traditional methods, network tomography with NC has many advantages such as the improvement of tomography accuracy and the reduction of complexity in choosing monitoring paths. In this paper we first introduce the problem of tomography with NC and then propose the taxonomy criteria to classify various methods. We also present existing solutions and future trend. We expect that our comprehensive review on network tomography with NC can serve as a good reference for researchers and practitioners working in the area.
- Open Access
Bandwidth-Aware Scheduling with SDN in Hadoop: A New Trend for Big Data
Software Defined Networking (SDN) is a revolutionary network architecture that separates out network control functions from the underlying equipment and is an increasingly trend to help enterprises build more manageable data centers where big data processing emerges as an important part of applications. To concurrently process large-scale data, MapReduce with an open source implementation named Hadoop is proposed. In practical Hadoop systems one kind of issue that vitally impacts the overall performance is know as the NP-complete minimum make span problem. One main solution is to assign tasks on data local nodes to avoid link occupation since network bandwidth is a scarce resource. Many methodologies for enhancing data locality are proposed such as the HDS and state-of-the-art scheduler BAR. However, all of them either ignore allocating tasks in a global view or disregard available bandwidth as the basis for scheduling. In this paper we propose a heuristic bandwidth-aware task scheduler BASS to combine Hadoop with SDN. It is not only able to guarantee data locality in a global view but also can efficiently assign tasks in an optimized way. Both examples and experiments demonstrate that BASS has the best performance in terms of job completion time. To our knowledge, BASS is the first to exploit talent of SDN for big data processing and we believe it points out a new trend for large-scale data processing.
Open AccessBandwidth-Aware Scheduling with SDN in Hadoop: A New Trend for Big Data
Software Defined Networking (SDN) is a revolutionary network architecture that separates out network control functions from the underlying equipment and is an increasingly trend to help enterprises build more manageable data centers where big data processing emerges as an important part of applications. To concurrently process large-scale data, MapReduce with an open source implementation named Hadoop is proposed. In practical Hadoop systems one kind of issue that vitally impacts the overall performance is know as the NP-complete minimum make span problem. One main solution is to assign tasks on data local nodes to avoid link occupation since network bandwidth is a scarce resource. Many methodologies for enhancing data locality are proposed such as the HDS and state-of-the-art scheduler BAR. However, all of them either ignore allocating tasks in a global view or disregard available bandwidth as the basis for scheduling. In this paper we propose a heuristic bandwidth-aware task scheduler BASS to combine Hadoop with SDN. It is not only able to guarantee data locality in a global view but also can efficiently assign tasks in an optimized way. Both examples and experiments demonstrate that BASS has the best performance in terms of job completion time. To our knowledge, BASS is the first to exploit talent of SDN for big data processing and we believe it points out a new trend for large-scale data processing.
- 31 October 2013
- Published by Elsevier in Optical Fiber Technology
- Vol. 19 (5) , 400-404
Shaped offset quadrature phase shift keying (SOQPSK) modulation scheme and its application in optical wavelength-division multiplexed (DWDM) transmission
- 31 October 2013
- Published by Elsevier in Optical Fiber Technology
- Vol. 19 (5) , 400-404
Shaped offset quadrature phase shift keying (SOQPSK) modulation scheme and its application in optical wavelength-division multiplexed (DWDM) transmission
- 30 September 2011
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 64 (3) , 744-761
ADVS: a reputation-based model on filtering SPIT over P2P-VoIP networks
- 30 September 2011
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 64 (3) , 744-761
ADVS: a reputation-based model on filtering SPIT over P2P-VoIP networks
- 7 September 2009
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 28 (10) , 2529-2532
Scoring matching approach: Learning high order Markov random fields
- 7 September 2009
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 28 (10) , 2529-2532
Scoring matching approach: Learning high order Markov random fields