On a dynamic fractional game

Consider a two-person zero-sum game constructed by a dynamic fractional form. We establish the upper value as well as the lower value of a dynamic fractional game, and prove that the dual gap is equal to zero under certain conditions. It is also established that the saddle point function exists in the fractional game system under certain conditions so that the equilibrium point exists in this game system.     

Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities

In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2.     

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.     

First order dynamic inclusions on time scales

In this paper, we study existence of solutions of first order dynamic inclusions on time scales with general boundary conditions. Both the ∇-derivative and Δ-derivative cases are considered. Examples are presented to illustrate that the Δ-derivative case needs more restrictive assumptions.     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

Rheological properties of polyacrylates used as synthetic road binders

Most adhesives and binders, including bitumen for asphalt mixture production, are presently produced from petrochemicals after the refining of crude oil. The fact that crude oil reserves are a finite resource means that in the future, it may become necessary to produce these materials from alternative and probably renewable sources. Suitable resources of this kind may include polysaccharides, plant oils and proteins. This paper deals with the synthesis of polymer binders from monomers that could, in future, be derived from renewable resources. These binders consist of polyethyl acrylate (PEA) of different molecular weight, polymethyl acrylate (PMA) and polybutyl acrylate (PBA), which were synthesised from ethyl acrylate, methyl acrylate and butyl acrylate, respectively, by atom transfer radical polymerisation. The rheological properties of these binders were determined by means of oscillatory testing using a dynamic shear rheometer and combinations of stress/strain, temperature and frequency sweeps. The results indicate that PEA can be produced to have rheological properties similar to that of ‘soft’ 100/150 penetration grade bitumen, PMA with similar rheological properties to that of ‘hard’ 10/20 penetration grade bitumen, while PBA, due to its highly viscous nature and low dynamic moduli, cannot be used on its own as a binder. The synthetic polymers were found to be thermo-rheologically simple, and the shift factors, used to produce the dynamic moduli master curves, were found to fit an Arrhenius function.     

A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.     

A class of polynomial variable metric algorithms for linear optimization

In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics, wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier function for suitable Riemannian metrics. Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116.     

高速电视摄象系统的象质评价和动态计测精度

本文对高速摄象系统(包括电视摄象系统和光机式摄象系统)的象质评价方法予以讨论,并用实验方法对目前广泛使用的Kodak SP-2000、NAC HSV-200等高速电视摄象系统及我们自己开发的一维扫描电视摄象系统的象质,在新的定义下给出了评价,对它们的动态精度作了对比性测试,同时和光机式高速摄象系统作了比较。     

第二讲合成孔径声纳成像及其研究进展

文章在介绍了图像声纳的特点、合成孔径声纳（synthetic aperture sonar,SAS）产生背景和发展过程的基础上,对合成孔径声纳的原理、技术难点、成像算法等问题进行了讨论.着重分析了合成孔径声纳成像过程中高分辨率的获取方法、水声信道对成像的影响、多子阵技术及其成像算法、稳定的声纳运动平台和运动监测问题、运动补偿与自聚焦方法等.文章还给出了国内外合成孔径声纳研究的最新进展情况,进而展望了合成孔径声纳的应用前景.