The automatic conversion of oating point software implementations of algorithms to a equivalent xed point implementation which can be eeciently implemented in an FCCM remains an obstacle in the rapid systems prototyping design ow. Floating point to xed point conversion is tedious, error prone and requires a good knowledge of xed point computer arithmetic. This paper describes a software system ...

We examine the eecient implementation of back prop type algorithms on T0 4], a vector processor with a xed point engine, designed for neural network simulation. A matrix formulation of back prop, Matrix Back Prop 1], has been shown to be very eecient on some RISCs 2]. Using Matrix Back Prop, we achieve an asymptotically optimal performance on T0 (about 0.8 GOPS) for both forward and backward ph...

in this paper, we prove the existence of the solution for boundary value prob-lem(bvp) of fractional dierential equations of order q 2 (2; 3]. the kras-noselskii's xed point theorem is applied to establish the results. in addition,we give an detailed example to demonstrate the main result.

When the saddle-center bifurcation occurs in an analytic family of area-preserving maps, rst a parabolic xed point appears at the origin and then this point bi-furcates, creating an elliptic xed point and a hyperbolic one. Separatrices of the hyperbolic xed point form a small loop around the elliptic point. In general the sep-aratrices intersect transversely and the splitting is exponentially s...

jachymski [ proc. amer. math. soc., 136 (2008), 1359-1373] gave modified version of a banach fixed point theorem on a metric space endowed with a graph. in the present paper, (g, φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. also, hardy-rogers g-contraction have been introduced and some fixed point theorems have been proved. s...

The Longest common subsequence problem is examined from the point of view of parameterized computational complexity. There are several diierent ways in which parameters enter the problem, such as the number of sequences to be analyzed, the length of the common subsequence, and the size of the alphabet. Lower bounds on the complexity of this basic problem imply lower bounds on a number of other ...

We characterize the polynomial time computable queries as those ex pressible in relational calculus plus a least xed point operator and a total ordering on the universe We also show that even without the ordering one application of xed point su ces to express any query expressible with several alternations of xed point and negation This proves that the xed point query hierarchy suggested by Cha...

In order to solve domain equations over 1-bounded compact metric spaces, xed points of functors on categories of 1-bounded compact metric spaces are studied. Two categories of 1-bounded compact metric spaces are considered: KMS and KMS E. In both categories, objects are isomorphic if and only if they are isometric. As a consequence, provided that the operation of a domain equation can be extend...

Modifying von Neumann’s alternating projections algorithm, we obtain an alternating method for solving the recently introduced Common Solutions to Variational Inequalities Problem (CSVIP). For simplicity, we mainly con…ne our attention to the two-set CSVIP, which entails …nding common solutions to two unrelated variational inequalities in Hilbert space. Keywords: Alternating method, averaged op...