This paper describes the Gaggle, a mechanism for grouping and naming objects in an object-oriented distributed system. Using Gaggles, client objects can access distributed replicated services without regard for the number of objects that provide the service. Gaggles are not themselves a replication mechanism; instead they enable programmers to construct their own replicated distributed services...

Abstract We study consensus formation in interacting systems that evolve by multi-state majority rule and by plurality rule. In an update event, a group of G agents (with G odd), each endowed with an s-state spin variable, is specified. For majority rule, all group members adopt the local majority state; for plurality rule the group adopts the local plurality state. This update is repeated unti...

Trembling hand (TH) equilibria were introduced by Selten in 1975. Intuitively, these are Nash equilibria that remain stable when players assume that there is a small probability that other players will choose off-equilibrium strategies. This concept is useful for equilibrium refinement, i.e., selecting the most plausible Nash equilibria when the set of all Nash equilibria can be very large, as ...

There are two fundamentally different views of the semantics of definite plural NPs. I will call them ‘Reference to a Plurality’ and ‘Plural Reference’. Reference to a Plurality is the view that definite plurals stand for a particular sort of entity, a plurality, more precisely a plurality ‘as one’. There are different formal conceptions of pluralities as ‘one’: as sums within extensional mereo...

An imaging system includes an array of lenses, a plurality of sensor pixels for each lens, the sensor pixels being on an image plane of the imaging system, and a corresponding plurality of focal plane coding elements. A focal plane coding element for each sensor pixel has multiple sub-pixel resolution elements. The focal plane coding element being between the lens and each sensor pixel, wherein...

Plurality voter is one of the commonest voting methods for decision making in highly-reliable applications in which the reliability and safety of the system is critical. To resolve the problem associated with sequential plurality voter in dealing with large number of inputs, this paper introduces a new generation of plurality voter based on parallel algorithms. Since parallel algorithms normall...

This paper compares two voting methods commonly used in presidential elections: simple plurality voting and plurality runoff. In a situation in which a group of voters have common interests but do not agree on which candidate to support due to private information, information aggregation requires them to split their support between their favorite candidates. However, if a group of voters split ...

A method for imaging objects in highly scattering turbid media. According to one embodiment of the invention, the method involves using a plurality of intersecting source1 detectors sets and time-resolving equipment to generate a plurality of time-resolved intensity curves for the diffusive component of light emergent from the medium. For each of the curves, the intensities at a plurality of ti...

One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption is via counting integral points in polyhedra. Here, Ehrhart theory can help, but unfortunately the dimension and complexity of the involved polyhedra grows rapidly with the number of candidates. However, if we exploit available polyhedral symmetries, some computations become poss...

A method for imaging objects in highly scattering turbid media. According to one embodiment of the invention, the method involves using a plurality of intersecting source1 detectors sets and time-resolving equipment to generate a plurality of time-resolved intensity curves for the diffusive component of light emergent from the medium. For each of the curves, the intensities at a plurality of ti...