In the rapidly evolving domain of quantum computing,Shor’s algorithm has emerged as a groundbreaking innovation with far-reaching implications for the field of cryptographic security.However,the efficacy of Shor’s a...In the rapidly evolving domain of quantum computing,Shor’s algorithm has emerged as a groundbreaking innovation with far-reaching implications for the field of cryptographic security.However,the efficacy of Shor’s algorithm hinges on the critical step of determining the period,a process that poses a substantial computational challenge.This article explores innovative quantum optimization solutions that aim to enhance the efficiency of Shor’s period finding algorithm.The article focuses on quantum development environments,such as Qiskit and Cirq.A detailed analysis is conducted on three notable tools:Qiskit Transpiler,BQSKit,and Mitiq.The performance of these tools is evaluated in terms of execution time,precision,resource utilization,the number of quantum gates,circuit synthesis optimization,error mitigation,and qubit fidelity.Through rigorous case studies,we highlight the strengths and limitations of these tools,shedding light on their potential impact on integer factorization and cybersecurity.Our findings underscore the importance of quantum optimization and lay the foundation for future developments in quantum algorithmic enhancements,particularly within the Qiskit and Cirq quantum development environments.展开更多
The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stre...The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stress spectrum model is crucial for further fatigue reliability analysis.This study investigates the performance of the REBMIX algorithm in modeling both univariate(stress range)and multivariate(stress range and mean stress)distributions of the rain-flowmatrix for a steel arch bridge,usingAkaike’s Information Criterion(AIC)as a performance metric.Four types of finitemixture distributions—Normal,Lognormal,Weibull,and Gamma—are employed tomodel the stress range.Additionally,mixed distributions,including Normal-Normal,Lognormal-Normal,Weibull-Normal,and Gamma-Normal,are utilized to model the joint distribution of stress range and mean stress.The REBMIX algorithm estimates the number of components,component weights,and component parameters for each candidate finite mixture distribution.The results demonstrate that the REBMIX algorithm-based mixture parameter estimation approach effectively identifies the optimal distribution based on AIC values.Furthermore,the algorithm exhibits superior computational efficiency compared to traditional methods,making it highly suitable for practical applications.展开更多
The modeling and optimization of wind farm layouts can effectively reduce the wake effect between turbine units,thereby enhancing the expected output power and avoiding negative influence.Traditional wind farm optimiz...The modeling and optimization of wind farm layouts can effectively reduce the wake effect between turbine units,thereby enhancing the expected output power and avoiding negative influence.Traditional wind farm optimization often uses idealized wake models,neglecting the influence of wind shear at different elevations,which leads to a lack of precision in estimating wake effects and fails to meet the accuracy and reliability requirements of practical engineering.To address this,we have constructed a three-dimensional 3D wind farm optimization model that incorporates elevation,utilizing a 3D wake model to better reflect real-world conditions.We aim to assess the optimization state of the algorithm and provide strong incentives at the right moments to ensure continuous evolution of the population.To this end,we propose an evolutionary adaptation degreeguided genetic algorithm based on power-law perturbation(PPGA)to adapt multidimensional conditions.We select the offshore wind power project in Nantong,Jiangsu,China,as a study example and compare PPGA with other well-performing algorithms under this practical project.Based on the actual wind condition data,the experimental results demonstrate that PPGA can effectively tackle this complex problem and achieve the best power efficiency.展开更多
To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M a...To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M algorithm for turbo equalization, which is a suboptimum version of the Lee algorithm. This algorithm is called soft output M algorithm (denoted as SO M algorithm), which applies the M strategy to both the forward recursion and the extended forward recursion of the Lee algorithm. Computer simulation results show that, by properly selecting and adjusting the breadth parameter and depth parameter during the iteration of turbo equalization, this algorithm can obtain good performance and complexity trade off.展开更多
Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be g...Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.展开更多
Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability...Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.展开更多
Computational fluid dynamics（CFD） can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to impro...Computational fluid dynamics（CFD） can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to improve such hydrodynamic performance. In this paper, a more convenient and effective approach is proposed by combined using of CFD, multi-objective genetic algorithm（MOGA） and artificial neural networks（ANN） for a double-channel pump＇s impeller, with maximum head and efficiency set as optimization objectives, four key geometrical parameters including inlet diameter, outlet diameter, exit width and midline wrap angle chosen as optimization parameters. Firstly, a multi-fidelity fitness assignment system in which fitness of impellers serving as training and comparison samples for ANN is evaluated by CFD, meanwhile fitness of impellers generated by MOGA is evaluated by ANN, is established and dramatically reduces the computational expense. Then, a modified MOGA optimization process, in which selection is performed independently in two sub-populations according to two optimization objectives, crossover and mutation is performed afterword in the merged population, is developed to ensure the global optimal solution to be found. Finally, Pareto optimal frontier is found after 500 steps of iterations, and two optimal design schemes are chosen according to the design requirements. The preliminary and optimal design schemes are compared, and the comparing results show that hydraulic performances of both pumps 1 and 2 are improved, with the head and efficiency of pump 1 increased by 5.7% and 5.2%, respectively in the design working conditions, meanwhile shaft power decreased in all working conditions, the head and efficiency of pump 2 increased by 11.7% and 5.9%, respectively while shaft power increased by 5.5%. Inner flow field analyses also show that the backflow phenomenon significantly diminishes at the entrance of the optimal impellers 1 and 2, both the area of vortex and intensity of vortex decreases in the whole flow channel. This paper provides a promising tool to solve the hydraulic optimization problem of pumps＇ impellers.展开更多
The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existi...The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existing model has two flaws:incompleteness of program refinement and inadequate automation of formal verification.This paper proposes an automatic algorithm programming model based on the improved Morgan’s refinement calculus.It extends the Morgan’s refinement calculus rules and designs the C++generation system for realizing the complete process of refinement.Meanwhile,the automation tools VCG(Verification Condition Generator)and Isabelle are used to improve the automation of formal verification.An example of a stock’s maximum income demonstrates the effectiveness of the proposed model.Furthermore,the proposed model has some relevance for automatic software generation.展开更多
The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error t...The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks.展开更多
In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid betwee...In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.展开更多
The discrete Fourier transform （DFT） is the base of modern signal processing. 1-dimensional fast Fourier transform （1D FFT） and 2D FFT have time complexity O（N log N） and O（N^2 log N） respectively. Since 1965,...The discrete Fourier transform （DFT） is the base of modern signal processing. 1-dimensional fast Fourier transform （1D FFT） and 2D FFT have time complexity O（N log N） and O（N^2 log N） respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover＇s iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT （1D QDFT） and two-dimensional quantum DFT （2D QDFT） are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, 1D and 2D QDFT have time complexity O（v/N） and O（N） respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.展开更多
In biology, signal transduction refers to a process by which a cell converts one kind of signal or stimulus into another. It involves ordered sequences of biochemical reactions inside the cell. These cascades of react...In biology, signal transduction refers to a process by which a cell converts one kind of signal or stimulus into another. It involves ordered sequences of biochemical reactions inside the cell. These cascades of reactions are carried out by enzymes and activated by second messengers. Signal transduction pathways are complex in nature. Each pathway is responsible for tuning one or more biological functions in the intracellular environment as well as more than one pathway interact among themselves to carry forward a single biological function. Such kind of behavior of these pathways makes understanding difficult. Hence, for the sake of simplicity, they need to be partitioned into smaller modules and then analyzed. We took VEGF signaling pathway, which is responsible for angiogenesis for this kind of modularized study. Modules were obtained by applying the algorithm of Nayak and De (Nayak and De, 2007) for different complexity values. These sets of modules were compared among themselves to get the best set of modules for an optimal complexity value. The best set of modules compared with four different partitioning algorithms namely, Farhat’s (Farhat, 1998), Greedy (Chartrand and Oellermann, 1993), Kernighan-Lin’s (Kernighan and Lin, 1970) and Newman’s community finding algorithm (Newman, 2006). These comparisons enabled us to decide which of the aforementioned algorithms was the best one to create partitions from human VEGF signaling pathway. The optimal complexity value, on which the best set of modules was obtained, was used to get modules from different species for comparative study. Comparison among these modules would shed light on the trend of development of VEGF signaling pathway over these species.展开更多
文摘In the rapidly evolving domain of quantum computing,Shor’s algorithm has emerged as a groundbreaking innovation with far-reaching implications for the field of cryptographic security.However,the efficacy of Shor’s algorithm hinges on the critical step of determining the period,a process that poses a substantial computational challenge.This article explores innovative quantum optimization solutions that aim to enhance the efficiency of Shor’s period finding algorithm.The article focuses on quantum development environments,such as Qiskit and Cirq.A detailed analysis is conducted on three notable tools:Qiskit Transpiler,BQSKit,and Mitiq.The performance of these tools is evaluated in terms of execution time,precision,resource utilization,the number of quantum gates,circuit synthesis optimization,error mitigation,and qubit fidelity.Through rigorous case studies,we highlight the strengths and limitations of these tools,shedding light on their potential impact on integer factorization and cybersecurity.Our findings underscore the importance of quantum optimization and lay the foundation for future developments in quantum algorithmic enhancements,particularly within the Qiskit and Cirq quantum development environments.
基金jointly supported by the Fundamental Research Funds for the Central Universities(Grant No.xzy012023075)the Zhejiang Engineering Research Center of Intelligent Urban Infrastructure(Grant No.IUI2023-YB-12).
文摘The computational accuracy and efficiency of modeling the stress spectrum derived from bridge monitoring data significantly influence the fatigue life assessment of steel bridges.Therefore,determining the optimal stress spectrum model is crucial for further fatigue reliability analysis.This study investigates the performance of the REBMIX algorithm in modeling both univariate(stress range)and multivariate(stress range and mean stress)distributions of the rain-flowmatrix for a steel arch bridge,usingAkaike’s Information Criterion(AIC)as a performance metric.Four types of finitemixture distributions—Normal,Lognormal,Weibull,and Gamma—are employed tomodel the stress range.Additionally,mixed distributions,including Normal-Normal,Lognormal-Normal,Weibull-Normal,and Gamma-Normal,are utilized to model the joint distribution of stress range and mean stress.The REBMIX algorithm estimates the number of components,component weights,and component parameters for each candidate finite mixture distribution.The results demonstrate that the REBMIX algorithm-based mixture parameter estimation approach effectively identifies the optimal distribution based on AIC values.Furthermore,the algorithm exhibits superior computational efficiency compared to traditional methods,making it highly suitable for practical applications.
基金partially supported by the Japan Society for the Promotion of Science(JSPS)KAKENHI(JP23K24899)Japan Science and Technology Agency(JST)Support for Pioneering Research Initiated by the Next Generation(SPRING)(JPMJSP2145).
文摘The modeling and optimization of wind farm layouts can effectively reduce the wake effect between turbine units,thereby enhancing the expected output power and avoiding negative influence.Traditional wind farm optimization often uses idealized wake models,neglecting the influence of wind shear at different elevations,which leads to a lack of precision in estimating wake effects and fails to meet the accuracy and reliability requirements of practical engineering.To address this,we have constructed a three-dimensional 3D wind farm optimization model that incorporates elevation,utilizing a 3D wake model to better reflect real-world conditions.We aim to assess the optimization state of the algorithm and provide strong incentives at the right moments to ensure continuous evolution of the population.To this end,we propose an evolutionary adaptation degreeguided genetic algorithm based on power-law perturbation(PPGA)to adapt multidimensional conditions.We select the offshore wind power project in Nantong,Jiangsu,China,as a study example and compare PPGA with other well-performing algorithms under this practical project.Based on the actual wind condition data,the experimental results demonstrate that PPGA can effectively tackle this complex problem and achieve the best power efficiency.
文摘To decrease the complexity of MAP algorithm, reduced state or reduced search techniques can be applied. In this paper we propose a reduced search soft output detection algorithm fully based on the principle of M algorithm for turbo equalization, which is a suboptimum version of the Lee algorithm. This algorithm is called soft output M algorithm (denoted as SO M algorithm), which applies the M strategy to both the forward recursion and the extended forward recursion of the Lee algorithm. Computer simulation results show that, by properly selecting and adjusting the breadth parameter and depth parameter during the iteration of turbo equalization, this algorithm can obtain good performance and complexity trade off.
基金State Natural Science Foundation (49874021).Contribution No. 01FE2002, Institute of Geophysics, China Seismological Bureau.
文摘Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.
文摘Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.
基金Supported by National Natural Science Foundation of China(Grant No.51109094)Priority Academic Program Development of Jiangsu Higher Education Institutions of China
文摘Computational fluid dynamics（CFD） can give a lot of potentially very useful information for hydraulic optimization design of pumps, however, it cannot directly state what kind of modification should be made to improve such hydrodynamic performance. In this paper, a more convenient and effective approach is proposed by combined using of CFD, multi-objective genetic algorithm（MOGA） and artificial neural networks（ANN） for a double-channel pump＇s impeller, with maximum head and efficiency set as optimization objectives, four key geometrical parameters including inlet diameter, outlet diameter, exit width and midline wrap angle chosen as optimization parameters. Firstly, a multi-fidelity fitness assignment system in which fitness of impellers serving as training and comparison samples for ANN is evaluated by CFD, meanwhile fitness of impellers generated by MOGA is evaluated by ANN, is established and dramatically reduces the computational expense. Then, a modified MOGA optimization process, in which selection is performed independently in two sub-populations according to two optimization objectives, crossover and mutation is performed afterword in the merged population, is developed to ensure the global optimal solution to be found. Finally, Pareto optimal frontier is found after 500 steps of iterations, and two optimal design schemes are chosen according to the design requirements. The preliminary and optimal design schemes are compared, and the comparing results show that hydraulic performances of both pumps 1 and 2 are improved, with the head and efficiency of pump 1 increased by 5.7% and 5.2%, respectively in the design working conditions, meanwhile shaft power decreased in all working conditions, the head and efficiency of pump 2 increased by 11.7% and 5.9%, respectively while shaft power increased by 5.5%. Inner flow field analyses also show that the backflow phenomenon significantly diminishes at the entrance of the optimal impellers 1 and 2, both the area of vortex and intensity of vortex decreases in the whole flow channel. This paper provides a promising tool to solve the hydraulic optimization problem of pumps＇ impellers.
基金Supported by the National Natural Science Foundation of China(61862033,61902162)Key Project of Science and Technology Research of Department of Education of Jiangxi Province(GJJ210307)Postgraduate Innovation Fund Project of Education Department of Jiangxi Province(YC2021-S306)。
文摘The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existing model has two flaws:incompleteness of program refinement and inadequate automation of formal verification.This paper proposes an automatic algorithm programming model based on the improved Morgan’s refinement calculus.It extends the Morgan’s refinement calculus rules and designs the C++generation system for realizing the complete process of refinement.Meanwhile,the automation tools VCG(Verification Condition Generator)and Isabelle are used to improve the automation of formal verification.An example of a stock’s maximum income demonstrates the effectiveness of the proposed model.Furthermore,the proposed model has some relevance for automatic software generation.
文摘The method of determining the structures and parameters of radial basis function neural networks(RBFNNs) using improved genetic algorithms is proposed. Akaike′s information criterion (AIC) with generalization error term is used as the best criterion of optimizing the structures and parameters of networks. It is shown from the simulation results that the method not only improves the approximation and generalization capability of RBFNNs ,but also obtain the optimal or suboptimal structures of networks.
文摘In this study,a novel hybrid Water Cycle Moth-Flame Optimization(WCMFO)algorithm is proposed for multilevel thresholding brain image segmentation in Magnetic Resonance(MR)image slices.WCMFO constitutes a hybrid between the two techniques,comprising the water cycle and moth-flame optimization algorithms.The optimal thresholds are obtained by maximizing the between class variance(Otsu’s function)of the image.To test the performance of threshold searching process,the proposed algorithm has been evaluated on standard benchmark of ten axial T2-weighted brain MR images for image segmentation.The experimental outcomes infer that it produces better optimal threshold values at a greater and quicker convergence rate.In contrast to other state-of-the-art methods,namely Adaptive Wind Driven Optimization(AWDO),Adaptive Bacterial Foraging(ABF)and Particle Swarm Optimization(PSO),the proposed algorithm has been found to be better at producing the best objective function,Peak Signal-to-Noise Ratio(PSNR),Standard Deviation(STD)and lower computational time values.Further,it was observed thatthe segmented image gives greater detail when the threshold level increases.Moreover,the statistical test result confirms that the best and mean values are almost zero and the average difference between best and mean value 1.86 is obtained through the 30 executions of the proposed algorithm.Thus,these images will lead to better segments of gray,white and cerebrospinal fluid that enable better clinical choices and diagnoses using a proposed algorithm.
基金supported by Sichuan Normal University,China (Grant No 06lk002)
文摘The discrete Fourier transform （DFT） is the base of modern signal processing. 1-dimensional fast Fourier transform （1D FFT） and 2D FFT have time complexity O（N log N） and O（N^2 log N） respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover＇s iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT （1D QDFT） and two-dimensional quantum DFT （2D QDFT） are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, 1D and 2D QDFT have time complexity O（v/N） and O（N） respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible.
文摘In biology, signal transduction refers to a process by which a cell converts one kind of signal or stimulus into another. It involves ordered sequences of biochemical reactions inside the cell. These cascades of reactions are carried out by enzymes and activated by second messengers. Signal transduction pathways are complex in nature. Each pathway is responsible for tuning one or more biological functions in the intracellular environment as well as more than one pathway interact among themselves to carry forward a single biological function. Such kind of behavior of these pathways makes understanding difficult. Hence, for the sake of simplicity, they need to be partitioned into smaller modules and then analyzed. We took VEGF signaling pathway, which is responsible for angiogenesis for this kind of modularized study. Modules were obtained by applying the algorithm of Nayak and De (Nayak and De, 2007) for different complexity values. These sets of modules were compared among themselves to get the best set of modules for an optimal complexity value. The best set of modules compared with four different partitioning algorithms namely, Farhat’s (Farhat, 1998), Greedy (Chartrand and Oellermann, 1993), Kernighan-Lin’s (Kernighan and Lin, 1970) and Newman’s community finding algorithm (Newman, 2006). These comparisons enabled us to decide which of the aforementioned algorithms was the best one to create partitions from human VEGF signaling pathway. The optimal complexity value, on which the best set of modules was obtained, was used to get modules from different species for comparative study. Comparison among these modules would shed light on the trend of development of VEGF signaling pathway over these species.
