A pursuit and evasion problem with measurement uncertainty

A pursuit-evasion process with uncertain state-dependent measurements, in finite, discrete time and in a finite, discrete state space, is considered. Three types of strategies which might be employed in such a process are compared, and attention is concentrated on the behavior strategy, the least well known of the three types, but often the simplest optimal strategy to employ.A variation of the Brown-Robinson fictitious play algorithm is presented which can be used to compute behavior strategies in the case of perfect recall processes.Two examples are given in which optimal behavior strategies are computed using the algorithm and compared with a type of plausible but nonoptimalseparation strategy.This work was partially supported by NASA Grant No. NGR-15-005-021, NSF Grant No. GK-1970, and AFOSR Grant No. 69-1776.     

Geometrically finite groups,Patterson-Sullivan measures and Ratner's ridigity theorem

Summary The rigidity properties of the horospherical foliations of geometrically finite hyperbolic manifolds are investigated. Ratner's theorem generalizes to these foliations with respect to the Patterson-Sullivan measure. In the spirit of Mostow, we prove the nonexistence of invariant measurable distributions on the boundary of hyperbolic space for geometrically finite groups. Finally, we show that the frame flow on geometrically finite hyperbolic manifolds is Bernoulli.partially supported by NSF Grant No. DMS-820-04024partially supported by NSF Grant No. DMS-85-02319     

On self-mapping degrees of <Emphasis Type="Italic">S</Emphasis><Superscript>3</Superscript>-geometry manifolds

In this paper we determined all of the possible self-mapping degrees of the manifolds with S3-geometry, which are supposed to be all 3-manifolds with finite fundamental groups. This is a part of a project to determine all possible self-mapping degrees of all closed orientable 3-manifold in Thurston＇s picture.     

On heat kernel estimates and parabolic Harnack inequality for jump processes on metric measure spaces

In this paper, we discuss necessary and sufficient conditions on jumping kernels for a class of jump-type Markov processes on metric measure spaces to have scale-invariant finite range parabolic Harnack inequality.     

The structure of zero-divisor semigroups with graph K n ○K 2

This paper determines all commutative zero divisor semigroups whose zero divisor graph is a complete graph (finite or infinite), or a complete graph (finite or infinite) with one additional end vertex, and gives formulas for the numbers of all such semigroups with n elements. The research of T. Wu is supported by the National Natural Science Foundation of China (Grant No. 10671122) and the Natural Science Foundation of Shanghai (Grant No. 06ZR14049).     

Recognition by spectrum of the groups $$ ^2 D_{2^m + 1} (3) $$

Abstract It is proved that a finite group with the same set of element orders as the simple group is isomorphic to . This work was supported by Russian Foundation for Basic Research (Grant No. 07-01-00148), RFBR-BRFBR (Grant No. 08-01-90006) and RFBR-GFEN (Grant No. 08-01-92200)     

Piercing Families of Convex Sets with the <Emphasis Type="Italic">d</Emphasis>-Intersection Property in ℝ<Superscript><Emphasis Type="Italic">d</Emphasis></Superscript>

In this paper, we consider finite families of convex sets in ℝ ^d such that every d or fewer sets of the family have a common point. For some families of this type, we give upper bounds on the size of a finite set intersecting all sets of the family. This research was supported by the Russian Foundation for the Basic Research Grants No. 03-01-00801 and 06-01-00648, and by the President of the Russian Federation Grant No. MK-5724.2006.1.     

Suboptimal shape control for quasi-static distributed-parameter systems

We propose an on-line control approach which will adjust the steady-state shape of a large antenna arbitrarily close to any achievable desired profile. The method makes use of distributed-parameter system theory and allows refocusing using a limited number of control actuators and sensors.The controller gains are calculated by approximating the solution to an infinite-dimensional optimal quasi-static control problem. The controller gain calculation is computationally simpler than that proposed in a companion paper. The Galerkin (finite element) approximation method is used for model reduction. We prove that both gain and state convergence can be achieved by using the proposed approximation scheme.This work was partially supported by the Air Force Office of Scientific Research, Grant No. AFOSR 83-0124, and by the National Aeronautics and Space Administration, Grant No. NAG-1-515.     

On the value distribution of <Emphasis Type="Italic">ƒ</Emphasis> + <Emphasis Type="Italic">a</Emphasis>(<Emphasis Type="Italic">ƒ</Emphasis>′)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let ƒ be a transcendental meromorphic function, a a nonzero finite complex number, and n ⩾ 2 a positive integer. Then ƒ + a(ƒ′) ⁿ assumes every complex value infinitely often. This answers a question of Ye for n = 2. A related normality criterion is also given. This work was supported by the National Natural Science Foundation of China (Grant No. 10771076), the Natural Science Foundation of Guangdong Province, China (Grant No. 07006700) and by the German-Israeli Foundation for Scientific Research and Development (Grant No. G-809-234.6/2003)     

Connected cubic <Emphasis Type="Italic">s</Emphasis>-arc-regular Cayley graphs of finite nonabelian simple groups

A graph is said to be s-arc-regular if its full automorphism group acts regularly on the set of its s-arcs. In this paper, we investigate connected cubic s-arc-regular Cayley graphs of finite nonabelian simple groups. Two sufficient and necessary conditions for such graphs to be 1- or 2-arcregular are given and based on the conditions, several infinite families of 1- or 2-arc-regular cubic Cayley graphs of alternating groups are constructed. This work was supported by Guangxi Science Foundations (Grant No. 0832054) and Guangxi Postgraduate Education Innovation Research (Grant No. 2008105930701M102)     

On conforming finite element methods for the inhomogeneous stationary Navier-Stokes equations

Summary We consider the stationary Navier-Stokes equations, written in terms of the primitive variables, in the case where both the partial differential equations and boundary conditions are inhomogeneous. Under certain conditions on the data, the existence and uniqueness of the solution of a weak formulation of the equations can be guaranteed. A conforming finite element method is presented and optimal estimates for the error of the approximate solution are proved. In addition, the convergence properties of iterative methods for the solution of the discrete nonlinear algebraic systems resulting from the finite element algorithm are given. Numerical examples, using an efficient choice of finite element spaces, are also provided.Supported, in part, by the U.S. Air Force Office of Scientific Research under Grant No. AF-AFOSR-80-0083Supported, in part, by the same agency under Grant No. AF-AFOSR-80-0176-A. Both authors were also partially supported by NASA Contract No. NAS1-15810 while they were in residence at the Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23665, USA     

Additional aspects of the Stackelberg strategy in nonzero-sum games

The Stackelberg strategy in nonzero-sum games is a reasonable solution concept for games where, either due to lack of information on the part of one player about the performance function of the other, or due to different speeds in computing the strategies, or due to differences in size or strength, one player dominates the entire game by imposing a solution which is favorable to himself. This paper discusses some properties of this solution concept when the players use controls that are functions of the state variables of the game in addition to time. The difficulties in determining such controls are also pointed out. A simple two-stage finite state discrete game is used to illustrate these properties.This work was supported in part by the U.S. Air Force under Grant No. AFOSR-68-1579D, in part by NSF under Grant No. GK-36276, and in part by the Joint Services Electronics Program under Contract No. DAAB-07-72-C-0259 with the Coordinated Science Laboratory, University of Illinois, Urbana, Illinois.     

A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts

A finite algorithm is presented in this study for solving Bilinear programs. This is accomplished by developing a suitable cutting plane which deletes at least a face of a polyhedral set. At an extreme point, a polar cut using negative edge extensions is used. At other points, disjunctive cuts are adopted. Computational experience on test problems in the literature is provided.This paper is based upon work supported by the National Science Foundation under Grant No. ENG-77-23683.     

Fuzzy Topology Based on Residuated Lattice-Valued Logic

We use a semantical method of complete residuated lattice-valued logic to give a generalization of fuzzy topology as a partial answer to a problem by Roser and Turquette. This work is supported by the National Foundation for Distinguished Young Scholars (Grant No: 69725004), Research and Development Project of High-Technology (Grant No: 863-306-ZT06-04-3) and Foundation of Natural Sciences (Grant No: 69823001) of China and Fok Ying-Tung Education Foundation     

A stable method for solving certain constrained least squares problems

This paper presents a feasible descent algorithm for solving certain constrained least squares problems. These problems are specially structured quadratic programming problems with positive semidefinite Hessian matrices that are allowed to be singular. The algorithm generates a finite sequence of subproblems that are solved using the numerically stable technique of orthogonal factorization with reorthogonalization and Given's transformation updating.This material is based upon work supported by the National Science Foundation under Grant No. MCS 78-06716 and by the International Institute for Applied Systems Analysis.     

Existence,uniqueness and continuity of solutions of integral equations. An addendum

Summary This note corrects au error in the continuous dependence theorem of an earlier paper on the subject stated in the title. Here it is shows that the topology of one of the spaces of functions can be modified in order to obtain the desired continuity results. This research was support in part by the National Aeronautics Space Administration under Grant No. NGL-40-002-015, and in part by the U. S. Air Force under Grant No. AF-AFOSR-67-0693A. This research was supported in part by the National Science Foundation under Grant No. GP-3904 and GP-7041 and in part by the U.S. Army under Grant No. D1-31-124-ARO-D-265. Entrata in Redazione il 10 aprile 1970.     

On the McKay quivers and <Emphasis Type="Italic">m</Emphasis>-Cartan matrices

In this paper, we introduce the m-Cartan matrix and observe that some properties of the quadratic form associated to the Cartan matrix of an Euclidean diagram can be generalized to the m-Cartan matrix of a McKay quiver. We also describe the McKay quiver for a finite abelian subgroup of a special linear group. This work was supported by National Natural Science Foundation of China (Grant No. 10671061) and the Research Foundation for Doctor Programme (Grant No. 200505042004)     

A markov chain game with dynamic information

Two players, not knowing each other's position, move in a domain and can flash a searchlight. The game terminates when one player is caught within the area illuminated by the flash of the other. However, if this first player is not in this area, then the other player has disclosed his position to the former one, who may be able to exploit this information. The game is considered on a finite state space and in discrete time.The work of the second author was supported by ZWO, The Netherlands Organization for the Advancement of Pure Research, Contract No. B62-239, by the US Air Force Office of Scientific Research, Grant No. AFOSR-85-0245, and by the National Science Foundation, Grant No. NSF-INT-8504097.Visiting Professor at Delft University of Technology during 1986.     

Inequalities for derivatives of functions analytical in a strip

This work was supported by the Russian Foundation for Fundamental Research, Grant No. 93-01-00237, and by the International Scientific Foundation, Grant No. MP 1000.