目的实践观察对比环境温度对Welch Al yn耳温仪侧耳温的影响。方法随机抽取2014年1~2月急诊内科、急诊儿科就诊的部分配合测量患者,评估入院是否受环境温度影响,等待1~5min与20min同侧耳温对比,并随机进行左右耳温的对比分析观察。结果...目的实践观察对比环境温度对Welch Al yn耳温仪侧耳温的影响。方法随机抽取2014年1~2月急诊内科、急诊儿科就诊的部分配合测量患者,评估入院是否受环境温度影响,等待1~5min与20min同侧耳温对比,并随机进行左右耳温的对比分析观察。结果患者不同入院方式等待1~5min侧耳温与等待20min侧耳温两组之间温度明显差异有统计学意(<0.001),患者左右耳温度差异无统计学意义(>0.05)。结论德国Welch Al yn公司生产的红外线鼓膜耳温仪测量耳温,在急诊预检,要充分评估有无受环境温度的影响,过冷或过热的环境及捂耳和耳受压情况下,须等待20min测量耳温能较好地反应患者体核温度。耳温仪操作简单、方便、快捷、安全、准确,值得临床护理推广使用。展开更多
The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear o...The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear optimal perturbation （CNOP） method. Usually, the CNOP method is implemented with the help of a gradient descent algorithm based on the adjoint method, which is named the ADJ-CNOP. However, with the increasing improvement of actual prediction models, more and more physical processes are taken into consideration in models in the form of parameterization, thus giving rise to the on–off switch problem, which tremendously affects the effectiveness of the conventional gradient descent algorithm based on the ad- joint method. In this study, we attempted to apply a genetic algorithm （GA） to the CNOP method, named GA-CNOP, to solve the predictability problems involving on–off switches. As the precision of the filtering method depends uniquely on the division of the constraint region, its results were taken as benchmarks, and a series of comparisons between the ADJ-CNOP and the GA-CNOP were performed for the modified Lorenz equation. Results show that the GA-CNOP can always determine the accurate lower bound of maximum predictable time, even in non-smooth cases, while the ADJ-CNOP, owing to the effect of on–off switches, often yields the incorrect lower bound of maximum predictable time. Therefore, in non-smooth cases, using GAs to solve predictability problems is more effective than using the conventional optimization algorithm based on gradients, as long as genetic operators in GAs are properly configured.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a p...Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a particular set of eigenvalues, and provide corresponding reconstruction algorithm, which can be applicable to McLaughlin-Rundell＇s uniqueness theorem （see J. Math. Phys. 28, 1987）.展开更多
Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have...Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have low level of contrast and are corrupted with strong speckle noise. Due to these effects, segmentation of ultrasound images is very challenging and traditional image segmentation methods may not be leads to satisfactory results. The active contour method has been one of the widely used techniques for image segmentation;however, due to low quality of ultrasound images, it has encountered difficulties. In this paper, we presented a segmental method combined genetic algorithm and active contour with an energy minimization procedure based on genetic algorithms. This method have been proposed to overcome some limits of classical active contours, as con-tour initialization and local minima (speckle noise), and have been successfully applied on medical ultrasound images. Experimental result on medical ultrasound image show that our presented method only can correctly segment the circular tissue’s on ultra-sound images.展开更多
In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). I...In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). In design, the PSMM model has comprehensively considered both the relationship between samples of the same class and the structure of rows or columns of matrix data. To a certain extent, our novel model can be regarded as a synthesis of the PSVM model and the LRSMM model. Since the PSMM model is an unconstrained convex problem in essence, we have established an alternating direction method of multipliers algorithm to deal with the proposed model. Finally, since a great deal of experiments on the minst digital database show that the PSMM classifier has a good ability to distinguish two digits with little difference, it encourages us to conduct more complex experiments on MIT face database, INRIA person database, the students face database and Japan female facial expression database. Meanwhile, the final experimental results show that PSMM performs better than PSVM, twin support vector machine, LRSMM and linear twin multiple rank support matrix machine in the demanding image classification tasks.展开更多
文摘目的实践观察对比环境温度对Welch Al yn耳温仪侧耳温的影响。方法随机抽取2014年1~2月急诊内科、急诊儿科就诊的部分配合测量患者,评估入院是否受环境温度影响,等待1~5min与20min同侧耳温对比,并随机进行左右耳温的对比分析观察。结果患者不同入院方式等待1~5min侧耳温与等待20min侧耳温两组之间温度明显差异有统计学意(<0.001),患者左右耳温度差异无统计学意义(>0.05)。结论德国Welch Al yn公司生产的红外线鼓膜耳温仪测量耳温,在急诊预检,要充分评估有无受环境温度的影响,过冷或过热的环境及捂耳和耳受压情况下,须等待20min测量耳温能较好地反应患者体核温度。耳温仪操作简单、方便、快捷、安全、准确,值得临床护理推广使用。
基金supported bythe National Natural Science Foundation of China(Grant Nos40975063 and 40830955)
文摘The lower bound of maximum predictable time can be formulated into a constrained nonlinear opti- mization problem, and the traditional solutions to this problem are the filtering method and the conditional nonlinear optimal perturbation （CNOP） method. Usually, the CNOP method is implemented with the help of a gradient descent algorithm based on the adjoint method, which is named the ADJ-CNOP. However, with the increasing improvement of actual prediction models, more and more physical processes are taken into consideration in models in the form of parameterization, thus giving rise to the on–off switch problem, which tremendously affects the effectiveness of the conventional gradient descent algorithm based on the ad- joint method. In this study, we attempted to apply a genetic algorithm （GA） to the CNOP method, named GA-CNOP, to solve the predictability problems involving on–off switches. As the precision of the filtering method depends uniquely on the division of the constraint region, its results were taken as benchmarks, and a series of comparisons between the ADJ-CNOP and the GA-CNOP were performed for the modified Lorenz equation. Results show that the GA-CNOP can always determine the accurate lower bound of maximum predictable time, even in non-smooth cases, while the ADJ-CNOP, owing to the effect of on–off switches, often yields the incorrect lower bound of maximum predictable time. Therefore, in non-smooth cases, using GAs to solve predictability problems is more effective than using the conventional optimization algorithm based on gradients, as long as genetic operators in GAs are properly configured.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
文摘生产规划过程需要同时考虑装配序列规划(Assembly Sequence Planning,ASP)和装配线平衡(Assembly Line Balancing,ALB)。针对ASP和ALB的多项式复杂程度的非确定性问题(Non-Deterministic Polynomial Hard,NP难题)及二者耦合问题,以产品结构图为基础,结合物料清单(Bill of Material,BOM)层次图构建装配约束矩阵,分析产品内部各子装配体独立装配可行性,并对子装配体分拆以获得可行的装配序列矩阵。其次,以工作站最大装配时间、装配方向和工具切换次数、站间平衡为目标,构建综合ASP和ALB的联合规划模型。提出基于Pareto解集的混合人工鱼群算法(Hybrid Artificial Fish Swarm Algorithm,HAFSA),采用自适应视野串行觅食,减少并行觅食重复搜索。对人工鱼群算法得到的装配序列进行粒子群优化(Particle Swarm Optimization,PSO)操作,提高跳出局部最优的可能。将所提算法应用于某装配实例,与基本AFSA、PSO算法对比,验证算法有效性。
基金supported in part by the National Natural Science Foundation of China(11611530682,11171152 and 91538108)Natural Science Foundation of Jiangsu Province of China(BK 20141392)supported by the China Scholarship Fund(201706840062)
文摘Sturm-Liouville operators on a finite interval with discontinuities are considered. We give a uniqueness theorem for determining the potential and the parameters in boundary and under discontinuous conditions from a particular set of eigenvalues, and provide corresponding reconstruction algorithm, which can be applicable to McLaughlin-Rundell＇s uniqueness theorem （see J. Math. Phys. 28, 1987）.
文摘Image segmentation is one of the earliest and most important stages of image processing and plays an important role in both qualitative and quantitative analysis of medical ultrasound images but ultrasound images have low level of contrast and are corrupted with strong speckle noise. Due to these effects, segmentation of ultrasound images is very challenging and traditional image segmentation methods may not be leads to satisfactory results. The active contour method has been one of the widely used techniques for image segmentation;however, due to low quality of ultrasound images, it has encountered difficulties. In this paper, we presented a segmental method combined genetic algorithm and active contour with an energy minimization procedure based on genetic algorithms. This method have been proposed to overcome some limits of classical active contours, as con-tour initialization and local minima (speckle noise), and have been successfully applied on medical ultrasound images. Experimental result on medical ultrasound image show that our presented method only can correctly segment the circular tissue’s on ultra-sound images.
文摘In this paper, we have proposed a novel model called proximal support matrix machine (PSMM), which is mainly based on the models of proximal support vector machine (PSVM) and low rank support matrix machine (LRSMM). In design, the PSMM model has comprehensively considered both the relationship between samples of the same class and the structure of rows or columns of matrix data. To a certain extent, our novel model can be regarded as a synthesis of the PSVM model and the LRSMM model. Since the PSMM model is an unconstrained convex problem in essence, we have established an alternating direction method of multipliers algorithm to deal with the proposed model. Finally, since a great deal of experiments on the minst digital database show that the PSMM classifier has a good ability to distinguish two digits with little difference, it encourages us to conduct more complex experiments on MIT face database, INRIA person database, the students face database and Japan female facial expression database. Meanwhile, the final experimental results show that PSMM performs better than PSVM, twin support vector machine, LRSMM and linear twin multiple rank support matrix machine in the demanding image classification tasks.
