We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restricted set of rules. This assumption limits the behavioral complexity of the simulated agents. By learning from real-world examples, our autonomous agents display complex natural behaviors that are often missing in crowd simulations. Examples are created from tracked video segments of real pedestrian crowds. During a simulation, autonomous agents search for examples that closely match the situation that they are facing. Trajectories taken by real people in similar situations, are copied to the simulated agents, resulting in seemingly natural behaviors.

A profit-maximizing auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group only if the sum of their bids exceeds a reserve price declared previously by the auctioneer. For the two-bidder case with private values drawn from a uniform distribution we characterize the continuously differentiable symmetric equilibrium bidding functions for the agents, and we find the optimal reserve price for the auctioneer when such functions are used by the bidders. We also examine another interesting family of equilibrium bidding functions for this case, with a discrete number of possible bids, and show the relation~in the limit! to the differentiable bidding functions.

We present a distributed algorithm for obtaining a fair time slot allocation for link activation in a multihop radio network. We introduce the concept of maximal fairness in which the termination of a fair allocation algorithm is related to maximal reuse of the channel under a given fairness metric. The fairness metric can be freely interpreted as the expected link traffic load demands, link priorities, etc. Since respective demands for time slot allocation will not necessarily be equal, we define fairness in terms of the closeness of allocation to respective link demands while preserving the collision free property. The algorithm can be used in conjunction with existing link activation algorithms to provide a fairer and fuller utilization of the channel.

No abstract

Dalbavancin is effective in the treatment of MRSA rat sternal osteomyelitis.