Global Optimization of a Quadratic Functional with Quadratic Equality Constraints, Part 2

In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here).     

The complementary unboundedness of dual feasible solution sets in convex programming

F.E. Clark has shown that if at least one of the feasible solution sets for a pair of dual linear programming problems is nonempty then at least one of them is both nonempty and unbounded. Subsequently, M. Avriel and A.C. Williams have obtained the same result in the more general context of (prototype posynomial) geometric programming. In this paper we show that the same result is actually false in the even more general context of convex programming — unless a certain regularity condition is satisfied.We also show that the regularity condition is so weak that it is automatically satisfied in linear programming (prototype posynomial) geometric programming, quadratic programming (with either linear or quadratic constraints),l _p -regression analysis, optimal location, roadway network analysis, and chemical equilibrium analysis. Moreover, we develop an equivalent regularity condition for each of the usual formulations of duality.Research sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR-73-2516.     

周期分析法在棉红蜘蛛发生程度预测中的应用

本文应用周期分析方法对江陵县棉红蜘蛛—朱砂叶螨的预测预报技术作了新的尝试．经对江陵县３６年历史资料拟合，符合率高达９４．４％．运用这一技术对该县１９８７—１９９６年棉红蜘蛛发生程度进行了１０年长期预测预报．     

Data Envelopment Analysis of multiple response experiments

Taguchi method is the usual strategy in robust design and involves conducting experiments using orthogonal arrays and estimating the combination of factor levels that optimizes a given performance measure, typically a signal-to-noise ratio. The problem is more complex in the case of multiple responses since the combinations of factor levels that optimize the different responses usually differ. In this paper, an Artificial Neural Network, trained with the experiments results, is used to estimate the responses for all factor level combinations. After that, Data Envelopment Analysis (DEA) is used first to select the efficient (i.e. non-dominated) factor level combinations and then for choosing among them the one which leads to a most robust quality loss penalization. Mean Square Deviations of the quality characteristics are used as DEA inputs. Among the advantages of the proposed approach over traditional Taguchi method are the non-parametric, non-linear way of estimating quality loss measures for unobserved factor combinations and the non-parametric character of the performance evaluation of all the factor combinations. The proposed approach is applied to a number of case studies from the literature and compared with existing approaches.     

A semi-oriented radial measure for measuring the efficiency of decision making units with negative data,using DEA

Data Envelopment Analysis (DEA) is a nonparametric method for measuring the efficiency of a set of decision making units such as firms or public sector agencies, first introduced into the operational research and management science literature by Charnes, Cooper, and Rhodes (CCR) [Charnes, A., Cooper, W.W., Rhodes, E., 1978. Measuring the efficiency of decision making units. European Journal of Operational Research 2, 429–444]. The original DEA models were applicable only to technologies characterized by positive inputs/outputs. In subsequent literature there have been various approaches to enable DEA to deal with negative data.     

Gauge invariance,charge conservation,and variational principles

We present new results on the correspondence between symmetries, conservation laws and variational principles for field equations in general non-abelian gauge theories. Our main result states that second order field equations possessing translational and gauge symmetries and the corresponding conservation laws are always derivable from a variational principle. We also show by the way of examples that the above result fails in general for third order field equations.     

QuantBasic软件用于红外光谱定量分析

化学计量学原理引入到红外光谱学后 ,使得红外光谱定量分析有了突破性进展。利用 MB15 4S型FTIR光谱仪专配的 Quant Basic定量软件 ,对红外光谱定量分析中基线取法进行了研究 ,并得出最优方法。通过对己二酸进行定量分析 ,验证了此软件对混合物中单组分定量不仅操作简便 ,快速可行 ,而且简化了训练集的建立和样品前处理     

在轨光学遥感仪器探测灵敏度的建模分析与应用

在分析光学遥感仪器探测信息中主要噪音源的基础上,提出了一种改进空间结构函数分析的仪器探测灵敏度在轨评价方法,包括：基于多项式递推分解的整体噪音估计模型,以及减小系统误差及修正模数转换噪音影响等基本技术途径.仿真结果证实,该改进算法的噪音估计准确度优于传统的高斯估计和基于外推的结构函数分析方法.针对实际观测数据,在去除模数转换噪音影响后,仪器噪音等效温度差指标的在轨评价准确度可达±0.05 K.该评价方法已在FY-2D静止气象卫星在轨测试中得到成功应用.     

Community structure and modularity in networks of correlated brain activity

Functional connectivity patterns derived from neuroimaging data may be represented as graphs or networks, with individual image voxels or anatomically-defined structures representing the nodes, and a measure of correlation between the responses in each pair of nodes determining the edges. This explicit network representation allows network-analysis approaches to be applied to the characterization of functional connections within the brain. Much recent research in complex networks has focused on methods to identify community structure, i.e. cohesive clusters of strongly interconnected nodes. One class of such algorithms determines a partition of a network into 'sub-networks' based on the optimization of a modularity parameter, thus also providing a measure of the degree of segregation versus integration in the full network. Here, we demonstrate that a community structure algorithm based on the maximization of modularity, applied to a functional connectivity network calculated from the responses to acute fluoxetine challenge in the rat, can identify communities whose distributions correspond to anatomically meaningful structures and include compelling functional subdivisions in the brain. We also discuss the biological interpretation of the modularity parameter in terms of segregation and integration of brain function.