Recommender Systems (RSs) are becoming increasingly popular in the last years. They collect reviews concerning several types of items (e.g., shops, professionals, services, songs or videos) order to rank them according a given criterion, and suggest most relevant ones their users. However, currently used RSs exhibit two main drawbacks: they based on centralized control model do not provide rewa...

In the game Knock ’m Down, tokens are placed in N bins. At each step of the game, a bin is chosen at random according to a fixed probability distribution. If a token remains in that bin, it is removed. When all the tokens have been removed, the player is done. In the solitaire version of this game, the goal is to minimize the expected number of moves needed to remove all the tokens. Here we pre...

We introduce $\sf{CosmoBit}$, a module within the open-source $\sf{GAMBIT}$ software framework for exploring connections between cosmology and particle physics with joint global fits. $\sf{CosmoBit}$ provides flexible studying various scenarios beyond $\Lambda$CDM, such as models of inflation, modifications effective number relativistic degrees freedom, exotic energy injection from annihilating...

Infants’ acquisition of phonetic categories involves a distributional learning mechanism that operates on acoustic dimensions of the input. However, natural infant-directed speech shows large degrees of phonetic variability, and the resulting overlap between categories suggests that category learning based on distributional clustering may not be feasible without constraints on the learning proc...

Three experiments were conducted with pigeons to identify the stimulus functions of tokens in second-order token-reinforcement schedules. All experiments employed two-component multiple schedules with a token-reinforcement schedule in one component and a schedule with equivalent response requirements and/or reinforcer density in the other. In Experiment 1, response rates were lower under a toke...

A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the problem of software protection via oblivious RAM. Goldwasser, Kalai, and Rothblum introduced the concept of one-time programs: in a one-time program, an honest sender sends a set of simple hardware tokens to a (potenti...

We have a cycle of N nodes and there is a token on an odd number of nodes. At each step, each token independently moves to its clockwise neighbor or stays at its position with probability 2 . If two tokens arrive to the same node, then we remove both of them. The process ends when only one token remains. The question is that for a fixed N , which is the initial configuration that maximizes the ...