Two dimensional event set is introduced, and it is applied to algebraic structures. Two dimensional BCK/BCI-eventful algebra, paired B-algebra and paired BCK/BCI-algebra are de ned, and several properties are investigated. Conditions for two dimensional eventful algebra to be a B-algebra and a BCK/BCI-algebra are provided. The process of inducing a paired B-algebra using a group is discussed. Using two dimensional BCI-eventful algebra, a commutative group is established.

Accessible but rigorous, this outstanding text encompasses all of the topics covered by a typical course in elementary abstract algebra. Its easy-to-read treatment offers an intuitive approach, featuring informal discussions followed by thematically arranged exercises. This second edition features additional exercises to improve student familiarity with applications. 1990 edition.

Written in a clear, readable style with a wide range of explanations and examples, this must-have dictionary reflects recent changes in the fields of statistics and methodology. Packed with new definitions, terms, and graphics, this invaluable resource is an ideal reference for researchers and professionals in the field and provides everything students need to read and understand a research report, including elementary terms, concepts, methodology, and design definitions, as well as concepts from qualitative research methods and terms from theory and philosophy.

This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic.

Mathematical morphology is a powerful methodology for the processing and analysis of geometric structure in signals and images. This book contains the proceedings of the fifth International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing, held June 26-28, 2000, at Xerox PARC, Palo Alto, California. It provides a broad sampling of the most recent theoretical and practical developments of mathematical morphology and its applications to image and signal processing. Areas covered include: decomposition of structuring functions and morphological operators, morphological discretization, filtering, connectivity and connected operators, morphological shape analysis and interpolation, texture analysis, morphological segmentation, morphological multiresolution techniques and scale-spaces, and morphological algorithms and applications. Audience: The subject matter of this volume will be of interest to electrical engineers, computer scientists, and mathematicians whose research work is focused on the theoretical and practical aspects of nonlinear signal and image processing. It will also be of interest to those working in computer vision, applied mathematics, and computer graphics.