الصفحة 3
الصفحة 3
Algèbre, Chapitres 1 à 3 = Algebra, Chapters 1 to 3
To do algebra is essentially to calculate, that is to say to perform, on elements of a set, (<algebraic operations n, the best-known example of which is provided by the (<four rules)) of elementary arithmetic. This is not the place to retrace the slow process of progressive abstraction by which the notion of algebraic operation, initially restricted to natural integers and to measurable quantities, gradually widened its field, as it grew. at the same time generalized the notion of ((number O, until, going beyond the latter, it came to apply to elements which no longer had any character ((numeric)>, for example to permutations of a - seems (see Historical Note in chap. 1).
Agile software engineering
This textbook presents the crucial issues in software engineering using the agile approach to software development - one of the mainstream paradigms for the management of software projects and one that is being applied more and more extensively.
Agent-oriented software engineering V ; 5th International workshop, AOSE 2004, New York, NY, USA, July 2004, revised selected papers
The explosive growth of application areas such as electronic commerce, ent- prise resource planning and mobile computing has profoundly and irreversibly changed our views on software systems. Nowadays, software is to be based on open architectures that continuously change and evolve to accommodate new components and meet new requirements. Software must also operate on di?- ent platforms, without recompilation, and with minimal assumptions about its operating environment and its users. Furthermore, software must be robust and ¨ autonomous, capable of serving a naive user with a minimum of overhead and interference. Agent concepts hold great promise for responding to the new realities of software systems. They o?er higher-level abstractions and mechanisms which address issues such as knowledge representation and reasoning, communication, coordination, cooperation among heterogeneous and autonomous parties, p- ception, commitments, goals, beliefs, and intentions, all of which need conceptual modelling. On the one hand, the concrete implementation of these concepts can lead to advanced functionalities.
Agent-oriented information systems II ; 6th International bi-conference workshop, AOIS 2004, Riga, Latvia, June 8, 2004 and New York, NY, USA, July 20, 2004, revised selected papers
Information systems have become the backbone of all kinds of organizations - day. In almost every sector – manufacturing, education, health care, government and businesses large and small – information systems are relied upon for - eryday work, communication, information gathering and decision-making. Yet, the in?exibilities in current technologies and methods have also resulted in poor performance, incompatibilities and obstacles to change. As many organizations are reinventing themselves to meet the challenges of global competition and e-commerce, there is increasing pressure to develop and deploy new technologies that are ?exible, robust and responsive to rapid and unexpected change. Agent concepts hold great promise for responding to the new realities of - formation systems. They o?er higher-level abstractions and mechanisms which address issues such as knowledge representation and reasoning, communication, coordination, cooperation among heterogeneous and autonomous parties, p- ception, commitments, goals, beliefs, intentions, etc., all of which need conc- tual modelling. On the one hand, the concrete implementation of these concepts can lead to advanced functionalities.
Advances in verification of time Petri Nets and timed automata : A temporal logic approach
This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata – A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques.
Abstraction, Reformulation, and Approximation ; 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings
This volume contains the proceedings of SARA 2007, the seventh symposium, held at Whistler Village, British Columbia, Canada, July 18-21. Three distinguished speakers were invited to give keynote presentations, and their abstracts are included herein,It has been recognized since the inception of artificial intelligence that abstractions, problem reformulations and approximations (AR&A) are central to human common-sense reasoning and problem solving and to the ability of systems to reason effectively in complex domains.AR&A techniques have been used in a variety of problem-solving settings, including automated reasoning, cognitive modelling.
Abstraction, reformulation and approximation ; 6th International symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, proceedings
This volume contains the proceedings of the 6th Symposium on Abstraction, Reformulation and Approximation (SARA 2005). the proceedings have been published in the LNAI series of Springer. Abstractions, reformulations and approximations (AR&A) have found app- cationsin avarietyofdisciplines andproblems, including constraintsatisfaction, design, diagnosis, machine learning, planning, qualitative reasoning, scheduling, resource allocation and theorem proving, but are also deeply rooted in philo- phy and cognitive science. The papers in this volume capture a cross-section of the various facets of the ?eld and of its applications. One of the primary uses of AR&A is oriented to overcome computational intractability. AR&A techniques, however, have also proved useful for knowledge acquisition, explanation and other applications.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
Abstraction Refinement for Large Scale Model Checking
This book describes recent research developments in automatic abstraction refinement techniques. The authors address the main challenge in abstraction refinement, i.e., the ability to efficiently reach or come close to the optimum abstraction (the smallest abstract model that proves or refutes the given property). A suite of fully automatic abstraction techniques are proposed to improve the overall computation efficiency. The suite of algorithms presented in this book has demonstrated significant improvement over the prior art; some of them have already been adopted by the EDA companies in their commercial/in-house verification tools.
25 Years of Model Checking : History, Achievements, Perspectives
Model checking technology is among the foremost applications of logic to computer science and computer engineering. The model checking community has achieved many breakthroughs, bridging the gap between theoretical computer science and hardware and software engineering, and it is reaching out to new challenging areas such as system biology and hybrid systems. Model checking is extensively used in the hardware industry and has also been applied to the verification of many types of software. Model checking has been introduced into computer science and electrical engineering curricula at universities worldwide and has become a universal tool for the analysis of systems.
