We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the ...We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.展开更多
Mainstream line is significant for the Yellow River situation forecasting and flood control.An effective statistical feature extraction method is proposed in this paper.In this method, a between-class scattering matri...Mainstream line is significant for the Yellow River situation forecasting and flood control.An effective statistical feature extraction method is proposed in this paper.In this method, a between-class scattering matrix based projection algorithm is performed to maximize between-class differences, obtaining effective component for classification;then high-order statistics are utilized as the features to describe the mainstream line in the principal component obtained.Experiments are performed to verify the applicability of the algorithm.The results both on synthesized and real scenes indicate that this approach could extract the mainstream line of the Yellow River automatically, and has a high precision in mainstream line detection.展开更多
A multi-user view file system (MUVFS) and a security scheme are developed to improve the security of the united storage network (USN) that integrates a network attached storage (NAS) and a storage area network (SAN). ...A multi-user view file system (MUVFS) and a security scheme are developed to improve the security of the united storage network (USN) that integrates a network attached storage (NAS) and a storage area network (SAN). The MUVFS offers a storage volume view for each authorized user who can access only the data in his own storage volume, the security scheme enables all users to encrypt and decrypt the data of their own storage view at client-side, and the USN server needs only to check the users’ identities and the data’s integrity. Experiments were performed to compare the sequential read, write and read/write rates of NFS+MUVFS+secure_module with those of NFS. The results indicate that the security of the USN is improved greatly with little influence on the system performance when the MUVFS and the security scheme are integrated into it.展开更多
Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and co...Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.展开更多
基金Supported by the National Natural Science Foundation of China (Nos. 40406005,41076001,40440420596)
文摘We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.
基金supported by the Flood Control Foundation of Yellow River Conservancy Commissionthe 2007 Key Supporting Project on Undergraduate Graduation Thesis of North-western Polytechnical University.
文摘Mainstream line is significant for the Yellow River situation forecasting and flood control.An effective statistical feature extraction method is proposed in this paper.In this method, a between-class scattering matrix based projection algorithm is performed to maximize between-class differences, obtaining effective component for classification;then high-order statistics are utilized as the features to describe the mainstream line in the principal component obtained.Experiments are performed to verify the applicability of the algorithm.The results both on synthesized and real scenes indicate that this approach could extract the mainstream line of the Yellow River automatically, and has a high precision in mainstream line detection.
文摘A multi-user view file system (MUVFS) and a security scheme are developed to improve the security of the united storage network (USN) that integrates a network attached storage (NAS) and a storage area network (SAN). The MUVFS offers a storage volume view for each authorized user who can access only the data in his own storage volume, the security scheme enables all users to encrypt and decrypt the data of their own storage view at client-side, and the USN server needs only to check the users’ identities and the data’s integrity. Experiments were performed to compare the sequential read, write and read/write rates of NFS+MUVFS+secure_module with those of NFS. The results indicate that the security of the USN is improved greatly with little influence on the system performance when the MUVFS and the security scheme are integrated into it.
基金supported by the grants DMS 0405343 and DMR 0520425.
文摘Efficient data visualization techniques are critical for many scientific applications. Centroidal Voronoi tessellation(CVT) based algorithms offer a convenient vehicle for performing image analysis,segmentation and compression while allowing to optimize retained image quality with respect to a given metric.In experimental science with data counts following Poisson distributions,several CVT-based data tessellation algorithms have been recently developed.Although they surpass their predecessors in robustness and quality of reconstructed data,time consumption remains to be an issue due to heavy utilization of the slowly converging Lloyd iteration.This paper discusses one possible approach to accelerating data visualization algorithms.It relies on a multidimensional generalization of the optimization based multilevel algorithm for the numerical computation of the CVTs introduced in[1],where a rigorous proof of its uniform convergence has been presented in 1-dimensional setting.The multidimensional implementation employs barycentric coordinate based interpolation and maximal independent set coarsening procedures.It is shown that when coupled with bin accretion algorithm accounting for the discrete nature of the data,the algorithm outperforms Lloyd-based schemes and preserves uniform convergence with respect to the problem size.Although numerical demonstrations provided are limited to spectroscopy data analysis,the method has a context-independent setup and can potentially deliver significant speedup to other scientific and engineering applications.
