Social insects such as ants and termites can be viewed as powerful problem-solving systems with sophisticated collective intelligence. Composed of simple interacting agents, this intelligence lies in the networks of interactions among individuals and between individuals and the environment. Social insects are also a powerful metaphor for artificial intelligence. The problems they solve - for instance, finding food, dividing labor among nestmates, building nests, and responding to external challenges - have important counterparts in engineering and computer science. This book provides a detailed look at models of social insect behaviour and how these can be applied in the design of complex systems. It draws upon a complementary blend of biology and computer science, including artificial intelligence, robotics, operations research, informationdisplay, and computer graphics. The book should appeal to a broadly interdisciplinary audience of modellers, engineers, neuroscientists, and computer scientists, as well as some biologists and ecologists.

Studying narratives is often the best way to gain a good understanding of how various aspects of human information are organized and integrated-the narrator employs specific informational methods to build the whole structure of a narrative through combining temporally constructed events in light of an array of relationships to the narratee and these methods reveal the interaction of the rational and the sensitive aspects of human information. Computational and Cognitive Approaches to Narratology discusses issues of narrative-related information and communication technologies, cognitive mechanism and analyses, and theoretical perspectives on narratives and the story generation process. Focusing on emerging research as well as applications in a variety of fields including marketing, philosophy, psychology, art, and literature, this timely publication is an essential reference source for researchers, professionals, and graduate students in various information technology, cognitive studies, design, and creative fields.

This book presents watermarking algorithms derived from signal processing methods such as wavelet transform, matrix decomposition and cosine transform to address the limitations of current technologies. For each algorithm, mathematical foundations are explained with analysis conducted to evaluate performances on robotness and efficiency. Combining theories and practice, it is suitable for information security researchers and industrial engineers.

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.

Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.

Reaction-diffusion and excitable media are amongst most intriguing substrates. Despite apparent simplicity of the physical processes involved the media exhibit a wide range of amazing patterns: from target and spiral waves to travelling localisations and stationary breathing patterns. These media are at the heart of most natural processes, including morphogenesis of living beings, geological formations, nervous and muscular activity, and socio-economic developments. This book explores a minimalist paradigm of studying reaction-diffusion and excitable media using locally-connected networks of finite-state machines: cellular automata and automata on proximity graphs. Cellular automata are marvellous objects per se because they show us how to generate and manage complexity using very simple rules of dynamical transitions. When combined with the reaction-diffusion paradigm the cellular automata become an essential user-friendly tool for modelling natural systems and designing future and emergent computing architectures. The book brings together hot topics of non-linear sciences, complexity, and future and emergent computing. It shows how to discover propagating localisation and perform computation with them in very simple two-dimensional automaton models. Paradigms, models and implementations presented in the book strengthen the theoretical foundations in the area for future and emergent computing and lay key stones towards physical embodied information processing systems.

This unique text/reference presents a fresh look at nonlinear processing through nonlinear eigenvalue analysis, highlighting how one-homogeneous convex functionals can induce nonlinear operators that can be analyzed within an eigenvalue framework. The text opens with an introduction to the mathematical background, together with a summary of classical variational algorithms for vision. This is followed by a focus on the foundations and applications of the new multi-scale representation based on non-linear eigenproblems. The book then concludes with a discussion of new numerical techniques for finding nonlinear eigenfunctions, and promising research directions beyond the convex case. Topics and features: introduces the classical Fourier transform and its associated operator and energy, and asks how these concepts can be generalized in the nonlinear case; reviews the basic mathematical notion, briefly outlining the use of variational and flow-based methods to solve image-processing and computer vision algorithms; describes the properties of the total variation (TV) functional, and how the concept of nonlinear eigenfunctions relate to convex functionals; provides a spectral framework for one-homogeneous functionals, and applies this framework for denoising, texture processing and image fusion; proposes novel ways to solve the nonlinear eigenvalue problem using special flows that converge to eigenfunctions; examines graph-based and nonlocal methods, for which a TV eigenvalue analysis gives rise to strong segmentation, clustering and classification algorithms; presents an approach to generalizing the nonlinear spectral concept beyond the convex case, based on pixel decay analysis; discusses relations to other branches of image processing, such as wavelets and dictionary based methods. This original work offers fascinating new insights into established signal processing techniques, integrating deep mathematical concepts from a range of different fields, which will be of great interest to all researchers involved with image processing and computer vision applications, as well as computations for more general scientific problems.

"Discrete-Time Linear Systems: Theory and Design with Applications "combines system theory and design in order to show the importance of system theory and its role in system design. The book focuses on system theory (including optimal state feedback and optimal state estimation) and system design (with applications to feedback control systems and wireless transceivers, plus system identification and channel estimation).

Towards Solid-State Quantum Repeaters: Ultrafast, Coherent Optical Control and Spin-Photon Entanglement in Charged InAs Quantum Dots summarizes several state-of-the-art coherent spin manipulation experiments in III-V quantum dots. Both high-fidelity optical manipulation, decoherence due to nuclear spins and the spin coherence extraction are discussed, as is the generation of entanglement between a single spin qubit and a photonic qubit. The experimental results are analyzed and discussed in the context of future quantum technologies, such as quantum repeaters. Single spins in optically active semiconductor host materials have emerged as leading candidates for quantum information processing (QIP). The quantum nature of the spin allows for encoding of stationary, memory quantum bits (qubits), and the relatively weak interaction with the host material preserves the spin coherence. On the other hand, optically active host materials permit direct interfacing with light, which can be used for all-optical qubit manipulation, and for efficiently mapping matter qubits into photonic qubits that are suited for long-distance quantum communication.

This volume of LNCSE is a collection of the papers from the proceedings of the third workshop on sparse grids and applications. Sparse grids are a popular approach for the numerical treatment of high-dimensional problems. Where classical numerical discretization schemes fail in more than three or four dimensions, sparse grids, in their different guises, are frequently the method of choice, be it spatially adaptive in the hierarchical basis or via the dimensionally adaptive combination technique. Demonstrating once again the importance of this numerical discretization scheme, the selected articles present recent advances on the numerical analysis of sparse grids as well as efficient data structures. The book also discusses a range of applications, including uncertainty quantification and plasma physics.

Computer-Aided Innovation (CAI) is emerging as a strategic domain of research and application to support enterprises throughout the overall innovation process. The 5.4 Working Group of IFIP aims at defining the scientific foundation of Computer Aided Innovation systems and at identifying state of the art and trends of CAI tools and methods. These Proceedings derive from the second Topical Session on Computer- Aided Innovation organized within the 20th World Computer Congress of IFIP. The goal of the Topical Session is to provide a survey of existing technologies and research activities in the field and to identify opportunities of integration of CAI with other PLM systems. According to the heterogeneous needs of innovation-related activities, the papers published in this volume are characterized by multidisciplinary contents and complementary perspectives and scopes. Such a richness of topics and disciplines will certainly contribute to the promotion of fruitful new collaborations and synergies within the IFIP community. Gaetano Cascini th Florence, April 30 20 08 CAI Topical Session Organization The IFIP Topical Session on Computer-Aided Innovation (CAI) is a co-located conference organized under the auspices of the IFIP World Computer Congress (WCC) 2008 in Milano, Italy Gaetano Cascini CAI Program Committee Chair [email protected]

Meshfree methods are a modern alternative to classical mesh-based discretization techniques such as finite differences or finite element methods. Especially in a time-dependent setting or in the treatment of problems with strongly singular solutions their independence of a mesh makes these methods highly attractive. This volume collects selected papers presented at the Sixth International Workshop on Meshfree Methods held in Bonn, Germany in October 2011. They address various aspects of this very active research field and cover topics from applied mathematics, physics and engineering.

For half a century at least, I.T. teams have focused on solving business problems through computer technology - and largely ignoring the human element in their interactions with end users. In his new book I.T. IN CRISIS: A NEW BUSINESS MODEL, consultant L. Paul Ouellette shows how to bring the I.T. team into the twenty-first century. Organizations that employ I.T. professionals are facing a new economic landscape - one where closer, more engaged relationships with internal and external customers are not merely nice if you can get it, but essential for organizational survival. I.T.'s old business as usual approach - and let the relationship thing take care of itself - is, Ouellette warns, now a recipe for disaster. I.T.'s challenge is to adapt to the customer-focused operational realities of the twenty-first century. Teams that meet this challenge will thrive, and will create extraordinary opportunities for themselves and their organizations. Teams that don't, Ouellette believes, will be marginalized or phased out. How do we make this (long-overdue) transition? By upgrading the I.T. Professional's skill sets - and moving from the back room to the forefront of the business, the place where person-to-person connections with customers as human beings take place. In I.T. IN CRISIS: A NEW BUSINESS MODEL, Ouellette offers proven, real-world strategies for I.T. teams to forge closer bonds with their end users. He shows I.T. professionals how to change the way their customers think about I.T., how to improve I.T.'s standing within their own organizations, and how to enhance their own careers -Paul offers the 1 tool to turn negative relations into a positive one. Methods for successfully conducting the 3 main points of your clients' interactions, learn what clients really want from I.T. and the 5 steps to building your sustainable service strategy. Building very specific empathy, listening skills, rapport-building, and overall relationship management capacities. Ouellette also includes the case studies and action forms that will help I.T. teams to execute on the book's core concept. Today's business environment is highly competitive. In order to survive, organizations must create new business models that focus "like a laser beam:" on the customer. For those who work in Information Technology (I.T.) customer relations is no longer a "nice to have skill, but rather a "must have:" skill. The average professional Information Technologist is lacking skills in this area - and thus I.T. faces a crisis. For the first time since the introduction of computer technology to the world of business, I.T. funding has been reduced, and investments going into computer business technology are declining. I.T. is no longer seen as the savior of a company's bottom line. This state of affairs actually represents a new opportunity for I.T. If we make a conscious decision to conduct business differently, upgrade our skills, and focus on the customer - we can get the credit, attention, and recognition we deserve. Computer technology solutions are but one part of what we offer. In the twenty-first century, we need to play a much broader role ... build stronger relationships with the people we serve ... and become an irreplaceable part of the client's business solution. Addressing the problems and offering corrective strategies facing today's I.T. professional are the sole purposes of this book. Once we do this, we will not only succeed, we will thrive I.T. IN CRISIS: A NEW BUSINESS MODEL strategizes how to make this transition.

MUSIC 2013 will be the most comprehensive text focused on the various aspects of Mobile, Ubiquitous and Intelligent computing. MUSIC 2013 provides an opportunity for academic and industry professionals to discuss the latest issues and progress in the area of intelligent technologies in mobile and ubiquitous computing environment. MUSIC 2013 is the next edition of the 3rd International Conference on Mobile, Ubiquitous, and Intelligent Computing (MUSIC-12, Vancouver, Canada, 2012) which was the next event in a series of highly successful International Workshop on Multimedia, Communication and Convergence technologies MCC-11 (Crete, Greece, June 2011), MCC-10 (Cebu, Philippines, August 2010).

What does it mean to live and work inside the information and communication technology revolution? The nature and significance of newly emerging patterns of social and technical interaction as digital technologies become more pervasive in the knowledge economy are the focus of this book. The places and spaces where digital technolgoies are in use are examined to show why such use may or may not be associated with improvements in society. Studies of on- and off-line interactions between individuals and of collective attempts to govern and manage the new technologies show that the communication revolution is essentially about people, social organization, adaptation, and control, not just technologies This book contains original empirical studies conducted within a programme of research in the Information, Networks and Knowledge (INK) research centre at SPRU, University of Sussex.

Modern embedded systems require high performance, low cost and low power consumption. Such systems typically consist of a heterogeneous collection of processors, specialized memory subsystems, and partially programmable or fixed-function components. This heterogeneity, coupled with issues such as hardware/software partitioning, mapping, scheduling, etc., leads to a large number of design possibilities, making performance debugging and validation of such systems a difficult problem.

Embedded systems are used to control safety critical applications such as flight control, automotive electronics and healthcare monitoring. Clearly, developing reliable software/systems for such applications is of utmost importance. This book describes a host of debugging and verification methods which can help to achieve this goal.
Covers the major abstraction levels of embedded systems design, starting from software analysis and micro-architectural modeling, to modeling of resource sharing and communication at the system levelIntegrates formal techniques of validation for hardware/software with debugging and validation of embedded system design flowsIncludes practical case studies to answer the questions: does a design meet its requirements, if not, then which parts of the system are responsible for the violation, and once they are identified, then how should the design be suitably modified?

These proceedings contain the papers selected for presentation at the 23rd Inter- tional Information Security Conference (SEC 2008), co-located with IFIP World Computer Congress (WCC 2008), September 8-10, 2008 in Milan, Italy. In - sponse to the call for papers, 143 papers were submitted to the conference. All - pers were evaluated on the basis of their signi?cance, novelty, and technical quality, and reviewed by at least three members of the program committee. Reviewing was blind meaning that the authors were not told which committee members reviewed which papers. The program committee meeting was held electronically, holding - tensive discussion over a period of three weeks. Of the papers submitted, 42 full papers and 11 short papers were selected for presentation at the conference. A conference like this just does not happen; it depends on the volunteer efforts of a host of individuals. There is a long list of people who volunteered their time and energy to put together the conference and who deserve acknowledgment. We thank all members of the program committee and the external reviewers for their hard work in the paper evaluation. Due to the large number of submissions, p- gram committee members were required to complete their reviews in a short time frame. We are especially thankful to them for the commitment they showed with their active participation in the electronic discussion

This book introduces readers to genetic algorithms (GAs) with an emphasis on making the concepts, algorithms, and applications discussed as easy to understand as possible. Further, it avoids a great deal of formalisms and thus opens the subject to a broader audience in comparison to manuscripts overloaded by notations and equations. The book is divided into three parts, the first of which provides an introduction to GAs, starting with basic concepts like evolutionary operators and continuing with an overview of strategies for tuning and controlling parameters. In turn, the second part focuses on solution space variants like multimodal, constrained, and multi-objective solution spaces. Lastly, the third part briefly introduces theoretical tools for GAs, the intersections and hybridizations with machine learning, and highlights selected promising applications.

This book provides a broad-based approach to decision support systems (DSS) and their applications to finance and accounting. Heymann and Bloom go beyond mere description of DSS applications for particular system configurations to provide a comprehensive, technical analysis. They identify the changing roles over time of finance and accounting within organizational management and business control systems, outline the foundation of economic models within the objectives and methodology of scientific research, and provide an introduction to the logical structure of theoretical models in finance and accounting. The systems approach is examined as an alternative to the traditional decision model approach, and different tasks within a firm are presented in terms of complex and integrated management processes. In addition, the authors describe the role of DSS in the management of a firm, present specific applications of DSS in the areas of finance and accounting, and discuss the future outlook of DSS in computerized management systems as well as their possible effects on organizational structures and management control procedures.

From the reviews of the previous editions

..".. The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." K.Engel, Mathematical Reviews 2002

The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt fur Mathematik 2005

Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added."

This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.

Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade. Identity-Based Encryption summarizes the available research for IBE and the main ideas that would enable users to pursue further work in this area. This book will also cover a brief background on Elliptic Curves and Pairings, security against chosen Cipher text Attacks, standards and more. Advanced-level students in computer science and mathematics who specialize in cryptology, and the general community of researchers in the area of cryptology and data security will find Identity-Based Encryption a useful book. Practitioners and engineers who work with real-world IBE schemes and need a proper understanding of the basic IBE techniques, will also find this book a valuable asset.