Summary The analytical roles of chromatographic variables (column length, etc.) can be soundly comprehended and compared in terms
of the precision (Φ) of measurements and efficiency (ϑ) of analysis which are described as Shannon information and information
flow, respectively. The φϑ plots of the optimization process and the information Φ transmitted by a single peak are useful
to understand the analytical structure of optimization. Variables treated here are mobile phase composition (X), column length
(L), mobile phase velocity rate (u), detection wavelength (λ) and plate number (N). 相似文献
We report on ideas, problems and results, which occupied us during the past decade and which seem to extend the frontiers of information theory in several directions. The main contributions concern information transfer by channels. There are also new questions and some answers in new models of source coding. While many of our investigations are in an explorative state, there are also hard cores of mathematical theories. In particular we present a unified theory of information transfer, which naturally incorporates Shannon's theory of information transmission and the theory of identification in the presence of noise as extremal cases. It provides several novel coding theorems. On the source coding side we introduce data compression for identification. Finally we are led beyond information theory to new concepts of solutions for probabilistic algorithms.
The original paper [R. Ahlswede, General theory of information transfer, Preprint 97-118, SFB 343 Diskrete Strukturen in der Mathematik, Universität Bielefeld, 1997] gave to and received from the ZIF-project essential stimulations which resulted in contributions added as GTIT-Supplements “Search and channels with feedback” and “Noiseless coding for multiple purposes: a combinatorial model”.
Other contributions—also to areas initiated—are published in the recent book [R. Ahlswede et al. (Eds.), General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science, vol. 4123, Springer, Berlin, 2006].
The readers are advised to study always the pioneering papers in a field—in this case the papers [R. Ahlswede, G. Dueck, Identification via channels, IEEE Trans. Inform. Theory 35 (1989) 15–29; R. Ahlswede, G. Dueck, Identification in the presence of feedback—a discovery of new capacity formulas, IEEE Trans. Inform. Theory 35 (1989) 30–39] on identification. It is not only the most rewarding way to come to new ideas, but it also helps to more quickly grasp the more advanced formalisms without going through too many technicalities. Perhaps also the recent Shannon Lecture [R. Ahlswede, Towards a General Theory of Information Transfer, Shannon Lecture at ISIT in Seattle 13th July 2006, IEEE Information Theory Society Newsletter, 2007], aiming at an even wider scope, gives further impetus. 相似文献
Wireless mobile networks from the fifth generation (5G) and beyond serve as platforms for flexible support of heterogeneous traffic types with diverse performance requirements. In particular, the broadband services aim for the traditional rate optimization, while the time-sensitive services aim for the optimization of latency and reliability, and some novel metrics such as Age of Information (AoI). In such settings, the key question is the one of spectrum slicing: how these services share the same chunk of available spectrum while meeting the heterogeneous requirements. In this work we investigated the two canonical frameworks for spectrum sharing, Orthogonal Multiple Access (OMA) and Non-Orthogonal Multiple Access (NOMA), in a simple, but insightful setup with a single time-slotted shared frequency channel, involving one broadband user, aiming to maximize throughput and using packet-level coding to protect its transmissions from noise and interference, and several intermittent users, aiming to either to improve their latency-reliability performance or to minimize their AoI. We analytically assessed the performances of Time Division Multiple Access (TDMA) and ALOHA-based schemes in both OMA and NOMA frameworks by deriving their Pareto regions and the corresponding optimal values of their parameters. Our results show that NOMA can outperform traditional OMA in latency-reliability oriented systems in most conditions, but OMA performs slightly better in age-oriented systems. 相似文献