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.展开更多
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.展开更多
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.展开更多
Interest has recently emerged in potential applications of(n,2n)reactions of unstable nuclei.Challenges have arisen because of the scarcity of experimental cross-sectional data.This study aims to predict the(n,2n)reac...Interest has recently emerged in potential applications of(n,2n)reactions of unstable nuclei.Challenges have arisen because of the scarcity of experimental cross-sectional data.This study aims to predict the(n,2n)reaction cross-section of long-lived fission products based on a tensor model.This tensor model is an extension of the collaborative filtering algorithm used for nuclear data.It is based on tensor decomposition and completion to predict(n,2n)reaction cross-sections;the corresponding EXFOR data are applied as training data.The reliability of the proposed tensor model was validated by comparing the calculations with data from EXFOR and different databases.Predictions were made for long-lived fission products such as^(60)Co,^(79)Se,^(93)Zr,^(107)P,^(126)Sn,and^(137)Cs,which provide a predicted energy range to effectively transmute long-lived fission products into shorter-lived or less radioactive isotopes.This method could be a powerful tool for completing(n,2n)reaction cross-sectional data and shows the possibility of selective transmutation of nuclear waste.展开更多
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).展开更多
Since the inaugural international collaboration under the framework of the Collaboratory for the Study of Earthquake Predictability(CSEP)in 2007,numerous forecast models have been developed and operated for earthquake...Since the inaugural international collaboration under the framework of the Collaboratory for the Study of Earthquake Predictability(CSEP)in 2007,numerous forecast models have been developed and operated for earthquake forecasting experiments across CSEP testing centers(Schorlemmer et al.,2018).Over more than a decade,efforts to compare forecasts with observed earthquakes using numerous statistical test methods and insights into earthquake predictability,which have become a highlight of the CSEP platform.展开更多
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.展开更多
文摘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.
文摘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.
文摘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.
基金supported by the Key Laboratory of Nuclear Data foundation(No.JCKY2022201C157)。
文摘Interest has recently emerged in potential applications of(n,2n)reactions of unstable nuclei.Challenges have arisen because of the scarcity of experimental cross-sectional data.This study aims to predict the(n,2n)reaction cross-section of long-lived fission products based on a tensor model.This tensor model is an extension of the collaborative filtering algorithm used for nuclear data.It is based on tensor decomposition and completion to predict(n,2n)reaction cross-sections;the corresponding EXFOR data are applied as training data.The reliability of the proposed tensor model was validated by comparing the calculations with data from EXFOR and different databases.Predictions were made for long-lived fission products such as^(60)Co,^(79)Se,^(93)Zr,^(107)P,^(126)Sn,and^(137)Cs,which provide a predicted energy range to effectively transmute long-lived fission products into shorter-lived or less radioactive isotopes.This method could be a powerful tool for completing(n,2n)reaction cross-sectional data and shows the possibility of selective transmutation of nuclear waste.
文摘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).
基金granted by the National Natural Science Foundation of China(Grant No.42004038)Earthquake Tracking Orientation Tasks of CEA(Grant No.2024020104)+1 种基金the Special Fund of IEFCEA(Grant No.CEAIEF2022030206)the China Scholarship Council(CSC)exchange program(Grant No.202204190019)。
文摘Since the inaugural international collaboration under the framework of the Collaboratory for the Study of Earthquake Predictability(CSEP)in 2007,numerous forecast models have been developed and operated for earthquake forecasting experiments across CSEP testing centers(Schorlemmer et al.,2018).Over more than a decade,efforts to compare forecasts with observed earthquakes using numerous statistical test methods and insights into earthquake predictability,which have become a highlight of the CSEP platform.
基金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.
