The budget is the key means for effecting policy in democracies, yet its preparation is typically an opaque and arcane process. Participatory budgeting is making inroads in municipalities, but is usually limited to a small fraction of the total budget as its methods do not scale: They cannot handle quantitative budget items nor hierarchical budget construction. Here we apply the Condorcet princ...

We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation...

We investigate the stochastic Direct Simulation Monte Carlo method (DSMC) for numerically solving the collision-term in heavy-ion transport theories of the Boltzmann-Uehling-Uhlenbeck (BUU) type. The first major modification we consider is changes in the collision rates due to excluded volume and shadowing/screening effects (Enskog theory). The second effect studied by us is the inclusion of an...

Consistent vehicle routing problems (ConVRP) are VRP’s with multiple days, where customers always need to be visited at roughly the same time of the day. To solve these problems, Groër et al. (2009) developed an algorithm called ConRTR. In this study, I will show that some of the solutions as provided by Groër et al. (2009) are infeasible and how ConRTR can be used to get feasible solutions. It...

We attempt a justification of a generalisation of the consistent histories programme using a notion of probability that is valid for all complete sets of history propositions. This consists of introducing Cox’s axioms of probability theory and showing that our candidate notion of probability obeys them. We also give a generalisation of Bayes’ theorem and comment upon how Bayesianism should be u...

we present a model and propose an approach to compute an approximate solution of fully fuzzy linear system $(ffls)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. first, in discussing an $ffls$ with a nonnegative coefficient matrix, we consider an equivalent $ffls$ by using an appropriate permutation to simplify fuzzy multiplications. t...