E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking d...E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.展开更多
A powerful approach to solve the Coulombic quantum three-body problem is proposed. The approach is exponentially convergent and more efficient than the hyperspherical coordinate method and the correlation-function hyp...A powerful approach to solve the Coulombic quantum three-body problem is proposed. The approach is exponentially convergent and more efficient than the hyperspherical coordinate method and the correlation-function hyperspherical harmonic method. This approach is numerically competitive with the variational methods, such as that using the Hylleraas-type basis functions. Numerical comparisons are made to demonstrate the efficiency of this approach, by calculating the nonrelativistic and infinite-nuclear-mass limit of the ground state energy of the helium atom. The exponential convergency of this approach is due to the full matching between the analytical structure of the basis functions that are used in this paper and the true wavefunction. This full matching was not reached by most other methods. For example, the variational method using the Hylleraas-type basis does not reflects the logarithmic singularity of the true wavefunction at the origin as predicted by Bartlett and Fock. Two important approaches are proposed in this work to reach this full matching: the coordinate transformation method and the asymptotic series method. Besides these, this work makes use of the least square method to substitute complicated numerical integrations in solving the Schr?dinger equation without much loss of accuracy, which is routinely used by people to fit a theoretical curve with discrete experimental data, but here is used to simplify the computation.展开更多
The uniaxial perfectly matched layer (PML) method uses rectangular domain to define the PML problem and thus provides greater flexibility and efficiency in deal- ing with problems involving anisotropic scatterers.In t...The uniaxial perfectly matched layer (PML) method uses rectangular domain to define the PML problem and thus provides greater flexibility and efficiency in deal- ing with problems involving anisotropic scatterers.In this paper an adaptive uniaxial PML technique for solving the time harmonic Helmholtz scattering problem is devel- oped.The PML parameters such as the thickness of the layer and the fictitious medium property are determined through sharp a posteriori error estimates.The adaptive finite element method based on a posteriori error estimate is proposed to solve the PML equa- tion which produces automatically a coarse mesh size away from the fixed domain and thus makes the total computational costs insensitive to the thickness of the PML absorb- ing layer.Numerical experiments are included to illustrate the competitive behavior of the proposed adaptive method.In particular,it is demonstrated that the PML layer can be chosen as close to one wave-length from the scatterer and still yields good accuracy and efficiency in approximating the far fields.展开更多
The spectra of matching polynomials which are useful in the computations of resonance energy and grand canonical partition functions of molecular's. It also present other properties for certain classes of graphs a...The spectra of matching polynomials which are useful in the computations of resonance energy and grand canonical partition functions of molecular's. It also present other properties for certain classes of graphs and lattices. In [1] Balasubramanian calculates several matching polynomials and matching roots of several molecular graphs. He found that the matching polynomial of C_6, C_(10), C_(14), C_(18) and C_(22) are divided by x^2-2. In this note,we prove that x^2-2 divides MC_(4k+2)(x), k = 1, 2,..., n and obtain some other properties of matching polynomials of paths and cycles.展开更多
In any group,the project’s members want to create the highest value for the common goal,and how to choose project’s members could be a game.This study investigated the cooperating with education institutions.Analysi...In any group,the project’s members want to create the highest value for the common goal,and how to choose project’s members could be a game.This study investigated the cooperating with education institutions.Analysis of the players’strategic choices and relative outcomes was conducted.The researchers would organize a simple tree model and sort to payoff matrix.The results revealed that the strategy of each player is different finally.There were two strategies for selecting a member-'Choosing Good Friendship player'and'Choosing Good Ability player'.Furthermore,this study also analyzed the influencing factors and stable matching possibility among the factors.展开更多
Using the method of matched asymptotic expansions, the shock solutions for a class of singularly perturbed nonlinear problems are discussed. The relation of the shock solutions and their boundary conditions is obtaine...Using the method of matched asymptotic expansions, the shock solutions for a class of singularly perturbed nonlinear problems are discussed. The relation of the shock solutions and their boundary conditions is obtained. And the known results are generalized.展开更多
The existence of a global minimizer for a variational problem arising in registration of diffusion tensor images is proved, which ensures that there is a regular spatial transformation for the registration of diffusio...The existence of a global minimizer for a variational problem arising in registration of diffusion tensor images is proved, which ensures that there is a regular spatial transformation for the registration of diffusion tensor images.展开更多
We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, and prove that the ...We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, and prove that the basic solutions of LP-relaxation are half-integral. It is shown that a fractional basic solution can be further processed to obtain an optimal solution to the problem.展开更多
In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing ti...In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing time pj = 1. We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them. Then we further consider a problem on unrelated processors.展开更多
Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is ...Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.展开更多
In this paper, a new Ky Fan matching theorem is established in noncompact L-convex spaces. As applications, a fixed point theorem and equilibrium existence theorems for systems of general quasiequilibrium problems and...In this paper, a new Ky Fan matching theorem is established in noncompact L-convex spaces. As applications, a fixed point theorem and equilibrium existence theorems for systems of general quasiequilibrium problems and systems of quasiequilibrium problems in noncompact L-convex spaces are obtained.展开更多
The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and ap...The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.展开更多
文摘E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can＇t fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.
文摘A powerful approach to solve the Coulombic quantum three-body problem is proposed. The approach is exponentially convergent and more efficient than the hyperspherical coordinate method and the correlation-function hyperspherical harmonic method. This approach is numerically competitive with the variational methods, such as that using the Hylleraas-type basis functions. Numerical comparisons are made to demonstrate the efficiency of this approach, by calculating the nonrelativistic and infinite-nuclear-mass limit of the ground state energy of the helium atom. The exponential convergency of this approach is due to the full matching between the analytical structure of the basis functions that are used in this paper and the true wavefunction. This full matching was not reached by most other methods. For example, the variational method using the Hylleraas-type basis does not reflects the logarithmic singularity of the true wavefunction at the origin as predicted by Bartlett and Fock. Two important approaches are proposed in this work to reach this full matching: the coordinate transformation method and the asymptotic series method. Besides these, this work makes use of the least square method to substitute complicated numerical integrations in solving the Schr?dinger equation without much loss of accuracy, which is routinely used by people to fit a theoretical curve with discrete experimental data, but here is used to simplify the computation.
文摘The uniaxial perfectly matched layer (PML) method uses rectangular domain to define the PML problem and thus provides greater flexibility and efficiency in deal- ing with problems involving anisotropic scatterers.In this paper an adaptive uniaxial PML technique for solving the time harmonic Helmholtz scattering problem is devel- oped.The PML parameters such as the thickness of the layer and the fictitious medium property are determined through sharp a posteriori error estimates.The adaptive finite element method based on a posteriori error estimate is proposed to solve the PML equa- tion which produces automatically a coarse mesh size away from the fixed domain and thus makes the total computational costs insensitive to the thickness of the PML absorb- ing layer.Numerical experiments are included to illustrate the competitive behavior of the proposed adaptive method.In particular,it is demonstrated that the PML layer can be chosen as close to one wave-length from the scatterer and still yields good accuracy and efficiency in approximating the far fields.
基金Supported by the Natural Science Foundation of the People’s Republic of China under Grant（11571252）
文摘The spectra of matching polynomials which are useful in the computations of resonance energy and grand canonical partition functions of molecular's. It also present other properties for certain classes of graphs and lattices. In [1] Balasubramanian calculates several matching polynomials and matching roots of several molecular graphs. He found that the matching polynomial of C_6, C_(10), C_(14), C_(18) and C_(22) are divided by x^2-2. In this note,we prove that x^2-2 divides MC_(4k+2)(x), k = 1, 2,..., n and obtain some other properties of matching polynomials of paths and cycles.
文摘In any group,the project’s members want to create the highest value for the common goal,and how to choose project’s members could be a game.This study investigated the cooperating with education institutions.Analysis of the players’strategic choices and relative outcomes was conducted.The researchers would organize a simple tree model and sort to payoff matrix.The results revealed that the strategy of each player is different finally.There were two strategies for selecting a member-'Choosing Good Friendship player'and'Choosing Good Ability player'.Furthermore,this study also analyzed the influencing factors and stable matching possibility among the factors.
基金Supported by the National Natural Science Foundation of China（10471039） Supported by the E-Institutes of Shanghai Municipal Education Commission（E03004） Supported by the Natural Science Foundation of Zhejiang Province（Y606268）
文摘Using the method of matched asymptotic expansions, the shock solutions for a class of singularly perturbed nonlinear problems are discussed. The relation of the shock solutions and their boundary conditions is obtained. And the known results are generalized.
基金supported by NSFC under grant No.11471331partially supported by National Center for Mathematics and Interdisciplinary Sciences
文摘The existence of a global minimizer for a variational problem arising in registration of diffusion tensor images is proved, which ensures that there is a regular spatial transformation for the registration of diffusion tensor images.
文摘We consider a variation of the maximum bipartite matching problem where each completed task must have at least two agents assigned to it. We give an integer programming formulation for the problem, and prove that the basic solutions of LP-relaxation are half-integral. It is shown that a fractional basic solution can be further processed to obtain an optimal solution to the problem.
文摘In this paper, we first consider the position restriction scheduling problems on a single machine. The problems have been solved in certain special cases, especially for those obtained by restricting the processing time pj = 1. We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them. Then we further consider a problem on unrelated processors.
文摘Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.
基金Supported by the Natural Science Foundation of Guizhou Province (Grant No.[2011]2093)the Natural Science Research Foundation of Guizhou Provincial Education Department (Grant No.2008072)
文摘In this paper, a new Ky Fan matching theorem is established in noncompact L-convex spaces. As applications, a fixed point theorem and equilibrium existence theorems for systems of general quasiequilibrium problems and systems of quasiequilibrium problems in noncompact L-convex spaces are obtained.
文摘The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.
