DOCSLIB.ORG

State Fusion Entropy for Continuous and Site-Specific Analysis of Landslide Stability Changing Regularities

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
State Fusion Entropy for Continuous and Site-Specific Analysis of Landslide Stability Changing Regularities Nat. Hazards Earth Syst. Sci., 18, 1187–1199, 2018 https://doi.org/10.5194/nhess-18-1187-2018 © Author(s) 2018. This work is distributed under the Creative Commons Attribution 4.0 License. State fusion entropy for continuous and site-specific analysis of landslide stability changing regularities Yong Liu, Zhimeng Qin, Baodan Hu, and Shuai Feng School of Mechanical Engineering and Electronic Information, China University of Geosciences, Wuhan, 430074, China Correspondence: Zhimeng Qin ([email protected]) Received: 6 October 2017 – Discussion started: 1 November 2017 Revised: 21 March 2018 – Accepted: 23 March 2018 – Published: 19 April 2018 Abstract. Stability analysis is of great significance to land- fiths and Fenton, 2004). Saito’s method is an empirical fore- slide hazard prevention, especially the dynamic stability. cast model and is suitable for the prediction of sliding ten- However, many existing stability analysis methods are dif- dency and then the failure time. Based on homogeneous soil ficult to analyse the continuous landslide stability and its creep theory and displacement curve, it divides displacement changing regularities in a uniform criterion due to the unique creep curves into three stages – deceleration creep, stable landslide geological conditions. Based on the relationship creep and accelerating creep – and establishes a differential between displacement monitoring data, deformation states equation for accelerating creep. The physical basis of Saito’s and landslide stability, a state fusion entropy method is herein method helped it to successfully forecast a landslide that oc- proposed to derive landslide instability through a comprehen- curred in Japan in December 1960, but also makes it strongly sive multi-attribute entropy analysis of deformation states, dependent on field observations. LEM is a kind of calcula- which are defined by a proposed joint clustering method tion method to evaluate landslide stability based on mechan- combining K-means and a cloud model. Taking Xintan land- ical balance principle. By assuming a potential sliding sur- slide as the detailed case study, cumulative state fusion en- face and slicing the sliding body on the potential sliding sur- tropy presents an obvious increasing trend after the landslide face firstly, LEM calculates the shear resistance and the shear entered accelerative deformation stage and historical max- force of each slice along the potential sliding surface and de- ima match highly with landslide macroscopic deformation fines their ratio as the safety factor to describe landslide sta- behaviours in key time nodes. Reasonable results are also bility. LEM is simple and can directly analyse landslide sta- obtained in its application to several other landslides in the bility under limit condition without geotechnical constitutive Three Gorges Reservoir in China. Combined with field sur- analysis. However, this neglect of geotechnical constitutive vey, state fusion entropy may serve for assessing landslide characteristic also restricts it to a static mechanics evalua- stability and judging landslide evolutionary stages. tion model that is incapable of evaluating the changing regu- larities of landslide stability. LEM involves too many physi- cal parameters, such as cohesive strength and friction angle, which makes it greatly limited in landslide forecast. As a typ- 1 Introduction ical numerical simulation method, FEM subdivides a large problem into smaller, simpler parts that are called finite ele- Landslides are some of the greatest natural hazards, account- ments. The simple equations that model these finite elements ing for massive damages of properties every year (Dai et al., are then assembled into a larger system of equations that 2002). Analysis of landslide stability as well as its chang- models the entire problem. FEM then uses variational meth- ing regularities plays a significant role in risk assessment at ods from the calculus of variations to approximate a solu- site-specific landslides (Wang et al., 2014). For this concern, tion by minimising an associated error function. In landslide many stability analysis methods have been proposed, such as stability analysis, FEM not only satisfies the static equilib- Saito’s method, limit equilibrium method (LEM) and finite rium condition and the geotechnical constitutive characteris- element method (FEM) (Saito, 1965; Duncan, 1996; Grif- Published by Copernicus Publications on behalf of the European Geosciences Union. 1188 Y. Liu et al.: State fusion entropy for continuous analysis of landslide stability changing regularities tic but also adapts to the discontinuity and heterogeneity of based on original data and personal engineering geological the rock mass. However, FEM is quite sensitive to various in- experience. volved parameters and the computation will increase greatly Entropy has been widely used to describe the disorder, to get more accurate results. If parameters and boundaries imbalance and uncertainty of a system (Montesarchio et al., are precisely determined, LEM and FEM can provide results 2011; Ridolfi et al., 2011). Previous works have introduced with high reliability. Other stability analysis methods such as entropy into landslide susceptibility mapping to evaluate the the strength reduction method also have been rapidly applied weights of indexes (Pourghasemi et al., 2012; Devkota et al., (Dawson et al., 2015). These methods provide the theoretical 2013). From the viewpoint of system theory, a landslide can basis for analysing landslide stability and have been widely be regarded as an open system that exchanges energy and in- applied in engineering geology (Knappett, 2008; Morales- formation with external factors. Shi and Jin (2009) proposed Esteban et al., 2015). a generalized information entropy approach (GIE) to eval- Despite of the great contributions made by these stabil- uate the “energy” of multi-triggers of landslide and found ity analysis methods, there are a few matters cannot be ne- that the GIE index showed a mutation before landslide fail- glected. Firstly, the safety factor is the most adopted index ure in a case study. But this GIE method is aimed at landslide to indicate landslide stability (Hsu and Chien, 2016), but triggering factors and thus cannot directly indicate landslide it mainly indicates safe (larger than 1) or unsafe (smaller stability. than 1) and is incapable of showing the degree of stabil- In this paper, a state fusion entropy (SFE) approach is pro- ity or instability (Li et al., 2009; Singh et al., 2012). Sec- posed for continuous and site-specific analysis of landslide ondly, external factors such as rainfall (Priest et al., 2011; stability changing regularities. It firstly defines deformation Bernardie et al., 2015; Liu et al., 2016) and fluctuation of states as an integrated numerical feature of landslide defor- water level (Ashland et al., 2006; Huang et al., 2017b) will mation. Considering the multiple attributes of deformation also change landslide stability. However, currently only a few states, entropy is adopted for landslide stability (instability) studies have mentioned real-time landslide stability (Mon- analysis. Correspondingly, a historical maximum index is in- trasio et al., 2011; Chen et al., 2014). Thirdly, methods like troduced to identify key time nodes of stability changes. LEM and FEM involve too many physical parameters whose uncertainties make these methods hard to match with the real-time conditions of landslide. It becomes of great inter- 2 Methods est to find a new method to evaluate landslide stability that only requires a few parameters, can easily be matched with In this paper, a landslide is regarded as an open dynamic landslide real-time conditions and can indicate the extent as system, and landslide stability (instability) is the source of well as the changing regularities of landslide stability. the system. Under the influence of external factors, landslide Displacement is the most direct and continuous manifes- stability will respond to these triggers by generating defor- tation of landslide deformation promoted by external factors mation states. Eventually, deformation states will be mani- and has been widely used in landslide analysis (Asch et al., fested in the form of landslide displacement. Therefore, to 2009; Manconi and Giordan, 2015; Huang et al., 2017a). analyse landslide stability based on displacement monitor- Due to its easy acquisition, quantification and high reliabil- ing data, defining deformation states is the primary founda- ity, displacement monitoring data have become some of the tion. In order to adapt to the unique geological conditions most recognised evidence for landslide stability analysis and of different landslides, a joint clustering method combining early warning. Macciotta et al. (2016) suggested that veloc- K-means clustering and cloud modeling is proposed. Aiming ity threshold be used as a criterion for an early warning sys- for three typical characteristics of deformation states, entropy tem and that the annual horizontal displacement threshold analysis is then conducted and fused to analyse landslide in- for Ripley landslide (GPS 1) can be 90 mm and that between stability and its changing regularities. A result interpretation May and September can be 25 mm. Based on the analysis method is proposed correspondingly. The flow chart is shown of a large number of displacement monitoring data, Xu and in Fig. 1. Zeng (2009) proposed that deformation acceleration be used as an indicator of landslide warning; the
Load more

Recommended publications
  • Package 'Infotheo'
    Package ‘infotheo’ February 20, 2015 Title Information-Theoretic Measures Version 1.2.0 Date 2014-07 Publication 2009-08-14 Author Patrick E. Meyer Description This package implements various measures of information theory based on several en- tropy estimators. Maintainer Patrick E. Meyer <[email protected]> License GPL (>= 3) URL http://homepage.meyerp.com/software Repository CRAN NeedsCompilation yes Date/Publication 2014-07-26 08:08:09 R topics documented: condentropy . .2 condinformation . .3 discretize . .4 entropy . .5 infotheo . .6 interinformation . .7 multiinformation . .8 mutinformation . .9 natstobits . 10 Index 12 1 2 condentropy condentropy conditional entropy computation Description condentropy takes two random vectors, X and Y, as input and returns the conditional entropy, H(X|Y), in nats (base e), according to the entropy estimator method. If Y is not supplied the function returns the entropy of X - see entropy. Usage condentropy(X, Y=NULL, method="emp") Arguments X data.frame denoting a random variable or random vector where columns contain variables/features and rows contain outcomes/samples. Y data.frame denoting a conditioning random variable or random vector where columns contain variables/features and rows contain outcomes/samples. method The name of the entropy estimator. The package implements four estimators : "emp", "mm", "shrink", "sg" (default:"emp") - see details. These estimators require discrete data values - see discretize. Details • "emp" : This estimator computes the entropy of the empirical probability distribution. • "mm" : This is the Miller-Madow asymptotic bias corrected empirical estimator. • "shrink" : This is a shrinkage estimate of the entropy of a Dirichlet probability distribution. • "sg" : This is the Schurmann-Grassberger estimate of the entropy of a Dirichlet probability distribution.
    [Show full text]
  • A Flow-Based Entropy Characterization of a Nated Network and Its Application on Intrusion Detection
    A Flow-based Entropy Characterization of a NATed Network and its Application on Intrusion Detection J. Crichigno1, E. Kfoury1, E. Bou-Harb2, N. Ghani3, Y. Prieto4, C. Vega4, J. Pezoa4, C. Huang1, D. Torres5 1Integrated Information Technology Department, University of South Carolina, Columbia (SC), USA 2Cyber Threat Intelligence Laboratory, Florida Atlantic University, Boca Raton (FL), USA 3Electrical Engineering Department, University of South Florida, Tampa (FL), USA 4Electrical Engineering Department, Universidad de Concepcion, Concepcion, Chile 5Department of Mathematics, Northern New Mexico College, Espanola (NM), USA Abstract—This paper presents a flow-based entropy charac- information is collected by the device and then exported for terization of a small/medium-sized campus network that uses storage and analysis. Thus, the performance impact is minimal network address translation (NAT). Although most networks and no additional capturing devices are needed [3]-[5]. follow this configuration, their entropy characterization has not been previously studied. Measurements from a production Entropy has been used in the past to detect anomalies, network show that the entropies of flow elements (external without requiring payload inspection. Its use is appealing IP address, external port, campus IP address, campus port) because it provides more information on flow elements (ports, and tuples have particular characteristics. Findings include: i) addresses, tuples) than traffic volume analysis. Entropy has entropies may widely vary in the course of a day. For example, also been used for anomaly detection in backbones and large in a typical weekday, the entropies of the campus and external ports may vary from below 0.2 to above 0.8 (in a normalized networks.
    [Show full text]
  • Bits, Bans Y Nats: Unidades De Medida De Cantidad De Información
    Bits, bans y nats: Unidades de medida de cantidad de información Junio de 2017 Apellidos, Nombre: Flores Asenjo, Santiago J. (sfl[email protected]) Departamento: Dep. de Comunicaciones Centro: EPS de Gandia 1 Introducción: bits Resumen Todo el mundo conoce el bit como unidad de medida de can- tidad de información, pero pocos utilizan otras unidades también válidas tanto para esta magnitud como para la entropía en el ám- bito de la Teoría de la Información. En este artículo se presentará el nat y el ban (también deno- minado hartley), y se relacionarán con el bit. Objetivos y conocimientos previos Los objetivos de aprendizaje este artículo docente se presentan en la tabla 1. Aunque se trata de un artículo divulgativo, cualquier conocimiento sobre Teo- ría de la Información que tenga el lector le será útil para asimilar mejor el contenido. 1. Mostrar unidades alternativas al bit para medir la cantidad de información y la entropía 2. Presentar las unidades ban (o hartley) y nat 3. Contextualizar cada unidad con la historia de la Teoría de la Información 4. Utilizar la Wikipedia como herramienta de referencia 5. Animar a la edición de la Wikipedia, completando los artículos en español, una vez aprendidos los conceptos presentados y su contexto histórico Tabla 1: Objetivos de aprendizaje del artículo docente 1 Introducción: bits El bit es utilizado de forma universal como unidad de medida básica de canti- dad de información. Su nombre proviene de la composición de las dos palabras binary digit (dígito binario, en inglés) por ser históricamente utilizado para denominar cada uno de los dos posibles valores binarios utilizados en compu- tación (0 y 1).
    [Show full text]
  • The Indefinite Logarithm, Logarithmic Units, and the Nature of Entropy
    The Indefinite Logarithm, Logarithmic Units, and the Nature of Entropy Michael P. Frank FAMU-FSU College of Engineering Dept. of Electrical & Computer Engineering 2525 Pottsdamer St., Rm. 341 Tallahassee, FL 32310 [email protected] August 20, 2017 Abstract We define the indefinite logarithm [log x] of a real number x> 0 to be a mathematical object representing the abstract concept of the logarithm of x with an indeterminate base (i.e., not specifically e, 10, 2, or any fixed number). The resulting indefinite logarithmic quantities naturally play a mathematical role that is closely analogous to that of dimensional physi- cal quantities (such as length) in that, although these quantities have no definite interpretation as ordinary numbers, nevertheless the ratio of two of these entities is naturally well-defined as a specific, ordinary number, just like the ratio of two lengths. As a result, indefinite logarithm objects can serve as the basis for logarithmic spaces, which are natural systems of logarithmic units suitable for measuring any quantity defined on a log- arithmic scale. We illustrate how logarithmic units provide a convenient language for explaining the complete conceptual unification of the dis- parate systems of units that are presently used for a variety of quantities that are conventionally considered distinct, such as, in particular, physical entropy and information-theoretic entropy. 1 Introduction The goal of this paper is to help clear up what is perceived to be a widespread arXiv:physics/0506128v1 [physics.gen-ph] 15 Jun 2005 confusion that can found in many popular sources (websites, popular books, etc.) regarding the proper mathematical status of a variety of physical quantities that are conventionally defined on logarithmic scales.
    [Show full text]
  • Quantum Information Chapter 10. Quantum Shannon Theory
    Quantum Information Chapter 10. Quantum Shannon Theory John Preskill Institute for Quantum Information and Matter California Institute of Technology Updated June 2016 For further updates and additional chapters, see: http://www.theory.caltech.edu/people/preskill/ph219/ Please send corrections to [email protected] Contents 10 Quantum Shannon Theory 1 10.1 Shannon for Dummies 2 10.1.1 Shannon entropy and data compression 2 10.1.2 Joint typicality, conditional entropy, and mutual infor- mation 6 10.1.3 Distributed source coding 8 10.1.4 The noisy channel coding theorem 9 10.2 Von Neumann Entropy 16 10.2.1 Mathematical properties of H(ρ) 18 10.2.2 Mixing, measurement, and entropy 20 10.2.3 Strong subadditivity 21 10.2.4 Monotonicity of mutual information 23 10.2.5 Entropy and thermodynamics 24 10.2.6 Bekenstein’s entropy bound. 26 10.2.7 Entropic uncertainty relations 27 10.3 Quantum Source Coding 30 10.3.1 Quantum compression: an example 31 10.3.2 Schumacher compression in general 34 10.4 Entanglement Concentration and Dilution 38 10.5 Quantifying Mixed-State Entanglement 45 10.5.1 Asymptotic irreversibility under LOCC 45 10.5.2 Squashed entanglement 47 10.5.3 Entanglement monogamy 48 10.6 Accessible Information 50 10.6.1 How much can we learn from a measurement? 50 10.6.2 Holevo bound 51 10.6.3 Monotonicity of Holevo χ 53 10.6.4 Improved distinguishability through coding: an example 54 10.6.5 Classical capacity of a quantum channel 58 ii Contents iii 10.6.6 Entanglement-breaking channels 62 10.7 Quantum Channel Capacities and Decoupling
    [Show full text]
  • A Passive Photon–Atom Qubit Swap Operation
    LETTERS https://doi.org/10.1038/s41567-018-0241-6 A passive photon–atom qubit swap operation Orel Bechler1,3, Adrien Borne1,3, Serge Rosenblum1,3, Gabriel Guendelman1, Ori Ezrah Mor1, Moran Netser1, Tal Ohana1, Ziv Aqua1, Niv Drucker1, Ran Finkelstein1, Yulia Lovsky1, Rachel Bruch1, Doron Gurovich1, Ehud Shafir1,2 and Barak Dayan 1* Deterministic quantum interactions between single photons emitter to end up in one of its two ground states depending on the and single quantum emitters are a vital building block towards input mode of a single photon. Initially considered in ref. 25 and the distribution of quantum information between remote sys- analysed in a series of theoretical works15,26–28, this mechanism was tems1–4. Deterministic photon–atom state transfer has previ- first realized experimentally to create an all-optical single-photon ously been demonstrated with protocols that include active switch11, and to demonstrate deterministic extraction of a single feedback or synchronized control pulses5–10. Here we demon- photon from optical pulses13. The effect was also demonstrated in strate a passive swap operation between the states of a sin- superconducting circuits, where it enabled frequency conversion of gle photon and a single atom. The underlying mechanism is microwave fields12 and highly efficient detection of single micro- single-photon Raman interaction11–15—an interference-based wave photons14. scheme that leads to deterministic interaction between two The configuration that leads to SPRINT includes a Λ -system in photonic modes and the two ground states of a Λ -system. which each of its two transitions is coupled, with the same coopera- Using a nanofibre-coupled microsphere resonator coupled to tivity C, to a different mode of an optical waveguide.
    [Show full text]
  • Passive NAT Detection Using HTTP Logs
    master’s thesis Passive NAT detection using HTTP logs Tomáš Komárek May 2015 Supervisor: Ing. Martin Grill Czech Technical University in Prague Faculty of Electrical Engineering Department of Control Engineering Acknowledgment First and foremost, I would like to acknowledge my supervisor Ing. Martin Grill for his interest, help and guidance throughout my diploma thesis. In addition, I would like to thank Ing. Tomáš Pevný, Ph.D. for his helpful suggestions and comments during this work. Special thanks go to all the people at CISCO, for providing a nice and friendly working environment. Last but not least, I would like to thank my girlfriend Teraza and my brother Lukáš who inspire me all the time. Declaration I declare that I worked out the presented thesis independently and I quoted all used sources of information in accord with Methodical instructions about ethical principles for writing academic thesis. Abstract Network devices performing NAT prove to be a double edge sword. They can easily overcome the problem with the deficit of IPv4 addresses as well as introduce a vulnerability to the network. Therefore detecting NAT devices is an important task in the network security domain. In this thesis, a novel passive NAT detection algorithm is proposed. It infers NAT devices in the networks using statistical behavior analysis of HTTP logs. These network traffic data are often already collected and available at proxy servers, which enables the wide applicability of the solution. On the basis of our experimen- tal evaluations, proposed algorithm detection capabilities are better than the state-of-the art NAT detection approaches.
    [Show full text]
  • Information and Thermodynamics
    The Second Law and Informatics Oded Kafri Varicom Communications, Tel Aviv 68165 Israel. Abstract A unification of thermodynamics and information theory is proposed. It is argued that similarly to the randomness due to collisions in thermal systems, the quenched randomness that exists in data files in informatics systems contributes to entropy. Therefore, it is possible to define equilibrium and to calculate temperature for informatics systems. The obtained temperature yields correctly the Shannon information balance in informatics systems and is consistent with the Clausius inequality and the Carnot cycle. 1 Introduction Heat is the energy transferred from one body to another. The second law of thermodynamics gives us universal tools to determine the direction of the heat flow. A process is likely to happen if at its end the entropy increases. Similarly, energy distribution of particles will evolve to a distribution that maximizes the Boltzmann -H function [1] namely, an equilibrium state, where entropy and temperature are well defined. Information technology (IT) is governed by energy flow. Processes like data transmission, registration and manipulation are all energy consuming. It is accepted that energy flow in computers and IT are subject to the same physical laws as in heat engines or chemical reactions. Nevertheless, no consistent thermodynamic theory for IT was proposed. Hereafter, a thermodynamic theory of communication is considered. The discussion starts by drawing a thermodynamic analogy between a spontaneous heat flow from a hot body to a cold one and energy flow from a broadcasting antenna to receiving antennas. This analogy may look quiet natural. When a file is transmitted from a transmitter to the receivers, the transmitted file's energy, thermodynamically speaking, is heat.
    [Show full text]
  • Objective Functions for Information-Theoretical Monitoring Network Design: What Is “Optimal”?
    Hydrol. Earth Syst. Sci., 25, 831–850, 2021 https://doi.org/10.5194/hess-25-831-2021 © Author(s) 2021. This work is distributed under the Creative Commons Attribution 4.0 License. Objective functions for information-theoretical monitoring network design: what is “optimal”? Hossein Foroozand and Steven V. Weijs Department of Civil Engineering, University of British Columbia, Vancouver, British Columbia, Canada Correspondence: Steven V. Weijs ([email protected]) Received: 1 April 2020 – Discussion started: 17 April 2020 Revised: 26 November 2020 – Accepted: 7 December 2020 – Published: 19 February 2021 Abstract. This paper concerns the problem of optimal mon- sensors, to identify optimal subsets. Jointly, these papers (Al- itoring network layout using information-theoretical meth- fonso et al., 2010a,b; Li et al., 2012; Ridolfi et al., 2011; ods. Numerous different objectives based on information Samuel et al., 2013; Stosic et al., 2017; Keum and Coulibaly, measures have been proposed in recent literature, often fo- 2017; Banik et al., 2017; Wang et al., 2018; Huang et al., cusing simultaneously on maximum information and mini- 2020; Khorshidi et al., 2020) have proposed a wide variety of mum dependence between the chosen locations for data col- different optimization objectives. Some have suggested that lection stations. We discuss these objective functions and either a multi-objective approach or a single objective de- conclude that a single-objective optimization of joint entropy rived from multiple objectives is necessary to find an optimal suffices to maximize the collection of information for a given monitoring network. These methods were often compared to number of stations.
    [Show full text]
  • The Use of Information Theory in Evolutionary Biology Christoph
    The Use of Information Theory in Evolutionary Biology Christoph Adami1,2,3 1Department of Microbiology and Molecular Genetics 2Department of Physics and Astronomy 3BEACON Center for the Study of Evolution in Action Michigan State University, East Lansing, MI 48824 Abstract Information is a key concept in evolutionary biology. Information is stored in biological organism’s genomes, and used to generate the organism as well as to maintain and control it. Information is also “that which evolves”. When a population adapts to a local environment, information about this environment is fixed in a representative genome. However, when an environment changes, information can be lost. At the same time, information is processed by animal brains to survive in complex environments, and the capacity for information processing also evolves. Here I review applications of information theory to the evolution of proteins as well as to the evolution of information processing in simulated agents that adapt to perform a complex task. 1. Introduction Evolutionary biology has traditionally been a science that used observation and the analysis of specimens to draw inferences about common descent, adaptation, variation, and selection1,2. In contrast to this discipline that requires fieldwork and meticulous attention to detail stands the mathematical theory of population genetics3,4, which developed in parallel but somewhat removed from evolutionary biology, as it could treat exactly only very abstract cases. The mathematical theory cast Darwin’s insight about inheritance, variation, and selection into formulae that could predict particular aspects of the evolutionary process, such as the probability that an allele that conferred a particular advantage would go to fixation, how long this process would take, and how it would be modified by different forms of inheritance.
    [Show full text]
  • Information Theory in Neuroscience
    entropy Editorial Information Theory in Neuroscience Eugenio Piasini 1,* and Stefano Panzeri 2,* 1 Computational Neuroscience Initiative and Department of Physics and Astronomy, University of Pennsylvania, Philadelphia, PA 19104, USA 2 Neural Computation Laboratory, Center for Neuroscience and Cognitive Systems @UniTn, Istituto Italiano di Tecnologia, 38068 Rovereto (TN), Italy * Correspondence: [email protected] (E.P.); [email protected] (S.P.) Received: 26 December 2018; Accepted: 9 January 2019; Published: 14 January 2019 Abstract: This is the Editorial article summarizing the scope and contents of the Special Issue, Information Theory in Neuroscience. Keywords: information theory; neuroscience As the ultimate information processing device, the brain naturally lends itself to be studied with information theory. Because of this, information theory [1] has been applied to the study of the brain systematically for many decades and has been instrumental in many advances. It has spurred the development of principled theories of brain function [2–8]. It has led to advances in the study of consciousness [9]. It has also led to the development of many influential neural recording analysis techniques to crack the neural code, that is to unveil the language used by neurons to encode and process information [10–15]. The influence of information theory on the study of neural information processing continues today in many ways. In particular, concepts from information theory are beginning to be applied to the large-scale recordings of
    [Show full text]
  • Information Theory and Coding
    Information Theory and Coding Subject Code : 10EC55 IA Marks : 25 No. of Lecture Hrs/Week : 04 Exam Hours : 03 Total no. of Lecture Hrs. : 52 Exam Marks : 100 PART - A Unit – 1: Information Theory: Introduction, Measure of information, Average information content of symbols in long independent sequences, Average information content of symbols in long dependent sequences. Mark-off statistical model for information source, Entropy and information rate of mark-off source. 6 Hours Unit – 2: Source Coding: Encoding of the source output, Shannon‟s encoding algorithm. Communication Channels, Discrete communication channels, Continuous channels. 6 Hours Unit – 3: Fundamental Limits on Performance: Source coding theorem, Huffman coding, Discrete memory less Channels, Mutual information, Channel Capacity. 6 Hours Unit – 4: Channel coding theorem, Differential entropy and mutual information for continuous ensembles, Channel capacity Theorem. 6 Hours PART - B Unit – 5: Introduction to Error Control Coding: Introduction, Types of errors, examples, Types of codes Linear Block Codes: Matrix description, Error detection and correction, Standard arrays and table look up for decoding. 7 Hours Unit – 6: Binary Cycle Codes, Algebraic structures of cyclic codes, Encoding using an (n-k) bit shift register, Syndrome calculation. BCH codes. 7 Hours Unit – 7: RS codes, Golay codes, Shortened cyclic codes, Burst error correcting codes. Burst and Random Error correcting codes. 7 Hours Unit – 8: Convolution Codes, Time domain approach. Transform domain approach. 7Hours Text Books: Digital and analog communication systems, K. Sam Shanmugam, John Wiley, 1996. Digital communication, Simon Haykin, John Wiley, 2003. Reference Books: ITC and Cryptography, Ranjan Bose, TMH, II edition, 2007 Digital Communications - Glover and Grant; Pearson Ed.
    [Show full text]