The Luzon Strait is the only deep channel that connects the South China Sea(SCS) with the Pacific.The transport through the Luzon Strait is an important process influencing the circulation,heat and water budgets of th...The Luzon Strait is the only deep channel that connects the South China Sea(SCS) with the Pacific.The transport through the Luzon Strait is an important process influencing the circulation,heat and water budgets of the SCS.Early observations have suggested that water enters the SCS in winter but water inflow or outflow in summer is quite controversial.On the basis of hydrographic measurements from CTD along 120° E in the Luzon Strait during the period from September 18 to 20 in 2006,the characteristics of temperature,salinity and density distributions are analyzed.The velocity and volume transport through the Luzon Strait are calculated using the method of dynamic calculation.The major observed results show that water exchanges are mainly from the Pacific to the South China Sea in the upper layer,and the flow is relatively weak and eastward in the deeper layer.The net volume transport of the Luzon Strait during the observation period is westward,amounts to about 3.25 Sv.This result is consistent with historical observations.展开更多
Movement accuracy is the key factor to be considered in designing precision instrument linkage and mini-linkage mechanisms. Although manufacturing errors, elastic deformation, kinematic pair clearance and friction fac...Movement accuracy is the key factor to be considered in designing precision instrument linkage and mini-linkage mechanisms. Although manufacturing errors, elastic deformation, kinematic pair clearance and friction factors all will have synthesis effect on the position accuracy of the mechanical system, the essential factor to guarantee the movement precision remains the kinematic dimensions. Combining the classical theory of mechanical synthesis with the modern error theory and the numerical method, the authors put forward a systematic and complete process and method of computer aided design for the instrument crank-coupler mechanism in which the follower takes the linear displacement approximately within a certain limited domain, with the design result of least transmission ratio error.展开更多
The authors present an algorithm which is a modilication of the Nguyen-Stenle greedy reduction algorithm due to Nguyen and Stehle in 2009. This algorithm can be used to compute the Minkowski reduced lattice bases for ...The authors present an algorithm which is a modilication of the Nguyen-Stenle greedy reduction algorithm due to Nguyen and Stehle in 2009. This algorithm can be used to compute the Minkowski reduced lattice bases for arbitrary rank lattices with quadratic bit complexity on the size of the input vectors. The total bit complexity of the algorithm is O（n^2·（4n!）^n·（n!/2^n）^n/2·（4/3）^n（n-1）/2）.log^2 A）where n is the rank of the lattice and A is maximal norm of the input base vectors. This is an O（log^2 A） algorithm which can be used to compute Minkowski reduced bases for the fixed rank lattices. A time complexity n!. 3n（log A）^O（1） algorithm which can be used to compute the successive minima with the help of the dual Hermite-Korkin-Zolotarev base was given by Blomer in 2000 and improved to the time complexity n!- （log A）^O（1） by Micciancio in 2008. The algorithm in this paper is more suitable for computing the Minkowski reduced bases of low rank lattices with very large base vector sizes.展开更多
This paper investigates the FIR systems identification with quantized output observations and a large class of quantized inputs. The limit inferior of the regressors' frequencies of occurrences is employed to char...This paper investigates the FIR systems identification with quantized output observations and a large class of quantized inputs. The limit inferior of the regressors' frequencies of occurrences is employed to characterize the input's persistent excitation, under which the strong convergence and the convergence rate of the two-step estimation algorithm are given. As for the asymptotical efficiency,with a suitable selection of the weighting matrix in the algorithm, even though the limit of the product of the Cram′er-Rao(CR) lower bound and the data length does not exist as the data length goes to infinity, the estimates still can be asymptotically efficient in the sense of CR lower bound. A numerical example is given to demonstrate the effectiveness and the asymptotic efficiency of the algorithm.展开更多
A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transpo...A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge-bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice.展开更多
基金Supported by the Knowledge Innovation Project of CAS (No KZCX2-YW-214,the NSFC (No 40806010)the National Basic Research Program of China (973 Program) (No 403603)
文摘The Luzon Strait is the only deep channel that connects the South China Sea(SCS) with the Pacific.The transport through the Luzon Strait is an important process influencing the circulation,heat and water budgets of the SCS.Early observations have suggested that water enters the SCS in winter but water inflow or outflow in summer is quite controversial.On the basis of hydrographic measurements from CTD along 120° E in the Luzon Strait during the period from September 18 to 20 in 2006,the characteristics of temperature,salinity and density distributions are analyzed.The velocity and volume transport through the Luzon Strait are calculated using the method of dynamic calculation.The major observed results show that water exchanges are mainly from the Pacific to the South China Sea in the upper layer,and the flow is relatively weak and eastward in the deeper layer.The net volume transport of the Luzon Strait during the observation period is westward,amounts to about 3.25 Sv.This result is consistent with historical observations.
文摘Movement accuracy is the key factor to be considered in designing precision instrument linkage and mini-linkage mechanisms. Although manufacturing errors, elastic deformation, kinematic pair clearance and friction factors all will have synthesis effect on the position accuracy of the mechanical system, the essential factor to guarantee the movement precision remains the kinematic dimensions. Combining the classical theory of mechanical synthesis with the modern error theory and the numerical method, the authors put forward a systematic and complete process and method of computer aided design for the instrument crank-coupler mechanism in which the follower takes the linear displacement approximately within a certain limited domain, with the design result of least transmission ratio error.
基金supported by the National Natural Science Foundation of China (No.10871068)the Danish National Research Foundation and National Natural Science Foundation of China Joint Grant (No.11061130539)
文摘The authors present an algorithm which is a modilication of the Nguyen-Stenle greedy reduction algorithm due to Nguyen and Stehle in 2009. This algorithm can be used to compute the Minkowski reduced lattice bases for arbitrary rank lattices with quadratic bit complexity on the size of the input vectors. The total bit complexity of the algorithm is O（n^2·（4n!）^n·（n!/2^n）^n/2·（4/3）^n（n-1）/2）.log^2 A）where n is the rank of the lattice and A is maximal norm of the input base vectors. This is an O（log^2 A） algorithm which can be used to compute Minkowski reduced bases for the fixed rank lattices. A time complexity n!. 3n（log A）^O（1） algorithm which can be used to compute the successive minima with the help of the dual Hermite-Korkin-Zolotarev base was given by Blomer in 2000 and improved to the time complexity n!- （log A）^O（1） by Micciancio in 2008. The algorithm in this paper is more suitable for computing the Minkowski reduced bases of low rank lattices with very large base vector sizes.
基金supported in part by the National Natural Science Foundation of China under Grant Nos.61174042 and 61403027the National Key Research and Development Program of China(2016YFB0901902)the Open Research Project under Grant No.20160105 from SKLMCCS
文摘This paper investigates the FIR systems identification with quantized output observations and a large class of quantized inputs. The limit inferior of the regressors' frequencies of occurrences is employed to characterize the input's persistent excitation, under which the strong convergence and the convergence rate of the two-step estimation algorithm are given. As for the asymptotical efficiency,with a suitable selection of the weighting matrix in the algorithm, even though the limit of the product of the Cram′er-Rao(CR) lower bound and the data length does not exist as the data length goes to infinity, the estimates still can be asymptotically efficient in the sense of CR lower bound. A numerical example is given to demonstrate the effectiveness and the asymptotic efficiency of the algorithm.
基金supported by Católica del Maule University Through the Project MECESUP–UCM0205
文摘A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge-bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice.
