Digital Audio Watermarking - A Digital Defense against Digital Piracy
(Literature Overview and Initial Development of Algorithm)
Watermarking has been known to world since the production of paper; appearing as the
identification marks on produced
Functions, Sequence &Sums
Let A and B be nonempty sets.
A functions f from A to B is assignment of
exactly one element of B to each element of A.
f : A B.
If f is a function from A to B.
A is the domain of f.
B is the codomain of
Set Operations and Functions
Truth Sets of Quantifiers
Given a predicate P, and a domain D, we define
the truth set of P to be the elements x in D for
which P(x) is true.
, the truth set of P is the set cfw_-1,
the truth set of Q is empty se
Sets and Sets Operations
Definition: A Set is an unordered collection of
Elements: The objects in a set are called
elements, or members, of the set. A set said to
contain its elements.
The set of all vowels in English al
Methods for Proving Theorems
An argument is a sequence of propositions. The final proposition is called the
conclusion of the argument while the other propositions are called the
premises or hypotheses of the argument.
Ali ahmed (FA14-BCS-051)
M Faisal Hafeez(FA14-BCS-092)
DFS is a systematic method of visiting the
vertices of a graph/tree.
Breadth First Search
: Group Members
Breadth-first search(BFS) is analgorithmfor traversing or
searchingtreeorgraphdata structures. It start