الصفحة 2
الصفحة 2
Foundations of information and knowledge systems ; 5th International Symposium, FoIKS 2008, Pisa, Italy, February 11-15, 2008. Proceedings
This book constitutes the refereed proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2008 held in Pisa, Italy, in February 2008. The 13 revised full papers presented together with 9 revised short papers and 3 invited lectures were carefully selected during two rounds of reviewing and improvement from from 79 submissions. The papers deal with any foundational aspect of information and knowledge systems, including submissions from researchers working in fields such as discrete mathematics, logic and algebra, model theory, information theory, complexity theory, algorithmics and computation, geometry, analysis, statistics and optimisation who are interested in applying their ideas, theories and methods to research on information and knowledge systems.
Foundations of information and knowledge systems ; 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings
This book constitutes the refereed proceedings of the 4th International Symposium on Foundations of Information and Knowledge Systems, held in February 2006. The 14 revised full papers presented together with three revised short papers and one invited paper were carefully reviewed and selected from 54 submissions. Among the topics covered are the theoretical foundations of information and knowledge systems, as well as mathematical fields such as discrete mathematics, combinatorics, logics and finite model theory, and applications thereof for research on database and knowledge base theory.
Formal Concept Analysis ; 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008. Proceedings
Formal Concept Analysis (FCA) is a mathematical theory of concepts and c- ceptual hierarchyleadingto methods for conceptually analyzing data and kno- edge. The theory itselfstronglyreliesonorder and lattice theory,whichhasbeen studied by mathematicians over decades. FCA proved itself highly relevant in several applications from the beginning , and, over the last years, the range of application shaskept growing. The mainreasonfor this comesfromthe fact that our modern society has turned into an “information” society. After years and years of using computers, companies realized they had stored gigantic amounts of data.
Fast software encryption ; 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers
Constitutes the thoroughly refereed proceedings of the 15th International Workshop on Fast Software Encryption, FSE 2008, held in Lausanne, Switzerland in February 2008.The 26 revised full papers presented together with 4 short papers were carefully reviewed and selected from 72 submissions. The papers address all current aspects of fast and secure primitives for symmetric cryptology and are organized in topical sections on SHA collisions, new hash function designs, block cipher cryptanalysis, implementation aspects, hash function cryptanalysis, stream cipher cryptanalysis, security bounds, and entropy.
Experimental Algorithms ; 7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30-June 1, 2008 Proceedings
The Workshop on Experimental Algorithms, WEA, is intended to be an international forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series.
Experimental Algorithms ; 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.
Evolutionary computation in combinatorial optimization ; 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings
Metaheuristics have been shown to be e?ective for di?cult combinatorial - timization problems appearing in various industrial, economical, and scientifc domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman pr- lem, packing and cutting, satisfability and general mixed integer programming.
Essential discrete mathematics for computer science
An ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study. The essential introduction to discrete mathematics / Features thirty-one short chapters, each suitable for a single class lesson / Includes more than 300 exercises / Almost every formula and theorem proved in full / Breadth of content makes the book adaptable to a variety of courses / Each chapter includes a concise summary
Ensembles ordonnés finis : concepts, résultats et usages = Finite ordered sets : concepts, results and uses
The concepts of order, classification, storage are presented in many activities and human situations. The mathematical formalization of these notions first allowed the great development of the theory of lattices, then that of more general ordered structures, in particular those relating to discrete mathematics.
Engineering theories of software intensive systems : Theory, algorithms, software, and applications
Software engineering has over the years been applied in many different fields, ranging from telecommunications to embedded systems in car and aircraft industry as well as in production engineering and computer networks. Foundations in software technology lie in models allowing to capture application domains, detailed requirements, but also to understand the structure and working of software systems like software architectures and programs. These models have to be expressed in techniques based on discrete mathematics, algebra and logics. However, according to the very specific needs in applications of software technology, formal methods have to serve the needs and the quality of advanced software engineering methods, especially taking into account security aspects in Information Technology. This book presents mathematical foundations of software engineering and state-of-the-art engineering methods in their theoretical substance in the step towards practical applications to examine software engineering techniques and foundations used for industrial tasks.
Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications
This book provides a good opportunity for computer science practitioners and researchers to get in sync with current state-of-the-art and future trends in the field of combinatorial optimization and online algorithms. Recent advances in this area are presented focusing on the design of efficient approximation and on-line algorithms. One central idea in the book is to use a linear program relaxation of the problem, randomization and rounding techniques.
Distributed computing in sensor systems ; 4th IEEE International Conference, DCOSS 2008 Santorini Island, Greece, June 11-14, 2008 Proceedings
The book constitutes the refereed proceedings of the 4th International Conference on Distributed Computing in Sensor Systems, DCOSS 2008, held on Santorini Island, Greece, in June 2008.
Discrete Mathematics Using a Computer
Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, the functional language Haskell allows students to experiment with mathematical notations and concepts -- a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily.
Discrete Geometry for Computer Imagery ; 14th IAPR International Conference, DGCI 2008, Lyon, France, April 16-18, 2008. Proceedings
This book constitutes the refereed proceedings of the 14th IAPR TC-18 International Conference on Discrete Geometry for Computer Imagery, DGCI 2008, held in Lyon, France, in April 2008.
Discovering Mathematics with Magma : Reducing the Abstract to the Concrete
This volume celebrates the first decade of the Computer Algebra system Magma. With a design based on the ontology and semantics of algebra, Magma enables users to rapidly formulate and perform calculations in the more abstract parts of mathematics. The book range over much of Magma's coverage of algorithmic algebra: from number theory and algebraic geometry, via representation theory and group theory to some branches of discrete mathematics and graph theory. A basic introduction to the Magma language is given in an appendix. The book is simultaneously an invitation to learn a new programming language in the context of contemporary research problems, and an exposition of the types of problem that can be investigated using computational algebra.
Diagrammatic Representation and Inference ; 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008. Proceedings
This book constitutes the refereed proceedings of the 5th International Conference on Theory and Application of Diagrams, Diagrams 2008, held in Herrsching, Germany, in September 2008.
Developments in Language Theory ; 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008.
Conceptual Structures : Knowledge Visualization and Reasoning; 16th International Conference on Conceptual Structures, ICCS 2008 Toulouse, France, July 7-11, 2008 Proceedings
This book constitutes the refereed proceedings of the 16th International Conference on Conceptual Structures, ICCS 2008, held in Toulouse, France, in July 2008.
Computing the Continuous Discretely : Integer-Point Enumeration in Polyhedra
This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory.
Computing and Combinatorics ; 14th Annual International Conference, COCOON 2008 Dalian, China, June 27-29, 2008 Proceedings
The refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008.
