منابع مشابه
Bounds on the Sizes of Constant Weight Covering Codes
Motivated by applications in universal data compression algorithms we study the problem of bounds on the sizes of constant weight covering codes. We are concerned with the minimal sizes of codes of length n and constant weight u such that every word of length n and weight v is within Hamming distance d from a codeword. In addition to a brief summary of part of the relevant literature, we also g...
متن کاملStar - A Multiple Domain Dialog Manager
We present a dialogue manager that is able to handle multiple domains simultaneously. Our dialogue manager consists of five modules, one of which, the Task Manager, deserves special attention. Each domain is represented by a frame, which is in turn composed by slots and rules. Slots define domain data relationships, and rules define the system’s behavior. The use of frames allowed the remaining...
متن کاملCovering a Continuous Domain by Distributed, Limited Robots
We present an algorithm for covering continuous domains by primitive robots whose only ability is to mark visited places with pheromone and to sense the level of the pheromone in their neighborhood. These pheromone marks can be sensed by all robots and thus provide a way for indirect communication between the robots. Apart from this, the robots have no means to communicate. Additionally they ar...
متن کاملThe Cheeger Constant of a Jordan Domain without Necks
We show that the maximal Cheeger set of a Jordan domain Ω without necks is the union of all balls of radius r = h(Ω)−1 contained in Ω. Here, h(Ω) denotes the Cheeger constant of Ω, that is, the infimum of the ratio of perimeter over area among subsets of Ω, and a Cheeger set is a set attaining the infimum. The radius r is shown to be the unique number such that the area of the inner parallel se...
متن کاملOn super (a, d)-antimagic total covering of star related graphs
Let G = (V (G), E(G)) be a simple graph and H be a subgraph of G. G admits anH-covering, if every edge in E(G) belongs to at least one subgraph of G that is isomorphic to H. An (a, d)-H-antimagic total labeling of G is a bijection λ : V (G) ∪ E(G) → {1, 2, 3, . . . , |V (G)|+ |E(G)|} such that for all subgraphs H ′ isomorphic to H, the H ′ weights wt(H ) = ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1970
ISSN: 0022-314X
DOI: 10.1016/0022-314x(70)90057-0