For Today's Logistics Manager, It's a Jungle out There! Customer-mandated programs with a wide variety of names (JIT, Quick Response, Vendor Managed Inventory, etc.) all share common requirements such as compliance labeling and shrinking order-cycle times. Internal demands to reduce inventory levels coupled with an ever-increasing number of stock keeping units (SKUs) makes the job even more dif...

The views expressed herein are those of the authors and not necessarily those of the Federal Reserve Bank of Minneapolis or the Federal Reserve System.

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...

We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bitboards. Moreover, we show that simple variations of these schemes give minimal perfect hashing schemes. The new method is applicable provided N , the number of k-bit spaced positions that may be set to 1, is not more t...

A Set S of vertices in a graph G(V,E) is called dominating set,if every vertex v V id either an element or adjacent to S. vertice Total set if S, total G with no isolated subset the such that In this paper we will find perfect Interval graph. We also out induced subgraph regarding which were splitted.

Given a graph G = (V,E), a perfect dominating set is a subset of vertices V ′ ⊆ V (G) such that each vertex v ∈ V (G) \ V ′ is dominated by exactly one vertex v ∈ V . An efficient dominating set is a perfect dominating set V ′ where V ′ is also an independent set. These problems are usually posed in terms of edges instead of vertices. Both problems, either for the vertex or edge variant, remain...

Let D denote a disk of unit area. We call a set A ⊂ D perfect if it has measure 1/2 and, with respect to any axial symmetry of D, the maximal symmetric subset of A has measure 1/4. We call a curve β in D an yin-yang line if • β splits D into two congruent perfect sets, • β crosses each concentric circle of D twice, • β crosses each radius of D once. We prove that Fermat’s spiral is a unique yin...

We consider the problem of partitioning n integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen uniformly from the set {1, . . . , M}. We study how the typical behavior of the optimal partition depends on n, M and the bias s, the difference between the cardinal...

asiatic citrus canker is a devastating disease resulting in drastic economic losses in citriculture worldwide. amongst three different types of the disease, i.e. a, a* and aw, the a* type is genetically less known. in order to comprehend the behavior of the asiatic citrus canker a*-type strain (xanthomonas citri subsp. citri) in the vicinity of the host cells, a targeted semi-quantitative trans...

A matching M of a graph G is maximal if it not proper subset any other in G. Maximal matchings are much less known and researched than their maximum perfect counterparts. In this paper we present the recurrences generating functions for sequences enumerating two classes chemically interesting linear polymers: polyspiro chains benzenoid chains. We also analyze asymptotic behavior those determine...