1734
IEEE,OF THE VOL.
Appendiv 1 is a glossary of terms. Appendix2 is abibliography,
with more than 300 references, divided into 17 categories. Appendix
3concerns the equivalence of simple and modular sequences, and
Appendix 4 iscalled “Multiplication of Direct SequenceSignals”
The author is certainly to be commended for his efforts. Unfortu-
nately,thebookhas several deficiencies which greatly diminish its
value. The material was apparently assembled in great haste and with
little attention to detail, as evidenced by the abnormally large number
of typographical errors. Many topics are covered in only a very brief
and shallow fashion.This reviewer foundthe author’s writing style
very confusing in many places, withunconventionalmathematical
representationsgreatlydetracting fromthe work. For example, on
page 16 a square-wave is represented as cos Wm t ; on page 170 a square-
wave is represented as (wm)= (4/n) (cos wmt - [ 5 11 cos 3wmt + . . . ).
The author apparently has a great deal of trouble with trigonometric
identities,withmanyincorrect statements given concerningthem.
Perhaps more significant are the many errors concerning probability
results, e.g., pages 32, 148, 204. Basic termsandconcepts such as
convolution,correlation, and covariance are often misused, further
confusing many readers. Other examples could be given of the author’s
imprecise use of language and mathematics, which this reviewer found
very disturbing.
Because the need is so clear, it is disappointing that a whole-hearted
recommendation of this book as a textbook for the classroom or as a
reference book for thepracticing engineer cannot be given.
Reprinted from IEEE Communications Society Magazine, May 1977.
Introduction to theTheory of Fuzy Subsets-Vd 1: Fundamental
Theoretical Elements-A. Kaufmann (New York: Academic, 1975,
432 pp.). Reviewedby A. P. Bonaert,Metra-Sobemap, Brussels,
Belgium.
This book is the English translation of the French original published
three years ago and constitutes the fust volume of a collection of five.
The fust volume to be reviewed surveys mathematical essentials (es-
pecially from an algebraic and structural point of view) of fuzzy sets.
The remaining four volumes (of which two are already published in
French) are devoted to applications.
Chapter I is an introduction to a number of concepts. Fuzzy subsets
(the prefiv “sub” is henceforth omitted) are defined as a mapping of
the elements of a universe set into the closed interval [0, I ] . This
mapping, called the membership function, is a generalization of the
characteristic
function. The operations/concepts of complement,
inclusion, union,intersection, algebraic productand sumas well as
Hamming and Euclideandistances are extended to fuzzy sets. The
concepts of the nonfuzzy setnearest to a given fuzzy set and nonfuzzy
set of given level are introduced. It is shown how a fuzzy set can be
decomposed using nonfuzzy sets of various levels. Then the concept
of power set is extended to fuzzy power sets (Le., to all the mappings
of the elements of the universe into [ 0, 11).
Chapter I1 starts by studying the mappings of the elements of the
Cartesian products of sets into [0, 11, defining in this fashion fuzzy
graphs, fuzzy mappings, and fuzzy relations. Operatorsandother
concepts presented in Chapter I are adapted to fuzzy relations Various
types of composition of fuzzyrelations are introduced (max-min,
max-product, etc.). Fuzzy sets induced by mapping of a universe set
into another and by the membership function of the former are pre-
sented. Conditional fuzzy sets are also considered.
Then the concept of reflexivity, symmetry,and theiropposite, as
well astransitivity are extended to fuzzy relationsThoseconcepts
are central to the second part of the chapter, since fromthem are
defined various types offuzzy relations: pre-order, order, ordinal,
resemblance, dissemblance, similitude, and dissimilitude. The transi-
tive closure of a binary relation is linked to the concept of strongest
path. Variousproperties are derived on this closure, in particular,
for pre-ordered relations A pre-ordered relation having classes of
similarity is shown to induce anordered relation that is related to
the ordinal function of the nonfuzzygraph of this latter relation.
The formal differences and analogies between fuzzy set theory and
probability theory are summarized. Thechapter concludeswith two
applications of fuzzy functions to fuzzypropositions and reliable
structures
Chapter IV introduces the concepts of internal composition laws
(a binary operator mapping two elements of a fuzzy power set into
anotherelementofthe same power set) andexternal cornposition
laws (the three elements can belong to threedistinct fuzzypower
sets). Attention is given to the internal composition law of a fuzzy
power set induced by the internal composition law of the membership
PROCEEDINGS
12, 6 5 , NO. DECEMBER 1977
functions, especially when associatively, the existence of the identity
element, and/or of a unique inverse transforms the internal law into a
fuzzymonoid or fuzzygroup. Thechapter concludes by showing
how the convolutionofmembership functions ofcertainpdftypes
generates a fuzzy monoid isomorphic to the natural numbers.
Chapter V is divided into two main parts. First, the concept of fuzzy
sets is extended byallowing the setinto which the membership function
takes value to have structures ranging from preorder, order, semilattice,
and lattices of various types to ring. Numerous examples are presented
to show how the structure of the latter set and the properties of its
internal laws are transferred to the structure of the fuzzypower set
and its induced internal laws The concepts of Hamming distance and
of various operations (inclusion, complement, union, intersection) are
generalized when the set (into which the membership functions are
mapped) is alattice, using, respectively, the Hasse diagram andthe
order induced by the lattice.
In the second part,theconcept ofcategory is reviewed and then
made fuzzy by mapping the morphisms defined by the category into a
target lattice, thus generating a fuzzy power set from the category into
the lattice. Two types ofcomposition of fuzzymorphisms are then
presented.
Emphasis is also given to link distances, to membership functions of
similitude and dissimilitude relations, and to membership functions of
two types of the transitive closures (min-max and min-sum) of ressem-
blance relations Decomposition of fuzzy order or similitude relations
is also considered. Thechapter concludes by presenting classes of
membership functions for labels such as small and large on the universe
sets N,Z , R + , and R .
Chapter 111 mainly considers fuzzy variables and functions of fuzzy
variables. Fuzzy variables aremembership functions treated as varia-
bles. Among the class of functions of fuzzy variables, analytical func-
tions (Le., polynomials of fuzzy variables and their complements with
binary operators min and max) are singled out since they themselves
can become new fuzzy variables.
Concepts of Boolean polynomialsare adaptedandextended to
analyticalfuzzy functions such as the transformations of analytical
functions into functions with one binary operator (Sheffer, Peirce) or
in uniquecanonical expressions: minof max termsor max of min
terms Series-parallel networks connecting elements representing fuzzy
variables are used to derive the canonicalexpressions of analytical
functionsor to obtainthe min-max expression fromthe max-min
expression.
The Marinos algorithm is used to write systematically the conditions
under which acanonical form w i be a giveninterval.
l The concept
of truth tables is generalized to one of value tables. Two methods (one
analytical, the other using value tables) are presented for determining
the intervals into which an analytical function will lie when its fuzzy
variables are restricted to be in given intervals. A dual problem
considered is, given a target interval and a set of fuzzy variables lying
in known intervals, whatconditions arerequired for a given fuzzy
analytical function to map the fuzzy variables from their domains into
the target interval? The conditions are synthesized through multipliers,
threshold, and logic circuits.
Theauthor
has succeeded in writing an extremely clear and
pedagogical book, while covering the fust comprehensive survey of the
field (one may nevertheless regret thatthree years wereneeded to
obtain the English translation of the original French text). The book
is self-contained in the sense that summarized revisions of concepts of
modem algebra are given before they are used. Numerousexamples
are provided without neglecting (except in Chapter V) formal proofs.
A list of references is appended, although it is not quoted as often as
it should be in the text.
Readerswho should have this bookon their shelves include prac-
tically everyone interested in system theory (from a practical as well
as a theoretical-algebraic point of view). The book would be a very
good reference at the graduate level, although it is also a perfect self-
teaching text.
Reprinted from IEEE Transactions on Systems, Man, and Cybernetics,
June 1977,
Applied ComputationTheory Analysis, Design, Modeling-Raymond
T. Yeh, Ed. (Englewood Cliffs, NJ: Prentice Hall Inc., 1976, xxi 624
pp., $22.50). Reviewed by Robert M. Keller of the Department of
Computer Science, University of Utah, Salt Lake City, UT .
Computation theory (also known as automata theory) is that body of
mathematical results which deals with the formalization of computa-
tional processes. The theory, which is perhaps not asunified as the