1  20
Next
 Symposium on Mathematical Foundations of Computer Science (1972 ) (40th : 2015 : Milan, Italy)
 Berlin, Heidelberg : Springer, 2015.
 Description
 Book — 1 online resource (xvii, 615 pages) : illustrations Digital: text file.PDF.
 Summary

 Intro
 Preface
 Conference Organization
 Contents
 Part II
 Contents
 Part I
 NearOptimal Asymmetric Binary Matrix Partitions
 1 Introduction
 2 Preliminaries
 3 The Uniform Case
 4 Asymmetric Binary Matrix Partition as Welfare Maximization
 References
 Dual VP Classes
 1 Introduction
 1.1 ACC1 and TC1
 1.2 Algebraic Degree
 1.3 Duality
 2 Preliminaries, and Definitions of classes
 3 Subclasses of ACC1
 3.1 Comparing P and VP.
 4 Threshold Circuits and Small Degree
 4.1 Degree Reduction
 5 Conclusions, Discussion, and Open Problems
 References
 On Tinhofer's Linear Programming Approach to Isomorphism Testing
 1 Introduction
 2 Amenable Graphs
 3 Amenable Graphs Are Compact
 4 A ColorRefinement Based Hierarchy of Graphs
 References
 On the Complexity of Noncommutative Polynomial Factorization
 1 Introduction
 2 VariableDisjoint Factorization Problem
 2.1 Uniqueness of VariableDisjoint Factorization
 2.2 Equivalence with PIT
 2.3 BlackBox VariableDisjoint Factorization Algorithm
 3 Factorization of Multilinear and Homogeneous Polynomials
 4 A Polynomial Decomposition Problem
 5 Concluding Remarks and Open Problems
 References
 An Algebraic Proof of the Real Number PCP Theorem
 1 Introduction
 1.1 Problems with the Classical Proof and Outline
 2 Basic Notions
 2.1 Testing Trigonometric Polynomials
 3 The Correctness Test
 4 Segmented Almost Transparent Proofs for NPR
 References
 On the Complexity of Hub Labeling (Extended Abstract)
 1 Introduction
 2 Preliminaries
 2.1 HL Approximation Algorithm
 2.2 Greedy HHL Algorithms
 3 HHL and Highway Dimension
 4 Upper Bounds
 5 Lower Bounds
 6 NPHardness Proofs
 6.1 Undirected Graphs
 6.2 Directed Graphs
 7 HL vs HHL
 8 Concluding Remarks
 References
 On the Complexity of Speed Scaling
 1 Introduction
 2 Model and Notation
 3 Hardness Results
 3.1 Hardness of BIDUA
 4 Polynomial Time Algorithms
 4.1 An Algorithm for FEIDUU
 4.2 An Algorithm for FEICUU
 4.3 An Algorithm for FEFCWA
 5 Equivalence Reductions
 5.1 Reducing BICUU to FEICUU
 5.2 Reducing the Discrete to the Continuous Setting
 5.3 Reducing from Budget to Flow Plus Energy for Fractional Flow
 References
 Almost All Functions Require Exponential Energy
 1 Introduction
 1.1 Our Contributions
 1.2 Related Work
 1.3 Formal Model
 2 A Lower Bound on the Number of Functions Computable by a Circuit
 2.1 Homogeneous Supply Voltages
 2.2 Heterogeneous Supply Voltages
 3 Almost All Functions Require Exponential Energy
 3.1 Adaptation of Shannon's Argument
 3.2 Homogeneous Supply Voltages
 3.3 Heterogeneous Supply Voltages
 4 Relating Energy and the Number of Faulty Gates
 References
 On Dynamic DFS Tree in Directed Graphs
 1 Introduction
 1.1 An Efficient Decremental Algorithm for a DFS Tree in a DAG
 1.2 Lower Bounds on Dynamic DFS Tree
(source: Nielsen Book Data)
2. Algorithmic randomness and complexity [2008]
 Downey, R. G. (Rod G.)
 New York ; London : Springer, 2008.
 Description
 Book — 1 online resource (xxviii, 855 pages) : illustrations
 Summary

 Preface. Acknowledgments. Introduction. I. Background. Preliminaries. Computability Theory. Kolmogorov Complexity of Finite Strings. Relating Plain and PrefixFree Complexity. Effective Reals. II. Randomness of Sets. MartinLof Randomness. Other Notions of Effective Randomness. Algorithmic Randomness and Turing Reducibility. III. Relative Randomness. Measures of Relative Randomness. The Quantity of K and Other Degrees. RandomnessTheoretic Weakness. Lowness for Other Randomness Notions. Effective Hausdorff Dimension. IV. Further Topics. Omega as an Operator. Complexity of C.E. Sets. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
3. Cooperative bug isolation : winning thesis of the 2005 ACM Doctoral Dissertation Competition [2007]
 Liblit, Ben.
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xv, 101 pages) : illustrations Digital: text file.PDF.
 Summary

 Instrumentation Framework. Practical Considerations. Techniques for Statistical Debugging. Related Work. Conclusion.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
4. Transactional memory : foundations, algorithms, tools, and applications : COST Action EuroTM IC1001 [2015]
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (xiv, 469 pages) : illustrations Digital: text file; PDF.
 Summary

 Design and implementation of TM systems, including their theoretical underpinnings and algorithmic foundations. Programming language integration and verification tools. Hardware supports. Distributed TM systems. Selftuning mechanisms. Lessons learnt from building complex TMbased applications.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Conference on Developments in Language Theory (19th : 2015 : Liverpool, England)
 Cham : Springer, 2015.
 Description
 Book — 1 online resource (xxii, 440 pages) : illustrations Digital: text file.PDF.
 Summary

 Recognisable Languages over Monads
 Garside and quadratic normalisation: a survey
 GrammarBased Tree Compression
 On decidability of intermediate levels of concatenation hierarchies
 Ergodic in Finite permutations of minimal complexity
 Diverse Palindromic Factorization is NPComplete
 Factorization in Formal Languages
 Consensus Game Acceptors
 On the Size of TwoWay Reasonable Automata for the Liveness Problem
 Squareable Words
 Complexity Analysis: Transformation Monoids of Finite Automata
 Palindromic complexity of trees
 Deciding proper conjugacy of classes of onesided FinitetypeDyck shifts
 Transfinite Lyndon words
 Unary patterns under permutations
 Finite Automata Over In Finite Alphabets: Two Models with Transitions for Local Change
 Enumeration formulin neutral sets
 On the Density of ContextFree and Counter Languages
 StarContinuous Kleene OmegaAlgebras
 Unary probabilistic and quantum automata on promise problems
 Generalizations of Code Languages with Marginal Errors
 Minimal Reversible Deterministic Finite Automata
 MultiSequential Word Relations
 The Boundary of PrefixFree Languages
 A connected 3state reversible Mealy automaton cannot generate an infinite Burnside group
 Path Checking for MTL and TPTL over Data Words
 On Distinguishing NC1 and NL
 Sur minimisation of automata
 On the Complexity of kPiecewise Testability and the Depth of Automata
 Interval Exchange Words and the Question of Hof, Knill, and Simon
 State Complexity of Neighbourhoods and Approximate Pattern Matching
 Deterministic ordered restarting automata that compute functions
 Weight Assignment Logic
 Complexity Bounds of ConstantSpace Quantum Computation.
 Conference on Developments in Language Theory (18th : 2014 : Ekaterinburg, Russia)
 Cham : Springer, 2014.
 Description
 Book — 1 online resource (xviii, 349 pages) : illustrations Digital: text file; PDF.
 Summary

 Finite Automata and Regular Languages On Automatic Transitive Graphs. Upper Bounds on Syntactic Complexity of Left and TwoSided Ideals. On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. State Complexity of Deletion. Semisimple Synchronizing Automata and the WedderburnArtin Theory. On two Algorithmic Problems about Synchronizing Automata (short paper). Synchronizing Automata with Random Inputs (short paper). Graph Spectral Properties of Deterministic Finite Automata (short paper). Pushdown Automata and Related Models. InputDriven Pushdown Automata with Limited Nondeterminism (invited paper). How to Remove the LookAhead of TopDown Tree Transducers. ScopeBounded Pushdown Languages. Visibly Pushdown Transducers with Wellnested Outputs. Characterising REGEX Languages by Regular Languages Equipped with FactorReferencing. Pumping Lemma and Ogden Lemma for Displacement Contextfree Grammars. Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy
 On kAbelian Pattern Matching. On kAbelian Palindromic Rich and Poor Words. Variations of The Morse{Hedlund Theorem for kAbelian Equivalence. Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word. Knight Tiles: Particles and Collisions in The Realm of 4Way Deterministic Tilings
 Eigenvalues and Transduction of Morphic Sequences. BreadthFirst Serialisation of Trees and Rational Languages (short paper). Algebraic, Decidability and Complexity Problems for Languages Measuring Communication in Automata Systems (invited paper). From Algebra to Logic: There and Back Again { The Story of A Hierarchy (invited paper). Closure Properties of Pattern Languages. Minimal and HyperMinimal Biautomata. Deterministic Set Automata. The Minimum Amount of Useful Space: New Results and New Directions. Debates with Small Transparent Quantum Verifiers. Embedding Finite and Infinite Words into Overlapping Tiles.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 IUKM (Symposium) (2013 : Beijing, China)
 Heidelberg : Springer, 2013.
 Description
 Book — 1 online resource (xii, 218 pages) : illustrations Digital: text file.PDF.
 Summary

 Robot Reasoning Using First Order Bayesian Networks / Saleha Raza, Sajjad Haider
 DempsterShafer Theory with Smoothness / Ronald Böck, Stefan Glüge, Andreas Wendemuth
 A Probabilistic Model for Prioritizing Engineering Design Requirements in Uncertain QFD / HongBin Yan, Tieju Ma
 Applying OWA Operator to Model Group Behaviors in Uncertain QFD / HongBin Yan, Tieju Ma, VanNam Huynh
 New Propagation Algorithm in Dynamic Directed Evidential Networks with Conditional Belief Functions / Wafa Laâmari, Boutheina Ben Yaghlane
 Evidential Grammars for Image Interpretation  Application to Multimodal Traffic Scene Understanding / JeanBaptiste Bordes, Franck Davoine
 Generic Discounting Evaluation Approach for Urban Image Classification / Ahmed Samet, Imen Hammami, Eric Lefèvre
 Spatial Weighting for BagofFeatures Based Image Retrieval / Chuanqian Wang, Baochang Zhang
 A Random Set and RuleBased Regression Model Incorporating Image Labels / Guanyi Li, Jonathan Lawry
 Mining Statistically Significant Target mRNA Association Rules Based on microRNA / Feng Chen, Tingting Wang, Yu Wang
 Interval Algorithm for SetMembership Identification of MIMO LTI System / Xiaojun Wang, Chen Yang, Baochang Zhang
 An Approach for Obtaining Bargaining Set in Multichoice Games / Tianwen Li, Feng Ma, Weiyi Liu
 An Optimized Method for Selection of the Initial Centers of KMeans Clustering / YongJun Zhang, Enxiu Cheng
 Improving Short Text Classification Using Public Search Engines / Wang Meng, Lin Lanfen, Wang Jing, Yu Penghua
 Using Social Networks for Integrating a Tacit Knowledge Repository to Support the Performance of Software Development Teams / Reyes JuárezRamírez, Rafael PimientaRomo
 Tacit Knowledge Formalization to Support the Adoption Process of Software Quality Models / Violeta OceguedaMiramontes
 Design and Implementation of an Office Automation Assistant Utility Using Adobe AIR Technology / Xin Liu, Liang Liao, Bin Yang, Heng Liu
 Modified NFTSM on State in Switched Reluctance Motor Speed Controller / Yong Cheng
 Uncertain Nonlinear System Modeling and Identification Using Belief RuleBased Systems / YuWang Chen, JianBo Yang, DongLing Xu.
 CASC (Workshop : 2001 ) (10th : 2007 : Bonn, Germany)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xiii, 460 pages) : illustrations Digital: text file.PDF.
 Summary

 Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation. Computations in Modules over Commutative Domains. Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds. An Efficient LLL Gram Using Buffered Transformations. On the Computation of A ???Maps. Algebraic Visualization of Relations Using RelView. Comprehensive Triangular Decomposition. Stability Investigation of a Difference Scheme for Incompressible NavierStokes Equations. A SymbolicNumerical Algorithm for Solving the Eigenvalue Problem for a Hydrogen Atom in the Magnetic Field: Cylindrical Coordinates. An Algorithm for Construction of Normal Forms. Computer Algebra: A `Classical' Path to Explore Decoherence and Entanglement Phenomena in Quantum Information Theory. Deducing the Constraints in the LightCone SU(3) YangMills Mechanics Via Groebner Bases. On the Weight Spectra of Conway Matrices Related to the Nontransitive HeadorTail Game. Properties of the Liapunov Stability Zones of the Lagrange Triangle. Studying the Stability of the Second Order Nonautonomous Hamiltonian System. On the Peculiar Properties of Families of Invariant Manifolds of Conservative Systems. A Unified Algorithm for Multivariate Analytic Factorization. On the Computation of the Defining Polynomial of the Algebraic Riccati Equation. Symmetries and Dynamics of Discrete Systems. Exact Solutions of Completely Integrable Systems and Linear ODE's Having Elliptic Function Coefficients. Dynamics of Nonlinear Parabolic Equations with Cosymmetry. Weak Integer Quantifier Elimination Beyond the Linear Case. Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. Ruppert Matrix as Subresultant Mapping. Construction of Computer System for Microobjects Recognition Based on Neural Networks. Analytical Solution for Transient Flow of a Generalized Bingham Fluid with Memory in a Movable Tube Using Computer Algebra. Some Elimination Problems for Matrices. A Full System of Invariants for ThirdOrder Linear Partial Differential Operators in General Form. Automatic Stability Analysis for a Diffusion Equation with Memories Using Maple. Bounds for Real Roots and Applications to Orthogonal Polynomials. Distance Computation from an Ellipsoid to a Linear or a Quadric Surface in IR n
 Robust Stability for Parametric Linear ODEs. Symbolic and Algebraic Methods for Linear Partial Differential Operators. A New Scheme for Deniable/Repudiable Authentication. An AlgebraicNumeric Algorithm for the Model Selection in Kinetic Networks. On the Representation of the Differential Operator in Bases of Periodic Coiflets and It's Application.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
9. Computing with new resources : essays dedicated to Jozef Gruska on the occasion of his 80th birthday [2014]
 Cham : Springer, 2014.
 Description
 Book — 1 online resource (xxi, 473 pages) : illustrations Digital: text file; PDF.
 Summary

 Counting With Probabilistic and Ultrametric Finite Automata
 Systolic Automata and P Systems
 Soliton Automata with Multiple Waves
 On Power Series over a Graded Monoid
 Advances on Random Sequence Generation by Uniform Cellular Automata
 On the Determinization Blowup for Finite Automata Recognizing EqualLength Languages
 Aspects of Reversibility for Classical Automata
 A Weakly Universal Cellular Automaton in the Pentagrid with Five States
 Minimum and nonMinimum Time Solutions to the Firing Squad Synchronization Problem
 TimeOptimum SmallerState Synchronizers for Cellular Automata
 Computing Boolean Functions via Quantum Hashing
 Complexity of Promise Problems on Classical and Quantum Automata
 Quantum Complexity of Boolean Matrix Multiplication and Related Problems
 Quantum Distributed Computing Applied to Grover's Search Algorithm
 Maximally Entangled State in PseudoTelepathy Games
 Quantum Finite Automata: A Modern Introduction
 Physical Aspects of Oracles for Randomness and Hadamard's Conjecture
 From Quantum Query Complexity to State Complexity
 Small Universal Devices
 A Technique to Obtain Hardness Results for Randomized Online Algorithms
 Integral Difference Ratio Functions on Integers
 Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources
 Symmetries and Dualities in NamePassing Process Calculi
 Learning from Positive Data and Negative Counterexamples
 OneSided Random Context Grammars
 How Can We Construct Reversible Machines out of Reversible Logic Element with Memory?
 On Evolutionary Approximation of Logic Circuits
 A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated CyberPhysical Systems
 On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
 P Systems with AntiMatter
 A Robust Universal Flying Amorphous Computer
 Minimal Reaction Systems Defining Subset Functions
 Grand Challenges of Informatics
 Konrad Zuse's Relationship to Informatics.
 ANTS (Conference : Swarm intelligence) (9th : 2014 : Brussels, Belgium)
 Cham : Springer, 2014.
 Description
 Book — 1 online resource (308 pages) : illustrations Digital: text file; PDF.
 Summary

 A Novel Ant Colony Algorithm for Building Neural Network Topologies. An ACO Algorithm to Solve an Extended Cutting Stock Problem for Scrap Minimization in a Bar Mill. An Experiment in Automatic Design of Robot Swarms. Angle Modulated Particle Swarm Variants. Ant Colony Optimization on a Budget of 1000. Application of Supervisory Control Theory to Swarms of epuck and Kilobot Robots. Can Frogs Find Large Independent Sets in a Decentralized Way? Yes They Can!. Diversity Rate of Change Measurement for Particle Swarm Optimizers. Evolutionary Swarm Robotics: Genetic Diversity, Taskallocation and Taskswitching. Influencing a Flock via Ad Hoc Teamwork. MACOC: A Medoidbased ACO Clustering Algorithm. Particle Swarm Convergence: Standardized Analysis and Topological Influence. Scheduling a Galvanizing Line by Ant Colony Optimization. SRoCS: Leveraging Stigmergy on a Multirobot Construction Platform for Unknown Environments. Swarm in a Fly Bottle: Feedbackbased Analysis of Selforganizing Temporary Lockins. Temporal Task Allocation in Periodic Environments. Towards a Cognitive Design Pattern for Collective Decisionmaking. Short Papers. A Novel Competitive Quantumbehaviour Evolutionary Multiswarm Optimizer Algorithm Based on CUDA Architecture Applied to Constrained Engineering Design. Cooperative Object Recognition: Behaviours of a Artificially Evolved Swarm. Emergent Diagnoses from a Collective of Radiologists: Algorithmic versus Social Consensus Strategies. Foraging Agent Swarm Optimization with Applications in Data Clustering. GPU Implementation of Foodforaging Problem for Evolutionary Swarm Robotics Systems. Natureinspired Swarm Robotics Algorithms for Prioritized Foraging. Particle Swarm Optimisation with Enhanced Memory Particles. Sorting in Swarm Robots Using Communicationbased Cluster Size Estimation. Using Fluid Neural Networks to Create Dynamic Neighborhood Topologies in Particle Swarm Optimization. Extended Abstracts. A Lowcost Realtime Tracking Infrastructure for Groundbased Robot Swarms. A New Ant Colony Optimization Algorithm: Three Bound Ant System. An Adaptive Bumble Bees Mating Optimization Algorithm for the Hierarchical Permutation Flowshop Scheduling Problem. Gene Expression in DNA Microarrays: A classification problem using Artificial Bee Colony (ABC) algorithm. Morphology Learning via MDL and Ants. Parallelizing Solution Construction in ACO for GPUs. Solving Resourceconstraint Project Scheduling Problems based on ACO algorithms.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 International Conference on Wireless Internet (7th : 2013 : Shanghai, China)
 Heidelberg : Springer, 2013.
 Description
 Book — 1 online resource (x, 203 pages) : illustrations Digital: text file.PDF.
 Summary

 Vehicular Communications and Heterogeneous Networks. Cognitive Radio and Multiantenna Systems. 3G Networks and Beyond. Ad Hoc and Mesh Networks.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
12. The Hash Function BLAKE [2014]
 Berlin : Springer, 2014.
 Description
 Book — 1 online resource (xviii, 228 pages) : illustrations (some color) Digital: text file; PDF.
 Summary

 Introduction
 Preliminaries
 Specification of BLAKE
 Using BLAKE
 BLAKE in Software
 BLAKE in Hardware
 Design Rationale
 Security of BLAKE
 BLAKE2
 Conclusion
 References
 App. A, Test Vectors
 App. B, Reference C Code
 App. C, ThirdParty Software
 Index.
 International Computer Science Symposium in Russia (8th : 2013 : Ekaterinburg, Russia)
 Berlin : Springer, ©2013.
 Description
 Book — 1 online resource (xii, 443 pages) : illustrations Digital: text file.PDF.
 Summary

 Opening Lecture. The Lovász Local Lemma  A Survey / Mario Szegedy
 Session 1: Algorithms. An Improved Knapsack Solver for Column Generation / Klaus Jansen, Stefan Kraft
 QuickHeapsort: Modifications and Improved Analysis / Volker Diekert, Armin Weiß
 Alphabetic Minimax Trees in Linear Time / Paweł Gawrychowski
 Invited Lecture 1. Decidability and Enumeration for Automatic Sequences: A Survey / Jeffrey Shallit
 Session 2: Automata. Walking on Data Words / Amaldev Manuel, Anca Muscholl, Gabriele Puppis
 Careful Synchronization of Partial Automata with Restricted Alphabets / Pavel V. Martyugin
 Random Generation of Deterministic Acyclic Automata Using the Recursive Method / Sven De Felice, Cyril Nicaud
 Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height / Viliam Geffert, Zuzana Bednárová, Carlo Mereghetti, Beatrice Palano.
 Invited Lecture 2. A Short Tutorial on OrderInvariant FirstOrder Logic / Nicole Schweikardt
 Session 3: Logic, Proof Complexity. Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams / Luke Friedman, Yixin Xu
 Parameterized Resolution with Bounded Conjunction / Stefan Dantchev, Barnaby Martin
 Lower and Upper Bounds for the Length of Joins in the Lambek Calculus / Alexey Sorokin
 Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP / Dmitry Itsykson, Vsevolod Oparin
 Invited Lecture 3. Towards NEXP versus BPP? / Ryan Williams
 Session 4: Complexity 1. Information Lower Bounds via Selfreducibility / Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein
 On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles / Anton Makhlin.
 Improving on Gutfreund, Shaltiel, and TaShma's Paper "If NP Languages Are Hard on the WorstCase, Then It Is Easy to Find Their Hard Instances" / Nikolay Vereshchagin
 Amortized Communication Complexity of an Equality Predicate / Vladimir Nikishkin
 Invited Lecture 4. On Coloring of Sparse Graphs / Alexandr Kostochka, Matthew Yancey
 Session 5: Words and Languages. On Recognizing Words That Are Squares for the Shuffle Product / Romeo Rizzi, Stéphane Vialette
 Cyclic Shift on PrefixFree Languages / Jozef Jirásek, Galina Jirásková
 Weak Abelian Periodicity of Infinite Words / Sergey Avgustinovich, Svetlana Puzynina
 Universality of Regular Realizability Problems / Mikhail N. Vyalyi
 Invited Lecture 5. Potential Functions in Strategic Games / Paul G. Spirakis, Panagiota N. Panagopoulou
 Session 6: Algorithms 2. The Probabilistic Min Dominating Set Problem / Nicolas Boria, Cécile Murat, Vangelis Th. Paschos.
 Dichotomy of the HQuasiCover Problem / Jiří. Fiala, Marek Tesař
 QCSP on Partially Reflexive Cycles  The Wavy Line of Tractability / Florent Madelaine, Barnaby Martin
 Quantum Alternation / Abuzer Yakaryılmaz
 Invited Lecture 6. Real Numbers, Chaos, and the Principle of a Bounded Density of Information / Gilles Dowek
 Session 7: Complexity 2. Random Selection in Few Rounds / Timofey Stepanov
 OneCounter Verifiers for Decidable Languages / Abuzer Yakaryılmaz
 More on the Complexity of QuantifierFree FixedSize BitVector Logics with Binary Encoding / Andreas Fröhlich, Gergely Kovásznai, Armin Biere
 Invited Lecture 7. Composition with Algebra at the Background / Thomas Colcombet
 Session 8: Logic, Automata. ModelChecking Bounded MultiPushdown Systems / Kshitij Bansal, Stéphane Demri
 Multiweighted Automata and MSO Logic / Manfred Droste, Vitaly Perevoshchikov
 Overlapping Tile Automata / David Janin.
(source: Nielsen Book Data)
 International Conference on Harmony Search Algorithm (2nd : 2015 : Seoul, Korea)
 Heidelberg : Springer, [2015]
 Description
 Book — 1 online resource (xi, 470 pages) : illustrations
 Summary

 Part I Various Aspects of Optimization Algorithms
 Part II Large scale applications of HSA
 Part III Recent Variants of HSA
 Part IV Other Natureinspired Algorithms
 Part V Related Areas and Computational Intelligence
 Part VI Optimization in Civil Engineering
 Part VII Multiobjectives variants of HSA.
This volume, the proceedings of the 2nd International Conference on Harmony Search Algorithm 2015 (ICHSA 2015), brings together contributions describing the latest developments in the field of soft computing with a special focus on HSA techniques.
Includes coverage of new methods that have potentially immense application in various fields.
Contributed articles cover aspects of the following topics related to the Harmony Search Algorithm: analytical studies; improved, hybrid and multiobjective variants; parameter tuning; and largescale applications.
The book also contains papers discussing recent advances on the following topics: genetic algorithms; evolutionary strategies; the firefly algorithm and cuckoo search; particle swarm optimization and ant colony optimization; simulated annealing; and local search techniques.
This book offers a valuable snapshot of the current status of the Harmony Search Algorithm and related techniques, and will be a useful reference for practising researchers and advanced students in computer science and engineering.
 AAIM (Conference) (10th : 2014 : Vancouver, B.C.)
 Cham : Springer, 2014.
 Description
 Book — 1 online resource (xvi, 342 pages) : illustrations Digital: text file; PDF.
 Summary

 Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme. On the Exact Block Cover Problem. Minimax Regret ksink Location Problem in Dynamic Path Network. Competitive Algorithms for Unbounded OneWay Trading. The Complexity of Degree Anonymization by Vertex Addition. Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints. EdgeClique Covers of the Tensor Product. Protein Name Recognition Based on Dictionary Mining and Heuristics. A Facility Coloring Problem in 1D. Approximation Algorithms for Packing ElementDisjoint Steiner Trees on Bounded Terminal Nodes. The Garden Hose Complexity for the Equality Function. Finding Robust Minimum Cuts. A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Surveillance Case. Multiple Sink Location Problems in Dynamic Path Networks. Narrowing the Complexity Gap for Colouring (Cs, Pt)Free Graphs. New Lower Bounds on Broadcast Function. Efficient Memoization for Approximate Function Evaluation over Sequence Arguments. Partially Dynamic SingleSource Shortest Paths on Digraphs with Positive Weights. Obtaining Split Graphs by Edge Contraction. Parameterized Complexity of Connected Induced Subgraph Problems. Semionline Hierarchical Load Balancing Problem with Bounded Processing Times. Restricted Bipartite Graphs: Comparison and Hardness Results. The Research on Controlling the Iteration of QuantumInspired Evolutionary Algorithms for Artificial Neural Networks. On P3Convexity of Graphs with Bounded Degree. The Competitive Diffusion Game in Classes of Graphs. A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler. Clustering Performance of 3Dimensional Hilbert Curves. Broadcast Networks with Near Optimal Cost. An Optimal Context for Information Retrieval. An AuctionBargaining Model for Initial Emission Permits.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 UC (Conference) (7th : 2008 : Vienna, Austria)
 Berlin ; New York, NY : Springer, ©2008.
 Description
 Book — 1 online resource (x, 257 pages) : illustrations
 Summary

 Invited Papers
 Quantum Experiments Can Test Mathematical Undecidability
 Computational Challenges and Opportunities in the Design of Unconventional Machines from Nucleic Acids
 Predictions for the Future of Optimisation Research
 Immune Systems and Computation: An Interdisciplinary Adventure
 Regular Contributions
 Distributed Learning of Wardrop Equilibria
 Oracles and Advice as Measurements
 From Gene Regulation to Stochastic Fusion
 A Biologically Inspired Model with Fusion and Clonation of Membranes
 Computing OmegaLimit Sets in Linear Dynamical Systems
 The Expressiveness of Concentration Controlled P Systems
 On Faster Integer Calculations Using Nonarithmetic Primitives
 A Framework for Designing Novel Magnetic Tiles Capable of Complex Selfassemblies
 The Role of Conceptual Structure in Designing Cellular Automata to Perform Collective Computation
 A Characterisation of NL Using Membrane Systems without Charges and Dissolution
 Quantum Wireless Sensor Networks
 On the Computational Complexity of Spiking Neural P Systems
 Selfassembly of Decidable Sets
 Ultrafilter and Nonstandard Turing Machines
 Parallel Optimization of a Reversible (Quantum) RippleCarry Adder
 Automata on Multisets of Communicating Objects.
(source: Nielsen Book Data)
 Liu, Yukun.
 Beijing : Springer, [2011]
 Description
 Book — 1 online resource (xx, 368 pages) : illustrations
 Summary

 Background and How to Start
 Editors
 Main Services of the UNIX Kernel
 UNIX Shells
 Internet and Computer Networking via UNIX.
 International Workshop on Cyberspace Safety and Security (4th : 2012 : Melbourne, Vic.)
 Berlin ; New York : Springer, ©2012.
 Description
 Book — 1 online resource (xiv, 510 pages) : illustrations
 Summary

 CSS 2012 Regular Papers
 Session 1: Mobile Security
 MIdentity and Its Authentication Protocol for Secure Mobile Commerce Applications / Fengling Han, Ron van Schyndel
 SafeCode  Safeguarding Security and Privacy of User Data on Stolen iOS Devices / Avinash Srinivasan, Jie Wu
 Protection Aspects of Iconic Passwords on Mobile Devices / Alexandre Braga, Rafael Cividanes, Ismael Ávila, Claudia Tambascia
 Detecting Control Flow in Smartphones: Combining Static and Dynamic Analyses / Mariem Graa, Nora CuppensBoulahia, Frédéric Cuppens, Ana Cavalli
 Session 2: Cyberspace Attacks and Defense
 A Multitier Ensemble Construction of Classifiers for Phishing Email Detection and Filtering / Jemal Abawajy, Andrei Kelarev
 ChatteringFree Terminal SlidingMode Observer for Anomaly Detection / Yong Feng, Bo Wang, Fengling Han, Xinghuo Yu, Zahir Tari
 Detecting Illicit Drugs on Social Media Using Automated Social Media Intelligence Analysis (ASMIA) / Paul A. Watters, Nigel Phair.
 Improving Content Availability in the I2P Anonymous FileSharing Environment / Juan Pablo Timpanaro, Isabelle Chrisment, Olivier Festor
 Session 3: Security Applications and Systems
 V2GPriv: VehicletoGrid Privacy in the Smart Grid / Mark Stegelmann, Dogan Kesdogan
 A Secure Architecture for Smart Meter Systems / Daniel Angermeier, Konstantin Böttinger, Andreas Ibing, Dieter Schuster
 A Novel IdentityBased Key Management and Encryption Scheme for Distributed System / Geng Yang, Qiang Zhou, Xiaolong Xu, Jian Xu, Chunming Rong
 An Anomaly Based Approach for HID Attack Detection Using Keystroke Dynamics / Ferdous A. Barbhuiya, Tonmoy Saikia, Sukumar Nandi
 Robust Authentication of Public Access Points Using Digital Certificates  A Novel Approach / Avinash Srinivasan, Lashidhar Chennupati
 Session 4: Network and Cloud Security
 A General Transformation from KPABE to Searchable Encryption / Han Fei, Qin Jing, Zhao Huawei, Hu Jiankun.
 Supporting Security and Consistency for Cloud Database / Luca Ferretti, Michele Colajanni, Mirco Marchetti
 Proxy Reencryption in a PrivacyPreserving Cloud Computing DRM Scheme / Ronald Petrlic
 Collaborative Behavior Visualization and Its Detection by Observing Darknet Traffic / Satoru Akimoto, Yoshiaki Hori, Kouichi Sakurai
 SSH  Somewhat Secure Host / Craig Valli
 Session 5: Security Models
 Physical Access Control Administration Using Building Information Models / Nimalaprakasan Skandhakumar, Farzad Salim, Jason Reid, Ed Dawson
 Multiple Factors Based Evaluation of Fingerprint Images Quality / Yongming Yang, Zulong Zhang, Fengling Han, Kunming Lin
 A LeakageResilient Zero Knowledge Proof for Lattice Problem / Yang Liu, Hongda Li, Qihua Niu
 MDSE@R: ModelDriven Security Engineering at Runtime / Mohamed Almorsy, John Grundy, Amani S. Ibrahim
 Session 6: Wireless Security.
 A Hash Chains Based Key Management Scheme for Wireless Sensor Networks / Huawei Zhao, Jing Qin, Minglei Shu, Jiankun Hu
 An EventBased Packet Dropping Detection Scheme for Wireless Mesh Networks / Anderson Morais, Ana Cavalli
 A StateAware RFID Privacy Model with Reader Corruption / Kaleb Lee, Juan Gonzalez Nieto, Colin Boyd
 An Improved Anticollision Algorithm for ISO15693 RFID Systems / Leyi Shi, Xiaorui Wang, Wenjing Fu, Xin Liu, Zhen Qin
 Session 7: Security Protocols
 NearOptimal CollusionSecure Fingerprinting Codes for Efficiently Tracing Illegal Redistribution / XinWen Wu, Alan WeeChung Liew
 A ForwardSecure CertificateBased Signature Scheme in the Standard Model / Jiguo Li, Yichen Zhang, Huiyun Teng
 PolicyBased Vulnerability Assessment for Virtual Organisations / Jan Muhammad, Thomas Doherty, Sardar Hussain, Richard Sinnott
 ConstantCiphertextSize Dual Policy Attribute Based Encryption / Atsuko Miyaji, Phuong V.X. Tran.
 Session 8: Industry Track: Future of Cyberspace Security and Safety
 Sophisticated Phishers Make More Spelling Mistakes: Using URL Similarity against Phishing / MaxEmanuel Maurer, Lukas Höfer
 Secure Mobility Management Based on Session Key Agreements / Younchan Jung, Enrique Festijo
 Taxonomy and Proposed Architecture of Intrusion Detection and Prevention Systems for Cloud Computing / Ahmed Patel, Mona Taghavi, Kaveh Bakhtiyari, Joaquim Celestino Júnior
 Portability Evaluation of Cryptographic Libraries on Android Smartphones / Alexandre M. Braga, Erick N. Nascimento
 Secure Middleware Patterns / Eduardo B. Fernandez, Anton V. Uzunov
 Intrusion Detection Using DisagreementBased Semisupervised Learning: Detection Enhancement and False Alarm Reduction / Yuxin Meng, Lamfor Kwok
 Towards Effective Algorithms for Intelligent Defense Systems / Michael N. Johnstone, Andrew Woodward.
 CSS 2012 Regular Papers
 Session 1: Mobile Security
 Identity and Its Authentication Protocol for Secure Mobile Commerce Applications
 SafeCode
 Safeguarding Security and Privacy of User Data on Stolen iOS Devices
 Protection Aspects of Iconic Passwords on Mobile Devices
 Detecting Control Flow inSmartphoness: Combining Static and Dynamic Analyses
 Session 2: Cyberspace Attacks and Defense
 A Multitier Ensemble Construction of Classifiers for Phishing Email Detection and Filtering
 ChatteringFree Terminal SlidingMode Observer for Anomaly Detection
 Detecting Illicit Drugs on Social Media Using Automated Social Media Intelligence Analysis (ASMIA)
 Improving Content Availability in the I2P Anonymous FileSharing Environment
 Session 3: Security Applications and Systems
 V2GPriv: VehicletoGrid Privacy in the Smart Grid
 A Secure Architecture for Smart Meter Systems
 A Novel IdentityBased Key Management and Encryption Scheme for Distributed System
 An Anomaly Based Approach for HID Attack Detection Using Keystroke Dynamics
 Robust Authentication of Public Access Points Using Digital Certificates
 A Novel Approach
 Session 4: Network and Cloud Security
 General Transformation from KPABE to Searchable Encryption
 Supporting Security and Consistency for Cloud Database
 Proxy Reencryption in a PrivacyPreserving Cloud Computing DRM Scheme
 Collaborative Behavior Visualization and Its Detection by Observing Darknet Traffic
 SSH
 Somewhat Secure Host
 Session 5: Security Models
 Physical Access Control Administration Using Building Information Models
 Multiple Factors Based Evaluation of Fingerprint Images Quality
 A LeakageResilient Zero Knowledge Proof for Lattice Problem
 MDSE@R: ModelDriven Security Engineering at Runtime
 Session 6: Wireless Security
 A Hash Chains Based Key Management Scheme for Wireless Sensor Networks
 An EventBased Packet Dropping Detection Scheme for Wireless Mesh Networks
 A StateAware RFID Privacy Model with Reader Corruption
 An Improved Anticollision Algorithm for ISO15693 RFID Systems
 Session 7: Security Protocols
 NearOptimal CollusionSecure Fingerprinting Codes for Efficiently Tracing Illegal Redistribution
 A ForwardSecure CertificateBased Signature Scheme in the Standard Model
 PolicyBased Vulnerability Assessment for Virtual Organisations
 ConstantCiphertextSize Dual Policy Attribute Based Encryption
 Session 8: Industry Track: Future of Cyberspace Security and Safety
 Sophisticated Phishers Make More Spelling Mistakes: Using URL Similarity against Phishing
 Secure Mobility Management Based on Session Key Agreements
 Taxonomy and Proposed Architecture of Intrusion Detection and Prevention Systems for Cloud Computing
 Portability Evaluation of Cryptographic Libraries on Android Smartphones
 Secure Middleware Patterns
 Intrusion Detection Using DisagreementBased Semisupervised Learning: Detection Enhancement and False Alarm Reduction
 Towards Effective Algorithms for Intelligent Defense Systems.
(source: Nielsen Book Data)
 CMC (Conference : Membrane computing) (15th : 2014 : Prague, Czech Republic)
 Cham : Springer, [2014]
 Description
 Book — 1 online resource (xix, 397 pages) : illustrations
 Summary

 From P Colonies to 2D P Colonies and Simulations of Multiagent Systems
 A Bioinspired Computing Approach to Model Complex Systems
 P Systems with Active Membranes Working in Sublinear Space
 Membrane Computing Inspired Approach for Executing Scientific Workflow in the Cloud
 P Systems with AntiMatter
 Priorities, Promoters and Inhibitors in Deterministic Noncooperative P Systems
 P Systems with Toxic Objects
 Promoters and Inhibitors in Purely Catalytic P Systems
 RedGreen P Automata
 Extended Simulation and Verification Platform for Kernel P Systems
 The Abilities of P Colony Based Models in Robot Control
 Probabilistic Guarded P Systems, a New Formal Modelling Framework
 Solving the STConnectivity Problem with Pure Membrane Computing Techniques
 Simulating Turing Machines with Polarizationless P Systems with Active Membranes
 Categorised Counting Mediated by Blotting Membrane Systems for ParticleBased Data Mining and Numerical Algorithms
 Polymorphic P Systems with Noncooperative Rules and No Ingredients
 Spiking Neural P Systems with Astrocytes Using the Rules in the Exhaustive Mode
 Simulating Elementary Active Membranes with an Application to the P Conjecture
 Small Universal Spiking Neural P Systems with Cooperating Rules as Function Computing Devices
 Spiking Neural P Systems with Cooperating Rules
 Parallel Thinning with Complex Objects and Actors
 Causal Nets for Geometrical GandyPaunRozenberg Machines
 P System Computational Model as Framework for Hybrid (MembraneQuantum) Computations
 Fault Diagnosis Models for Electric Locomotive Systems Based on Fuzzy Reasoning Spiking Neural P Systems.
 WABI (Workshop) (14th : 2014 : Wrocław, Poland)
 Heidelberg : Springer, 2014.
 Description
 Book — 1 online resource (xiv, 369 pages) : illustrations Digital: text file; PDF.
 Summary

 Sequence and genome analysis. Phylogeny reconstruction. Networks. Mass spectrometry data analysis.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.