On the Isoperimetric Type Problems with Current Hyperplanes

Analytical approach is presented to the isoperimetric type problems of finding convex figures separated by current hyperplanes.     

切变模量和转动惯量实验的改进

设计了一种基于垂直轴定理的新型吊钩,对切变模量和转动惯量实验进行了改进,使之成为既可测定金属丝切变模量和环、柱等刚体的转动惯量,又可验证反映转动惯量重要性质的平行轴定理及垂直轴定理的多功能实验仪.     

线性互补问题的并行多分裂松弛迭代算法

运用矩阵多重分裂理论,同时考虑并行计算与松弛迭代法,得到一类求解线性互补问题的高效数值算法．当问题的系数矩阵为对角元为正的H-矩阵或对称半正定矩阵时,证明了算法的全局收敛性；该算法与已有算法相比,具有计算量小、计算速度快等特点,因而特别适于求解大规模问题．数值试验的结果说明了算法的有效性．     

Feature Selection using Fuzzy Support Vector Machines

The feature selection consists of obtaining a subset of these features to optimally realize the task without the irrelevant ones. Since it can provide faster and cost-effective learning machines and also improve the prediction performance of the predictors, it is a crucial step in machine learning. The feature selection methods using support machines have obtained satisfactory results, but the noises and outliers often reduce the performance. In this paper, we propose a feature selection approach using fuzzy support vector machines and compare it with the previous work, the results of experiments on the UCI data sets show that feature selection using fuzzy SVM obtains better results than using SVM.     

随机生长误差对双腔型平顶法布里-珀罗滤波器的影响

在光网络中平顶滤波器可以有效地提高信道光检测的快速性和准确性。利用两个法布里珀罗腔间的串联耦合,可以构建出具有平顶透射特性的双腔型法布里珀罗滤波器。采用传输矩阵的方法,研究了随机生长误差对双腔型平顶滤波器透射特性的影响。模拟分析表明,当两个法布里珀罗腔的物理厚度差超过一个纳米时,在透射谱中就会出现两个高度不同的透射峰;解释了实测器件的透射谱中的双峰不对称性;用界面起伏的概念解释了实测滤波器带宽大于理论值的原因。理论分析与实验结果取得了较好的一致。     

Pure adaptive search in monte carlo optimization

Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

First, this paper deals with lagrangean heuristics for the 0-1 bidimensional knapsack problem. A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced by lagrangean heuristics. Thirdly, a variable fixing phase is embedded in the process. Finally, the sequence of 0-1 one-dimensional knapsack instances obtained from the algorithm are solved by using reoptimization techniques in order to reduce the total computational time effort. Computational results are presented.     

线性方程组通解并行数值方法

1预备知识 线性方程组消息传递MIMD算法是20世纪90年代至今的活跃课题，但尚无此问题 的通用有效算法发表.用!.}.}表示矩阵列分块划分，记AX=b为[AI司.定理1、2是文 {l]、[s]成果综述和推广. 定理i[‘]设有线性方程组!e}己l，e〔尺”“m，d〔R”“‘，rank(e)=r.当且仅当rank(!     

How to Express a Parallel Sum of k Matrices

We present an alternative expression for the parallel sum of k Hermitian nonnegative definite matrices by using the Moore-Penrose inverse of a block matrix.