最佳化问题

Keywords Closed convex cone;gradient projection method;Least-squares solution;Inverse matrix problem;Inverse eigenvalue problem;Matrix completion problem;Optimal approximation

Article From 湖南大学；应用数学博士论文 2005年度闭凸锥；投影梯度法；最小二乘解；矩阵反问题；矩阵逆特征值问题；矩阵完全化；最佳逼近

The method is also used in the solution of inverse problem of environmental hydraulics and a satisfactory result is achieved by using this method.

重点的讨论了不适定问题的正则化方法，在此基础上，构造了一个求解不适定问题的最佳摄动迭代法，并把它应用在环境水力学反问题的求解中，取得了满意的结果。

In this paper, we used the regularization method and the best disturbed iteration to solve such more extensive equations: every kind of positive problems and inverse problems of the hyperbolic partial differential equation and parabolic equation. We give homologous methods to solve the positive problems and inverse problems of nonlinear Burgers equation and Boussinesq equation.

本文应用正则化方法和最佳摄动量法，解决了一类更广泛的双曲型和抛物型偏微分方程的各类正问题及反问题，对非线性的Burgers方程及Boussinesq方程的正问题及反问题，也给出了相应的求解方法。

The main achievements of this dissertation are as follows: Let W be a nonsingular matrix. 1. Problem I and Problem II are considered under the matrix set S is as the following: 1 the set of real W-symmetrizable matrices; 2 the set of real W-symmetrizable nonnegative definite matrices; 3 the set of real W-symmetrizable matrices on the linear manifold.

对于问题I和问题II，本文就S是W可对称化矩阵集合、W可对称非负定化矩阵集合以及线性流形上W可对称化矩阵集合等三种情况进行了研究，分别给出了这三种情况下问题I的解存在的充分必要条件，以及解集合的通式表达式，给出了这三种情况下的最佳逼近解，并提供了相应的数值算法和数值实例。

This research which extends the new product supply chain model of Bulter et al. considers issues on global logistics from a more integrated view. First of all, it solves the global logistic settings problem in new product development by means of mixed-integer linear programming. Secondly, it uses the scenario-based robust optimization to lower the risk in the supply chain design. Then it adds the reliability calculation to make up for the gap between the plan and the real operation. At last it calculates and analyzes the quantitative model on the basis of the case data.

本研究延伸Butler等人之新产品供应链模式，考量更完整之全球运筹相关议题，透过混合整数线性规划描述新产品发展时全球运筹配置问题，并利用情境为基础的稳健最佳化以取得低风险的供应链配置，此外加入可靠度的影响，以弥补供应链规划与实际操作的差距，并加入缺货之惩罚成本，最后以范例资料进行计算与分析此数量模式，经由模式计算结果发现本研究规划之结果，相较於原Butler等人之模式有较低的缺货的发生可能性，且所求得之配置整体可靠度皆有所提升。

Vitrification, chlorosis, scale-shaped differentiation and failure to root of regenerated shoots frequently occur in industrialized production of tetraploid watermelon Citrullus vulgaris L.

西瓜四倍体工厂化生产中存在试管苗玻璃化、黄化死亡、鳞片状分化、不生根等不利问题，在MS中NH4NO3 含量减半的情况下，前两者可得到有效的控制；用连续增殖、连续壮苗的方法，解决了西瓜四倍体鳞片状分化的难题；用茎尖扩繁的最佳培养基为MS(含半量NH4NO3 )+2 。

A pivotal problem to recognize of the precise position of laser facula has been solved in the process of design work: Firstly the method of background-subtraction is used to eliminate or weaken the affect of background light. Secondly the image threshold segmentation operation and morphologic operation are used to locate the sketchy position of laser facula ; Then the new method of Extracting Edge are designed based on character of laser facula , by using this method in the search area the edges of laser facula can be extracted effectively; At last the optimum picture of laser facular is selected by using the triggering function of hardware and function of software. The exact result can be obtained only by image processing to optimum picture.

在设计过程中解决了精确确定激光斑中心位置这一关键问题：首先利用减背景法，消除或减弱背景光的变化对确定激光光斑中心的影响；再对减完背景后的图片进行阈值分割和二值化处理以确定激光光斑的粗略位置；根据本文激光光斑的特征，设计了一个有效的边界提取算法，对指定区域进行提取激光光斑边界操作，精确的确定激光斑中心位置；最后利用硬件的触发功能和软件编程实现了激光光斑最佳图片的判读，只有对最佳图片进行图像处理得到结果才是准确的。

In terms of luminance performance of BLUs, there shows no much difference between V-cut and U-cut microstructures from simulation results. However, U-cut microstructure outperforms V-cut one in luminance uniformity.

另外在整体BLU辉度并未因入光侧添加微结构而有大幅的变化及差异的前提下，U-cut纵沟微结构的使用效果会比V-cut纵沟微结构来的好，除了在入光测量测点均齐度提升略胜一筹外，其入光侧明暗不均问题亦可处理地更为淡化，以达到光学及品味之最佳化。

Maximum likelihood detector is the optimal detector and has the best performance. The challenge of MLD is the high computational complexity. K-Best decoding algorithm has been proposed to reduce the computational complexity. K-Best decoder algorithm computes Partial Euclidean Distance and only keeps the best K nodes that have the smallest accumulated PEDs. After completing breadth-first tree search, we will have K leaves with the smallest PEDs.

最大相似度侦测法是公认最佳化的演算法，有著最好的侦测效能，但运算复杂度将会随著调变群集和传送天线数目大小而呈指数型增加。K-Best球型解码演算法因而被提出来，得到近似最大相似度侦测法的结果，解决最大相似度侦测法运算复杂度过高的问题。K-Best球型解码演算法在计算完部份欧几里德距离后，需要取最小K个值做为候选点，再往下层去找候选点。

The buildups are extracted from the GIS map and are shown in pink.

凉州街以南来处理涵盖及干扰问题的最佳化计算。我们从GIS的地图中取得本区的建筑物资料。

Finally, according to market conditions and market products this article paper analyzes the trends in the development of camera technology, and designs a color night vision camera.

最后根据市场情况和市面上产品的情况分析了摄像机技术的发展趋势，并设计了一款彩色夜视摄像机。

Only person height weeds and the fierce looks stone idles were there.

只有半人深的荒草和龇牙咧嘴的神像。