LEADER 03222oam 2200625I 450 001 9910461290103321 005 20170815154419.0 010 $a1-136-03873-6 010 $a1-136-03874-4 010 $a1-280-58210-3 010 $a9786613611888 010 $a0-240-81808-3 024 7 $a10.4324/9780240818085 035 $a(CKB)2670000000147368 035 $a(EBL)867672 035 $a(OCoLC)779141596 035 $a(SSID)ssj0000612819 035 $a(PQKBManifestationID)11374967 035 $a(PQKBTitleCode)TC0000612819 035 $a(PQKBWorkID)10571039 035 $a(PQKB)10178403 035 $a(OCoLC)785782446 035 $a(MiAaPQ)EBC867672 035 $a(CaSebORM)9780240818078 035 $a(EXLCZ)992670000000147368 100 $a20180706e20142012 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aScreenwriter's compass $echaracter as true North /$fGuy Gallo 205 $a1st edition 210 1$aBurlington, Mass. :$cFocal Press,$d2014. 215 $a1 online resource (215 p.) 300 $aFirst published 2012. 311 $a1-138-13645-X 311 $a0-240-81807-5 320 $aIncludes bibliographical references and index. 327 $aCover; Screenwriter's Compass: Character As True North; Copyright; CONTENTS; PREFACE; ACKNOWLEDMENTS; 1 FIRST THINGS; SCREENWRITER'S COMPASS; BIG DEAL-YOU'RE WRITING A SCREENPLAY; GEAR UP; SCREENWRITING IS WRITING; CRAFTSMANSHIP; 2 GROUNDWORK; READING THEORY; UPESETTING ARISTOTLE; PUTTING ARISTOTLE TO WORK; CHARACTER-DRIVEN VERSUS PLOT-DRIVEN; FABLE AND CONSTRUCT; TURNING THEORY TO TASK; 3 GETTING READY; MASTER SHOT SCREENPLAY; READING SCREENPLAYS; COMPOSITION CREATES STORY; ON OUTLINES; ON CHARACTER HISTORIES; ON TREATMENTS; ON ADAPTATION; 4 FIRST DRAFT; THE BLANK PAGE 327 $aSCENE AND ACTION DESCRIPTIONBEING GOD; HEARING VOICES; EMPATHY; THINKING OF STRUCTURE; BREAKING A BLOCK; 5 REVISION; FIRST READER; LOOKING AGAIN FOR LOGIC; QUESTIONS; CHALLENGES AND PITFALLS; ON EXPECTATION; 6 FINISHING; WRIGHTING A SREENPLAY; SCREENPLAY FORMAT; PROOFRADING; SUBMISSION; 7 GETTING READY AGAIN; PASSION AND PURPOSE; HAPPY ACCIDENT; INTUION AND ANALYSIS; LESSONS; INDEX 330 $aEver watch a movie, and despite great production value, fantastic action sequences, a great cast, etc, you come away thinking-I just didn't buy it. Chances are it was because you didn't care about the characters. Screenwriter's Compass presents a new way of approaching screenwriting, examining how effective screen storytelling must be grounded in the vivid imagining and presentation of character.Screenwriter's Compass will not offer formulas to follow but instead will give you the tools needed to chart your own path to screenwriting success. It details useful ways o 606 $aMotion picture authorship 608 $aElectronic books. 615 0$aMotion picture authorship. 676 $a808.2/3 676 $a808.23 700 $aGallo$b Guy.$0918026 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461290103321 996 $aScreenwriter's compass$92058392 997 $aUNINA LEADER 07575nam 22008295 450 001 996466118203316 005 20200705183118.0 010 $a3-540-40926-2 024 7 $a10.1007/11861386 035 $a(CKB)1000000000283997 035 $a(SSID)ssj0000319953 035 $a(PQKBManifestationID)11243015 035 $a(PQKBTitleCode)TC0000319953 035 $a(PQKBWorkID)10343199 035 $a(PQKB)11686169 035 $a(DE-He213)978-3-540-40926-7 035 $a(MiAaPQ)EBC3068243 035 $a(PPN)123138175 035 $a(EXLCZ)991000000000283997 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSecurity Protocols$b[electronic resource] $e12th International Workshop, Cambridge, UK, April 26-28, 2004. Revised Selected Papers /$fedited by Bruce Christianson, Bruno Crispo, James A. Malcolm, Michael Roe 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (X, 390 p.) 225 1 $aSecurity and Cryptology ;$v3957 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40925-4 320 $aIncludes bibliographical references and index. 327 $aIntroduction: Authentic Privacy -- Limits to Anonymity When Using Credentials -- Limits to Anonymity When Using Credentials (Transcript of Discussion) -- A Cryptographic Framework for the Controlled Release of Certified Data -- A Cryptographic Framework for the Controlled Release of Certified Data (Transcript of Discussion) -- One User, Many Hats; and, Sometimes, No Hat: Towards a Secure Yet Usable PDA -- One User, Many Hats; and Sometimes, No Hat (Transcript of Discussion) -- Authentication Components: Engineering Experiences and Guidelines -- Authentication Components: Engineering Experiences and Guidelines (Transcript of Discussion) -- Accountable Privacy -- Accountable Privacy (Transcript of Discussion) -- Toward a Broader View of Security Protocols -- Toward a Broader View of Security Protocols (Transcript of Discussion) -- Privacy, Control and Internet Mobility -- Privacy, Control and Internet Mobility (Transcript of Discussion) -- Controlling Who Tracks Me -- Controlling Who Tracks Me (Transcript of Discussion) -- BLIND: A Complete Identity Protection Framework for End-Points -- BLIND: A Complete Identity Protection Framework for End-Points (Transcript of Discussion) -- Privacy Is Linking Permission to Purpose -- Privacy is Linking Permission to Purpose (Transcript of Discussion) -- Establishing Trust with Privacy -- Establishing Trust with Privacy (Transcript of Discussion) -- Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System -- Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System (Transcript of Discussion) -- The Dancing Bear: A New Way of Composing Ciphers -- The Dancing Bear: A New Way of Composing Ciphers (Transcript of Discussion) -- Identity and Location -- Identity and Location (Transcript of Discussion) -- Security of Emergent Properties in Ad-Hoc Networks (Transcript of Discussion) -- Pseudonymity in the Light of Evidence-Based Trust -- Pseudonymity in the Light of Evidence-Based Trust (Transcript of Discussion) -- Secure Processor Consistent with Both Foreign Software Protection and User Privacy Protection -- Secure Processor Consistent with Both Foreign Software Protection and User Privacy Protection (Transcript of Discussion) -- Why Are We Authenticating (Transcript of Discussion) -- Anonymous Authentication -- Anonymous Authentication (Transcript of Discussion) -- Towards a Mechanism for Discretionary Overriding of Access Control -- Towards a Mechanism for Discretionary Overriding of Access Control (Transcript of Discussion) -- Last Orders. 330 $aHere are the proceedings of the 12th International Workshop on Security P- tocols. We hope that you will enjoy them, and that they will cause you to think at least one heretical thought. Please write or e-mail and share it with us. Our theme this workshop was ?Authentic Privacy.? Traditionally we have based authentication upon a rather strong notion of identity, and have then built other security services on top of authentication. Perhaps if we want a more nuanced notion of privacy, then we need to re-examine some of our assu- tions, particularly when attackers and defenders share the same resources and infrastructure. The position papers published here have been revised by the participants in the workshop, and are followed by edited (heavily in some cases) transcripts of parts of the discussions which they led. Our thanks to Sidney Sussex CollegeCambridgefor the use of their facilities, to Johanna Hunt at the University of Hertfordshire for organizing the logistics of the workshop and orchestrating the production of these proceedings, to Lori KlimaszewskaoftheUniversityofCambridgeComputingServicefortranscribing the audio tapes (in which ?viruses without halos? could have caused havoc but didn?t), and to Donald Hunt for impeccable copyediting. Finally, it is both a sadness and a pleasure to pay our tribute to David Wheeler,oneoftheoriginalforty-ninersattheCambridgeComputerLaboratory and author of the initial orders for EDSAC. The second version of initial orders is the Platonic bootstrap. 410 0$aSecurity and Cryptology ;$v3957 606 $aComputer communication systems 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aManagement information systems 606 $aComputer science 606 $aComputers and civilization 606 $aOperating systems (Computers) 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aCryptology$3https://scigraph.springernature.com/ontologies/product-market-codes/I28020 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aManagement of Computing and Information Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I24067 606 $aComputers and Society$3https://scigraph.springernature.com/ontologies/product-market-codes/I24040 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aComputer communication systems. 615 0$aData encryption (Computer science). 615 0$aAlgorithms. 615 0$aManagement information systems. 615 0$aComputer science. 615 0$aComputers and civilization. 615 0$aOperating systems (Computers). 615 14$aComputer Communication Networks. 615 24$aCryptology. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aManagement of Computing and Information Systems. 615 24$aComputers and Society. 615 24$aOperating Systems. 676 $a005.8 702 $aChristianson$b Bruce$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aCrispo$b Bruno$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMalcolm$b James A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRoe$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Workshop on Security Protocols 906 $aBOOK 912 $a996466118203316 996 $aSecurity Protocols$9772025 997 $aUNISA LEADER 02678nam 2200529 450 001 9910672226803321 005 20220826084616.0 010 $a84-945106-5-7 010 $a84-9116-614-9 035 $a(CKB)3850000000006795 035 $a(MiAaPQ)EBC4824059 035 $a(OCoLC)1009096940 035 $a(FlNmELB)ELB101036 035 $a(MiAaPQ)EBC7075689 035 $a(Au-PeEL)EBL7075689 035 $a(EXLCZ)993850000000006795 100 $a20170525d2016 uy 0 101 0 $aspa 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aGui?a pra?ctica de la Ley 39/2015, del procedimiento administrativo comu?n de las administraciones pu?blicas /$fRebeca Just Cobos 210 1$aBarcelona :$cEditorial UOC,$d2016. 215 $a1 online resource (164 pa?ginas) $cilustraciones 225 1 $aSehen 311 $a84-9116-613-0 330 $aLa Ley 39/2015, del procedimiento administrativo común de las administraciones públicas, presenta nueva administración, electrónica e interconectada, sin papel, más transparente y ágil en sus trámites. ¿Qué es el registro electrónico de entrada?, ¿estamos obligados a relacionarnos con las administraciones por medios electrónicos?, ¿podemos presentar un documento ante cualquier administración?, ¿es necesario disponer de firma electrónica?, ¿recibiremos notificaciones electrónicas de ahora en adelante?Todas estas preguntas y más se podrán resolver de forma fácil con la lectura de esta publicación, que no pretende realizar un análisis en profundidad, sino que opta por la simple exposición sistemática y clara de la Ley 39/2015, haciendo hincapié en las novedades y reformas del procedimiento administrativo. La naturaleza de esta guía la convierte en una herramienta práctica que presenta las principales novedades del procedimiento administrativo a colectivos como estudiantes, empleados públicos, y ciudadanos en general que requieran estar informados al respecto. 410 0$aSehen. 606 $aAdministrative procedure$zSpain 606 $aPublic administration$zSpain 606 $aDerecho administrativo 606 $aProcedimiento legal 607 $aEspan?a 608 $aLibros electronicos. 615 0$aAdministrative procedure 615 0$aPublic administration 615 4$aDerecho administrativo. 615 4$aProcedimiento legal. 676 $a342.46066 700 $aJust Cobos$b Rebeca$01335673 801 0$bFINmELB 801 1$bFINmELB 906 $aBOOK 912 $a9910672226803321 996 $aGui?a pra?ctica de la Ley 39$93050234 997 $aUNINA LEADER 11154nam 2200517 450 001 996472070103316 005 20231110233354.0 010 $a3-031-02462-1 035 $a(MiAaPQ)EBC6953668 035 $a(Au-PeEL)EBL6953668 035 $a(CKB)21513297600041 035 $a(PPN)262167522 035 $a(EXLCZ)9921513297600041 100 $a20221118d2022 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aApplications of evolutionary computation $e25th European conference, EvoApplications 2022, held as part of EvoStar 2022, Madrid, Spain, April 20-22, 2022, proceedings /$fedited by Juan Luis Jime?nez Laredo, J. Ignacio Hidalgo, and Kehinde Oluwatoyin Babaagba 210 1$aCham, Switzerland :$cSpringer,$d[2022] 210 4$d©2022 215 $a1 online resource (759 pages) 225 1 $aLecture Notes in Computer Science ;$vv.13224 311 08$aPrint version: Jiménez Laredo, Juan Luis Applications of Evolutionary Computation Cham : Springer International Publishing AG,c2022 9783031024610 320 $aIncludes bibliographical references and index. 327 $aIntro -- Preface -- Organization -- Contents -- Applications of Evolutionary Computation -- An Enhanced Opposition-Based Evolutionary Feature Selection Approach -- 1 Introduction -- 2 Moth Flame Optimization -- 2.1 Binary Moth Flame Optimization -- 2.2 Binary Moth Flame Optimization for Feature Selection -- 3 The Proposed Approach -- 3.1 Initialization Using Opposition-Based Method -- 3.2 Retiring Flame -- 4 Experimental Setup and Results -- 5 Conclusions -- References -- A Methodology for Determining Ion Channels from Membrane Potential Neuronal Recordings -- 1 Introduction -- 2 Conductance-Based Model Description -- 3 Defining a Benchmark with Known Types of Ion Channels -- 4 Methodology and Experimental Setup -- 5 Experimental Results -- 6 Conclusions -- A Mathematical Description of the Models -- B Experimental Setup and Parameter Ranges -- References -- Swarm Optimised Few-View Binary Tomography -- 1 Introduction -- 2 Binary Tomographic Reconstruction -- 3 Swarm Optimisation -- 4 Constrained Search in High Dimensions -- 5 Reconstructions -- 6 Results -- 7 Discussion -- 8 Conclusions -- References -- Comparing Basin Hopping with Differential Evolution and Particle Swarm Optimization -- 1 Introduction -- 2 The Metaheuristics Studied -- 2.1 Basin Hopping -- 2.2 Differential Evolution -- 2.3 Particle Swarm Optimization -- 3 The Benchmarking Environment -- 4 Experimental Setup -- 5 Experimental Results -- 6 Conclusions -- References -- Combining the Properties of Random Forest with Grammatical Evolution to Construct Ensemble Models -- 1 Introduction -- 2 Methodology -- 2.1 Structured Grammatical Evolution -- 2.2 Random Structured Grammatical Evolution for Symbolic Regression Problems -- 3 Experimental Setup -- 3.1 Study Problems -- 3.2 Configuration of the Algorithms -- 4 Results -- 5 Conclusions -- References. 327 $aEvoCC: An Open-Source Classification-Based Nature-Inspired Optimization Clustering Framework in Python -- 1 Introduction -- 2 Related Works -- 3 Methodology -- 4 Framework Overview -- 4.1 Parameters -- 4.2 Datasets -- 4.3 Clustering with EvoCluster -- 4.4 Classification -- 4.5 Evaluation Measures -- 4.6 Results Management -- 5 Experiments and Visualizations -- 6 Conclusion and Future Works -- References -- Evolution of Acoustic Logic Gates in Granular Metamaterials -- 1 Introduction -- 2 Problem Statement -- 3 Simulation Setup -- 3.1 2D Granular Simulator -- 3.2 Optimization Method -- 4 Results and Discussion -- 4.1 Evolution of an Acoustic Band Gap -- 4.2 Evolving an AND Gate -- 4.3 Evolving an XOR Gate -- 5 Conclusion and Future Work -- References -- Public-Private Partnership: Evolutionary Algorithms as a Solution to Information Asymmetry -- 1 Introduction -- 2 The Problem -- 3 Proposed Approach -- 3.1 The Model -- 3.2 Data -- 3.3 Adversarial Optimization -- 3.4 Operator (EA1) -- 3.5 Public Administration (EA2) -- 4 Experimental Evaluation -- 4.1 Stochastic Optimization -- 4.2 Analysis -- 4.3 Real World Case -- 5 Conclusions and Future Work -- References -- The Asteroid Routing Problem: A Benchmark for Expensive Black-Box Permutation Optimization -- 1 Introduction -- 2 Background -- 2.1 Two-Body Problem -- 2.2 Maneuvers in Space -- 2.3 Lambert Problem -- 3 Asteroid Routing Problem -- 4 Optimization Algorithms -- 4.1 Sequential Least Squares Programming (SLSQP) -- 4.2 Greedy Nearest Neighbor Heuristic -- 4.3 Unbalanced Mallows Model (UMM) -- 4.4 Combinatorial Efficient Global Optimization (CEGO) -- 5 Experimental Study -- 5.1 Experimental Methodology -- 5.2 Results of the Black-Box Setting -- 5.3 Results of the Informed Setting -- 6 Conclusions -- References -- On the Difficulty of Evolving Permutation Codes -- 1 Introduction -- 2 Preliminaries. 327 $a3 Incremental Construction with EA -- 3.1 Evolving Subsets of Permutations -- 3.2 Iterative Approach -- 3.3 Fitness Functions -- 4 Experimental Evaluation -- 4.1 Experimental Settings -- 4.2 Results -- 5 Conclusions and Future Work -- References -- Improving the Convergence and Diversity in Differential Evolution Through a Stock Market Criterion -- 1 Introduction -- 2 Background -- 2.1 Differential Evolution -- 2.2 Moving Average -- 2.3 Population Diversity -- 2.4 Opposition-Based Learning -- 3 Proposed Approach -- 4 Experiments and Results -- 4.1 Experiments over 30 Dimensions -- 4.2 Experiments over 50 Dimensions -- 5 Conclusions and Future Work -- References -- Search-Based Third-Party Library Migration at the Method-Level -- 1 Introduction -- 2 Background and Motivation -- 2.1 Background -- 2.2 Motivating Example -- 3 Search-Based API Migration -- 3.1 Solution Representation -- 3.2 Calculating the Fitness Function -- 3.3 Genetic Algorithm Operators and Parameters -- 4 Experimental Evaluation -- 4.1 Dataset Used -- 4.2 Metrics Used -- 4.3 Results -- 4.4 Discussion and Limitations -- 5 Related Work -- 6 Conclusion -- References -- Multi-objective Optimization of Extreme Learning Machine for Remaining Useful Life Prediction -- 1 Introduction -- 2 Background -- 3 Methods -- 3.1 Individual Encoding -- 3.2 Optimization Algorithms -- 4 Experimental Setup -- 4.1 Benchmark Dataset -- 4.2 Back-Propagation Neural Networks (BPNNs) -- 4.3 Computational Setup and Data Preparation -- 5 Experimental Results -- 6 Conclusions -- References -- Explainable Landscape Analysis in Automated Algorithm Performance Prediction -- 1 Introduction -- 2 Related Work -- 3 Automated Algorithm Performance Prediction -- 4 Experimental Setup -- 4.1 Data -- 4.2 Regression Models and Their Hyper-parameters -- 4.3 Evaluation -- 5 Results and Discussion -- 6 Conclusion -- References. 327 $aSearch Trajectories Networks of Multiobjective Evolutionary Algorithms -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Search Trajectory Networks -- 3.2 Multiobjective Optimisation Problems -- 4 STN Extension for the Multiobjective Domain -- 5 Experiments -- 5.1 Experimental Parameters -- 5.2 Metrics -- 5.3 Reproducibility -- 6 Results -- 7 Conclusion -- References -- EvoMCS: Optimising Energy and Throughput of Mission Critical Services -- 1 Introduction -- 2 Related Work -- 3 EvoMCS: Multi-objective Optimization -- 3.1 Scenario and Technologies -- 3.2 Evolutionary Algorithm -- 3.3 Heuristic for Fitness -- 3.4 Selection Strategy -- 3.5 Operators to Generate Descendants -- 4 Experimentation -- 4.1 Validation Scenarios -- 4.2 Configuration Parameters -- 4.3 Evaluation Metrics -- 4.4 Profiles Validation - Inputs from EvoMCS -- 5 Results -- 5.1 Operators for the EvoMCS in H1(E/T) -- 5.2 Optimal Configurations -- 5.3 Optimal Profiles in Scenarios with Dense-Environments -- 6 Conclusions -- References -- RWS-L-SHADE: An Effective L-SHADE Algorithm Incorporation Roulette Wheel Selection Strategy for Numerical Optimisation -- 1 Introduction -- 2 Background -- 2.1 Differential Evolution -- 2.2 L-SHADE -- 3 RWS-L-SHADE -- 4 Experimental Results -- 5 Conclusions -- References -- WebGE: An Open-Source Tool for Symbolic Regression Using Grammatical Evolution -- 1 Introduction -- 2 Grammatical Evolution and Differential Evolution -- 3 Software Description -- 3.1 Modular Design -- 3.2 Parallel Execution -- 3.3 Persistence Layer -- 3.4 Implementation Technologies -- 4 WebGE Most Relevant Features -- 4.1 GUI for Experiments Management -- 4.2 Cross-fold Validation -- 4.3 Detailed Statistics -- 5 Use Case: Vladislavleva-4 -- 6 Conclusions -- References -- A New Genetic Algorithm for Automated Spectral Pre-processing in Nutrient Assessment. 327 $a1 Introduction -- 1.1 Goals -- 1.2 Organisation -- 2 Background and Related Work -- 2.1 Vibrational Spectroscopy -- 2.2 Partial Least Squares Regression -- 2.3 Spectral Pre-processing -- 2.4 PLSR for Nutrient Assessment -- 3 The Proposed Approach -- 3.1 Representations for the Two Populations for Co-evolution -- 3.2 Mapping of the Two Populations for Pairwise Evaluations -- 3.3 The Evaluation Method -- 4 Experiment Design -- 4.1 Datasets -- 4.2 Parameter Settings -- 5 Results and Discussions -- 5.1 Comparisons on the Training and Test Performance -- 5.2 Analyses on the Pre-processing Selection -- 5.3 Analyses on Feature Selection Results -- 6 Conclusions and Future Work -- References -- Evolutionary Computation in Edge, Fog, and Cloud Computing -- Dynamic Hierarchical Structure Optimisation for Cloud Computing Job Scheduling -- 1 Introduction -- 2 Related Work -- 3 Job Scheduling Structures -- 4 Structure Optimisation -- 4.1 Brute Force Search Algorithm -- 4.2 Genetic Algorithm -- 4.3 Simulated Annealing Algorithm -- 5 Simulation Experiments and Results -- 5.1 Setup -- 5.2 Experiment 1: Search Algorithm Comparison -- 5.3 Experiment 2: Server Processing Power Dispersion Impact -- 5.4 Experiment 3: Task Size Dispersion Impact -- 5.5 Experiment 4: Job Complexity Impact -- 6 Conclusion -- References -- Optimising Communication Overhead in Federated Learning Using NSGA-II -- 1 Introduction -- 2 Fundamental Concepts -- 2.1 Federated Learning -- 2.2 Communication Overhead in Distributed Deep Learning -- 3 Proposed Approach -- 3.1 The Proposed FL-COP Modelling and Formulation -- 3.2 The Communication-Overhead Reduction Routine -- 4 Experimental Study and Analysis -- 4.1 Problem Benchmarks and Experimental Settings -- 4.2 Experimental Results and Discussion -- 5 Conclusions and Perspectives -- References -- Evolutionary Machine Learning. 327 $aEvolving Data Augmentation Strategies. 410 0$aLecture Notes in Computer Science 606 $aEvolutionary computation 615 0$aEvolutionary computation. 676 $a006.3823 702 $aBabaagba$b Kehinde Oluwatoyin 702 $aHidalgo Pe?rez$b Jose? Ignacio 702 $aLaredo$b Juan Luis Jime?nez 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996472070103316 996 $aApplications of Evolutionary Computation$92834163 997 $aUNISA