Ec 367: Soft Computing

Module 1

1.1 Definition of soft computing

This is a type of computing in which the computing is performed by tolerating the
imprecision, uncertainty partial truth and approximation. The best example for soft
computing is human mind. Where as in hard computing precision is required for analysis.
This is best suited for ideal environment and we preferably deal with non ideal environment.
The major tools used for soft computing are fuzzy logic, neural networks, SVM and
genetic algorithms etc.
1.2 Soft computing VS Hard computing

Soft computing Hard Computing

Method of approximation Method of accuracy
Methods and data should be precise Need not be precise
Less complex and saves time More complex and time consuming
Generally based on binary logic Based on fuzzy logic

1.3 Fuzzy computing

Fuzzy computing characterizes the uncertainty in engineering problems. A complex
system is more imprecise, so we prefer fuzzy logic for complex system analysis. And in
fuzzy logic we balance precision with uncertainty. Since the data associated with fuzzy is
imprecise the developed rule also is imprecise in nature. When the result required may not
be 100% accurate but needed fast we can use fuzzy logic instead of standard binary logic.

1.4 Neural networks

Neural networks are another set of tools used for soft computing. As already mentioned
human brain computing is soft in nature, so if we are able to build an analogous system to
resemble human brain ie a system works just like a human brain we obtain a powerful and
fast soft computing tool. Neural networks are such a tool. It consists of a certain amount of
 nodes arranged as several layers which is identical to the neuron in a human brain. Since the
neurons are interconnected through synapse, connection strengths between neurons are
indicated by synaptic weight. The learning mechanism of neural network is learning through
experience.
1.5 Genetic algorithms
This is a type of method used generally in operational research which is based on the
theory Natural selection in evolutionary science. They are utilized to provide a high quality
results to optimization and research problems. Genetic algorithm starts from a population
with a certain number of candidate solution and operated to obtain the best solution.
The steps in genetic algorithms are
1) Initialization : size of solutions generated randomly
2) Selection: each solution is generated randomly and called generation. In selection a
portion of the solution is chosen for next iteration
3) Genetic operation: operation on newly selected solutions. (mutation and cross over)
4) Termination: above steps are repeated until conditions are matched.
1.6 Applications of soft computing.
1) Hand writing recognition
2) Image processing and data compression
3) Power systems
4) Fuzzy logic controls
1.7 The fuzzy logic.

1.7.1. Introduction

Fuzzy logic utilizes the balance between precision and uncertainty. We prefer fuzzy logic
because achieving a high degree of precision demands higher computational complexity and
time. Of course this cannot solve problems which require higher degree of accuracy like
shooting laser to space at a distance of 10km, focusing electron beam in an electron
microscope to an object of size nm etc. But it can easily be utilized in navigating a vehicle,
parking vehicle or traffic control since they do not require highest degree of accuracy in their
methods.
 Consider a sales person as an example for an optimization problem. When the number of
cities to be visited is very small, finding optimum path is much easier. But when number is
100 there is 10200 different paths and even the most powerful and efficient computer that
exist cannot solve this problem. In electronic network scenario one similar situation is to
route the signal through nodes. Consider there are 100,000 nodes in a network; it will take
several months to find optimum solution if we demand 0.75% uncertainty in the solution,
where as if we compromise to 3.5% the solution can be obtained in some minutes. This is
the very significant advantage in fuzzy logic.

1.7.2 Utility of fuzzy systems.

Several sources have shown that fuzzy systems are universal approximators. This is due
to the isomorphism between abstract algebra and linear algebra. In linear algebra the
function maps between variables where as in fuzzy systems the mapping is in between
groups.

Generally fuzzy systems are used in situations which are having (1)higher degree of
complexity and (2) problems which require approximate solution in a fast way.

1.7.3 Limitations of fussy systems.

Fuzzy systems can only be treated as a shallow model for reasoning where we infer a
specific from general. But there is another type of reasoning model called deep reasoning in
which we approximate a general solution from specific. A shallow reasoning uses analysis
of observed data whereas a deep reasoning analyses the underlying process which is more
general and convenient.
1.7.4 Uncertainty and Accuracy.

It can be assumed that fuzzy logic is another type of probability since both deals with the
uncertainty. But there are some basic differences.

1) The sample set is fixed in probability theory

2) The frequency of occurrence of an event in sample space also cannot vary.
3) Outcomes are repeating and totally independent.

There are not such rules associated with the fuzzy logic.

More specifically there are some situations in which probability cannot be applied and
process is not purely random. Examples are the clothes which is going to wear on next day,
the vehicle to purchase, whether conditions etc.

1.7.5 Uncertainty and Information

The main problem associated with precision is the chance of forgetting. Unfortunately a
vast majority of material taught in engineering is of deterministic type. The major problem is
forgetting the correct formula. So there will be uncertainty in information especially
associated with a complex system.

But uncertain information is more easy to understand and easy to model. For example
consider a cooking process. It is easier to state that stop the baking when the color changes
to light brown instead to instructing to stop when the temperature is exactly 1250C. The
latter case is easier to understand also to implement.

1.7.6 Fuzzy sets and membership.

In this section we discuss about the fuzzy sets and its membership. As an example we can
easily assess a persons height is above 6 feet or not. In binary sense if the height of a person
is 511.9999 will not be included in the classical or crisp set. But according to fuzzy he can
be included since the definition of the set will be nearly 6 feet. Crisp set satisfies precise
properties of membership and fuzzy set satisfies imprecise properties. That is height ranges
from 5 to 7 feet is precise but around 6 is imprecise. Like crisp set fuzzy set is also defined
in universe.
 If element x in universe X is to be a member of set A or not can be expressed
mathematically as.

The symbol A(x) represents the membership of the value x in set A. consider the height
example stated above. Its crisp set and fuzzy sets are given below.

Its membership function can be represented as

1.8 Classical set and fuzzy set
A classical set is defined by crisp boundaries, that is, there is no uncertainty in the
prescription or location of the boundaries of the set, as shown in Figure 2.1a where the
boundary of crisp set A is an unambiguous line. A fuzzy set, on the other hand, is prescribed
by vague or ambiguous properties; hence, its boundaries are ambiguously specified, as
shown by the fuzzy boundary for set A~ in Figure 2.1b

1.8.1 Classical set ort Crisp set.

Define a universe of discourse, X, as a collection of objects all having the same characteristics.
The individual elements in the universe X will be denoted as x. The features of the elements in X
can be discrete, countable integers, or continuous valued quantities on the real line. Examples of
elements of various universes might be as follows:

1)the clock speeds of computer CPUs;

2)the operating currents of an electronic motor;

3)the operating temperature of a heat pump (in degrees Celsius);

4)the Richter magnitudes of an earthquake; the integers 1 to 10.

1.8.2 Operations on crisp sets

1.8.2 Properties of crisp set
 In classical, or crisp, sets the transition for an element in the universe between membership
and non membership in a given set is abrupt and well defined (said to be crisp). For
an element in a universe that contains fuzzy sets, this transition can be gradual. This
transition among various degrees of membership can be thought of as conforming to the
fact that the boundaries of the fuzzy sets are vague and ambiguous. Hence, membership
of an element from the universe in this set is measured by a function that attempts to
describe vagueness and ambiguity.

A fuzzy set, then, is a set containing elements that have varying degrees of membership
in the set. This idea is in contrast with classical, or crisp, sets because members of a crisp
set would not be members unless their membership is full, or complete, in that set (i.e., their
membership is assigned a value of 1). Elements in a fuzzy set, because their membership
need not be complete, can also be members of other fuzzy sets on the same universe.

A notation convention for fuzzy sets when the universe of discourse, X, is discrete
and finite, is as follows for a fuzzy set A

When the universe, X, is continuous and infinite, the fuzzy set A is denoted as
1.8.3 Fuzzy set operations
The fuzzy sets A~, B~ & C~ are on the universe X. For an element x the following
function- theoretic operations are performed.
Demorgans theorem associated with the fuzzy set is same as that of the classical sets.

But the excluded middle axioms are not true for fuzzy sets since set A~ and its compliment
overlaps