Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that...Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches.展开更多
To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as cons...To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.展开更多
Early water breakthrough and a rapid increase in water cut are always observed in high- permeability completion intervals when perforations are uniformly distributed in the wellbore in heterogeneous reservoirs. Optimi...Early water breakthrough and a rapid increase in water cut are always observed in high- permeability completion intervals when perforations are uniformly distributed in the wellbore in heterogeneous reservoirs. Optimization of perforating parameters in partitioned sections in horizontal intervals helps homogenize the inflow from the reservoir and thus is critically important for enhanced oil recovery. This paper derives a coupled reservoir-wellbore flow model based on inflow controlling theory. Genetic algorithms are applied to solving the model as they excel in obtaining the global optimum of discrete functions. The optimized perforating strategy applies a low perforation density in high- permeability intervals and a high perforation density in low-permeability intervals. As a result, the inflow profile is homogenized and idealized.展开更多
The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search ...The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search capability of the core population,the sub-space method was used to generate uniformly distributed initial colony populations over the decision variable space. The core population was also dynamically divided,making simultaneous searching in several local spaces possible. The algorithm proposed in this paper was compared to the original one by searching for the optimum of a complicated multi-modal function. The results indicate that the solutions obtained by the modified algorithm are better than those of the original algorithm.展开更多
在学术和工程领域,如何在带宽严重受限的水声信道中获取具有一定可用性的彩色图像一直是一个备受关注的问题。文章提出了一种新的水下彩色图像传输方法,利用基于分级树集合分裂(Set Partitioning in Hierarchical Trees,SPIHT)算法的图...在学术和工程领域,如何在带宽严重受限的水声信道中获取具有一定可用性的彩色图像一直是一个备受关注的问题。文章提出了一种新的水下彩色图像传输方法,利用基于分级树集合分裂(Set Partitioning in Hierarchical Trees,SPIHT)算法的图像渐进传输和视觉显著性检测,在复杂多变、带宽严重受限的水声信道中获得可用性较好的水下彩色图像。该方法根据信噪比动态调整数据传输方案,并使用红色通道补偿来提高频域中显著性检测的准确性。然后使用SPIHT渐进传输图像,并在接收端通过导向滤波解决高降采样率引起的块效应,以获得高质量的水下图像。实验结果表明,所提出的方法在压缩水下彩色图像方面具有一定的适用性。展开更多
基金supported by the National Science Foundation for Distinguished Young Scholars of China(Grant Nos.61003082 and 60903059)the National Natural Science Foundation of China(Grant No.60873014)the Foundation for Innovative Research Groups of the National Natural Science Foundation of China(Grant No.60921062)
文摘Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom-up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top-down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches.
文摘To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.
基金supported by National Scientific Project(No. 2008ZX05024-03)
文摘Early water breakthrough and a rapid increase in water cut are always observed in high- permeability completion intervals when perforations are uniformly distributed in the wellbore in heterogeneous reservoirs. Optimization of perforating parameters in partitioned sections in horizontal intervals helps homogenize the inflow from the reservoir and thus is critically important for enhanced oil recovery. This paper derives a coupled reservoir-wellbore flow model based on inflow controlling theory. Genetic algorithms are applied to solving the model as they excel in obtaining the global optimum of discrete functions. The optimized perforating strategy applies a low perforation density in high- permeability intervals and a high perforation density in low-permeability intervals. As a result, the inflow profile is homogenized and idealized.
基金Project 60575046 supported by the National Natural Science Foundation of China
文摘The increasing overlap of core and colony populations during the anaphase of evolution may limit the performance of shifting balance genetic algorithms. To decrease such overlapping,so as to increase the local search capability of the core population,the sub-space method was used to generate uniformly distributed initial colony populations over the decision variable space. The core population was also dynamically divided,making simultaneous searching in several local spaces possible. The algorithm proposed in this paper was compared to the original one by searching for the optimum of a complicated multi-modal function. The results indicate that the solutions obtained by the modified algorithm are better than those of the original algorithm.
文摘在学术和工程领域,如何在带宽严重受限的水声信道中获取具有一定可用性的彩色图像一直是一个备受关注的问题。文章提出了一种新的水下彩色图像传输方法,利用基于分级树集合分裂(Set Partitioning in Hierarchical Trees,SPIHT)算法的图像渐进传输和视觉显著性检测,在复杂多变、带宽严重受限的水声信道中获得可用性较好的水下彩色图像。该方法根据信噪比动态调整数据传输方案,并使用红色通道补偿来提高频域中显著性检测的准确性。然后使用SPIHT渐进传输图像,并在接收端通过导向滤波解决高降采样率引起的块效应,以获得高质量的水下图像。实验结果表明,所提出的方法在压缩水下彩色图像方面具有一定的适用性。
