Refinement is one of the cornerstones of the formal approach to software engineering, and its use in various domains has led to research on new applications and generalisation. This book brings together this important research in one volume, with the addition of examples drawn from different application areas. It covers four main themes: Data refinement and its application to Z Generalisations of refinement that change the interface and atomicity of operations Refinement in Object-Z Modelling state and behaviour by combining Object-Z with CSP Refinement in Z and Object-Z: Foundations and Advanced Applications provides an invaluable overview of recent research for academic and industrial researchers, lecturers teaching formal specification and development, industrial practitioners using formal methods in their work, and postgraduate and advanced undergraduate students. This second edition is a comprehensive update to the first and includes the following new material: Early chapters have been extended to also include trace refinement, based directly on partial relations rather than through totalisation Provides an updated discussion on divergence, non-atomic refinements and approximate refinement Includes a discussion of the differing semantics of operations and outputs and how they affect the abstraction of models written using Object-Z and CSP Presents a fuller account of the relationship between relational refinement and various models of refinement in CSP Bibliographic notes at the end of each chapter have been extended with the most up to date citations and research

A fundamental understanding of algorithmic bioprocesses is key to learning how information processing occurs in nature at the cell level. The field is concerned with the interactions between computer science on the one hand and biology, chemistry, and DNA-oriented nanoscience on the other. In particular, this book offers a comprehensive overview of research into algorithmic self-assembly, RNA folding, the algorithmic foundations for biochemical reactions, and the algorithmic nature of developmental processes.

The editors of the book invited 36 chapters, written by the leading researchers in this area, and their contributions include detailed tutorials on the main topics, surveys of the state of the art in research, experimental results, and discussions of specific research goals. The main subjects addressed are sequence discovery, generation, and analysis; nanoconstructions and self-assembly; membrane computing; formal models and analysis; process calculi and automata; biochemical reactions; and other topics from natural computing, including molecular evolution, regulation of gene expression, light-based computing, cellular automata, realistic modelling of biological systems, and evolutionary computing.

This subject is inherently interdisciplinary, and this book will be of value to researchers in computer science and biology who study the impact of the exciting mutual interaction between our understanding of bioprocesses and our understanding of computation.

History of the Book The last three decades have witnessed an explosive development in integrated circuit fabrication technologies. The complexities of cur rent CMOS circuits are reaching beyond the 100 nanometer feature size and multi-hundred million transistors per integrated circuit. To fully exploit this technological potential, circuit designers use sophisticated Computer-Aided Design (CAD) tools. While supporting the talents of innumerable microelectronics engineers, these CAD tools have become the enabling factor responsible for the successful design and implemen tation of thousands of high performance, large scale integrated circuits. This research monograph originated from a body of doctoral disserta tion research completed by the first author at the University of Rochester from 1994 to 1999 while under the supervision of Prof. Eby G. Friedman. This research focuses on issues in the design of the clock distribution net work in large scale, high performance digital synchronous circuits and particularly, on algorithms for non-zero clock skew scheduling. During the development of this research, it has become clear that incorporating timing issues into the successful integrated circuit design process is of fundamental importance, particularly in that advanced theoretical de velopments in this area have been slow to reach the designers' desktops."

This book presents the proceedings of the 8th international Symposium "Information Fusion and Intelligent Geographic Information Systems 2017" (IF&ICIS'2017), which took place at Shanghai Maritime University, China, from May 10 to 12, 2017. The goal of the symposium was to bring together leading global experts in the field of spatial information integration and intelligent GIS (IGIS) to exchange cutting-edge research ideas and experiences, to discuss perspectives on the fast-paced development of geospatial information theory, methods and models in order to demonstrate the latest advances in IGIS and discover new ways of collaboration. The topics focus on IGIS fundamentals, models, technologies and services in maritime research, such as underwater acoustics, radiolocation, navigation, marine energy, logistics, environmental management, seafood, safety of maritime navigation and others. In addition the book discusses the integration of IGIS technologies in the emerging field of digital humanities research.

Integral equations have wide applications in various fields, including continuum mechanics, potential theory, geophysics, electricity and magnetism, kinetic theory of gases, hereditary phenomena in physics and biology, renewal theory, quantum mechanics, radiation, optimization, optimal control systems, communication theory, mathematical economics, population genetics, queueing theory, and medicine.

Computational Methods for Linear Integral Equations presents basic theoretical material that deals with numerical analysis, convergence, error estimates, and accuracy. The unique computational aspect leads the reader from theoretical and practical problems all the way through to computation with hands-on guidance for input files and the execution of computer programs.

Features:

* Offers all supporting MathematicaA(R) files related to the book via the Internet at the authors' Web sites: www.math.uno.edu/fac/pkythe.html or www.math.uno.edu/fac/ppuri.html

* Contains identification codes for problems, related methods, and computer programs that are cross-referenced throughout the book to make the connections easy to understand

* Illustrates a how-to approach to computational work in the development of algorithms, construction of input files, timing, and accuracy analysis

* Covers linear integral equations of Fredholm and Volterra types of the first and second kinds as well as associated singular integral equations, integro-differential equations, and eigenvalue problems

* Provides clear, step-by-step guidelines for solving difficult and complex computational problems

This book is an essential reference and authoritative resource for all professionals, graduate students, and researchers in mathematics, physical sciences, and engineering. Researchers interested in the numerical solution of integral equations will find its practical problem-solving style both accessible and useful for their work.

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+e)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

The topic of level sets is currently very timely and useful for creating realistic 3-D images and animations. They are powerful numerical techniques for analyzing and computing interface motion in a host of application settings. In computer vision, it has been applied to stereo and segmentation, whereas in graphics it has been applied to the postproduction process of in-painting and 3-D model construction. Osher is co-inventor of the Level Set Methods, a pioneering framework introduced jointly with James Sethian from the University of Berkeley in 1998. This methodology has been used up to now to provide solutions to a wide application range not limited to image processing, computer vision, robotics, fluid mechanics, crystallography, lithography, and computer graphics. The topic is of great interest to advanced students, professors, and R&D professionals working in the areas of graphics (post-production), video-based surveillance, visual inspection, augmented reality, document image processing, and medical image processing. These techniques are already employed to provide solutions and products in the industry (Cognitech, Siemens, Philips, Focus Imaging). An essential compilation of survey chapters from the leading researchers in the field, emphasizing the applications of the methods. This book can be suitable for a short professional course related with the processing of visual information.

Information communication technologies in human services are of increasing interest and concern to health and welfare educators, managers, and practitioners due to their useful information management and teaching capabilities. ""Information Communication Technologies for Human Services Education and Delivery: Concepts and Cases"" significantly contributes to the growing area of ICT application in education and human service delivery. Containing expert international contributions, this Premier Reference Source showcases innovative practices, addresses ethical and logistic concerns, and provides relevant theoretical frameworks and the latest empirical research findings.

xv From the Old to the New xvii Acknowledgments xxi 1 Verilog - A Tutorial Introduction 1 Getting Started 2 A Structural Description 2 Simulating the binaryToESeg Driver 4 Creating Ports For the Module 7 Creating a Testbench For a Module 8 11 Behavioral Modeling of Combinational Circuits Procedural Models 12 Rules for Synthesizing Combinational Circuits 13 14 Procedural Modeling of Clocked Sequential Circuits Modeling Finite State Machines 15 Rules for Synthesizing Sequential Systems 18 Non-Blocking Assignment ("

Memory Design Techniques for Low Energy Embedded Systems centers one of the most outstanding problems in chip design for embedded application. It guides the reader through different memory organizations and technologies and it reviews the most successful strategies for optimizing them in the power and performance plane.

The present book deals with coalition games in which expected pay-offs are only vaguely known. In fact, this idea about vagueness of expectations ap pears to be adequate to real situations in which the coalitional bargaining anticipates a proper realization of the game with a strategic behaviour of players. The vagueness being present in the expectations of profits is mod elled by means of the theory of fuzzy set and fuzzy quantities. The fuzziness of decision-making and strategic behaviour attracts the attention of mathematicians and its particular aspects are discussed in sev eral works. One can mention in this respect in particular the book "Fuzzy and Multiobjective Games for Conflict Resolution" by Ichiro Nishizaki and Masatoshi Sakawa (referred below as 43]) which has recently appeared in the series Studies in Fuzziness and Soft Computing published by Physica-Verlag in which the present book is also apperaing. That book, together with the one you carry in your hands, form in a certain sense a complementary pair. They present detailed views on two main aspects forming the core of game theory: strategic (mostly 2-person) games, and coalitional (or cooperative) games. As a pair they offer quite a wide overview of fuzzy set theoretical approaches to game theoretical models of human behaviour."

To optimally design and manage a directory service, IS architects and managers must understand current state-of-the-art products. Directory Services covers Novell's NDS eDirectory, Microsoft's Active Directory, UNIX directories and products by NEXOR, MaxWare, Siemens, Critical Path and others. Directory design fundamentals and products are woven into case studies of large enterprise deployments. Cox thoroughly explores replication, security, migration and legacy system integration and interoperability. Business issues such as how to cost justify, plan, budget and manage a directory project are also included. The book culminates in a visionary discussion of future trends and emerging directory technologies including the strategic direction of the top directory products, the impact of wireless technology on directory enabled applications and using directories to customize content delivery from the Enterprise Portal.
Directory Services is a comprehensive and practical guide that provides organizations and consultants with a roadmap used to create the directory enabled global enterprise. To provide the reader with the core knowledge required for designing directory services, the book discusses directory fundamentals including X.500, X.509 and LDAP as well as how to cost justify, plan, budget and manage a directory project
Provides critical info for design, integration, or migration for multiple messaging platforms
Covers all major directories
Provides case studies and guidelines for deployment and integration issues

There has been a common perception that computational complexity is a theory of "bad news" because its most typical results assert that various real-world and innocent-looking tasks are infeasible. In fact, "bad news" is a relative term, and, indeed, in some situations (e.g., in cryptography), we want an adversary to not be able to perform a certain task. However, a "bad news" result does not automatically become useful in such a scenario. For this to happen, its hardness features have to be quantitatively evaluated and shown to manifest extensively.
The book undertakes a quantitative analysis of some of the major results in complexity that regard either classes of problems or individual concrete problems. The size of some important classes are studied using resource-bounded topological and measure-theoretical tools. In the case of individual problems, the book studies relevant quantitative attributes such as approximation properties or the number of hard inputs at each length.
One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.
The book should appeal to graduate computer science students, and to researchers who have an interest in computer science theory and need a good understanding of computational complexity, e.g., researchers in algorithms, AI, logic, and other disciplines.
-Emphasis is on relevant quantitative attributes of important results in complexity.
-Coverage is self-contained and accessible to a wide audience.
-Large range of important topics including: derandomization techniques, non-approximability of optimization problems, average-case complexity, quantum computation, one-way functions and pseudo-random generators, resource-bounded measure and topology.

Data Access and Storage Management for Embedded Programmable Processors gives an overview of the state-of-the-art in system-level data access and storage management for embedded programmable processors. The targeted application domain covers complex embedded real-time multi-media and communication applications. Many of these applications are data-dominated in the sense that their cost related aspects, namely power consumption and footprint are heavily influenced (if not dominated) by the data access and storage aspects. The material is mainly based on research at IMEC in this area in the period 1996-2001. In order to deal with the stringent timing requirements and the data dominated characteristics of this domain, we have adopted a target architecture style that is compatible with modern embedded processors, and we have developed a systematic step-wise methodology to make the exploration and optimization of such applications feasible in a source-to-source precompilation approach.
In a first part of the book, we introduce the context and motivation, followed by a once-over-lightly view of the entire approach, illustrated on a relevant driver from the targeted application domain. In part 2, we show how source-to-source code transformations play a crucial role in the solution of the earlier mentioned data transfer and storage bottleneck in modern processor architectures for multi-media and telecommunication applications. This is especially true for embedded applications where cost issues like memory footprint and power consumption are vital. It is also shown that many of these code transformations can be defined in a platform-independent way. The resulting optimized code behaves betteron any of the modern platforms. The steps include global data-flow and loop transformations, data reuse decisions, high-level estimators and the link with parallelisation and multi-processor partitioning. In part 3 we discuss our research efforts relating to the mapping of embedded applications to specific memory organisations in embedded programmable processors. In a traditional processor-based environment, compilers perform memory optimizations assuming a fully fixed hardware target architecture with only maximal performance in mind. However, in an embedded context also cost issues and especially power consumption and memory footprint play a dominant role too. Usually the timing requirements are given and the application designer is mostly interested in the trade-off between timing characteristics of the different application tasks and their cost effects. For this purpose Pareto type trade-off curves are the most suitable vehicle to address this design problem. The steps involved here include the storage cycle budget distribution, support of modern memory architectures like SDRAMs, and cache related issues.

This book introduces a promising design for future Internet, the Smart Collaborative Identifier NETwork (SINET). By examining cutting-edge research from around the world, it is the first book to provide a comprehensive survey of SINET, including its basic theories and principles, a broad range of architectures, protocols, standards, and future research directions. For further investigation, the book also provides readers an experimental analysis of SINET to promote further, independent research. The second part of the book presents in detail key technologies in SINET such as scalable routing, efficient mapping systems, mobility management and security issues. In turn, the last part presents various implementations of SINET, assessing its merits. The authors believe SINET will greatly benefit researchers involved in designing future Internet thanks to its high degree of flexibility, security, manageability, mobility support and efficient resource utilization.

Business-to-business (B2B) integration is a buzzword which has been used a lot in recent years, with a variety of meanings. Starting with a clear technical definition of this term and its relation to topics like A2A (Application-to-Application), ASP (Application Service Provider), A2A, and B2C (Business-to-Consumer), Christoph Bussler outlines a complete and consistent B2B integration architecture based on a coherent conceptual model. He shows that B2B integration not only requires the exchange of business events between distributed trading partners across networks like the Internet, but also demands back-end application integration within business processes, and thus goes far beyond traditional approaches to enterprise application integration approaches. His detailed presentation describes how B2B integration standards like RosettaNet or SWIFT, the application integration standard J2EE Connector Architecture and basic standards like XML act together in order to enable business process integration. The book is the first of its kind that discusses B2B concepts and architectures independent of specific and short-term industrial or academic approaches and thus provides solid and long-lasting knowledge for researchers, students, and professionals interested in the field of B2B integration.  

This book is the essential guide for any student undertaking a computing/IS project, and will give you everything you need to achieve outstanding results. Undertaking a project is a key component of nearly all computing/information systems degree programmes at both undergraduate and postgraduate levels. Projects in Computing and Information Systems covers the four key aspects of project work (planning, conducting, presenting and taking the project further) in chronological fashion, and provides the reader with the skills to excel.

Formal Verification: An Essential Toolkit for Modern VLSI Design, Second Edition presents practical approaches for design and validation, with hands-on advice to help working engineers integrate these techniques into their work. Formal Verification (FV) enables a designer to directly analyze and mathematically explore the quality or other aspects of a Register Transfer Level (RTL) design without using simulations. This can reduce time spent validating designs and more quickly reach a final design for manufacturing. Building on a basic knowledge of SystemVerilog, this book demystifies FV and presents the practical applications that are bringing it into mainstream design and validation processes. New sections cover advanced techniques, and a new chapter, The Road To Formal Signoff, emphasizes techniques used when replacing simulation work with Formal Verification. After reading this book, readers will be prepared to introduce FV in their organization to effectively deploy FV techniques that increase design and validation productivity.

Research argues that e-government technologies have positive influences on politics and democracy, improving citizens' environment as well as their engagement with their government. Although much research indicates that e-government technologies have increased citizen participation, there is much more than can be developed. Politics, Democracy and E-Government: Participation and Service Delivery examines how e-government impacts politics and democracy in both developed and developing countries, discussing the participation of citizens in government service delivery. This book brings forth the idea that e-government has a direct influence on the important function of governing through participation and service delivery. Containing chapters from leading e-government scholars and practitioners from across the globe, the overall objective of this book is accomplished through its discussion on the influences of e-government on democratic institutions and processes.

Sadly enough, war, conflicts and terrorism appear to stay with us in the 21st century. But what is our outlook on new methods for preventing and ending them? Present-day hard- and software enables the development of large crisis, conflict, and conflict management databases with many variables, sometimes with automated updates, statistical analyses of a high complexity, elaborate simulation models, and even interactive uses of these databases.

In this book, these methods are presented, further developed, and applied in relation to the main issue: the resolution and prevention of intra- and international conflicts. Conflicts are a worldwide phenomenon. Therefore, internationally leading researchers from the USA, Austria, Canada, Germany, New Zealand and Switzerland have contributed.

This comprehensive, detailed reference to Mathematica provides the reader with both a working knowledge of Mathematica programming in general and a detailed knowledge of key aspects of Mathematica needed to create the fastest, shortest, and most elegant implementations possible to solve problems from the natural and physical sciences. The Guidebook gives the user a deeper understanding of Mathematica by instructive implementations, explanations, and examples from a range of disciplines at varying levels of complexity. "Programming" covers the structure of Mathematica expressions, after an overview of the syntax of Mathematica, its programming, graphic, numeric and symbolic capabilities in chapter 1. Chapter 2-6 cover hierarchical construction of all Mathematica objects out of symbolic expressions, the definition of functions, the recognition of patterns and their efficient application, program flows and program structuring, the manipulation of lists, and additional topics. An Appendix contains some general references on algorithms and applications of computer algebra, Mathematica itself and comparisons of various algebra systems. The multiplatform CD contains Mathematica 4.1 notebooks with detailed descriptions and explanations of the Mathematica commands needed in that chapter and used in applications, supplemented by a variety of mathematical, physical, and graphic examples and worked out solutions to all exercises. The Mathematica Guidebook is an indispensible resource for practitioners, researchers and professionals in mathematics, the sciences, and engineering. It will find a natural place on the bookshelf as an essential reference work.

Homeland security information systems are an important area of inquiry due to the tremendous influence information systems play on the preparation and response of government to a terrorist attack or natural disaster. ""Homeland Security Preparedness and Information Systems: Strategies for Managing Public Policy"" delves into the issues and challenges that public managers face in the adoption and implementation of information systems for homeland security. A defining collection of field advancements, this publication provides solutions for those interested in adopting additional information systems security measures in their governments.

Introduction The exponential scaling of feature sizes in semiconductor technologies has side-effects on layout optimization, related to effects such as inter connect delay, noise and crosstalk, signal integrity, parasitics effects, and power dissipation, that invalidate the assumptions that form the basis of previous design methodologies and tools. This book is intended to sample the most important, contemporary, and advanced layout opti mization problems emerging with the advent of very deep submicron technologies in semiconductor processing. We hope that it will stimulate more people to perform research that leads to advances in the design and development of more efficient, effective, and elegant algorithms and design tools. Organization of the Book The book is organized as follows. A multi-stage simulated annealing algorithm that integrates floorplanning and interconnect planning is pre sented in Chapter 1. To reduce the run time, different interconnect plan ning approaches are applied in different ranges of temperatures. Chapter 2 introduces a new design methodology - the interconnect-centric design methodology and its centerpiece, interconnect planning, which consists of physical hierarchy generation, floorplanning with interconnect planning, and interconnect architecture planning. Chapter 3 investigates a net-cut minimization based placement tool, Dragon, which integrates the state of the art partitioning and placement techniques."