A practical key substitution attack on SFLASH is described: Given a valid (message, signature) pair (m,σ) for some public key v0, one can derive another public key v1 (along with matching secret data) such that (m,σ) is also valid for v1. The computational effort needed for finding such a ‘duplicate’ key is comparable to the effort needed for ordinary key generation.

Serotonin is implicated in many aspects of behavioral regulation. Theoretical attempts to unify the multiple roles assigned to serotonin proposed that it regulates the impact of costs, such as delay or punishment, on action selection. Here, we show that serotonin also regulates other types of action costs such as effort. We compared behavioral performance in 58 healthy humans treated during 8 w...

The Minimum Spanning Tree Problem (MSTP) is one of the most known combinatorial optimization problems. It concerns the determination of a minimum edge-cost subgraph spanning all the vertices of a given connected graph. The Quadratic Minimum Spanning Tree Problem (QMSTP) is a variant of the MST whose cost considers also the interaction between every pair of edges of the tree. In this paper we re...

Using a computational testbed, we theoretically predict and experimentally show that in the minimum effort coordination game, as the cost of effort increases, 1) the game converges to lower effort levels, 2) the convergence speed increases, and 3) the average payoff is not monotonically decreasing. In fact, the average profit is an U-shaped curve as a function of cost. Therefore, contrary to th...

International investment law may be the most criticised front of contemporary international economic law. One main points criticism stresses its substantively asymmetrical structure, which creates an imbalance between respective rights and obligations foreign investors all other stakeholders in relations such as home host states, local communities NGOs. proposals to address this issue is includ...

Collaborative Filtering (CF) is currently one of the most popular and most widely used personalization techniques. It generates personalized predictions based on the assumption that users with similar tastes prefer similar items. One of the major drawbacks of the CF from the computational point of view is its limited scalability since the computational effort required by the CF grows linearly b...

We review Sweeny’s algorithm for Monte Carlo simulations of the random cluster model. Straightforward implementations suffer from the problem of computational critical slowing down, where the computational effort per edge operation scales with a power of the system size. By using a tailored dynamic connectivity algorithm we are able to perform all operations with a poly-logarithmic computationa...

The interaction between fluid and structure occurs in a wide range of engineering problems. The solution for such problems is based on the relations of continuum mechanics and is mostly solved with numerical methods. It is a computational challenge to solve such problems because of the complex geometries, intricate physics of fluids, and complicated fluid-structure interactions. The way in whic...

Models of neurons based on iterative maps allows the simulation of big networks of coupled neurons without loss of biophysical properties such as spiking, bursting or tonic bursting and with an affordable computational effort. These models are built over a phenomenological basis and are mainly implemented by the use of iterative two-dimensional maps that can present neuro-computational properti...