Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the well-mixed case, can act as amplifiers or suppressors of selection by increasing or decreasing the fixation probability of a beneficial mutant. Properties of the ass...

in traditional portfolio selection model coefficients often are certain and deterministic, but in real world these coefficients are probabilistic. so decision maker cannot estimate them exactly. financial optimization is one of the most attractive areas in decision under uncertainty. in the portfolio selection problem the decision maker considers simultaneously conflicting objectives such as ra...

This paper provides a partial-update normalized sign least-mean square (NSLMS) algorithm with sparse updates. The proposed algorithm reduces the computational complexity compared with the conventional L∞-norm adaptive filtering algorithms by decreasing the frequency of updating the filter coefficients and updating only a part of the filter coefficients. And we develop a mean square analysis to ...

Bayesian Regularization and Nonnegative Deconvolution (BRAND) is proposed for estimating time delays of acoustic signals in reverberant environments. Sparsity of the nonnegative filter coefficients is enforced using an L1-norm regularization. A probabilistic generative model is used to simultaneously estimate the regularization parameters and filter coefficients from the signal data. Iterative ...

A 'differential measure' is used to cast our calculus for the group SU (3) into a form similar to Schwinger's boson operator calculus for the group SU (2). It is then applied to compute (i) the inner product between the basis states and (ii) an algebraic formula for the Clebsch-Gordan coefficients. These were obtained earlier by us using Gaussian integration techniques.

Nonnegative Matrix Factorization (NMF) is a popular technique in a variety of fields due to its component-based representation with physical interpretablity. NMF finds a nonnegative hidden structures as oblique bases and coefficients. Recently, Orthogonal NMF (ONMF), imposing an orthogonal constraint into NMF, has been gathering a great deal of attention. ONMF is more appropriate for the cluste...

The zero distribution of orthogonal polynomials pn,N , n = 0, 1, . . . generated by recurrence coefficients an,N and bn,N depending on a parameter N has been recently considered by Kuijlaars and Van Assche under the assumption that an,N and bn,N behave like a(n/N) and b(n/N), respectively, where a(·) and b(·) are continuous functions. Here, we extend this result by allowing a(·) and b(·) to be ...

The purpose of this paper is to find out a set of general recurrence formulas for the calculus of the SU(3) Clebsch-Gordan coefficients. The first six sections are introductory, presenting the notations and general group theoretical methods applied to SU(3). The following eight sections are devoted to a detailed treatment of the carrier spaces of the irreducible representations and their direct...