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. | UNISA-996466308903316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Cellular Automata and Discrete Complex Systems : 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 : 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 | ||
| ||
Cellular Automata Technology : 4th Asian Symposium, ASCAT 2025, Ranchi, India, March 6–8, 2025, Revised Selected Papers / / edited by Supreeti Kamilya, Sukanta Das, Enrico Formenti
| Cellular Automata Technology : 4th Asian Symposium, ASCAT 2025, Ranchi, India, March 6–8, 2025, Revised Selected Papers / / edited by Supreeti Kamilya, Sukanta Das, Enrico Formenti |
| Autore | Kamilya Supreeti |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (398 pages) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
DasSukanta
FormentiEnrico |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Computational intelligence
Artificial intelligence Image processing - Digital techniques Computer vision Computational Intelligence Artificial Intelligence Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-031-94121-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | -- Self-synchronization of Temporally Stochastic Cellular Automata. -- Modeling of Crack Propagation in Composite Materials using Cellular Automata. -- Diabetes Prediction Enhancement via Cellular Automata and Machine Learning. -- Empirical study on reversibility of rotation-symmetric rules of 2D cellular automata - Finite Triangular lattice. -- An Elementary Cellular Automata Based Two-Class Data Imbalance Problem: Initial Study and Observations. -- Search of 3-State Cellular Automata for Clustering. -- Use of $5$-neighborhood Cellular Automata for Pattern Classification. -- A Study on Role of Distant neighbor over Elementary Cellular Automata. -- Tracking Rule Evolution in 2D Cellular Automata: Analyzing State Changes and Image Transformation Dynamics. -- Exploring Opinion Dynamics through Social Influence, Online Communication, and Leadership: A Fuzzy Cellular Automaton Approach. -- Cellular Automata-based Toxicity Analysis for Social Media Comments. -- Touching Loops and Worms Formed by Cellular Automata. -- First experiments on chaotic k non-uniform cellular automata. -- Despeckling Images using Elementary Cellular Automata. -- Information Propagation based Data Classification with Reversible Non-Uniform Elementary Cellular Automata. -- Synthesis and Analysis of Regular Clocking-based Full Subtractor in QCA. |
| Record Nr. | UNINA-9911011651303321 |
Kamilya Supreeti
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Intelligence Methods for Bioinformatics and Biostatistics [[electronic resource] ] : 10th International Meeting, CIBB 2013, Nice, France, June 20-22, 2013, Revised Selected Papers / / edited by Enrico Formenti, Roberto Tagliaferri, Ernst Wit
| Computational Intelligence Methods for Bioinformatics and Biostatistics [[electronic resource] ] : 10th International Meeting, CIBB 2013, Nice, France, June 20-22, 2013, Revised Selected Papers / / edited by Enrico Formenti, Roberto Tagliaferri, Ernst Wit |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIII, 275 p. 99 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Pattern recognition Data mining Computers Optical data processing Algorithms Computational Biology/Bioinformatics Pattern Recognition Data Mining and Knowledge Discovery Computation by Abstract Devices Image Processing and Computer Vision Algorithm Analysis and Problem Complexity |
| ISBN | 3-319-09042-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Keynote Speaker -- Dynamic Gaussian Graphical Models for Modelling Genomic Networks -- 1 Introduction -- 2 Graphical Models -- 3 Dynamic Gaussian Graphical Model for Networks -- 3.1 Sparsity Restrictions of the Precision Matrix -- 3.2 Model Restrictions of the Precision Matrix -- 3.3 Maximum Likelihood -- 4 Max Determinant Optimization Problem -- 5 Application to T-Cell Data -- 6 Conclusions -- References -- Bioinformatics Regular Session -- Molecular Docking for Drug Discovery: Machine-Learning Approaches for Native Pose Prediction of Protein-Ligand Complexes -- 1 Introduction -- 1.1 Background -- 1.2 Related Work -- 1.3 Key Contributions -- 2 Materials and Methods -- 2.1 Compound Database -- 2.2 Compound Characterization -- 2.3 Decoy Generation and Formation of Training and Test Sets -- 2.4 Conventional Scoring Functions -- 2.5 Machine Learning Methods -- 3 Results and Discussion -- 3.1 Evaluation of Scoring Functions -- 3.2 ML vs. Conventional Approaches on a Diverse Test Set -- 3.3 ML vs. Conventional Approaches on Homogeneous Test Sets -- 3.4 Impact of Training Set Size -- 4 Conclusion -- References -- BioCloud Search EnGene: Surfing Biological Data on the Cloud -- Abstract -- 1 Introduction -- 2 Background and Motivations -- 3 Architectural Aspects -- 3.1 Query Contextualization -- 3.2 Technical Details -- 4 BSE Functionalities -- 5 Conclusions -- Acknowledgments -- References -- Genomic Sequence Classification Using Probabilistic Topic Modeling -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Probabilistic Topic Models -- 3.2 Document Model and DNA Sequences -- 4 Experimental Tests -- 4.1 Bacteria Dataset -- 4.2 Training and Testing Pipelines -- 4.3 Classification Pipeline -- 4.4 Results and Discussion -- 5 Conclusion and Future Work -- References.
Community Detection in Protein-Protein Interaction Networks Using Spectral and Graph Approaches -- 1 Introduction -- 2 Communities Discovering in Networks Using Graph Analysis -- 3 Communities Discovering in Networks Using Clustering Approaches -- 4 The FSM Community Detection Method -- 5 Saccharomyces cerevisiae PPIs Discovery -- 5.1 Dataset -- 5.2 Experimental Results and Discussion -- 6 Conclusions -- References -- Weighting Scheme Methods for Enhanced Genomic Annotation Prediction -- 1 Introduction -- 2 Annotation Data Considered -- 2.1 Genomic and Proteomic Data Warehouse -- 2.2 Annotation Unfolding -- 3 Computational Methods -- 3.1 Weighting Schemes for Annotation Matrices -- 3.2 Latent Semantic Indexing by Singular Value Decomposition -- 3.3 Semantic IMprovement (SIM) -- 3.4 Anomaly Correction -- 3.5 Computational Complexity -- 4 Validation of Annotation Predictions -- 5 Validation Results -- 6 Conclusions -- References -- French Flag Tracking by Morphogenetic Simulation Under Developmental Constraints -- 1 Introduction -- 1.1 Morphogenesis: Emerging of Interests -- 1.2 Below Genetic Expression -- 2 Morphological Dynamic of Cells -- 2.1 Mathematical Model -- 2.2 Shapes Emergence -- 3 Simulation Tool -- 3.1 Architecture -- 3.2 Features -- 4 Algorithms -- 4.1 Software Architecture -- 4.2 Genomes Base Construct -- 4.3 Initialization -- 4.4 Description of the Algorithm -- 5 Evaluation -- 5.1 Test Conditions -- 5.2 Output Results -- 6 Conclusion -- 6.1 Relevance to Biological Issues -- 6.2 Future Works -- References -- Biostatistics Regular Session -- High--Dimensional Sparse Matched Case--Control and Case--Crossover Data: A Review of Recent Works, Description of an R Tool and an Illustration of the Use in Epidemiological Studies -- 1 Introduction -- 2 Conditional Logistic Regression -- 2.1 The Model -- 2.2 Conditional Likelihood. 2.3 L1 Penalized Conditional Likelihood -- 3 Complexity Tuning -- 4 Uncertainty Measures -- 5 Standardization, Bias Correction, Unpenalized Predictors -- 6 Capabilities of clogitLasso -- 6.1 Example 1 -- 6.2 Example 2 -- 7 Conclusion -- References -- Piecewise Exponential Artificial Neural Networks (PEANN) for Modeling Hazard Function with Right Censored Data -- 1 Introduction -- 2 Methods -- 3 Breast Cancer Survival Study -- 4 Conclusions -- References -- Writing Generation Model for Health Care Neuromuscular System Investigation -- Abstract -- 1 Introduction -- 2 Neuromuscular System Function Transfer minus the Delta-Log Model -- 3 Neuromuscular System Function Transfer -- the Sigma-Log Model -- 4 Experimental Setup for Writing Generation Model -- 5 Conclusion -- Acknowledgment -- References -- Clusters Identification in Binary Genomic Data: The Alternative Offered by Scan Statistics Approach -- 1 Introduction -- 2 Methods -- 2.1 DBSCAN -- 2.2 Kulldorff Spatial Scan Statistics for Bernoulli Model -- 2.3 Experimental Data -- 3 Results -- 4 Conclusions -- References -- Special Session: Knowledge Based Medicine -- Reverse Engineering Methodology for Bioinformatics Based on Genetic Programming, Differential Expression Analysis and Other Statistical Methods -- Abstract -- 1 Introduction -- 2 Enhanced GP RODES Methodology -- 2.1 Data Fitting with Smoothing Spline and Time Derivative Computing -- 2.2 Temporal Differentially Expressed Genes -- 3 Results -- 3.1 Data Fitting and Time Derivative Computing -- 3.2 Results of Time Course Study -- 3.3 Structure and Parameters Discovery from the GSE35074 miRNA Time Series Data with GP RODES -- 4 Conclusions -- Acknowledgments -- References -- Integration of Clinico-Pathological and microRNA Data for Intelligent Breast Cancer Relapse Prediction Systems -- 1 Introduction -- 2 Methods -- 2.1 Data Set. 2.2 Experimental Framework -- 3 Results -- 3.1 Patient Differentiation Based on ER Status -- 3.2 Exclusion of HS Sequences -- 4 Biological Significance -- 5 Conclusions -- References -- Superresolution MUSIC Based on Marčenko-Pastur Limit Distribution Reduces Uncertainty and Improves DNA Gene Expression-Based Microarray Classification -- 1 Introduction -- 2 Methods -- 2.1 Datasets Used -- 2.2 Gene Selection and Usage -- 2.3 Bootstrap Root MUSIC Classifier -- 2.4 Classification Runs Using Bootstrap Root MUSIC (BRM) -- 3 Results -- 4 Discussion -- References -- Special Session: Data Integration and Analysis in Omic-Science -- Prediction of Single-Nucleotide Polymorphisms Causative of Rare Diseases -- 1 Introduction -- 2 Materials -- 2.1 Formats and Tools for Managing NGS Data -- 2.2 Pooling -- 3 Methods -- 3.1 Decision Rules -- 3.2 Features -- 3.3 Generalized Eigenvalue Classification -- 4 Results and Discussion -- 4.1 Benchmark Dataset -- 4.2 Other Tools Results -- 4.3 Decision Rules Results -- 4.4 Standard Classifiers Performance -- 4.5 Prediction -- 4.6 SIFT -- 5 Concluding Remarks -- References -- A Framework for Mining Life Sciences Data on the Semantic Web in an Interactive, Graph-Based Environment -- 1 Introduction -- 2 Material and Methods -- 2.1 Semantic Reconciliation of Ondex and RDF Data Models -- 2.2 SPARQL Query Console -- 2.3 Interactive Browsing -- 2.4 SPARQL Commands Configuration File -- 3 Results and Discussion -- 3.1 Example Use Case Identifying Interacting Proteins with IPR002048 and IPR003527 Domains -- 3.2 Discussion -- 4 Conclusion -- References -- Combining Not-Proper ROC Curves and Hierarchical Clustering to Detect Differentially Expressed Genes in Microarray Experiments -- 1 Introduction -- 2 ROC Curve and the TNRC Statistics -- 2.1 Properties of TNRC -- 2.2 Interpreting TNRC Using Information from Hierarchical Clustering. 3 Results -- 4 Conclusions -- References -- Fast and Parallel Algorithm for Population-Based Segmentation of Copy-Number Profiles -- 1 Introduction -- 2 Linearization of Dynamic Programming for Segmentation and Segmentation/Clustering -- 2.1 Original Dynamic Programming Algorithm for Segmentation -- 2.2 A Linear Dynamic Programming Algorithm for the Classification Cost Function -- 2.3 A Bound on the Quality of the Approximation -- 3 Joint Segmentation and Parallelization of the Algorithm -- 4 Correctness, Computational Footprint and Scalability -- References -- Identification of Pathway Signatures in Parkinson's Disease with Gene Ontology and Sparse Regularization -- 1 Introduction -- 2 Materials and Methods -- 2.1 Feature Selection Framework -- 2.2 The KDVS Pipeline -- 2.3 The Standard Pipeline -- 2.4 Benchmark Lists -- 2.5 Precision, Recall and F-measure -- 3 Results and Discussion -- 3.1 The KDVS Pipeline -- 3.2 Comparison Between Lists: KDVS and Benchmark -- 3.3 The Standard Pipeline -- 3.4 Data Analysis -- 3.5 Functional Analysis -- 3.6 Comparison Between the Lists: Standard and Benchmark -- 3.7 Comparison of KDVS and Standard Pipelines -- 4 Conclusions -- References -- Author Index. |
| Record Nr. | UNISA-996213835303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Intelligence Methods for Bioinformatics and Biostatistics : 10th International Meeting, CIBB 2013, Nice, France, June 20-22, 2013, Revised Selected Papers / / edited by Enrico Formenti, Roberto Tagliaferri, Ernst Wit
| Computational Intelligence Methods for Bioinformatics and Biostatistics : 10th International Meeting, CIBB 2013, Nice, France, June 20-22, 2013, Revised Selected Papers / / edited by Enrico Formenti, Roberto Tagliaferri, Ernst Wit |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIII, 275 p. 99 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Pattern recognition systems Data mining Computer science Computer vision Algorithms Computational and Systems Biology Automated Pattern Recognition Data Mining and Knowledge Discovery Theory of Computation Computer Vision |
| ISBN | 3-319-09042-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Keynote Speaker -- Dynamic Gaussian Graphical Models for Modelling Genomic Networks -- 1 Introduction -- 2 Graphical Models -- 3 Dynamic Gaussian Graphical Model for Networks -- 3.1 Sparsity Restrictions of the Precision Matrix -- 3.2 Model Restrictions of the Precision Matrix -- 3.3 Maximum Likelihood -- 4 Max Determinant Optimization Problem -- 5 Application to T-Cell Data -- 6 Conclusions -- References -- Bioinformatics Regular Session -- Molecular Docking for Drug Discovery: Machine-Learning Approaches for Native Pose Prediction of Protein-Ligand Complexes -- 1 Introduction -- 1.1 Background -- 1.2 Related Work -- 1.3 Key Contributions -- 2 Materials and Methods -- 2.1 Compound Database -- 2.2 Compound Characterization -- 2.3 Decoy Generation and Formation of Training and Test Sets -- 2.4 Conventional Scoring Functions -- 2.5 Machine Learning Methods -- 3 Results and Discussion -- 3.1 Evaluation of Scoring Functions -- 3.2 ML vs. Conventional Approaches on a Diverse Test Set -- 3.3 ML vs. Conventional Approaches on Homogeneous Test Sets -- 3.4 Impact of Training Set Size -- 4 Conclusion -- References -- BioCloud Search EnGene: Surfing Biological Data on the Cloud -- Abstract -- 1 Introduction -- 2 Background and Motivations -- 3 Architectural Aspects -- 3.1 Query Contextualization -- 3.2 Technical Details -- 4 BSE Functionalities -- 5 Conclusions -- Acknowledgments -- References -- Genomic Sequence Classification Using Probabilistic Topic Modeling -- 1 Introduction -- 2 Related Work -- 3 Methods -- 3.1 Probabilistic Topic Models -- 3.2 Document Model and DNA Sequences -- 4 Experimental Tests -- 4.1 Bacteria Dataset -- 4.2 Training and Testing Pipelines -- 4.3 Classification Pipeline -- 4.4 Results and Discussion -- 5 Conclusion and Future Work -- References.
Community Detection in Protein-Protein Interaction Networks Using Spectral and Graph Approaches -- 1 Introduction -- 2 Communities Discovering in Networks Using Graph Analysis -- 3 Communities Discovering in Networks Using Clustering Approaches -- 4 The FSM Community Detection Method -- 5 Saccharomyces cerevisiae PPIs Discovery -- 5.1 Dataset -- 5.2 Experimental Results and Discussion -- 6 Conclusions -- References -- Weighting Scheme Methods for Enhanced Genomic Annotation Prediction -- 1 Introduction -- 2 Annotation Data Considered -- 2.1 Genomic and Proteomic Data Warehouse -- 2.2 Annotation Unfolding -- 3 Computational Methods -- 3.1 Weighting Schemes for Annotation Matrices -- 3.2 Latent Semantic Indexing by Singular Value Decomposition -- 3.3 Semantic IMprovement (SIM) -- 3.4 Anomaly Correction -- 3.5 Computational Complexity -- 4 Validation of Annotation Predictions -- 5 Validation Results -- 6 Conclusions -- References -- French Flag Tracking by Morphogenetic Simulation Under Developmental Constraints -- 1 Introduction -- 1.1 Morphogenesis: Emerging of Interests -- 1.2 Below Genetic Expression -- 2 Morphological Dynamic of Cells -- 2.1 Mathematical Model -- 2.2 Shapes Emergence -- 3 Simulation Tool -- 3.1 Architecture -- 3.2 Features -- 4 Algorithms -- 4.1 Software Architecture -- 4.2 Genomes Base Construct -- 4.3 Initialization -- 4.4 Description of the Algorithm -- 5 Evaluation -- 5.1 Test Conditions -- 5.2 Output Results -- 6 Conclusion -- 6.1 Relevance to Biological Issues -- 6.2 Future Works -- References -- Biostatistics Regular Session -- High--Dimensional Sparse Matched Case--Control and Case--Crossover Data: A Review of Recent Works, Description of an R Tool and an Illustration of the Use in Epidemiological Studies -- 1 Introduction -- 2 Conditional Logistic Regression -- 2.1 The Model -- 2.2 Conditional Likelihood. 2.3 L1 Penalized Conditional Likelihood -- 3 Complexity Tuning -- 4 Uncertainty Measures -- 5 Standardization, Bias Correction, Unpenalized Predictors -- 6 Capabilities of clogitLasso -- 6.1 Example 1 -- 6.2 Example 2 -- 7 Conclusion -- References -- Piecewise Exponential Artificial Neural Networks (PEANN) for Modeling Hazard Function with Right Censored Data -- 1 Introduction -- 2 Methods -- 3 Breast Cancer Survival Study -- 4 Conclusions -- References -- Writing Generation Model for Health Care Neuromuscular System Investigation -- Abstract -- 1 Introduction -- 2 Neuromuscular System Function Transfer minus the Delta-Log Model -- 3 Neuromuscular System Function Transfer -- the Sigma-Log Model -- 4 Experimental Setup for Writing Generation Model -- 5 Conclusion -- Acknowledgment -- References -- Clusters Identification in Binary Genomic Data: The Alternative Offered by Scan Statistics Approach -- 1 Introduction -- 2 Methods -- 2.1 DBSCAN -- 2.2 Kulldorff Spatial Scan Statistics for Bernoulli Model -- 2.3 Experimental Data -- 3 Results -- 4 Conclusions -- References -- Special Session: Knowledge Based Medicine -- Reverse Engineering Methodology for Bioinformatics Based on Genetic Programming, Differential Expression Analysis and Other Statistical Methods -- Abstract -- 1 Introduction -- 2 Enhanced GP RODES Methodology -- 2.1 Data Fitting with Smoothing Spline and Time Derivative Computing -- 2.2 Temporal Differentially Expressed Genes -- 3 Results -- 3.1 Data Fitting and Time Derivative Computing -- 3.2 Results of Time Course Study -- 3.3 Structure and Parameters Discovery from the GSE35074 miRNA Time Series Data with GP RODES -- 4 Conclusions -- Acknowledgments -- References -- Integration of Clinico-Pathological and microRNA Data for Intelligent Breast Cancer Relapse Prediction Systems -- 1 Introduction -- 2 Methods -- 2.1 Data Set. 2.2 Experimental Framework -- 3 Results -- 3.1 Patient Differentiation Based on ER Status -- 3.2 Exclusion of HS Sequences -- 4 Biological Significance -- 5 Conclusions -- References -- Superresolution MUSIC Based on Marčenko-Pastur Limit Distribution Reduces Uncertainty and Improves DNA Gene Expression-Based Microarray Classification -- 1 Introduction -- 2 Methods -- 2.1 Datasets Used -- 2.2 Gene Selection and Usage -- 2.3 Bootstrap Root MUSIC Classifier -- 2.4 Classification Runs Using Bootstrap Root MUSIC (BRM) -- 3 Results -- 4 Discussion -- References -- Special Session: Data Integration and Analysis in Omic-Science -- Prediction of Single-Nucleotide Polymorphisms Causative of Rare Diseases -- 1 Introduction -- 2 Materials -- 2.1 Formats and Tools for Managing NGS Data -- 2.2 Pooling -- 3 Methods -- 3.1 Decision Rules -- 3.2 Features -- 3.3 Generalized Eigenvalue Classification -- 4 Results and Discussion -- 4.1 Benchmark Dataset -- 4.2 Other Tools Results -- 4.3 Decision Rules Results -- 4.4 Standard Classifiers Performance -- 4.5 Prediction -- 4.6 SIFT -- 5 Concluding Remarks -- References -- A Framework for Mining Life Sciences Data on the Semantic Web in an Interactive, Graph-Based Environment -- 1 Introduction -- 2 Material and Methods -- 2.1 Semantic Reconciliation of Ondex and RDF Data Models -- 2.2 SPARQL Query Console -- 2.3 Interactive Browsing -- 2.4 SPARQL Commands Configuration File -- 3 Results and Discussion -- 3.1 Example Use Case Identifying Interacting Proteins with IPR002048 and IPR003527 Domains -- 3.2 Discussion -- 4 Conclusion -- References -- Combining Not-Proper ROC Curves and Hierarchical Clustering to Detect Differentially Expressed Genes in Microarray Experiments -- 1 Introduction -- 2 ROC Curve and the TNRC Statistics -- 2.1 Properties of TNRC -- 2.2 Interpreting TNRC Using Information from Hierarchical Clustering. 3 Results -- 4 Conclusions -- References -- Fast and Parallel Algorithm for Population-Based Segmentation of Copy-Number Profiles -- 1 Introduction -- 2 Linearization of Dynamic Programming for Segmentation and Segmentation/Clustering -- 2.1 Original Dynamic Programming Algorithm for Segmentation -- 2.2 A Linear Dynamic Programming Algorithm for the Classification Cost Function -- 2.3 A Bound on the Quality of the Approximation -- 3 Joint Segmentation and Parallelization of the Algorithm -- 4 Correctness, Computational Footprint and Scalability -- References -- Identification of Pathway Signatures in Parkinson's Disease with Gene Ontology and Sparse Regularization -- 1 Introduction -- 2 Materials and Methods -- 2.1 Feature Selection Framework -- 2.2 The KDVS Pipeline -- 2.3 The Standard Pipeline -- 2.4 Benchmark Lists -- 2.5 Precision, Recall and F-measure -- 3 Results and Discussion -- 3.1 The KDVS Pipeline -- 3.2 Comparison Between Lists: KDVS and Benchmark -- 3.3 The Standard Pipeline -- 3.4 Data Analysis -- 3.5 Functional Analysis -- 3.6 Comparison Between the Lists: Standard and Benchmark -- 3.7 Comparison of KDVS and Standard Pipelines -- 4 Conclusions -- References -- Author Index. |
| Record Nr. | UNINA-9910483429003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language and Automata Theory and Applications [[electronic resource] ] : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / / edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
| Language and Automata Theory and Applications [[electronic resource] ] : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / / edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 754 p. 140 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Artificial intelligence Theory of Computation Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Artificial Intelligence |
| ISBN | 3-319-15579-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata. |
| Record Nr. | UNISA-996198744203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Language and Automata Theory and Applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / / edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe
| Language and Automata Theory and Applications : 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings / / edited by Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, Bianca Truthe |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 754 p. 140 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science - Mathematics Discrete mathematics Artificial intelligence Theory of Computation Formal Languages and Automata Theory Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Artificial Intelligence |
| ISBN | 3-319-15579-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms -- Automata, Logic, and Concurrency -- Codes, Semigroups, and Symbolic Dynamics -- Combinatorics on Words -- Complexity and Recursive Functions -- Compression, Inference, Pattern Matching, and Model Checking -- Graphs, Term Rewriting, and Networks -- Transducers, Tree Automata, and Weighted Automata. |
| Record Nr. | UNINA-9910483856203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Pattern Recognition in Bioinformatics [[electronic resource] ] : 8th IAPR International Conference, PRIB 2013, Nice, France, June 17-20, 2013. Proceedings / / edited by Alioune Ngom, Enrico Formenti, Jin-Kao Hao, Xing-Ming Zhao, Twan van Laarhoven
| Pattern Recognition in Bioinformatics [[electronic resource] ] : 8th IAPR International Conference, PRIB 2013, Nice, France, June 17-20, 2013. Proceedings / / edited by Alioune Ngom, Enrico Formenti, Jin-Kao Hao, Xing-Ming Zhao, Twan van Laarhoven |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIX, 290 p. 71 illus.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Health informatics Pattern recognition Algorithms Artificial intelligence Computational Biology/Bioinformatics Health Informatics Pattern Recognition Algorithm Analysis and Problem Complexity Artificial Intelligence |
| Soggetto non controllato |
IAPR
PRIB |
| ISBN | 3-642-39159-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bio-molecular networks and pathway analysis -- Learning, classification, and clustering -- Data mining and knowledge discovery -- Protein: structure, function, and interaction -- Motifs, sites, and sequence analysis. |
| Record Nr. | UNISA-996465687103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Pattern Recognition in Bioinformatics : 8th IAPR International Conference, PRIB 2013, Nice, France, June 17-20, 2013. Proceedings / / edited by Alioune Ngom, Enrico Formenti, Jin-Kao Hao, Xing-Ming Zhao, Twan van Laarhoven
| Pattern Recognition in Bioinformatics : 8th IAPR International Conference, PRIB 2013, Nice, France, June 17-20, 2013. Proceedings / / edited by Alioune Ngom, Enrico Formenti, Jin-Kao Hao, Xing-Ming Zhao, Twan van Laarhoven |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XIX, 290 p. 71 illus.) |
| Disciplina | 570.285 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Bioinformatics
Medical informatics Pattern recognition systems Algorithms Artificial intelligence Computational and Systems Biology Health Informatics Automated Pattern Recognition Artificial Intelligence |
| ISBN | 3-642-39159-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bio-molecular networks and pathway analysis -- Learning, classification, and clustering -- Data mining and knowledge discovery -- Protein: structure, function, and interaction -- Motifs, sites, and sequence analysis. |
| Record Nr. | UNINA-9910484417203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Reachability Problems [[electronic resource] ] : 17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings / / edited by Olivier Bournez, Enrico Formenti, Igor Potapov
| Reachability Problems [[electronic resource] ] : 17th International Conference, RP 2023, Nice, France, October 11–13, 2023, Proceedings / / edited by Olivier Bournez, Enrico Formenti, Igor Potapov |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (231 pages) |
| Disciplina | 518.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Machine theory
Computer science Software engineering Logic programming Algorithms Computer science - Mathematics Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Software Engineering Logic in AI Design and Analysis of Algorithms Mathematics of Computing |
| ISBN | 3-031-45286-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Randomness quality and trade-offs for CA random string generators -- Regular Papers -- Complexity of Reachability Problems in Neural Networks -- Weakly synchronous systems with three machines are Turing powerful -- On the Identity and Group Problems for Complex Heisenberg Matrices -- Reachability analysis of a class of hybrid gene regulatory networks -- Quantitative Reachability Stackelberg-Pareto Synthesis -- Multi-Weighted Reachability Games -- On the Complexity of Robust Eventual Inequality Testing for C-Finite Functions -- Adaptive Directions for Bernstein-based Polynomial Set Evolution -- Introducing Divergence for Infinite Probabilistic Models -- A Framework for the Competitive Analysis of Model Predictive Controllers -- Matching Patterns with Variables Under Simon’s Congruence -- HyperMonitor: A Python Prototype for Hyper Predictive Runtime Verification -- Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs. |
| Record Nr. | UNISA-996558471103316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
