Dynamical Joining of the solid-state metal is the key technology to realize endless hot rolling. The heating and laser welding method both require long joining time. Based on super deformation method, a 7-bar and 2-sl...Dynamical Joining of the solid-state metal is the key technology to realize endless hot rolling. The heating and laser welding method both require long joining time. Based on super deformation method, a 7-bar and 2-slider mechanism was developed in Japan, and the joining time is less than 0.5 s, however the length of each bar are not reported and this mechanism is complex. A relatively simple 6-bar and 1-slider mechanism is put forward, which can realize the shearing and extrusion motion of the top and bottom blades with a speed approximately equal to the speed of the metal plates. In order to study the kinematics property of the double blades, based on complex vector method, the multi-rigid-body model is built, and the displacement and speed functions of the double blades, the joining time and joining thickness are deduced, the kinematics analysis shows that the initial parameters can＇t satisfy the joining process. Hence, optimization of this mechanism is employed using genetic algorithm（GA） and the optimization parameters of this mechanism are obtained, the kinematics analysis show that the joining time is less than 0.1 s, the joining thickness is more than 80% of the thickness of the solid-state metal, and the horizontal speeds of the blades are improved. A new mechanism is provided for the joining of the solid-state metal and a foundation is laid for the design of the device.展开更多
Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made availabl...Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.展开更多
Optimization techniques are being applied to solve the problems of surface interpolation, approximation, smooth joining and fairing, aiming at corresponding objective functions. This paper focuses on the construction ...Optimization techniques are being applied to solve the problems of surface interpolation, approximation, smooth joining and fairing, aiming at corresponding objective functions. This paper focuses on the construction of fair surface interpolating the given mesh of curved boundaries with G 2 adjustment at comers and G 1, G 2 smoothness between adjacent patches. Many papers on surface blending have been presented, but almost all of them are restricted to the discussion of Bezier patches, there are no good results for B-spline surface. This paper gives a solution to the B-spline surface, allowing the surface to degenerate at comer in and have different parameterization along the common boundary of two patches.展开更多
This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework de...This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework deter-mines the 'optimal' number of joins to be performed in each pipeline. Thedecisions are made based on the cost estimation of the entire processing plan.Two ekisting optimization algorithms are extended under the framework. Ananalytical model is presented and used to compare the quality of plans producedby each optimization algorithm. Our study shows that the new algorithms out-perform their counterparts that are not extended.展开更多
基金Supported by National Natural Science Foundation of China(Grant No.51475139)
文摘Dynamical Joining of the solid-state metal is the key technology to realize endless hot rolling. The heating and laser welding method both require long joining time. Based on super deformation method, a 7-bar and 2-slider mechanism was developed in Japan, and the joining time is less than 0.5 s, however the length of each bar are not reported and this mechanism is complex. A relatively simple 6-bar and 1-slider mechanism is put forward, which can realize the shearing and extrusion motion of the top and bottom blades with a speed approximately equal to the speed of the metal plates. In order to study the kinematics property of the double blades, based on complex vector method, the multi-rigid-body model is built, and the displacement and speed functions of the double blades, the joining time and joining thickness are deduced, the kinematics analysis shows that the initial parameters can＇t satisfy the joining process. Hence, optimization of this mechanism is employed using genetic algorithm（GA） and the optimization parameters of this mechanism are obtained, the kinematics analysis show that the joining time is less than 0.1 s, the joining thickness is more than 80% of the thickness of the solid-state metal, and the horizontal speeds of the blades are improved. A new mechanism is provided for the joining of the solid-state metal and a foundation is laid for the design of the device.
文摘Dynamic programming(DP) is an effective query optimization approach to select an appropriate join order for relational database management system(RDBMS) in multi-table joins. This method was extended and made available in distributed DBMS(D-DBMS). The structure of this optimal solution was firstly characterized according to the distributing status of tables and data, and then the recurrence relations between a problem and its sub-problems were recursively defined. DP in D-DBMS has the same time-complexity with that in centralized DBMS, while it has the capability to solve a much more sophisticated optimal problem of multi-table join in D-DBMS. The effectiveness of this optimal strategy has been proved by experiments.
文摘Optimization techniques are being applied to solve the problems of surface interpolation, approximation, smooth joining and fairing, aiming at corresponding objective functions. This paper focuses on the construction of fair surface interpolating the given mesh of curved boundaries with G 2 adjustment at comers and G 1, G 2 smoothness between adjacent patches. Many papers on surface blending have been presented, but almost all of them are restricted to the discussion of Bezier patches, there are no good results for B-spline surface. This paper gives a solution to the B-spline surface, allowing the surface to degenerate at comer in and have different parameterization along the common boundary of two patches.
文摘This paper proposes a semi-greedy framework for optimizing multi-joinqueries in shared-nothing systems. The plan generated by the framework com-prises several pipelines, each performing several joins. The framework deter-mines the 'optimal' number of joins to be performed in each pipeline. Thedecisions are made based on the cost estimation of the entire processing plan.Two ekisting optimization algorithms are extended under the framework. Ananalytical model is presented and used to compare the quality of plans producedby each optimization algorithm. Our study shows that the new algorithms out-perform their counterparts that are not extended.
