矩阵的广义特征值及特征向量的神经网络方法

矩阵特征值及特征向量计算在实际问题中有广泛的应用.应用神经网络方法来计算广义特征值及对应的特征向量,给出了相应的算法,并对给出的算法在数学上进行了严格证明.并用实例验证了其正确性.     

Stabilizing management of fluctuating resources

We consider a resource management problem in which the management objective is to minimize fluctuations in resource stocks. Stabilizing management policies constitute the designing of memoryless state feedback control strategies for a discrete time resource model which contains unknown but bounded fluctuations. We also show that the problem of maximizing sustainable yield in an uncertain fishery can be considered as the problem of stabilizing of the stock level.The paper corresponds to an invited talk at the 14th Symposium on Operations Research, Ulm, September 6–8, 1989.The support by Yrjö Jahnsson Foundation is gratefully acknowledged.This work was supported by NSF and AFOSR under grant ECS 8602524.     

(Anti-)de Sitter Black Hole Entropy and Generalized Uncertainty Principle

We generalize the method that is used to study corrections to Cardy-Verlinde formula due to generalized uncertainty principle and discuss corrections to Cardy-Verlinde formula due to generalized uncertainty principle in (anti)-de Sitter space. Because in de Sitter black hole spacetime the radiation temperature of the black hole horizon is different from the one of the cosmological horizon, this spacetime is a thermodynamical non-equilibrium spacetime.     

Parametric estimation of discretely sampled Gamma-OU processes

The stationary Gamma-OU processes are recommended to be the volatility of the financial assets. A parametric estimation for the Gamma-OU processes based on the discrete observations is considered in this paper. The estimator of an intensity parameter A and its convergence result are given, and the simulations show that the estimation is quite accurate. Assuming that the parameter A is estimated, the maximum likelihood estimation of shape parameter c and scale parameter a, whose likelihood function is not explicitly computable, is considered. By means of the Gaver-Stehfest algorithm, we construct an explicit sequence of approximations to the likelihood function and show that it converges the true (but unkown) one. Maximizing the sequence results in an estimator that converges to the true maximum likelihood estimator and the approximation shares the asymptotic properties of the true maximum likelihood estimator. Some simulation experiments reveal that this method is still quite accurate in most of rational situations for the background of volatility.     

Irregularities of distribution with respect to strips

Summary A lower bound is established for the strip discrepancy of a broad class of point distributions. The bound implies unbounded strip discrepancy for equally weighted point distributions under favorable conditions. The methods of proof use notions from integral geometry.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

Schrödinger Uncertainty Relations and Physical Features of Correlated-Coherent States

We show that the difference between the Schrödinger uncertainty relations (UR) and the Heisenberg UR is fundamental. We propose a modified version of stochastic mechanics that allows clearly demonstrating that the contributions from the anticommutator and the commutator to the Schrödinger UR are equally important. A classification of quantum states minimizing the Schrödinger UR at an arbitrary instant is proposed. We show that the correlation of the coordinate and momentum fluctuations in such correlated-coherent states (CCS) is largely determined by the contributions from not only the commutator but also the anticommutator of the corresponding operators. We demonstrate that the character of this correlation changes qualitatively in time from the antiphase correlation typical for the Heisenberg UR to the inphase correlation for which the contribution from the anticommutator is decisive. We comparatively analyze properties of a free microparticle and a quantum oscillator in CCS and show that the CCS correspond to traveling-standing de Broglie waves in both models.     

The Kissing Triangles: The Aesthetics of Mathematical Discovery

Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

Stable multi-sets

In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge bounds equal one, stable multi-sets are equivalent to stable sets.  For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable multi-sets and conditions for them to be facet defining are determined.  The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets emerge as an important substructure in the design of optical networks. Received: February 14, 2001/Revised version: September 7, 2001