{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":52,"n_cols":5,"rows_kept":52,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[17,2,17,3],[18,2,18,3],[22,2,22,3],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[27,2,27,3],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[40,2,40,3],[41,2,41,3],[44,2,44,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910954885503321"]
[null,null,"Autore",null,"Punday Daniel"]
[null,null,"Titolo",null,"Writing at the limit : the novel in the new media ecology / / Daniel Punday"]
[null,null,"Pubbl/distr/stampa",null,"Lincoln, : University of Nebraska Press, 2012"]
[null,null,"ISBN",null,"9786613664648"]
[{"$nulls":4},"9780803240810"]
[{"$nulls":4},"0803240813"]
[{"$nulls":4},"9781280687709"]
[{"$nulls":4},"1280687703"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (281 p.)"]
[null,null,"Collana",null,"Frontiers of narrative"]
[null,null,"Classificazione",null,"LIT004020"]
[null,null,"Disciplina",null,"813/.609"]
[null,null,"Soggetti",null,"American fiction - 21st century - History and criticism - Theory, etc"]
[{"$nulls":4},"Narration (Rhetoric)"]
[{"$nulls":4},"Mass media and literature - United States - History - 21st century"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p.249-260) and index."]
[null,null,"Nota di contenuto",null,"Title Page; Copyright Page; Contents; List of Illustrations; Acknowledgments; Introduction: The Rhetorical Construction of Media Ecologies; 1. Multimedia Moments Old and New; 2. Story, Discourse, and Circulation; 3. Defining the Vocation of the Novel through Narrative Elements; 4. Writing Beyond the Media Limit?; 5. Negotiating Public and Private Spaces; Coda: Connection through Limits and the Myth of Media Fullness; Notes; Bibliography; Index"]
[null,null,null,"Sommario/riassunto","\"An examination of the relationship between contemporary fiction and new media from a narratological perspective\"--"]
[null,"2.","Record Nr.",null,"UNINA9910484703403321"]
[null,null,"Titolo",null,"Evolutionary Computation in Combinatorial Optimization : 14th European Conference, EvoCOP 2014, Granada, Spain, April 23-25, 2014, Revised Selected Papers / / edited by Christian Blum, Gabriela Ochoa"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014"]
[null,null,"ISBN",null,"3-662-44320-1"]
[null,null,"Edizione",null,"[1st ed. 2014.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 241 p. 62 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8600"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Numerical analysis"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Theory of Computation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,"Nota di contenuto",null,"Intro -- Preface -- Organization -- Table of Contents -- A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem -- 1 Introduction -- 1.1 Notation -- 1.2 Problem Definition -- 1.3 Related Work -- 1.4 Organization of the Paper -- 2 A Linear Integer Programming Model -- 3 The Proposed Approach -- 3.1 Preliminaries -- 3.2 Algorithmic Framework -- 3.3 The ACO Phase -- 4 Experimental Evaluation -- 4.1 Problem Instances -- 4.2 Results -- 5 Conclusions and Future Work -- References -- A Parametric Framework for Cooperative Parallel Local Search -- 1 Introduction -- 2 Local Search and Parallelism -- 3 Cooperative Search Framework -- 3.1 Framework Design -- 3.2 Ensuring Diversification -- 3.3 Ensuring Intensification -- 4 An X10 Implementation -- 5 Results and Analysis -- 6 Conclusion and Further Work -- References -- A Survey of Meta-heuristics Used for Computing Maximin Latin Hypercube -- 1 Introduction -- 2 Algorithm Descriptions -- 2.1 Genetic Algorithms -- 2.2 Simulated Annealing -- 2.3 Iterated Local Search -- 3 Mutations -- 4 Evaluation "]
[{"$nulls":4},"Functions -- 5 Experiments -- 5.1 Effect of Algorithm Parameters -- 5.2 Effect of the Mutations -- 5.3 Effect of the Evaluation Function -- 5.4 Scalability of the Algorithms -- 6 HighScores -- 7 Conclusion -- References -- An Analysis of Parameters of irace -- 1 Introduction -- 2 The irace Procedure -- 3 Experimental Setup -- 3.1 Configuration Scenarios -- 3.2 Training Set Analysis -- 3.3 Experimental Setup -- 4 Experiments -- 5 Final Remarks and Future Work -- References -- An Improved Multi-objective Algorithm for the Urban Transit Routing Problem -- 1 Introduction -- 2 Problem Description -- 3 Methodology -- 3.1 NSGAII -- 3.2 Heuristic Construction -- 3.3 Genetic Operators -- 4 Results -- 5 Conclusion -- References."]
[{"$nulls":4},"An Iterated Greedy Heuristic for Simultaneous Lot-Sizing and Scheduling Problem in Production Flow Shop Environments -- 1 Introduction -- 2 Problem Description -- 3 Iterated Greedy Heuristic for the LSSPFS -- 3.1 Solution Representation -- 3.2 Construction of an Initial Solution -- 3.3 Destruction and Construction Procedures -- 3.4 Local Search -- 3.5 Lot-sizing Improvement -- 4 Computational Experiments -- 4.1 Calibration of the IG Heuristic -- 4.2 Results and Comparisons -- 4.3 Analysis of the Computational Times -- 5 Conclusion -- References -- Balancing Bicycle Sharing Systems: An Approach for the Dynamic Case -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 4 Modeling the Dynamic Scenario -- 4.1 Segments and Events -- 4.2 Expected Number of Bikes at Stations -- 4.3 Classification of Stations -- 4.4 Restrictions on Loading Instructions -- 5 Greedy Construction Heuristic -- 6 Metaheuristic Approaches -- 7 Computational Results -- 8 Conclusions and Future Work -- References -- Cooperative Selection: Improving Tournament Selection via Altruism -- 1 Introduction -- 2 Cooperative Selection -- 2.1 Scheme Description -- 2.2 Properties and Tuning of Parameters -- 3 Validating Cooperative Selection in a Noisy Real Problem -- 3.1 Estimated Secondary Structure Similarity (ESSS) -- 3.2 Experimental Setup -- 3.3 Analysis of Results -- 4 Conclusions and Future Works -- References -- Diversity-Driven Selection of Multiple Crossover Operators for the Capacitated Arc Routing Problem -- 1 Introduction -- 2 Background -- 2.1 Problem Definition -- 2.2 MAENS -- 2.3 Approximation Algorithms -- 3 A Distance Measure for the CARP -- 3.1 Measuring the Average Diversity of the Population -- 3.2 A Revised Distance Measure Based on Neighbour Tasks -- 3.3 Diversity-Driven Stochastic Ranking -- 4 Operator Selection -- 4.1 Crossover Operators."]
[{"$nulls":4},"4.2 Adaptive Operator Selection -- 5 Experimental Studies -- 6 Conclusions -- References -- Dynamic Period Routing for a Complex Real-World System: A Case Study in Storm Drain Maintenance -- 1 Introduction -- 2 Related Works -- 3 Storm Drains Maintenance Problem -- 4 Adaptive Planning Heuristic (APH) -- 4.1 Routing Stage -- 4.2 Adaptive Planning Stage -- 5 Computational Results -- 6 Conclusion -- References -- Elementary Landscape Decomposition of the Hamiltonian Path Optimization Problem -- 1 Introduction -- 2 Background on Landscape Theory -- 3 Hamiltonian Path Optimization Problem -- 4 Landscape for Reversals -- 4.1 Component Model -- 4.2 Proof of Elementariness -- 5 Landscape Structure for Swaps -- 5.1 Previous Results for QAP -- 5.2 Elementary Landscape Decomposition of the HPO -- 6 Conclusions and Future Work -- References -- Gaussian Based Particle Swarm Optimisation and Statistical Clustering for Feature Selection -- 1 Introduction -- 1.1 Goals -- 2 Background -- 2.1 Particle Swarm Optimisation (PSO) -- 2.2 Related Work on Feature Selection -- 3 The Proposed Approach -- 3.1 Determine the Number of Features Selected -- 3.2 How to Select Features -- 4 Experimental Design -- 5 Results and Discussions -- 5.1 Results of "]
[{"$nulls":4},"GPSO -- 5.2 Comparisons on Computational Time -- 5.3 Further Comparisons with Traditional Methods -- 6 Conclusions and Future Work -- References -- Global Optimization of Multimodal Deceptive Functions -- 1 Introduction -- 2 Preliminaries -- 2.1 Simulated Annealing -- 2.2 Graph Clustering Based Model Building -- 3 Extended Simulated Annealing -- 4 Experiments -- 5 Results -- 5.1 Performance of the Classical Simulated Annealing -- 5.2 Performance of the Extended Simulated Annealing -- 6 Conclusions -- References -- Learning Inherent Networks from Stochastic Search Methods -- 1 Introduction -- 2 Methods."]
[{"$nulls":4},"2.1 Studied Problem and Search Heuristic -- 2.2 Monitoring the Search Dynamics -- 2.3 The Nodes -- 2.4 The Edges -- 3 Experiments -- 4 Results -- 4.1 Comparative and Convergence Analysis of the Inherent Networks -- 4.2 Structure of the Inherent Networks -- 5 Conclusions -- References -- Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 3.1 Time Window Model -- 3.2 Objective -- 4 Solution Methods -- 4.1 Local Search Operators -- 4.2 Metaheuristics -- 5 Computational Experiments -- 5.1 Generating Orders -- 5.2 Speed and Travel Parameters -- 5.3 Aims -- 5.4 Findings -- 6 Conclusions and Future Work -- References -- Modeling an Artificial Bee Colony with Inspector for Clustering Tasks -- 1 Introduction -- 2 The Clustering Problem -- 3 Artificial Bee Colony -- 4 Inspector Bee in the Colony -- 5 Algorithm Structure and Fitness Function -- 6 Experimental Results -- 6.1 Convergence Analysis -- 7 Conclusions and Future Work -- References -- Personalized Multi-day Trips to Touristic Regions: A Hybrid GA-VND Approach -- 1 Introduction -- 2 Related Literature -- 3 The Proposed Algorithm -- 3.1 General Structure of the Algorithm -- 3.2 Initialization -- 3.3 Genetic Algorithm -- 3.4 Variable Neighborhood Descent -- 4 Computational Experiments -- 4.1 Benchmark Instances -- 4.2 Results -- 5 Conclusion -- References -- Phase Transition and Landscape Properties of the Number Partitioning Problem -- 1 Introduction -- 2 Number Partitioning Problem -- 2.1 Problem Definition -- 2.2 Phase Transition in NPP -- 3 Landscape of NPP -- 3.1 Definitions and Experimental Setup -- 3.2 Experimental Results -- 4 Conclusions -- References -- The Firefighter Problem: Application of Hybrid Ant Colony Optimization Algorithms -- 1 Introduction -- 2 The Proposed Algorithms."]
[{"$nulls":4},"2.1 Solution Representation and Pheromone Model -- 2.2 ACO: A Pure MMAS Approach -- 2.3 HyACO: A Hybrid ACO Variant -- 3 Experimental Evaluation -- 4 Conclucions and Future Work -- References -- The Influence of Correlated Objectives on Different Types of P-ACO Algorithms -- 1 Introduction -- 2 MOPs with Correlated Objectives -- 3 Ranking Methods for MOPs and P-ACO -- 4 Results -- 4.1 Expected Correlation -- 4.2 Experimental Results -- 5 Conclusion -- References -- Author Index."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 14th European Conference on Evolutionary Computation in Combinatorial Optimization, Evo COP 2014, held in Granada, Spain, in April 2014, co-located with the Evo*2014 events Euro GP, Evo BIO, Evo MUSART and Evo Applications. The 20 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers cover the following topics: swarm intelligence algorithms, fitness landscapes and adaptive algorithms, real world and routing problems and cooperative and metaheuristic search."]