三江源区不同土壤类型有机质含量高光谱反演

近年来高光谱遥感技术被广泛运用于土壤有机质含量反演的研究中。基于三江源区玉树县和玛多县采集的146个土壤样品的室内ASD FieldSpec 4实测光谱数据及4种变换形式,利用偏最小二乘回归(PLSR)和人工神经网络(ANN)建立土壤有机质含量高光谱预测模型。结果表明:ANN模型反演土壤有机质含量的整体精度高于PLSR模型,总均方根误差均在17.51以下;但是,不同土壤类型的最佳反演模型及指标却有所差异:高山草甸土和沼泽土的最佳反演模型和指标均为ANN模型和BD指标,模型总均方根误差分别为10.29和3.29;高山草原土的最佳反演模型是PLSR模型,最佳指标是REF指标,模型总均方根误差为5.59;山地草甸土的最佳反演模型为〖JP2〗PLSR模型,最佳指标为BD指标,模型总均方根误差为4.68。研究发现,利用ANN模型和PLSR模型都能较好地预测三江源区4种土壤类型的有机质含量,而波段深度则是该区域的最佳反演指标。〖JP〗
     

ACS算法在矩形件优化排料中的应用

矩形件优化排料是一类具有NP完全难度的组合优化问题。有关的优化问题可用与或树来描述,这样就把矩形件优化排料问题变换为寻找一棵面积比率最大的二叉树。用ACS算法实现这种树搜索,是把一定数量的人工蚂蚁分布在与或树的根节点,人工蚂蚁间通过使用信息素相互交流,完成从与或树到二叉树的选择,从而得到矩形件优化排料问题的优化解。     

Efficient Determination of Four-Point Form-Closure Optimal Constraints of Polygonal Objects

This paper proposes a new and more efficient solution to the problem of determining optimal form-closure constraints of polygonal objects using four contacts. New grasp parameters are determined based only on the directions of the applied forces, which are then used to determine the optimal grasp. Given a set of contact edges, using an analytical procedure a solution that is either the optimal one or is very close to it is obtained (only in this second case an iterative procedure is needed to find a root of a nonlinear equation). This procedure is used for an efficient determination of the optimal grasp on the whole object. The algorithms have been implemented and numerical examples are shown.     

Comments on and modifications to ‘ On the asymptotic behaviour of optimal root loci’

The method developed by Kouvaritakis to find the asymptotic behaviour of optimal root loci is modified to make it more efficient.     

On the computation of a matrix inverse square root

The inverse square root of a matrix plays a role in the computation of an optimal symmetric orthogonalization of a set of vectors. We suggest two iterative techniques to compute an inverse square root of a given matrix. The two schemes are analyzed and their numerical stability properties are investigated.     

A Study of the infinite horizon ‘solution’ of inventory lot size models with a linear demand function

The article studies the infinite time horizon inventory lot size model with a linear demand function. The pertinent costs are the carrying and order costs, shortages are prohibited, and replenishments are instantaneous. The problem is to minimize the total cost by exhibiting a schedule of optimal replenishment times.The computerized asymptotic solution suggested here is a generalization of the classical square root law and the more recent cubic root law. Due to its broader usefulness, it should preponderate previously known results.     

Interval bounds for square roots and cube roots

The smallest machine representable interval containing the square root of a given machine representable number is sought. Assuming binary computers with optimal upward directed rounding, it is shown bya priori methods of error analysis that this interval may be obtained via Newton's method without using interval arithmetic. Less sharp but still useful results are obtained for the cube root.     

Optimal performance of CMOS compatible IR thermoelectric sensors

This paper presents a theoretical and empirical study of the optimal performance of CMOS compatible infrared thermoelectric sensors with varying pixel area and different aspect ratio of the pixels for two possible sensor structures: cantilever and bridge types. Optimal performance is analyzed analytically, using simplifying assumptions. This analysis is verified by comparing with the exact simulations as well as by comparing with measured results. The resistance of optimized sensors in the sense of minimal noise equivalent power (NEP) is shown to be independent of aspect ratio, but proportional to the third root of the pixel area. The product of the optimal NEP and the square root of the time constant is shown to be constant with varying aspect ratios, while the same applies with the time constant to the power of 3/8 for varying areas. The measured sensors exhibit NEP's down to 13.5 nW in a 300-Hz bandwidth and time constants up to 30 ms     

Optimal sequential and distributed fusion for state estimation in cross-correlated noise

This paper is concerned with the optimal state estimation for linear systems when the noises of different sensors are cross-correlated and also coupled with the system noise of the previous step. We derive the optimal linear estimation in a sequential form and for distributed fusion. They are both compared with the optimal batch fusion, suboptimal batch fusion, suboptimal sequential fusion, and the suboptimal distributed fusion where the cross-correlation between the noises are neglected. The comparison is in terms of theoretical filter mean square error and the real root mean square error. Simulation on a target tracking example is given to show the effectiveness of the presented algorithms.     

履带车辆半主动悬架控制系统硬件设计

研究了履带式车辆单轮悬挂模型的车体加速度均方根值特性,提出了一种最优阻尼的控制策略,同时给出了按此控制策略研制的履带式车辆半主动悬架控制系统的硬件设计及其典型特点。经过实际的试验,进一步证实了半主动悬挂系统能有效地减小车体的加速度均方根值,从而提高了车辆平顺性。     

Optimal Source Selection in Shooting Random Walk Monte Carlo Radiosity

In this paper we study how to optimally select between different sources in shooting random walk Monte Carlo Radiosity. Until now the probability of selecting a source has been made proportional to the importance of that source for the region of interest. We will show here that, whenever the transition probabilities are the Form Factors, this is not optimal, and will consequently give the optimal case. This will correspond to probabilities proportional to the square root of importances, rather than to importances themselves.     

基于地形网格化和遗传算法的MLAT基站选址研究

针对不同多点定位（Mulilateration,MLAT）地面站的布站方式对定位精度影响的问题,提出一种基于地形实际计算最优布站方式的方法。该方法结合实际地形因素,构建地形网格化模型生成初始可选站点,通过XDraw算法计算地面基站的覆盖性对初始站点进行初筛,再结合遗传算法计算最优布站组合。最后选取不规则图形区域进行选址实验验证,在选址区域内随机生成地形,通过初筛减少初始可选点,得到布站方式,并计算几何精度因子和多点定位均方根误差,与传统布站方式进行比较。实验数据表明,该方法计算得出的布站组合与传统布站方式相比,多点定位均方根误差要比传统布站中最小的菱形布站减小4.015 9 m,且该方法可用于实际考虑地形因素的MLAT最优基站选址。     

基于实数多项式的根值最小范数算法

在根值最小范数算法中须对复数多项式求根,计算量较大。针对此问题,提出了一种基于实数多项式的根值最小范数算法,该算法适用于均匀线性阵列。首先通过保角变换将分布在复平面单位圆的变量映射到实数轴的[-1,1]范围内,其能够将算法中的复数多项式转换为实数多项式;其次对该实数多项式求根,并从中选出[-1,1]范围内的根值;最后将筛选出的根值代入信号频谱函数中,根据频谱函数的值选择出最优的波达方向估值。理论分析说明本文算法比根值最小范数算法的时间复杂度低;仿真实验表明,与根值最小范数相比,在信号和噪声不相关时,本文算法的均方根误差略小,在信号和噪声相关时,随着信噪比的增加,本文算法的均方根误差逐渐变小。     

Optimal multiway search trees for variable size keys

Summary This paper considers the construction of optimal search trees for a sequence of n keys of varying sizes, under various cost measures. Constructing optimal search cost multiway trees is NP-hard, although it can be done in pseudo-polynomial time O ³ and space O ², where L is the page size limit. An optimal space multiway search tree is obtained in O ³ time and O ² space, while an optimal height tree in O(n ² log² n) time and O(n) space both having additionally minimal root sizes. The monotonicity principle does not hold for the above cases. Finding optimal search cost weak B-trees is NP-hard, but a weak B-tree of height 2 and minimal root size can be constructed in O(n log n) time. In addition, if its root is restricted to contain M keys then a different algorithm is applied, having time complexity O(nM log n). The latter solves a problem posed by McCreight.     

Direct singular perturbation analysis of high-gain and cheap control problems

A new and direct approach to the analysis and design of high-gain feedback and cheap control problems is developed. Transformation of such singular problems to singular perturbation models of conventional type early at the onset of analysis or design allows a direct application of the readily available singular perturbation literature. The approach permits a simple characterization of (a) multivariable root loci under a high-gain feedback and (b) asymptotic behavior of optimal closed loop poles, state and control trajectories, performance index and optimal transfer function as the control cost coefficient in the performance index goes to zero.     

Discrete observability and numerical quadrature

The author consider the problem of approximate observability of a one-dimensional diffusion equation on a finite spatial domain with spatial point measurements. The problem of the optimal selection of the measurement points is considered under three conditions: (1) no preassigned measurement nodes; (2) one preassigned node and; (3) two preassigned nodes. The main observation is that the optimal choice is related to three classical procedures in numerical analysis: (1) Gaussian quadrature; (2) Radau quadrature and; (3) Lobatto quadrature. It is shown that the existence of the Radau and Lobatto quadrature is closely related to classical root locus theory     

Optimal absolute error starting values for Newton-Raphson calculation of square root

The problem of obtaining optimal starting values for the calculation of square root using Newton-Raphson's Method is considered. This paper presents the best starting values theory in order to optimize the maximum absolute error after a given number of iterations. Two different methods are shown, and a third, which can be considered as a mixture of the previous two, is briefly discussed. The approach combines analytical and numerical methodologies, which gives more interesting results on the main characteristics of the behavior of the absolute error for different initializations. A comparison table between the traditional optimal relative error results and the absolute error ones is provided.     

The zeros of linear optimal control systems and their role in high feedback gain stability design

The finite zeros of the open-loop transfer function matrix of the optimal controller of the multiinput time-invariant regulator problem are found to be the eigenvalues of a negative real matrix. The infinite zeros of the transfer function matrix are all real. Using the root loci technique recently developed for multivariable systems, these properties of the zeros provide means of designing stable, not necessarily optimal, high feedback gain systems under significant parameter uncertainty.     

A triparametric family of three-step optimal eighth-order methods for solving nonlinear equations

A new triparametric family of three-step optimal eighth-order iterative methods free from second derivatives are proposed in this paper, to find a simple root of nonlinear equations. Convergence analysis as well as numerical experiments confirms the eighth-order convergence and asymptotic error constants.