Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca
| Cellular Automata and Discrete Complex Systems [[electronic resource] ] : 23rd IFIP WG 1.5 International Workshop, AUTOMATA 2017, Milan, Italy, June 7-9, 2017, Proceedings / / edited by Alberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (XVI, 201 p. 48 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer simulation Computer networks Computer science—Mathematics Mathematical statistics Machine theory Theory of Computation Computer Modelling Computer Communication Networks Probability and Statistics in Computer Science Formal Languages and Automata Theory |
| ISBN | 3-319-58631-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Two Dimensional Cellular Automata and Computational Complexity -- Fixed Points in Boolean Networks -- Contents -- Invited Papers -- Strict Asymptotic Nilpotency in Cellular Automata -- 1 Introduction -- 2 Nilpotency on Multidimensional Full Shifts -- 3 Nilpotency from a Subset of Configurations -- 4 Nilpotency on Multidimensional Subshifts -- 4.1 SFTs -- 4.2 Sofics (and Beyond) -- 5 Nilpotency as Uniform Convergence to a Point -- 6 Cellular Automata on Graphs and Groups -- 6.1 What Works on General Groups? -- 7 CA with Very Sparse Spacetime Diagrams -- References -- Regular Papers -- Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties -- 1 Introduction -- 2 Preliminaries -- 3 Two-Dimensional Codes -- 4 Infinite Strong Prefix Codes -- 5 Measure of Two-Dimensional Languages and Codes -- References -- Restricted Binary Strings and Generalized Fibonacci Numbers -- 1 Introduction -- 2 A Simple Bijection and Some Applications -- 3 Number of 1's in the Strings of Fn(k) -- 4 Conclusion -- References -- Von Neumann Regular Cellular Automata -- 1 Introduction -- 2 Regular Cellular Automata -- 3 Regular Finite Cellular Automata -- 4 Regular Linear Cellular Automata -- References -- Enumerative Results on the Schröder Pattern Poset -- 1 Introduction -- 2 The Covering Relation in the Schröder Pattern Poset -- 3 Enumerative Results on Pattern Avoiding Schröder Paths -- 3.1 The Pattern (UD)k -- 3.2 The Pattern Uk Dk -- 3.3 The Pattern H2 k -- 3.4 The Pattern UH2 k-1D -- 3.5 The Pattern H2 k-1UD -- 4 Suggestions for Further Work -- References -- Canonical Form of Gray Codes in N-cubes -- 1 Introduction -- 2 Canonical Form of Gray Codes -- 2.1 Isomorphic Cycles -- 2.2 Preliminary Tools -- 2.3 Canonical Form -- 2.4 Examples of Application of C.
2.5 Discussion over the Interest of the Canonical Form -- 3 Balanced Gray Codes Generation Algorithm -- 4 Application -- 4.1 Validation of the Canonical Form and the Generation Algorithm -- 4.2 Application of the Balanced Gray Code Generation Algorithm -- 5 Conclusion -- References -- Equicontinuity and Sensitivity of Nondeterministic Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Cellular Automata -- 2.2 Nondeterministic Cellular Automata -- 3 Equicontinuity -- 4 Sensitivity -- 5 Transitivity -- 6 Conclusions -- References -- Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules -- 1 Introduction -- 2 Definitions -- 3 First Steps in the Space of Diploids -- 3.1 Experimental Protocol -- 3.2 Mixtures with the Null Rule (ECA 0) -- 3.3 Mixtures with the Identity Rule: -asynchronous ECA -- 3.4 Mixtures with the Inversion Rule (ECA 51) -- 4 Discussion -- References -- On the Computational Complexity of the Freezing Non-strict Majority Automata -- 1 Introduction -- 2 Preliminaries -- 3 A Characterization of Stable Sets -- 4 The Algorithm -- 5 Conclusion -- References -- Distortion in One-Head Machines and Cellular Automata -- 1 Introduction -- 2 Definitions -- 2.1 Subshifts and Cellular Automata -- 2.2 Neighborhoods and Radii -- 2.3 Distortion -- 3 Distorted One-Head Machines -- 3.1 One-Head Machines -- 3.2 Speed Trichotomy -- 3.3 Aperiodic Machines -- 3.4 Distortion on Sofic Shifts -- 3.5 Undecidability of Distortion -- 4 Unbalanced Distortion in General Subshifts -- 5 Future Work -- References -- Fast One-Way Cellular Automata with Reversible Mealy Cells -- 1 Introduction -- 2 Preliminaries and Definitions -- 3 The Computational Capacity of One-Way Mealy Cellular Automata with Weakly Reversible Cells -- 4 Reversible One-Way Partitioned Cellular Automata -- 5 Conclusions -- References. Enumerating Orthogonal Latin Squares Generated by Bipermutive Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Latin Squares Generated by Cellular Automata -- 3 Main Results -- 4 Enumeration of Pairwise Balanced Bipermutive Rules -- 5 Conclusions -- References -- Filling Curves Constructed in Cellular Automata with Aperiodic Tiling -- 1 Introduction -- 2 Constructions and Fillings -- 2.1 Cellular Automata -- 2.2 Tile Set -- 3 Aperiodic Tile Set -- 3.1 From Tile Set Determinism to Cellular Automaton -- 3.2 A NW-Deterministic Aperiodic Tile Set -- 4 Aperiodic Filling -- 4.1 Linear Functions -- 4.2 Over-Logarithmic Growth Functions -- 5 Conclusions and Perspectives -- References -- Some Computational Limits of Trellis Automata -- 1 Introduction -- 2 Trellis Automaton -- 3 Factors Diagram for a Language -- 4 Trellis Automaton Patterns and Language Patterns -- 5 Counting Argument -- 6 Some Non Trellis Language -- 7 Conclusion -- References -- Turing-Completeness of Asynchronous Non-camouflage Cellular Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Asynchronous CA -- 2.2 Requirements -- 2.3 Priese System -- 3 Proposing Asynchronous Non-camouflage CA -- 3.1 Proposed CA M -- 3.2 Simulation of s-automaton -- 4 Discussion -- References -- Author Index. |
| Record Nr. | UNINA-9910484788203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
The Challenge of Anticipation [[electronic resource] ] : A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems / / edited by Giovanni Pezzulo, Martin V. Butz, Cristiano Castelfranchi, Rino Falcone
| The Challenge of Anticipation [[electronic resource] ] : A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems / / edited by Giovanni Pezzulo, Martin V. Butz, Cristiano Castelfranchi, Rino Falcone |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XVI, 288 p.) |
| Disciplina | 612.82 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computer simulation Computers Mathematical statistics User interfaces (Computer systems) Artificial Intelligence Programming Techniques Simulation and Modeling Models and Principles Probability and Statistics in Computer Science User Interfaces and Human Computer Interaction |
| ISBN | 3-540-87702-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theory -- Introduction: Anticipation in Natural and Artificial Cognition -- The Anticipatory Approach: Definitions and Taxonomies -- Benefits of Anticipations in Cognitive Agents -- Models, Architectures, and Applications -- Anticipation in Attention -- Anticipatory, Goal-Directed Behavior -- Anticipation and Believability -- Anticipation and Emotions for Goal Directed Agents -- A Reinforcement-Learning Model of Top-Down Attention Based on a Potential-Action Map -- Anticipation by Analogy -- Anticipation in Coordination -- Endowing Artificial Systems with Anticipatory Capabilities: Success Cases. |
| Record Nr. | UNISA-996465900903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Challenge of Anticipation [[electronic resource] ] : A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems / / edited by Giovanni Pezzulo, Martin V. Butz, Cristiano Castelfranchi, Rino Falcone
| The Challenge of Anticipation [[electronic resource] ] : A Unifying Framework for the Analysis and Design of Artificial Cognitive Systems / / edited by Giovanni Pezzulo, Martin V. Butz, Cristiano Castelfranchi, Rino Falcone |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XVI, 288 p.) |
| Disciplina | 612.82 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Computer simulation Computers Mathematical statistics User interfaces (Computer systems) Artificial Intelligence Programming Techniques Simulation and Modeling Models and Principles Probability and Statistics in Computer Science User Interfaces and Human Computer Interaction |
| ISBN | 3-540-87702-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theory -- Introduction: Anticipation in Natural and Artificial Cognition -- The Anticipatory Approach: Definitions and Taxonomies -- Benefits of Anticipations in Cognitive Agents -- Models, Architectures, and Applications -- Anticipation in Attention -- Anticipatory, Goal-Directed Behavior -- Anticipation and Believability -- Anticipation and Emotions for Goal Directed Agents -- A Reinforcement-Learning Model of Top-Down Attention Based on a Potential-Action Map -- Anticipation by Analogy -- Anticipation in Coordination -- Endowing Artificial Systems with Anticipatory Capabilities: Success Cases. |
| Record Nr. | UNINA-9910484139703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Classification Methods for Internet Applications [[electronic resource] /] / by Martin Holeňa, Petr Pulc, Martin Kopp
| Classification Methods for Internet Applications [[electronic resource] /] / by Martin Holeňa, Petr Pulc, Martin Kopp |
| Autore | Holeňa Martin |
| Edizione | [1st ed. 2020.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
| Descrizione fisica | 1 online resource (290 pages) |
| Disciplina | 025.42 |
| Collana | Studies in Big Data |
| Soggetto topico |
Computational intelligence
Data mining Mathematical statistics Pattern recognition Computational Intelligence Data Mining and Knowledge Discovery Probability and Statistics in Computer Science Pattern Recognition |
| ISBN | 3-030-36962-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Important Internet Applications of Classification -- Basic Concepts Concerning Classification -- Some Frequently Used Classification Methods -- Aiming at Predictive Accuracy -- Aiming at Comprehensibility -- A Team Is Superior to an Individual. |
| Record Nr. | UNINA-9910741141003321 |
Holeňa Martin
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Coalgebraic Methods in Computer Science [[electronic resource] ] : 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / / edited by Marcello M. Bonsangue
| Coalgebraic Methods in Computer Science [[electronic resource] ] : 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / / edited by Marcello M. Bonsangue |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 245 p. 4 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Mathematical statistics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Probability and Statistics in Computer Science |
| ISBN | 3-662-44124-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) -- Generic Weakest Precondition Semantics from Monads Enriched with Order -- Coalgebraic Multigames -- How to Kill Epsilons with a Dagger -- On Coalgebras with Internal Moves -- A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics -- Coalgebraic Simulations and Congruences -- Dijkstra Monads in Monadic Computation -- Categories of Coalgebras with Monadic Homomorphisms -- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions -- Canonical Nondeterministic Automata -- Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra -- Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Models. |
| Record Nr. | UNISA-996202528703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Coalgebraic Methods in Computer Science [[electronic resource] ] : 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / / edited by Marcello M. Bonsangue
| Coalgebraic Methods in Computer Science [[electronic resource] ] : 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers / / edited by Marcello M. Bonsangue |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (X, 245 p. 4 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Mathematical statistics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Probability and Statistics in Computer Science |
| ISBN | 3-662-44124-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) -- Generic Weakest Precondition Semantics from Monads Enriched with Order -- Coalgebraic Multigames -- How to Kill Epsilons with a Dagger -- On Coalgebras with Internal Moves -- A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics -- Coalgebraic Simulations and Congruences -- Dijkstra Monads in Monadic Computation -- Categories of Coalgebras with Monadic Homomorphisms -- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions -- Canonical Nondeterministic Automata -- Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra -- Algebraic–Coalgebraic Recursion Theory of History-Dependent Dynamical System Models. |
| Record Nr. | UNINA-9910484970403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Coalgebraic Methods in Computer Science [[electronic resource] ] : 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 -- April 1, 2012, Revised Selected Papers / / edited by Dirk Pattinson, Lutz Schröder
| Coalgebraic Methods in Computer Science [[electronic resource] ] : 11th International Workshop, CMCS 2012, Colocated with ETAPS 2012, Tallinn, Estonia, March 31 -- April 1, 2012, Revised Selected Papers / / edited by Dirk Pattinson, Lutz Schröder |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (VII, 259 p. 7 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Computer science—Mathematics Mathematical statistics Formal Languages and Automata Theory Theory of Computation Computer Science Logic and Foundations of Programming Probability and Statistics in Computer Science |
| ISBN | 3-642-32784-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | From Lawvere to Brandenburger-Keisler: Interactive Forms of Diagonalization and Self-reference -- Defining Context-Free Power Series Coalgebraically -- Relational Presheaves as Labelled Transition Systems -- On Finitary Functors and Their Presentations -- Structural Operational Semantics for Continuous State Probabilistic Processes -- Stream Automata Are Coalgebras -- Trace Semantics via Determinizatio -- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus -- Lax Extensions of Coalgebra Functors -- From Transitions to Executions -- Tracing the Man in the Middle in Monoidal Categories -- Permutations in Coinductive Graph Representation -- Internal Models for Coalgebraic Modal Logics. |
| Record Nr. | UNISA-996465439903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Coding Theory and Applications [[electronic resource] ] : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings / / edited by Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus
| Coding Theory and Applications [[electronic resource] ] : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings / / edited by Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 297 p. 29 illus.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Computer science—Mathematics Mathematical statistics Numerical analysis Computer networks Software engineering Coding and Information Theory Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science Numerical Analysis Computer Communication Networks Software Engineering |
| ISBN | 3-319-66278-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- New Bounds for Linear Codes of Covering Radius 2 -- 1 Introduction -- 2 An Upper Bound on the Length Function q(3,2) -- 3 Upper Bounds on the Length Function q(r,2), r5 Odd -- 4 Comparison with the Previously Known Results -- References -- Multidimensional Decoding Networks for Trapping Set Analysis -- 1 Introduction -- 2 Preliminaries -- 3 Multidimensional Network Framework -- 4 Trapping Set Characterization -- 5 Representations Yielding Transitivity -- 6 Conclusions -- References -- Erasure Correction and Locality of Hypergraph Codes -- 1 Introduction -- 2 Preliminaries -- 3 Bounds on Regular Hypergraph Codes -- 4 Bounds on Biregular Hypergraph Codes -- 5 Conclusions -- References -- Reed-Muller Codes: Information Sets from Defining Sets -- 1 Introduction -- 2 Preliminaries -- 3 Information Sets for Abelian Codes -- 4 Cyclic Codes as Two-Dimensional Cyclic Codes -- 5 Reed-Muller Codes -- 6 Information Sets for First-Order Reed-Muller Codes -- 7 Information Sets for Second-Order Reed-Muller Codes -- 8 Conclusions -- References -- Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance -- 1 Introduction -- 2 Preliminaries -- 2.1 Ensembles of Binary and Binary Images of Nonbinary Regular LDPC Codes -- 2.2 QC LDPC Codes -- 3 Stopping Redundancy and Convergence to the ML Decoding Performance -- 4 Upper Bounds on ML and BP Decoding Error Probability for Ensembles of LDPC Codes -- 5 Simulation Results -- 6 Discussion -- References -- Decoding a Perturbed Sequence Generated by an LFSR -- 1 Introduction -- 2 A Decoding Problem -- 3 The Decoding Algorithm -- References -- A Construction of Orbit Codes -- 1 Introduction -- 2 Preliminaries -- 3 Our Construction -- 4 Open Questions -- References -- Analysis of Two Tracing Traitor Schemes via Coding Theory.
1 Introduction -- 2 Open Tracing Traitor Schemes - How Do They Work? -- 3 How to Compare t-IPP Codes and t-IPP Family of Sets? -- 4 New Lower Bound on the Size of IPPS Codes -- 4.1 The Previous Results -- 4.2 Constant Weight Codes with Large Distance and Traceability Set System -- References -- Reliable Communication Across Parallel Asynchronous Channels with Glitches -- 1 Introduction -- 2 Problem Formulation -- 3 Related Work -- 4 Coding Schemes -- 4.1 Single-Code Based Coding Frameworks (W=1) -- 4.2 A Multiple-Code Based Coding Framework (W > 1) -- 4.3 A Comparison of the Efficiency of the Techniques -- 5 Summary -- A Appendices -- A.1 A Sketch of the Proof that the Transmission of Information Is Practically Error Free -- A.2 The Proof that When Rmax Is Maximized, the Density of Ones Tends to 1+2 -- References -- On the Kernel of Z2s-Linear Hadamard Codes -- 1 Introduction -- 2 Generalized Gray Map -- 3 Construction of Z2s-Linear Hadamard Codes -- 4 Partial Classification of Z2s-Linear Hadamard Codes -- 5 Conclusions -- References -- Random Network Coding over Composite Fields -- 1 Introduction -- 2 The Multicast Problem -- 3 Calculations in Composite Fields -- 4 Success Probability -- 5 Concluding Remarks -- References -- Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints -- 1 Introduction -- 2 Affine Variety Codes and the Footprint Bound -- 3 Code Words from the Klein Curve -- 3.1 Leading Monomial Equal to Y -- 3.2 Leading Monomial Equal to Y2 -- 3.3 Leading Monomial Equal to XY -- 3.4 The Remaining Cases -- 4 Code Parameters -- 5 Concluding Remarks -- References -- On Binary Matroid Minors and Applications to Data Storage over Small Fields -- 1 Introduction -- 2 Preliminaries on LRCs and Matroids -- 2.1 Matroid Fundamentals -- 2.2 Fundamentals on Cyclic Flats. 3 Sufficient Conditions for Uniformity -- 4 Criteria for Uniformity via Cyclic Flats -- 4.1 Minors Given by Restriction or Contraction only -- 4.2 Minors Given by both Restriction and Contraction -- 5 Stuctural Properties of Binary LRCs -- 6 Conclusions and Future Work -- References -- Absorbing Set Analysis of Codes from Affine Planes -- 1 Introduction -- 2 Preliminaries -- 3 Finite Euclidean LDPC Codes -- 3.1 Fully Absorbing Sets and Elementary Absorbing Sets -- 4 Conclusions -- References -- Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound -- 1 Introduction -- 2 Preliminaries -- 3 Upper Bounds -- 3.1 Upper Bounds for Partial Spreads -- 4 The Linkage Construction Revisited -- 5 Asymptotic Bounds -- 6 Codes Better Than the MRD Bound -- 7 Conclusion -- References -- On Quasi-Abelian Complementary Dual Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Decompositions -- 3 Characterization and Enumeration of QACD Codes -- 4 Asymptotically Good Binary QAECD Codes of Index 3 -- References -- Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes -- 1 Introduction -- 2 Matroids, Demi-Matroids and Almost Affine Codes -- 2.1 Matroids and Demi-Matroids -- 2.2 Almost Affine Codes -- 2.3 Generalized Hamming Weights -- 3 Equivalent Formulations of Some Hamming Weights of Pairs of Codes -- 3.1 An Open Question Concerning Subcodes -- 4 Extended Weight Polynomials of Almost Affine Codes -- References -- On the Performance of Block Woven Codes Constructions with Row-Wise Permutations -- 1 Introduction -- 2 Block Woven Code Construction and Encoding -- 2.1 Simplified Deterministic Description -- 2.2 Proposed Code Ensemble -- 3 Decoding Algorithm -- 4 Distance Properties -- 5 Numerical results -- 6 Conclusion -- References. New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes -- 1 Introduction -- 2 Code Construction -- 3 Computer Search -- 4 New Lower Bounds -- References -- A State Space Approach to Periodic Convolutional Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Time-Invariant Convolutional Codes -- 2.2 Periodically Time-Varying Convolutional Codes -- 2.3 Distance Properties -- 3 State Space Realizations -- 4 Constructing Periodically Time-Varying Convolutional Codes -- 4.1 2-Periodic (3,2,2,1) Convolutional Code with Free Distance 4 -- 5 Conclusions -- References -- Column Rank Distances of Rank Metric Convolutional Codes -- 1 Introduction -- 2 Convolutional Codes -- 3 Rank Metric Convolutional Codes -- References -- On Minimality of ISO Representation of Basic 2D Convolutional Codes -- 1 Introduction -- 2 Convolutional Codes -- 2.1 Polynomial Matrices -- 2.2 1D Convolutional Codes -- 2.3 2D Convolutional Codes -- 3 On Minimality of ISO Representations of Basic 2D Convolutional Codes -- 4 Conclusion -- References -- A New Construction of Minimum Distance Robust Codes -- 1 Introduction -- 2 Effectiveness Criterion for Robust Codes -- 3 Construction of Robust Codes with Distance -- 4 Summary -- References -- Constructions and Bounds for Batch Codes with Small Parameters -- 1 Introduction -- 2 Notations and Related Works -- 3 Batch Codes with r = 2 or t=2 -- 3.1 Optimal Batch Codes with r 2 and t=2 -- 3.2 Batch Codes and PIR Codes with t 2 and r=2 -- 4 PIR Codes for Arbitrary t>2 and r>2 -- 4.1 Case r|k -- 4.2 Case t=3 and rk -- 5 Bounds on the Dimension of a Batch Code -- References -- Author Index. |
| Record Nr. | UNISA-996465878303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Coding Theory and Applications [[electronic resource] ] : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings / / edited by Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus
| Coding Theory and Applications [[electronic resource] ] : 5th International Castle Meeting, ICMCTA 2017, Vihula, Estonia, August 28-31, 2017, Proceedings / / edited by Ángela I. Barbero, Vitaly Skachek, Øyvind Ytrehus |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
| Descrizione fisica | 1 online resource (X, 297 p. 29 illus.) |
| Disciplina | 004.6 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Coding theory
Information theory Computer science—Mathematics Mathematical statistics Numerical analysis Computer networks Software engineering Coding and Information Theory Symbolic and Algebraic Manipulation Probability and Statistics in Computer Science Numerical Analysis Computer Communication Networks Software Engineering |
| ISBN | 3-319-66278-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- New Bounds for Linear Codes of Covering Radius 2 -- 1 Introduction -- 2 An Upper Bound on the Length Function q(3,2) -- 3 Upper Bounds on the Length Function q(r,2), r5 Odd -- 4 Comparison with the Previously Known Results -- References -- Multidimensional Decoding Networks for Trapping Set Analysis -- 1 Introduction -- 2 Preliminaries -- 3 Multidimensional Network Framework -- 4 Trapping Set Characterization -- 5 Representations Yielding Transitivity -- 6 Conclusions -- References -- Erasure Correction and Locality of Hypergraph Codes -- 1 Introduction -- 2 Preliminaries -- 3 Bounds on Regular Hypergraph Codes -- 4 Bounds on Biregular Hypergraph Codes -- 5 Conclusions -- References -- Reed-Muller Codes: Information Sets from Defining Sets -- 1 Introduction -- 2 Preliminaries -- 3 Information Sets for Abelian Codes -- 4 Cyclic Codes as Two-Dimensional Cyclic Codes -- 5 Reed-Muller Codes -- 6 Information Sets for First-Order Reed-Muller Codes -- 7 Information Sets for Second-Order Reed-Muller Codes -- 8 Conclusions -- References -- Distance Properties of Short LDPC Codes and Their Impact on the BP, ML and Near-ML Decoding Performance -- 1 Introduction -- 2 Preliminaries -- 2.1 Ensembles of Binary and Binary Images of Nonbinary Regular LDPC Codes -- 2.2 QC LDPC Codes -- 3 Stopping Redundancy and Convergence to the ML Decoding Performance -- 4 Upper Bounds on ML and BP Decoding Error Probability for Ensembles of LDPC Codes -- 5 Simulation Results -- 6 Discussion -- References -- Decoding a Perturbed Sequence Generated by an LFSR -- 1 Introduction -- 2 A Decoding Problem -- 3 The Decoding Algorithm -- References -- A Construction of Orbit Codes -- 1 Introduction -- 2 Preliminaries -- 3 Our Construction -- 4 Open Questions -- References -- Analysis of Two Tracing Traitor Schemes via Coding Theory.
1 Introduction -- 2 Open Tracing Traitor Schemes - How Do They Work? -- 3 How to Compare t-IPP Codes and t-IPP Family of Sets? -- 4 New Lower Bound on the Size of IPPS Codes -- 4.1 The Previous Results -- 4.2 Constant Weight Codes with Large Distance and Traceability Set System -- References -- Reliable Communication Across Parallel Asynchronous Channels with Glitches -- 1 Introduction -- 2 Problem Formulation -- 3 Related Work -- 4 Coding Schemes -- 4.1 Single-Code Based Coding Frameworks (W=1) -- 4.2 A Multiple-Code Based Coding Framework (W > 1) -- 4.3 A Comparison of the Efficiency of the Techniques -- 5 Summary -- A Appendices -- A.1 A Sketch of the Proof that the Transmission of Information Is Practically Error Free -- A.2 The Proof that When Rmax Is Maximized, the Density of Ones Tends to 1+2 -- References -- On the Kernel of Z2s-Linear Hadamard Codes -- 1 Introduction -- 2 Generalized Gray Map -- 3 Construction of Z2s-Linear Hadamard Codes -- 4 Partial Classification of Z2s-Linear Hadamard Codes -- 5 Conclusions -- References -- Random Network Coding over Composite Fields -- 1 Introduction -- 2 The Multicast Problem -- 3 Calculations in Composite Fields -- 4 Success Probability -- 5 Concluding Remarks -- References -- Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints -- 1 Introduction -- 2 Affine Variety Codes and the Footprint Bound -- 3 Code Words from the Klein Curve -- 3.1 Leading Monomial Equal to Y -- 3.2 Leading Monomial Equal to Y2 -- 3.3 Leading Monomial Equal to XY -- 3.4 The Remaining Cases -- 4 Code Parameters -- 5 Concluding Remarks -- References -- On Binary Matroid Minors and Applications to Data Storage over Small Fields -- 1 Introduction -- 2 Preliminaries on LRCs and Matroids -- 2.1 Matroid Fundamentals -- 2.2 Fundamentals on Cyclic Flats. 3 Sufficient Conditions for Uniformity -- 4 Criteria for Uniformity via Cyclic Flats -- 4.1 Minors Given by Restriction or Contraction only -- 4.2 Minors Given by both Restriction and Contraction -- 5 Stuctural Properties of Binary LRCs -- 6 Conclusions and Future Work -- References -- Absorbing Set Analysis of Codes from Affine Planes -- 1 Introduction -- 2 Preliminaries -- 3 Finite Euclidean LDPC Codes -- 3.1 Fully Absorbing Sets and Elementary Absorbing Sets -- 4 Conclusions -- References -- Asymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound -- 1 Introduction -- 2 Preliminaries -- 3 Upper Bounds -- 3.1 Upper Bounds for Partial Spreads -- 4 The Linkage Construction Revisited -- 5 Asymptotic Bounds -- 6 Codes Better Than the MRD Bound -- 7 Conclusion -- References -- On Quasi-Abelian Complementary Dual Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Decompositions -- 3 Characterization and Enumeration of QACD Codes -- 4 Asymptotically Good Binary QAECD Codes of Index 3 -- References -- Relative Generalized Hamming Weights and Extended Weight Polynomials of Almost Affine Codes -- 1 Introduction -- 2 Matroids, Demi-Matroids and Almost Affine Codes -- 2.1 Matroids and Demi-Matroids -- 2.2 Almost Affine Codes -- 2.3 Generalized Hamming Weights -- 3 Equivalent Formulations of Some Hamming Weights of Pairs of Codes -- 3.1 An Open Question Concerning Subcodes -- 4 Extended Weight Polynomials of Almost Affine Codes -- References -- On the Performance of Block Woven Codes Constructions with Row-Wise Permutations -- 1 Introduction -- 2 Block Woven Code Construction and Encoding -- 2.1 Simplified Deterministic Description -- 2.2 Proposed Code Ensemble -- 3 Decoding Algorithm -- 4 Distance Properties -- 5 Numerical results -- 6 Conclusion -- References. New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes -- 1 Introduction -- 2 Code Construction -- 3 Computer Search -- 4 New Lower Bounds -- References -- A State Space Approach to Periodic Convolutional Codes -- 1 Introduction -- 2 Preliminaries -- 2.1 Time-Invariant Convolutional Codes -- 2.2 Periodically Time-Varying Convolutional Codes -- 2.3 Distance Properties -- 3 State Space Realizations -- 4 Constructing Periodically Time-Varying Convolutional Codes -- 4.1 2-Periodic (3,2,2,1) Convolutional Code with Free Distance 4 -- 5 Conclusions -- References -- Column Rank Distances of Rank Metric Convolutional Codes -- 1 Introduction -- 2 Convolutional Codes -- 3 Rank Metric Convolutional Codes -- References -- On Minimality of ISO Representation of Basic 2D Convolutional Codes -- 1 Introduction -- 2 Convolutional Codes -- 2.1 Polynomial Matrices -- 2.2 1D Convolutional Codes -- 2.3 2D Convolutional Codes -- 3 On Minimality of ISO Representations of Basic 2D Convolutional Codes -- 4 Conclusion -- References -- A New Construction of Minimum Distance Robust Codes -- 1 Introduction -- 2 Effectiveness Criterion for Robust Codes -- 3 Construction of Robust Codes with Distance -- 4 Summary -- References -- Constructions and Bounds for Batch Codes with Small Parameters -- 1 Introduction -- 2 Notations and Related Works -- 3 Batch Codes with r = 2 or t=2 -- 3.1 Optimal Batch Codes with r 2 and t=2 -- 3.2 Batch Codes and PIR Codes with t 2 and r=2 -- 4 PIR Codes for Arbitrary t>2 and r>2 -- 4.1 Case r|k -- 4.2 Case t=3 and rk -- 5 Bounds on the Dimension of a Batch Code -- References -- Author Index. |
| Record Nr. | UNINA-9910484945203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cognitive Behavioural Systems [[electronic resource] ] : COST 2102 International Training School, Dresden, Germany, February 21-26, 2011, Revised Selected Papers / / edited by Anna Esposito, Antonietta M. Esposito, Alessandro Vinciarelli, Rüdiger Hoffmann, Vincent Müller
| Cognitive Behavioural Systems [[electronic resource] ] : COST 2102 International Training School, Dresden, Germany, February 21-26, 2011, Revised Selected Papers / / edited by Anna Esposito, Antonietta M. Esposito, Alessandro Vinciarelli, Rüdiger Hoffmann, Vincent Müller |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XXII, 450 p. 144 illus.) |
| Disciplina | 004.019 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computers
User interfaces (Computer systems) Artificial intelligence Information storage and retrieval Optical data processing Mathematical statistics Models and Principles User Interfaces and Human Computer Interaction Artificial Intelligence Information Storage and Retrieval Computer Imaging, Vision, Pattern Recognition and Graphics Probability and Statistics in Computer Science |
| ISBN | 3-642-34584-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | cognitive and computational social information processing -- emotional and social believable Human-Computer Interaction (HCI) systems -- behavioural and contextual analysis of interaction -- embodiment, perception, linguistics, semantics and sentiment analysis in dialogues and interactions -- algorithmic and computational issues for the automatic recognition and synthesis of emotional states. |
| Record Nr. | UNISA-996466570503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
