The continuously updated database of failures and censored data of numerous products has become large, and on some covariates, information regarding the failure times is missing in the database. As the dataset is larg...The continuously updated database of failures and censored data of numerous products has become large, and on some covariates, information regarding the failure times is missing in the database. As the dataset is large and has missing information, the analysis tasks become complicated and a long time is required to execute the programming codes. In such situations, the divide and recombine (D&R) approach, which has a practical computational performance for big data analysis, can be applied. In this study, the D&R approach was applied to analyze the real field data of an automobile component with incomplete information on covariates using the Weibull regression model. Model parameters were estimated using the expectation maximization algorithm. The results of the data analysis and simulation demonstrated that the D&R approach is applicable for analyzing such datasets. Further, the percentiles and reliability functions of the distribution under different covariate conditions were estimated to evaluate the component performance of these covariates. The findings of this study have managerial implications regarding design decisions, safety, and reliability of automobile components.展开更多
Tools for pair-wise bio-sequence alignment have for long played a central role in computation biology. Several algorithms for bio-sequence alignment have been developed. The Smith-Waterman algorithm, based on dynamic ...Tools for pair-wise bio-sequence alignment have for long played a central role in computation biology. Several algorithms for bio-sequence alignment have been developed. The Smith-Waterman algorithm, based on dynamic programming, is considered the most fundamental alignment algorithm in bioinformatics. However the existing parallel Smith-Waterman algorithm needs large memory space, and this disadvantage limits the size of a sequence to be handled. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel Smith- Waterman algorithm has become a critical problem. For solving this problem, we develop a new parallel bio-sequence alignment algorithm, using the strategy of divide and conquer, named PSW-DC algorithm. In our algorithm, first, we partition the query sequence into several subsequences and distribute them to every processor respectively, then compare each subsequence with the whole subject sequence in parallel, using the Smith-Waterman algorithm, and get an interim result, finally obtain the optimal alignment between the query sequence and subject sequence, through the special combination and extension method. Memory space required in our algorithm is reduced significantly in comparison with existing ones. We also develop a key technique of combination and extension, named the C&E method, to manipulate the interim results and obtain the final sequences alignment. We implement the new parallel bio-sequences alignment algorithm, the PSW-DC, in a cluster parallel system.展开更多
The dividing wall column （DWC） is considered as a major breakthrough in distillation technology and has good prospect of industrialization. Model predictive control （MPC） is an advanced control strategy that has a...The dividing wall column （DWC） is considered as a major breakthrough in distillation technology and has good prospect of industrialization. Model predictive control （MPC） is an advanced control strategy that has acquired extensive applications in various industries. In this study, MPC is applied to the process for separating ethanol, n-propanol, and n-butanol ternary mixture in a fully thermally coupled DWC. Both composition control and tem- perature inferent/al control are considered. The multiobjective genetic algor/thm function ＂gamult/obj＂ in Matlab is used for the weight tuning of MPC. Comparisons are made between the control performances of MPC and PI strategies. Simulation results show that although both MPC and PI schemes can stabilize the DWC in case of feed disturbances, MPC generally behaves better than the PI strategy for both composition control and tempera- ture inferential control, resulting in a more stable and superior performance with lower values of integral of squared error （ISE）.展开更多
A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε ...A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε processors, 0≤ ε ≤1, and O(2 n/2 ) memory to find a solution for the n -element knapsack problem in time O(2 n/4 (2 n/4 ) ε) . The cost of the proposed parallel algorithm is O(2 n/2 ) , which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches.展开更多
Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference...Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference analysis, a systematic method to construct Cn (n≥ 0) interpolatorycurves by subdivision from given data is described and the mask (filter) of the algorithm is presentedexplicitly. This algorithm generates a Cn smooth curve which interpolates the initial control points.Control parameters are also provided so that the shape of the final curve can be adjusted according torequirements. An immediate generalisation of the method is the construction of smooth interpolatorysubdivision algorithms over uniform triangular networks (tensor product type data) in Rm. The mainresults of this algorithm for smooth interpolatory surface subdivision algorrthm are also included.AMS(MOS) : 65D05 , 65D15 , 65D17.展开更多
基于既有研究成果在对混凝土轨枕裂纹检测效率不足的基础上,提出一种改进算法YOLOv5+,主要以YOLOv5网络模型为基础,对混凝土轨枕裂纹进行高效检测。首先,采用分治标签的策略来增大裂纹在标签中的实际占比,从而解决混凝土轨枕裂纹尺度变...基于既有研究成果在对混凝土轨枕裂纹检测效率不足的基础上,提出一种改进算法YOLOv5+,主要以YOLOv5网络模型为基础,对混凝土轨枕裂纹进行高效检测。首先,采用分治标签的策略来增大裂纹在标签中的实际占比,从而解决混凝土轨枕裂纹尺度变化大的问题,使网络更利于提取有效特征;其次,将YOLOv5网络结构中SPP模块的最大池化层改为平均池化层,减少裂纹漏检的现象;同时,在YOLOv5骨干网络中嵌入SE注意力模块(Squeeze and Excitation,SE)提高对细小裂纹的检测能力;最后,结合新的检测尺度与特征融合网络,降低微小裂纹的漏检现象。实验结果表明,以YOLOv5网络模型为基础的改进算法YOLOv5+,除了召回率Recall变化不大外,精确率Precision提高6.5%,平均精度均值mAP提升8%,帧率FPS也有所提升,能够满足实时性的检测需求。展开更多
We decompose the problem of the optimal multi-degree reduction of Bézier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree re...We decompose the problem of the optimal multi-degree reduction of Bézier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree reduction, and doing optimal degree reduction without making high order interpolations at the two endpoints. Further, we convert the second subproblem into multi-degree reduction of Jacobi polynomials. Then, we can easily derive the optimal solution using orthonormality of Jacobi polynomials and the least square method of unequally accurate measurement. This method of 'divide and conquer' has several advantages including maintaining high continuity at the two endpoints of the curve, doing multi-degree reduction only once, using explicit approximation expressions, estimating error in advance, low time cost, and high precision. More importantly, it is not only deduced simply and directly, but also can be easily extended to the degree reduction of surfaces. Finally, we present two examples to demonstrate the effectiveness of our algorithm.展开更多
文摘The continuously updated database of failures and censored data of numerous products has become large, and on some covariates, information regarding the failure times is missing in the database. As the dataset is large and has missing information, the analysis tasks become complicated and a long time is required to execute the programming codes. In such situations, the divide and recombine (D&R) approach, which has a practical computational performance for big data analysis, can be applied. In this study, the D&R approach was applied to analyze the real field data of an automobile component with incomplete information on covariates using the Weibull regression model. Model parameters were estimated using the expectation maximization algorithm. The results of the data analysis and simulation demonstrated that the D&R approach is applicable for analyzing such datasets. Further, the percentiles and reliability functions of the distribution under different covariate conditions were estimated to evaluate the component performance of these covariates. The findings of this study have managerial implications regarding design decisions, safety, and reliability of automobile components.
文摘Tools for pair-wise bio-sequence alignment have for long played a central role in computation biology. Several algorithms for bio-sequence alignment have been developed. The Smith-Waterman algorithm, based on dynamic programming, is considered the most fundamental alignment algorithm in bioinformatics. However the existing parallel Smith-Waterman algorithm needs large memory space, and this disadvantage limits the size of a sequence to be handled. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel Smith- Waterman algorithm has become a critical problem. For solving this problem, we develop a new parallel bio-sequence alignment algorithm, using the strategy of divide and conquer, named PSW-DC algorithm. In our algorithm, first, we partition the query sequence into several subsequences and distribute them to every processor respectively, then compare each subsequence with the whole subject sequence in parallel, using the Smith-Waterman algorithm, and get an interim result, finally obtain the optimal alignment between the query sequence and subject sequence, through the special combination and extension method. Memory space required in our algorithm is reduced significantly in comparison with existing ones. We also develop a key technique of combination and extension, named the C&E method, to manipulate the interim results and obtain the final sequences alignment. We implement the new parallel bio-sequences alignment algorithm, the PSW-DC, in a cluster parallel system.
基金Supported by the National Natural Science Foundation of China(21676299,21476261and 21606255)
文摘The dividing wall column （DWC） is considered as a major breakthrough in distillation technology and has good prospect of industrialization. Model predictive control （MPC） is an advanced control strategy that has acquired extensive applications in various industries. In this study, MPC is applied to the process for separating ethanol, n-propanol, and n-butanol ternary mixture in a fully thermally coupled DWC. Both composition control and tem- perature inferent/al control are considered. The multiobjective genetic algor/thm function ＂gamult/obj＂ in Matlab is used for the weight tuning of MPC. Comparisons are made between the control performances of MPC and PI strategies. Simulation results show that although both MPC and PI schemes can stabilize the DWC in case of feed disturbances, MPC generally behaves better than the PI strategy for both composition control and tempera- ture inferential control, resulting in a more stable and superior performance with lower values of integral of squared error （ISE）.
文摘A new parallel algorithm is proposed for the knapsack problem where the method of divide and conquer is adopted. Based on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2 n/4 ) 1-ε processors, 0≤ ε ≤1, and O(2 n/2 ) memory to find a solution for the n -element knapsack problem in time O(2 n/4 (2 n/4 ) ε) . The cost of the proposed parallel algorithm is O(2 n/2 ) , which is an optimal method for solving the knapsack problem without memory conflicts and an improved result over the past researches.
文摘Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference analysis, a systematic method to construct Cn (n≥ 0) interpolatorycurves by subdivision from given data is described and the mask (filter) of the algorithm is presentedexplicitly. This algorithm generates a Cn smooth curve which interpolates the initial control points.Control parameters are also provided so that the shape of the final curve can be adjusted according torequirements. An immediate generalisation of the method is the construction of smooth interpolatorysubdivision algorithms over uniform triangular networks (tensor product type data) in Rm. The mainresults of this algorithm for smooth interpolatory surface subdivision algorrthm are also included.AMS(MOS) : 65D05 , 65D15 , 65D17.
文摘基于既有研究成果在对混凝土轨枕裂纹检测效率不足的基础上,提出一种改进算法YOLOv5+,主要以YOLOv5网络模型为基础,对混凝土轨枕裂纹进行高效检测。首先,采用分治标签的策略来增大裂纹在标签中的实际占比,从而解决混凝土轨枕裂纹尺度变化大的问题,使网络更利于提取有效特征;其次,将YOLOv5网络结构中SPP模块的最大池化层改为平均池化层,减少裂纹漏检的现象;同时,在YOLOv5骨干网络中嵌入SE注意力模块(Squeeze and Excitation,SE)提高对细小裂纹的检测能力;最后,结合新的检测尺度与特征融合网络,降低微小裂纹的漏检现象。实验结果表明,以YOLOv5网络模型为基础的改进算法YOLOv5+,除了召回率Recall变化不大外,精确率Precision提高6.5%,平均精度均值mAP提升8%,帧率FPS也有所提升,能够满足实时性的检测需求。
基金supported by the National Natural Science Foundation of China (No. 60873111)the National Basic Research Program (973) of China (No. 2004CB719400)
文摘We decompose the problem of the optimal multi-degree reduction of Bézier curves with corners constraint into two simpler subproblems, namely making high order interpolations at the two endpoints without degree reduction, and doing optimal degree reduction without making high order interpolations at the two endpoints. Further, we convert the second subproblem into multi-degree reduction of Jacobi polynomials. Then, we can easily derive the optimal solution using orthonormality of Jacobi polynomials and the least square method of unequally accurate measurement. This method of 'divide and conquer' has several advantages including maintaining high continuity at the two endpoints of the curve, doing multi-degree reduction only once, using explicit approximation expressions, estimating error in advance, low time cost, and high precision. More importantly, it is not only deduced simply and directly, but also can be easily extended to the degree reduction of surfaces. Finally, we present two examples to demonstrate the effectiveness of our algorithm.
