On a Question of Phillips

In [5] Phillips proved that one can obtain the additive group of any nonstandard model *? of the ring ? of integers by using a linear mod 1 function h : F ?, where F is the α-dimensional vector space over ? when α is the cardinality of *?. In this connection it arises the question whether there are linear mod 1 functions which are neither addition nor quasi-linear. We prove that this is the case.     

An experiment with arithmetic precision in linear algebra computations

Several techniques for experimental determination of floating point precision in practical computations are examined, and applied to linear algebra algorithms. These techniques are simple enough to be directly applicable to existing production codes, requiring a very limited amount of software on many machines, and yet they yield interesting information on the numerical precision of a computation. Our choice of linear algebra algorithms includes a direct solver (namely the MA32 program from the Harwell Library) and several variants of preconditioned conjugate gradients (the methods DIAG, INV, MINV and POL of Reference 1). The results may be of interest as method selection criteria, and thus complement Mflop performance data available from several sources.     

Stability criteria for controlled queueing systems

We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues; the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results generalise Kurkova [8] and complement Foley and McDonald [4] and [5]. AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15     

人工神经网络X射线荧光光谱法测定钢中酸溶铝

建立了一种人工神经网络-X射线荧光光谱法测定钢中酸溶铝的方法，用X射线荧光光谱法测定低合金钢中总铝值，应用所建立的ANN-BP网络模型，输入总铝含量直接预测出酸溶铝含量。同时使用改进的BP算法，避免了神经网络学习中可能产生的麻痹现象。该方法用于钢中酸溶铝的测定，结果满意。     

Set controllability of Markov jump switching Boolean control networks and its applications

In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

Immobilization of α-amylase in vinyl-polymer-based interpenetrating polymer networks

Semi-interpenetrating polymer networks (IPNs) of poly(ethylene glycol), poly(vinyl alcohol) and polyacrylamide were prepared as a support for enzyme immobilization and kinetic studies were performed for the immobilization of -amylase. The effect of IPN composition on the extent of immobilization was investigated and the percentage of relative activity of the immobilized enzyme was evaluated as a function of the chemical architecture of the IPNs, pH and temperature, taking starch as a substrate. The kinetic constants and the maximum reaction velocity were also evaluated. The IPNs were characterized by IR spectral analysis.     

Partially and totally asynchronous algorithms for linear complementarity problems

A unified treatment is given for partially and totally asynchronous parallel successive overrelaxation (SOR) algorithms for the linear complementarity problem. Convergence conditions are established and compared to previous results. Convergence of the partially asynchronous method for the symmetric linear complementarity problem can be guaranteed if the relaxation factor is sufficiently small. Unlike previous results, this relaxation factor interval does not depend explicitly on problem size.This material is based on research supported by the Air Force Office of Scientific Research Grant No. AFOSR-89-0410.The author wishes to thank the referee for pointing out how to improve the bound (12). The same technique can be used to reduce the factorn in Ref. 5, p. 553, to .     

On a class of least-element complementarity problems

The present paper studies the linear complementarity problem of finding vectorsx andy inR ₊ ⁿ such thatc + Dx + y 0,b – x 0 andx ^T (c + Dx + y) = y ^T (b – x) = 0 whereD is aZ-matrix andb > 0. Complementarity problems of this nature arise, for example, from the minimization of certain quadratic functions subject to upper and lower bounds on the variables. Two least-element characterizations of solutions to the above linear complementarity problem are established first. Next, a new and direct method to solve this class of problems, which depends on the idea of least-element solution is presented. Finally, applications and computational experience with its implementation are discussed.Research partially supported by the National Science Foundation Grant MCS 71-03341 A04 and the Air Force Office of Scientific Research Contract F 44620 14 C 0079.     

高能闪光照相中影响光程确定的几个因素

 利用闪光照相基本原理和成像原理，在直接记录法和转换屏记录法的情况下，研究了闪光照相中影响X射线在材料中光程确定的主要因素。结果表明，影响光程确定的几个因素是：散射效应、光源角分布效应、立体角效应和能谱效应。对于高能闪光照相，散射效应是影响光程确定的最主要因素，散射的存在使光程的测量值比实际值降低20%～40%。因此必须在做CT之前，对散射的影响进行修正。