We develop an approach of variational analysis and generalized differentiation to conditioning issues for two-person zero-sum matrix games. Our major results establish precise relationships between a certain condition measure of the smoothing first-order algorithm proposed in [4] and the exact bound of metric regularity for an associated set-valued mapping. In this way we compute the aforementi...

The network autocorrelation model has been a workhorse for modeling network influences on individual behavior. The standard network approaches to mapping social influence using network measures, however, are limited to specifying an influence weight matrix (W) based on a single mode network. Additionally, it has been demonstrated that the estimate of the autocorrelation parameter of the network...

We discuss how concepts such as geodesic length and the volume of space-time can appear in 2d topological gravity. We then construct a detailed mapping between the reduced Hermitian matrix model and 2d topological gravity at genus zero. This leads to a complete solution of the counting problem for planar graphs with vertices of even coordination number. The connection between multi-critical mat...

A formulation of the Ginzburg-Landau-Wilson version of the partition function of a system with a continuously varying order parameter as a transfer matrix calculation allows for the application of methods based on the density matrix renormalization group (DMRG) to the calculation of the free energy of the O(1) model. The essence of both the mapping and the DMRG calculation is laid out, along wi...

The Johnson–Lindenstrauss lemma asserts that an n-point set in any Euclidean space can be mapped to a Euclidean space of dimension k = O(ε−2 log n) so that all distances are preserved up to a multiplicative factor between 1 − ε and 1 + ε. Known proofs obtain such a mapping as a linear map Rn → Rk with a suitable random matrix. We give a simple and self-contained proof of a version of the Johnso...

The main purpose of this paper is to detemine the fine spectrum of the generalized difference operator Delta_{uv} over the sequence space c0. These results are more general than the fine spectrum of the generalized difference operator Delta_{uv} of Srivastava and Kumar.

In this paper we introduce the correlation matrix of a Boolean mapping, a useful concept in demonstrating and proving properties of Boolean functions and mappings. It is argued that correlation matrices are the “natural” representation for the proper understanding and description of the mechanisms of linear cryptanalysis [4]. It is also shown that the difference propagation probabilities and th...

The incidence matrix of Cnm of a simple digraph is mapped into a incidence matrix F of a balanced bipartite undirected graph by divided C into two groups. Based on the mapping, it proves that the complexity is polynomial to determin a Hamiltonian cycle existence or not in a simple digraph with degree bound two and obtain all solution if it exists Hamiltonian cycle. It also proves P = NP with th...

We present a self-contained discussion of the use of the transfer-matrix formalism to study onedimensional scattering. We elaborate on the geometrical interpretation of this transfer matrix as a conformal mapping on the unit disk. By generalizing to the unit disk the idea of turns, introduced by Hamilton to represent rotations on the sphere, we develop a method to represent transfer matrices by...

Land cover and forest mapping supports decision makers in the course of making informed decisions for implementation of sustainable conservation and management plans of the forest resources and environmental monitoring. This research examines the value of integrating of ALOS PALSAR and Landsat data for improved forest and land cover mapping in Northern Tanzania. A separate and joint processing ...