Group Generalized Binary Search (Group GBS) is an extension of the well known greedy algorithm GBS, for identifying the group of an unknown object while minimizing the number of binary questions posed about that object. This problem referred to as group identification or the Equivalence Class determination problem arises in applications such as disease diagnosis, toxic chemical identification, ...

In this paper, we complete the existence of near generalized balanced tournament designs (NGBTDs) with block size 3 and 5. As an application, we obtain new classes of optimal constant composition codes.

We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate a value function approximation basis built upon piecewise-linear ridge functions, by developing and exploiting a theoretical connection with the problem of finding optimal cyclic s...

Let G = A ∗H B be the generalized free product of the groups A and B with the amalgamated subgroup H. Also, let λ(G) and ψ(G) represent the lower near Frattini subgroup of G and the near Frattini subgroup of G respectively. We show that G is ψ−free provided: (i) G is any ordinary free product of groups; (ii) G = A ∗H B and there exists an element c in G\H such thatH ∩H = 1; (iii) G = A ∗H B and...

B.-Y. Jiang, L. M. Zhang, A. H. Castro Neto, D. N. Basov, and M. M. Fogler Department of Physics, University of California San Diego, 9500 Gilman Drive, La Jolla, California 92093, USA Department of Physics, Boston University, 590 Commonwealth Avenue, Boston, Massachusetts 02215, USA Centre for Advanced 2D Materials and Graphene Research Centre, National University of Singapore, Singapore, Sing...

Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc...

We propose two classes of sub-optimum receivers for coded direct-sequence code-division multiple-access (DS/CDMA) systems based on a generalized transmitter model. Compare to the optimum detector with complexity grows exponentially with the number of active user, the proposed detectors have linear complexity and near-optimum performance. The first class is to remove the multiple-access interfer...

We consider the Born-Oppenheimer problem near conical intersection in two dimensions. For energies close to the crossing energy we describe the wave function near an isotropic crossing and show that it is related to generalized hypergeometric functions 0 F 3. This function is to a conical intersection what the Airy function is to a classical turning point. As an application we calculate the ano...