Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN con...Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN controllers need to centralizedly perform a shortest-path query for every flow,usually on large-scale network. Unfortunately,one of the challenges is that current algorithms will become incalculable as the network size increases. Therefore, inspired by the compression graph in the field of compute visualization,we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the important graph properties used to calculate path is reserved. We implement a centralized version of our approach in SDN-enabled network,and the evaluations validate the improvement compared with the well-known algorithms.展开更多
Holistic twig query processing techniques based on region encoding have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. These algori...Holistic twig query processing techniques based on region encoding have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. These algorithms have to scan all the streams of tags in query patterns. However, useless path matches cannot be completely avoided. TJFast which is based on the labeling scheme of Extended Dewey has been proposed to avoid useless intermediate results, and it only needs to access the labels of the leaf query nodes. However, it don＇t concern about the characteristics of elements with the same parent, and it has to merge join all the intermediate results which are evaluated during the first phrase. We propose a new labeling scheme to compress the XML elements which have the same characteristic. Based on the compressed path-labeled streams, a new novel holistic twig query algorithm named CPJoin is designed. Finally, implementation results are provided to show that CPJoin has good performance on both real and synthetic data.展开更多
Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low ...Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low signal-to-noise ratios. To overcome these problems, two cooperative compressive spectrum sensing( CCSS) schemes are proposed for different scenarios( with and without channel state information). To strengthen collaboration among secondary users( SUs),cognitive central node( CCN) is provided to collect data from SUs. Thus,the proposed schemes can obtain spatial diversity gains and exploit joint sparse structure to improve the performance of spectrum sensing. Since the channel occupancy is sparse,we formulate the spectrum sensing problems into sparse vector recovery problems,and then present two CCSS algorithms based on path-wise coordinate optimization( PCO) and multi-task Bayesian compressive sensing( MT-BCS),respectively.Simulation results corroborate the effectiveness of the proposed methods in detecting the spectrum holes in underwater acoustic environment.展开更多
We have investigated the effects of compression and quantization on atomic distribution in ice Ic and in its compressed states at 77 K and 10 K, using the path integral molecular dynamics (PIMD) simulations over wide ...We have investigated the effects of compression and quantization on atomic distribution in ice Ic and in its compressed states at 77 K and 10 K, using the path integral molecular dynamics (PIMD) simulations over wide range of volume. It has been found that the high density amorphous ice (HDA) is attained by compression but volume range to retain ice structure is wider at 10 K than 77 K. We have discovered that quantum dispersion of atoms in ice Ic at 10 K induces non-zero probability that hydrogen-bonded H<sub>2</sub>O molecular molecules are oriented nonlinearly in the crystal structure, which was believed to contain exclusively linear orientation of hydrogen-bonded molecular pairs in this ice. It has been found that for HDA there is each non-zero probability of orientational disorder of hydrogen-bonded H<sub>2</sub>O pairs, of such uniform distribution of H atoms as observed in supercritical fluids in general, and of H atoms located at the O-O midpoint. The present PIMD simulations have revealed that these observed anomalous characteristics of atomic distribution in HDA are caused by both quantization of atoms and compression of the system.展开更多
基金supported by the National Natural Science Foundation of China(No.61521003)
文摘Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN controllers need to centralizedly perform a shortest-path query for every flow,usually on large-scale network. Unfortunately,one of the challenges is that current algorithms will become incalculable as the network size increases. Therefore, inspired by the compression graph in the field of compute visualization,we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the important graph properties used to calculate path is reserved. We implement a centralized version of our approach in SDN-enabled network,and the evaluations validate the improvement compared with the well-known algorithms.
基金Supported by the National Natural Science Foundation of China (60573089)the Teaching and Research Award Program for Out-standing Young Teachers in Post-Secondary Institutions by the Ministry of Education, China (706016)
文摘Holistic twig query processing techniques based on region encoding have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. These algorithms have to scan all the streams of tags in query patterns. However, useless path matches cannot be completely avoided. TJFast which is based on the labeling scheme of Extended Dewey has been proposed to avoid useless intermediate results, and it only needs to access the labels of the leaf query nodes. However, it don＇t concern about the characteristics of elements with the same parent, and it has to merge join all the intermediate results which are evaluated during the first phrase. We propose a new labeling scheme to compress the XML elements which have the same characteristic. Based on the compressed path-labeled streams, a new novel holistic twig query algorithm named CPJoin is designed. Finally, implementation results are provided to show that CPJoin has good performance on both real and synthetic data.
基金National Natural Science Foundations of China(Nos.60872073,51075068,60975017,61301219)Doctoral Fund of Ministry of Education,China(No.20110092130004)
文摘Because of the specific of underwater acoustic channel,spectrum sensing entails many difficulties in cognitive underwater acoustic communication( CUAC) networks, such as severe frequency-dependent attenuation and low signal-to-noise ratios. To overcome these problems, two cooperative compressive spectrum sensing( CCSS) schemes are proposed for different scenarios( with and without channel state information). To strengthen collaboration among secondary users( SUs),cognitive central node( CCN) is provided to collect data from SUs. Thus,the proposed schemes can obtain spatial diversity gains and exploit joint sparse structure to improve the performance of spectrum sensing. Since the channel occupancy is sparse,we formulate the spectrum sensing problems into sparse vector recovery problems,and then present two CCSS algorithms based on path-wise coordinate optimization( PCO) and multi-task Bayesian compressive sensing( MT-BCS),respectively.Simulation results corroborate the effectiveness of the proposed methods in detecting the spectrum holes in underwater acoustic environment.
文摘We have investigated the effects of compression and quantization on atomic distribution in ice Ic and in its compressed states at 77 K and 10 K, using the path integral molecular dynamics (PIMD) simulations over wide range of volume. It has been found that the high density amorphous ice (HDA) is attained by compression but volume range to retain ice structure is wider at 10 K than 77 K. We have discovered that quantum dispersion of atoms in ice Ic at 10 K induces non-zero probability that hydrogen-bonded H<sub>2</sub>O molecular molecules are oriented nonlinearly in the crystal structure, which was believed to contain exclusively linear orientation of hydrogen-bonded molecular pairs in this ice. It has been found that for HDA there is each non-zero probability of orientational disorder of hydrogen-bonded H<sub>2</sub>O pairs, of such uniform distribution of H atoms as observed in supercritical fluids in general, and of H atoms located at the O-O midpoint. The present PIMD simulations have revealed that these observed anomalous characteristics of atomic distribution in HDA are caused by both quantization of atoms and compression of the system.
