The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes.It works well for crisp weights,but the problem arises when weights are vague and uncertain.Let us take an examp...The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes.It works well for crisp weights,but the problem arises when weights are vague and uncertain.Let us take an example of computer networks,where the chosen path might no longer be appropriate due to rapid changes in network conditions.The optimal path from among all possible courses is chosen in computer networks based on a variety of parameters.In this paper,we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair Shortest Path(APSP)in an uncertain situation of a network.In the proposed methodology,multiple criteria and theirmutual associationmay involve the selection of any suitable path between any two node points,and the values of these criteria may change due to an uncertain environment.We use trapezoidal picture fuzzy addition,score,and accuracy functions to find APSP.We compute the time complexity of this algorithm and contrast it with the traditional Floyd-Warshall algorithm and fuzzy Floyd-Warshall algorithm.展开更多
The standalone Global Positioning System (GPS) does not meet the higher accuracy requirements needed for approach and landing phase of an aircraft. To meet the Category-I Precision Approach (CAT-I PA) requirements of ...The standalone Global Positioning System (GPS) does not meet the higher accuracy requirements needed for approach and landing phase of an aircraft. To meet the Category-I Precision Approach (CAT-I PA) requirements of civil aviation, satellite based augmentation system (SBAS) has been planned by various countries including USA, Europe, Japan and India. The Indian SBAS is named as GPS Aided Geo Augmented Navigation (GAGAN). The GAGAN network consists of several dual frequency GPS receivers located at various airports around the Indian subcontinent. The ionospheric delay, which is a function of the total electron content (TEC), is one of the main sources of error affecting GPS/SBAS accuracy. A dual frequency GPS receiver can be used to estimate the TEC. However, line-of-sight TEC derived from dual frequency GPS data is corrupted by the instrumental biases of the GPS receiver and satellites. The estimation of receiver instrumental bias is particularly important for obtaining accurate estimates of ionospheric delay. In this paper, two prominent techniques based on Kalman filter and Self-Calibration Of pseudo Range Error (SCORE) algorithm are used for estimation of instrumental biases. The estimated instrumental bias and TEC results for the GPS Aided Geo Augmented Navigation (GAGAN) station at Hyderabad (78.47°E, 17.45°N), India are presented.展开更多
Quality of experience （ QoE ） based scheduling algorithm of long term evalution （ LTE ） network with various traffics is studied. Utility functions are adopted to estimate mean opinion score （MOS） for different ...Quality of experience （ QoE ） based scheduling algorithm of long term evalution （ LTE ） network with various traffics is studied. Utility functions are adopted to estimate mean opinion score （MOS） for different traffics and a new MOS metric called normalized MOS is defined. A scheduling algorithm based on normalized MOS and greedy algorithm is proposed, aiming at maximizing the entirety MOS level of the whole users in the cell. We compare the performance of the proposed algorithm with other typical scheduling algorithms and the simulation results show that the algorithm pro- posed outperform other ones in term of QoE and fairness.展开更多
Based on the research of predictingβ-hairpin motifs in proteins, we apply Random Forest and Support Vector Machine algorithm to predictβ-hairpin motifs in ArchDB40 dataset. The motifs with the loop length of 2 to 8 ...Based on the research of predictingβ-hairpin motifs in proteins, we apply Random Forest and Support Vector Machine algorithm to predictβ-hairpin motifs in ArchDB40 dataset. The motifs with the loop length of 2 to 8 amino acid residues are extracted as research object and thefixed-length pattern of 12 amino acids are selected. When using the same characteristic parameters and the same test method, Random Forest algorithm is more effective than Support Vector Machine. In addition, because of Random Forest algorithm doesn’t produce overfitting phenomenon while the dimension of characteristic parameters is higher, we use Random Forest based on higher dimension characteristic parameters to predictβ-hairpin motifs. The better prediction results are obtained;the overall accuracy and Matthew’s correlation coefficient of 5-fold cross-validation achieve 83.3% and 0.59, respectively.展开更多
The structure and function of proteins are closely related, and protein structure decides its function, therefore protein structure prediction is quite important.β-turns are important components of protein secondary ...The structure and function of proteins are closely related, and protein structure decides its function, therefore protein structure prediction is quite important.β-turns are important components of protein secondary structure. So development of an accurate prediction method ofβ-turn types is very necessary. In this paper, we used the composite vector with position conservation scoring function, increment of diversity and predictive secondary structure information as the input parameter of support vector machine algorithm for predicting theβ-turn types in the database of 426 protein chains, obtained the overall prediction accuracy of 95.6%, 97.8%, 97.0%, 98.9%, 99.2%, 91.8%, 99.4% and 83.9% with the Matthews Correlation Coefficient values of 0.74, 0.68, 0.20, 0.49, 0.23, 0.47, 0.49 and 0.53 for types I, II, VIII, I’, II’, IV, VI and nonturn respectively, which is better than other prediction.展开更多
The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to alig...The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.展开更多
基金extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through General Research Project under Grant No.(R.G.P.2/48/43).
文摘The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes.It works well for crisp weights,but the problem arises when weights are vague and uncertain.Let us take an example of computer networks,where the chosen path might no longer be appropriate due to rapid changes in network conditions.The optimal path from among all possible courses is chosen in computer networks based on a variety of parameters.In this paper,we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair Shortest Path(APSP)in an uncertain situation of a network.In the proposed methodology,multiple criteria and theirmutual associationmay involve the selection of any suitable path between any two node points,and the values of these criteria may change due to an uncertain environment.We use trapezoidal picture fuzzy addition,score,and accuracy functions to find APSP.We compute the time complexity of this algorithm and contrast it with the traditional Floyd-Warshall algorithm and fuzzy Floyd-Warshall algorithm.
文摘The standalone Global Positioning System (GPS) does not meet the higher accuracy requirements needed for approach and landing phase of an aircraft. To meet the Category-I Precision Approach (CAT-I PA) requirements of civil aviation, satellite based augmentation system (SBAS) has been planned by various countries including USA, Europe, Japan and India. The Indian SBAS is named as GPS Aided Geo Augmented Navigation (GAGAN). The GAGAN network consists of several dual frequency GPS receivers located at various airports around the Indian subcontinent. The ionospheric delay, which is a function of the total electron content (TEC), is one of the main sources of error affecting GPS/SBAS accuracy. A dual frequency GPS receiver can be used to estimate the TEC. However, line-of-sight TEC derived from dual frequency GPS data is corrupted by the instrumental biases of the GPS receiver and satellites. The estimation of receiver instrumental bias is particularly important for obtaining accurate estimates of ionospheric delay. In this paper, two prominent techniques based on Kalman filter and Self-Calibration Of pseudo Range Error (SCORE) algorithm are used for estimation of instrumental biases. The estimated instrumental bias and TEC results for the GPS Aided Geo Augmented Navigation (GAGAN) station at Hyderabad (78.47°E, 17.45°N), India are presented.
基金Supported by China National S&T Major Project(2013ZX03003002-003)Beijing Natural Science Foundation(4152047)National High Technology Research and Development Program of China(863Program)(2014AA01A701)
文摘Quality of experience （ QoE ） based scheduling algorithm of long term evalution （ LTE ） network with various traffics is studied. Utility functions are adopted to estimate mean opinion score （MOS） for different traffics and a new MOS metric called normalized MOS is defined. A scheduling algorithm based on normalized MOS and greedy algorithm is proposed, aiming at maximizing the entirety MOS level of the whole users in the cell. We compare the performance of the proposed algorithm with other typical scheduling algorithms and the simulation results show that the algorithm pro- posed outperform other ones in term of QoE and fairness.
文摘Based on the research of predictingβ-hairpin motifs in proteins, we apply Random Forest and Support Vector Machine algorithm to predictβ-hairpin motifs in ArchDB40 dataset. The motifs with the loop length of 2 to 8 amino acid residues are extracted as research object and thefixed-length pattern of 12 amino acids are selected. When using the same characteristic parameters and the same test method, Random Forest algorithm is more effective than Support Vector Machine. In addition, because of Random Forest algorithm doesn’t produce overfitting phenomenon while the dimension of characteristic parameters is higher, we use Random Forest based on higher dimension characteristic parameters to predictβ-hairpin motifs. The better prediction results are obtained;the overall accuracy and Matthew’s correlation coefficient of 5-fold cross-validation achieve 83.3% and 0.59, respectively.
文摘The structure and function of proteins are closely related, and protein structure decides its function, therefore protein structure prediction is quite important.β-turns are important components of protein secondary structure. So development of an accurate prediction method ofβ-turn types is very necessary. In this paper, we used the composite vector with position conservation scoring function, increment of diversity and predictive secondary structure information as the input parameter of support vector machine algorithm for predicting theβ-turn types in the database of 426 protein chains, obtained the overall prediction accuracy of 95.6%, 97.8%, 97.0%, 98.9%, 99.2%, 91.8%, 99.4% and 83.9% with the Matthews Correlation Coefficient values of 0.74, 0.68, 0.20, 0.49, 0.23, 0.47, 0.49 and 0.53 for types I, II, VIII, I’, II’, IV, VI and nonturn respectively, which is better than other prediction.
文摘The increasing amount of sequences stored in genomic databases has become unfeasible to the sequential analysis. Then, the parallel computing brought its power to the Bioinformatics through parallel algorithms to align and analyze the sequences, providing improvements mainly in the running time of these algorithms. In many situations, the parallel strategy contributes to reducing the computational complexity of the big problems. This work shows some results obtained by an implementation of a parallel score estimating technique for the score matrix calculation stage, which is the first stage of a progressive multiple sequence alignment. The performance and quality of the parallel score estimating are compared with the results of a dynamic programming approach also implemented in parallel. This comparison shows a significant reduction of running time. Moreover, the quality of the final alignment, using the new strategy, is analyzed and compared with the quality of the approach with dynamic programming.
