Guang-hua Song

Zhejiang University, Hang-hsien, Zhejiang Sheng, China

Are you Guang-hua Song?

Claim your profile

Publications (12)6.82 Total impact

  • Zhe-Ming Lu · Zhen Wu · Shi-Ze Guo · Zhe Chen · Guang-Hua Song
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, based on the phenomenon that individuals join into and jump from the organizations in the society, we propose a dynamic community model to construct social networks. Two parameters are adopted in our model, one is the communication rate Pa that denotes the connection strength in the organization and the other is the turnover rate Pb, that stands for the frequency of jumping among the organizations. Based on simulations, we analyze not only the degree distribution, the clustering coefficient, the average distance and the network diameter but also the group distribution which is closely related to their community structure. Moreover, we discover that the networks generated by the proposed model possess the small-world property and can well reproduce the networks of social contacts.
    No preview · Article · Aug 2014 · International Journal of Modern Physics C
  • Guang-Hua Song · Qing-Ge Ji · Zhe-Ming Lu · Zhi-Dan Fang · Zhen-Hua Xie
    [Show abstract] [Hide abstract]
    ABSTRACT: Online video nowadays has become one of the top activities for users and has become easy to access. In the meantime, how to manage such huge amount of video data and retrieve them efficiently has become a big issue. In this article, we propose a novel method for video abstraction based on fast clustering of the regions of interest (ROIs). Firstly, the key-frames in each shot are extracted using the average histogram algorithm. Secondly, the saliency and edge maps are generated from each key-frame. According to these two maps, the key points for the visual attention model can be determined. Meanwhile, in order to expand the regions surrounding the key points, several thresholds are calculated from the corresponding key-frame. Thirdly, based on the key points and thresholds, several regions of interest are expanded and thus the main content in each frame is obtained. Finally, the fast clustering method is performed on the key frames by utilizing their ROIs. The performance and effectiveness of the proposed video abstraction algorithm is demonstrated by several experimental results.
    No preview · Article · Aug 2014 · AEU - International Journal of Electronics and Communications
  • Source
    Bo Zhu · Li-jun Xie · Guang-hua Song · Yao Zheng
    [Show abstract] [Hide abstract]
    ABSTRACT: The focal problems of projection include out-of-focus projection images from the projector caused by incomplete mechanical focus and screen-door effects produced by projection pixilation. To eliminate these defects and enhance the imaging quality and clarity of projectors, a novel adaptive projection defocus algorithm is proposed based on multi-scale convolution kernel templates. This algorithm applies the improved Sobel-Tenengrad focus evaluation function to calculate the sharpness degree of intensity equalization and then constructs multi-scale defocus convolution kernels to remap and render the defocus projection image. The resulting projection defocus corrected images can eliminate out-of-focus effects and improve the sharpness of uncorrected images. Experiments show that the algorithm works quickly and robustly and that it not only effectively eliminates visual artifacts and can run on a self-designed smart projection system in real time but also significantly improves the resolution and clarity of the observer’s visual perception.
    Full-text · Article · Dec 2013 · Journal of Zhejiang University: Science C
  • Chong Li · Shi-Ze Guo · Zhe-Ming Lu · Yu-Long Qiao · Guang-Hua Song
    [Show abstract] [Hide abstract]
    ABSTRACT: Many centrality metrics have been proposed over the years to compute the centrality of nodes, which has been a key issue in complex network analysis. The most important node can be estimated through a variety of metrics, such as degree, closeness, eigenvector, betweenness, flow betweenness, cumulated nominations and subgraph. Simulated flow is a common method adopted by many centrality metrics, such as flow betweenness centrality, which assumes that the information spreads freely in the entire network. Generally speaking, the farther the information travels, the more times the information passes the geometric center. Thus, it is easy to determine which node is more likely to be the center of the geometry network. However, during information transmission, different nodes do not share the same vitality, and some nodes are more active than others. Therefore, the product of one node's degree and its clustering coefficient can be viewed as a good factor to show how active this node is. In this paper, a new centrality metric called vitality centrality is introduced, which is only based on this product and the simulated flow. Simulation experiments based on six test networks have been carried out to demonstrate the effectiveness of our new metric.
    No preview · Article · Jul 2013 · International Journal of Modern Physics C
  • Source
    Guang-Hua Song · Hua Meng
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper provides a comprehensive review on the research and development in multi-scale numerical modeling and simulation of PEM fuel cells. An overview of recent progress in PEM fuel cell modeling has been provided. Fundamental transport phenomena in PEM fuel cells and the corresponding mathematical formulation of macroscale models are analyzed. Various important issues in PEM fuel cell modeling and simulation are examined in detail, including fluid flow and species transport, electron and proton transport, heat transfer and thermal management, liquid water transport and water management, transient response behaviors, and cold-start processes. Key areas for further improvements have also been discussed.
    Full-text · Article · Jun 2013 · Acta Mechanica Sinica
  • Zi-Yi Wang · Shi-Ze Guo · Zhe-Ming Lu · Guang-Hua Song · Hui Li
    [Show abstract] [Hide abstract]
    ABSTRACT: Many deterministic small-world network models have been proposed so far, and they have been proven useful in describing some real-life networks which have fixed interconnections. Search efficiency is an important property to characterize small-world networks. This paper tries to clarify how the search procedure behaves when random walks are performed on small-world networks, including the classic WS small-world network and three deterministic small-world network models: the deterministic small-world network created by edge iterations, the tree-structured deterministic small-world network, and the small-world network derived from the deterministic uniform recursive tree. Detailed experiments are carried out to test the search efficiency of various small-world networks with regard to three different types of random walks. From the results, we conclude that the stochastic model outperforms the deterministic ones in terms of average search steps.
    No preview · Article · May 2013 · IEICE Transactions on Information and Systems
  • Source
    Guang-hua Song · Jun-na Chuai · Bo-wei Yang · Yao Zheng
    [Show abstract] [Hide abstract]
    ABSTRACT: On the basis of the Hadoop distributed file system (HDFS), this paper presents the design and implementation of QDFS, a distributed file storage service system that employs a backup policy based on recovery volumes and a quality-aware data distribution strategy. The experimental results show that QDFS increases the storage utilization ratio and improves the storage performance by being aware of the quality of service of the DataNodes. The improvements of QDFS compared with HDFS make the Hadoop distributed computing model more suitable to unstable wide area network environments. Keywords-hadoop; HDFS; cloud storage; redundant backup; quality-aware
    Full-text · Conference Paper · Jan 2011
  • Source
    Bo-wei Yang · Guang-hua Song · Yao Zheng
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose an incentive model based on information-hiding to encourage peers to vote for resources in peer-to-peer (P2P) networks. The following are key motives for our model: (1) Some trust and reputation systems have been deployed in modern P2P systems, but a lot of blank rating resources exist in these P2P systems; (2) E-commerce consumer-to-consumer (C2C) websites that adopt simple rating strategies are receiving accusations that false and useless ratings are flooded. We establish an information-hiding based RRR/RIR (resource reputation rating/reputation incentive rating) voting model, which awards or punishes voters according to their behaviors. The RRR generating algorithm and the RIR generating algorithm are presented in detail, and the information-hiding mechanism is given. Experimental results showed that the incentive RRR/RIR model can effectively encourage valid voting and prevent malicious or arbitrary voting in the P2P reputation system. Key wordsPeer-to-peer (P2P)–Information-hiding–Incentive–Blank voting–Reputation system
    Full-text · Article · Dec 2010 · Journal of Zhejiang University: Science C
  • Source
    Guang-hua Song · Ying-jie Xia · Yao Zheng · Xiao-yun Mao
    [Show abstract] [Hide abstract]
    ABSTRACT: A Peer-to-Peer(P2P) load balance model based on multi-layer Bayesian trust network was designed to deal with the load balance problems in the trust-based P2P network. Some load indexes and their relations were added to the model to predict the workload of the peers. Experiments were done for the presented model and the dynamic load model, respectively. The results show that, by exploiting the interactions history and the Bayesian prediction theories, the load balance model based on multi-layer Bayesian trust network influences the peer selection process and can effectively balance the load of the P2P network, thereafter improving the resource utilization ratio, the quality and reliability of the peers services.
    Full-text · Article · Sep 2010 · Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science Edition
  • Source
    Ying-jie Xia · Guang-hua Song · Ming-zhe Zhu · Yao Zheng
    [Show abstract] [Hide abstract]
    ABSTRACT: A trusted small world Peer-to-Peer (P2P) model with role and reputation based access control policies (SW-R2P) was designed to combine the network topology and trust evaluation in P2P network. The model utilizes the zero knowledge interactive proof (ZKIP) scheme to authenticate the group information between peers without transferring any related data. The group information is used to cluster the peers to construct a small world topology. The Bayesian trust network is involved into the SW-R2P model to evaluate the multi-faceted trust of the peer and the group, which supporting the action protocols of peers and the long links between groups. Simulation shows that the SW-R2P model performs much better than the Chord and R2P models in the resources lookup, clustering coefficient and peer reputation error. The SW-R2P model integrates the advantages of small world topology, ZKIP scheme and Bayesian trust network, therefore implements a trustworthy, secure and efficient P2P network.
    Full-text · Article · Jan 2010 · Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science Edition
  • Source
    Cui-ju Luan · Guang-hua Song · Yao Zheng · Ji-fa Zhang
    [Show abstract] [Hide abstract]
    ABSTRACT: Job management is a key issue in computational grids, and normally involves job definition, scheduling, executing and monitoring. However, job management in the existing grid middleware needs to be improved in terms of efficiency and flexibility. This paper addresses a flexible architecture for job management with detailed design and implementation. Frameworks for job scheduling and monitoring, as two important aspects, are also presented. The proposed job management has the advantages of reusability of job definition, flexible and automatic file operation, visual steering of file transfer and job execution, and adaptive application job scheduler. A job management wizard is designed to implement each step. Therefore, what the grid user needs to do is only to define the job by constructing necessary information at runtime. In addition, the job space is adopted to ensure the security of the job management. Experimental results showed that this approach is user-friendly and system efficient.
    Full-text · Article · Jan 2007 · Journal of Zhejiang University - Science A: Applied Physics & Engineering
  • Source
    Cui-ju Luan · Guang-hua Song · Yao Zheng
    [Show abstract] [Hide abstract]
    ABSTRACT: Selecting appropriate resources for running a job efficiently is one of the common objectives in a computational grid. Resource scheduling should consider the specific characteristics of the application, and decide the metrics to be used accordingly. This paper presents a distributed resource scheduling framework mainly consisting of a job scheduler and a local scheduler. In order to meet the requirements of different applications, we adopt HGSA, a Heuristic-based Greedy Scheduling Algorithm, to schedule jobs in the grid, where the heuristic knowledge is the metric weights of the computing resources and the metric workload impact factors. The metric weight is used to control the effect of the metric on the application. For different applications, only metric weights and the metric workload impact factors need to be changed, while the scheduling algorithm remains the same. Experimental results are presented to demonstrate the adaptability of the HGSA.
    Full-text · Article · Oct 2006 · Journal of Zhejiang University - Science A: Applied Physics & Engineering