A switch from avian-typeα-2,3 to human-typeα-2,6 receptors is an essential element for the initiation of a pandemic from an avian influenza virus.Some H9N2 viruses exhibit a preference for binding to human-typeα-2,...A switch from avian-typeα-2,3 to human-typeα-2,6 receptors is an essential element for the initiation of a pandemic from an avian influenza virus.Some H9N2 viruses exhibit a preference for binding to human-typeα-2,6 receptors.This identifies their potential threat to public health.However,our understanding of the molecular basis for the switch of receptor preference is still limited.In this study,we employed the random forest algorithm to identify the potentially key amino acid sites within hemagglutinin(HA),which are associated with the receptor binding ability of H9N2 avian influenza virus(AIV).Subsequently,these sites were further verified by receptor binding assays.A total of 12 substitutions in the HA protein(N158D,N158S,A160 N,A160D,A160T,T163I,T163V,V190T,V190A,D193 N,D193G,and N231D)were predicted to prefer binding toα-2,6 receptors.Except for the V190T substitution,the other substitutions were demonstrated to display an affinity for preferential binding toα-2,6 receptors by receptor binding assays.Especially,the A160T substitution caused a significant upregulation of immune-response genes and an increased mortality rate in mice.Our findings provide novel insights into understanding the genetic basis of receptor preference of the H9N2 AIV.展开更多
In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed ...In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.展开更多
Urban water consumption has some characteristics of grey because it is influenced by economy, population, standard of living and so on. The multi-variable grey model (MGM(1,n)), as the expansion and complement of GM(1...Urban water consumption has some characteristics of grey because it is influenced by economy, population, standard of living and so on. The multi-variable grey model (MGM(1,n)), as the expansion and complement of GM(1,1) model, reveals the relationship between restriction and stimulation among variables, and the genetic algorithm has the whole optimal and parallel characteristics. In this paper, the parameter q of MGM(1,n) model was optimized, and a multi-variable grey model (MGM(1,n,q)) was built by using the genetic algorithm. The model was validated by examining the urban water consumption from 1990 to 2003 in Dalian City. The result indicated that the multi-variable grey model (MGM(1,n,q)) based on genetic algorithm was better than MGM(1,n) model, and the MGM(1,n) model was better than MGM(1,1) model.展开更多
In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model ...In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model which performs control.As a frst step,the main geometric and mathematical tools used in subspace identifcation are briefly presented.In the second step,the problem of analyzing ill-conditioning matrices in the subspace identifcation method is considered.To illustrate this situation,a simulation study of an example is introduced to show the ill-conditioning in subspace identifcation.Algorithms numerical subspace state space system identifcation(N4SID)and multivariable output error state space model identifcation(MOESP)are considered to study,the parameters estimation while using the induction motor model,in simulation(Matlab environment).Finally,we show the inadequacy of the oblique projection and validate the efectiveness of the orthogonal projection approach which is needed in ill-conditioning;a real application dealing with induction motor parameters estimation has been experimented.The obtained results proved that the algorithm based on orthogonal projection MOESP,overcomes the situation of ill-conditioning in the Hankel s block,and thereby improving the estimation of parameters.展开更多
This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. Th...This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. The proposed scheme enhances the compression ratio of the ACW（n） algorithm by dividing the binary sequence into a number of subsequences （s）, each of them satisfying the condition that the number of decimal values （d） of the n-bit length characters is equal to or less than 256. Therefore, the new scheme is referred to as ACW（n, s）, where n is the adaptive character wordlength and s is the number of subsequences. The new scheme was used to compress a number of text files from standard corpora. The obtained results demonstrate that the ACW（n, s） scheme achieves higher compression ratio than many widely used compression algorithms and it achieves a competitive performance compared to state-of-the-art compression tools.展开更多
The paper is focused on available server management in Internet connected network environments. The local backup servers are hooked up by LAN and replace broken main server immediately and several different types of b...The paper is focused on available server management in Internet connected network environments. The local backup servers are hooked up by LAN and replace broken main server immediately and several different types of backup servers are also considered. The remote backup servers are hooked up by VPN (Virtual Private Network) with high-speed optical network. A Virtual Private Network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The remote backup servers also replace broken main severs immediately under the different conditions with local backups. When the system performs a mandatory routine maintenance of main and local backup servers, auxiliary servers from other location are being used for backups during idle periods. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems. The operational workflow give the guidelines for the actual implementations.展开更多
This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study ...This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.展开更多
The linear consecutive-k-out-of-n:failure(good)(Lin/Con/k/n:F(G))system consists of n interchangeable components that have different reliabilities.These components are arranged in a line path and different component a...The linear consecutive-k-out-of-n:failure(good)(Lin/Con/k/n:F(G))system consists of n interchangeable components that have different reliabilities.These components are arranged in a line path and different component assignments change the system reliability.The optimization of Lin/Con/k/n:F(G)system is to find an optimal component assignment to maximize the system reliability.As the number of components increases,the computation time for this problem increases considerably.In this paper,we propose a Birnbaum importance-based ant colony optimization(BIACO)algorithm to obtain quasi optimal assignments for such problems.We compare its performance using the Birnbaum importance based two-stage approach(BITA)and Birnbaum importancebased genetic local search(BIGLS)algorithm from previous researches.The experimental results show that the BIACO algorithm has a good performance in the optimization of Lin/Con/k/n:F(G)system.展开更多
Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connecte...Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).展开更多
In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a co...In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.展开更多
基金supported by the National Natural Science Foundation of China(32273037 and 32102636)the Guangdong Major Project of Basic and Applied Basic Research(2020B0301030007)+4 种基金Laboratory of Lingnan Modern Agriculture Project(NT2021007)the Guangdong Science and Technology Innovation Leading Talent Program(2019TX05N098)the 111 Center(D20008)the double first-class discipline promotion project(2023B10564003)the Department of Education of Guangdong Province(2019KZDXM004 and 2019KCXTD001).
文摘A switch from avian-typeα-2,3 to human-typeα-2,6 receptors is an essential element for the initiation of a pandemic from an avian influenza virus.Some H9N2 viruses exhibit a preference for binding to human-typeα-2,6 receptors.This identifies their potential threat to public health.However,our understanding of the molecular basis for the switch of receptor preference is still limited.In this study,we employed the random forest algorithm to identify the potentially key amino acid sites within hemagglutinin(HA),which are associated with the receptor binding ability of H9N2 avian influenza virus(AIV).Subsequently,these sites were further verified by receptor binding assays.A total of 12 substitutions in the HA protein(N158D,N158S,A160 N,A160D,A160T,T163I,T163V,V190T,V190A,D193 N,D193G,and N231D)were predicted to prefer binding toα-2,6 receptors.Except for the V190T substitution,the other substitutions were demonstrated to display an affinity for preferential binding toα-2,6 receptors by receptor binding assays.Especially,the A160T substitution caused a significant upregulation of immune-response genes and an increased mortality rate in mice.Our findings provide novel insights into understanding the genetic basis of receptor preference of the H9N2 AIV.
基金Supported by the National Natural Science Foundation of China(61271398)the Natural Science Foundation of Ningbo(2012A610031)
文摘In this paper, an approximate analytical algorithm in the form of direct Fourier reconstruction is obtained for the recon- struction of data functions arisen from ^-scheme short-scan sin- gle-photon emission computed tomography（SPECT） with uniform attenuation, and the modified central slice theorem is developed. Numerical simulations are conducted to demonstrate the effec- tiveness of the developed method.
文摘Urban water consumption has some characteristics of grey because it is influenced by economy, population, standard of living and so on. The multi-variable grey model (MGM(1,n)), as the expansion and complement of GM(1,1) model, reveals the relationship between restriction and stimulation among variables, and the genetic algorithm has the whole optimal and parallel characteristics. In this paper, the parameter q of MGM(1,n) model was optimized, and a multi-variable grey model (MGM(1,n,q)) was built by using the genetic algorithm. The model was validated by examining the urban water consumption from 1990 to 2003 in Dalian City. The result indicated that the multi-variable grey model (MGM(1,n,q)) based on genetic algorithm was better than MGM(1,n) model, and the MGM(1,n) model was better than MGM(1,1) model.
基金supported by the Ministry of Higher Education and Scientific Research of Tunisia
文摘In this paper,an analysis for ill conditioning problem in subspace identifcation method is provided.The subspace identifcation technique presents a satisfactory robustness in the parameter estimation of process model which performs control.As a frst step,the main geometric and mathematical tools used in subspace identifcation are briefly presented.In the second step,the problem of analyzing ill-conditioning matrices in the subspace identifcation method is considered.To illustrate this situation,a simulation study of an example is introduced to show the ill-conditioning in subspace identifcation.Algorithms numerical subspace state space system identifcation(N4SID)and multivariable output error state space model identifcation(MOESP)are considered to study,the parameters estimation while using the induction motor model,in simulation(Matlab environment).Finally,we show the inadequacy of the oblique projection and validate the efectiveness of the orthogonal projection approach which is needed in ill-conditioning;a real application dealing with induction motor parameters estimation has been experimented.The obtained results proved that the algorithm based on orthogonal projection MOESP,overcomes the situation of ill-conditioning in the Hankel s block,and thereby improving the estimation of parameters.
文摘This paper presents a description and performance evaluation of a new bit-level, lossless, adaptive, and asymmetric data compression scheme that is based on the adaptive character wordlength （ACW（n）） algorithm. The proposed scheme enhances the compression ratio of the ACW（n） algorithm by dividing the binary sequence into a number of subsequences （s）, each of them satisfying the condition that the number of decimal values （d） of the n-bit length characters is equal to or less than 256. Therefore, the new scheme is referred to as ACW（n, s）, where n is the adaptive character wordlength and s is the number of subsequences. The new scheme was used to compress a number of text files from standard corpora. The obtained results demonstrate that the ACW（n, s） scheme achieves higher compression ratio than many widely used compression algorithms and it achieves a competitive performance compared to state-of-the-art compression tools.
文摘The paper is focused on available server management in Internet connected network environments. The local backup servers are hooked up by LAN and replace broken main server immediately and several different types of backup servers are also considered. The remote backup servers are hooked up by VPN (Virtual Private Network) with high-speed optical network. A Virtual Private Network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The remote backup servers also replace broken main severs immediately under the different conditions with local backups. When the system performs a mandatory routine maintenance of main and local backup servers, auxiliary servers from other location are being used for backups during idle periods. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems. The operational workflow give the guidelines for the actual implementations.
文摘This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.
基金the National Natural Science Foundation of China(Nos.71871181 and 71471147)the Overseas Expertise Introduction Project for Discipline Innovation(No.B13044)the Top International University Visiting Program for Outstanding Young Scholars of Northwestern Polytechnical University(No.201806295008)。
文摘The linear consecutive-k-out-of-n:failure(good)(Lin/Con/k/n:F(G))system consists of n interchangeable components that have different reliabilities.These components are arranged in a line path and different component assignments change the system reliability.The optimization of Lin/Con/k/n:F(G)system is to find an optimal component assignment to maximize the system reliability.As the number of components increases,the computation time for this problem increases considerably.In this paper,we propose a Birnbaum importance-based ant colony optimization(BIACO)algorithm to obtain quasi optimal assignments for such problems.We compare its performance using the Birnbaum importance based two-stage approach(BITA)and Birnbaum importancebased genetic local search(BIGLS)algorithm from previous researches.The experimental results show that the BIACO algorithm has a good performance in the optimization of Lin/Con/k/n:F(G)system.
文摘Let A be m by n matrix, M and N be positive definite matrices of order in and n respectively. This paper presents an efficient method for computing (M-N) singular value decomposition((M-N) SVD) of A on a cube connected single instruction stream-multiple data stream(SIMD) parallel computer. This method is based on a one-sided orthogonalization algorithm due to Hestenes. On the cube connected SIMD parallel computer with o(n) processors, the (M -- N) SVD of a matrix A requires a computation time of o(m3 log m/n).
基金supported by the National Natural Science Foundation of China(6140224161572260+3 种基金613730176157226161472192)the Scientific&Technological Support Project of Jiangsu Province(BE2015702)
文摘In the open network environment, malicious attacks to the trust model have become increasingly serious. Compared with single node attacks, collusion attacks do more harm to the trust model. To solve this problem, a collusion detector based on the GN algorithm for the trust evaluation model is proposed in the open Internet environment. By analyzing the behavioral characteristics of collusion groups, the concept of flatting is defined and the G-N community mining algorithm is used to divide suspicious communities. On this basis, a collusion community detector method is proposed based on the breaking strength of suspicious communities. Simulation results show that the model has high recognition accuracy in identifying collusion nodes, so as to effectively defend against malicious attacks of collusion nodes.
