Prime Fano threefolds and integrable systems

For a general K3 surface S of genus g, with 2 ≤ g ≤ 10, we prove that the intermediate Jacobians of the family of prime Fano threefolds of genus g containing S as a hyperplane section, form generically an algebraic completely integrable Hamiltonian system. The first author is partially supported by grant MI1503/2005 of the Bulgarian Foundation for Scientific Research.     

Exponential decay rate of survival probability in a disastrous random environment

Summary. We study the exponential decay rate of the survival probability up to time t>0 of a random walker moving in Zopf; ^d in a temporally and spatially fluctuating random environment. When the random walker has a speed parameter κ>0, we investigate the influence of κ on the exponential decay rate λ(d,κ). In particular we prove that for any fixed d≥1, λ(d,κ) behaves like as logκ as κ↘0. Received: 21 May 1996 / In revised form: 2 February 1997     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

Analysis and implementation of cross sync period underwater acoustical positioning techniques for underwater targets

I.IlltroductionWhenanactiveunderwateracousticalpositioningsystemissearchingforanunderwatertarget,itisnecessaryforittocompleteatransmittingandreceivingcycIewithineachworkingperiodinordertofindoutthelocationofthetargetcorrectly.Forexample,whenanunder-wateracoustica1synchronouspositioningsystemistrackinganunderwatertargetwithagivensynchr0nizingperiod,thepropagati0ntimeofthepositioningsignaltravellingfr0mthetaJrgettothearrayofthesystemshouldbelessthanthesynchronizingperiod0therwisetargetdis-tance…     

几种约束广义逆矩阵的有限算法

1引言与引理众所周知，关于非奇异方阵的正则逆的有限算法是由Faddeev大给在1949年之前提出的，这就是著名的Faddeev算法[1，P…334-336]。自从五十年代中期广义逆矩阵的研究复兴与发展以来，有不少学者提出了关于广义逆矩阵的有限算法。第一个给出关于广义逆矩     

Coupling for Markov renewal processes and the rate of convergence in ergodic theorems for processes with semi-Markov switchings

Coupling procedures for Markov renewal processes are described. Applications to ergodic theorems for processes with semi-Markov switchings are considered.This paper was partly prepared with the support of NFR Grant F-UP 10257-300.     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

A floating-point genetic algorithm for solving the unit commitment problem

This paper proposes a floating-point genetic algorithm (FPGA) to solve the unit commitment problem (UCP). Based on the characteristics of typical load demand, a floating-point chromosome representation and an encoding–decoding scheme are designed to reduce the complexities in handling the minimum up/down time limits. Strategic parameters of the FPGA are characterized in detail, i.e., the evaluation function and its constraints, population size, operation styles of selection, crossover operation and probability, mutation operation and probability. A dynamic combination scheme of genetic operators is formulated to explore and exploit the FPGA in the non-convex solution space and multimodal objective function. Experiment results show that the FPGA is a more effective technique among the various styles of genetic algorithms, which can be applied to the practical scheduling tasks in utility power systems.     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented.