[Review of] William A. Doublass and Richard W. Etulain, eds., Basque Americans: A Guide to Information Sources

This is a selected and annotated bibliography on the European and American Basques, the immigrants and their descendents known as the Amerikanauk. It is useful for both lay people and serious researchers and, short as it may seem, treats a wide variety of subjects concerning one of the least known minority ethnic groups that are an integral part of this multicultural country

Network Information Flow with Correlated Sources

In this paper, we consider a network communications problem in which multiple correlated sources must be delivered to a single data collector node, over a network of noisy independent point-to-point channels. We prove that perfect reconstruction of all the sources at the sink is possible if and only if, for all partitions of the network nodes into two subsets S and S^c such that the sink is always in S^c, we have that H(U_S|U_{S^c}) < \sum_{i\in S,j\in S^c} C_{ij}. Our main finding is that in this setup a general source/channel separation theorem holds, and that Shannon information behaves as a classical network flow, identical in nature to the flow of water in pipes. At first glance, it might seem surprising that separation holds in a fairly general network situation like the one we study. A closer look, however, reveals that the reason for this is that our model allows only for independent point-to-point channels between pairs of nodes, and not multiple-access and/or broadcast channels, for which separation is well known not to hold. This ``information as flow'' view provides an algorithmic interpretation for our results, among which perhaps the most important one is the optimality of implementing codes using a layered protocol stack.Comment: Final version, to appear in the IEEE Transactions on Information Theory -- contains (very) minor changes based on the last round of review

Broadcast Channels with Cooperating Decoders

We consider the problem of communicating over the general discrete memoryless broadcast channel (BC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.Comment: Final version, to appear in the IEEE Transactions on Information Theory -- contains (very) minor changes based on the last round of review

Excited State Specific Multi-Slater Jastrow Wave Functions

We combine recent advances in excited state variational principles, fast multi-Slater Jastrow methods, and selective configuration interaction to create multi-Slater Jastrow wave function approximations that are optimized for individual excited states. In addition to the Jastrow variables and linear expansion coefficients, this optimization includes state-specific orbital relaxations in order to avoid the compromises necessary in state-averaged approaches. We demonstrate that, when combined with variance matching to help balance the quality of the approximation across different states, this approach delivers accurate excitation energies even when using very modest multi-Slater expansions. Intriguingly, this accuracy is maintained even when studying a difficult chlorine-anion-to-$\pi^{*}$ charge transfer in which traditional state-averaged multi-reference methods must contend with different states that require drastically different orbital relaxations.Comment: 16 pages, 6 figures, 2 table