A Unified Approach for Network Information Theory

In this paper, we take a unified approach for network information theory and prove a coding theorem, which can recover most of the achievability results in network information theory that are based on random coding. The final single-letter expression has a very simple form, which was made possible by many novel elements such as a unified framework that represents various network problems in a simple and unified way, a unified coding strategy that consists of a few basic ingredients but can emulate many known coding techniques if needed, and new proof techniques beyond the use of standard covering and packing lemmas. For example, in our framework, sources, channels, states and side information are treated in a unified way and various constraints such as cost and distortion constraints are unified as a single joint-typicality constraint. Our theorem can be useful in proving many new achievability results easily and in some cases gives simpler rate expressions than those obtained using conventional approaches. Furthermore, our unified coding can strictly outperform existing schemes. For example, we obtain a generalized decode-compress-amplify-and-forward bound as a simple corollary of our main theorem and show it strictly outperforms previously known coding schemes. Using our unified framework, we formally define and characterize three types of network duality based on channel input-output reversal and network flow reversal combined with packing-covering duality.Comment: 52 pages, 7 figures, submitted to IEEE Transactions on Information theory, a shorter version will appear in Proc. IEEE ISIT 201

Noisy Network Coding with Partial DF

In this paper, we propose a noisy network coding integrated with partial decode-and-forward relaying for single-source multicast discrete memoryless networks (DMN's). Our coding scheme generalizes the partial-decode-compress-and-forward scheme (Theorem 7) by Cover and El Gamal. This is the first time the theorem is generalized for DMN's such that each relay performs both partial decode-and-forward and compress-and-forward simultaneously. Our coding scheme simultaneously generalizes both noisy network coding by Lim, Kim, El Gamal, and Chung and distributed decode-and-forward by Lim, Kim, and Kim. It is not trivial to combine the two schemes because of inherent incompatibility in their encoding and decoding strategies. We solve this problem by sending the same long message over multiple blocks at the source and at the same time by letting the source find the auxiliary covering indices that carry information about the message simultaneously over all blocks.Comment: 5 pages, 1 figure, to appear in Proc. IEEE ISIT 201

A New Achievable Scheme for Interference Relay Channels

We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding schemes. We apply our achievability to two cases. First, we characterize the capacity region of a class of discrete memoryless interference relay channels. This class naturally generalizes the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the deterministic discrete memoryless relay channel with orthogonal receiver components by Kim. Moreover, for the Gaussian interference relay channel with orthogonal receiver components, we show that our scheme achieves a better sum rate than that of noisy network coding.Comment: 18 pages, 4 figure

An Efficient State Space Generation for the Analysis of Real-Time Systems

State explosion is a well-known problem that impedes analysis and testing based on state-space exploration. This problem is particularly serious in real-time systems because unbounded time values cause the state space to be infinite even for simple systems. In this paper, we present an algorithm that produces a compact representation of the reachable state space of a real-time system. The algorithm yields a small state space, but still retains enough information for analysis. To avoid the state explosion which can be caused by simply adding time values to states, our algorithm uses history equivalence and transition bisimulation to collapse states into equivalent classes. Through history equivalence, states are merged into an equivalence class with the same untimed executions up to the states. Using transition bisimulation, the states that have the same future behaviors are further collapsed. The resultant state space is finite and can be used to analyze real-time properties. To show the effectiveness of our algorithm, we have implemented the algorithm and have analyzed several example applications

Heat Transfer Modeling of Dry Spent Nuclear Fuel Storage Facilities

The present work was undertaken to provide heat transfer model that accurately predicts the thermal performance of dry spent nuclear fuel storage facilities. One of the storage configurations being considered for DOE Aluminum-clad Spent Nuclear Fuel (Al-SNF), such as the Material and Testing Reactor (MTR) fuel, is in a dry storage facility. To support design studies of storage options a computational and experimental program has been conducted at the Savannah River Site (SRS). The main objective is to develop heat transfer models including natural convection effects internal to an interim dry storage canister and to geological codisposal Waste Package (WP). Calculated temperatures will be used to demonstrate engineering viability of a dry storage option in enclosed interim storage and geological repository WP and to assess the chemical and physical behaviors of the Al-SNF in the dry storage facilities. The current paper describes the modeling approaches and presents the computational results along with the experimental data

Thermal Performance Analysis of Repository Codisposal Waste Packages Containing Aluminum-Clad Spent Nuclear Fuel

The leading codisposal waste package (WP) design proposes that a central DOE Aluminum-clad Spent Nuclear Fuel (Al-SNF) canister be surrounded by five defense waste process facility (DWPF) glass log canisters, and placed into a WP in the Mined Geologic Disposal System (MGDS)

Heat Transfer Calculations for Normal Operations of a Fixed CST Bed Column

In support of the crystalline silicotitanate (CST) ion exchange project of High-Level Waste (HLW) Process Engineering, heat transfer calculations have been made for a fully-loaded CST column during abnormal and normal operating conditions. The objective of the present work is to compute temperature distributions across the column when there is steady flow of salt solution through the CST column under normal conditions of the process operations

Erosion Analysis for the Misaligned U2 Nozzle and its Connector Block

In support of an erosion evaluation for the misaligned mating surfaces of the U2 nozzle and its connector block in the 3H evaporator lift-separator jumper, the Engineering Modeling and Simulation Group (EMSG) has developed computational models to identify potential sites of high erosion. Two mechanisms were considered to evaluate high erosion locations representative of the actual flow process in the misaligned U2 nozzle, abrasive erosion which occurs by high wall shear of viscous liquid film, and chip-off erosion which is mainly governed by particle impingement. The results show that primary locations of the highest erosion due to particle impingement are at the occurrence of sudden change of flow direction, sudden contraction, and flow obstruction as expected. Potential damage sites due to the abrasive wall erosion are at the upstream and downstream regions of sudden changes of flow direction