Well-Posedness by Perturbations of Variational Problems

In this paper, we consider the extension of the notion of well-posedness by perturbations, introduced by Zolezzi for optimization problems, to other related variational problems like inclusion problems and fixed-point problems. Then, we study the conditions under which there is equivalence of the well-posedness in the above sense between different problems. Relations with the so-called diagonal well-posedness are also given. Finally, an application to staircase iteration methods is presented.     

BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management

This paper presents an adaptive memory-based method for solving the Capacitated Vehicle Routing Problem (CVRP), called BoneRoute. The CVRP deals with the problem of finding the optimal sequence of deliveries conducted by a fleet of homogeneous vehicles, based at one depot, to serve a set of customers. The computational performance of the BoneRoute was found to be very efficient, producing high quality solutions over two sets of well known case studies examined.     

Simulation of a High Harmonic Gyrotron with Axis-Encircling Electron Beam and Permanent Magnet

A computer code for simulation of beam-field interaction in a resonant cavity of a gyrotron has been developed. It is based on a self-consistent, time-independent, single-mode physical model. The code has been applied to the analysis of the electrodynamical system of a novel high-harmonic gyrotron with axis-encircling beam and a permanent magnet. In this paper both the physical model and numerical techniques used are outlined. Some results of the numerical experiments are presented and discussed.     

Real-time recursive estimation of statistical parameters

Recursive algorithms for the computation of standard deviation and average deviation are derived and their applications in data acquisition are discussed. The relative speeds and accuracies of the two algorithms are compared for synthetic data. The performance of recursive estimation under shot and proportional noise limitations is also described. As an example of the utility of these algorithms, absorbance data with constant confidence intervals are collected regardless of incident and transmitted intensities. The desired precision is specified prior to data acquisition and used to control signal-averaging of the data in real time.     

Surface structures formed by individual adsorption and coadsorption of Mn and Bi on Cu(0 0 1), studied by LEED

We have studied the individual adsorption of Mn and Bi, and their coadsorption on Cu(0 0 1) by low-energy electron diffraction (LEED). For Mn, we have determined the c(2 × 2) structure formed at 300 K, whose structure had been determined by several methods. We reconfirmed by a tensor LEED analysis that it is a substitutional structure and that a previously reported large corrugation (0.30 Å) between substitutional Mn and remaining surface Cu atoms coincides perfectly with the present value. In the individual adsorption of Bi, we have found a c(4 × 2) structure, which is formed by cooling below ∼250 K a surface prepared by Bi deposition of ∼0.25 ML coverage at 300 K where streaky half-order LEED spots appear. The c(4 × 2) structure has been determined by the tensor LEED analysis at 130 K and it is a substitutional structure. In the coadsorption, we found a c(6 × 4) structure, which has been determined by the tensor LEED analysis. It is very similar to the previously determined structure of the c(6 × 4) formed by coadsorption of Mg and Bi, and embedded MnBi₄ clusters are arranged in the top Cu layer instead of MgBi₄. Large lateral displacements of Bi atoms in the c(6 × 4)-(Mn + Bi) suggest that the Mn atoms undergo the size-enhancement caused by their large magnetic moment.     

主成分分析在地区科技竞争力评测中的应用

近年来对于科技竞争力的研究在国内方兴未艾,其中对于科技竞争力的评测是众多学者研究的重点和热点,也是各级决策者最为关心、最为重要的课题之一。本文根据科技竞争力概念和内涵来确定评测指标体系的构成要素,建立了评测指标体系,并利用主成分分析方法对采集来的数据进行分析,得到最终的评测结果。     

On the realization of Riemannian symmetric spaces in Lie groups

In this paper we give a realization of some symmetric space G/K as a closed submanifold P of G. We also give several equivalent representations of the submanifold P. Some properties of the set gK∩P are also discussed, where gK is a coset space in G.     

Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.     

用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。     

Solving Problems with Min-Type Functions by Disjunctive Programming

We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency.