![]() |
![]() |
Your cart is empty |
||
Books > Computing & IT > General theory of computing > Data structures
This volume constitutes the refereed proceedings of the following 9 international workshops: OTM Academy, OTM Industry Case Studies Program, Cloud and Trusted Computing, C&TC, Enterprise Integration, Interoperability, and Networking, EI2N, Industrial and Business Applications of Semantic Web Technologies, INBAST, Information Systems, om Distributed Environment, ISDE, Methods, Evaluation, Tools and Applications for the Creation and Consumption of Structured Data for the e-Society, META4eS, Mobile and Social Computing for collaborative interactions, MSC, and Ontology Content, OnToContent 2014. These workshops were held as associated events at OTM 2014, the federated conferences "On The Move Towards Meaningful Internet Systems and Ubiquitous Computing", in Amantea, Italy, in October 2014. The 56 full papers presented together with 8 short papers, 6 posters and 5 keynotes were carefully reviewed and selected from a total of 96 submissions. The focus of the workshops were on the following subjects models for interoperable infrastructures, applications, privacy and access control, reliability and performance, cloud and configuration management, interoperability in (System-of-)Systems, distributed information systems applications, architecture and process in distributed information system, distributed information system development and operational environment, ontology is use for eSociety, knowledge management and applications for eSociety, social networks and social services, social and mobile intelligence, and multimodal interaction and collaboration.
This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
In the late 1960s British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells' states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. Conway's Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational, mathematical, physical and engineering aspects of The Game of Life cellular automata. Selected topics include phenomenology and statistical behaviour; space-time dynamics on Penrose tilling and hyperbolic spaces; generation of music; algebraic properties; modelling of financial markets; semi-quantum extensions; predicting emergence; dual-graph based analysis; fuzzy, limit behaviour and threshold scaling; evolving cell-state transition rules; localization dynamics in quasi-chemical analogues of GoL; self-organisation towards criticality; asynochrous implementations. The volume is unique because it gives a comprehensive presentation of the theoretical and experimental foundations, cutting-edge computation techniques and mathematical analysis of the fabulously complex, self-organized and emergent phenomena defined by incredibly simple rules.
The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.
This book constitutes the refereed proceedings of the 10th China Workshop on Machine Translation, CWMT 2014, held in Macau, China, in November 2014. The 10 revised full English papers presented were carefully reviewed and selected from 15 submissions of English papers. The papers cover the following topics: machine translation; data selection; word segmentation; entity recognition; MT evaluation.
This book constitutes the refereed proceedings of the 16 International Symposium on Stabilization, Safety and Security of Distributed Systems, SSS 2013, held in Osaka, Japan, in September/October 2014. The 21 regular papers and 8 short papers presented were carefully reviewed and selected from 44 submissions. The Symposium is organized in several tracks, reflecting topics to self-* properties. The tracks are self-stabilization; ad-hoc; sensor and mobile networks; cyberphysical systems; fault-tolerant and dependable systems; formal methods; safety and security; and cloud computing; P2P; self-organizing; and autonomous systems.
This book constitutes the refereed proceedings of the 7th International Conference on Internet and Distributed Computing Systems, IDCS 2014, held in Calabria, Italy, in September 2014. The 23 revised full and 15 revised short papers presented were carefully reviewed and selected from 50 submissions. The papers cover the following topics: ad-hoc and sensor networks; internet and Web technologies; network operations and management; multi-agent systems; cloud-based information infrastructures.
This textbook is a second edition of Evolutionary Algorithms for Solving Multi-Objective Problems, significantly expanded and adapted for the classroom. The various features of multi-objective evolutionary algorithms are presented here in an innovative and student-friendly fashion, incorporating state-of-the-art research. The book disseminates the application of evolutionary algorithm techniques to a variety of practical problems. It contains exhaustive appendices, index and bibliography and links to a complete set of teaching tutorials, exercises and solutions.
This book constitutes the refereed proceedings of the 7th International Conference on Similarity Search and Applications, SISAP 2014, held in A Coruna, Spain, in October 2014. The 21 full papers and 6 short papers presented were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on Improving Similarity Search Methods and Techniques; Indexing and Applications; Metrics and Evaluation; New Scenarios and Approaches; Applications and Specific Domains.
This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Conference on Information Security and Cryptology, Inscrypt 2013, held in Guangzhou, China, in November 2013. The 21 revised full papers presented together with 4 short papers were carefully reviewed and selected from 93 submissions. The papers cover the topics of Boolean function and block cipher, sequence and stream cipher, applications: systems and theory, computational number theory, public key cryptography, has function, side-channel and leakage, and application and system security.
This book constitutes the proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2015, which took place in London, UK, in April 2015, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 45 papers included in this volume, consisting of 27 research papers, 2 case-study papers, 7 regular tool papers and 9 tool demonstration papers, were carefully reviewed and selected from 164 submissions. In addition, the book contains one invited contribution. The papers have been organized in topical sections on hybrid systems; program analysis; verification and abstraction; tool demonstrations; stochastic models; SAT and SMT; partial order reduction, bisimulation, and fairness; competition on software verification; parameter synthesis; program synthesis; program and runtime verification; temporal logic and automata and model checking.
This book constitutes the refereed proceedings of the 20th International Conference on DNA Computing and Molecular Programming, DNA 20, held in Kyoto, Japan, in September 2014. The 10 full papers presented were carefully selected from 55 submissions. The papers are organized in many disciplines (including mathematics, computer science, physics, chemistry, material science and biology) to address the analysis, design, and synthesis of information-based molecular systems.
Thomas Feller sheds some light on trust anchor architectures for trustworthy reconfigurable systems. He is presenting novel concepts enhancing the security capabilities of reconfigurable hardware. Almost invisible to the user, many computer systems are embedded into everyday artifacts, such as cars, ATMs, and pacemakers. The significant growth of this market segment within the recent years enforced a rethinking with respect to the security properties and the trustworthiness of these systems. The trustworthiness of a system in general equates to the integrity of its system components. Hardware-based trust anchors provide measures to compare the system configuration to reference measurements. Reconfigurable architectures represent a special case in this regard, as in addition to the software implementation, the underlying hardware architecture may be exchanged, even during runtime.
Mathematical summary for Digital Signal Processing Applications with Matlab consists of Mathematics which is not usually dealt in the DSP core subject, but used in DSP applications. Matlab programs with illustrations are given for the selective topics such as generation of Multivariate Gaussian distributed sample outcomes, Bacterial foraging algorithm, Newton's iteration, Steepest descent algorithm, etc. are given exclusively in the separate chapter. Also Mathematical summary for Digital Signal Processing Applications with Matlab is written in such a way that it is suitable for Non-Mathematical readers and is very much suitable for the beginners who are doing research in Digital Signal Processing.
This book constitutes the refereed proceedings of 5 workshops of the 15th International Conference on Web-Age Information Management, WAIM 2014, held in Macau, China, June 16-18, 2014. The 38 revised full papers are organized in topical sections on the 5 following workshops: Second International Workshop on Emergency Management in Big Data Age, BigEM 2014; Second International Workshop on Big Data Management on Emerging Hardware, HardBD 2014; International Workshop on Data Management for Next-Generation Location-based Services, DaNoS 2014; International Workshop on Human Aspects of Making Recommendations in Social Ubiquitous Networking Environment, HRSUME 2014; International Workshop on Big Data Systems and Services, BIDASYS 2014.
This book constitutes the refereed proceedings of the 22st Annual European Symposium on Algorithms, ESA 2014, held in Wroclaw, Poland, in September 2014, as part of ALGO 2014. The 69 revised full papers presented were carefully reviewed and selected from 269 initial submissions: 57 out of 221 in Track A, Design and Analysis, and 12 out of 48 in Track B, Engineering and Applications. The papers present original research in the areas of design and mathematical analysis of algorithms; engineering, experimental analysis, and real-world applications of algorithms and data structures.
Production Grids in Asia: Applications, Developments and Global Ties, an edited volume, is based on ISGC (International Symposium on Grid Computing), one of the most prestigious annual events in Asia. It brings together scientists and engineers worldwide to exchange ideas, present challenges/solutions, and introduce future development in the field of Grid Computing. ISGC 2008 was held at Academia Sinica, Taipei, Taiwan in April 2008. The edited proceedings present international projects in Grid operation, Grid Middleware and e-Science applications. Leading Grid projects from Asia-Pacific are also covered. Production Grids in Asia: Applications, Developments and Global Ties is designed for a professional audience composed of industry researchers and practitioners within the Grid community. This volume is also suitable for advanced-level students in computer science.
Logic circuits are becoming increasingly susceptible to probabilistic behavior caused by external radiation and process variation. In addition, inherently probabilistic quantum- and nano-technologies are on the horizon as we approach the limits of CMOS scaling. Ensuring the reliability of such circuits despite the probabilistic behavior is a key challenge in IC design---one that necessitates a fundamental, probabilistic reformulation of synthesis and testing techniques. This monograph will present techniques for analyzing, designing, and testing logic circuits with probabilistic behavior.
The book is the first thorough overview of the first important steps to develop a worldwide virtual observatory so that, in the future, it could be easier to "dial-up" a part of the sky than wait many months to access a telescope. The articles in this book present details on the status of the first efforts to develop a standardized framework for the virtual observatory, including steps towards completion and deployment of technical infrastructure, uptake by data providers worldwide, and utilization by the scientific community.
This introduction to the Java language integrates a discussion of object-oriented programming with the design and implementation of data structures. It covers the most important topics, including algorithm analysis; time and space complexities; Java built-in data structure classes; input and output, data, and access streams; and the persistency of data.
The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.
This book constitutes the refereed proceedings of the 14th European Conference on Evolutionary Computation in Combinatorial Optimization, Evo COP 2014, held in Granada, Spain, in April 2014, co-located with the Evo*2014 events Euro GP, Evo BIO, Evo MUSART and Evo Applications. The 20 revised full papers presented were carefully reviewed and selected from 42 submissions. The papers cover the following topics: swarm intelligence algorithms, fitness landscapes and adaptive algorithms, real world and routing problems and cooperative and metaheuristic search.
This monograph summarizes what we know about summarizing, and offers a detailed analysis of professional summarizing. A computer simulation of the cognitive processes in expert summarizers is offered on the accompanying CD-ROM.
This book constitutes the refereed proceedings of the 9th Chinese Conference on Biometric Recognition, CCBR 2014, held in Shenyang, China, in November 2014. The 60 revised full papers presented were carefully reviewed and selected from among 90 submissions. The papers focus on face, fingerprint and palmprint, vein biometrics, iris and ocular biometrics, behavioral biometrics, application and system of biometrics, multi-biometrics and information fusion, other biometric recognition and processing.
This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Groebner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques. |
![]() ![]() You may like...
Family Business Case Studies Across the…
Jeremy Cheng, Luis Diaz-Matajira, …
Hardcover
R2,917
Discovery Miles 29 170
Biophilic Connections and Environmental…
Richard Coles, Sandra Costa
Paperback
R1,160
Discovery Miles 11 600
|