A distributed implementation of Dang’s FixedPoint algorithm is proposed for searching one Nash equilibrium of a finite n-person game in normal form. In this paper, the problem consists of two subproblems. One is changing the problem form to a mixed 0-1 linear programming form. This process is derived from applications of the properties of pure strategy and multilinear terms in the payoff functi...

We present an efficient architecture for the implementation of delayed least mean square adaptive filter. We use a novel partial product generator and propose a strategy for optimized balanced pipelining across the time consuming combinational blocks of the structure .An efficient systolic architecture of the delayed least mean square adaptive filter based on the processing element We propose a...

A key benefit of system and software modeling is the ability to explore various design alternatives to reach a fixedpoint representation of a concrete system design. Among a diverse set of configuration possibilities, a model engineer must be able to explore the effects of a design decision (e.g., the effect of a specific communication protocol on systemic properties such as throughput) in a ra...

Hadamard (or complete $CAT(0)$) spaces are complete, non-positive curvature, metric spaces. Here, we prove a nonlinear ergodic theorem for continuous non-expansive semigroup in these spaces as well as a strong convergence theorem for the commutative case. Our results extend the standard non-linear ergodic theorems for non-expansive maps on real Hilbert spaces, to non-expansive maps on Ha...

‎In this paper‎, ‎we provide sufficient conditions for the existence of nonnegative solutions of a boundary value problem for a fractional order differential equation‎. ‎By applying Kranoselskii`s fixed--point theorem in a cone‎, ‎first we prove the existence of solutions of an auxiliary BVP formulated by truncating the response function‎. ‎Then the Arzela--Ascoli theorem is used to take $C^1$ ...

we consider gabor systems generated by a gaussian function and prove certain classical results of paley and wiener on nonharmonic fourier series of complex exponentials for the gabor expansion‎. ‎in particular, we prove a version of plancherel-po ́lya theorem for entire functions with finite order of growth and use the hadamard factorization theorem to study regularity‎, ‎exactness and deficienc...

we give a new proof of the well known wedderburn's little theorem (1905) that a finite‎ ‎division ring is commutative‎. ‎we apply the concept of frobenius kernel in frobenius representation theorem in finite group‎ ‎theory to build a proof‎.

Folds over inductive datatypes are well understood and widely used. In their plain form, they are quite restricted; but many disparate generalisations have been proposed that enjoy similar calculational benefits. There have also been attempts to unify the various generalisations: two prominent such unifications are the ‘recursion schemes from comonads’ of Uustalu, Vene and Pardo, and our own ‘a...

In a companion paper [6] we presented theoretical analysis of an analog network for fixed-point computation. This paper applies these results to several applications from numerical analysis and combinatorial optimization, in particular: 1) solving systems of linear equations; 2) nonlinear programming; 3) dynamic programing; and 4) network flow computations. Schematic circuits are proposed for r...

This article is an introduction to the FRIDGE design environment which supports the design and DSP implementation of fixedpoint digital signal processing systems. We present the tool-supported transformation of signal processing algorithms coded in floating-point ANSI C to a fixed-point representation in SystemC. We introduce the novel approach to control and data flow analysis, which is necess...