Hausdorff distance between two compact sets, defined as the maximum distance from a point of one set to another set, has many application in computer science. It is a good measure for the similarity of two sets. This ...Hausdorff distance between two compact sets, defined as the maximum distance from a point of one set to another set, has many application in computer science. It is a good measure for the similarity of two sets. This paper proves that the shape distance between two compact sets in R^n defined by nfinimum Hausdorff distance under rigid motions is a distance. The authors introduce similarity comparison problems in protein science, and propose that this measure may have good application to comparison of protein structure as well. For calculation of this distance, the authors give one dimensional formulas for problems （2, n）, （3, 3）, and （3, 4）. These formulas can reduce time needed for solving these problems. The authors did some data, this formula can reduce time needed to one As n increases, it would save more time. numerical experiments for （2, n）. On these sets of fifteenth of the best algorithms known on average.展开更多
Data envelopment analysis （DEA） is an effective non-parametric method for measuring the relative efficiencies of decision making units （DMUs） with multiple inputs and outputs. In many real situations, the internal...Data envelopment analysis （DEA） is an effective non-parametric method for measuring the relative efficiencies of decision making units （DMUs） with multiple inputs and outputs. In many real situations, the internal structure of DMUs is a two-stage network process with shared inputs used in both stages and common outputs produced by the both stages. For example, hospitals have a two-stage network structure. Stage 1 consumes resources such as information technology system, plant, equipment and admin personnel to generate outputs such as medical records, laundry and housekeeping. Stage 2 consumes the same set of resources used by stage 1 （named shared inputs） and the outputs generated by stage 1 （named intermediate measures） to provide patient services. Besides, some of outputs, for instance, patient satisfaction degrees, are generated by the two individual stages together （named shared outputs）. Since some of shared inputs and outputs are hard split up and allocated to each individual stage, it needs to develop two-stage DEA methods for evaluating the performance of two-stage network processes in such problems. This paper extends the centralized model to measure the DEA efficiency of the two-stage process with non split-table shared inputs and outputs. A weighted additive approach is used to combine the two individual stages. Moreover, additive efficiency decomposition models are developed to simultaneously evaluate the maximal and the minimal achievable efficiencies for the individual stages. Finally, an example of 17 city branches of China Construction Bank in Anhui Province is employed to illustrate the proposed approach.展开更多
In this paper, the convergence analysis of the Volterra integral equation of second kind with weakly singular kernel and pantograph delays is provided. We use some function transformations and variable transformations...In this paper, the convergence analysis of the Volterra integral equation of second kind with weakly singular kernel and pantograph delays is provided. We use some function transformations and variable transformations to change the equation into a new Volterra integral equation with pantograph delays defined on the interval [-1, 1], so that the Jacobi orthogonal polynomial theory can be applied conveniently. We provide a rigorous error analysis for the proposed method in the L∞-norm and the weighted L2-norm. Numerical examples are presented to complement the theoretical convergence results.展开更多
The linear third-order ordinary differential equation （ODE） can be transformed into a system of two second-order ODEs by introducing a variable replacement, which is different from the common order-reduced approach....The linear third-order ordinary differential equation （ODE） can be transformed into a system of two second-order ODEs by introducing a variable replacement, which is different from the common order-reduced approach. We choose the functions p（z） and q（x） in the variable replacement to get different cases of the special order-reduced system for the linear third-order ODE. We analyze the numerical behavior and algebraic properties of the systems of linear equations resulting from the sine diseretizations of these special second-order ODE systems. Then the block-diagonal preconditioner is used to accelerate the convergence of the Krylov subspace iteration methods for solving the discretized system of linear equation. Numerical results show that these order-reduced methods are effective for solving the linear third-order ODEs.展开更多
基金supported by the National Natural Science Foundation of China under Grant No. 10771206973 Project (2004CB318000) of China
文摘Hausdorff distance between two compact sets, defined as the maximum distance from a point of one set to another set, has many application in computer science. It is a good measure for the similarity of two sets. This paper proves that the shape distance between two compact sets in R^n defined by nfinimum Hausdorff distance under rigid motions is a distance. The authors introduce similarity comparison problems in protein science, and propose that this measure may have good application to comparison of protein structure as well. For calculation of this distance, the authors give one dimensional formulas for problems （2, n）, （3, 3）, and （3, 4）. These formulas can reduce time needed for solving these problems. The authors did some data, this formula can reduce time needed to one As n increases, it would save more time. numerical experiments for （2, n）. On these sets of fifteenth of the best algorithms known on average.
基金Acknowledgments The authors thank the editors and two anonymous referees for their helpful comments and suggestions that substantially improved the quality of this work. This research has been supported by grants from National Natural Science Foundation of China （71224001） and China Postdoctoral Science Foundation funded project （2015M571135）.
文摘Data envelopment analysis （DEA） is an effective non-parametric method for measuring the relative efficiencies of decision making units （DMUs） with multiple inputs and outputs. In many real situations, the internal structure of DMUs is a two-stage network process with shared inputs used in both stages and common outputs produced by the both stages. For example, hospitals have a two-stage network structure. Stage 1 consumes resources such as information technology system, plant, equipment and admin personnel to generate outputs such as medical records, laundry and housekeeping. Stage 2 consumes the same set of resources used by stage 1 （named shared inputs） and the outputs generated by stage 1 （named intermediate measures） to provide patient services. Besides, some of outputs, for instance, patient satisfaction degrees, are generated by the two individual stages together （named shared outputs）. Since some of shared inputs and outputs are hard split up and allocated to each individual stage, it needs to develop two-stage DEA methods for evaluating the performance of two-stage network processes in such problems. This paper extends the centralized model to measure the DEA efficiency of the two-stage process with non split-table shared inputs and outputs. A weighted additive approach is used to combine the two individual stages. Moreover, additive efficiency decomposition models are developed to simultaneously evaluate the maximal and the minimal achievable efficiencies for the individual stages. Finally, an example of 17 city branches of China Construction Bank in Anhui Province is employed to illustrate the proposed approach.
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant Nos. 11271157, 11071102, 11001259）, the Croucher Foundation of Hong Kong, the National Center for Mathematics and Interdisciplinary Science, CAS, and the President Foundation of AMSS-CAS.
文摘In this paper, the convergence analysis of the Volterra integral equation of second kind with weakly singular kernel and pantograph delays is provided. We use some function transformations and variable transformations to change the equation into a new Volterra integral equation with pantograph delays defined on the interval [-1, 1], so that the Jacobi orthogonal polynomial theory can be applied conveniently. We provide a rigorous error analysis for the proposed method in the L∞-norm and the weighted L2-norm. Numerical examples are presented to complement the theoretical convergence results.
文摘The linear third-order ordinary differential equation （ODE） can be transformed into a system of two second-order ODEs by introducing a variable replacement, which is different from the common order-reduced approach. We choose the functions p（z） and q（x） in the variable replacement to get different cases of the special order-reduced system for the linear third-order ODE. We analyze the numerical behavior and algebraic properties of the systems of linear equations resulting from the sine diseretizations of these special second-order ODE systems. Then the block-diagonal preconditioner is used to accelerate the convergence of the Krylov subspace iteration methods for solving the discretized system of linear equation. Numerical results show that these order-reduced methods are effective for solving the linear third-order ODEs.
