We review the representation problem based on factoring and show that this problem gives rise to alternative solutions to a lot of cryptographic protocols in the literature. And, while the solutions so far usually either rely on the RSA problem or the intractability of factoring integers of a special form (e.g., Blum integers), the solutions here work with the most general factoring assumption....

Traditionally, enterprise software is developed and introduced with the aim to support clearly defined usage scenarios within specific business process contexts. Malleable end-user software (MEUS) is different. A recent MEUS example is social software. Typically employed to enable communication in and between corporations social software has gained importance for corporations in the past years ...

Solving sparse linear systems can lead to processing tree workflows on a platform of processors. In this study, we use the model of malleable tasks motivated in [1, 9] in order to study tree workflow schedules under two contradictory objectives: makespan minimization and memory minization. First, we give a simpler proof of the result of [8] which allows to compute a makespan-optimal schedule fo...

Malleability enables a parallel application’s execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to dynamic execution environments, it is limited by the granularity of the application’s processes. Malleability empowers process migration by allowing the application’s processes to expand or shrink following the availabi...

We present a system for collaborative musical creation on mobile wireless networks. The work extends on simple peer-to-peer file sharing systems towards ad-hoc mobility, streaming, and collaborative creation. It extends music listening from a passive act to a proactive, participative activity. The system consists of a network based interactive music engine and a mobile rendering player. It serv...