LEADER 01074nam0-2200337 --450 001 9910303657003321 005 20190117145629.0 010 $a978-88-230-1820-4 020 $aIT$b2013-5967 100 $a20190117d2013----kmuy0itay5050 ba 101 0 $aita 102 $aIT 105 $a 001yy 200 1 $aRicordi di vita sindacale e politica$fArvedo Forni$gcon la collaborazione di Giaime Moser$gpresentazioni di Carlo Ghezzi e Mauro Roda 210 $aRoma$cEdiesse$d2013 215 $a211 p.$cill.$d22 cm 225 1 $aStoria e memoria 610 0 $aConfederazione generale italiana del lavoro$aDiari e memorie 610 0 $aForni, Arvedo$aDiari e memorie 676 $a331.88092$v22$zita 700 1$aForni,$bArvedo$0256550 702 1$aMoser,$bGiaime 702 1$aGhezzi,$bCarlo$f<1946- > 702 1$aRoda,$bMauro 801 0$aIT$bUNINA$gREICAT$2UNIMARC 901 $aBK 912 $a9910303657003321 952 $aFONDO SENATO 127$b1372019$fFSPBC 959 $aFSPBC 996 $aRicordi di vita sindacale e politica$91328100 997 $aUNINA LEADER 07421nam 22008295 450 001 9910143893103321 005 20201019012846.0 010 $a3-540-45724-0 024 7 $a10.1007/3-540-45724-0 035 $a(CKB)1000000000211851 035 $a(SSID)ssj0000321307 035 $a(PQKBManifestationID)11262189 035 $a(PQKBTitleCode)TC0000321307 035 $a(PQKBWorkID)10263535 035 $a(PQKB)11299233 035 $a(DE-He213)978-3-540-45724-4 035 $a(MiAaPQ)EBC3073098 035 $a(PPN)155188704 035 $a(EXLCZ)991000000000211851 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAnt Algorithms $eThird International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002. Proceedings /$fedited by Marco Dorigo, Gianni Di Caro, Michael Sampels 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (XIV, 310 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2463 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-44146-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aA MAX-MIN Ant System for the University Course Timetabling Problem -- A MAX-MIN Ant System for the University Course Timetabling Problem -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification -- Agent-Based Approach to Dynamic Task Allocation -- Agent-Based Approach to Dynamic Task Allocation -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows -- Ant Algorithms for Assembly Line Balancing -- Ant Algorithms for Assembly Line Balancing -- Ant Colonies as Logistic Processes Optimizers -- Ant Colonies as Logistic Processes Optimizers -- Ant Systems for a Dynamic TSP -- Ant Systems for a Dynamic TSP -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Anti-pheromone as a Tool for Better Exploration of Search Space -- Applying Population Based ACO to Dynamic Optimization Problems -- Applying Population Based ACO to Dynamic Optimization Problems -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows -- Modelling ACO: Composed Permutation Problems -- Modelling ACO: Composed Permutation Problems -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Self-Organized Networks of Galleries in the Ant Messor Sancta -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic -- Toward the Formal Foundation of Ant Programming -- Toward the Formal Foundation of Ant Programming -- Towards Building Terrain-Covering Ant Robots -- Towards Building Terrain-Covering Ant Robots -- Short Papers -- A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions -- An Ant-Based Framework for Very Strongly Constrained Problems -- Analysis of the Best-Worst Ant System and Its Variants on the QAP -- Ants and Loops -- Candidate Set Strategies for Ant Colony Optimisation -- Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization -- Homogeneous Ants for Web Document Similarity Modeling and Categorization -- Parallel Ant System for the Set Covering Problem -- Real-World Shop Floor Scheduling by Ant Colony Optimization -- Simulation of Nest Assessment Behavior by Ant Scouts -- Using Genetic Algorithms to Optimize ACS-TSP -- Posters -- A Method for Solving Optimization Problems in Continuous Space Using Ant Colony Algorithm -- A Nested Layered Threshold Model for Dynamic Task Allocation -- ACO Algorithm with Additional Reinforcement -- Ant Colony System for Image Segmentation Using Markov Random Field -- Bidimensional Shapes Polygonalization by ACO -- Coevolutionary Ant Algorithms Playing Games -- GAACO: A GA + ACO Hybrid for Faster and Better Search Capability -- GPS Positioning Networks Design: An Application of the Ant Colony System. 330 $aThis book constitutes the refereed proceedings of the Third International Workshop on Ant Algorithms, ANTS 2002, held in Brussels, Belgium in September 2002. The 17 revised full papers, 11 short papers, and extended poster abstracts presented were carefully reviewed and selected from 52 submissions. The papers deal with theoretical and foundational aspects and a variety of new variants of ant algorithms as well as with a broad variety of optimization applications in networking and operations research. All in all, this book presents the state of the art in research and development in the emerging field of ant algorithms. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2463 606 $aComputer networks 606 $aArtificial intelligence 606 $aComputer programming 606 $aAlgorithms 606 $aComputers 606 $aNumerical analysis 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aNumeric Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I1701X 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputers. 615 0$aNumerical analysis. 615 14$aComputer Communication Networks. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aNumeric Computing. 676 $a512/.7 702 $aDorigo$b Marco$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDi Caro$b Gianni$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSampels$b Michael$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aANTS 2002 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143893103321 996 $aAnt Algorithms$92065528 997 $aUNINA LEADER 04436nam 22007695 450 001 9910299882703321 005 20251116182838.0 010 $a3-319-64066-6 024 7 $a10.1007/978-3-319-64066-2 035 $a(CKB)3710000001631003 035 $a(MiAaPQ)EBC4942002 035 $a(DE-He213)978-3-319-64066-2 035 $a(PPN)203852494 035 $a(EXLCZ)993710000001631003 100 $a20170810d2018 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aProgramming Visual Illusions for Everyone /$fby Marco Bertamini 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (221 pages) $cillustrations, tables 225 1 $aVision, Illusion and Perception,$x2365-7472 ;$v2 311 08$a3-319-64065-8 320 $aIncludes bibliographical references and index. 327 $aIllusions are Fun -- Programming is Fun -- PsychoPy is Fun.-Kanizsa Square -- Ponzo Illusion -- Delboeuf Illusion -- Ebbinghaus Illusion -- Münsterberg and Café Wall Illusion -- Brightness contrast and White Illusion -- Neon Colour Spreading -- Honeycomb Illusion -- Breathing Square Illusion -- Stepping Feet Illusion -- Lilac Chaser Illusion -- Hierarchical Motion Organisation -- And More: Files, Irregular Polygons and Images -- Visual Perception Glossary -- Programming Glossary. 330 $aIf you find visual illusions fascinating Programming Visual Illusions for Everyone is a book for you. It has some background, some history and some theories about visual illusions, and it describes in some detail twelve illusions. Some are about surfaces, some are about apparent size of objects, some are about colour and some involve movement. This is only one aspect of the book. The other is to show you how you can create these effects on any computer. The book includes a brief introduction to a powerful programming language called Python. No previous experience with programming is necessary. There is also an introduction to a package called PsychoPy that makes it easy to draw on a computer screen. It is perfectly ok if you have never heard the names Python or PsychoPy before. Python is a modern and easy-to-read language, and PsychoPy takes care of all the graphical aspects of drawing on a screen and also interacting with a computer. By the way, both Python and PsychoPy are absolutely free. Is this a book about illusions or about programming? It is both! 410 0$aVision, Illusion and Perception,$x2365-7472 ;$v2 606 $aTechnology 606 $aSignal processing 606 $aImage processing 606 $aSpeech processing systems 606 $aCognitive psychology 606 $aArts 606 $aComputational intelligence 606 $aHumanities 606 $aPopular Science in Technology$3https://scigraph.springernature.com/ontologies/product-market-codes/Q36000 606 $aSignal, Image and Speech Processing$3https://scigraph.springernature.com/ontologies/product-market-codes/T24051 606 $aCognitive Psychology$3https://scigraph.springernature.com/ontologies/product-market-codes/Y20060 606 $aArts$3https://scigraph.springernature.com/ontologies/product-market-codes/416000 606 $aComputational Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/T11014 606 $aPopular Science in Humanities / Arts$3https://scigraph.springernature.com/ontologies/product-market-codes/Q33000 615 0$aTechnology. 615 0$aSignal processing. 615 0$aImage processing. 615 0$aSpeech processing systems. 615 0$aCognitive psychology. 615 0$aArts. 615 0$aComputational intelligence. 615 0$aHumanities. 615 14$aPopular Science in Technology. 615 24$aSignal, Image and Speech Processing. 615 24$aCognitive Psychology. 615 24$aArts. 615 24$aComputational Intelligence. 615 24$aPopular Science in Humanities / Arts. 676 $a006.6869 700 $aBertamini$b Marco$4aut$4http://id.loc.gov/vocabulary/relators/aut$01058645 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299882703321 996 $aProgramming Visual Illusions for Everyone$92501300 997 $aUNINA