Concrete Mathematics: A Foundation for Computer Science (2nd Edition)

This book introduces the mathematics that supports avant-garde computer programming and the assay of algorithms. The primary aim of its acclaimed authors is to accommodate a solid and accordant abject of algebraic abilities – the abilities bare to break circuitous problems, to appraise abominable sums, and to ascertain attenuate patterns in data. It is an basal argument and advertence not alone for computer scientists – the authors themselves await heavily on it! – but for austere users of mathematics in around every discipline.
(more…)

Applied Nonlinear Programming

The solution methods to deal with such problems may be called as nonlinear programming.The present book is focussed on applied Applied Nonlinear Programming.A general introduction is provided discussing various industrial/managerial applications. Convex and concave functions are explained for single variaSble and multi-variable examples. As a special case of nonlinear programming, geometric programming is also discussed.
(more…)

Algorithms and Data Structures: The Science of Computing

The Science of Computing takes a step back to introduce and explore algorithms — the content of the code. Focusing on three core topics: design (the architecture of algorithms), theory (mathematical modeling and analysis), and the scientific method (experimental confirmation of theoretical results), the book helps students see that computer science is about problem solving, not simply the memorization and recitation of languages. Unlike many other texts, the methods of inquiry are explained in an integrated manner so students can see explicitly how they interact. Recursion and object oriented programming are emphasized as the main control structure and abstraction mechanism, respectively, in algorithm design.

Features:

(more…)

The Digital Signal Processing Handbook

This immense compilation outlines both introductory and specialized aspects of information-bearing signals in digital form, creating a resource relevant to the expanding needs of the engineering community. It also explores the use of computers and special-purpose digital hardware in extracting information or transforming signals in advantageous ways.Impacted areas presented include:
(more…)

Handbook of Time Series Analysis, Signal Processing, and Dynamics

The aim of this book is to serve as a graduate text and reference in time series analysis and signal processing, two closely related subjects that are the concern of a wide range of disciplines, such as statistics, electrical engineering, mechanical engineering and physics
(more…)

Learn Pascal

Pascal is also a precursor to programming languages such as C++, Java, and Delphi. Learn Pascal teaches the novice programmer the basics of Pascal through hands-on examples and easy-to-follow drills in each chapter, and guides readers from the basic fundamentals to advanced techniques needed to effectively program real-world applications. The book also includes advanced material on problem-solving algorithms, which provide the experienced Pascal user with specialized tools to solve specific programming problems.
(more…)

Graph Algorithms And Applications 5 (No 5)

This book contains Volume 7 of the “Journal of Graph Algorithms and Applications” (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.
(more…)

Graph Algorithms And Applications 4 (No. 4)

Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.
(more…)

Graph Algorithms And Applications 3 (No 3)

Volume 3: Edge-Coloring and f-Coloring for Various Classes of Graphs (X Zhou & T Nishizeki); Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs (T Calamoneri et al.); Subgraph Isomorphism in Planar Graphs and Related Problems (D Eppstein); Guest Editors’ Introduction (G Di Battista & P Mutzel); Drawing Clustered Graphs on an Orthogonal Grid (P Eades et al.); A Linear Algorithm for Bend-Optimal Orthogonal Drawings of Triconnected Cubic Plane Graphs (M S Rahman et al.); Bounds for Orthogonal 3-D Graph Drawing (T Biedl et al.); Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions (A Papakostas & I G Tollis) (more…)

Graph Algorithms And Applications 2 (No 2)

Volume 2: Algorithms for Cluster Busting in Anchored Graph Drawing (K A Lyons et al.); A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs (L Bai et al.); A Visibility Representation for Graphs in Three Dimensions (P Bose et al.); Scheduled Hot-Potato Routing (J Naor et al.); Treewidth and Minimum Fill-in on d-trapezoid Graphs (H L Bodlaender et al.); Memory Paging for Connectivity and Path Problems in Graphs (E Feuerstein & A Marchetti-Spaccamela); New Lower Bounds for Orthogonal Drawings (T C Biedl); Rectangle-visibility Layouts of Unions and Products of Trees (A M Dean & J P Hutchinson);
(more…)