We generalize the hyper-systolic algorithm proposed in [1] for abstract data structures on massive parallel computers with np processors. For a problem of size V the communication complexity of the hyper-systolic algorithm is proportional to √ npV , to be compared with npV for the systolic case. The implementation technique is explained in detail and the example of the parallel matrix-matrix mu...

Although the practical importance of investment analysis in long-term energy investments is well understood, choosing the proper method has always been a dilemma. In this regard, classic evaluation methods, with a history of almost a century, are mostly favored, but using them in the valuation of long-lasting energy projects has particular shortcomings, nevertheless. The drawbacks mainly stem f...

Block-oriented models are often used to model a nonlinear system. This paper presents an identification method for parallel Wiener-Hammerstein systems, where the obtained model has a decoupled static nonlinear block. This decoupled nature makes the interpretation of the obtained model more easy. First a coupled parallel Wiener-Hammerstein model is estimated. Next, the static nonlinearity is dec...

The majority of register file designs follow one of two well– knownapproaches.Manymodernhigh-performanceprocessors (POWER4 [1], Pentium4 [2]) use a merged register file that holds both architectural and rename registers. Other processors use a Future File (eg, Opteron [3]) with rename registers kept separately in reservation stations. Both approaches have issues thatmay limit their application ...

We propose a new pointwise collaborative ranking approach for recommender systems, which focuses on improving ranking performance at the top of recommended list. Our approach is different from common pointwise methods in that we consider user ratings as ordinal rather than viewing them as real values or categorical labels. In addition, positively rated items (higher rating scores) are emphasize...