After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algo...After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.展开更多
Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded...Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. This algorithm, called totally coded method (TCM), consists of representing the symbolic determinant of a circuit matrix by code series and performing symbolic analysis by code manipulation. We describe an efficient code-ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, TCM not only covers all advantages of the algorithm via determinant decision diagrams (DDD) but is more simple and efficient than DDD method.展开更多
This paper analyses the current common problems of material code standardization in the implementation of MRP Ⅱ, and puts forward the basic ideas and methods for solving the problems, which has some reference value ...This paper analyses the current common problems of material code standardization in the implementation of MRP Ⅱ, and puts forward the basic ideas and methods for solving the problems, which has some reference value for the popularization of application o展开更多
In this paper, we present a theoretical codebook design method for VQ-based fast face recognition algorithm to im-prove recognition accuracy. Based on the systematic analysis and classification of code patterns, first...In this paper, we present a theoretical codebook design method for VQ-based fast face recognition algorithm to im-prove recognition accuracy. Based on the systematic analysis and classification of code patterns, firstly we theoretically create a systematically organized codebook. Combined with another codebook created by Kohonen’s Self-Organizing Maps (SOM) method, an optimized codebook consisted of 2×2 codevectors for facial images is generated. Experimental results show face recognition using such a codebook is more efficient than the codebook consisted of 4×4 codevector used in conventional algorithm. The highest average recognition rate of 98.6% is obtained for 40 persons’ 400 images of publicly available face database of AT&T Laboratories Cambridge containing variations in lighting, posing, and expressions. A table look-up (TLU) method is also proposed for the speed up of the recognition processing. By applying this method in the quantization step, the total recognition processing time achieves only 28 msec, enabling real-time face recognition.展开更多
Several special mechanical properties,such as dilatancy and compressibility,of cemented paste backfill(CPB)are controlled by its internal microstructure and evolution.The mesoscopic structure changes of CPB during the...Several special mechanical properties,such as dilatancy and compressibility,of cemented paste backfill(CPB)are controlled by its internal microstructure and evolution.The mesoscopic structure changes of CPB during the development process were investigated.On the basis of the scanning electron microscopy(SEM)and mechanical test results of CPB,the particle size information of CPB was extracted,and a two-dimensional particle flow code(PFC)model of CPB was established to analyze the evolution rule of mesoscopic parameters during CPB development.The embedded FISH language in PFC was used to develop a program for establishing a PFC model on the basis of the SEM results.The mesoscopic parameters of CPB samples at different curing times,such as coordination number(C_(n)),contact force chain,and rose diagram,were obtained by recording and loading and used to analyze the intrinsic relationship between mesoscopic parameter variations and macroscopic mechanical response during CPB development.It is of considerable significance to establish the physical model of CPB using the PFC to reveal the mesoscopic structure of CPB.展开更多
本文介绍了二维PIC(Particle in cell)方法,这种方法常用于粒子动力学模拟中空间电荷作用的计算。并比较了以时间为自变量(t-code)和以纵向位置为自变量(z-code)的两种动力学模拟程序;针对“国家重点基础研究发展规划”洁净核能项目中...本文介绍了二维PIC(Particle in cell)方法,这种方法常用于粒子动力学模拟中空间电荷作用的计算。并比较了以时间为自变量(t-code)和以纵向位置为自变量(z-code)的两种动力学模拟程序;针对“国家重点基础研究发展规划”洁净核能项目中的射频四极(RFQ)加速器结构参数,给出了单束加速和正、负离子束同时加速两种情况下,t-code和z-code模拟得出的传输效率。结果表明,当束团的相位宽度大或能散大时,z-code 在计算空间电荷作用时会引入相对较大的误差,从而应该使用t-code来进行动力学模拟,以获得更准确的结果。展开更多
Many researchers have developed new calculation methods to analyze seismic slope stability problems, but the conventional pseudo-static method is still widely used in engineering design due to its simplicity. Based on...Many researchers have developed new calculation methods to analyze seismic slope stability problems, but the conventional pseudo-static method is still widely used in engineering design due to its simplicity. Based on the Technical Code for Building Slope Engineering（GB 50330-2013） of China and the Guidelines for Evaluating and Mitigating Seismic Hazards in California（SP117）, a comparative study on the pseudo-static method was performed. The results indicate that the largest difference between these two design codes lies in determination of the seismic equivalence reduction factor( f;). The GB 50330-2013 code specifies a single value for f;of 0.25. In SP117, numerous factors,such as magnitude and distance, are considered in determining f;. Two case studies show that the types of slope stability status evaluated by SP117 are in agreement with those evaluated by the seismic time-history stability analysis and Newmark displacement analysis. The factors of safety evaluated by SP117 can be used in practice for safe design. However, the factors of safety evaluated by GB 50330-2013 are risky for slope seismic design.展开更多
For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem un...For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem unsolved well,and to solve this problem is very significant to the design of new mechanisms.According to the given degree of freedom（DOF） and link connection property of planar closed chain mechanisms,vertex assortment is obtained.For solving the isomorphism problem,a method of the adding sub-chains is proposed with the detailed steps and algorithms in the synthesizing process.Employing this method,the identification code and formation code of every topological structure are achieved,therefore many isomorphic structures could be eliminated in time during structural synthesis by comparing those codes among different topological graphs,resulting in the improvement of synthesizing efficiency and accuracy,and the approach for eliminating rigid sub-chains in and after the synthesizing process is also presented.Some examples are given,including how to add sub-chains,how to detect simple rigid sub-chains and how to obtain identification codes and formulation codes et al.Using the adding sub-chain method,the relative information of some common topological graphs is given in the form of table.The comparison result is coincident with many literatures,so the correctness of the adding sub-chain method is convinced.This method will greatly improve the synthesizing efficiency and accuracy,and has a good potential for application.展开更多
Based directly on the original definition of K-S entropy, a new algorithm for calculating K-S entropy from chaotic time series is developed by using some techniques of coding and code operation.
The immersed boundary method is an effective technique for modeling and simulating fluid-structure interactions especially in the area of biomechanics.This paper analyzes the accuracy of the immersed boundary method.T...The immersed boundary method is an effective technique for modeling and simulating fluid-structure interactions especially in the area of biomechanics.This paper analyzes the accuracy of the immersed boundary method.The procedure contains two parts,i.e.,the code verification and the accuracy analysis.The code verification provides the confidence that the code used is free of mistakes,and the accuracy analysis gives the order of accuracy of the immersed boundary method.The method of manufactured solutions is taken as a means for both parts.In the first part,the numerical code employs a second-order discretization scheme,i.e.,it has second-order accuracy in theory.It matches the calculated order of accuracy obtained in the numerical calculation for all variables.This means that the code contains no mistake,which is a premise of the subsequent work.The second part introduces a jump in the manufactured solution for the pressure and adds the corresponding singular forcing terms in the momentum equations.By analyzing the discretization errors,the accuracy of the immersed boundary method is proven to be first order even though the discretization scheme is second order.It has been found that the coarser mesh may not be sensitive enough to capture the influence of the immersed boundary,and the refinement on the Lagrangian markers barely has any effect on the numerical calculation.展开更多
A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by...A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.展开更多
Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of...Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.展开更多
A code developed recently by the authors, for counting and computing the eigenvalues of a complex tridiagonal matrix, as well as the roots of a complex polynomial, which lie in a given region of the complex plane, is ...A code developed recently by the authors, for counting and computing the eigenvalues of a complex tridiagonal matrix, as well as the roots of a complex polynomial, which lie in a given region of the complex plane, is modified to run in parallel on multi-core machines. A basic characteristic of this code (eventually pointing to its parallelization) is that it can proceed with: 1) partitioning the given region into an appropriate number of subregions;2) counting eigenvalues in each subregion;and 3) computing (already counted) eigenvalues in each subregion. Consequently, theoretically speaking, the whole code in itself parallelizes ideally. We carry out several numerical experiments with random complex tridiagonal matrices, and random complex polynomials as well, in order to study the behaviour of the parallel code, especially the degree of declination from theoretical expectations.展开更多
The reaction of earth to pull-out process of frictional rock bolts was here modeled by the distinct element method (DEM). Ten frictional bolts were prepared;the expanding shells of five bolts included convex edges and...The reaction of earth to pull-out process of frictional rock bolts was here modeled by the distinct element method (DEM). Ten frictional bolts were prepared;the expanding shells of five bolts included convex edges and the others had the shells with concave bits. The strength of bolts was measured by applying a standard pull-out test;the results confirmed that the strength of shells with convex edges was remarkably more than the strength of other shells. Furthermore, a two-dimensional DEM model of the test was developed by a particle flow code;the obtained results showed that the reaction of rock particles to the contacts occurring between the convex edges and earth was considerably more than those of the concave bits. In the other words, the convex edges transferred the pull-out force into a large area of the surrounded rock, causing these bolts to have the highest resistance against earth movements.展开更多
A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and...A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.展开更多
文摘After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.
文摘Symbolic analysis has many applications in the design of analog circuits. Existing approaches rely on two forms of symbolic-expression representation: expanded sum-of-product form and arbitrarily nested form. Expanded form suffers the problem that the number of product terms grows exponentially with the size of a circuit. Nested form is neither canonical nor amenable to symbolic manipulation. In this paper, we present a new approach to exact and canonical symbolic analysis by exploiting the sparsity and sharing of product terms. This algorithm, called totally coded method (TCM), consists of representing the symbolic determinant of a circuit matrix by code series and performing symbolic analysis by code manipulation. We describe an efficient code-ordering heuristic and prove that it is optimum for ladder-structured circuits. For practical analog circuits, TCM not only covers all advantages of the algorithm via determinant decision diagrams (DDD) but is more simple and efficient than DDD method.
文摘This paper analyses the current common problems of material code standardization in the implementation of MRP Ⅱ, and puts forward the basic ideas and methods for solving the problems, which has some reference value for the popularization of application o
文摘In this paper, we present a theoretical codebook design method for VQ-based fast face recognition algorithm to im-prove recognition accuracy. Based on the systematic analysis and classification of code patterns, firstly we theoretically create a systematically organized codebook. Combined with another codebook created by Kohonen’s Self-Organizing Maps (SOM) method, an optimized codebook consisted of 2×2 codevectors for facial images is generated. Experimental results show face recognition using such a codebook is more efficient than the codebook consisted of 4×4 codevector used in conventional algorithm. The highest average recognition rate of 98.6% is obtained for 40 persons’ 400 images of publicly available face database of AT&T Laboratories Cambridge containing variations in lighting, posing, and expressions. A table look-up (TLU) method is also proposed for the speed up of the recognition processing. By applying this method in the quantization step, the total recognition processing time achieves only 28 msec, enabling real-time face recognition.
基金financially supported by the National Natural Science Foundation of China(Nos.51874229,52074212,51674188,51504182,51404191,and 51405381)the Natural Science Basic Research Plan of Shaanxi Province of China(Nos.2015JQ5187,2018JQ5183,and 2018JM5161)+3 种基金the Scientific Research Program funded by the Shaanxi Education Department(No.15JK1466)the China Postdoctoral Science Foundation(No.2015M582685)the Outstanding Youth Science Fund of Xi’an University of Science and Technology(No.2018YQ2-01)supported by the National Research Council of Science&and Technology(NST)grant by the Korea Korean government(MSIP)(No.CRC-16-38502-KICT)。
文摘Several special mechanical properties,such as dilatancy and compressibility,of cemented paste backfill(CPB)are controlled by its internal microstructure and evolution.The mesoscopic structure changes of CPB during the development process were investigated.On the basis of the scanning electron microscopy(SEM)and mechanical test results of CPB,the particle size information of CPB was extracted,and a two-dimensional particle flow code(PFC)model of CPB was established to analyze the evolution rule of mesoscopic parameters during CPB development.The embedded FISH language in PFC was used to develop a program for establishing a PFC model on the basis of the SEM results.The mesoscopic parameters of CPB samples at different curing times,such as coordination number(C_(n)),contact force chain,and rose diagram,were obtained by recording and loading and used to analyze the intrinsic relationship between mesoscopic parameter variations and macroscopic mechanical response during CPB development.It is of considerable significance to establish the physical model of CPB using the PFC to reveal the mesoscopic structure of CPB.
文摘本文介绍了二维PIC(Particle in cell)方法,这种方法常用于粒子动力学模拟中空间电荷作用的计算。并比较了以时间为自变量(t-code)和以纵向位置为自变量(z-code)的两种动力学模拟程序;针对“国家重点基础研究发展规划”洁净核能项目中的射频四极(RFQ)加速器结构参数,给出了单束加速和正、负离子束同时加速两种情况下,t-code和z-code模拟得出的传输效率。结果表明,当束团的相位宽度大或能散大时,z-code 在计算空间电荷作用时会引入相对较大的误差,从而应该使用t-code来进行动力学模拟,以获得更准确的结果。
基金supported by the National Key R&D Program of China(Grant No.2017YFC0404804)the National Natural Science Foundation of China(Grant No.51509019)
文摘Many researchers have developed new calculation methods to analyze seismic slope stability problems, but the conventional pseudo-static method is still widely used in engineering design due to its simplicity. Based on the Technical Code for Building Slope Engineering（GB 50330-2013） of China and the Guidelines for Evaluating and Mitigating Seismic Hazards in California（SP117）, a comparative study on the pseudo-static method was performed. The results indicate that the largest difference between these two design codes lies in determination of the seismic equivalence reduction factor( f;). The GB 50330-2013 code specifies a single value for f;of 0.25. In SP117, numerous factors,such as magnitude and distance, are considered in determining f;. Two case studies show that the types of slope stability status evaluated by SP117 are in agreement with those evaluated by the seismic time-history stability analysis and Newmark displacement analysis. The factors of safety evaluated by SP117 can be used in practice for safe design. However, the factors of safety evaluated by GB 50330-2013 are risky for slope seismic design.
基金supported by National Natural Science Foundation of China (Grant No. 51075079)National Hi-tech Research and Development Program of China(863 Program,Grant No. 2008AA04Z202)
文摘For at least the past five decades,structural synthesis has been used as a main means of finding better mechanisms with some predefined function.In structural synthesis,isomorphism identification is still a problem unsolved well,and to solve this problem is very significant to the design of new mechanisms.According to the given degree of freedom（DOF） and link connection property of planar closed chain mechanisms,vertex assortment is obtained.For solving the isomorphism problem,a method of the adding sub-chains is proposed with the detailed steps and algorithms in the synthesizing process.Employing this method,the identification code and formation code of every topological structure are achieved,therefore many isomorphic structures could be eliminated in time during structural synthesis by comparing those codes among different topological graphs,resulting in the improvement of synthesizing efficiency and accuracy,and the approach for eliminating rigid sub-chains in and after the synthesizing process is also presented.Some examples are given,including how to add sub-chains,how to detect simple rigid sub-chains and how to obtain identification codes and formulation codes et al.Using the adding sub-chain method,the relative information of some common topological graphs is given in the form of table.The comparison result is coincident with many literatures,so the correctness of the adding sub-chain method is convinced.This method will greatly improve the synthesizing efficiency and accuracy,and has a good potential for application.
基金The project supported by National Natural Science Foundation of China
文摘Based directly on the original definition of K-S entropy, a new algorithm for calculating K-S entropy from chaotic time series is developed by using some techniques of coding and code operation.
基金supported by the National Natural Science Foundation of China (No 10472070)
文摘The immersed boundary method is an effective technique for modeling and simulating fluid-structure interactions especially in the area of biomechanics.This paper analyzes the accuracy of the immersed boundary method.The procedure contains two parts,i.e.,the code verification and the accuracy analysis.The code verification provides the confidence that the code used is free of mistakes,and the accuracy analysis gives the order of accuracy of the immersed boundary method.The method of manufactured solutions is taken as a means for both parts.In the first part,the numerical code employs a second-order discretization scheme,i.e.,it has second-order accuracy in theory.It matches the calculated order of accuracy obtained in the numerical calculation for all variables.This means that the code contains no mistake,which is a premise of the subsequent work.The second part introduces a jump in the manufactured solution for the pressure and adds the corresponding singular forcing terms in the momentum equations.By analyzing the discretization errors,the accuracy of the immersed boundary method is proven to be first order even though the discretization scheme is second order.It has been found that the coarser mesh may not be sensitive enough to capture the influence of the immersed boundary,and the refinement on the Lagrangian markers barely has any effect on the numerical calculation.
文摘A pseudo-random coding side-lobe suppression method based on CLEAN algorithm is introduced.The CLEAN algorithm mainly processes pulse compression results of a pseudo-random coding,and estimates a target＇s distance by a method named interpolation method,so that we can get an ideal pulse compression result of the target,and then use the adjusted ideal pulse compression side-lobe to cut the actual pulse compression result,so as to achieve the remarkable performance of side-lobe suppression for large targets,and let the adjacent small targets appear.The computer simulations by MATLAB with this method analyze the effect of side-lobe suppression in an ideal or noisy environment.It is proved that this method can effectively solve the problem due to the side-lobe of pseudo-random coding being too high,and can enhance the radar＇s multi-target detection ability.
基金supported in part by National Nature Science Foundation of China under Grant No.61471286,No.61271004the Fundamental Research Funds for the Central Universitiesthe open research fund of Key Laboratory of Information Coding and Transmission,Southwest Jiaotong University(No.2010-03)
文摘Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.
文摘A code developed recently by the authors, for counting and computing the eigenvalues of a complex tridiagonal matrix, as well as the roots of a complex polynomial, which lie in a given region of the complex plane, is modified to run in parallel on multi-core machines. A basic characteristic of this code (eventually pointing to its parallelization) is that it can proceed with: 1) partitioning the given region into an appropriate number of subregions;2) counting eigenvalues in each subregion;and 3) computing (already counted) eigenvalues in each subregion. Consequently, theoretically speaking, the whole code in itself parallelizes ideally. We carry out several numerical experiments with random complex tridiagonal matrices, and random complex polynomials as well, in order to study the behaviour of the parallel code, especially the degree of declination from theoretical expectations.
文摘The reaction of earth to pull-out process of frictional rock bolts was here modeled by the distinct element method (DEM). Ten frictional bolts were prepared;the expanding shells of five bolts included convex edges and the others had the shells with concave bits. The strength of bolts was measured by applying a standard pull-out test;the results confirmed that the strength of shells with convex edges was remarkably more than the strength of other shells. Furthermore, a two-dimensional DEM model of the test was developed by a particle flow code;the obtained results showed that the reaction of rock particles to the contacts occurring between the convex edges and earth was considerably more than those of the concave bits. In the other words, the convex edges transferred the pull-out force into a large area of the surrounded rock, causing these bolts to have the highest resistance against earth movements.
基金Supported by the National Key Basic Research Program (973) Project (No. 2010CB328300)the 111 Project (No. B08038)
文摘A new method for constructing Quasi-Cyclic (QC) Low-Density Parity-Check (LDPC) codes based on Euclidean Geometry (EG) is presented. The proposed method results in a class of QC-LDPC codes with girth of at least 6 and the designed codes perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing EG-LDPC codes.
