A computational voting model

Social choice models usually assume that choice is among exogenously given and non decomposable alternatives. Often, on the contrary, choice is among objects that are constructed by individuals or institutions as complex bundles made of many interdependent components. In this paper we present a model of object construction in majority voting and show that, in general, by appropriate changes of such bundles, different social outcomes may be obtained, depending upon initial conditions and agenda, intransitive cycles and median voter dominance may be made appear or disappear, and that, finally, decidability may be ensured by increasing manipulability or viceversa.Social choice; object construction power; agenda power; intransitive cycles; median voter theorem.

A computational model of texture segmentation

An algorithm for finding texture boundaries in images is developed on the basis of a computational model of human texture perception. The model consists of three stages: (1) the image is convolved with a bank of even-symmetric linear filters followed by half-wave rectification to give a set of responses; (2) inhibition, localized in space, within and among the neural response profiles results in the suppression of weak responses when there are strong responses at the same or nearby locations; and (3) texture boundaries are detected using peaks in the gradients of the inhibited response profiles. The model is precisely specified, equally applicable to grey-scale and binary textures, and is motivated by detailed comparison with psychophysics and physiology. It makes predictions about the degree of discriminability of different texture pairs which match very well with experimental measurements of discriminability in human observers. From a machine-vision point of view, the scheme is a high-quality texture-edge detector which works equally on images of artificial and natural scenes. The algorithm makes the use of simple local and parallel operations, which makes it potentially real-time

Formal Computational Unlinkability Proofs of RFID Protocols

We set up a framework for the formal proofs of RFID protocols in the computational model. We rely on the so-called computationally complete symbolic attacker model. Our contributions are: i) To design (and prove sound) axioms reflecting the properties of hash functions (Collision-Resistance, PRF); ii) To formalize computational unlinkability in the model; iii) To illustrate the method, providing the first formal proofs of unlinkability of RFID protocols, in the computational model

A computational model of evolution: haploidy versus diploidy

In this paper, the study of diploidy is introduced like and important mechanism for memory reinforcement in artificial environments where adaptation is very important. The individuals of this ecosystem are able to genetically "learn" the best behaviour for survival. Critical changes, happening in the environmental conditions, require the presence of diploidy to ensure the survival of species. By means of new gene-dominance configurations, a way to shield the individuals from erroneous selection is provided. These two concepts appear like important elements for artificial systems which have to evolve in environments with some degree of instability.Publicad

A computational model for a regenerator

This paper concerns a numerical model of a regenerator running at very low temperatures. The model consists of the usual three equations for a compressible fluid with an additional equation for a matrix temperature. The main difficulty with the model is the very low Mach number (approximately 1.E-3). The divergence of the velocity is not small, the pressure divergence is small, and the pressure fluctuation in time is not small. An asymptotic expansion based on the bounded derivative method of Kreiss is used to give a reduced model which eliminates acoustic waves. The velocity is then determined by a two-point boundary value problem which does not contain a time derivative. The solution obtained from the reduced system is compared with the numerical solution of the original system

A Computational Model of Worker Protest

This paper presents an agent-based model of worker protest. Workers have varying degrees of grievance depending on the difference between their wage and the average of their neighbors. They protest with probabilities proportional to grievance, but are inhibited by the risk of being arrested – which is determined by the ratio of coercive agents to probable rebels in the local area. We explore the effect of similarity perception on the dynamics of collective behavior. If workers are surrounded by more in-group members, they are more risk-taking; if surrounded by more out-group members, more risk-averse. Individual interest and group membership jointly affect patterns of workers protest: rhythm, frequency, strength, and duration of protest outbreaks. Results indicate that when wages are more unequally distributed, the previous outburst tends to suppress the next one, protests occur more frequently, and they become more intensive and persistent. Group identification does not seriously influence the frequency of local uprisings. Both their strength and duration, however, are negatively affected by the ingroup-outgroup assessment. The overall findings are valid when workers distinguish \'us\' from \'them\' through simple binary categorization, as well as when they perceive degrees of similarity and difference from their neighbors.Workers Protest, Tags, Group Identity, Trust, Netlogo

Synthesis of Silver Colloids: Experiment and Computational Model

We summarize our recent results that model the formation of uniform spherical silver colloids prepared by mixing iso-ascorbic acid and silver-amine complex solutions in the absence of dispersants. We found that the experimental results can be modeled effectively by the two-stage formation mechanism used previously to model the preparation of colloidal gold spheres. The equilibrium concentration of silver atoms and the surface tension of silver precursor nanocrystals are both treated as free parameters, and the experimental reaction time scale is fit by a narrow region of this two-parameter space. The kinetic parameter required to match the final particle size is found to be very close to that used previously in modeling the formation of uniform gold particles, suggesting that similar kinetics governs the aggregation process. The model also reproduces semi quantitatively the effects of temperature and solvent viscosity on particle synthesis.Comment: 6 pages, 5 figure