A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similar...A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.展开更多
We link nuclear force with gravity. We use statistical entropy to link fine-structure constant （ct） and cosmological constant, showing mystical number 137 （as reciprocal of increasing entropy of the universe） as n...We link nuclear force with gravity. We use statistical entropy to link fine-structure constant （ct） and cosmological constant, showing mystical number 137 （as reciprocal of increasing entropy of the universe） as negative entropy needed for life to exist. If our computational route applies to the physical universe, it should apply to life. Molecular biology is searching for the fundamental source of information that would link to the information in DNA.展开更多
AIM: To identify the prevalence of pre-S2 start codon mutations and to assess their association with liver disease progression. METHODS: The mutations were identified by direct sequencing from 73 asymptomatic carriers...AIM: To identify the prevalence of pre-S2 start codon mutations and to assess their association with liver disease progression. METHODS: The mutations were identified by direct sequencing from 73 asymptomatic carriers, 66 chronic hepatitis (CH), 66 liver cirrhosis (LC) and 63 hepatocellular carcinoma (HCC) patients. Statistical significances were determined using Fisher's exact test, χ 2 test, and t -test analyses whenever appropriate. Pre-S mutation as a risk factor for advanced liver disease was estimated by unconditional logistic regression model adjusted with age, sex, and hepatitis B e antigen (HBeAg). P < 0.05 was considered significant. RESULTS: Mutation of the hepatitis B virus (HBV) pre-S2 start codon was found in 59 samples from 268 subjects (22.0%), with higher prevalence in patients with cirrhosis 27/66 (40.9%) followed by HCC 18/63 (28.6%), chronic hepatitis 12/66 (18.2%) and asymptomatic carriers 2/73 (2.7%) (P < 0.001). Logistic regression analysis showed that pre-S2 start codon mutation was an independent factor for progressive liver disease. Other mutations, at T130, Q132, and A138, were also associated with LC and HCC, although this was not statistically significant when adjusted for age, sex, and HBeAg. The prevalence of pre-S2 start codon mutation was higher in HBV/B than in HBV/C (23.0% vs 19.1%), whilst the prevalence of T130, Q132, and A138 mutation was higher in HBV/C than in HBV/B. The prevalence of pre-S2 start codon mutation was higher in LC (38.9%) and HCC (40.0%) than CH (5.6%) in HBeAg(+) group, but it was similar between CH, LC and HCC in HBeAg(-) group. CONCLUSION: Pre-S2 start codon mutation was higher in Indonesian patients compared to other Asian countries, and its prevalence was associated with advanced liver disease, particularly in HBeAg(+) patients.展开更多
Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential co...Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols.展开更多
A class of multistage filters, namely, real narrowband bandpass filter （RNBPF） has been previously used for identification of protein coding regions. This filter passes the frequency component at 2π/3 along with it...A class of multistage filters, namely, real narrowband bandpass filter （RNBPF） has been previously used for identification of protein coding regions. This filter passes the frequency component at 2π/3 along with its conjugate. This conjugate frequency compo- nent may degrade the identification accuracy. To improve the identification accuracy, two types of multistage filters are proposed in this paper. A complex narrowband bandpass filter （CNBPF） is proposed for suppressing the conjugate frequency component which, in turn, reduces the background noise present in the deoxyribonucleic acid （DNA） spec- trum and improves identification accuracy. By cascading RNBPF with moving average filter （RNBPFMA）, another type of multistage filter is proposed. As moving average filter smooth out the rapid variations in the DNA spectrum, RNBPFMA improves the identification accuracy. The computational complexity of RNBPFMA is less than that of CNBPF. The RNBPF and proposed multistage filters are compared with previously reported short-time discrete Fourier transform （ST-DFT） method in terms of compu- tational complexity. It is found that multistage filters reduce the computational load to a greater extent compared to ST-DFT method. The identification accuracy of the proposed CNBPF and RNBPFMA methods is compared with existing anti-notch filter and RNBPF methods. The results show that proposed methods outperform existing methods in terms of identification accuracy for benchmark data sets.展开更多
文摘A new genetic algorithm for community detection in complex networks was proposed. It adopts matrix encoding that enables traditional crossover between individuals. Initial populations are generated using nodes similarity, which enhances the diversity of initial individuals while retaining an acceptable level of accuracy, and improves the efficiency of optimal solution search. Individual crossover is based on the quality of individuals' genes; all nodes unassigned to any community are grouped into a new community, while ambiguously placed nodes are assigned to the community to which most of their neighbors belong. Individual mutation, which splits a gene into two new genes or randomly fuses it into other genes, is non-uniform. The simplicity and effectiveness of the algorithm are revealed in experimental tests using artificial random networks and real networks. The accuracy of the algorithm is superior to that of some classic algorithms, and is comparable to that of some recent high-precision algorithms.
文摘We link nuclear force with gravity. We use statistical entropy to link fine-structure constant （ct） and cosmological constant, showing mystical number 137 （as reciprocal of increasing entropy of the universe） as negative entropy needed for life to exist. If our computational route applies to the physical universe, it should apply to life. Molecular biology is searching for the fundamental source of information that would link to the information in DNA.
基金Supported by MRIN Funding, Budget, No. cc041/2010
文摘AIM: To identify the prevalence of pre-S2 start codon mutations and to assess their association with liver disease progression. METHODS: The mutations were identified by direct sequencing from 73 asymptomatic carriers, 66 chronic hepatitis (CH), 66 liver cirrhosis (LC) and 63 hepatocellular carcinoma (HCC) patients. Statistical significances were determined using Fisher's exact test, χ 2 test, and t -test analyses whenever appropriate. Pre-S mutation as a risk factor for advanced liver disease was estimated by unconditional logistic regression model adjusted with age, sex, and hepatitis B e antigen (HBeAg). P < 0.05 was considered significant. RESULTS: Mutation of the hepatitis B virus (HBV) pre-S2 start codon was found in 59 samples from 268 subjects (22.0%), with higher prevalence in patients with cirrhosis 27/66 (40.9%) followed by HCC 18/63 (28.6%), chronic hepatitis 12/66 (18.2%) and asymptomatic carriers 2/73 (2.7%) (P < 0.001). Logistic regression analysis showed that pre-S2 start codon mutation was an independent factor for progressive liver disease. Other mutations, at T130, Q132, and A138, were also associated with LC and HCC, although this was not statistically significant when adjusted for age, sex, and HBeAg. The prevalence of pre-S2 start codon mutation was higher in HBV/B than in HBV/C (23.0% vs 19.1%), whilst the prevalence of T130, Q132, and A138 mutation was higher in HBV/C than in HBV/B. The prevalence of pre-S2 start codon mutation was higher in LC (38.9%) and HCC (40.0%) than CH (5.6%) in HBeAg(+) group, but it was similar between CH, LC and HCC in HBeAg(-) group. CONCLUSION: Pre-S2 start codon mutation was higher in Indonesian patients compared to other Asian countries, and its prevalence was associated with advanced liver disease, particularly in HBeAg(+) patients.
基金the National Natural Science Foundation of China (No. 60573031)the New Century Excellent Talent Program of Education Ministry of China(NCET-05-0398)
文摘Precise zero-knowledge was introduced by Micali and Pass in STOC'06.This notion captures the idea that the view of any verifier in interaction can be reconstructed in almost time.Pass also obtained a sequential composition lemma for precise zero-knowledge protocols.However,this lemma doesn't provide tight precisions for composed protocols.In this paper we further obtain a sequential composition lemma for a subclass of precise zero-knowledge protocols,which all satisfy a property:their simulators use the code of verifier in almost the black-box way.We call such subclass emulated black-box zero-knowledge protocols.Our lemma provides better precisions for sequential composition of such protocols.
文摘A class of multistage filters, namely, real narrowband bandpass filter （RNBPF） has been previously used for identification of protein coding regions. This filter passes the frequency component at 2π/3 along with its conjugate. This conjugate frequency compo- nent may degrade the identification accuracy. To improve the identification accuracy, two types of multistage filters are proposed in this paper. A complex narrowband bandpass filter （CNBPF） is proposed for suppressing the conjugate frequency component which, in turn, reduces the background noise present in the deoxyribonucleic acid （DNA） spec- trum and improves identification accuracy. By cascading RNBPF with moving average filter （RNBPFMA）, another type of multistage filter is proposed. As moving average filter smooth out the rapid variations in the DNA spectrum, RNBPFMA improves the identification accuracy. The computational complexity of RNBPFMA is less than that of CNBPF. The RNBPF and proposed multistage filters are compared with previously reported short-time discrete Fourier transform （ST-DFT） method in terms of compu- tational complexity. It is found that multistage filters reduce the computational load to a greater extent compared to ST-DFT method. The identification accuracy of the proposed CNBPF and RNBPFMA methods is compared with existing anti-notch filter and RNBPF methods. The results show that proposed methods outperform existing methods in terms of identification accuracy for benchmark data sets.
