Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index str...Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space.Studies have been conducted on the bulk loading of large datasets in an M-tree.However,because previous algorithms involve excessive distance computations and disk accesses,they perform poorly in terms of their index construction and search capability.This study proposes two efficient M-tree bulk loading algorithms.Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve,thereby significantly improving the index construction and search performance.Our second algorithm is an extension of the first,and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance.Through the use of various synthetic and real-world datasets,the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.展开更多
Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In ...Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In order to solve these problems,a toolpath generation method of NC milling based on space-filling curve is proposed. First,T-spline surface is regarded as the modeling surface,the grid,which is based on the limited scallop-height,can be got in the parameter space,and the influence value of grid node is determined. Second,a box is defined and planned,and the tool paths are got preliminarily,which is based on minimal spanning tree; Finally,based on an improved chamfering algorithm,the whole tool paths are got. A simulation system is developed for computer simulation,and an experiment is carried out to verify the method. The results of simulation and experiment show that the method is effective and feasible,and length and time of the tool paths are reduced.展开更多
When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more...When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more accurate model,a surrogate model can be built on the basis of some fast special model and knowledge of previous calculations obtained by more accurate base models from various test bases or some results of serial calculations.The objective of this work is to construct a surrogate model which allows to improve the accuracy of turbulent calculations obtained by a special model on unstructured meshes.For this purpose,we use 1D Convolutional Neural Network(CNN)of the encoder-decoder architecture and reduce the problem to a single dimension by applying space-filling curves.Such an approach would have the benefit of being applicable to solutions obtained on unstructured meshes.In this work,a non-local approach is applied where entire flow fields obtained by the special and base models are used as input and ground truth output respectively.Spalart-Allmaras(SA)model and Near-wall Domain Decomposition(NDD)method for SA are taken as the base and special models respectively.The efficiency and accuracy of the obtained surrogate model are demonstrated in a case of supersonic flow over a compression corner with different values for angleαand Reynolds number Re.We conducted an investigation into interpolation and extrapolation by Re and also into interpolation byα.展开更多
The hyper Hilbert transform Tnf（x） =∫-1^1 f（x - Γ（t））e^-i｜t｜-β｜t｜^-1-αdt along an appropriate curve Γ（t） on R^n is investigated,where β 〉 α 〉 0.An L^p boundedness theorem of T4 is obtained,which i...The hyper Hilbert transform Tnf（x） =∫-1^1 f（x - Γ（t））e^-i｜t｜-β｜t｜^-1-αdt along an appropriate curve Γ（t） on R^n is investigated,where β 〉 α 〉 0.An L^p boundedness theorem of T4 is obtained,which is an extension of some earlier results of n = 2 and n = 3.展开更多
This paper considers the Riemann-Hilbert problem for linear mixed（elliptichyperbolic） complex equations of first order with degenerate curve in a simply connected domain. We first give the representation theorem and...This paper considers the Riemann-Hilbert problem for linear mixed（elliptichyperbolic） complex equations of first order with degenerate curve in a simply connected domain. We first give the representation theorem and uniqueness of solutions for such boundary value problem. Then by using the methods of successive iteration and parameter extension, the existence of solutions for this problem is proved.展开更多
基金the National Research Foundation of Korea(NRF,www.nrf.re.kr)grant funded by the Korean government(MSIT,www.msit.go.kr)(No.2018R1A2B6009188)(received by W.-K.Loh).
文摘Many database applications currently deal with objects in a metric space.Examples of such objects include unstructured multimedia objects and points of interest(POIs)in a road network.The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space.Studies have been conducted on the bulk loading of large datasets in an M-tree.However,because previous algorithms involve excessive distance computations and disk accesses,they perform poorly in terms of their index construction and search capability.This study proposes two efficient M-tree bulk loading algorithms.Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve,thereby significantly improving the index construction and search performance.Our second algorithm is an extension of the first,and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance.Through the use of various synthetic and real-world datasets,the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.
基金Supported by the National Natural Science Foundation of China(No.51575143)
文摘Tool path generated by space-filling curve always turns frequently causing trembling to machine,reducing toollife and affecting workpiece quality. Length and generation time of tool paths are both relatively long. In order to solve these problems,a toolpath generation method of NC milling based on space-filling curve is proposed. First,T-spline surface is regarded as the modeling surface,the grid,which is based on the limited scallop-height,can be got in the parameter space,and the influence value of grid node is determined. Second,a box is defined and planned,and the tool paths are got preliminarily,which is based on minimal spanning tree; Finally,based on an improved chamfering algorithm,the whole tool paths are got. A simulation system is developed for computer simulation,and an experiment is carried out to verify the method. The results of simulation and experiment show that the method is effective and feasible,and length and time of the tool paths are reduced.
文摘When carrying out calculations for turbulent flow simulation,one inevitably has to face the choice between accuracy and speed of calculations.In order to simultaneously obtain both a computationally efficient and more accurate model,a surrogate model can be built on the basis of some fast special model and knowledge of previous calculations obtained by more accurate base models from various test bases or some results of serial calculations.The objective of this work is to construct a surrogate model which allows to improve the accuracy of turbulent calculations obtained by a special model on unstructured meshes.For this purpose,we use 1D Convolutional Neural Network(CNN)of the encoder-decoder architecture and reduce the problem to a single dimension by applying space-filling curves.Such an approach would have the benefit of being applicable to solutions obtained on unstructured meshes.In this work,a non-local approach is applied where entire flow fields obtained by the special and base models are used as input and ground truth output respectively.Spalart-Allmaras(SA)model and Near-wall Domain Decomposition(NDD)method for SA are taken as the base and special models respectively.The efficiency and accuracy of the obtained surrogate model are demonstrated in a case of supersonic flow over a compression corner with different values for angleαand Reynolds number Re.We conducted an investigation into interpolation and extrapolation by Re and also into interpolation byα.
基金Supported by the National Natural Science Foundation of China (1057115610701064)+1 种基金ZJNSF (RC97017)the Zijin Project of Zhejiang University
文摘The hyper Hilbert transform Tnf（x） =∫-1^1 f（x - Γ（t））e^-i｜t｜-β｜t｜^-1-αdt along an appropriate curve Γ（t） on R^n is investigated,where β 〉 α 〉 0.An L^p boundedness theorem of T4 is obtained,which is an extension of some earlier results of n = 2 and n = 3.
基金Supported by the National Natural Science Foundation of China (10971224)
文摘This paper considers the Riemann-Hilbert problem for linear mixed（elliptichyperbolic） complex equations of first order with degenerate curve in a simply connected domain. We first give the representation theorem and uniqueness of solutions for such boundary value problem. Then by using the methods of successive iteration and parameter extension, the existence of solutions for this problem is proved.
