Search results

Moving on from earlier stochastic and robust control paradigms, this book introduces the fundamentals of probabilistic methods in the analysis and design of uncertain systems. The use of randomized algorithms, guarantees a reduction in the computational complexity of classical robust control algorithms and in the conservativeness of methods like H-infinity control. Features: * self-contained treatment explaining randomized algorithms from their genesis in the principles of probability theory...

An elementary first course for students in mathematics and engineering Practical in approach: examples of code are provided for students to debug, and tasks - with full solutions - are provided at the end of each chapter Includes a glossary of useful terms, with each term supported by an example of the syntaxes commonly encountered

Pascal programmers, whether they are in corporate database or commercial software development environments, need to gain and maintain control over the memory requirements of the programs they write. This entry in "The Len Dorfman Series" explores the memory options used by C programmers. Using fully documented demonstration programs, Dorfman and Neuberger guide readers through the process of building memory management function libraries that can be applied over and over in the Pascal programs th...

The use of parallel programming and architectures is essential for simulating and solving problems in modern computational practice. There has been rapid progress in microprocessor architecture, interconnection technology and software devel- ment, which are in?uencing directly the rapid growth of parallel and distributed computing. However, in order to make these bene?ts usable in practice, this dev- opment must be accompanied by progress in the design, analysis and application aspects of parall...

Activity theory is a way of describing and characterizing the structure of human - tivity of all kinds. First introduced by Russian psychologists Rubinshtein, Leontiev, and Vigotsky in the early part of the last century, activity theory has more recently gained increasing attention among interaction designers and others in the hum- computer interaction and usability communities (see, for example, Gay and H- brooke, 2004). Interest was given a signi?cant boost when Donald Norman suggested activit...

This book constitutes the refereed proceedings of the 10th International Conference on Theory and Applications of Models of Computation, TAMC 2013, held in Hong Kong, China, in May 2013. The 31 revised full papers presented were carefully reviewed and selected from 70 submissions. Bringing together a wide range of researchers with interests in computational theory and applications, the papers address the three main themes of the conference which were computability, complexity, and algorithms and...

This monograph discusses software reuse and how it can be applied at different stages of the software development process, on different types of data and at different levels of granularity. Several challenging hypotheses are analyzed and confronted using novel data-driven methodologies, in order to solve problems in requirements elicitation and specification extraction, software design and implementation, as well as software quality assurance. The book is accompanied by a number of tools, libra...

This book constitutes the thoroughly refereed post-conference proceedings of the 23rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2013, held in Madrid, Spain, in September 2013. The 13 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 21 submissions during two rounds of reviewing and improvement. LOPSTR traditionally solicits papers in the areas of specification, synthesis, verification, transformation,...

This book constitutes the refereed conference proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, CP 2014, held in Lyon, France, in September 2014. The 65 revised papers presented together with 4 invited talks were carefully selected from 108 submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resour...