Refine Results
Sort By
From
To
Page 3
Page 3
Knowledge Sharing in the Integrated Enterprise : Interoperability Strategies for the Enterprise Architect
The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing.
Knowledge Processing with Interval and Soft Computing
In particular, these chapters cover computing techniques for interval linear systems of equations, interval matrix singular-value decomposition, interval function approximation, and decision making with statistical and graph-based data processing. To enable these applications, the book presents a standards-based object-oriented interval computing environment in C++.
Knowledge graphs and big data processing
This book is part of the LAMBDA Project (Learning, Applying, Multiplying Big Data Analytics), funded by the European Union, GA No. 809965. Data Analytics involves applying algorithmic processes to derive insights.
Journal on Data Semantics X
Web semantics and semi-structured data , Semantic caching , Data warehousing and semantic data mining , Spatial, temporal, multimedia and multimodal semantics , Semantics in data visualization , Semantic services for mobile users , Supporting tools , Applications of semantic-driven approaches These topics are to be understood as specifically related to semantic issues. Contributions submitted to the journal and dealing with semantics of data will be considered even if they are not from the topics in the list. While the physical appearance of the journal issues is like the books from the we- known Springer LNCS series, the mode of operation is that of a journal. Contributions can be freely submitted by authors and are reviewed by the Editorial Board.
JavaScript data structures and algorithms : An Introduction to understanding and implementing core data structure and algorithm fundamentals
Combines clear explanations of data structure and algorithm theory with practical code samples, examples and exercises, all specifically relevant to JavaScript Provides background information on object-oriented programming and native JavaScript concepts to help understand how everything fits together Illustrates how these theoretical computer science concepts ties back to practical applications in software engineering
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
Comprehensive mathematics for computer scientists 2 : Calculus and ODEs, splines, probability, fourier and wavelet theory, fractals and neural networks, categories and lambda calculus
This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the ?rst volume in two - gards: Part III ?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Complex Analysis with Applications to Number Theory
The book discusses major topics in complex analysis with applications to number theory.It 's including the theory of several finitely and infinitely complex variables, hyperbolic geometry, two- and three-manifolds, and number theory. In addition to solved examples and problems, the book covers most topics of current interest, such as Cauchy theorems, Picard’s theorems, Riemann–Zeta function, Dirichlet theorem, Gamma function, and harmonic functions.
Chaos and fractals : New frontiers of science
Covers the central ideas and concepts of chaos and fractals as well as many related topics including: the Mandelbrot set, Julia sets, cellular automata, L-systems, percolation and strange attractors.
Categories for software engineering
This book provides a gentle, software engineering oriented introduction to category theory. Assuming only a minimum of mathematical preparation, this book explores the use of categorical constructions from the point of view of the methods and techniques that have been proposed for the engineering of complex software systems: object-oriented development, software architectures, logical and algebraic specification techniques, models of concurrency, inter alia. After two parts in which basic and more advanced categorical concepts and techniques are introduced, the book illustrates their application to the semantics of CommUnity – a language for the architectural design of interactive systems. "For computer scientists, this unique book presents Category Theory in a manner tailored to their interests and with examples to which they can relate." Ira Forman, IBM "This book applies little-known yet quite powerful formal tools from category theory to software structures: designs, architectures, patterns, and styles. Rather than focus on issues at the level of computational models and semantics, it instead applies these tools to some of the problems facing the sophisticated software architect.
Boundary value problems, Weyl Functions, and differential operators
This book presents a comprehensive survey of modern operator techniques for boundary value problems and spectral theory, employing abstract boundary mappings and Weyl functions.
Botnet Detection : Countering the Largest Security Threat
Botnet Detection: Countering the Largest Security Threat, a contributed volume by world-class leaders in this field, is based on the June 2006 ARO workshop on Botnets. This edited volume represents the state-of-the-art in research on Botnets. It provides botnet detection techniques and response strategies, as well as the latest results from leading academic, industry and government researchers.
Bioinformatics
In this textbook present mathematical models in bioinformatics and they describe the biological problems that inspire the computer science tools used to handle the enormous data sets involved. The first part of the book covers the mathematical and computational methods, while the practical applications are presented in the second part. The mathematical presentation is descriptive and avoids unnecessary formalism, and yet remains clear and precise. Emphasis is laid on motivation through biological problems and cross applications. Each of the four chapters in the first part is accompanied by exercises and problems to support an understanding of the techniques presented. Each of the six chapters of the second part is devoted to some specific application domain: sequence alignment, molecular phylogenetics and coalescence theory, genomics, proteomics, RNA, and DNA microarrays. Each chapter concludes with a problems and projects section, to deepen the reader's understanding and to allow for the design of derived methods. Many of the projects involve publicly available software and/or Web-based bioinformatics depositories. Finally, the book closes with a thorough bibliography, reaching from classic research results to very recent findings, providing many pointers for future research.Overall, this volume is ideally suited for a senior undergraduate or graduate course on bioinformatics, with a strong focus on its mathematical and computer science background.
Big Data Intelligence for Smart Applications
Presents the latest discoveries in the field of machine intelligence and big data Proposes many case studies and applications of computational and Big data Combines theory and practice so that readers of the few books (beginners or experts)
Best practices in software measurement : How to use metrics to improve project and process performance
Not everything that counts can be counted. Not everything that is counted counts. Albert Einstein This is a book about software measurement from the practitioner’s point of view and it is a book for practitioners. Software measurement needs a lot of practical guidance to build upon experiences and to avoid repeating errors. This book t- gets exactly this need, namely to share experiences in a constructive way that can be followed. It tries to summarize experiences and knowledge about software measurement so that it is applicable and repeatable. It extracts experiences and lessons learned from the narrow context of the specific industrial situation, thus facilitating transfer to other contexts. Software measurement is not at a standstill. With the speed software engine- ing is evolving, software measurement has to keep pace. While the underlying theory and basic principles remain invariant in the true sense (after all, they are not specific to software engineering), the application of measurement to specific contexts and situations is continuously extended. The book thus serves as a ref- ence on these invariant principles as well as a practical guidance on how to make software measurement a success.
Beginning XSLT 2.0 : From novice to professional
This followup to Jeni Tennison's Beginning XSLT has been updated to accomodate the revised XSLT standard. Part one of this book introduces XML and XSLT at a comfortable pace, and gradually demonstrates techniques for generating HTML (plus other formats), from XML. In part two, Tennison applies theory to real-life XSLT capabilities—including generating graphics. Each chapter includes step-by-step examples (with code available online), plus review questions at the end, to help you grasp the discussed features. In fact, all of the examples and exercises revolve around an interesting common theme: making TV listings available online. This book lives up to its name, and will definitely take you from a novice to a professional, in no time!
Beginning Java Data Structures and Algorithms : Sharpen your problem solving skills by learning core computer science concepts in a pain-free manner
Teaches you tools that you can use to build efficient applications. It starts with an introduction to algorithms and big O notation, later explains bubble, merge, quicksort, and other popular programming patterns. You’ll also learn about data structures such as binary trees, hash tables, and graphs. The book progresses to advanced concepts, such as algorithm design paradigms and graph theory. By the end of the book, you will know how to correctly implement common algorithms and data structures within your applications.
