Much recent research has focused on the applications of games with ω-regular objectives in the control and verification of reactive systems. However, many of the game-based models are ill-suited for these applications, because they assume that each player has complete information about the state of the system (they are “perfect-information” games). This is because in many situations, a controll...

We present a simple proof of existence of subgame perfect equilibria in games with perfect information.

In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...

ion. Lower levels are not aware of the resources used at higher levels» Levels of abstraction are used in the resource management to provide users with virtual devices (Liskov, 1972b). In addition to the work described above in implementing specific hierarchies, research has been active in exploring various concepts used in the design of hierarchically-structured systems. These concepts in­ clu...

THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....

Archaeologists working on plantation sites have typically ignored the role that violence played in the lives of enslaved African-Americans. By drawing together examples from archaeological publications in which violence has been mentioned, the commentary illustrates not only both the types and scale of violence endured by African-Americans, but also how archaeologists have effectively sanitized...

We consider the size of circuits that perfectly hash an arbitrary subset S⊂{0, 1} of cardinality 2 into {0, 1}. We observe that, in general, the size of such circuits is exponential in 2k−m, and provide a matching upper bound.