%{search_type} search results

• Intro
• Preface
• Conference Organization
• Contents
• Part II
• Contents
• Part I
• Near-Optimal 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 Color-Refinement Based Hierarchy of Graphs
• References
• On the Complexity of Noncommutative Polynomial Factorization
• 1 Introduction
• 2 Variable-Disjoint Factorization Problem
• 2.1 Uniqueness of Variable-Disjoint Factorization
• 2.2 Equivalence with PIT
• 2.3 Black-Box Variable-Disjoint 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 NP-Hardness 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 B-IDUA
• 4 Polynomial Time Algorithms
• 4.1 An Algorithm for FE-IDUU
• 4.2 An Algorithm for FE-ICUU
• 4.3 An Algorithm for FE-FCWA
• 5 Equivalence Reductions
• 5.1 Reducing B-ICUU to FE-ICUU
• 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

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).
(source: Nielsen Book Data)

• Preface.- Acknowledgments.- Introduction.- I. Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite Strings.- Relating Plain and Prefix-Free Complexity.- Effective Reals.- II. Randomness of Sets.- Martin-Lof 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.- Randomness-Theoretic 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)

Computability and complexity theory are two central areas of research in theoretical computer science. This book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists from diverse fields.
(source: Nielsen Book Data)

• Instrumentation Framework.- Practical Considerations.- Techniques for Statistical Debugging.- Related Work.- Conclusion.
• (source: Nielsen Book Data)

This monograph presents a new and fundamental approach to software analysis that will provide a source of ideas and inspiration for many years to come. It constitutes a thoroughly revised and extended version of the author's PhD thesis, which was selected as the winning thesis of the 2005 ACM Doctoral Dissertation Competition. Ben Liblit did his PhD work at the University of California, Berkeley, with Alexander Aiken as thesis adviser.
(source: Nielsen Book Data)

• Design and implementation of TM systems, including their theoretical underpinnings and algorithmic foundations.- Programming language integration and verification tools.- Hardware supports.- Distributed TM systems.- Self-tuning mechanisms.- Lessons learnt from building complex TM-based applications.
• (source: Nielsen Book Data)

The advent of multi-core architectures and cloud-computing has brought parallel programming into the mainstream of software development. Unfortunately, writing scalable parallel programs using traditional lock-based synchronization primitives is well known to be a hard, time consuming and error-prone task, mastered by only a minority of specialized programmers. Building on the familiar abstraction of atomic transactions, Transactional Memory (TM) promises to free programmers from the complexity of conventional synchronization schemes, simplifying the development and verification of concurrent programs, enhancing code reliability, and boosting productivity. Over the last decade TM has been subject to intense research on a broad range of aspects including hardware and operating systems support, language integration, as well as algorithms and theoretical foundations. On the industrial side, the major players of the software and hardware markets have been up-front in the research and development of prototypal products providing support for TM systems. This has recently led to the introduction of hardware TM implementations on mainstream commercial microprocessors and to the integration of TM support for the world's leading open source compiler. In such a vast inter-disciplinary domain, the Euro-TM COST Action (IC1001) has served as a catalyzer and a bridge for the various research communities looking at disparate, yet subtly interconnected, aspects of TM. This book emerged from the idea having Euro-TM experts compile recent results in the TM area in a single and consistent volume. Contributions have been carefully selected and revised to provide a broad coverage of several fundamental issues associated with the design and implementation of TM systems, including their theoretical underpinnings and algorithmic foundations, programming language integration and verification tools, hardware supports, distributed TM systems, self-tuning mechanisms, as well as lessons learnt from building complex TM-based applications.
(source: Nielsen Book Data)

• Recognisable Languages over Monads
• Garside and quadratic normalisation: a survey
• Grammar-Based Tree Compression
• On decidability of intermediate levels of concatenation hierarchies
• Ergodic in Finite permutations of minimal complexity
• Diverse Palindromic Factorization is NP-Complete
• Factorization in Formal Languages
• Consensus Game Acceptors
• On the Size of Two-Way 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 one-sided Finite-type-Dyck 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 Context-Free and Counter Languages
• Star-Continuous Kleene Omega-Algebras
• Unary probabilistic and quantum automata on promise problems
• Generalizations of Code Languages with Marginal Errors
• Minimal Reversible Deterministic Finite Automata
• Multi-Sequential Word Relations
• The Boundary of Prefix-Free Languages
• A connected 3-state 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 k-Piecewise 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 Constant-Space Quantum Computation.

This book constitutes the proceedings of the 19th International Conference on Developments in Language Theory, DLT 2015, held in Liverpool, UK. The 31 papers presented together with 5 invited talks were carefully reviewed and selected from 54 submissions. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages, grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, codes, efficient text algorithms, symbolic dynamics, decision problems, relationships to complexity theory and logic, picture description and analysis, polyominoes and bidimensional patterns, cryptography, concurrency, cellular automata, bio-inspired computing, and quantum computing.

• Finite Automata and Regular Languages On Automatic Transitive Graphs.- Upper Bounds on Syntactic Complexity of Left and Two-Sided 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 Wedderburn-Artin 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.- Input-Driven Pushdown Automata with Limited Nondeterminism (invited paper).- How to Remove the Look-Ahead of Top-Down Tree Transducers.- Scope-Bounded Pushdown Languages.- Visibly Pushdown Transducers with Well-nested Outputs.- Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing.- Pumping Lemma and Ogden Lemma for Displacement Context-free Grammars.- Combinatorics and Algorithmics on Words Aperiodic Tilings and Entropy
• On k-Abelian Pattern Matching.- On k-Abelian Palindromic Rich and Poor Words.- Variations of The Morse{Hedlund Theorem for k-Abelian Equivalence.- Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word.- Knight Tiles: Particles and Collisions in The Realm of 4-Way Deterministic Tilings
• Eigenvalues and Transduction of Morphic Sequences.- Breadth-First 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 Hyper-Minimal 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)

This book constitutes the proceedings of the 18th International Conference on Developments in Language Theory, DLT 2014, held in Ekaterinburg, Russia, in August 2014. The 22 full papers and 5 short papers presented together with 3 invited talks were carefully reviewed and selected from 38 submissions. The papers are organized in topical subjects on Grammars, Acceptors and Transducers for Words, Trees and Graphs, Algebraic Theories of Automata, Algorithmic, Combinatorial and Algebraic Properties of Words and Languages, Variable Length Codes, Symbolic Dynamics, Cellular Automata, Polyominoes and Multidimensional Patterns, Decidability Questions, Image Manipulation and Compression, Efficient Text Algorithms, Relationships to Cryptography, Concurrency, Complexity Theory and Logic, Bio-Inspired Computing and Quantum Computing.
(source: Nielsen Book Data)

• Robot Reasoning Using First Order Bayesian Networks / Saleha Raza, Sajjad Haider
• Dempster-Shafer Theory with Smoothness / Ronald Böck, Stefan Glüge, Andreas Wendemuth
• A Probabilistic Model for Prioritizing Engineering Design Requirements in Uncertain QFD / Hong-Bin Yan, Tieju Ma
• Applying OWA Operator to Model Group Behaviors in Uncertain QFD / Hong-Bin Yan, Tieju Ma, Van-Nam 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 / Jean-Baptiste Bordes, Franck Davoine
• Generic Discounting Evaluation Approach for Urban Image Classification / Ahmed Samet, Imen Hammami, Eric Lefèvre
• Spatial Weighting for Bag-of-Features Based Image Retrieval / Chuanqian Wang, Baochang Zhang
• A Random Set and Rule-Based 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 Set-Membership Identification of MIMO LTI System / Xiaojun Wang, Chen Yang, Baochang Zhang
• An Approach for Obtaining Bargaining Set in Multi-choice Games / Tianwen Li, Feng Ma, Weiyi Liu
• An Optimized Method for Selection of the Initial Centers of K-Means 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árez-Ramírez, Rafael Pimienta-Romo
• Tacit Knowledge Formalization to Support the Adoption Process of Software Quality Models / Violeta Ocegueda-Miramontes
• 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 Rule-Based Systems / Yu-Wang Chen, Jian-Bo Yang, Dong-Ling Xu.

This book constitutes the refereed proceedings of the International Symposium on Integrated Uncertainty in Knowledge Modeling and Decision Making, IUKM 2013, held in Beijing China, in July 2013. The 19 revised full papers were carefully reviewed and selected from 49 submissions and are presented together with keynote and invited talks. The papers provide a wealth of new ideas and report both theoretical and applied research on integrated uncertainty modeling and management.

• 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 Navier-Stokes Equations.- A Symbolic-Numerical 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 Light-Cone SU(3) Yang-Mills Mechanics Via Groebner Bases.- On the Weight Spectra of Conway Matrices Related to the Non-transitive Head-or-Tail Game.- Properties of the Liapunov Stability Zones of the Lagrange Triangle.- Studying the Stability of the Second Order Non-autonomous 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 Third-Order 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 Algebraic-Numeric 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)

This book constitutes the refereed proceedings of the 10th International Workshop on Computer Algebra in Scientific Computing, CASC 2007, held in Bonn, Germany, in September 2007. The volume is dedicated to Professor Vladimir P. Gerdt on the occasion of his 60th birthday. The papers cover not only various expanding applications of computer algebra to scientific computing but also the computer algebra systems themselves and the CA algorithms.
(source: Nielsen Book Data)

• 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 Equal-Length Languages
• Aspects of Reversibility for Classical Automata
• A Weakly Universal Cellular Automaton in the Pentagrid with Five States
• Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem
• Time-Optimum Smaller-State 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 Pseudo-Telepathy 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 Name-Passing Process Calculi
• Learning from Positive Data and Negative Counterexamples
• One-Sided 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 Cyber-Physical Systems
• On the Limit of Some Algorithmic Approach to Circuit Lower Bounds
• P Systems with Anti-Matter
• A Robust Universal Flying Amorphous Computer
• Minimal Reaction Systems Defining Subset Functions
• Grand Challenges of Informatics
• Konrad Zuse's Relationship to Informatics.

Professor Jozef Gruska is a well known computer scientist for his many and broad results. He was the father of theoretical computer science research in Czechoslovakia and among the first Slovak programmers in the early 1960s. Jozef Gruska introduced the descriptional complexity of grammars, automata, and languages, and is one of the pioneers of parallel (systolic) automata. His other main research interests include parallel systems and automata, as well as quantum information processing, transmission, and cryptography. He is co-founder of four regular series of conferences in informatics and two in quantum information processing and the Founding Chair (1989-96) of the IFIP Specialist Group on Foundations of Computer Science.

• 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 e-puck 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, Task-allocation and Task-switching.- Influencing a Flock via Ad Hoc Teamwork.- MACOC: A Medoid-based ACO Clustering Algorithm.- Particle Swarm Convergence: Standardized Analysis and Topological Influence.- Scheduling a Galvanizing Line by Ant Colony Optimization.- SRoCS: Leveraging Stigmergy on a Multi-robot Construction Platform for Unknown Environments.- Swarm in a Fly Bottle: Feedback-based Analysis of Self-organizing Temporary Lock-ins.- Temporal Task Allocation in Periodic Environments.- Towards a Cognitive Design Pattern for Collective Decision-making.- Short Papers.- A Novel Competitive Quantum-behaviour Evolutionary Multi-swarm 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 Food-foraging Problem for Evolutionary Swarm Robotics Systems.- Nature-inspired Swarm Robotics Algorithms for Prioritized Foraging.- Particle Swarm Optimisation with Enhanced Memory Particles.- Sorting in Swarm Robots Using Communication-based Cluster Size Estimation.- Using Fluid Neural Networks to Create Dynamic Neighborhood Topologies in Particle Swarm Optimization.- Extended Abstracts.- A Low-cost Real-time Tracking Infrastructure for Ground-based 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 Resource-constraint Project Scheduling Problems based on ACO algorithms.
• (source: Nielsen Book Data)

This book constitutes the proceedings of the 9th International Conference on Swarm Intelligence, held in Brussels, Belgium, in September 2014. This volume contains 17 full papers, 9 short papers, and 7 extended abstracts carefully selected out of 55 submissions. The papers cover empirical and theoretical research in swarm intelligence such as: behavioral models of social insects or other animal societies, ant colony optimization, particle swarm optimization, swarm robotics systems.
(source: Nielsen Book Data)

• Vehicular Communications and Heterogeneous Networks.- Cognitive Radio and Multi-antenna Systems.- 3G Networks and Beyond.- Ad Hoc and Mesh Networks.
• (source: Nielsen Book Data)

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International ICST Conference on Wireless Internet, WICON 2013, held in Shanghai, China, in April 2012. The 20 revised full papers were carefully reviewed and selected from numerous submissions. The papers cover topics such as vehicular communications and heterogeneous networks, cognitive radio and multi-antenna systems, networks and beyond, ad hoc and mesh networks.
(source: Nielsen Book Data)

• 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, Third-Party Software
• Index.

This is a comprehensive description of the cryptographic hash function BLAKE, one of the five final contenders in the NIST SHA3 competition, and of BLAKE2, an improved version popular among developers. It describes how BLAKE was designed and why BLAKE2 was developed, and it offers guidelines on implementing and using BLAKE, with a focus on software implementation. In the first two chapters, the authors offer a short introduction to cryptographic hashing, the SHA3 competition, and BLAKE. They review applications of cryptographic hashing, they describe some basic notions such as security definitions and state-of-the-art collision search methods, and they present SHA1, SHA2, and the SHA3 finalists. In the chapters that follow, the authors give a complete description of the four instances BLAKE-256, BLAKE-512, BLAKE-224, and BLAKE-384; they describe applications of BLAKE, including simple hashing with or without a salt, and HMAC and PBKDF2 constructions; they review implementation techniques, from portable C and Python to AVR assembly and vectorized code using SIMD CPU instructions; they describe BLAKE?s properties with respect to hardware design for implementation in ASICs or FPGAs; they explain BLAKE's design rationale in detail, from NIST?s requirements to the choice of internal parameters; they summarize the known security properties of BLAKE and describe the best attacks on reduced or modified variants; and they present BLAKE2, the successor of BLAKE, starting with motivations and also covering its performance and security aspects. The book concludes with detailed test vectors, a reference portable C implementation of BLAKE, and a list of third-party software implementations of BLAKE and BLAKE2. The book is oriented towards practice? engineering and craftsmanship? rather than theory. It is suitable for developers, engineers, and security professionals engaged with BLAKE and cryptographic hashing in general, and for applied cryptography researchers and students who need a consolidated reference and a detailed description of the design process, or guidelines on how to design a cryptographic algorithm.

• 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 Order-Invariant First-Order 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 Self-reducibility / 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 Ta-Shma's Paper "If NP Languages Are Hard on the Worst-Case, 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 Prefix-Free 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 H-Quasi-Cover 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
• One-Counter Verifiers for Decidable Languages / Abuzer Yakaryılmaz
• More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector 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. Model-Checking Bounded Multi-Pushdown Systems / Kshitij Bansal, Stéphane Demri
• Multi-weighted Automata and MSO Logic / Manfred Droste, Vitaly Perevoshchikov
• Overlapping Tile Automata / David Janin.

This book constitutes the proceedings of the 8th International Computer Science Symposium in Russia, CSR 2013, held in Ekaterinburg, Russia, in June 2013. The 29 full papers presented in this volume were carefully reviewed and selected from 52 submissions. In addition the book contains 8 invited lectures. The papers are organized in topical sections on: algorithms; automata; logic and proof complexity; complexity; words and languages; and logic and automata.
(source: Nielsen Book Data)

• Part I Various Aspects of Optimization Algorithms
• Part II Large scale applications of HSA
• Part III Recent Variants of HSA
• Part IV Other Nature-inspired Algorithms
• Part V Related Areas and Computational Intelligence
• Part VI Optimization in Civil Engineering
• Part VII Multi-objectives variants of HSA.

The Harmony Search Algorithm (HSA) is one of the most well-known techniques in the field of soft computing, an important paradigm in the science and engineering community.
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 multi-objective variants; parameter tuning; and large-scale 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.

• Local Event Boundary Detection with Unreliable Sensors: Analysis of the Majority Vote Scheme.- On the Exact Block Cover Problem.- Minimax Regret k-sink Location Problem in Dynamic Path Network.- Competitive Algorithms for Unbounded One-Way Trading.- The Complexity of Degree Anonymization by Vertex Addition.- Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints.- Edge-Clique Covers of the Tensor Product.- Protein Name Recognition Based on Dictionary Mining and Heuristics.- A Facility Coloring Problem in 1-D.- Approximation Algorithms for Packing Element-Disjoint 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 Single-Source Shortest Paths on Digraphs with Positive Weights.- Obtaining Split Graphs by Edge Contraction.- Parameterized Complexity of Connected Induced Subgraph Problems.- Semi-online Hierarchical Load Balancing Problem with Bounded Processing Times.- Restricted Bipartite Graphs: Comparison and Hardness Results.- The Research on Controlling the Iteration of Quantum-Inspired Evolutionary Algorithms for Artificial Neural Networks.- On P3-Convexity 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 3-Dimensional Hilbert Curves.- Broadcast Networks with Near Optimal Cost.- An Optimal Context for Information Retrieval.- An Auction-Bargaining Model for Initial Emission Permits.
• (source: Nielsen Book Data)

This volume constitutes the proceedings of the International Conference on Algorithmic Aspects in Information and Management, AAIM 2014, held in Vancouver, BC, Canada, in July 2014. The 30 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 45 submissions. The topics cover most areas in discrete algorithms and their applications.
(source: Nielsen Book Data)

• 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 Omega-Limit Sets in Linear Dynamical Systems
• The Expressiveness of Concentration Controlled P Systems
• On Faster Integer Calculations Using Non-arithmetic Primitives
• A Framework for Designing Novel Magnetic Tiles Capable of Complex Self-assemblies
• 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
• Self-assembly of Decidable Sets
• Ultrafilter and Non-standard Turing Machines
• Parallel Optimization of a Reversible (Quantum) Ripple-Carry Adder
• Automata on Multisets of Communicating Objects.

This book constitutes the refereed proceedings of the 7th International Conference on Unconventional Computation, UC 2008, held in Vienna, Austria, in August 2008. The 16 revised full papers presented together with 4 invited papers were carefully reviewed and selected for inclusion in the book. The papers are devoted to all aspects of unconventional computation ranging from theoretical and experimental aspects to various applications. The typical topics are: natural computing including quantum, cellular, molecular, neural and evolutionary computing, chaos and dynamical system-based computing, and various proposals for computations that go beyond the Turing model.
(source: Nielsen Book Data)

• Background and How to Start
• Editors
• Main Services of the UNIX Kernel
• UNIX Shells
• Internet and Computer Networking via UNIX.

"UNIX Operating System: The Development Tutorial via UNIX Kernel Services" introduces the hierarchical structure, principles, applications, kernel, shells, development, and management of the UNIX operation systems multi-dimensionally and systematically. It clarifies the natural bond between physical UNIX implementation and general operating system and software engineering theories, and presents self-explanatory illustrations for readers to visualize and understand the obscure relationships and intangible processes in UNIX operating system. This book is intended for engineers and researchers in the field of applicable computing and engineering modeling. Yukun Liu is an Associate Professor at the Department of Computer Science and Technology, Hebei University of Science and Technology, China; Professor Yong Yue is Director of the Institute for Research of Applicable Computing and Head of the Department of Computer Science and Technology, University of Bedfordshire, UK; Professor Liwei Guo is Dean of the College of Information Science and Engineering, Hebei University of Science and Technology, China.

• CSS 2012 Regular Papers
• Session 1: Mobile Security
• M-Identity 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 Cuppens-Boulahia, Frédéric Cuppens, Ana Cavalli
• Session 2: Cyberspace Attacks and Defense
• A Multi-tier Ensemble Construction of Classifiers for Phishing Email Detection and Filtering / Jemal Abawajy, Andrei Kelarev
• Chattering-Free Terminal Sliding-Mode 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 File-Sharing Environment / Juan Pablo Timpanaro, Isabelle Chrisment, Olivier Festor
• Session 3: Security Applications and Systems
• V2GPriv: Vehicle-to-Grid 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 Identity-Based 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 KP-ABE 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 Re-encryption in a Privacy-Preserving 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 Leakage-Resilient Zero Knowledge Proof for Lattice Problem / Yang Liu, Hongda Li, Qihua Niu
• MDSE@R: Model-Driven 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 Event-Based Packet Dropping Detection Scheme for Wireless Mesh Networks / Anderson Morais, Ana Cavalli
• A State-Aware RFID Privacy Model with Reader Corruption / Kaleb Lee, Juan Gonzalez Nieto, Colin Boyd
• An Improved Anti-collision Algorithm for ISO15693 RFID Systems / Leyi Shi, Xiaorui Wang, Wenjing Fu, Xin Liu, Zhen Qin
• Session 7: Security Protocols
• Near-Optimal Collusion-Secure Fingerprinting Codes for Efficiently Tracing Illegal Re-distribution / Xin-Wen Wu, Alan Wee-Chung Liew
• A Forward-Secure Certificate-Based Signature Scheme in the Standard Model / Jiguo Li, Yichen Zhang, Huiyun Teng
• Policy-Based Vulnerability Assessment for Virtual Organisations / Jan Muhammad, Thomas Doherty, Sardar Hussain, Richard Sinnott
• Constant-Ciphertext-Size 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 / Max-Emanuel 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 Disagreement-Based Semi-supervised Learning: Detection Enhancement and False Alarm Reduction / Yuxin Meng, Lam-for 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 Multi-tier Ensemble Construction of Classifiers for Phishing Email Detection and Filtering
• Chattering-Free Terminal Sliding-Mode Observer for Anomaly Detection
• Detecting Illicit Drugs on Social Media Using Automated Social Media Intelligence Analysis (ASMIA)
• Improving Content Availability in the I2P Anonymous File-Sharing Environment
• Session 3: Security Applications and Systems
• V2GPriv: Vehicle-to-Grid Privacy in the Smart Grid
• A Secure Architecture for Smart Meter Systems
• A Novel Identity-Based 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 KP-ABE to Searchable Encryption
• Supporting Security and Consistency for Cloud Database
• Proxy Re-encryption in a Privacy-Preserving 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 Leakage-Resilient Zero Knowledge Proof for Lattice Problem
• MDSE@R: Model-Driven Security Engineering at Runtime
• Session 6: Wireless Security
• A Hash Chains Based Key Management Scheme for Wireless Sensor Networks
• An Event-Based Packet Dropping Detection Scheme for Wireless Mesh Networks
• A State-Aware RFID Privacy Model with Reader Corruption
• An Improved Anti-collision Algorithm for ISO15693 RFID Systems
• Session 7: Security Protocols
• Near-Optimal Collusion-Secure Fingerprinting Codes for Efficiently Tracing Illegal Re-distribution
• A Forward-Secure Certificate-Based Signature Scheme in the Standard Model
• Policy-Based Vulnerability Assessment for Virtual Organisations
• Constant-Ciphertext-Size 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 Disagreement-Based Semi-supervised Learning: Detection Enhancement and False Alarm Reduction
• Towards Effective Algorithms for Intelligent Defense Systems.

This book constitutes the refereed proceedings of the 4th International Symposium on Cyberspace Safety and Security (CSS 2012), held in Melbourne, Australia, in December 2012. The 30 revised full papers presented together with 7 invited talks were carefully reviewed and selected from 105 submissions. The papers cover the following topics: mobile security, cyberspace attacks and defense, security application adn systems, network and cloud security, wireless security, security protocols and models.
(source: Nielsen Book Data)

• 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 Anti-Matter
• Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems
• P Systems with Toxic Objects
• Promoters and Inhibitors in Purely Catalytic P Systems
• Red-Green 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 ST-Connectivity Problem with Pure Membrane Computing Techniques
• Simulating Turing Machines with Polarizationless P Systems with Active Membranes
• Categorised Counting Mediated by Blotting Membrane Systems for Particle-Based Data Mining and Numerical Algorithms
• Polymorphic P Systems with Non-cooperative 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 Gandy-Paun-Rozenberg Machines
• P System Computational Model as Framework for Hybrid (Membrane-Quantum) Computations
• Fault Diagnosis Models for Electric Locomotive Systems Based on Fuzzy Reasoning Spiking Neural P Systems.

This book constitutes the thoroughly refereed post-conference proceedings of the 15th International Conference on Membrane Computing, CMC 2014, held in Prague, Czech Republic, in August 2014. The 19 revised selected papers presented together with 5 invited lectures were carefully reviewed and selected from 24 papers presented at the conference. In addition, two papers selected from the 22 papers presented at the regional version of CMC, the Asian Conference on Membrane Computing, ACMC 2014, held in Coimbatore, India, are included. The papers cover a wide range of topics in the area of membrane computing, which is an area of computer science aiming to abstract computing ideas and models from the structure and the functioning of living cells, as well as from the way the cells are organized in tissues or higher order structures.

• Sequence and genome analysis.- Phylogeny reconstruction.- Networks.- Mass spectrometry data analysis.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 14th International Workshop on Algorithms in Bioinformatics, WABI 2014, held in Wroclaw, Poland, in September 2014. WABI 2014 was one of seven conferences that were organized as part of ALGO 2014. WABI is an annual conference series on all aspects of algorithms and data structure in molecular biology, genomics and phylogeny data analysis. The 26 full papers presented together with a short abstract were carefully reviewed and selected from 61 submissions. The selected papers cover a wide range of topics from sequence and genome analysis through phylogeny reconstruction and networks to mass spectrometry data analysis.
(source: Nielsen Book Data)