ORCID Profile
0000-0002-2416-4101
Current Organisations
Chongqing University
,
Huazhong University of Science and Technology
,
Queensland University of Technology
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: IEEE
Date: 2007
Publisher: Elsevier BV
Date: 2016
Publisher: ACM
Date: 25-06-2005
Publisher: ACM
Date: 05-01-0066
Publisher: Edith Cowan University
Date: 2010
Publisher: Elsevier BV
Date: 02-2017
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IEEE
Date: 06-2009
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2020
Publisher: Hindawi Limited
Date: 2006
DOI: 10.1002/INT.20120
Publisher: IEEE
Date: 07-0012
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE
Date: 10-2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2016
Publisher: IEEE
Date: 06-2012
Publisher: IEEE
Date: 2003
Publisher: IEEE
Date: 12-2016
Publisher: IEEE Comput. Soc
Date: 2001
Publisher: IEEE
Date: 06-2012
Publisher: Springer Berlin Heidelberg
Date: 2011
Publisher: IEEE
Date: 2004
Publisher: Springer International Publishing
Date: 2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2007
DOI: 10.1109/TSMCB.2006.883268
Abstract: Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-hard problem. In this paper, a memetic algorithm (MA) for a nonslicing and hard-module VLSI floorplanning problem is presented. This MA is a hybrid genetic algorithm that uses an effective genetic search method to explore the search space and an efficient local search method to exploit information in the search region. The exploration and exploitation are balanced by a novel bias search strategy. The MA has been implemented and tested on popular benchmark problems. Experimental results show that the MA can quickly produce optimal or nearly optimal solutions for all the tested benchmark problems.
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2015
Publisher: Springer International Publishing
Date: 2015
Publisher: Elsevier BV
Date: 06-2018
Publisher: MDPI AG
Date: 21-08-2021
DOI: 10.3390/BDCC5030038
Abstract: This paper identifies four common misconceptions about the scalability of volunteer computing on big data problems. The misconceptions are then clarified by analyzing the relationship between scalability and the impact factors including the problem size of big data, the heterogeneity and dynamics of volunteers, and the overlay structure. This paper proposes optimization strategies to find the optimal overlay for the given big data problem. This paper forms multiple overlays to optimize the performance of in idual steps in terms of MapReduce paradigm. The optimization is to achieve the maximum overall performance by using a minimum number of volunteers, not overusing resources. This paper has demonstrated that the simulations on the concerned factors can fast find the optimization points. This paper concludes that always welcoming more volunteers is an overuse of available resources because they do not always bring benefit to the overall performance. Finding optimal use of volunteers are possible for the given big data problems even on the dynamics and opportunism of volunteers.
Publisher: IEEE
Date: 05-2009
Publisher: IEEE
Date: 04-2010
Publisher: IEEE
Date: 04-2014
Publisher: IGI Global
Date: 2012
Abstract: Current research in secure messaging for Vehicular Ad hoc Networks (VANETs) focuses on employing a digital certificate-based Public Key Cryptosystem (PKC) to support security. However, the security overhead of such a scheme creates a transmission delay and introduces a time-consuming verification process to VANET communications. This paper proposes a non-certificate-based public key management for VANETs. A comprehensive evaluation of performance and scalability of the proposed public key management regime is presented, which is compared with a certificate-based PKC by employing a number of quantified analyses and simulations. In this paper, the authors demonstrate that the proposal can maintain security and assert that it can improve overall performance and scalability at a lower cost, compared with certificate-based PKC. The proposed scheme adds a new dimension to key management and verification services for VANETs.
Publisher: IEEE
Date: 07-2012
DOI: 10.1109/TASE.2012.10
Publisher: IEEE
Date: 12-2013
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: IEEE
Date: 07-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2015
Publisher: IEEE
Date: 12-2008
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Society for Modeling and Simulation International (SCS)
Date: 2016
Publisher: Elsevier BV
Date: 02-2011
Publisher: IEEE
Date: 10-2012
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: IEEE
Date: 2008
Publisher: IEEE
Date: 10-2014
Publisher: IEEE
Date: 06-2013
Publisher: IEEE
Date: 07-2014
Publisher: Hindawi Limited
Date: 18-09-2012
DOI: 10.1155/2012/905396
Abstract: Road traffic accidents can be reduced by providing early warning to drivers through wireless ad hoc networks. When a vehicle detects an event that may lead to an imminent accident, the vehicle disseminates emergency messages to alert other vehicles that may be endangered by the accident. In many existing broadcast-based dissemination schemes, emergency messages may be sent to a large number of vehicles in the area and can be propagated to only one direction. This paper presents a more efficient context-aware multicast protocol that disseminates messages only to endangered vehicles that may be affected by the emergency event. The endangered vehicles can be identified by calculating the interaction among vehicles based on their motion properties. To ensure fast delivery, the dissemination follows a routing path obtained by computing a minimum delay tree. The multicast protocol uses a generalized approach that can support any arbitrary road topology. The performance of the multicast protocol is compared with existing broadcast protocols by simulating chain collision accidents on a typical highway. Simulation results show that the multicast protocol outperforms the other protocols in terms of reliability, efficiency, and latency.
Publisher: IEEE
Date: 06-2012
Publisher: IEEE
Date: 12-2013
Publisher: IEEE
Date: 06-2014
Publisher: Springer Science and Business Media LLC
Date: 18-01-2015
Publisher: IEEE
Date: 12-2016
DOI: 10.1109/CIT.2016.99
Publisher: IEEE
Date: 07-2010
No related grants have been discovered for Maolin Tang.