This book constitutes the Proceedings of the IFIP Working Conference PRO COMET'98, held 8-12 June 1998 at Shelter Island, N.Y. The conference is organized by the t'wo IFIP TC 2 Working Groups 2.2 Formal Description of Programming Concepts and 2.3 Programming Methodology. WG2.2 and WG2.3 have been organizing these conferences every four years for over twenty years. The aim of such Working Conferences organized by IFIP Working Groups is to bring together leading scientists in a given area of computer science. Participation is by invitation only. As a result, these conferences distinguish themselves from other meetings by extensive and competent technical discus sions. PROCOMET stands for Programming Concepts and Methods, indicating that the area of discussion for the conference is the formal description of pro gramming concepts and methods, their tool support, and their applications. At PROCOMET working conferences, papers are presented from this whole area, reflecting the interest of the individuals in WG2.2 and WG2.3."

Software Engineering with OBJ: Algebraic Specification in Action is a comprehensive introduction to OBJ, the most widely used algebraic specification system. As a formal specification language, OBJ makes specifications and designs more precise and easier to read, as well as making maintenance easier and more accurate. OBJ differs from most other specification languages not just in having a formal semantics, but in being executable, either through symbolic execution with term rewriting, or more generally through theorem proving. One problem with specifications is that they are often wrong. OBJ can help validate specifications by executing test cases, and by proving properties. As well as providing a detailed introduction to the language and the OBJ system that implements it, Software Engineering with OBJ: Algebraic Specification in Action provides case studies by leading practitioners in the field, in areas such as computer graphics standards, hardware design, and parallel computation. The case studies demonstrate that OBJ can be used in a wide variety of ways to achieve a wide variety of practical aims in the system development process. The papers on various OBJ systems also demonstrate that the language is relatively easy to understand, implement, and use, and that it supports formal reasoning in a straightforward but powerful way. Software Engineering with OBJ: Algebraic Specification in Action will be of interest to students and teachers in the areas of data types, programming languages, semantics, theorem proving, and algebra, as well as to researchers and practitioners in software engineering.

1.1. What This Book is About This book is a study of * subrecursive programming systems, * efficiency/program-size trade-offs between such systems, and * how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem- bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e. g., Lisp or Modula-2) for which there is a proof in some par- ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.

Computational Issues in High Performance Software for Nonlinear Research brings together in one place important contributions and up-to-date research results in this important area. Computational Issues in High Performance Software for Nonlinear Research serves as an excellent reference, providing insight into some of the most important research issues in the field.

Mobile ad-hoc networks must be rapidly interoperable, customizable, and quick to adapt to the latest technological advances. Technological Advancements and Applications in Mobile Ad-Hoc Networks: Research Trends offers a current look into the latest research in the field, frameworks for development, and future directions. As mobile networks become more complex, it is vital for researchers, practitioners, and academics alike to stay abreast within the ever-burgeoning field. With a wide range of applications, theories, and use across industrial, commercial, and domestic settings, mobile ad-hoc networks are a topic of vital discussion, and this volume offers the cutting edge developments with contributions from around the world.

This book is devoted to one of the main questions of the theory of extremal prob lems, namely, to necessary and sufficient extremality conditions. It is intended mostly for mathematicians and also for all those who are interested in optimiza tion problems. The book may be useful for advanced students, post-graduated students, and researchers. The book consists of four chapters. In Chap. 1 we study the abstract minimization problem with constraints, which is often called the mathemati cal programming problem. Chapter 2 is devoted to one of the most important classes of extremal problems, the optimal control problem. In the third chapter we study one of the main objects of the calculus of variations, the integral quadratic form. In the concluding, fourth, chapter we study local properties of smooth nonlinear mappings in a neighborhood of an abnormal point. The problems which are studied in this book (of course, in addition to their extremal nature) are united by our main interest being in the study of the so called abnormal or degenerate problems. This is the main distinction of the present book from a large number of books devoted to theory of extremal problems, among which there are many excellent textbooks, and books such as, e.g., 13, 38, 59, 78, 82, 86, 101, 112, 119], to mention a few."

Intuitionistic type theory can be described, somewhat boldly, as a partial fulfillment of the dream of a universal language for science. This book expounds several aspects of intuitionistic type theory, such as the notion of set, reference vs. computation, assumption, and substitution. Moreover, the book includes philosophically relevant sections on the principle of compositionality, lingua characteristica, epistemology, propositional logic, intuitionism, and the law of excluded middle. Ample historical references are given throughout the book.

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and nonlinear optimization are closely linked. This book offers a comprehensive introduction to the whole subject and leads the reader to the frontiers of current research. The prerequisites to use the book are very elementary. All the tools from numerical linear algebra and calculus are fully reviewed and developed. Rather than attempting to be encyclopedic, the book illustrates the important basic techniques with typical problems. The focus is on efficient algorithms with respect to practical usefulness. Algorithmic complexity theory is presented with the goal of helping the reader understand the concepts without having to become a theoretical specialist. Further theory is outlined and supplemented with pointers to the relevant literature.
The book is equally suited for self-study for a motivated beginner and for a comprehensive course on the principles of mathematical programming within an applied mathematics or computer science curriculum at advanced undergraduate or graduate level. The presentation of the material is such that smaller modules on discrete optimization, linear programming, and nonlinear optimization can easily be extracted separately and used for shorter specialized courses on these subjects.

What is good code? Writing good code is really a question about what the code is trying to solve. (And good code is not to be confused with patterns because not all pieces of good code are patterns.) We debate about good code because there is not just a single piece of good code, but so many good pieces of code. And each good piece of code depends on the context in which it is used.

"How to Code .NET: Tips and Tricks for Coding .NET 1.1 and .NET 2.0 Applications Effectively" provides solutions to certain problems. That is, specific problems. This book provides detailed, authoritative explanations of good .NET coding techniques. It's based on award-winning material that author -->Christian Gross--> has previously presented at conferences throughout the U.S. and Europe. What's more, the author is at the forefront of the .NET technology wave and an acknowledged expert on the subject of .NET coding style and techniques.-->Table of Contents-->Testing Your Code .NET Runtime- and Framework-Related Solutions Text-Related Solutions C# Coding Solutions

As is true of most technological fields, the software industry is constantly advancing and becoming more accessible to a wider range of people. The advancement and accessibility of these systems creates a need for understanding and research into their development. Optimizing Contemporary Application and Processes in Open Source Software is a critical scholarly resource that examines the prevalence of open source software systems as well as the advancement and development of these systems. Featuring coverage on a wide range of topics such as machine learning, empirical software engineering and management, and open source, this book is geared toward academicians, practitioners, and researchers seeking current and relevant research on the advancement and prevalence of open source software systems.

The first textbook ever to cover multi-relational data mining and inductive logic programming, this book fully explores logical and relational learning. Ideal for graduate students and researchers, it also looks at statistical relational learning.

Over the past several years, a great deal of research has been devoted to the use of information technology by small businesses. One technological tool now used to boost company success is Web presence enhancement in alignment with business strategy. ""Effective Web Presence Solutions for Small Businesses: Strategies for Successful Implementation"" is the first book to provide small businesses with a holistic approach to implementing their Web presence through identification of Web site content that matches their business strategy. A valuable read for small business owners as well as academicians and researchers, this book connects the various issues involved in the planning and execution of successful Web sites for small businesses.

"Hands-On Database "uses a scenario-based approach that shows readers how to build a database by providing them with the context of a running case throughout each step of the process.

Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches covers recent developments in optimization techniques for addressing several computational chemistry and biology problems. A tantalizing problem that cuts across the fields of computational chemistry, biology, medicine, engineering and applied mathematics is how proteins fold. Global and local optimization provide a systematic framework of conformational searches for the prediction of three-dimensional protein structures that represent the global minimum free energy, as well as low-energy biomolecular conformations. Each contribution in the book is essentially expository in nature, but of scholarly treatment. The topics covered include advances in local and global optimization approaches for molecular dynamics and modeling, distance geometry, protein folding, molecular structure refinement, protein and drug design, and molecular and peptide docking. Audience: The book is addressed not only to researchers in mathematical programming, but to all scientists in various disciplines who use optimization methods in solving problems in computational chemistry and biology.

Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.

For undergraduate students who have completed a course in object-oriented programming Programming the World Wide Web provides a comprehensive introduction to the tools and skills required for both client- and server-side programming, teaching students how to develop platform-independent sites using the most current Web development technology. Essential programming exercises are presented using a manageable progression: students begin with a foundational XHTML Web site and employ new languages and technologies to add features as they are discussed in the course. Readers with previous experience programming with an object-oriented language are guided through concepts relating to client-side and server-side programming.

The scientific monograph of a survey kind presented to the reader's attention deals with fundamental ideas and basic schemes of optimization methods that can be effectively used for solving strategic planning and operations manage ment problems related, in particular, to transportation. This monograph is an English translation of a considerable part of the author's book with a similar title that was published in Russian in 1992. The material of the monograph embraces methods of linear and nonlinear programming; nonsmooth and nonconvex optimization; integer programming, solving problems on graphs, and solving problems with mixed variables; rout ing, scheduling, solving network flow problems, and solving the transportation problem; stochastic programming, multicriteria optimization, game theory, and optimization on fuzzy sets and under fuzzy goals; optimal control of systems described by ordinary differential equations, partial differential equations, gen eralized differential equations (differential inclusions), and functional equations with a variable that can assume only discrete values; and some other methods that are based on or adjoin to the listed ones."

Describes a small verification library with a concentration on user adaptability such as re-useable components, portable Intellectual Property, and co-verification.

Includes a free CD of TEAL along with examples.

Takes a realistic view of reusability and distills lessons learned down to a tool box of techniques and guidelines.

Languages like C#, VB .NET, and Delphi include built-in support for events, and these events become very powerful when they connect the objects and components of a system. Events make it possible for such parts to interact without any coupling. And the resulting parts can be developed and tested individuallywhich keeps the code clean and simple.

Component-based development (CBD) is an extension of object-oriented programming. CBD does away with the language and vendor-specific limitations of OOP, and makes software reuse more practical and accelerates the development process. Event-based programming is the next logical step in CBD, and makes components more reusable due to their decoupled nature. But event-based systems are easier to develop, which means theyre cheaper and more reliable than traditional OOP or CBD systems.

This book teaches you how to develop software based on parts that interact primarily through an event mechanism. Youll learn how to use events in many different situations, to solve recurring development problems without coupling. The book introduces Signal Wiring Diagram, a novel form of software diagram similar to the circuit diagrams used by hardware designers. The book concludes with a series of case studies, incorporating all featured concepts. In a nutshell, youll want to pick up a copy of this book because it Provides source code in both C# and VB .NET Shows how to use an event-based paradigm to reduce or completely eliminate coupling between classes and components Describes components, including coordinators, workers, builders, binders, and routers Contains three complete case studies that model concepts being used to design small, medium, and largesystems

Among the most important problems confronting computer science is that of developing a paradigm appropriate to the discipline. Proponents of formal methods - such as John McCarthy, C.A.R. Hoare, and Edgar Dijkstra - have advanced the position that computing is a mathematical activity and that computer science should model itself after mathematics. Opponents of formal methods - by contrast, suggest that programming is the activity which is fundamental to computer science and that there are important differences that distinguish it from mathematics, which therefore cannot provide a suitable paradigm. Disagreement over the place of formal methods in computer science has recently arisen in the form of renewed interest in the nature and capacity of program verification as a method for establishing the reliability of software systems. A paper that appeared in Communications of the ACM entitled, Program Verification: The Very Idea', by James H. Fetzer triggered an extended debate that has been discussed in several journals and that has endured for several years, engaging the interest of computer scientists (both theoretical and applied) and of other thinkers from a wide range of backgrounds who want to understand computer science as a domain of inquiry. The editors of this collection have brought together many of the most interesting and important studies that contribute to answering questions about the nature and the limits of computer science. These include early papers advocating the mathematical paradigm by McCarthy, Naur, R. Floyd, and Hoare (in Part I), others that elaborate the paradigm by Hoare, Meyer, Naur, and Scherlis and Scott (in Part II), challenges, limits and alternatives explored by C. Floyd, Smith, Blum, and Naur (in Part III), and recent work focusing on formal verification by DeMillo, Lipton, and Perlis, Fetzer, Cohn, and Colburn (in Part IV). It provides essential resources for further study. This volume will appeal to scientists, philosophers, and laypersons who want to understand the theoretical foundations of computer science and be appropriately positioned to evaluate the scope and limits of the discipline.

PHP is rapidly becoming the language of choice for dynamic Web development, in particular for e-commerce and on-line database systems. It is open source software and easy to install, and can be used with a variety of operating systems, including Microsoft Windows and UNIX.

This comprehensive manual covers the basic core of the language, with lots of practical examples of some of the more recent and useful features available in version 5.0. MySQL database creation and development is also covered, as it is the developer database most commonly used alongside PHP. It will be an invaluable book for professionals wanting to use PHP to develop their own dynamic web pages.

Key Topics:

- Basic Language Constructs

- Manipulating Arrays and Strings

- Errors and Buffering

- Graphic Manipulation

- PDF Library Extension

- MySQL Database Management

- Classes and Objects Concepts

Features and Benefits:

Explains how to use PHP to its full extent - covering the latest features and functions of PHP version 5.0, including the use of object-oriented programming

Describes how to link a database to a web site, using the MySQL database management system

Shows how to connect PHP to other systems and provides many examples, so that you can create powerful and dynamic web pages and applications

Contains lots of illustrated, practical, real-world examples - including an e-commerce application created in PHP using many of the features described within the book

The scripts used in the examples are available for download from www.phpmysql-manual.com

Many questions dealing with solvability, stability and solution methods for va- ational inequalities or equilibrium, optimization and complementarity problems lead to the analysis of certain (perturbed) equations. This often requires a - formulation of the initial model being under consideration. Due to the specific of the original problem, the resulting equation is usually either not differ- tiable (even if the data of the original model are smooth), or it does not satisfy the assumptions of the classical implicit function theorem. This phenomenon is the main reason why a considerable analytical inst- ment dealing with generalized equations (i.e., with finding zeros of multivalued mappings) and nonsmooth equations (i.e., the defining functions are not c- tinuously differentiable) has been developed during the last 20 years, and that under very different viewpoints and assumptions. In this theory, the classical hypotheses of convex analysis, in particular, monotonicity and convexity, have been weakened or dropped, and the scope of possible applications seems to be quite large. Briefly, this discipline is often called nonsmooth analysis, sometimes also variational analysis. Our book fits into this discipline, however, our main intention is to develop the analytical theory in close connection with the needs of applications in optimization and related subjects. Main Topics of the Book 1. Extended analysis of Lipschitz functions and their generalized derivatives, including "Newton maps" and regularity of multivalued mappings. 2. Principle of successive approximation under metric regularity and its - plication to implicit functions.

How do you design personalized user experiences that delight and provide value to the customers of an eCommerce site? Personalization does not guarantee high quality user experience: a personalized user experience has the best chance of success if it is developed using a set of best practices in HCI. In this book 35 experts from academia, industry and government focus on issues in the design of personalized web sites. The topics range from the design and evaluation of user interfaces and tools to information architecture and computer programming related to commercial web sites. The book covers four main areas:
-Theoretical, Conceptual, and Architectural Frameworks of Personalization,
-Research on the Design and Evaluation of Personalized User Experiences in Different Domains,
-Approaches to personalization Through Recommender Systems,
-Lessons Learned and Future Research Questions. This book will be a valuable tool in helping the reader to understand the range of factors to take into consideration in designing and building a personalized user experience. The authors of each of the chapters identify possibilities and alert the reader to issues that can be addressed in the beginning of a project by taking a 'big picture' view of designing personalized user interfaces. For anyone working or studying in the field of HCI, information architecture or eCommerce, this book will provide a solid foundation of knowledge and prepare for the challenges ahead.

Since I started working in the area of nonlinear programming and, later on, variational inequality problems, I have frequently been surprised to find that many algorithms, however scattered in numerous journals, monographs and books, and described rather differently, are closely related to each other. This book is meant to help the reader understand and relate algorithms to each other in some intuitive fashion, and represents, in this respect, a consolidation of the field. The framework of algorithms presented in this book is called Cost Approxi mation. (The preface of the Ph.D. thesis Pat93d] explains the background to the work that lead to the thesis, and ultimately to this book.) It describes, for a given formulation of a variational inequality or nonlinear programming problem, an algorithm by means of approximating mappings and problems, a principle for the update of the iteration points, and a merit function which guides and monitors the convergence of the algorithm. One purpose of this book is to offer this framework as an intuitively appeal ing tool for describing an algorithm. One of the advantages of the framework, or any reasonable framework for that matter, is that two algorithms may be easily related and compared through its use. This framework is particular in that it covers a vast number of methods, while still being fairly detailed; the level of abstraction is in fact the same as that of the original problem statement."